Yes I suppose... though that just sounds like a problem for a hash - keep track of the addresses you're snarfing and when you rebuild the code just (and I don't *think* that's a big just) put it back together the right way. I don't know how the code refs are stored I'm just commenting on the feasibility of getting at all the data in a code ref. From my perspective it's possible and isn't weird somehow.
I've been thinking that it would be interesting to walk the opcode tree and symbol table to enumerate everything and then see where the gaps are. ;-) It sort of addresses the same idea since that idea is implementable using pure perl - no C compiler required.
__SIG__
printf "You are here %08x\n", unpack "L!", unpack "P4", pack "L!", B::svref_2object(sub{})->OUTSIDE
In reply to Re: Re: Re: •Re: Upgrade B::Deparse?
by diotalevi
in thread Upgrade B::Deparse?
by Hrunting
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |