Lines Matching +defs:next +defs:depth
243 It is important to note that leaves are always at the same depth throughout
269 - a next pointer to implement a single-linked list for hash bucket
350 by a tree of this depth. (Twenty seven in our overview
353 depth - The number of levels currently in the tree.
362 depth and currently_mapped cells and finally checks that currently_mapped >=
366 manage the node about to be added. That happens in the next routine,
377 root_depth - a pointer to the cell recording the depth of the tree.
391 copies of array (tree root), depth and mapped (number of RPC nodes mapped by
428 depth = 3
452 decrement depth and head back up to the top of the loop.
456 depth = 2
489 and once again decrement depth.
494 depth = 1
498 The loop terminates if depth <= 1 (it will never be < 1, unless there is a
507 times. The loop is executed (depth-1) times, and the tree stores
508 rpc_ss_node_array_size to the depth power RPC nodes. At the time this is
510 so a tree with depth 3 stores 125,000 RPC nodes, and navigating this tree
535 When we reach a leaf node (depth == 1), return the content of the leaf node
751 struct rpc_ss_deleted_nodes_t *next;
762 struct rpc_ss_hash_entry_t *next; /* Single linked list of hash entries */
786 union rpc_ss_ptr_array_element_t *array_ptr; /* next level in array */
814 long depth; /* Number of levels in the */
869 ** depth -- Number of level in the multilevel array
883 long *depth,
917 (*depth)++;
921 trace_fid, "Expanding: array=%p depth=%ld, mapped=%ld\n",
922 array, *depth, *currently_mapped
926 rpc_ss_expand_array (array, currently_mapped, depth, num, p_mem_h);
973 long depth;
984 depth = *root_depth;
989 while (depth > 1)
1007 depth = depth - 1;
1052 while ((hash_entry->ptr != ptr) && (hash_entry->next))
1053 hash_entry = hash_entry->next;
1115 hash_entry->next = temp->next;
1116 temp->next = hash_entry;
1126 for (temp = get_hash_chain_head (str, ptr); temp; temp=temp->next)
1133 ** varying depth, multi-level array.
1137 &str->depth, num, ptr,
1220 p_delete_block->next = NULL;
1231 p_delete_block->next = p_node_table->deletes_list;
1290 p_delete_block = p_delete_block->next)
1304 p_delete_block = p_delete_block->next)
1388 long depth;
1423 depth = str->depth;
1427 while (depth > 1)
1443 depth = depth - 1;
1461 ** next highest node number will be associated with the specified
1744 ** next call to this routine for this node number, the unmarshalled
1810 /* Mark as already unmarshalled to be returned in next call */
1845 ** the next call to this routine, the unmarshalled flag will be set to
1894 /* Mark as already unmarshalled to be returned in next call */
2007 &(str->depth), 1, p_mem_h);