Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister

Re: Recursing in XS?

by bulk88 (Priest)
on Apr 20, 2013 at 04:28 UTC ( #1029618=note: print w/ replies, xml ) Need Help??

in reply to Recursing in XS?

use call_sv or call_pv to call yourself again. You can also do the hackish

PUSHMARK(SP); PUSHs(somesv); PUTBACK; XS_Foo__Bar_Func(aTHX_ cv); SPAGAIN; retval = POPs; /* did we get 1 elem? this code just assumes*/ /* ?????? */
Which bypasses the Interp almost completely and is more efficient. The problem with the above is, if the child XSUB being called raw dies/croaks, the error message will put the blame as the parent XSUB since the global state info wasn't updated in the interp. Also note the parent XSUB is passing its CV to the child XSUB, so ALIAS/XSANY will break if the parent isn't the child and the child relies on XSANY/ALIAS to operate. How to calculate the number of items XS_Foo__Bar_Func returned IDK. It probably involves the delta between C auto SV * mark and SP and +0, +1 or -1 SV*. Another thing, Perl uses malloc memory to implement pure perl opcode recursion, XSUBs use C stack memory. You might get an access vio/segv on deep recursion instead of a descriptive fatal error in pure perl.

Comment on Re: Recursing in XS?
Download Code

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1029618]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (6)
As of 2015-11-28 13:05 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (741 votes), past polls