Lines Matching defs:first
42 * The first thing in the tree is the tree superblock. It tells you
68 * After figuring out the first, it becomes obvious that internal nodes have
181 * Note: node->bh must be NULL when this function is called the first time.
333 int first, last, mid;
357 first = 0;
359 while (last >= first) {
360 mid = (last + first) / 2;
361 befs_debug(sb, "first: %d, last: %d, mid: %d", first, last,
377 first = mid + 1;
406 * Get the first leafnode of the tree. See if the requested key is in that
444 /* seeks down to first leafnode, reads it into this_node */
528 * befs_btree_seekleaf - Find the first leafnode in the btree
537 * start of the first leaf node.
702 * @key1: pointer to the first key to be compared