aboutsummaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
* Another way to compile goto'sRoberto Ierusalimschy2025-01-106-121/+119
| | | | | | | | | | | | The compilation of a goto or a label just create an entry and generate boilerplate code for the gotos. As we don't know yet whether it needs a CLOSE, we code a jump followed by a CLOSE, which is then dead code. When a block ends (and then we know for sure whether there are variables that need to be closed), we check the goto's against the labels of that block. When closing a goto against a label, if it needs a CLOSE, the compiler swaps the order of the jump and the CLOSE, making the CLOSE active.
* DetailRoberto Ierusalimschy2025-01-061-2/+6
| | | | Small improvement in line-tracing for internal debugging.
* Detail (debugging aid)Roberto Ierusalimschy2025-01-062-4/+6
| | | | | When compiling with option HARDMEMTESTS, every creation of a new key in a table forces an emergency GC.
* Scanner doesn't need to anchor reserved wordsRoberto Ierusalimschy2024-12-302-12/+20
|
* Small optimization in 'luaH_psetshortstr'Roberto Ierusalimschy2024-12-281-18/+63
| | | | | | | Do not optimize only for table updates (key already present). Creation of new short keys in new tables can be quite common in programs that create lots of small tables, for instance with constructors like {x=e1,y=e2}.
* When parser reuses constants, only floats can collideRoberto Ierusalimschy2024-12-281-26/+28
| | | | | Ensure that float constants never use integer keys, so that only floats can collide in 'k2proto'.
* Detail in 'luaD_inctop'Roberto Ierusalimschy2024-12-171-1/+1
| | | | | | Protect stack top before possible stack reallocation. (In the current implementation, a stack reallocation cannot call an emergency collection, so there is no bug, but it is safer not to depend on that.)
* Scanner and parser use different tables for constantsRoberto Ierusalimschy2024-12-176-28/+20
| | | | | | | | | | Moreover, each function being parsed has its own table. The code is cleaner when each table is used for one specific purpose: The scanner uses its table to anchor and unify strings, mapping strings to themselves; the parser uses it to reuse constants in the code, mapping constants to their indices in the constant table. A different table for each task avoids false collisions.
* 'addk' broken in two functionsRoberto Ierusalimschy2024-12-161-19/+28
|
* 'luaH_fastseti' uses 'checknoTM'Roberto Ierusalimschy2024-12-111-1/+1
| | | | | | The extra check in checknoTM (versus only checking whether there is a metatable) is cheap, and it is not that uncommon for a table to have a metatable without a __newindex metafield.
* OP_SELF restricted to constant short stringsRoberto Ierusalimschy2024-12-115-34/+35
| | | | | | Optimize this opcode for the common case. For long names or method calls after too many constants, operation can be coded as a move followed by 'gettable'.
* Rehash reinserts elements with "lighter" functionsRoberto Ierusalimschy2024-12-051-17/+33
| | | | | | | | | | | | When reinserting elements into a table during a rehash, the code does not need to invoke all the complexity of a full 'luaH_set': - The table has space for all keys. - The key cannot exist in the new hash. - The keys are valid (not NaN nor nil). - The keys are normalized (1.0 -> 1). - The values cannot be nil. - No barrier needed (the table already pointed to the key and value).
* Refactoring of 'luaH_newkey'Roberto Ierusalimschy2024-12-052-56/+79
| | | | | Function broke in two and some checks moved to the caller. (We may want to call it without the checks.)
* Fix in the definition of 'sizeLclosure'Roberto Ierusalimschy2024-12-031-1/+1
| | | | | | | The array at the end of a Lua closure has pointers to upvalues, not to tagged values. This bug cannot cause any issue: The ISO C standard requires that all pointers to structures have the same representation, so sizeof(TValue*) must be equal to sizeof(UpVal*).
* New function 'lua_printvalue' for internal debuggingRoberto Ierusalimschy2024-12-022-4/+43
|
* DetailsRoberto Ierusalimschy2024-11-291-2/+2
| | | | Added two warnings to the makefile.
* New way to keep hints for table lengthRoberto Ierusalimschy2024-11-297-249/+146
| | | | | | | | | | Instead of using 'alimit' for keeping the size of the array and at the same time being a hint for '#t', a table now keeps these two values separate. The Table structure has a field 'asize' with the size of the array, while the length hint is kept in the array itself. That way, tables with no array part waste no space with that field. Moreover, the space for the hint may have zero cost for small arrays, if the array of tags plus the hint still fits in a single word.
* Avoid an extra call to 'concretesize' in 'resizearray'Roberto Ierusalimschy2024-11-271-5/+5
|
* Change to macro 'LUAI_TRY'Roberto Ierusalimschy2024-11-252-8/+7
| | | | The call to 'f' is done by the macro, to give it more flexibility.
* Debug information about extra arguments from __callRoberto Ierusalimschy2024-11-199-12/+83
| | | | | | 'debug.getinfo' can return number of extra arguments added to a call by a chain of __call metavalues. That information is being used to improve error messages about errors in these extra arguments.
* Counter for length of chains of __call metamethodsRoberto Ierusalimschy2024-11-164-28/+68
| | | | | This counter will allow (in a later commit) error messages to correct argument numbers in functions called through __call metamethods.
* More integration of 'nresults' into 'callstatus'Roberto Ierusalimschy2024-11-153-28/+33
|
* 'objsize' returns 'l_mem'Roberto Ierusalimschy2024-11-157-25/+40
| | | | Sums of size_t may not fit in a size_t.
* New macro 'assert_code'Roberto Ierusalimschy2024-11-151-5/+6
| | | | | It allows code that is only used by assertions but that are not assertions (e.g., declaration of a variable used in a later assertion).
* Ease slightly making Lua with C89Roberto Ierusalimschy2024-11-152-1/+8
|
* Dummy node has a non-nil keyRoberto Ierusalimschy2024-11-151-25/+28
| | | | | That allows 'getfreepos' to treat it like a regular hash part that has a deleted entry.
* Add extra size when resizing tables with deleted keysRoberto Ierusalimschy2024-11-142-6/+82
| | | | | | | | Without this extra space, sequences of insertions/deletions (and some other uses) can have unpexpected low performances. See the added tests for an example, and *Mathematical Models to Analyze Lua Hybrid Tables and Why They Need a Fix* (Martínez, Nicaud, Rotondo; arXiv:2208.13602v2) for detais.
* New rule for size of array partRoberto Ierusalimschy2024-11-133-29/+81
| | | | | | | | Array part needs 1/3 of its elements filled, instead of 1/2. Array entries use ~1/3 the memory of hash entries, so this new rule still ensures that array parts do not use more memory than keeping the values in the hash, while allowing more uses of the array part, which is more efficient than the hash.
* New structure to count keys in a table for rehashingRoberto Ierusalimschy2024-10-281-50/+65
|
* Table rehash can resize only the hash partRoberto Ierusalimschy2024-10-282-17/+41
| | | | | | | If there are no integer keys outside the array part, there is no reason to resize it, saving the time to count its elements. Moreover, assignments to non-integer keys will not collapse a table created with 'table.create'.
* Always use unsigned int for indexing table-arraysRoberto Ierusalimschy2024-10-242-5/+5
|
* New function 'lua_numbertostrbuff'Roberto Ierusalimschy2024-10-237-40/+67
| | | | | It converts a Lua number to a string in a buffer, without creating a new Lua string.
* Some changes in default GC parametersRoberto Ierusalimschy2024-10-232-8/+6
|
* Small bug in 'luaE_luaE_statesize'Roberto Ierusalimschy2024-10-213-4/+4
| | | | Plus, function was renamed to 'luaE_threadsize'.
* Better support in 'ltests' for tracing the GCRoberto Ierusalimschy2024-10-215-30/+67
|
* Some adjustments in transition minor->majorRoberto Ierusalimschy2024-10-182-37/+46
| | | | Plus extra comments and other details.
* 'objsize' broke in smaller piecesRoberto Ierusalimschy2024-09-309-63/+91
|
* Local declaration in the REPL generates a warningRoberto Ierusalimschy2024-09-272-2/+25
|
* No errors in 'luaO_pushvfstring'Roberto Ierusalimschy2024-09-205-24/+45
| | | | | | Any call to 'va_start' must have a corresponding call to 'va_end'; so, functions called between them (luaO_pushvfstring in particular) cannot raise errors.
* Towards no errors in 'luaO_pushvfstring'Roberto Ierusalimschy2024-09-201-52/+69
| | | | | | Any call to 'va_start' must have a corresponding call to 'va_end'; so, functions called between them (luaO_pushvfstring in particular) cannot raise errors.
* In 'luaO_pushvfstring', all options use 'addstr2buff'Roberto Ierusalimschy2024-09-201-12/+8
|
* Removed 'if' left from commit ddfa1fbccfeRoberto Ierusalimschy2024-09-201-1/+0
|
* Avoid Microsoft warningRoberto Ierusalimschy2024-09-191-1/+2
| | | | | > warning C4334: '<<': result of 32-bit shift implicitly converted to > 64 bits (was 64-bit shift intended?)
* USHRT_MAX changed to SHRT_MAXRoberto Ierusalimschy2024-09-192-2/+2
| | | | USHRT_MAX does not fit in an 'int' in 16-bit systems.
* GC back to controling pace counting bytesRoberto Ierusalimschy2024-09-1911-202/+247
| | | | Memory is the resource we want to save. Still to be reviewed again.
* DetailsRoberto Ierusalimschy2024-09-121-3/+3
| | | | Fixed comments in sort partition.
* Parameter for lua_gc/LUA_GCSTEP changed to 'size_t'Roberto Ierusalimschy2024-09-103-3/+3
| | | | | 'size_t' is the common type for measuring memory. 'int' can be too small for steps.
* Rename of fields in global state that control GCRoberto Ierusalimschy2024-09-065-32/+32
| | | | | All fields in the global state that control the pace of the garbage collector prefixed with 'GC'.
* DetailsRoberto Ierusalimschy2024-09-063-20/+20
| | | | Identation + comments
* Added option for direct correction of stack pointersRoberto Ierusalimschy2024-08-221-10/+44
| | | | | | | | | | The use of a pointer (not access, only for computations) after its deallocation is forbiden in ISO C, but seems to work fine in all platforms we are aware of. So, using that to correct stack pointers after a stack reallocation seems safe and is much simpler than the current implementation (first change all pointers to offsets and then changing the offsets back to pointers). Anyway, for now that option is disabled.
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-03-22 09:06:53 +0000