Home
About
Blog
Products
Forum
Support
Contact
Sunbelt Computer Software
PL/B Language Development and Support
Home
About
Blog
Products
Forum
Support
Contact
lua/lmem.h at master · lua/lua · GitHub
Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
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
master
Breadcrumbs
lua
/
lmem.h
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
96 lines (72 loc) · 3.35 KB
master
Breadcrumbs
lua
/
lmem.h
Copy path
Top
File metadata and controls
Code
Blame
96 lines (72 loc) · 3.35 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
/*
** $Id: lmem.h $
** Interface to Memory Manager
** See Copyright Notice in lua.h
*/
#ifndef
lmem_h
#define
lmem_h
#include
<stddef.h>
#include
"llimits.h"
#include
"lua.h"
#define
luaM_error
(
L
) luaD_throw(L, LUA_ERRMEM)
/*
** This macro tests whether it is safe to multiply 'n' by the size of
** type 't' without overflows. Because 'e' is always constant, it avoids
** the runtime division MAX_SIZET/(e).
** (The macro is somewhat complex to avoid warnings: The 'sizeof'
** comparison avoids a runtime comparison when overflow cannot occur.
** The compiler should be able to optimize the real test by itself, but
** when it does it, it may give a warning about "comparison is always
** false due to limited range of data type"; the +1 tricks the compiler,
** avoiding this warning but also this optimization.)
*/
#define
luaM_testsize
(
n
,
e
) \
(sizeof(n) >= sizeof(size_t) && cast_sizet((n)) + 1 > MAX_SIZET/(e))
#define
luaM_checksize
(
L
,
n
,
e
) \
(luaM_testsize(n,e) ? luaM_toobig(L) : cast_void(0))
/*
** Computes the minimum between 'n' and 'MAX_SIZET/sizeof(t)', so that
** the result is not larger than 'n' and cannot overflow a 'size_t'
** when multiplied by the size of type 't'. (Assumes that 'n' is an
** 'int' and that 'int' is not larger than 'size_t'.)
*/
#define
luaM_limitN
(
n
,
t
) \
((cast_sizet(n) <= MAX_SIZET/sizeof(t)) ? (n) : \
cast_int((MAX_SIZET/sizeof(t))))
/*
** Arrays of chars do not need any test
*/
#define
luaM_reallocvchar
(
L
,
b
,
on
,
n
) \
cast_charp(luaM_saferealloc_(L, (b), (on)*sizeof(char), (n)*sizeof(char)))
#define
luaM_freemem
(
L
,
b
,
s
) luaM_free_(L, (b), (s))
#define
luaM_free
(
L
,
b
) luaM_free_(L, (b), sizeof(*(b)))
#define
luaM_freearray
(
L
,
b
,
n
) luaM_free_(L, (b), (n)*sizeof(*(b)))
#define
luaM_new
(
L
,
t
) cast(t*, luaM_malloc_(L, sizeof(t), 0))
#define
luaM_newvector
(
L
,
n
,
t
) \
cast(t*, luaM_malloc_(L, cast_sizet(n)*sizeof(t), 0))
#define
luaM_newvectorchecked
(
L
,
n
,
t
) \
(luaM_checksize(L,n,sizeof(t)), luaM_newvector(L,n,t))
#define
luaM_newobject
(
L
,
tag
,
s
) luaM_malloc_(L, (s), tag)
#define
luaM_newblock
(
L
,
size
) luaM_newvector(L, size, char)
#define
luaM_growvector
(
L
,
v
,
nelems
,
size
,
t
,
limit
,
e
) \
((v)=cast(t *, luaM_growaux_(L,v,nelems,&(size),sizeof(t), \
luaM_limitN(limit,t),e)))
#define
luaM_reallocvector
(
L
,
v
,
oldn
,
n
,
t
) \
(cast(t *, luaM_realloc_(L, v, cast_sizet(oldn) * sizeof(t), \
cast_sizet(n) * sizeof(t))))
#define
luaM_shrinkvector
(
L
,
v
,
size
,
fs
,
t
) \
((v)=cast(t *, luaM_shrinkvector_(L, v, &(size), fs, sizeof(t))))
LUAI_FUNC
l_noret
luaM_toobig
(
lua_State
*
L
);
/* not to be called directly */
LUAI_FUNC
void
*
luaM_realloc_
(
lua_State
*
L
,
void
*
block
,
size_t
oldsize
,
size_t
size
);
LUAI_FUNC
void
*
luaM_saferealloc_
(
lua_State
*
L
,
void
*
block
,
size_t
oldsize
,
size_t
size
);
LUAI_FUNC
void
luaM_free_
(
lua_State
*
L
,
void
*
block
,
size_t
osize
);
LUAI_FUNC
void
*
luaM_growaux_
(
lua_State
*
L
,
void
*
block
,
int
nelems
,
int
*
size
,
unsigned
size_elem
,
int
limit
,
const
char
*
what
);
LUAI_FUNC
void
*
luaM_shrinkvector_
(
lua_State
*
L
,
void
*
block
,
int
*
nelem
,
int
final_n
,
unsigned
size_elem
);
LUAI_FUNC
void
*
luaM_malloc_
(
lua_State
*
L
,
size_t
size
,
int
tag
);
#endif
You can’t perform that action at this time.