Lines Matching defs:search
94 uint search;
160 * search for the xad entry covering the logical extent
162 //search:
171 * N.B. search may have failed (e.g., hole in sparse file),
174 /* retrieve search result */
211 * function: search for the xad entry covering specified offset.
216 * nextp - address of next extent (if any) for search miss
219 * flag - search process flag (XT_INSERT);
222 * btstack contains (bn, index) of search path traversed to the entry.
242 INCREMENT(xtStat.search);
249 * search down tree from root:
254 * if entry with search key K is not found
255 * internal page search find the entry with largest key Ki
256 * less than K which point to the child page to search;
257 * leaf page search find the entry with smallest key Kj
260 * for empty tree, search key is greater than any key of the tree.
265 /* get/pin the page to search */
272 * once search narrowed down into the target leaf,
315 * stop heuristic search
331 * if miss, where new entry with search key is
345 /* save search result */
361 /* well, ... full search now */
366 * binary search with search key K on the current page
374 * search hit
376 /* search hit - leaf page:
392 /* save search result */
409 /* search hit - internal page:
410 * descend/search its child page
424 * search miss
427 * search key (K) and may be zero or maxentry index.
432 * search miss - leaf page:
435 * search key K is to be inserted.
450 /* save search result */
471 * search miss - non-leaf page:
474 * entry of the child page to search.
545 * search for the entry location at which to insert:
555 /* retrieve search result */
794 * that were traversed during the search for the page that split.
1305 * at any level of the tree to be less than any search key.
1371 /* retrieve search result */
1538 /* retrieve search result */
1719 /* retrieve search result */
2033 /* retrieve search result */
2184 * search for the entry location at which to insert:
2194 /* retrieve search result */
2589 /* search in leaf entry */
2594 /* retrieve search result */
2610 /* search in internal entry */
2615 /* retrieve search result */
2863 * function: search for the internal xad entry covering specified extent.
2871 * flag - search process flag;
2874 * btstack contains (bn, index) of search path traversed to the entry.
2899 * search down tree from root:
2904 * if entry with search key K is not found
2905 * internal page search find the entry with largest key Ki
2906 * less than K which point to the child page to search;
2907 * leaf page search find the entry with smallest key Kj
2910 * for empty tree, search key is greater than any key of the tree.
2915 /* get/pin the page to search */
2927 * binary search with search key K on the current page
2935 * search hit
2943 /* save search result */
2952 /* descend/search its child page */
2963 * search miss - non-leaf page:
2966 * search key (K) and may be zero or maxentry index.
2968 * entry of the child page to search.
3872 xtStat.search,