On 10/25/06, Adam Thomason <[EMAIL PROTECTED]> wrote:
Adding the file to the INTERP_O_FILES section in
config/gen/makefiles/root.in and re-running Configure should do the trick.
--AT
Thanks a lot, it works !
Karl
On 10/23/06, Jonathan Worthington <[EMAIL PROTECTED]> wrote:
Karl Forner wrote:
> I've added one C src file, say src/foo.c, and include/parrot/foo.h, and
a
> test in t/src/foo.t.
> I've changed the MANIFEST file accordingly, but I can not manage to
> have my
Hi,
I've added one C src file, say src/foo.c, and include/parrot/foo.h, and a
test in t/src/foo.t.
I've changed the MANIFEST file accordingly, but I can not manage to have my
foo.o file to be added in libparrot.a (after a make clean;perl Configure.pl
;make)
What did I miss ?
Thanks,
Karl
On 10/18/06, Leopold Toetsch <[EMAIL PROTECTED]> wrote:
IMHO the only way to get rid of this historical confusion is:
- disable the set opcode for arrays by throwing an exception in the vtable
- use elements for getting .elems only
- implement 2 new opcodes
elements P0, I0# fill with defa
Hi, Just checked out parrot and the build failed like this:cc -o miniparrot -L/usr/local/lib -Wl,-E compilers/imcc/main.o \ -Wl,-rpath=/home/kforner/dev/parrot/test/parrot/blib/lib -L/home/kforner/dev/parrot/test/parrot/blib/lib -lparrot -ldl -lm -lpthread -lcrypt -lrt src/null_config.o
compi
Hi,
It could be useful to have a way to know the exact memory footprint of any
PMC.
For instance, suppose that each PMC must override/implement a method
get_allocated_size(), it could be used to
optimize programs that takes too much memory, or to debug/optimize PMC
implementation.
That method cou
Hi,
Is there a way to specify a minimum allocation size for PMCs like strings or
arrays ?
Something like in perl : %h = 1000 ?
It could boost execution times when you have a good idea of the space you
need.
For example, I'd like to do:
#ensure that the array has enough allocated storage for 100
, I can go on and implement it with a
custom, simple and small implementation, but I've still 2 solutions for
Resizables :
- either grow smartly only on the right (push, pop), an alloc/copy when
changes are needed on the left (that saves on INTVAL attribute)
- allocate a third INTVAL attribute on the heap, and grows smartly in both
directions
Thank you very much for your attention
Karl Forner
On 10/5/06, Leopold Toetsch <[EMAIL PROTECTED]> wrote:
Am Donnerstag, 5. Oktober 2006 01:49 schrieb Karl Forner:
>
> Whare the requirements/constraints of a ResizableBooleanArray ? e.g are
> unshift to be less frequent that shift ?
shift and unshift are both more unlikely
Yes, I've always why ResizableBooleanArray extends FixedBooleanArray and
why
FixedBooleanArray is not simply a special case of ResizableBooleanArray.
Because a FixedBooleanArray is simpler, so that it may use less memory and
be implemented more efficiently I suppose.
Is there a real differenc
unshift to be less frequent that shift ?
What's a typical usage test case ?
Should I keep the actual implementation concept : allocating by chunks of 64
bytes ?
Waiting for your input...
Karl Forner
ResizeBooleanArray allows negative indexes
while not in FixedBooleanArray. Is it expected ?
Are there any specs or guidelines for that sort of stuff ?
Thanks,
Karl Forner
n help. If the parrot interpreter in in your
path, you can workaround
the need to specify the aboslute path by using the env command.
For instance:
#! /usr/bin/env parrot
I used that trick to enable the use of perl scripts in a multi-platform but
shared filesystem environment.
My 2 cents...
Karl Forner
METHOD INTVAL get_allocated_size() {
return PMC_int_val2(SELF); /* or whatever */
}
great, exactly what I needed
thanks
karl
ements()
But it did not work...
In fact, what I really want to do, for debugging purposes, is to add a
custom method in the FixedBooleanArray.pmc (e.g get_allocated_size() ) and
be able to call it
from PIR test code.
Thanks
Karl Forner
On 9/15/06, Leopold Toetsch <[EMAIL PROTECTED]> wrote:
Am Donnerstag, 14. September 2006 02:54 schrieb Karl Forner:
> Hello,
>
> So I propose a new implementation that solve the bugs, and that is
linear
> in space and time, and hopefully produce
> an optimal list of moves.
On 9/15/06, Leopold Toetsch <[EMAIL PROTECTED]> wrote:
Am Freitag, 15. September 2006 01:42 schrieb Karl Forner:
> But by looking in other tests and in the Parrot::Test, it seems that the
> canonical way
> of running a PIR script is through the example_output_is() function.
>
"opt").
But it is undocumented and not very robust, so What Should I do ?
Thanks,
Karl Forner
not implemented.So I hope that this work could prove useful, I would be very glad if I could help the development of parrot.Regards,Karl Forner
Index: t/compilers/imcc/imcpasm/optc.t
===
--- t/compilers/imcc/imcpasm/optc.t (revision 14
On 2/25/06, Leopold Toetsch <[EMAIL PROTECTED]> wrote:
>
> Leopold Toetsch (via RT) wrote:
>
> > fill the function body of Parrot_register_move() (src/utils.c 633 ff).
>
> Parrot is now using this function [1] for recursive tailcalls. There are
> 2 new tests in t/compilers/imcc/imcpasm/optc.t.
>
>
Hello,
I've played a little with 'make html', and the docs produced seem to me much
more useful than the docs available on the parrotcode.org website.
What I particularly appreciate is the hyperlinks to other pod documents and
the ability to browse the source code, the examples, the tests and so o
On 2/21/06, Allison Randal <[EMAIL PROTECTED]> wrote:
>
> On Feb 20, 2006, at 9:56, Bernhard Schmalhofer wrote:
> >
> >> P.S
> >> I suppose that I'm not the only one willing to help facing this
> >> difficulty.
> >> Maybe a tutorial or a FAQ could attract more contributors ?
> >>
> > Yes.
>
> In fa
I apologize for my probably naive question...
Trying to decipher t/pmc/array.t, I began wondering what happens if you set
a negative length to an array.
It lead me to array.pmc::set_integer_native, which just forwards its size
argument to list.c::list_set_length
without any check.
list_set_leng
Hi all,
I'd really like to try helping developing Perl6 and Parrot, I subscribed to
the mailing-list, read some docs, got and compiled
parrot via svn (in a vmware-played ubuntu ;-) ).
But it is not obvious to see where to begin, and where I can be useful.
My main objective is to have a fast, rel
24 matches
Mail list logo