Home
About
Blog
Products
Forum
Support
Contact
Sunbelt Computer Software
PL/B Language Development and Support
Home
About
Blog
Products
Forum
Support
Contact
lua/lstring.c at 2f6f6abeba452bbbbaeb0e4d70e748e46d314894 · lua/lua · GitHub
Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Events
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
lua
lua
Repository navigation
Code
Actions
Security and quality
Insights
More
items
Files
Expand file tree
2f6f6abeba452bbbbaeb0e4d70e748e46d314894
Breadcrumbs
lua
/
lstring.c
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
283 lines (240 loc) · 7.58 KB
2f6f6ab
Breadcrumbs
lua
/
lstring.c
Copy path
Top
File metadata and controls
Code
Blame
283 lines (240 loc) · 7.58 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
/*
** $Id: lstring.c,v 2.61 2017/12/12 11:52:35 roberto Exp roberto $
** String table (keeps all strings handled by Lua)
** See Copyright Notice in lua.h
*/
#define
lstring_c
#define
LUA_CORE
#include
"lprefix.h"
#include
<string.h>
#include
"lua.h"
#include
"ldebug.h"
#include
"ldo.h"
#include
"lmem.h"
#include
"lobject.h"
#include
"lstate.h"
#include
"lstring.h"
/*
** Lua will use at most ~(2^LUAI_HASHLIMIT) bytes from a string to
** compute its hash
*/
#if
!defined(
LUAI_HASHLIMIT
)
#define
LUAI_HASHLIMIT
5
#endif
/*
** Maximum size for string table.
*/
#define
MAXSTRTB
cast_int(luaM_limitN(MAX_INT, TString*))
/*
** equality for long strings
*/
int
luaS_eqlngstr
(
TString
*
a
,
TString
*
b
) {
size_t
len
=
a
->
u
.
lnglen
;
lua_assert
(
a
->
tt
==
LUA_TLNGSTR
&&
b
->
tt
==
LUA_TLNGSTR
);
return
(
a
==
b
)
||
/* same instance or... */
((
len
==
b
->
u
.
lnglen
)
&&
/* equal length and ... */
(
memcmp
(
getstr
(
a
),
getstr
(
b
),
len
)
==
0
));
/* equal contents */
}
unsigned
int
luaS_hash
(
const
char
*
str
,
size_t
l
,
unsigned
int
seed
) {
unsigned
int
h
=
seed
^
cast
(
unsigned
int
,
l
);
size_t
step
=
(
l
>>
LUAI_HASHLIMIT
)
+
1
;
for
(;
l
>=
step
;
l
-=
step
)
h
^= ((
h
<<
5
)
+
(
h
>>
2
)
+
cast_byte
(
str
[
l
-
1
]));
return
h
;
}
unsigned
int
luaS_hashlongstr
(
TString
*
ts
) {
lua_assert
(
ts
->
tt
==
LUA_TLNGSTR
);
if
(
ts
->
extra
==
0
) {
/* no hash? */
ts
->
hash
=
luaS_hash
(
getstr
(
ts
),
ts
->
u
.
lnglen
,
ts
->
hash
);
ts
->
extra
=
1
;
/* now it has its hash */
}
return
ts
->
hash
;
}
static
void
tablerehash
(
TString
*
*
vect
,
int
osize
,
int
nsize
) {
int
i
;
for
(
i
=
osize
;
i
<
nsize
;
i
++
)
/* clear new elements */
vect
[
i
]
=
NULL
;
for
(
i
=
0
;
i
<
osize
;
i
++
) {
/* rehash old part of the array */
TString
*
p
=
vect
[
i
];
vect
[
i
]
=
NULL
;
while
(
p
) {
/* for each string in the list */
TString
*
hnext
=
p
->
u
.
hnext
;
/* save next */
unsigned
int
h
=
lmod
(
p
->
hash
,
nsize
);
/* new position */
p
->
u
.
hnext
=
vect
[
h
];
/* chain it into array */
vect
[
h
]
=
p
;
p
=
hnext
;
}
}
}
/*
** Resize the string table. If allocation fails, keep the current size.
** (This can degrade performance, but any non-zero size should work
** correctly.)
*/
void
luaS_resize
(
lua_State
*
L
,
int
nsize
) {
stringtable
*
tb
=
&
G
(
L
)
->
strt
;
int
osize
=
tb
->
size
;
TString
*
*
newvect
;
if
(
nsize
<
osize
)
/* shrinking table? */
tablerehash
(
tb
->
hash
,
osize
,
nsize
);
/* depopulate shrinking part */
newvect
=
luaM_reallocvector
(
L
,
tb
->
hash
,
osize
,
nsize
,
TString
*
);
if
(
newvect
==
NULL
) {
/* reallocation failed? */
if
(
nsize
<
osize
)
/* was it shrinking table? */
tablerehash
(
tb
->
hash
,
nsize
,
osize
);
/* restore to original size */
/* leave table as it was */
}
else
{
/* allocation succeeded */
tb
->
hash
=
newvect
;
tb
->
size
=
nsize
;
if
(
nsize
>
osize
)
tablerehash
(
newvect
,
osize
,
nsize
);
/* rehash for new size */
}
}
/*
** Clear API string cache. (Entries cannot be empty, so fill them with
** a non-collectable string.)
*/
void
luaS_clearcache
(
global_State
*
g
) {
int
i
,
j
;
for
(
i
=
0
;
i
<
STRCACHE_N
;
i
++
)
for
(
j
=
0
;
j
<
STRCACHE_M
;
j
++
) {
if
(
iswhite
(
g
->
strcache
[
i
][
j
]))
/* will entry be collected? */
g
->
strcache
[
i
][
j
]
=
g
->
nfield
;
/* replace it with something fixed */
}
}
/*
** Initialize the string table and the string cache
*/
void
luaS_init
(
lua_State
*
L
) {
global_State
*
g
=
G
(
L
);
int
i
,
j
;
TString
*
memerrmsg
;
stringtable
*
tb
=
&
G
(
L
)
->
strt
;
tb
->
hash
=
luaM_newvector
(
L
,
MINSTRTABSIZE
,
TString
*
);
tablerehash
(
tb
->
hash
,
0
,
MINSTRTABSIZE
);
/* clear array */
tb
->
size
=
MINSTRTABSIZE
;
/* pre-create memory-error message */
memerrmsg
=
luaS_newliteral
(
L
,
MEMERRMSG
);
luaC_fix
(
L
,
obj2gco
(
memerrmsg
));
/* it should never be collected */
g
->
nfield
=
luaS_newliteral
(
L
,
"n"
);
/* pre-create "n" field name */
luaC_fix
(
L
,
obj2gco
(
g
->
nfield
));
/* it also should never be collected */
for
(
i
=
0
;
i
<
STRCACHE_N
;
i
++
)
/* fill cache with valid strings */
for
(
j
=
0
;
j
<
STRCACHE_M
;
j
++
)
g
->
strcache
[
i
][
j
]
=
g
->
nfield
;
}
/*
** creates a new string object
*/
static
TString
*
createstrobj
(
lua_State
*
L
,
size_t
l
,
int
tag
,
unsigned
int
h
) {
TString
*
ts
;
GCObject
*
o
;
size_t
totalsize
;
/* total size of TString object */
totalsize
=
sizelstring
(
l
);
o
=
luaC_newobj
(
L
,
tag
,
totalsize
);
ts
=
gco2ts
(
o
);
ts
->
hash
=
h
;
ts
->
extra
=
0
;
getstr
(
ts
)[
l
]
=
'\0'
;
/* ending 0 */
return
ts
;
}
TString
*
luaS_createlngstrobj
(
lua_State
*
L
,
size_t
l
) {
TString
*
ts
=
createstrobj
(
L
,
l
,
LUA_TLNGSTR
,
G
(
L
)
->
seed
);
ts
->
u
.
lnglen
=
l
;
return
ts
;
}
void
luaS_remove
(
lua_State
*
L
,
TString
*
ts
) {
stringtable
*
tb
=
&
G
(
L
)
->
strt
;
TString
*
*
p
=
&
tb
->
hash
[
lmod
(
ts
->
hash
,
tb
->
size
)];
while
(
*
p
!=
ts
)
/* find previous element */
p
=
&
(
*
p
)
->
u
.
hnext
;
*
p
=
(
*
p
)
->
u
.
hnext
;
/* remove element from its list */
tb
->
nuse
--
;
}
static
void
growstrtab
(
lua_State
*
L
,
stringtable
*
tb
) {
if
(
tb
->
nuse
==
MAX_INT
) {
/* too many strings? */
luaC_fullgc
(
L
,
1
);
/* try to free some... */
if
(
tb
->
nuse
==
MAX_INT
)
/* still too many? */
luaM_error
(
L
);
/* cannot even create a message... */
}
if
(
tb
->
size
<=
MAXSTRTB
/
2
)
/* can grow string table? */
luaS_resize
(
L
,
tb
->
size
*
2
);
}
/*
** Checks whether short string exists and reuses it or creates a new one.
*/
static
TString
*
internshrstr
(
lua_State
*
L
,
const
char
*
str
,
size_t
l
) {
TString
*
ts
;
global_State
*
g
=
G
(
L
);
stringtable
*
tb
=
&
g
->
strt
;
unsigned
int
h
=
luaS_hash
(
str
,
l
,
g
->
seed
);
TString
*
*
list
=
&
tb
->
hash
[
lmod
(
h
,
tb
->
size
)];
lua_assert
(
str
!=
NULL
);
/* otherwise 'memcmp'/'memcpy' are undefined */
for
(
ts
=
*
list
;
ts
!=
NULL
;
ts
=
ts
->
u
.
hnext
) {
if
(
l
==
ts
->
shrlen
&&
(
memcmp
(
str
,
getstr
(
ts
),
l
*
sizeof
(
char
))
==
0
)) {
/* found! */
if
(
isdead
(
g
,
ts
))
/* dead (but not collected yet)? */
changewhite
(
ts
);
/* resurrect it */
return
ts
;
}
}
/* else must create a new string */
if
(
tb
->
nuse
>=
tb
->
size
) {
/* need to grow string table? */
growstrtab
(
L
,
tb
);
list
=
&
tb
->
hash
[
lmod
(
h
,
tb
->
size
)];
/* rehash with new size */
}
ts
=
createstrobj
(
L
,
l
,
LUA_TSHRSTR
,
h
);
memcpy
(
getstr
(
ts
),
str
,
l
*
sizeof
(
char
));
ts
->
shrlen
=
cast_byte
(
l
);
ts
->
u
.
hnext
=
*
list
;
*
list
=
ts
;
tb
->
nuse
++
;
return
ts
;
}
/*
** new string (with explicit length)
*/
TString
*
luaS_newlstr
(
lua_State
*
L
,
const
char
*
str
,
size_t
l
) {
if
(
l
<=
LUAI_MAXSHORTLEN
)
/* short string? */
return
internshrstr
(
L
,
str
,
l
);
else
{
TString
*
ts
;
if
(
l
>= (
MAX_SIZE
-
sizeof
(
TString
))/
sizeof
(
char
))
luaM_toobig
(
L
);
ts
=
luaS_createlngstrobj
(
L
,
l
);
memcpy
(
getstr
(
ts
),
str
,
l
*
sizeof
(
char
));
return
ts
;
}
}
/*
** Create or reuse a zero-terminated string, first checking in the
** cache (using the string address as a key). The cache can contain
** only zero-terminated strings, so it is safe to use 'strcmp' to
** check hits.
*/
TString
*
luaS_new
(
lua_State
*
L
,
const
char
*
str
) {
unsigned
int
i
=
point2uint
(
str
) %
STRCACHE_N
;
/* hash */
int
j
;
TString
*
*
p
=
G
(
L
)
->
strcache
[
i
];
for
(
j
=
0
;
j
<
STRCACHE_M
;
j
++
) {
if
(
strcmp
(
str
,
getstr
(
p
[
j
]))
==
0
)
/* hit? */
return
p
[
j
];
/* that is it */
}
/* normal route */
for
(
j
=
STRCACHE_M
-
1
;
j
>
0
;
j
--
)
p
[
j
]
=
p
[
j
-
1
];
/* move out last element */
/* new element is first in the list */
p
[
0
]
=
luaS_newlstr
(
L
,
str
,
strlen
(
str
));
return
p
[
0
];
}
Udata
*
luaS_newudata
(
lua_State
*
L
,
size_t
s
) {
Udata
*
u
;
GCObject
*
o
;
if
(
s
>
MAX_SIZE
-
sizeof
(
Udata
))
luaM_toobig
(
L
);
o
=
luaC_newobj
(
L
,
LUA_TUSERDATA
,
sizeludata
(
s
));
u
=
gco2u
(
o
);
u
->
len
=
s
;
u
->
metatable
=
NULL
;
setuservalue
(
L
,
u
,
luaO_nilobject
);
return
u
;
}
You can’t perform that action at this time.