Lines Matching refs:i
104 size_t i; in longcmp() local
106 for (i = 0; i < n; i++) { in longcmp()
107 if (l1[i] < l2[i]) in longcmp()
109 if (l1[i] > l2[i]) in longcmp()
118 size_t i; in longcpy() local
120 for (i = 0; i < n; i++) in longcpy()
121 dest[i] = src[i]; in longcpy()
127 size_t i; in longset() local
129 for (i = 0; i < n; i++) in longset()
130 s[i] = c; in longset()
137 int i; in dec_key() local
139 for (i = geo->keylen - 1; i >= 0; i--) { in dec_key()
140 val = key[i]; in dec_key()
141 key[i] = val - 1; in dec_key()
231 int i; in keyzero() local
233 for (i = 0; i < geo->keylen; i++) in keyzero()
234 if (key[i]) in keyzero()
243 int i, height = head->height; in btree_lookup_node() local
250 for (i = 0; i < geo->no_pairs; i++) in btree_lookup_node()
251 if (keycmp(geo, node, i, key) <= 0) in btree_lookup_node()
253 if (i == geo->no_pairs) in btree_lookup_node()
255 node = bval(geo, node, i); in btree_lookup_node()
265 int i; in btree_lookup() local
272 for (i = 0; i < geo->no_pairs; i++) in btree_lookup()
273 if (keycmp(geo, node, i, key) == 0) in btree_lookup()
274 return bval(geo, node, i); in btree_lookup()
282 int i; in btree_update() local
289 for (i = 0; i < geo->no_pairs; i++) in btree_update()
290 if (keycmp(geo, node, i, key) == 0) { in btree_update()
291 setval(geo, node, i, val); in btree_update()
309 int i, height; in btree_get_prev() local
324 for (i = 0; i < geo->no_pairs; i++) in btree_get_prev()
325 if (keycmp(geo, node, i, key) <= 0) in btree_get_prev()
327 if (i == geo->no_pairs) in btree_get_prev()
330 node = bval(geo, node, i); in btree_get_prev()
333 retry_key = bkey(geo, oldnode, i); in btree_get_prev()
339 for (i = 0; i < geo->no_pairs; i++) { in btree_get_prev()
340 if (keycmp(geo, node, i, key) <= 0) { in btree_get_prev()
341 if (bval(geo, node, i)) { in btree_get_prev()
342 longcpy(__key, bkey(geo, node, i), geo->keylen); in btree_get_prev()
343 return bval(geo, node, i); in btree_get_prev()
361 int i; in getpos() local
363 for (i = 0; i < geo->no_pairs; i++) { in getpos()
364 if (keycmp(geo, node, i, key) <= 0) in getpos()
367 return i; in getpos()
372 int i; in getfill() local
374 for (i = start; i < geo->no_pairs; i++) in getfill()
375 if (!bval(geo, node, i)) in getfill()
377 return i; in getfill()
387 int i, height; in find_level() local
390 for (i = 0; i < geo->no_pairs; i++) in find_level()
391 if (keycmp(geo, node, i, key) <= 0) in find_level()
394 if ((i == geo->no_pairs) || !bval(geo, node, i)) { in find_level()
398 i--; in find_level()
399 setkey(geo, node, i, key); in find_level()
401 BUG_ON(i < 0); in find_level()
402 node = bval(geo, node, i); in find_level()
448 int i, pos, fill, err; in btree_insert_level() local
478 for (i = 0; i < fill / 2; i++) { in btree_insert_level()
479 setkey(geo, new, i, bkey(geo, node, i)); in btree_insert_level()
480 setval(geo, new, i, bval(geo, node, i)); in btree_insert_level()
481 setkey(geo, node, i, bkey(geo, node, i + fill / 2)); in btree_insert_level()
482 setval(geo, node, i, bval(geo, node, i + fill / 2)); in btree_insert_level()
483 clearpair(geo, node, i + fill / 2); in btree_insert_level()
486 setkey(geo, node, i, bkey(geo, node, fill - 1)); in btree_insert_level()
487 setval(geo, node, i, bval(geo, node, fill - 1)); in btree_insert_level()
495 for (i = fill; i > pos; i--) { in btree_insert_level()
496 setkey(geo, node, i, bkey(geo, node, i - 1)); in btree_insert_level()
497 setval(geo, node, i, bval(geo, node, i - 1)); in btree_insert_level()
520 int i; in merge() local
522 for (i = 0; i < rfill; i++) { in merge()
524 setkey(geo, left, lfill + i, bkey(geo, right, i)); in merge()
525 setval(geo, left, lfill + i, bval(geo, right, i)); in merge()
539 int i, no_left, no_right; in rebalance() local
552 i = getpos(geo, parent, key); in rebalance()
553 BUG_ON(bval(geo, parent, i) != child); in rebalance()
555 if (i > 0) { in rebalance()
556 left = bval(geo, parent, i - 1); in rebalance()
562 parent, i - 1); in rebalance()
566 if (i + 1 < getfill(geo, parent, i)) { in rebalance()
567 right = bval(geo, parent, i + 1); in rebalance()
573 parent, i); in rebalance()
590 int i, pos, fill; in btree_remove_level() local
608 for (i = pos; i < fill - 1; i++) { in btree_remove_level()
609 setkey(geo, node, i, bkey(geo, node, i + 1)); in btree_remove_level()
610 setval(geo, node, i, bval(geo, node, i + 1)); in btree_remove_level()
678 int i; in __btree_for_each() local
681 for (i = 0; i < geo->no_pairs; i++) { in __btree_for_each()
682 child = bval(geo, node, i); in __btree_for_each()
689 func(child, opaque, bkey(geo, node, i), count++, in __btree_for_each()