Lines Matching refs:geo
135 static void dec_key(struct btree_geo *geo, unsigned long *key)
140 for (i = geo->keylen - 1; i >= 0; i--) {
148 static unsigned long *bkey(struct btree_geo *geo, unsigned long *node, int n)
150 return &node[n * geo->keylen];
153 static void *bval(struct btree_geo *geo, unsigned long *node, int n)
155 return (void *)node[geo->no_longs + n];
158 static void setkey(struct btree_geo *geo, unsigned long *node, int n,
161 longcpy(bkey(geo, node, n), key, geo->keylen);
164 static void setval(struct btree_geo *geo, unsigned long *node, int n,
167 node[geo->no_longs + n] = (unsigned long) val;
170 static void clearpair(struct btree_geo *geo, unsigned long *node, int n)
172 longset(bkey(geo, node, n), 0, geo->keylen);
173 node[geo->no_longs + n] = 0;
207 void *btree_last(struct btree_head *head, struct btree_geo *geo,
217 node = bval(geo, node, 0);
219 longcpy(key, bkey(geo, node, 0), geo->keylen);
220 return bval(geo, node, 0);
224 static int keycmp(struct btree_geo *geo, unsigned long *node, int pos,
227 return longcmp(bkey(geo, node, pos), key, geo->keylen);
230 static int keyzero(struct btree_geo *geo, unsigned long *key)
234 for (i = 0; i < geo->keylen; i++)
241 static void *btree_lookup_node(struct btree_head *head, struct btree_geo *geo,
251 for (i = 0; i < geo->no_pairs; i++)
252 if (keycmp(geo, node, i, key) <= 0)
254 if (i == geo->no_pairs)
256 node = bval(geo, node, i);
263 void *btree_lookup(struct btree_head *head, struct btree_geo *geo,
269 node = btree_lookup_node(head, geo, key);
273 for (i = 0; i < geo->no_pairs; i++)
274 if (keycmp(geo, node, i, key) == 0)
275 return bval(geo, node, i);
280 int btree_update(struct btree_head *head, struct btree_geo *geo,
286 node = btree_lookup_node(head, geo, key);
290 for (i = 0; i < geo->no_pairs; i++)
291 if (keycmp(geo, node, i, key) == 0) {
292 setval(geo, node, i, val);
307 void *btree_get_prev(struct btree_head *head, struct btree_geo *geo,
314 if (keyzero(geo, __key))
319 longcpy(key, __key, geo->keylen);
321 dec_key(geo, key);
325 for (i = 0; i < geo->no_pairs; i++)
326 if (keycmp(geo, node, i, key) <= 0)
328 if (i == geo->no_pairs)
331 node = bval(geo, node, i);
334 retry_key = bkey(geo, oldnode, i);
340 for (i = 0; i < geo->no_pairs; i++) {
341 if (keycmp(geo, node, i, key) <= 0) {
342 if (bval(geo, node, i)) {
343 longcpy(__key, bkey(geo, node, i), geo->keylen);
344 return bval(geo, node, i);
351 longcpy(key, retry_key, geo->keylen);
359 static int getpos(struct btree_geo *geo, unsigned long *node,
364 for (i = 0; i < geo->no_pairs; i++) {
365 if (keycmp(geo, node, i, key) <= 0)
371 static int getfill(struct btree_geo *geo, unsigned long *node, int start)
375 for (i = start; i < geo->no_pairs; i++)
376 if (!bval(geo, node, i))
384 static unsigned long *find_level(struct btree_head *head, struct btree_geo *geo,
391 for (i = 0; i < geo->no_pairs; i++)
392 if (keycmp(geo, node, i, key) <= 0)
395 if ((i == geo->no_pairs) || !bval(geo, node, i)) {
400 setkey(geo, node, i, key);
403 node = bval(geo, node, i);
409 static int btree_grow(struct btree_head *head, struct btree_geo *geo,
419 fill = getfill(geo, head->node, 0);
420 setkey(geo, node, 0, bkey(geo, head->node, fill - 1));
421 setval(geo, node, 0, head->node);
428 static void btree_shrink(struct btree_head *head, struct btree_geo *geo)
437 fill = getfill(geo, node, 0);
439 head->node = bval(geo, node, 0);
444 static int btree_insert_level(struct btree_head *head, struct btree_geo *geo,
453 err = btree_grow(head, geo, gfp);
459 node = find_level(head, geo, key, level);
460 pos = getpos(geo, node, key);
461 fill = getfill(geo, node, pos);
463 BUG_ON(pos < fill && keycmp(geo, node, pos, key) == 0);
465 if (fill == geo->no_pairs) {
472 err = btree_insert_level(head, geo,
473 bkey(geo, node, fill / 2 - 1),
480 setkey(geo, new, i, bkey(geo, node, i));
481 setval(geo, new, i, bval(geo, node, i));
482 setkey(geo, node, i, bkey(geo, node, i + fill / 2));
483 setval(geo, node, i, bval(geo, node, i + fill / 2));
484 clearpair(geo, node, i + fill / 2);
487 setkey(geo, node, i, bkey(geo, node, fill - 1));
488 setval(geo, node, i, bval(geo, node, fill - 1));
489 clearpair(geo, node, fill - 1);
493 BUG_ON(fill >= geo->no_pairs);
497 setkey(geo, node, i, bkey(geo, node, i - 1));
498 setval(geo, node, i, bval(geo, node, i - 1));
500 setkey(geo, node, pos, key);
501 setval(geo, node, pos, val);
506 int btree_insert(struct btree_head *head, struct btree_geo *geo,
510 return btree_insert_level(head, geo, key, val, 1, gfp);
514 static void *btree_remove_level(struct btree_head *head, struct btree_geo *geo,
516 static void merge(struct btree_head *head, struct btree_geo *geo, int level,
525 setkey(geo, left, lfill + i, bkey(geo, right, i));
526 setval(geo, left, lfill + i, bval(geo, right, i));
529 setval(geo, parent, lpos, right);
530 setval(geo, parent, lpos + 1, left);
532 btree_remove_level(head, geo, bkey(geo, parent, lpos), level + 1);
536 static void rebalance(struct btree_head *head, struct btree_geo *geo,
547 btree_remove_level(head, geo, key, level + 1);
552 parent = find_level(head, geo, key, level + 1);
553 i = getpos(geo, parent, key);
554 BUG_ON(bval(geo, parent, i) != child);
557 left = bval(geo, parent, i - 1);
558 no_left = getfill(geo, left, 0);
559 if (fill + no_left <= geo->no_pairs) {
560 merge(head, geo, level,
567 if (i + 1 < getfill(geo, parent, i)) {
568 right = bval(geo, parent, i + 1);
569 no_right = getfill(geo, right, 0);
570 if (fill + no_right <= geo->no_pairs) {
571 merge(head, geo, level,
587 static void *btree_remove_level(struct btree_head *head, struct btree_geo *geo,
601 node = find_level(head, geo, key, level);
602 pos = getpos(geo, node, key);
603 fill = getfill(geo, node, pos);
604 if ((level == 1) && (keycmp(geo, node, pos, key) != 0))
606 ret = bval(geo, node, pos);
610 setkey(geo, node, i, bkey(geo, node, i + 1));
611 setval(geo, node, i, bval(geo, node, i + 1));
613 clearpair(geo, node, fill - 1);
615 if (fill - 1 < geo->no_pairs / 2) {
617 rebalance(head, geo, key, level, node, fill - 1);
619 btree_shrink(head, geo);
625 void *btree_remove(struct btree_head *head, struct btree_geo *geo,
631 return btree_remove_level(head, geo, key, 1);
636 struct btree_geo *geo, gfp_t gfp)
657 if (!btree_last(victim, geo, key))
659 val = btree_lookup(victim, geo, key);
660 err = btree_insert(target, geo, key, val, gfp);
665 longcpy(dup, key, geo->keylen);
666 btree_remove(victim, geo, dup);
672 static size_t __btree_for_each(struct btree_head *head, struct btree_geo *geo,
682 for (i = 0; i < geo->no_pairs; i++) {
683 child = bval(geo, node, i);
687 count = __btree_for_each(head, geo, child, opaque,
690 func(child, opaque, bkey(geo, node, i), count++,
742 size_t btree_visitor(struct btree_head *head, struct btree_geo *geo,
754 count = __btree_for_each(head, geo, head->node, opaque, func,
760 size_t btree_grim_visitor(struct btree_head *head, struct btree_geo *geo,
772 count = __btree_for_each(head, geo, head->node, opaque, func,