19  * search over an array. Binary search is a worst case scenario for branch
246 /* return greatest node <= @search, or -1 if not found */
248 				     cmp_func_t cmp, const void *search)  in eytzinger0_find_le()  argument
257 		n = eytzinger0_child(i, cmp(base + i * size, search) <= 0);  in eytzinger0_find_le()
262 		 * @i was greater than @search, return previous node:  in eytzinger0_find_le()
274 				     cmp_func_t cmp, const void *search)  in eytzinger0_find_gt()  argument
276 	ssize_t idx = eytzinger0_find_le(base, nr, size, cmp, search);  in eytzinger0_find_gt()
279 	 * if eytitzinger0_find_le() returned -1 - no element was <= search - we  in eytzinger0_find_gt()
290 				     cmp_func_t cmp, const void *search)  in eytzinger0_find_ge()  argument
292 	ssize_t idx = eytzinger0_find_le(base, nr, size, cmp, search);  in eytzinger0_find_ge()
294 	if (idx < nr && !cmp(base + idx * size, search))  in eytzinger0_find_ge()
300 #define eytzinger0_find(base, nr, size, _cmp, search)			\  argument
303 	const void *_search	= (search);				\