summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMike Pall <mike>2017-03-08 23:01:47 +0100
committerMike Pall <mike>2017-03-08 23:01:47 +0100
commitd62459fc3949baca5ee1c1919feb4f4979bb09c6 (patch)
treedc2e347fb2dcc34fa46919993998f7cb8a645bbc
parent4e308361bf730ef3d288db5b71489ecf442f738c (diff)
downloadluajit2-d62459fc3949baca5ee1c1919feb4f4979bb09c6.tar.gz
Limit mcode alloc probing, depending on the available pool size.
Contributed by Alexey Kopytov.
-rw-r--r--src/lj_mcode.c3
1 files changed, 2 insertions, 1 deletions
diff --git a/src/lj_mcode.c b/src/lj_mcode.c
index f0cf22ca..bb7cf96b 100644
--- a/src/lj_mcode.c
+++ b/src/lj_mcode.c
@@ -230,7 +230,8 @@ static void *mcode_alloc(jit_State *J, size_t sz)
/* First try a contiguous area below the last one. */
uintptr_t hint = J->mcarea ? (uintptr_t)J->mcarea - sz : 0;
int i;
- for (i = 0; i < 32; i++) { /* 32 attempts ought to be enough ... */
+ /* Limit probing iterations, depending on the available pool size. */
+ for (i = 0; i < LJ_TARGET_JUMPRANGE; i++) {
if (mcode_validptr(hint)) {
void *p = mcode_alloc_at(J, hint, sz, MCPROT_GEN);