linux-master/lib/assoc_array.c

183 	pr_devel("-->%s()\n", __func__);
200 	pr_devel("segments[%d]: %lx\n", level, segments);
211 	pr_devel("consider slot %x [ix=%d type=%lu]\n",
221 		pr_devel("<--%s() = terminal_node\n", __func__);
243 	pr_devel("shortcut to %d\n", shortcut->skip_to_level);
351 	pr_devel("-->%s()\n", __func__);
355 		pr_devel("empty\n");
362 		pr_devel("[%d] shortcut\n", slot);
373 	pr_devel("[%d] node\n", slot);
380 	pr_devel("Node %p [back=%p]\n", node, node->back_pointer);
392 			pr_devel("[%d] free leaf\n", slot);
399 	pr_devel("free node\n");
412 		pr_devel("free shortcut\n");
421 	pr_devel("ascend to %p[%d]\n", parent, slot);
455 	pr_devel("-->%s()\n", __func__);
467 	pr_devel("<--%s() = ok [no root]\n", __func__);
492 	pr_devel("-->%s()\n", __func__);
513 			pr_devel("replace in slot %d\n", i);
516 			pr_devel("<--%s() = ok [replace]\n", __func__);
525 		pr_devel("insert in free slot %d\n", free_slot);
528 		pr_devel("<--%s() = ok [insert]\n", __func__);
549 	pr_devel("no spare slots\n");
565 		pr_devel("have meta\n");
575 	pr_devel("only leaves; dissimilarity=%lx\n", dissimilarity);
592 		pr_devel("present leaves cluster but not new leaf\n");
596 	pr_devel("split node\n");
620 	pr_devel("do_split_node\n");
639 	pr_devel("same slot: %x %x [%02x]\n", i, j, slot);
672 	pr_devel("filtered: f=%x n=%x\n", free_slot, next_slot);
710 	pr_devel("<--%s() = ok [split node]\n", __func__);
728 	pr_devel("all leaves cluster together\n");
759 	pr_devel("skip_to_level = %d [diff %d]\n", level, diff);
768 		pr_devel("blank off [%zu] %d: %lx\n", keylen - 1, level, blank);
809 	pr_devel("-->%s(ix=%d dis=%lx scix=%d)\n",
821 	pr_devel("diff=%d\n", diff);
847 		pr_devel("pre-shortcut %d...%d\n", level, diff);
869 		pr_devel("blank off [%zu] %d: %lx\n", keylen - 1, diff, blank);
872 		pr_devel("no pre-shortcut\n");
887 	pr_devel("new slot %lx >> %d -> %d\n",
897 		pr_devel("post-shortcut %d...%d\n", level, shortcut->skip_to_level);
920 		pr_devel("no post-shortcut\n");
940 	pr_devel("<--%s() = ok [split shortcut]\n", __func__);
971 	pr_devel("-->%s()\n", __func__);
1016 	pr_devel("enomem\n");
1090 	pr_devel("-->%s()\n", __func__);
1104 		pr_devel("terminal_node\n");
1120 		pr_devel("not found\n");
1143 		pr_devel("all gone\n");
1174 		pr_devel("leaves: %ld [m=%d]\n",
1182 		pr_devel("collapse subtree: %ld\n", parent->nr_leaves_on_branch);
1226 			pr_devel("collapsed %d,%lu\n", collapse.slot, new_n0->nr_leaves_on_branch);
1251 	pr_devel("enomem\n");
1279 	pr_devel("-->%s()\n", __func__);
1293 	pr_devel("all gone\n");
1306 	pr_devel("-->%s()\n", __func__);
1352 	pr_devel("-->%s()\n", __func__);
1414 	pr_devel("-->%s()\n", __func__);
1467 	pr_devel("-->%s()\n", __func__);
1497 		pr_devel("dup shortcut %p -> %p\n", shortcut, new_s);
1511 	pr_devel("dup node %p -> %p\n", node, new_n);
1541 	pr_devel("-- compress node %p --\n", new_n);
1555 	pr_devel("free=%d, leaves=%lu\n", nr_free, new_n->nr_leaves_on_branch);
1579 			pr_devel("[%d] fold node %lu/%d [nx %d]\n",
1605 			pr_devel("[%d] retain node %lu/%d [nx %d]\n",
1613 		pr_devel("internal nodes remain despite enough space, retrying\n");
1616 	pr_devel("after: %lu\n", new_n->nr_leaves_on_branch);
1628 			pr_devel("excise node %p with 1 shortcut\n", new_n);
1645 				pr_devel("excise preceding shortcut\n");
1681 			pr_devel("excise shortcut\n");
1722 	pr_devel("enomem\n");