| 308 | |
| 309 | |
| 310 | static void setnodevector (lua_State *L, Table *t, unsigned int size) { |
| 311 | int lsize; |
| 312 | if (size == 0) { /* no elements to hash part? */ |
| 313 | t->node = cast(Node *, dummynode); /* use common 'dummynode' */ |
| 314 | lsize = 0; |
| 315 | } |
| 316 | else { |
| 317 | int i; |
| 318 | lsize = luaO_ceillog2(size); |
| 319 | if (lsize > MAXHBITS) |
| 320 | luaG_runerror(L, "table overflow"); |
| 321 | size = twoto(lsize); |
| 322 | t->node = luaM_newvector(L, size, Node); |
| 323 | for (i = 0; i < (int)size; i++) { |
| 324 | Node *n = gnode(t, i); |
| 325 | gnext(n) = 0; |
| 326 | setnilvalue(wgkey(n)); |
| 327 | setnilvalue(gval(n)); |
| 328 | } |
| 329 | } |
| 330 | t->lsizenode = cast_byte(lsize); |
| 331 | t->lastfree = gnode(t, size); /* all positions are free */ |
| 332 | } |
| 333 | |
| 334 | |
| 335 | void luaH_resize (lua_State *L, Table *t, unsigned int nasize, |
no test coverage detected