【求助】匹配一个C文件 的函数列表

plp626

这是一个md5.c的C代码文件，
匹配结果：
static void byteReverse(unsigned char *buf, unsigned longs)
void MD5Init(MD5_CTX *ctx)
static void MD5Transform(uint32_t buf[4], uint32_t const in[16])
void MD5Update(MD5_CTX *ctx, unsigned char const *buf, unsigned len)
void MD5Final(unsigned char digest[16], MD5_CTX *ctx)

1. /*
   
2. * This code implements the MD5 message-digest algorithm.
   
3. * The algorithm is due to Ron Rivest.  This code was
   
4. * written by Colin Plumb in 1993, no copyright is claimed.
   
5. * This code is in the public domain; do with it what you wish.
   
6. *
   
7. * Equivalent code is available from RSA Data Security, Inc.
   
8. * This code has been tested against that, and is equivalent,
   
9. * except that you don't need to include two pages of legalese
   
10. * with every copy.
    
11. *
    
12. * To compute the message digest of a chunk of bytes, declare an
    
13. * MD5Context structure, pass it to MD5Init, call MD5Update as
    
14. * needed on buffers full of bytes, and then call MD5Final, which
    
15. * will fill a supplied 16-byte array with the digest.
    
16. */
    
17. 
    
18. #include "defs.h"
    
19. 
    
20. #ifndef HAVE_MD5
    
21. #if __BYTE_ORDER == 1234
    
22. #define byteReverse(buf, len)        /* Nothing */
    
23. #else
    
24. /*
    
25. * Note: this code is harmless on little-endian machines.
    
26. */
    
27. static void byteReverse(unsigned char *buf, unsigned longs)
    
28. {
    
29.         uint32_t t;
    
30.         do {
    
31.                 t = (uint32_t) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
    
32.                         ((unsigned) buf[1] << 8 | buf[0]);
    
33.                 *(uint32_t *) buf = t;
    
34.                 buf += 4;
    
35.         } while (--longs);
    
36. }
    
37. #endif /* __BYTE_ORDER */
    
38. 
    
39. /* The four core functions - F1 is optimized somewhat */
    
40. 
    
41. /* #define F1(x, y, z) (x & y | ~x & z) */
    
42. #define F1(x, y, z) (z ^ (x & (y ^ z)))
    
43. #define F2(x, y, z) F1(z, x, y)
    
44. #define F3(x, y, z) (x ^ y ^ z)
    
45. #define F4(x, y, z) (y ^ (x | ~z))
    
46. 
    
47. /* This is the central step in the MD5 algorithm. */
    
48. #define MD5STEP(f, w, x, y, z, data, s) \
    
49. ( w += f(x, y, z) + data,  w = w<<s | w>>(32-s),  w += x )
    
50. 
    
51. /*
    
52. * Start MD5 accumulation.  Set bit count to 0 and buffer to mysterious
    
53. * initialization constants.
    
54. */
    
55. void MD5Init(MD5_CTX *ctx)
    
56. {
    
57.         ctx->buf[0] = 0x67452301;
    
58.         ctx->buf[1] = 0xefcdab89;
    
59.         ctx->buf[2] = 0x98badcfe;
    
60.         ctx->buf[3] = 0x10325476;
    
61. 
    
62.         ctx->bits[0] = 0;
    
63.         ctx->bits[1] = 0;
    
64. }
    
65. 
    
66. /*
    
67. * The core of the MD5 algorithm, this alters an existing MD5 hash to
    
68. * reflect the addition of 16 longwords of new data.  MD5Update blocks
    
69. * the data and converts bytes into longwords for this routine.
    
70. */
    
71. static void MD5Transform(uint32_t buf[4], uint32_t const in[16])
    
72. {
    
73.         register uint32_t a, b, c, d;
    
74. 
    
75.         a = buf[0];
    
76.         b = buf[1];
    
77.         c = buf[2];
    
78.         d = buf[3];
    
79. 
    
80.         MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
    
81.         MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
    
82.         MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
    
83.         MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
    
84.         MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
    
85.         MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
    
86.         MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
    
87.         MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
    
88.         MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
    
89.         MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
    
90.         MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
    
91.         MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
    
92.         MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
    
93.         MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
    
94.         MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
    
95.         MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
    
96. 
    
97.         MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
    
98.         MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
    
99.         MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
    
100.         MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
     
101.         MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
     
102.         MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
     
103.         MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
     
104.         MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
     
105.         MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
     
106.         MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
     
107.         MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
     
108.         MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
     
109.         MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
     
110.         MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
     
111.         MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
     
112.         MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
     
113. 
     
114.         MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
     
115.         MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
     
116.         MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
     
117.         MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
     
118.         MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
     
119.         MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
     
120.         MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
     
121.         MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
     
122.         MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
     
123.         MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
     
124.         MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
     
125.         MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
     
126.         MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
     
127.         MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
     
128.         MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
     
129.         MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
     
130. 
     
131.         MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
     
132.         MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
     
133.         MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
     
134.         MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
     
135.         MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
     
136.         MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
     
137.         MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
     
138.         MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
     
139.         MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
     
140.         MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
     
141.         MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
     
142.         MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
     
143.         MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
     
144.         MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
     
145.         MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
     
146.         MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
     
147. 
     
148.         buf[0] += a;
     
149.         buf[1] += b;
     
150.         buf[2] += c;
     
151.         buf[3] += d;
     
152. }
     
