Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re: SvPV Segmentation Fault

by Khen1950fx (Canon)
on Apr 25, 2012 at 22:35 UTC ( #967196=note: print w/ replies, xml ) Need Help??


in reply to SvPV Segmentation Fault

I tried it, keeping it simple---no segmentation fault.

#!/usr/bin/perl -l use strict; use warnings; use Inline C => <<'END_C'; void foo( SV *sv ) { if( sv ) { printf( "%s\n", SvPV_nolen( sv ) ); return; } } void bar( SV *sv ) { printf( "%i\n", SvPOK( sv ) ); } END_C foo('asdf'); foo(1); bar(0);


Comment on Re: SvPV Segmentation Fault
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (6)
As of 2014-12-27 22:42 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (177 votes), past polls