diff options
author | Mike Pall <mike> | 2019-12-08 19:50:36 +0100 |
---|---|---|
committer | Mike Pall <mike> | 2019-12-08 19:50:36 +0100 |
commit | 1d9a337de6630746e3e8580aa855c0376c67d356 (patch) | |
tree | 17789d6e157442c8ec6c400a97bccc057d43be31 /src/lj_tab.c | |
parent | 05898a8824f119d586e5fb079f1e66d8cac38160 (diff) | |
parent | de48d000941f58a8d4d816e9d227de8a4f3c9de6 (diff) | |
download | luajit-1d9a337de6630746e3e8580aa855c0376c67d356.tar.gz luajit-1d9a337de6630746e3e8580aa855c0376c67d356.tar.bz2 luajit-1d9a337de6630746e3e8580aa855c0376c67d356.zip |
Merge branch 'master' into v2.1
Diffstat (limited to 'src/lj_tab.c')
-rw-r--r-- | src/lj_tab.c | 9 |
1 files changed, 4 insertions, 5 deletions
diff --git a/src/lj_tab.c b/src/lj_tab.c index c51666d3..e77a7af5 100644 --- a/src/lj_tab.c +++ b/src/lj_tab.c | |||
@@ -486,8 +486,7 @@ TValue *lj_tab_newkey(lua_State *L, GCtab *t, cTValue *key) | |||
486 | /* Rechain pseudo-resurrected string keys with colliding hashes. */ | 486 | /* Rechain pseudo-resurrected string keys with colliding hashes. */ |
487 | while (nextnode(freenode)) { | 487 | while (nextnode(freenode)) { |
488 | Node *nn = nextnode(freenode); | 488 | Node *nn = nextnode(freenode); |
489 | if (tvisstr(&nn->key) && !tvisnil(&nn->val) && | 489 | if (!tvisnil(&nn->val) && hashkey(t, &nn->key) == n) { |
490 | hashstr(t, strV(&nn->key)) == n) { | ||
491 | freenode->next = nn->next; | 490 | freenode->next = nn->next; |
492 | nn->next = n->next; | 491 | nn->next = n->next; |
493 | setmref(n->next, nn); | 492 | setmref(n->next, nn); |
@@ -500,9 +499,9 @@ TValue *lj_tab_newkey(lua_State *L, GCtab *t, cTValue *key) | |||
500 | ** any string key that's currently in a non-main positions. | 499 | ** any string key that's currently in a non-main positions. |
501 | */ | 500 | */ |
502 | while ((nn = nextnode(freenode))) { | 501 | while ((nn = nextnode(freenode))) { |
503 | if (tvisstr(&nn->key) && !tvisnil(&nn->val)) { | 502 | if (!tvisnil(&nn->val)) { |
504 | Node *mn = hashstr(t, strV(&nn->key)); | 503 | Node *mn = hashkey(t, &nn->key); |
505 | if (mn != freenode) { | 504 | if (mn != freenode && mn != nn) { |
506 | freenode->next = nn->next; | 505 | freenode->next = nn->next; |
507 | nn->next = mn->next; | 506 | nn->next = mn->next; |
508 | setmref(mn->next, nn); | 507 | setmref(mn->next, nn); |