1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466
|
/**
* perl-libxml-mm.c
* $Id: perl-libxml-mm.c 206 2008-01-29 21:08:07Z pajas $
*
* Basic concept:
* perl varies in the implementation of UTF8 handling. this header (together
* with the c source) implements a few functions, that can be used from within
* the core module inorder to avoid cascades of c pragmas
*/
#ifdef __cplusplus
extern "C" {
#endif
#include <stdarg.h>
#include <stdlib.h>
#include "perl-libxml-mm.h"
#include "XSUB.h"
#include <libxml/tree.h>
#ifdef __cplusplus
}
#endif
#ifdef XS_WARNINGS
#define xs_warn(string) warn(string)
/* #define xs_warn(string) fprintf(stderr, string) */
#else
#define xs_warn(string)
#endif
/**
* this is a wrapper function that does the type evaluation for the
* node. this makes the code a little more readable in the .XS
*
* the code is not really portable, but i think we'll avoid some
* memory leak problems that way.
**/
const char*
x_PmmNodeTypeName( xmlNodePtr elem ){
const char *name = "XML::LibXML::Node";
if ( elem != NULL ) {
switch ( elem->type ) {
case XML_ELEMENT_NODE:
name = "XML::LibXML::Element";
break;
case XML_TEXT_NODE:
name = "XML::LibXML::Text";
break;
case XML_COMMENT_NODE:
name = "XML::LibXML::Comment";
break;
case XML_CDATA_SECTION_NODE:
name = "XML::LibXML::CDATASection";
break;
case XML_ATTRIBUTE_NODE:
name = "XML::LibXML::Attr";
break;
case XML_DOCUMENT_NODE:
case XML_HTML_DOCUMENT_NODE:
name = "XML::LibXML::Document";
break;
case XML_DOCUMENT_FRAG_NODE:
name = "XML::LibXML::DocumentFragment";
break;
case XML_NAMESPACE_DECL:
name = "XML::LibXML::Namespace";
break;
case XML_DTD_NODE:
name = "XML::LibXML::Dtd";
break;
case XML_PI_NODE:
name = "XML::LibXML::PI";
break;
default:
name = "XML::LibXML::Node";
break;
};
return name;
}
return "";
}
/*
* This is XML::LibXSLT specific:
*
* a pointer to XML::LibXML's registry of all current proxy nodes
*/
extern ProxyNodePtr* PROXY_NODE_REGISTRY_PTR;
#define PROXY_NODE_REGISTRY *PROXY_NODE_REGISTRY_PTR
/*
* @proxy: proxy node to register
*
* adds a proxy node to the proxy node registry
*/
void
x_PmmRegisterProxyNode(ProxyNodePtr proxy)
{
proxy->_registry = PROXY_NODE_REGISTRY;
PROXY_NODE_REGISTRY = proxy;
}
/*
* @proxy: proxy node to remove
*
* removes a proxy node from the proxy node registry
*/
void
x_PmmUnregisterProxyNode(ProxyNodePtr proxy)
{
ProxyNodePtr cur = PROXY_NODE_REGISTRY;
if( PROXY_NODE_REGISTRY == proxy ) {
PROXY_NODE_REGISTRY = proxy->_registry;
}
else if (cur!=NULL) {
while(cur->_registry != NULL)
{
if( cur->_registry == proxy )
{
cur->_registry = proxy->_registry;
break;
}
cur = cur->_registry;
}
} else {
warn("XML::LibXSLT: Unregistering a node while no node was registered?");
}
}
/*
* increments all proxy node counters by one (called on thread spawn)
*/
void
x_PmmCloneProxyNodes()
{
ProxyNodePtr cur = PROXY_NODE_REGISTRY;
while(cur != NULL)
{
x_PmmREFCNT_inc(cur);
cur = cur->_registry;
}
}
/*
* returns the current number of proxy nodes in the registry
*/
int
x_PmmProxyNodeRegistrySize()
{
int i = 0;
ProxyNodePtr cur = PROXY_NODE_REGISTRY;
while(cur != NULL)
{
++i;
cur = cur->_registry;
}
return i;
}
/* creates a new proxy node from a given node. this function is aware
* about the fact that a node may already has a proxy structure.
*/
ProxyNodePtr
x_PmmNewNode(xmlNodePtr node)
{
ProxyNodePtr proxy = NULL;
if ( node == NULL ) {
xs_warn( "x_PmmNewNode: no node found\n" );
return NULL;
}
if ( node->_private == NULL ) {
/* proxy = (ProxyNodePtr)malloc(sizeof(struct _ProxyNode)); */
Newc(0, proxy, 1, ProxyNode, ProxyNode);
if (proxy != NULL) {
proxy->node = node;
proxy->owner = NULL;
proxy->count = 0;
proxy->encoding= 0;
proxy->_registry = NULL;
node->_private = (void*) proxy;
x_PmmRegisterProxyNode(proxy);
}
}
else {
proxy = (ProxyNodePtr)node->_private;
if (proxy->_registry==NULL && PROXY_NODE_REGISTRY!=proxy) {
x_PmmRegisterProxyNode(proxy);
}
}
return proxy;
}
ProxyNodePtr
x_PmmNewFragment(xmlDocPtr doc)
{
ProxyNodePtr retval = NULL;
xmlNodePtr frag = NULL;
xs_warn("x_PmmNewFragment: new frag\n");
frag = xmlNewDocFragment( doc );
retval = x_PmmNewNode(frag);
/* fprintf(stderr, "REFCNT NOT incremented on frag: 0x%08.8X\n", retval); */
if ( doc != NULL ) {
xs_warn("x_PmmNewFragment: inc document\n");
/* under rare circumstances _private is not set correctly? */
if ( doc->_private != NULL ) {
xs_warn("x_PmmNewFragment: doc->_private being incremented!\n");
x_PmmREFCNT_inc(((ProxyNodePtr)doc->_private));
/* fprintf(stderr, "REFCNT incremented on doc: 0x%08.8X\n", doc->_private); */
}
retval->owner = (xmlNodePtr)doc;
}
return retval;
}
/* frees the node if nessecary. this method is aware, that libxml2
* has several diffrent nodetypes.
*/
void
x_PmmFreeNode( xmlNodePtr node )
{
switch( node->type ) {
case XML_DOCUMENT_NODE:
case XML_HTML_DOCUMENT_NODE:
xs_warn("x_PmmFreeNode: XML_DOCUMENT_NODE\n");
xmlFreeDoc( (xmlDocPtr) node );
break;
case XML_ATTRIBUTE_NODE:
xs_warn("x_PmmFreeNode: XML_ATTRIBUTE_NODE\n");
if ( node->parent == NULL ) {
xs_warn( "x_PmmFreeNode: free node!\n");
node->ns = NULL;
xmlFreeProp( (xmlAttrPtr) node );
}
break;
case XML_DTD_NODE:
if ( node->doc != NULL ) {
if ( node->doc->extSubset != (xmlDtdPtr)node
&& node->doc->intSubset != (xmlDtdPtr)node ) {
xs_warn( "x_PmmFreeNode: XML_DTD_NODE\n");
node->doc = NULL;
xmlFreeDtd( (xmlDtdPtr)node );
}
} else {
xs_warn( "x_PmmFreeNode: XML_DTD_NODE (no doc)\n");
xmlFreeDtd( (xmlDtdPtr)node );
}
break;
case XML_DOCUMENT_FRAG_NODE:
xs_warn("x_PmmFreeNode: XML_DOCUMENT_FRAG_NODE\n");
default:
xs_warn( "x_PmmFreeNode: normal node\n" );
xmlFreeNode( node);
break;
}
}
/* decrements the proxy counter. if the counter becomes zero or less,
this method will free the proxy node. If the node is part of a
subtree, x_PmmREFCNT_dec will fix the reference counts and delete
the subtree if it is not required any more.
*/
int
x_PmmREFCNT_dec( ProxyNodePtr node )
{
xmlNodePtr libnode = NULL;
ProxyNodePtr owner = NULL;
int retval = 0;
if ( node != NULL ) {
retval = x_PmmREFCNT(node)--;
/* fprintf(stderr, "REFCNT on 0x%08.8X decremented to %d\n", node, x_PmmREFCNT(node)); */
if ( x_PmmREFCNT(node) < 0 )
warn( "x_PmmREFCNT_dec: REFCNT decremented below 0!" );
if ( x_PmmREFCNT(node) <= 0 ) {
xs_warn( "x_PmmREFCNT_dec: NODE DELETION\n" );
libnode = x_PmmNODE( node );
if ( libnode != NULL ) {
if ( libnode->_private != node ) {
xs_warn( "x_PmmREFCNT_dec: lost node\n" );
libnode = NULL;
}
else {
libnode->_private = NULL;
}
}
x_PmmNODE( node ) = NULL;
if ( x_PmmOWNER(node) && x_PmmOWNERPO(node) ) {
xs_warn( "x_PmmREFCNT_dec: DOC NODE!\n" );
owner = x_PmmOWNERPO(node);
x_PmmOWNER( node ) = NULL;
if( libnode != NULL && libnode->parent == NULL ) {
/* this is required if the node does not directly
* belong to the document tree
*/
xs_warn( "x_PmmREFCNT_dec: REAL DELETE\n" );
x_PmmFreeNode( libnode );
}
xs_warn( "x_PmmREFCNT_dec: decrease owner\n" );
x_PmmREFCNT_dec( owner );
}
else if ( libnode != NULL ) {
xs_warn( "x_PmmREFCNT_dec: STANDALONE REAL DELETE\n" );
x_PmmFreeNode( libnode );
}
x_PmmUnregisterProxyNode(node);
Safefree( node );
/* free( node ); */
}
}
else {
xs_warn("x_PmmREFCNT_dec: lost node\n" );
}
return retval;
}
/* @node: the node that should be wrapped into a SV
* @owner: perl instance of the owner node (may be NULL)
*
* This function will create a real perl instance of a given node.
* the function is called directly by the XS layer, to generate a perl
* instance of the node. All node reference counts are updated within
* this function. Therefore this function returns a node that can
* directly be used as output.
*
* if @ower is NULL or undefined, the node is ment to be the root node
* of the tree. this node will later be used as an owner of other
* nodes.
*/
SV*
x_PmmNodeToSv( xmlNodePtr node, ProxyNodePtr owner )
{
ProxyNodePtr dfProxy= NULL;
SV * retval = &PL_sv_undef;
const char * CLASS = "XML::LibXML::Node";
if ( node != NULL ) {
/* find out about the class */
CLASS = x_PmmNodeTypeName( node );
xs_warn("x_PmmNodeToSv: return new perl node of class:\n");
xs_warn( CLASS );
if ( node->_private != NULL ) {
dfProxy = x_PmmNewNode(node);
/* warn(" at 0x%08.8X\n", dfProxy); */
}
else {
dfProxy = x_PmmNewNode(node);
/* fprintf(stderr, " at 0x%08.8X\n", dfProxy); */
if ( dfProxy != NULL ) {
if ( owner != NULL ) {
dfProxy->owner = x_PmmNODE( owner );
x_PmmREFCNT_inc( owner );
/* fprintf(stderr, "REFCNT incremented on owner: 0x%08.8X\n", owner); */
}
else {
xs_warn("x_PmmNodeToSv: node contains itself (owner==NULL)\n");
}
}
else {
xs_warn("x_PmmNodeToSv: proxy creation failed!\n");
}
}
retval = NEWSV(0,0);
sv_setref_pv( retval, CLASS, (void*)dfProxy );
x_PmmREFCNT_inc(dfProxy);
/* fprintf(stderr, "REFCNT incremented on node: 0x%08.8X\n", dfProxy); */
switch ( node->type ) {
case XML_DOCUMENT_NODE:
case XML_HTML_DOCUMENT_NODE:
case XML_DOCB_DOCUMENT_NODE:
if ( ((xmlDocPtr)node)->encoding != NULL ) {
dfProxy->encoding = (int)xmlParseCharEncoding( (const char*)((xmlDocPtr)node)->encoding );
}
break;
default:
break;
}
}
else {
xs_warn( "x_PmmNodeToSv: no node found!\n" );
}
return retval;
}
/* extracts the libxml2 node from a perl reference
*/
xmlNodePtr
x_PmmSvNodeExt( SV* perlnode, int copy )
{
xmlNodePtr retval = NULL;
ProxyNodePtr proxy = NULL;
if ( perlnode != NULL && perlnode != &PL_sv_undef ) {
/* if ( sv_derived_from(perlnode, "XML::LibXML::Node") */
/* && SvPROXYNODE(perlnode) != NULL ) { */
/* retval = x_PmmNODE( SvPROXYNODE(perlnode) ) ; */
/* } */
xs_warn("x_PmmSvNodeExt: perlnode found\n" );
if ( sv_derived_from(perlnode, "XML::LibXML::Node") ) {
proxy = SvPROXYNODE(perlnode);
if ( proxy != NULL ) {
xs_warn( "x_PmmSvNodeExt: is a xmlNodePtr structure\n" );
retval = x_PmmNODE( proxy ) ;
}
if ( retval != NULL
&& ((ProxyNodePtr)retval->_private) != proxy ) {
xs_warn( "x_PmmSvNodeExt: no node in proxy node\n" );
x_PmmNODE( proxy ) = NULL;
retval = NULL;
}
}
#ifdef XML_LIBXML_GDOME_SUPPORT
else if ( sv_derived_from( perlnode, "XML::GDOME::Node" ) ) {
GdomeNode* gnode = (GdomeNode*)SvIV((SV*)SvRV( perlnode ));
if ( gnode == NULL ) {
warn( "no XML::GDOME data found (datastructure empty)" );
}
else {
retval = gdome_xml_n_get_xmlNode( gnode );
if ( retval == NULL ) {
xs_warn( "x_PmmSvNodeExt: no XML::LibXML node found in GDOME object\n" );
}
else if ( copy == 1 ) {
retval = x_PmmCloneNode( retval, 1 );
}
}
}
#endif
}
return retval;
}
/* extracts the libxml2 owner node from a perl reference
*/
xmlNodePtr
x_PmmSvOwner( SV* perlnode )
{
xmlNodePtr retval = NULL;
if ( perlnode != NULL
&& perlnode != &PL_sv_undef
&& SvPROXYNODE(perlnode) != NULL ) {
retval = x_PmmOWNER( SvPROXYNODE(perlnode) );
}
return retval;
}
|