236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
|
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
|
-
+
|
*/
for (idx1 = 0; idx1 < bucket_count; idx1++) {
fprintf(outfp, "\tstatic const long pathIndex_hashTable_%i[] = {\n", idx1);
fprintf(outfp, "\t\t");
first_entry = 1;
for (idx2 = 0; idx2 < xvfs_state->child_count; idx2++) {
check_hash = adler32(0, xvfs_state->children[idx2], strlen(xvfs_state->children[idx2])) % bucket_count;
check_hash = adler32(0, (unsigned char *) xvfs_state->children[idx2], strlen(xvfs_state->children[idx2])) % bucket_count;
if (check_hash != idx1) {
continue;
}
if (!first_entry) {
fprintf(outfp, ", ");
}
|
408
409
410
411
412
413
414
415
416
417
418
419
420
421
|
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
|
+
+
|
*tcl_buffer_p = ch;
tcl_buffer_p++;
break;
}
}
#undef parse_xvfs_minirivet_getbyte
fclose(fp);
return(1);
}
static int xvfs_create(FILE *outfp, const struct options * const options) {
return(parse_xvfs_minirivet(outfp, "lib/xvfs/xvfs.c.rvt", options));
}
|