|
|
@ -8481,7 +8481,6 @@ mdb_cursor_del0(MDB_cursor *mc) |
|
|
|
return rc; |
|
|
|
return rc; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
ki = mc->mc_ki[mc->mc_top]; |
|
|
|
|
|
|
|
mp = mc->mc_pg[mc->mc_top]; |
|
|
|
mp = mc->mc_pg[mc->mc_top]; |
|
|
|
nkeys = NUMKEYS(mp); |
|
|
|
nkeys = NUMKEYS(mp); |
|
|
|
|
|
|
|
|
|
|
@ -8493,6 +8492,7 @@ mdb_cursor_del0(MDB_cursor *mc) |
|
|
|
if (m3->mc_snum < mc->mc_snum) |
|
|
|
if (m3->mc_snum < mc->mc_snum) |
|
|
|
continue; |
|
|
|
continue; |
|
|
|
if (m3->mc_pg[mc->mc_top] == mp) { |
|
|
|
if (m3->mc_pg[mc->mc_top] == mp) { |
|
|
|
|
|
|
|
if (m3->mc_ki[mc->mc_top] >= mc->mc_ki[mc->mc_top]) { |
|
|
|
/* if m3 points past last node in page, find next sibling */ |
|
|
|
/* if m3 points past last node in page, find next sibling */ |
|
|
|
if (m3->mc_ki[mc->mc_top] >= nkeys) { |
|
|
|
if (m3->mc_ki[mc->mc_top] >= nkeys) { |
|
|
|
rc = mdb_cursor_sibling(m3, 1); |
|
|
|
rc = mdb_cursor_sibling(m3, 1); |
|
|
@ -8504,8 +8504,6 @@ mdb_cursor_del0(MDB_cursor *mc) |
|
|
|
if (rc) |
|
|
|
if (rc) |
|
|
|
goto fail; |
|
|
|
goto fail; |
|
|
|
} |
|
|
|
} |
|
|
|
if (m3->mc_ki[mc->mc_top] >= ki || |
|
|
|
|
|
|
|
/* moved to right sibling */ m3->mc_pg[mc->mc_top] != mp) { |
|
|
|
|
|
|
|
if (m3->mc_xcursor && !(m3->mc_flags & C_EOF)) { |
|
|
|
if (m3->mc_xcursor && !(m3->mc_flags & C_EOF)) { |
|
|
|
MDB_node *node = NODEPTR(m3->mc_pg[m3->mc_top], m3->mc_ki[m3->mc_top]); |
|
|
|
MDB_node *node = NODEPTR(m3->mc_pg[m3->mc_top], m3->mc_ki[m3->mc_top]); |
|
|
|
/* If this node has dupdata, it may need to be reinited
|
|
|
|
/* If this node has dupdata, it may need to be reinited
|
|
|
|