find_cat.c 9.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292
  1. /*
  2. * this is an efficient C replacement for the find_cat.bac, the main source of
  3. * slowness in PPM. in my non-scientific tests, it processes the entire Trisquel
  4. * package database in 1.5 seconds, while find_cat.bac needs 1 second for each
  5. * of the 40,000 packages in the database.
  6. *
  7. * to build:
  8. * musl-gcc -static -O3 -fomit-frame-pointer -ffunction-sections -fdata-sections -fmerge-all-constants -Wl,--sort-common -Wl,-gc-sections -o find_cat find_cat.c
  9. * strip --strip-all -R .note -R .comment find_cat
  10. *
  11. * cheers,
  12. * iguleder, October 2015
  13. */
  14. #include <stdlib.h>
  15. #include <string.h>
  16. #include <stdio.h>
  17. #include <ctype.h>
  18. #define BUF_SIZE (32 * 1024)
  19. #define MAX_PKGS (60000)
  20. #define MAX_CATS (128)
  21. #define NAME_SIZE (64)
  22. #define DESC_SIZE (512)
  23. #define MAX_KWDS (512)
  24. static const unsigned long crc32_table[256] = {
  25. 0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F,
  26. 0xE963A535, 0x9E6495A3, 0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988,
  27. 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 0x1DB71064, 0x6AB020F2,
  28. 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7,
  29. 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9,
  30. 0xFA0F3D63, 0x8D080DF5, 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172,
  31. 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 0x35B5A8FA, 0x42B2986C,
  32. 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59,
  33. 0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423,
  34. 0xCFBA9599, 0xB8BDA50F, 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924,
  35. 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D, 0x76DC4190, 0x01DB7106,
  36. 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433,
  37. 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D,
  38. 0x91646C97, 0xE6635C01, 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E,
  39. 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 0x65B0D9C6, 0x12B7E950,
  40. 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65,
  41. 0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7,
  42. 0xA4D1C46D, 0xD3D6F4FB, 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0,
  43. 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 0x5005713C, 0x270241AA,
  44. 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F,
  45. 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81,
  46. 0xB7BD5C3B, 0xC0BA6CAD, 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A,
  47. 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 0xE3630B12, 0x94643B84,
  48. 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1,
  49. 0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB,
  50. 0x196C3671, 0x6E6B06E7, 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC,
  51. 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 0xD6D6A3E8, 0xA1D1937E,
  52. 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B,
  53. 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55,
  54. 0x316E8EEF, 0x4669BE79, 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236,
  55. 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 0xC5BA3BBE, 0xB2BD0B28,
  56. 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D,
  57. 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F,
  58. 0x72076785, 0x05005713, 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38,
  59. 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 0x86D3D2D4, 0xF1D4E242,
  60. 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777,
  61. 0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69,
  62. 0x616BFFD3, 0x166CCF45, 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2,
  63. 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 0xAED16A4A, 0xD9D65ADC,
  64. 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9,
  65. 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693,
  66. 0x54DE5729, 0x23D967BF, 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94,
  67. 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D
  68. };
  69. /* based on CRC-32 version 2.0.0 by Craig Bruce, 2006-04-29, public domain -
  70. * http://csbruce.com/software/crc32.c */
  71. static unsigned long crc32(const unsigned long in,
  72. const unsigned char *buf,
  73. const size_t len)
  74. {
  75. size_t i;
  76. unsigned long crc32;
  77. crc32 = in ^ 0xFFFFFFFF;
  78. for (i = 0; len > i; ++i)
  79. crc32 = (crc32 >> 8) ^ crc32_table[(crc32 ^ buf[i]) & 0xFF];
  80. return crc32 ^ 0xFFFFFFFF;
  81. }
  82. int main(int argc, char *argv[])
  83. {
  84. char desc[DESC_SIZE];
  85. char *namecats[MAX_CATS], *kwdcats[MAX_CATS];
  86. unsigned long *pkgs[MAX_CATS];
  87. char **kwds[MAX_CATS];
  88. int npkgs[MAX_CATS], nkwds[MAX_CATS];
  89. char *fields[11];
  90. char name[NAME_SIZE];
  91. unsigned long initcrc, crc;
  92. FILE *infp, *catf;
  93. char *buf, *pos, *nextpos, *iobuf;
  94. int nnamecats, nkwdcats, i, j, len;
  95. iobuf = malloc(BUF_SIZE);
  96. if (argc == 1)
  97. infp = stdin;
  98. else
  99. infp = fopen(argv[1], "r");
  100. setbuffer(infp, iobuf, BUF_SIZE);
  101. buf = malloc(BUF_SIZE);
  102. catf = fopen("/usr/local/petget/categories.dat", "r");
  103. if (NULL == catf) goto bail;
  104. initcrc = crc32(0, NULL, 0);
  105. nnamecats = nkwdcats = 0;
  106. while (NULL != fgets(buf, BUF_SIZE, catf)) {
  107. /* hash the names of the packages in each category */
  108. if ('P' == buf[0]) {
  109. pos = strchr(buf, '=');
  110. if (('"' == pos[1]) && ('"' == pos[2])) continue;
  111. pos[0] = '\0';
  112. pos += 3;
  113. pkgs[nnamecats] = malloc(sizeof(unsigned long) * MAX_PKGS);
  114. len = strlen(buf + 7);
  115. namecats[nnamecats] = strndup(buf + 7, len);
  116. for (i = 0; len > i; ++i) if ('_' == namecats[nnamecats][i]) namecats[nnamecats][i] = ';';
  117. npkgs[nnamecats] = 0;
  118. do {
  119. nextpos = strchr(pos, ' ');
  120. nextpos[0] = '\0';
  121. pkgs[nnamecats][npkgs[nnamecats]] = crc32(initcrc, (unsigned char *) pos, nextpos - pos);
  122. ++npkgs[nnamecats];
  123. if ('"' == nextpos[1]) break;
  124. pos = nextpos + 1;
  125. } while (1);
  126. ++nnamecats;
  127. /* list the keywords in each category */
  128. } else if ('K' == buf[0]) {
  129. pos = strchr(buf, '=');
  130. pos[0] = '\0';
  131. pos += 3;
  132. kwds[nkwdcats] = malloc(sizeof(char *) * MAX_KWDS);
  133. len = strlen(buf + 7);
  134. kwdcats[nkwdcats] = strndup(buf + 7, len);
  135. for (i = 0; len > i; ++i) if ('_' == kwdcats[nkwdcats][i]) kwdcats[nkwdcats][i] = ';';
  136. nkwds[nkwdcats] = 0;
  137. do {
  138. nextpos = strchr(pos, ' ');
  139. nextpos[0] = '\0';
  140. len = nextpos - pos;
  141. kwds[nkwdcats][nkwds[nkwdcats]] = malloc(len + 1);
  142. /* replace underscores with spaces - that's how categories.dat
  143. * specifies keywords with spaces */
  144. for (i = 0; len > i; ++i) if ('_' == pos[i]) pos[i] = ' ';
  145. memcpy(kwds[nkwdcats][nkwds[nkwdcats]], pos, len + 1);
  146. ++nkwds[nkwdcats];
  147. if ('"' == nextpos[1]) break;
  148. pos = nextpos + 1;
  149. } while (1);
  150. ++nkwdcats;
  151. }
  152. }
  153. while (NULL != fgets(buf, BUF_SIZE, infp)) {
  154. pos = buf;
  155. for (i = 0; 11 > i; ++i) {
  156. pos = strchr(pos, '|');
  157. if (NULL == pos) goto next;
  158. pos[0] = '\0';
  159. ++pos;
  160. fields[i] = pos;
  161. }
  162. /* try the most naive method first - look for known categories */
  163. len = strlen(fields[3]);
  164. if (len >= 3) {
  165. if (0 == strncmp(fields[3] + len - 3, "vcs", 3)) {
  166. fields[3] = "Utility;development";
  167. goto print;
  168. } else if (0 == strncmp(fields[3] + len - 3, "doc", 3)) {
  169. fields[3] = "Help";
  170. goto print;
  171. } else if (len >= 5) {
  172. if (0 == strncmp(fields[3] + len - 5, "admin", 5)) {
  173. fields[3] = "Setup";
  174. goto print;
  175. } else if (0 == strncmp(fields[3] + len - 5, "games", 5)) {
  176. fields[3] = "Fun";
  177. goto print;
  178. } else if (len >= 7) {
  179. if (0 == strncmp(fields[3] + len - 7, "science", 7)) {
  180. fields[3] = "Fun";
  181. goto print;
  182. }
  183. }
  184. }
  185. }
  186. if ((0 == strcmp(fields[9], "ubuntu")) ||
  187. (0 == strcmp(fields[9], "trisquel")) ||
  188. (0 == strcmp(fields[9], "debian")) ||
  189. (0 == strcmp(fields[9], "raspbian"))) {
  190. pos = strrchr(fields[5], '/');
  191. if (NULL == pos)
  192. strcpy(name, fields[5]);
  193. else
  194. strcpy(name, pos + 1);
  195. } else
  196. strcpy(name, fields[1]);
  197. /* convert the package name to lowercase */
  198. len = strlen(name);
  199. for (j = 0; len > j; ++j) name[j] = tolower(name[j]);
  200. crc = crc32(initcrc, (unsigned char *) name, len);
  201. /* libraries are always in the BuildingBlock section */
  202. if (0 == strncmp(name, "lib", 3)) {
  203. fields[3] = "BuildingBlock";
  204. goto print;
  205. }
  206. /* then, check if the package belongs to a category by name - we compare
  207. * hashes, so it's not that slow */
  208. for (i = 0; nnamecats > i; ++i) {
  209. for (j = 0; npkgs[i] > j; ++j) {
  210. if (crc == pkgs[i][j]) {
  211. fields[3] = namecats[i];
  212. goto print;
  213. }
  214. }
  215. }
  216. strcpy(desc, fields[8]);
  217. for (j = 0; strlen(desc) > j; ++j) desc[j] = tolower(desc[j]);
  218. /* check if the package belongs to a category by description keyword */
  219. for (i = 0; nkwdcats > i; ++i) {
  220. for (j = 0; nkwds[i] > j; ++j) {
  221. if (NULL != strstr(desc, kwds[i][j])) {
  222. fields[3] = kwdcats[i];
  223. goto print;
  224. }
  225. }
  226. }
  227. print:
  228. fputs(fields[0], stdout);
  229. putc('_', stdout);
  230. fputs(fields[1], stdout);
  231. putc('|', stdout);
  232. for (i = 0; 10 > i; ++i) {
  233. fputs(fields[i], stdout);
  234. putc('|', stdout);
  235. }
  236. fputs(fields[10], stdout);
  237. next:
  238. ;
  239. }
  240. for (--nkwdcats; 0 <= nkwdcats; --nkwdcats) {
  241. for (i = 0; nkwds[nkwdcats] > i; ++i) free(kwds[nkwdcats][i]);
  242. free(kwds[nkwdcats]);
  243. free(kwdcats[nkwdcats]);
  244. }
  245. for (--nnamecats; 0 <= nnamecats; --nnamecats) {
  246. free(pkgs[nnamecats]);
  247. free(namecats[nnamecats]);
  248. }
  249. fclose(catf);
  250. bail:
  251. free(buf);
  252. if (argc != 1) fclose(infp);
  253. free(iobuf);
  254. return EXIT_SUCCESS;
  255. }