Coverage Report

Created: 2025-07-18 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
63.4k
void luaT_init (lua_State *L) {
39
63.4k
  static const char *const luaT_eventname[] = {  /* ORDER TM */
40
63.4k
    "__index", "__newindex",
41
63.4k
    "__gc", "__mode", "__len", "__eq",
42
63.4k
    "__add", "__sub", "__mul", "__mod", "__pow",
43
63.4k
    "__div", "__idiv",
44
63.4k
    "__band", "__bor", "__bxor", "__shl", "__shr",
45
63.4k
    "__unm", "__bnot", "__lt", "__le",
46
63.4k
    "__concat", "__call", "__close"
47
63.4k
  };
48
63.4k
  int i;
49
1.65M
  for (i=0; i<TM_N; i++) {
50
1.58M
    G(L)->tmname[i] = luaS_new(L, luaT_eventname[i]);
51
1.58M
    luaC_fix(L, obj2gco(G(L)->tmname[i]));  /* never collect these names */
52
1.58M
  }
53
63.4k
}
54
55
56
/*
57
** function to be used with macro "fasttm": optimized for absence of
58
** tag methods
59
*/
60
7.81M
const TValue *luaT_gettm (Table *events, TMS event, TString *ename) {
61
7.81M
  const TValue *tm = luaH_Hgetshortstr(events, ename);
62
7.81M
  lua_assert(event <= TM_EQ);
63
7.81M
  if (notm(tm)) {  /* no tag method? */
64
215k
    events->flags |= cast_byte(1u<<event);  /* cache this fact */
65
215k
    return NULL;
66
215k
  }
67
7.59M
  else return tm;
68
7.81M
}
69
70
71
101M
const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o, TMS event) {
72
101M
  Table *mt;
73
101M
  switch (ttype(o)) {
74
1.69M
    case LUA_TTABLE:
75
1.69M
      mt = hvalue(o)->metatable;
76
0
      break;
77
6.44M
    case LUA_TUSERDATA:
78
6.44M
      mt = uvalue(o)->metatable;
79
0
      break;
80
93.0M
    default:
81
93.0M
      mt = G(L)->mt[ttype(o)];
82
101M
  }
83
101M
  return (mt ? luaH_Hgetshortstr(mt, G(L)->tmname[event]) : &G(L)->nilvalue);
84
101M
}
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
1.49M
const char *luaT_objtypename (lua_State *L, const TValue *o) {
92
1.49M
  Table *mt;
93
1.49M
  if ((ttistable(o) && (mt = hvalue(o)->metatable) != NULL) ||
94
1.49M
      (ttisfulluserdata(o) && (mt = uvalue(o)->metatable) != NULL)) {
95
3.92k
    const TValue *name = luaH_Hgetshortstr(mt, luaS_new(L, "__name"));
96
3.92k
    if (ttisstring(name))  /* is '__name' a string? */
97
3.13k
      return getstr(tsvalue(name));  /* use it as type name */
98
3.92k
  }
99
1.48M
  return ttypename(ttype(o));  /* else use standard type name */
100
1.49M
}
101
102
103
void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1,
104
17.2M
                  const TValue *p2, const TValue *p3) {
105
17.2M
  StkId func = L->top.p;
106
17.2M
  setobj2s(L, func, f);  /* push function (assume EXTRA_STACK) */
107
17.2M
  setobj2s(L, func + 1, p1);  /* 1st argument */
108
17.2M
  setobj2s(L, func + 2, p2);  /* 2nd argument */
109
17.2M
  setobj2s(L, func + 3, p3);  /* 3rd argument */
110
17.2M
  L->top.p = func + 4;
111
  /* metamethod may yield only when called from Lua code */
112
17.2M
  if (isLuacode(L->ci))
113
17.2M
    luaD_call(L, func, 0);
114
0
  else
115
0
    luaD_callnoyield(L, func, 0);
116
17.2M
}
117
118
119
lu_byte luaT_callTMres (lua_State *L, const TValue *f, const TValue *p1,
120
46.5M
                        const TValue *p2, StkId res) {
121
46.5M
  ptrdiff_t result = savestack(L, res);
122
46.5M
  StkId func = L->top.p;
123
46.5M
  setobj2s(L, func, f);  /* push function (assume EXTRA_STACK) */
124
46.5M
  setobj2s(L, func + 1, p1);  /* 1st argument */
125
46.5M
  setobj2s(L, func + 2, p2);  /* 2nd argument */
126
46.5M
  L->top.p += 3;
127
  /* metamethod may yield only when called from Lua code */
128
46.5M
  if (isLuacode(L->ci))
129
45.8M
    luaD_call(L, func, 1);
130
638k
  else
131
638k
    luaD_callnoyield(L, func, 1);
132
46.5M
  res = restorestack(L, result);
133
46.5M
  setobjs2s(L, res, --L->top.p);  /* move result to its place */
134
46.3M
  return ttypetag(s2v(res));  /* return tag of the result */
135
46.3M
}
136
137
138
static int callbinTM (lua_State *L, const TValue *p1, const TValue *p2,
139
6.85M
                      StkId res, TMS event) {
140
6.85M
  const TValue *tm = luaT_gettmbyobj(L, p1, event);  /* try first operand */
141
6.85M
  if (notm(tm))
142
2.89M
    tm = luaT_gettmbyobj(L, p2, event);  /* try second operand */
143
6.85M
  if (notm(tm))
144
507k
    return -1;  /* tag method not found */
145
6.34M
  else  /* call tag method and return the tag of the result */
146
6.34M
    return luaT_callTMres(L, tm, p1, p2, res);
147
6.85M
}
148
149
150
void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2,
151
4.94M
                    StkId res, TMS event) {
152
4.94M
  if (l_unlikely(callbinTM(L, p1, p2, res, event) < 0)) {
153
422k
    switch (event) {
154
102k
      case TM_BAND: case TM_BOR: case TM_BXOR:
155
260k
      case TM_SHL: case TM_SHR: case TM_BNOT: {
156
260k
        if (ttisnumber(p1) && ttisnumber(p2))
157
118k
          luaG_tointerror(L, p1, p2);
158
142k
        else
159
142k
          luaG_opinterror(L, p1, p2, "perform bitwise operation on");
160
260k
      }
161
      /* calls never return, but to avoid warnings: *//* FALLTHROUGH */
162
162k
      default:
163
162k
        luaG_opinterror(L, p1, p2, "perform arithmetic on");
164
422k
    }
165
422k
  }
166
4.94M
}
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
460k
void luaT_tryconcatTM (lua_State *L) {
174
460k
  StkId p1 = L->top.p - 2;  /* first argument */
175
460k
  if (l_unlikely(callbinTM(L, s2v(p1), s2v(p1 + 1), p1, TM_CONCAT) < 0))
176
9.17k
    luaG_concaterror(L, s2v(p1), s2v(p1 + 1));
177
460k
}
178
179
180
void luaT_trybinassocTM (lua_State *L, const TValue *p1, const TValue *p2,
181
752k
                                       int flip, StkId res, TMS event) {
182
752k
  if (flip)
183
212k
    luaT_trybinTM(L, p2, p1, res, event);
184
539k
  else
185
539k
    luaT_trybinTM(L, p1, p2, res, event);
186
752k
}
187
188
189
void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2,
190
190k
                                   int flip, StkId res, TMS event) {
191
190k
  TValue aux;
192
190k
  setivalue(&aux, i2);
193
190k
  luaT_trybinassocTM(L, p1, &aux, flip, res, event);
194
190k
}
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
1.44M
                      TMS event) {
208
1.44M
  int tag = callbinTM(L, p1, p2, L->top.p, event);  /* try original event */
209
1.44M
  if (tag >= 0)  /* found tag method? */
210
1.37M
    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
77.8k
  luaG_ordererror(L, p1, p2);  /* no metamethod found */
222
0
  return 0;  /* to avoid warnings */
223
1.44M
}
224
225
226
int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2,
227
64.2k
                       int flip, int isfloat, TMS event) {
228
64.2k
  TValue aux; const TValue *p2;
229
64.2k
  if (isfloat) {
230
6.08k
    setfltvalue(&aux, cast_num(v2));
231
6.08k
  }
232
58.1k
  else
233
58.1k
    setivalue(&aux, v2);
234
64.2k
  if (flip) {  /* arguments were exchanged? */
235
19.0k
    p2 = p1; p1 = &aux;  /* correct them */
236
19.0k
  }
237
45.2k
  else
238
45.2k
    p2 = &aux;
239
64.2k
  return luaT_callorderTM(L, p1, p2, event);
240
64.2k
}
241
242
243
void luaT_adjustvarargs (lua_State *L, int nfixparams, CallInfo *ci,
244
11.7M
                         const Proto *p) {
245
11.7M
  int i;
246
11.7M
  int actual = cast_int(L->top.p - ci->func.p) - 1;  /* number of arguments */
247
11.7M
  int nextra = actual - nfixparams;  /* number of extra arguments */
248
11.7M
  ci->u.l.nextraargs = nextra;
249
11.7M
  luaD_checkstack(L, p->maxstacksize + 1);
250
  /* copy function to the top of the stack */
251
11.7M
  setobjs2s(L, L->top.p++, ci->func.p);
252
  /* move fixed parameters to the top of the stack */
253
43.1M
  for (i = 1; i <= nfixparams; i++) {
254
31.4M
    setobjs2s(L, L->top.p++, ci->func.p + i);
255
31.4M
    setnilvalue(s2v(ci->func.p + i));  /* erase original parameter (for GC) */
256
31.4M
  }
257
11.7M
  ci->func.p += actual + 1;
258
11.7M
  ci->top.p += actual + 1;
259
11.7M
  lua_assert(L->top.p <= ci->top.p && ci->top.p <= L->stack_last.p);
260
11.7M
}
261
262
263
1.41M
void luaT_getvarargs (lua_State *L, CallInfo *ci, StkId where, int wanted) {
264
1.41M
  int i;
265
1.41M
  int nextra = ci->u.l.nextraargs;
266
1.41M
  if (wanted < 0) {
267
686k
    wanted = nextra;  /* get all extra arguments available */
268
686k
    checkstackp(L, nextra, where);  /* ensure stack space */
269
686k
    L->top.p = where + nextra;  /* next instruction will need top */
270
686k
  }
271
11.4M
  for (i = 0; i < wanted && i < nextra; i++)
272
10.0M
    setobjs2s(L, where + i, ci->func.p - nextra + i);
273
2.00M
  for (; i < wanted; i++)   /* complete required results with nil */
274
1.41M
    setnilvalue(s2v(where + i));
275
1.41M
}
276