diff options
Diffstat (limited to 'lib/libc/db/btree/bt_delete.c')
| -rw-r--r-- | lib/libc/db/btree/bt_delete.c | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/lib/libc/db/btree/bt_delete.c b/lib/libc/db/btree/bt_delete.c index fa2b1f4..aa191b6 100644 --- a/lib/libc/db/btree/bt_delete.c +++ b/lib/libc/db/btree/bt_delete.c @@ -146,7 +146,7 @@ __bt_stkacq(BTREE *t, PAGE **hp, CURSOR *c) pgno_t pgno; recno_t nextpg, prevpg; int exact, level; - + /* * Find the first occurrence of the key in the tree. Toss the * currently locked page so we don't hit an already-locked page. @@ -262,7 +262,7 @@ __bt_stkacq(BTREE *t, PAGE **hp, CURSOR *c) if ((h = mpool_get(t->bt_mp, prevpg, 0)) == NULL) return (1); } - + ret: mpool_put(t->bt_mp, h, 0); return ((*hp = mpool_get(t->bt_mp, c->pg.pgno, 0)) == NULL); @@ -390,7 +390,7 @@ __bt_pdelete(BTREE *t, PAGE *h) /* Get the parent page. */ if ((pg = mpool_get(t->bt_mp, parent->pgno, 0)) == NULL) return (RET_ERROR); - + idx = parent->index; bi = GETBINTERNAL(pg, idx); @@ -406,7 +406,7 @@ __bt_pdelete(BTREE *t, PAGE *h) * root page. If it's the rootpage, turn it back into an empty * leaf page. */ - if (NEXTINDEX(pg) == 1) + if (NEXTINDEX(pg) == 1) { if (pg->pgno == P_ROOT) { pg->lower = BTDATAOFF; pg->upper = t->bt_psize; @@ -416,7 +416,7 @@ __bt_pdelete(BTREE *t, PAGE *h) return (RET_ERROR); continue; } - else { + } else { /* Pack remaining key items at the end of the page. */ nksize = NBINTERNAL(bi->ksize); from = (char *)pg + pg->upper; @@ -551,7 +551,7 @@ __bt_curdel(BTREE *t, const DBT *key, PAGE *h, u_int idx) key = &c->key; } /* Check previous key, if not at the beginning of the page. */ - if (idx > 0) { + if (idx > 0) { e.page = h; e.index = idx - 1; if (__bt_cmp(t, key, &e) == 0) { |
