Coverage Report

Created: 2025-08-25 07:03

/src/testdir/build/lua-master/source/ltm.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
** $Id: ltm.c $
3
** Tag methods
4
** See Copyright Notice in lua.h
5
*/
6
7
#define ltm_c
8
#define LUA_CORE
9
10
#include "lprefix.h"
11
12
13
#include <string.h>
14
15
#include "lua.h"
16
17
#include "ldebug.h"
18
#include "ldo.h"
19
#include "lgc.h"
20
#include "lobject.h"
21
#include "lstate.h"
22
#include "lstring.h"
23
#include "ltable.h"
24
#include "ltm.h"
25
#include "lvm.h"
26
27
28
static const char udatatypename[] = "userdata";
29
30
LUAI_DDEF const char *const luaT_typenames_[LUA_TOTALTYPES] = {
31
  "no value",
32
  "nil", "boolean", udatatypename, "number",
33
  "string", "table", "function", udatatypename, "thread",
34
  "upvalue", "proto" /* these last cases are used for tests only */
35
};
36
37
38
59.7k
void luaT_init (lua_State *L) {
39
59.7k
  static const char *const luaT_eventname[] = {  /* ORDER TM */
40
59.7k
    "__index", "__newindex",
41
59.7k
    "__gc", "__mode", "__len", "__eq",
42
59.7k
    "__add", "__sub", "__mul", "__mod", "__pow",
43
59.7k
    "__div", "__idiv",
44
59.7k
    "__band", "__bor", "__bxor", "__shl", "__shr",
45
59.7k
    "__unm", "__bnot", "__lt", "__le",
46
59.7k
    "__concat", "__call", "__close"
47
59.7k
  };
48
59.7k
  int i;
49
1.55M
  for (i=0; i<TM_N; i++) {
50
1.49M
    G(L)->tmname[i] = luaS_new(L, luaT_eventname[i]);
51
1.49M
    luaC_fix(L, obj2gco(G(L)->tmname[i]));  /* never collect these names */
52
1.49M
  }
53
59.7k
}
54
55
56
/*
57
** function to be used with macro "fasttm": optimized for absence of
58
** tag methods
59
*/
60
3.84M
const TValue *luaT_gettm (Table *events, TMS event, TString *ename) {
61
3.84M
  const TValue *tm = luaH_Hgetshortstr(events, ename);
62
3.84M
  lua_assert(event <= TM_EQ);
63
3.84M
  if (notm(tm)) {  /* no tag method? */
64
53.4k
    events->flags |= cast_byte(1u<<event);  /* cache this fact */
65
53.4k
    return NULL;
66
53.4k
  }
67
3.78M
  else return tm;
68
3.84M
}
69
70
71
203M
const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o, TMS event) {
72
203M
  Table *mt;
73
203M
  switch (ttype(o)) {
74
1.37M
    case LUA_TTABLE:
75
1.37M
      mt = hvalue(o)->metatable;
76
0
      break;
77
4.98M
    case LUA_TUSERDATA:
78
4.98M
      mt = uvalue(o)->metatable;
79
0
      break;
80
196M
    default:
81
196M
      mt = G(L)->mt[ttype(o)];
82
203M
  }
83
203M
  return (mt ? luaH_Hgetshortstr(mt, G(L)->tmname[event]) : &G(L)->nilvalue);
84
203M
}
85
86
87
/*
88
** Return the name of the type of an object. For tables and userdata
89
** with metatable, use their '__name' metafield, if present.
90
*/
91
846k
const char *luaT_objtypename (lua_State *L, const TValue *o) {
92
846k
  Table *mt;
93
846k
  if ((ttistable(o) && (mt = hvalue(o)->metatable) != NULL) ||
94
846k
      (ttisfulluserdata(o) && (mt = uvalue(o)->metatable) != NULL)) {
95
1.74k
    const TValue *name = luaH_Hgetshortstr(mt, luaS_new(L, "__name"));
96
1.74k
    if (ttisstring(name))  /* is '__name' a string? */
97
1.05k
      return getstr(tsvalue(name));  /* use it as type name */
98
1.74k
  }
99
846k
  return ttypename(ttype(o));  /* else use standard type name */
100
846k
}
101
102
103
void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1,
104
41.0M
                  const TValue *p2, const TValue *p3) {
105
41.0M
  StkId func = L->top.p;
106
41.0M
  setobj2s(L, func, f);  /* push function (assume EXTRA_STACK) */
107
41.0M
  setobj2s(L, func + 1, p1);  /* 1st argument */
108
41.0M
  setobj2s(L, func + 2, p2);  /* 2nd argument */
109
41.0M
  setobj2s(L, func + 3, p3);  /* 3rd argument */
110
41.0M
  L->top.p = func + 4;
111
  /* metamethod may yield only when called from Lua code */
112
41.0M
  if (isLuacode(L->ci))
113
41.0M
    luaD_call(L, func, 0);
114
0
  else
115
0
    luaD_callnoyield(L, func, 0);
116
41.0M
}
117
118
119
lu_byte luaT_callTMres (lua_State *L, const TValue *f, const TValue *p1,
120
100M
                        const TValue *p2, StkId res) {
121
100M
  ptrdiff_t result = savestack(L, res);
122
100M
  StkId func = L->top.p;
123
100M
  setobj2s(L, func, f);  /* push function (assume EXTRA_STACK) */
124
100M
  setobj2s(L, func + 1, p1);  /* 1st argument */
125
100M
  setobj2s(L, func + 2, p2);  /* 2nd argument */
126
100M
  L->top.p += 3;
127
  /* metamethod may yield only when called from Lua code */
128
100M
  if (isLuacode(L->ci))
129
100M
    luaD_call(L, func, 1);
130
61.2k
  else
131
61.2k
    luaD_callnoyield(L, func, 1);
132
100M
  res = restorestack(L, result);
133
100M
  setobjs2s(L, res, --L->top.p);  /* move result to its place */
134
100M
  return ttypetag(s2v(res));  /* return tag of the result */
135
100M
}
136
137
138
static int callbinTM (lua_State *L, const TValue *p1, const TValue *p2,
139
11.5M
                      StkId res, TMS event) {
140
11.5M
  const TValue *tm = luaT_gettmbyobj(L, p1, event);  /* try first operand */
141
11.5M
  if (notm(tm))
142
2.50M
    tm = luaT_gettmbyobj(L, p2, event);  /* try second operand */
143
11.5M
  if (notm(tm))
144
177k
    return -1;  /* tag method not found */
145
11.3M
  else  /* call tag method and return the tag of the result */
146
11.3M
    return luaT_callTMres(L, tm, p1, p2, res);
147
11.5M
}
148
149
150
void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2,
151
7.39M
                    StkId res, TMS event) {
152
7.39M
  if (l_unlikely(callbinTM(L, p1, p2, res, event) < 0)) {
153
152k
    switch (event) {
154
41.9k
      case TM_BAND: case TM_BOR: case TM_BXOR:
155
131k
      case TM_SHL: case TM_SHR: case TM_BNOT: {
156
131k
        if (ttisnumber(p1) && ttisnumber(p2))
157
53.7k
          luaG_tointerror(L, p1, p2);
158
77.9k
        else
159
77.9k
          luaG_opinterror(L, p1, p2, "perform bitwise operation on");
160
131k
      }
161
      /* calls never return, but to avoid warnings: *//* FALLTHROUGH */
162
21.1k
      default:
163
21.1k
        luaG_opinterror(L, p1, p2, "perform arithmetic on");
164
152k
    }
165
152k
  }
166
7.39M
}
167
168
169
/*
170
** The use of 'p1' after 'callbinTM' is safe because, when a tag
171
** method is not found, 'callbinTM' cannot change the stack.
172
*/
173
1.89M
void luaT_tryconcatTM (lua_State *L) {
174
1.89M
  StkId p1 = L->top.p - 2;  /* first argument */
175
1.89M
  if (l_unlikely(callbinTM(L, s2v(p1), s2v(p1 + 1), p1, TM_CONCAT) < 0))
176
6.67k
    luaG_concaterror(L, s2v(p1), s2v(p1 + 1));
177
1.89M
}
178
179
180
void luaT_trybinassocTM (lua_State *L, const TValue *p1, const TValue *p2,
181
1.04M
                                       int flip, StkId res, TMS event) {
182
1.04M
  if (flip)
183
166k
    luaT_trybinTM(L, p2, p1, res, event);
184
882k
  else
185
882k
    luaT_trybinTM(L, p1, p2, res, event);
186
1.04M
}
187
188
189
void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2,
190
548k
                                   int flip, StkId res, TMS event) {
191
548k
  TValue aux;
192
548k
  setivalue(&aux, i2);
193
548k
  luaT_trybinassocTM(L, p1, &aux, flip, res, event);
194
548k
}
195
196
197
/*
198
** Calls an order tag method.
199
** For lessequal, LUA_COMPAT_LT_LE keeps compatibility with old
200
** behavior: if there is no '__le', try '__lt', based on l <= r iff
201
** !(r < l) (assuming a total order). If the metamethod yields during
202
** this substitution, the continuation has to know about it (to negate
203
** the result of r<l); bit CIST_LEQ in the call status keeps that
204
** information.
205
*/
206
int luaT_callorderTM (lua_State *L, const TValue *p1, const TValue *p2,
207
2.22M
                      TMS event) {
208
2.22M
  int tag = callbinTM(L, p1, p2, L->top.p, event);  /* try original event */
209
2.22M
  if (tag >= 0)  /* found tag method? */
210
2.21M
    return !tagisfalse(tag);
211
#if defined(LUA_COMPAT_LT_LE)
212
  else if (event == TM_LE) {
213
    /* try '!(p2 < p1)' for '(p1 <= p2)' */
214
    L->ci->callstatus |= CIST_LEQ;  /* mark it is doing 'lt' for 'le' */
215
    tag = callbinTM(L, p2, p1, L->top.p, TM_LT);
216
    L->ci->callstatus ^= CIST_LEQ;  /* clear mark */
217
    if (tag >= 0)  /* found tag method? */
218
      return tagisfalse(tag);
219
  }
220
#endif
221
18.3k
  luaG_ordererror(L, p1, p2);  /* no metamethod found */
222
0
  return 0;  /* to avoid warnings */
223
2.22M
}
224
225
226
int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2,
227
489k
                       int flip, int isfloat, TMS event) {
228
489k
  TValue aux; const TValue *p2;
229
489k
  if (isfloat) {
230
4.44k
    setfltvalue(&aux, cast_num(v2));
231
4.44k
  }
232
485k
  else
233
485k
    setivalue(&aux, v2);
234
489k
  if (flip) {  /* arguments were exchanged? */
235
448k
    p2 = p1; p1 = &aux;  /* correct them */
236
448k
  }
237
40.8k
  else
238
40.8k
    p2 = &aux;
239
489k
  return luaT_callorderTM(L, p1, p2, event);
240
489k
}
241
242
243
void luaT_adjustvarargs (lua_State *L, int nfixparams, CallInfo *ci,
244
17.5M
                         const Proto *p) {
245
17.5M
  int i;
246
17.5M
  int actual = cast_int(L->top.p - ci->func.p) - 1;  /* number of arguments */
247
17.5M
  int nextra = actual - nfixparams;  /* number of extra arguments */
248
17.5M
  ci->u.l.nextraargs = nextra;
249
17.5M
  luaD_checkstack(L, p->maxstacksize + 1);
250
  /* copy function to the top of the stack */
251
17.5M
  setobjs2s(L, L->top.p++, ci->func.p);
252
  /* move fixed parameters to the top of the stack */
253
65.7M
  for (i = 1; i <= nfixparams; i++) {
254
48.1M
    setobjs2s(L, L->top.p++, ci->func.p + i);
255
48.1M
    setnilvalue(s2v(ci->func.p + i));  /* erase original parameter (for GC) */
256
48.1M
  }
257
17.5M
  ci->func.p += actual + 1;
258
17.5M
  ci->top.p += actual + 1;
259
17.5M
  lua_assert(L->top.p <= ci->top.p && ci->top.p <= L->stack_last.p);
260
17.5M
}
261
262
263
4.17M
void luaT_getvarargs (lua_State *L, CallInfo *ci, StkId where, int wanted) {
264
4.17M
  int i;
265
4.17M
  int nextra = ci->u.l.nextraargs;
266
4.17M
  if (wanted < 0) {
267
1.76M
    wanted = nextra;  /* get all extra arguments available */
268
1.76M
    checkstackp(L, nextra, where);  /* ensure stack space */
269
1.76M
    L->top.p = where + nextra;  /* next instruction will need top */
270
1.76M
  }
271
32.3M
  for (i = 0; i < wanted && i < nextra; i++)
272
28.1M
    setobjs2s(L, where + i, ci->func.p - nextra + i);
273
6.52M
  for (; i < wanted; i++)   /* complete required results with nil */
274
4.17M
    setnilvalue(s2v(where + i));
275
4.17M
}
276