Functions — github.com/PlutoLang/Pluto

CodeHub MCPcopy Create free account

hub / github.com/PlutoLang/Pluto / functions

Functions1,782 in github.com/PlutoLang/Pluto

⨍ Functions 1,782◇ Types & classes 129

↓ 3 callersFunctionresetCI

src/lstate.cpp:153

↓ 3 callersFunctionresizearray

** Resize the array part of a table. If new size is equal to the old, ** do nothing. Else, if new size is zero, free the old array. (It must ** be pre

src/ltable.cpp:563

↓ 3 callersFunctionresolve_installed_program

scripts/common.php:80

↓ 3 callersFunctionreverse

** Reverse the stack segment from 'from' to 'to' ** (auxiliary to 'lua_rotate') ** Note that we move(copy) only the value inside the stack. ** (We do

src/lapi.cpp:225

↓ 3 callersFunctionrotl

rotate left 'x' by 'n' bits */

src/lmathlib.cpp:423

↓ 3 callersFunctionrun_command_async

scripts/common.php:102

↓ 3 callersFunctionsetminordebt

** Set debt for the next minor collection, which will happen when ** total number of bytes grows 'genminormul'% in relation to ** the base, GCmajormin

src/lgc.cpp:1417

↓ 3 callersFunctionsetnodevector

** Creates an array for the hash part of a table with the given ** size, or reuses the dummy node if size is zero. ** The computation for size overflo

src/ltable.cpp:602

↓ 3 callersFunctionsetsignal

** Use 'sigaction' when available. */

↓ 3 callersFunctionsinglematch

src/lstrlib.cpp:526

↓ 3 callersFunctionskip_sep

** read a sequence '[=*[' or ']=*]', leaving the last bracket. If ** sequence is well formed, return its number of '='s + 2; otherwise, ** return 1 if

src/llex.cpp:614

↓ 3 callersFunctionskipcomment

** reads the first character of file 'f' and skips an optional BOM mark ** in its beginning plus its first line if it starts with '#'. Returns ** true

src/lauxlib.cpp:865

↓ 3 callersFunctionstatement

src/lparser.cpp:6045

↓ 3 callersFunctionstr_find_aux

src/lstrlib.cpp:830

↓ 3 callersFunctionsuffixedexp

src/lparser.cpp:3770

↓ 3 callersFunctionsweep2old

** Sweep a list of objects to enter generational mode. Deletes dead ** objects and turns the non dead to old. All non-dead threads---which ** are now

src/lgc.cpp:1136

↓ 3 callersFunctionsweepstep

** Do a sweep step. The normal case (not fast) sweeps at most GCSWEEPMAX ** elements. The fast case sweeps the whole list. */

src/lgc.cpp:1588

↓ 3 callersFunctionupvalname

src/ldebug.cpp:179

↓ 3 callersFunctionusage

src/luac.cpp:62

↓ 3 callersFunctionutf8_decode

** Decode one UTF-8 sequence, returning NULL if byte sequence is ** invalid. The array 'limits' stores the minimum value for each ** sequence length,

src/lutf8lib.cpp:52

↓ 3 callersFunctionvarinfo

** Build a string with a "description" for the value 'o', such as ** "variable 'x'" or "upvalue 'y'". */

src/ldebug.cpp:745

↓ 3 callersFunctionwasm_to_lua_stack

src/lwasmlib.cpp:21

↓ 2 callersFunctionGCTM

src/lgc.cpp:968

↓ 2 callersFunctionHgetlongstr

src/ltable.cpp:1026

↓ 2 callersFunctionIadd

return i1 + i2 */

src/lmathlib.cpp:520

↓ 2 callersMethodIsReserved

↓ 2 callersFunctionadddigit

** Add integer part of 'x' to buffer and return new 'x' */

src/lstrlib.cpp:1080

↓ 2 callersFunctionaddfield

src/ltablib.cpp:183

↓ 2 callersFunctionaddk

** Add constant 'v' to prototype's list of constants (field 'k'). */

src/lcode.cpp:546

↓ 2 callersFunctionaddliteral

src/lstrlib.cpp:1291

↓ 2 callersFunctionallocupvalue

src/lparser.cpp:1046

↓ 2 callersFunctionanchorstr

** Anchors a string in scanner's table so that it will not be collected ** until the end of the compilation; by that time it should be anchored ** som

src/llex.cpp:230

↓ 2 callersFunctionapplyextends

src/lparser.cpp:2179

↓ 2 callersFunctionatomic2gen

** Clears all gray lists, sweeps objects, and prepare sublists to enter ** generational mode. The sweeps remove dead objects and turn all ** surviving

src/lgc.cpp:1389

↓ 2 callersFunctionaux_lines

** Auxiliary function to create the iteration function for 'lines'. ** The iteration function is a closure over 'io_readline', with ** the following u

src/liolib.cpp:457

↓ 2 callersFunctionaux_rawset

src/lapi.cpp:994

↓ 2 callersFunctionaux_upvalue

src/lapi.cpp:1475

↓ 2 callersFunctionauxgetstr

src/lapi.cpp:725

↓ 2 callersFunctionauxsetstr

** t[k] = value at the top of the stack (where 'k' is a string) */

src/lapi.cpp:918

↓ 2 callersFunctionauxstatus

src/lcorolib.cpp:158

↓ 2 callersFunctionauxupvalue

** get (if 'get' is true) or set an upvalue from a closure */

src/ldblib.cpp:261

↓ 2 callersFunctionbinopr2TM

** Convert a BinOpr to a tag method (ORDER OPR - ORDER TM) */

src/lcode.cpp:1604

↓ 2 callersFunctionbinsearch

src/ltable.cpp:1302

↓ 2 callersFunctionbuild_soup

scripts/common.php:9

↓ 2 callersFunctioncallallpendingfinalizers

** call all pending finalizers */

src/lgc.cpp:999

↓ 2 callersFunctioncasecond

src/lparser.cpp:4015

↓ 2 callersFunctioncat_encode_aux

src/lcatlib.cpp:38

↓ 2 callersFunctioncat_encode_value

src/lcatlib.cpp:12

↓ 2 callersMethodcheckEtl

src/lvm.cpp:2673

↓ 2 callersFunctioncheckSizes

** If possible, shrink string table. */

src/lgc.cpp:935

↓ 2 callersFunctioncheck_struct_type

src/lffi.cpp:590

↓ 2 callersFunctioncheckaddr

src/lsocketlib.cpp:507

↓ 2 callersFunctioncheckbuffer

src/lzio.cpp:50

↓ 2 callersFunctioncheckcontrol

** Check whether message is a control message. If so, execute the ** control or ignore it if unknown. */

src/lauxlib.cpp:1245

↓ 2 callersFunctioncheckextends

src/lparser.cpp:2159

↓ 2 callersFunctioncheckffilib

src/lffi.cpp:218

↓ 2 callersFunctioncheckfuncref

src/lwasmlib.cpp:94

↓ 2 callersFunctioncheckfuncspec

src/lparser.cpp:675

↓ 2 callersFunctioncheckfuncwrapper

src/lffi.cpp:232

↓ 2 callersFunctioncheckglobal

src/lparser.cpp:5680

↓ 2 callersFunctioncheckliteral

src/lundump.cpp:344

↓ 2 callersFunctioncheckmode

src/ldo.cpp:1123

↓ 2 callersFunctioncheckmoduleraw

src/lwasmlib.cpp:12

↓ 2 callersFunctioncheckrettype

src/lparser.cpp:2698

↓ 2 callersFunctionchecktab

** Check that 'arg' either is a table or can behave like one (that is, ** has a metatable with the required metamethods) */

src/ltablib.cpp:50

↓ 2 callersFunctionclassend

src/lstrlib.cpp:459

↓ 2 callersFunctionclearbykeys

** clear entries with unmarked keys from all weaktables in list 'l' */

src/lgc.cpp:789

↓ 2 callersFunctioncleargraylists

src/lgc.cpp:429

↓ 2 callersFunctionclose_state

src/lstate.cpp:265

↓ 2 callersFunctioncodeAsBx

** Format and emit an 'iAsBx' instruction. */

src/lcode.cpp:428

↓ 2 callersFunctioncode_loadbool

src/lcode.cpp:966

↓ 2 callersFunctioncodearith

** Code arithmetic operators ('+', '-', ...). If second operand is a ** constant in the proper range, use variant opcodes with K operands. */

src/lcode.cpp:1726

↓ 2 callersFunctioncodebinK

** Code binary operators with K operand. */

src/lcode.cpp:1675

↓ 2 callersFunctioncodebinNoK

** Code binary operators with no constant operand. */

src/lcode.cpp:1714

↓ 2 callersFunctioncodeextraarg

** Emit an "extra argument" instruction (format 'iAx') */

src/lcode.cpp:450

↓ 2 callersFunctioncodeorder

** Emit code for order comparisons. When using an immediate operand, ** 'isfloat' tells whether the original value was a float. */

src/lcode.cpp:1776

↓ 2 callersFunctionconst2val

** Get the constant value from a constant expression */

src/lcode.cpp:75

↓ 2 callersFunctionconst_expr

src/lparser.cpp:3261

↓ 2 callersFunctionconstexpr_call

src/lparser.cpp:3194

↓ 2 callersFunctionconstfolding

** Try to "constant-fold" an operation; return 1 iff successful. ** (In this case, 'e1' has the final result.) */

src/lcode.cpp:1560

↓ 2 callersFunctionconvergeephemerons

** Traverse all ephemeron tables propagating marks from keys to values. ** Repeat until it converges, that is, nothing new is marked. 'dir' ** inverts

src/lgc.cpp:755

↓ 2 callersFunctioncopy2buff

copy strings in stack from top - n up to top - 1 to buffer */

src/lvm.cpp:693

↓ 2 callersFunctioncorrectstack

** Change back all offsets into pointers. */

src/ldo.cpp:277

↓ 2 callersFunctioncountint

src/ltable.cpp:470

↓ 2 callersFunctiondefaultarguments

src/lparser.cpp:2628

↓ 2 callersFunctiondeletelist

** Delete all objects in list 'p' until (but not including) object ** 'limit'. */

src/lgc.cpp:1516

↓ 2 callersFunctiondigit

** Read an integer numeral from string 'fmt' or return 'df' if ** there is no numeral */

src/lstrlib.cpp:1574

↓ 2 callersFunctiondischarge2anyreg

** Ensure expression value is in a register, making 'e' a ** non-relocatable expression. ** (Expression still may have jump lists.) */

src/lcode.cpp:958

↓ 2 callersFunctiondischarge2reg

** Ensure expression value is in register 'reg', making 'e' a ** non-relocatable expression. ** (Expression still may have jump lists.) */

src/lcode.cpp:903

↓ 2 callersFunctiondoREPL

** Do the REPL: repeatedly read (load) a line, evaluate (call) it, and ** print any results. */

src/lua.cpp:688

↓ 2 callersFunctiondochunk

src/lua.cpp:204

↓ 2 callersFunctiondofile

src/lua.cpp:210

↓ 2 callersFunctiondostring

src/lua.cpp:215

↓ 2 callersFunctiondumpAlign

** Dump enough zeros to ensure that current position is a multiple of ** 'align'. */

src/ldump.cpp:68

↓ 2 callersFunctiondumpBlock

** Dump the block of memory pointed by 'b' with given 'size'. ** 'b' should not be NULL, except for the last call signaling the end ** of the dump. */

src/ldump.cpp:54

↓ 2 callersFunctiondumpFunction

src/ldump.cpp:256

↓ 2 callersFunctionentergen

** Enter generational mode. Must go until the end of an atomic cycle ** to ensure that all objects are correctly marked and weak tables ** are cleared

src/lgc.cpp:1428

↓ 2 callersMethodexec

src/lffi.cpp:695

↓ 2 callersFunctionexplist_nonlinear_arg

src/lparser.cpp:2866

↓ 2 callersFunctionexpr_propagate_warn

src/lparser.cpp:2848

← previous next →501–600 of 1,782, ranked by callers