Lines Matching defs:nodes
658 /* Locks the tree structure (prevents nodes appearing/disappearing) */
660 /* Locks for individual tree nodes */
689 * Temporary storage for stale cache nodes and dynamically deleted
690 * nodes that await being cleaned up.
1152 * Work out how many nodes can be deleted in the time between two
1154 * as a estimate for the number of nodes to be deleted in the next
1163 unsigned int nodes;
1176 * Double the nodes deleted next time.
1183 nodes = old * interval;
1184 nodes /= (unsigned int)usecs;
1185 if (nodes == 0)
1186 nodes = 1;
1187 else if (nodes > 1000)
1188 nodes = 1000;
1191 nodes = (nodes + old * 3) / 4;
1193 if (nodes != old)
1196 "adjust_quantum: old=%d, new=%d", old, nodes);
1198 return (nodes);
1231 * We assume the number of remaining dead nodes is reasonably small;
1232 * the overhead of unlinking all nodes here should be negligible.
1398 * may be nodes in use.
2091 * Clean up dead nodes. These are nodes which have no references, and
2148 * nodes.
2150 * few cases where the node can be in the deadnode list (only empty nodes can
2275 * we will add this node to a linked list of nodes in this locking
2435 * if the node is in the dead-nodes list, extract it
2897 * sure that stale nodes will be removed in
2899 * those nodes could miss the chance to be removed
2919 * This is a good opportunity to purge any dead nodes,
3905 * must have found nodes in the main tree with NSEC
3932 * nodes in the auxiliary tree that are awaiting deletion.
4053 * records of any nodes obscured by a zone
7290 * need to examine many irrelevant nodes in large TLDs.
7292 * Add nodes to the auxiliary tree after corresponding nodes have
7547 * TODO CKB: since this is read-write (had to be to add nodes later)
7548 * we will need to lock the file or the nodes in it before modifying
7549 * the nodes in the file.
9289 * "flush_deletions: 59 nodes of 41 in tree". This means
9290 * That some nodes appear on the deletions list more than
9295 "flush_deletions: %d nodes of %d in tree",