153. 
     
154. /*
     
155. * Update context to reflect the concatenation of another buffer full
     
156. * of bytes.
     
157. */
     
158. void
     
159. MD5Update(MD5_CTX *ctx,
     
160.                  unsigned char const *buf,
     
161.                  unsigned len)
     
162. {
     
163.         uint32_t t;
     
164. 
     
165.         /* Update bitcount */
     
166. 
     
167.         t = ctx->bits[0];
     
168.         if ((ctx->bits[0] = t + ((uint32_t) len << 3)) < t)
     
169.                 ctx->bits[1]++;                /* Carry from low to high */
     
170.         ctx->bits[1] += len >> 29;
     
171. 
     
172.         t = (t >> 3) & 0x3f;        /* Bytes already in shsInfo->data */
     
173. 
     
174.         /* Handle any leading odd-sized chunks */
     
175. 
     
176.         if (t) {
     
177.                 unsigned char *p = (unsigned char *) ctx->in + t;
     
178. 
     
179.                 t = 64 - t;
     
180.                 if (len < t) {
     
181.                         memcpy(p, buf, len);
     
182.                         return;
     
183.                 }
     
184.                 memcpy(p, buf, t);
     
185.                 byteReverse(ctx->in, 16);
     
186.                 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
     
187.                 buf += t;
     
188.                 len -= t;
     
189.         }
     
190.         /* Process data in 64-byte chunks */
     
191. 
     
192.         while (len >= 64) {
     
193.                 memcpy(ctx->in, buf, 64);
     
194.                 byteReverse(ctx->in, 16);
     
195.                 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
     
196.                 buf += 64;
     
197.                 len -= 64;
     
198.         }
     
199. 
     
200.         /* Handle any remaining bytes of data. */
     
201. 
     
202.         memcpy(ctx->in, buf, len);
     
203. }
     
204. 
     
205. /*
     
206. * Final wrapup - pad to 64-byte boundary with the bit pattern
     
207. * 1 0* (64-bit count of bits processed, MSB-first)
     
208. */
     
209. void
     
210. MD5Final(unsigned char digest[16], MD5_CTX *ctx) // do what?
     
211. {
     
212.         unsigned count;
     
213.         unsigned char *p;
     
214. 
     
215.         /* Compute number of bytes mod 64 */
     
216.         count = (ctx->bits[0] >> 3) & 0x3F;
     
217. 
     
218.         /* Set the first char of padding to 0x80.  This is safe since there is
     
219.            always at least one byte free */
     
220.         p = ctx->in + count;
     
221.         *p++ = 0x80;
     
222. 
     
223.         /* Bytes of padding needed to make 64 bytes */
     
224.         count = 64 - 1 - count;
     
225. 
     
226.         /* Pad out to 56 mod 64 */
     
227.         if (count < 8) {
     
228.                 /* Two lots of padding:  Pad the first block to 64 bytes */
     
229.                 memset(p, 0, count);
     
230.                 byteReverse(ctx->in, 16);
     
231.                 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
     
232. 
     
233.                 /* Now fill the next block with 56 bytes */
     
234.                 memset(ctx->in, 0, 56);
     
235.         } else {
     
236.                 /* Pad block to 56 bytes */
     
237.                 memset(p, 0, count - 8);
     
238.         }
     
239.         byteReverse(ctx->in, 14);
     
240. 
     
241.         /* Append length in bits and transform */
     
242.         ((uint32_t *) ctx->in)[14] = ctx->bits[0];
     
243.         ((uint32_t *) ctx->in)[15] = ctx->bits[1];
     
244. 
     
245.         MD5Transform(ctx->buf, (uint32_t *) ctx->in);
     
246.         byteReverse((unsigned char *) ctx->buf, 4);
     
247.         memcpy(digest, ctx->buf, 16);
     
248.         memset((char *) ctx, 0, sizeof(ctx));        /* In case it's sensitive */
     
249. }
     
250. 
     
251. #endif /* !HAVE_MD5 */

复制代码

rubyish

1. #!/usr/bin/perl
   
2. use 5.016;
   
3. my $s = do {local $/; <DATA>};
   
4. while ($s =~ /^((?:static|void).*?\))/msg){
   
5.         my $p = $1;
   
6.         $p =~ s/\n/ /g;
   
7.         say $p;
   
8. }
   
9. __DATA__
   
10. /*
    
11. * This code implements the MD5 message-digest algorithm.
    
12. * The algorithm is due to Ron Rivest.  This code was
    
13. .
    
14. .
    

复制代码

plp626

回复 2# rubyish


    我的perl是5.6版本的，运行你的代码什么也没输出。。

rubyish

回复 3# plp626

1. #!/usr/bin/perl
   
2. open my $m, 'md5.c';
   
3. my $s = do { local $/; <$m> };
   
4. while ( $s =~ /^((?:static|void).*?\))/msg ) {
   
5.     my $p = $1;
   
6.     $p =~ s/\n/ /g;
   
7.     print $p, $/;
   
8. }

复制代码

plp626

两个代码一样，不过我找到原因了，谢     谢；

Perlvim

什么原因，说说？能用Perl 5.6 的系统，一定是古董级的电脑。