Lines Matching refs:i
105 size_t i; in longcmp() local
107 for (i = 0; i < n; i++) { in longcmp()
108 if (l1[i] < l2[i]) in longcmp()
110 if (l1[i] > l2[i]) in longcmp()
119 size_t i; in longcpy() local
121 for (i = 0; i < n; i++) in longcpy()
122 dest[i] = src[i]; in longcpy()
128 size_t i; in longset() local
130 for (i = 0; i < n; i++) in longset()
131 s[i] = c; in longset()
138 int i; in dec_key() local
140 for (i = geo->keylen - 1; i >= 0; i--) { in dec_key()
141 val = key[i]; in dec_key()
142 key[i] = val - 1; in dec_key()
232 int i; in keyzero() local
234 for (i = 0; i < geo->keylen; i++) in keyzero()
235 if (key[i]) in keyzero()
244 int i, height = head->height; in btree_lookup() local
251 for (i = 0; i < geo->no_pairs; i++) in btree_lookup()
252 if (keycmp(geo, node, i, key) <= 0) in btree_lookup()
254 if (i == geo->no_pairs) in btree_lookup()
256 node = bval(geo, node, i); in btree_lookup()
264 for (i = 0; i < geo->no_pairs; i++) in btree_lookup()
265 if (keycmp(geo, node, i, key) == 0) in btree_lookup()
266 return bval(geo, node, i); in btree_lookup()
274 int i, height = head->height; in btree_update() local
281 for (i = 0; i < geo->no_pairs; i++) in btree_update()
282 if (keycmp(geo, node, i, key) <= 0) in btree_update()
284 if (i == geo->no_pairs) in btree_update()
286 node = bval(geo, node, i); in btree_update()
294 for (i = 0; i < geo->no_pairs; i++) in btree_update()
295 if (keycmp(geo, node, i, key) == 0) { in btree_update()
296 setval(geo, node, i, val); in btree_update()
314 int i, height; in btree_get_prev() local
329 for (i = 0; i < geo->no_pairs; i++) in btree_get_prev()
330 if (keycmp(geo, node, i, key) <= 0) in btree_get_prev()
332 if (i == geo->no_pairs) in btree_get_prev()
335 node = bval(geo, node, i); in btree_get_prev()
338 retry_key = bkey(geo, oldnode, i); in btree_get_prev()
344 for (i = 0; i < geo->no_pairs; i++) { in btree_get_prev()
345 if (keycmp(geo, node, i, key) <= 0) { in btree_get_prev()
346 if (bval(geo, node, i)) { in btree_get_prev()
347 longcpy(__key, bkey(geo, node, i), geo->keylen); in btree_get_prev()
348 return bval(geo, node, i); in btree_get_prev()
366 int i; in getpos() local
368 for (i = 0; i < geo->no_pairs; i++) { in getpos()
369 if (keycmp(geo, node, i, key) <= 0) in getpos()
372 return i; in getpos()
377 int i; in getfill() local
379 for (i = start; i < geo->no_pairs; i++) in getfill()
380 if (!bval(geo, node, i)) in getfill()
382 return i; in getfill()
392 int i, height; in find_level() local
395 for (i = 0; i < geo->no_pairs; i++) in find_level()
396 if (keycmp(geo, node, i, key) <= 0) in find_level()
399 if ((i == geo->no_pairs) || !bval(geo, node, i)) { in find_level()
403 i--; in find_level()
404 setkey(geo, node, i, key); in find_level()
406 BUG_ON(i < 0); in find_level()
407 node = bval(geo, node, i); in find_level()
453 int i, pos, fill, err; in btree_insert_level() local
483 for (i = 0; i < fill / 2; i++) { in btree_insert_level()
484 setkey(geo, new, i, bkey(geo, node, i)); in btree_insert_level()
485 setval(geo, new, i, bval(geo, node, i)); in btree_insert_level()
486 setkey(geo, node, i, bkey(geo, node, i + fill / 2)); in btree_insert_level()
487 setval(geo, node, i, bval(geo, node, i + fill / 2)); in btree_insert_level()
488 clearpair(geo, node, i + fill / 2); in btree_insert_level()
491 setkey(geo, node, i, bkey(geo, node, fill - 1)); in btree_insert_level()
492 setval(geo, node, i, bval(geo, node, fill - 1)); in btree_insert_level()
500 for (i = fill; i > pos; i--) { in btree_insert_level()
501 setkey(geo, node, i, bkey(geo, node, i - 1)); in btree_insert_level()
502 setval(geo, node, i, bval(geo, node, i - 1)); in btree_insert_level()
525 int i; in merge() local
527 for (i = 0; i < rfill; i++) { in merge()
529 setkey(geo, left, lfill + i, bkey(geo, right, i)); in merge()
530 setval(geo, left, lfill + i, bval(geo, right, i)); in merge()
544 int i, no_left, no_right; in rebalance() local
557 i = getpos(geo, parent, key); in rebalance()
558 BUG_ON(bval(geo, parent, i) != child); in rebalance()
560 if (i > 0) { in rebalance()
561 left = bval(geo, parent, i - 1); in rebalance()
567 parent, i - 1); in rebalance()
571 if (i + 1 < getfill(geo, parent, i)) { in rebalance()
572 right = bval(geo, parent, i + 1); in rebalance()
578 parent, i); in rebalance()
595 int i, pos, fill; in btree_remove_level() local
613 for (i = pos; i < fill - 1; i++) { in btree_remove_level()
614 setkey(geo, node, i, bkey(geo, node, i + 1)); in btree_remove_level()
615 setval(geo, node, i, bval(geo, node, i + 1)); in btree_remove_level()
683 int i; in __btree_for_each() local
686 for (i = 0; i < geo->no_pairs; i++) { in __btree_for_each()
687 child = bval(geo, node, i); in __btree_for_each()
694 func(child, opaque, bkey(geo, node, i), count++, in __btree_for_each()