Searched refs:dxtrace (Results 1 - 2 of 2) sorted by relevance

/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/ext3/
H A Dnamei.c78 #define dxtrace(command) command macro
80 #define dxtrace(command) macro
404 dxtrace (printk("Look up %x", hash));
421 dxtrace(printk("."));
434 dxtrace(printk(","));
445 dxtrace(printk(" %x->%u\n", at == entries? 0: dx_get_hash(at), dx_get_block(at)));
575 dxtrace(printk("In htree dirblock_to_tree: block %d\n", block));
632 dxtrace(printk("In htree_fill_tree, start hash: %x:%x\n", start_hash,
694 dxtrace(printk("Fill tree: returned %d entries, next hash: %x\n",
882 dxtrace(print
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/ext4/
H A Dnamei.c77 #define dxtrace(command) command macro
79 #define dxtrace(command) macro
403 dxtrace(printk("Look up %x", hash));
420 dxtrace(printk("."));
433 dxtrace(printk(","));
444 dxtrace(printk(" %x->%u\n", at == entries? 0: dx_get_hash(at), dx_get_block(at)));
574 dxtrace(printk(KERN_INFO "In htree dirblock_to_tree: block %lu\n",
632 dxtrace(printk(KERN_DEBUG "In htree_fill_tree, start hash: %x:%x\n",
694 dxtrace(printk(KERN_DEBUG "Fill tree: returned %d entries, "
881 dxtrace(print
[all...]

Completed in 122 milliseconds