Searched refs:max_limit (Results 1 - 9 of 9) sorted by relevance

/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/pcre-8.31/sljit/
H A DsljitUtils.c161 SLJIT_API_FUNC_ATTRIBUTE struct sljit_stack* SLJIT_CALL sljit_allocate_stack(sljit_uw limit, sljit_uw max_limit) argument
172 if (limit > max_limit || limit < 1)
190 /* Align limit and max_limit. */
191 max_limit = (max_limit + sljit_page_align) & ~sljit_page_align;
198 base.ptr = VirtualAlloc(0, max_limit, MEM_RESERVE, PAGE_READWRITE);
205 stack->max_limit = stack->base + max_limit;
211 base.ptr = mmap(0, max_limit, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANON, -1, 0);
218 stack->max_limit
[all...]
H A DsljitLir.h819 sljit_uw max_limit; member in struct:sljit_stack
823 Note: limit and max_limit contains the size for stack allocation
825 SLJIT_API_FUNC_ATTRIBUTE struct sljit_stack* SLJIT_CALL sljit_allocate_stack(sljit_uw limit, sljit_uw max_limit);
830 max_limit, it will fail. It is very easy to implement a stack data structure,
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/pcre-8.31/sljit/
H A DsljitUtils.c161 SLJIT_API_FUNC_ATTRIBUTE struct sljit_stack* SLJIT_CALL sljit_allocate_stack(sljit_uw limit, sljit_uw max_limit) argument
172 if (limit > max_limit || limit < 1)
190 /* Align limit and max_limit. */
191 max_limit = (max_limit + sljit_page_align) & ~sljit_page_align;
198 base.ptr = VirtualAlloc(0, max_limit, MEM_RESERVE, PAGE_READWRITE);
205 stack->max_limit = stack->base + max_limit;
211 base.ptr = mmap(0, max_limit, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANON, -1, 0);
218 stack->max_limit
[all...]
H A DsljitLir.h819 sljit_uw max_limit; member in struct:sljit_stack
823 Note: limit and max_limit contains the size for stack allocation
825 SLJIT_API_FUNC_ATTRIBUTE struct sljit_stack* SLJIT_CALL sljit_allocate_stack(sljit_uw limit, sljit_uw max_limit);
830 max_limit, it will fail. It is very easy to implement a stack data structure,
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/pcre-8.31/sljit/
H A DsljitUtils.c161 SLJIT_API_FUNC_ATTRIBUTE struct sljit_stack* SLJIT_CALL sljit_allocate_stack(sljit_uw limit, sljit_uw max_limit) argument
172 if (limit > max_limit || limit < 1)
190 /* Align limit and max_limit. */
191 max_limit = (max_limit + sljit_page_align) & ~sljit_page_align;
198 base.ptr = VirtualAlloc(0, max_limit, MEM_RESERVE, PAGE_READWRITE);
205 stack->max_limit = stack->base + max_limit;
211 base.ptr = mmap(0, max_limit, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANON, -1, 0);
218 stack->max_limit
[all...]
H A DsljitLir.h819 sljit_uw max_limit; member in struct:sljit_stack
823 Note: limit and max_limit contains the size for stack allocation
825 SLJIT_API_FUNC_ATTRIBUTE struct sljit_stack* SLJIT_CALL sljit_allocate_stack(sljit_uw limit, sljit_uw max_limit);
830 max_limit, it will fail. It is very easy to implement a stack data structure,
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/pcre-8.31/
H A Dpcre_jit_compile.c7257 local_stack.max_limit = local_stack.limit;
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/pcre-8.31/
H A Dpcre_jit_compile.c7257 local_stack.max_limit = local_stack.limit;
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/pcre-8.31/
H A Dpcre_jit_compile.c7257 local_stack.max_limit = local_stack.limit;

Completed in 145 milliseconds