Searched refs:NODE_SIZE (Results 1 – 5 of 5) sorted by relevance
414 for (ix=1; ix < NODE_SIZE; ix++) in get_array_num()419 for (ix=0; ix < NODE_SIZE; ix++) in get_array_num()436 for (ix=0; ix < NODE_SIZE; ix++) in get_array_num()439 for (ix=0; ix < NODE_SIZE; ix++) in get_array_num()898 for (ix = 0; ix < NODE_SIZE; ix++) in free_a_tree()901 for (ix = 0; ix < NODE_SIZE; ix++) in free_a_tree()961 for (i=0; i<NODE_SIZE; i++) in copy_tree()968 for (i=0; i<NODE_SIZE; i++) in copy_tree()
140 bc_num n_num [NODE_SIZE];141 struct bc_array_node *n_down [NODE_SIZE];
66 #define NODE_SIZE 64 /* Must be a power of 2. */ macro
276 #define NODE_SIZE(node) \ macro633 datasize = NODE_SIZE(node) - sizeof(dns_rbtnode_t); in serialize_node()678 offset_adjust = dns_rbt_serialize_align(location + NODE_SIZE(node)); in serialize_nodes()901 datasize = NODE_SIZE(n) - sizeof(dns_rbtnode_t); in treefix()2905 isc_mem_put(rbt->mctx, node, NODE_SIZE(node)); in freenode()
100 #define NODE_SIZE(node) \261 return NODE_SIZE(node);2062 isc_mem_put(rbt->mctx, node, NODE_SIZE(node)); in deletefromlevel() 147 #define NODE_SIZE( global() macro