diff options
| -rw-r--r-- | src/lj_tab.c | 23 |
1 files changed, 23 insertions, 0 deletions
diff --git a/src/lj_tab.c b/src/lj_tab.c index 50f447e8..f2f3c0b0 100644 --- a/src/lj_tab.c +++ b/src/lj_tab.c | |||
| @@ -457,6 +457,29 @@ TValue *lj_tab_newkey(lua_State *L, GCtab *t, cTValue *key) | |||
| 457 | freenode->next = nn->next; | 457 | freenode->next = nn->next; |
| 458 | nn->next = n->next; | 458 | nn->next = n->next; |
| 459 | setmref(n->next, nn); | 459 | setmref(n->next, nn); |
| 460 | /* | ||
| 461 | ** Rechaining a resurrected string key creates a new dilemma: | ||
| 462 | ** Another string key may have originally been resurrected via | ||
| 463 | ** _any_ of the previous nodes as a chain anchor. Including | ||
| 464 | ** a node that had to be moved, which makes them unreachable. | ||
| 465 | ** It's not feasible to check for all previous nodes, so rechain | ||
| 466 | ** any string key that's currently in a non-main positions. | ||
| 467 | */ | ||
| 468 | while ((nn = nextnode(freenode))) { | ||
| 469 | if (tvisstr(&nn->key) && !tvisnil(&nn->val)) { | ||
| 470 | Node *mn = hashstr(t, strV(&nn->key)); | ||
| 471 | if (mn != freenode) { | ||
| 472 | freenode->next = nn->next; | ||
| 473 | nn->next = mn->next; | ||
| 474 | setmref(mn->next, nn); | ||
| 475 | } else { | ||
| 476 | freenode = nn; | ||
| 477 | } | ||
| 478 | } else { | ||
| 479 | freenode = nn; | ||
| 480 | } | ||
| 481 | } | ||
| 482 | break; | ||
| 460 | } else { | 483 | } else { |
| 461 | freenode = nn; | 484 | freenode = nn; |
| 462 | } | 485 | } |
