Hi Ralf,
Many thanks! I will keep an eye on SVN development and will be available
for testing!
Philip told me, that I can simply reconstruct repetitions in JIT, instead of
introducing new opcodes and do other changes in the interpreter. The
reconstruction is imprecise, e.g
Hi,
definitely worth investigating it. However, I cannot see it on my 64 bit Linux
machine. I have some questions:
- these patterns simply match to ab, because of the non-greedy quantifier.
That requires a very small amount of memory. Is this intentional? What is your
input for these
On 19.03.2013 11:38, Zoltán Herczeg wrote:
I am sorry, I misunderstood your question. It is about compilation
not running the pattern.
Correct. The increase is on compilation, not on running the pattern.
On my 64 bit Linux, the stack size reported by valgrind is:
I can not test on Linux.
Hi
My compiler and environment are very different from yours. In particular
I do not have alloca(). I replaced the only call to alloca() by char
array[SLJIT_MAX_LOCAL_SIZE]; according to your recommendation a long
time ago.
But this also affects runtime only, not compile time. I am afraid it
