forked from shlomif/perl-XML-LibXML
-
Notifications
You must be signed in to change notification settings - Fork 0
/
perl-libxml-mm.c
1324 lines (1204 loc) · 38.2 KB
/
perl-libxml-mm.c
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
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/**
* perl-libxml-mm.c
* $Id$
*
* This is free software, you may use it and distribute it under the same terms as
* Perl itself.
*
* Copyright 2001-2003 AxKit.com Ltd., 2002-2006 Christian Glahn, 2006-2009 Petr 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 "ppport.h"
#include <libxml/tree.h>
#ifdef XML_LIBXML_GDOME_SUPPORT
#include <libgdome/gdome.h>
#include <libgdome/gdome-libxml-util.h>
#endif
#include "perl-libxml-sax.h"
#ifdef __cplusplus
}
#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*
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 "";
}
/*
* free a hash table
*/
void
PmmFreeHashTable(xmlHashTablePtr table)
{
if( xmlHashSize(table) > 0 ) {
warn("PmmFreeHashTable: not empty\n");
/* PmmDumpRegistry(table); */
}
/* warn("Freeing table %p with %d elements in\n", table, xmlHashSize(table)); */
xmlHashFree(table, NULL);
}
#ifdef XML_LIBXML_THREADS
/*
* registry of all current proxy nodes
*
* other classes like XML::LibXSLT must get a pointer
* to this registry via XML::LibXML::__proxy_registry
*
*/
extern SV* PROXY_NODE_REGISTRY_MUTEX;
/* Utility method used by PmmDumpRegistry */
void PmmRegistryDumpHashScanner(void * payload, void * data, xmlChar * name)
{
LocalProxyNodePtr lp = (LocalProxyNodePtr) payload;
ProxyNodePtr node = (ProxyNodePtr) lp->proxy;
const char * CLASS = PmmNodeTypeName( PmmNODE(node) );
warn("%s=%p with %d references (%d perl)\n",CLASS,node,PmmREFCNT(node),lp->count);
}
/*
* dump the current thread's node registry to STDERR
*/
void
PmmDumpRegistry(xmlHashTablePtr r)
{
if( r )
{
SvLOCK(PROXY_NODE_REGISTRY_MUTEX);
warn("%d total nodes\n", xmlHashSize(r));
xmlHashScan(r, PmmRegistryDumpHashScanner, NULL);
SvUNLOCK(PROXY_NODE_REGISTRY_MUTEX);
}
}
/*
* returns the address of the proxy registry
*/
xmlHashTablePtr*
PmmProxyNodeRegistryPtr(ProxyNodePtr proxy)
{
croak("PmmProxyNodeRegistryPtr: TODO!\n");
return NULL;
/* return &PmmREGISTRY; */
}
/*
* efficiently generate a string representation of the given pointer
*/
#define _PMM_HASH_NAME_SIZE(n) n+(n>>3)+(n%8>0 ? 1 : 0)
xmlChar *
PmmRegistryName(void * ptr)
{
unsigned long int v = (unsigned long int) ptr;
int HASH_NAME_SIZE = _PMM_HASH_NAME_SIZE(sizeof(void*));
xmlChar * name;
int i;
name = (xmlChar *) safemalloc(HASH_NAME_SIZE+1);
for(i = 0; i < HASH_NAME_SIZE; ++i)
{
name[i] = (xmlChar) (128 | v);
v >>= 7;
}
name[HASH_NAME_SIZE] = '\0';
return name;
}
/*
* allocate and return a new LocalProxyNode structure
*/
LocalProxyNodePtr
PmmNewLocalProxyNode(ProxyNodePtr proxy)
{
LocalProxyNodePtr lp;
Newc(0, lp, 1, LocalProxyNode, LocalProxyNode);
lp->proxy = proxy;
lp->count = 0;
return lp;
}
/*
* @proxy: proxy node to register
*
* adds a proxy node to the proxy node registry
*/
LocalProxyNodePtr
PmmRegisterProxyNode(ProxyNodePtr proxy)
{
xmlChar * name = PmmRegistryName( proxy );
LocalProxyNodePtr lp = PmmNewLocalProxyNode( proxy );
/* warn("LibXML registers proxy node with %p\n",PmmREGISTRY); */
SvLOCK(PROXY_NODE_REGISTRY_MUTEX);
if( xmlHashAddEntry(PmmREGISTRY, name, lp) )
croak("PmmRegisterProxyNode: error adding node to hash, hash size is %d\n",xmlHashSize(PmmREGISTRY));
SvUNLOCK(PROXY_NODE_REGISTRY_MUTEX);
Safefree(name);
return lp;
}
/* utility method for PmmUnregisterProxyNode */
/* PP: originally this was static inline void, but on AIX the compiler
did not chew it, so I'm removing the inline */
static void
PmmRegistryHashDeallocator(void *payload, xmlChar *name)
{
Safefree((LocalProxyNodePtr) payload);
}
/*
* @proxy: proxy node to remove
*
* removes a proxy node from the proxy node registry
*/
void
PmmUnregisterProxyNode(ProxyNodePtr proxy)
{
xmlChar * name = PmmRegistryName( proxy );
/* warn("LibXML unregistering proxy node with %p\n",PmmREGISTRY); */
SvLOCK(PROXY_NODE_REGISTRY_MUTEX);
if( xmlHashRemoveEntry(PmmREGISTRY, name, PmmRegistryHashDeallocator) )
croak("PmmUnregisterProxyNode: error removing node from hash\n");
Safefree(name);
SvUNLOCK(PROXY_NODE_REGISTRY_MUTEX);
}
/*
* lookup a LocalProxyNode in the registry
*/
LocalProxyNodePtr
PmmRegistryLookup(ProxyNodePtr proxy)
{
xmlChar * name = PmmRegistryName( proxy );
LocalProxyNodePtr lp = xmlHashLookup(PmmREGISTRY, name);
Safefree(name);
return lp;
}
/*
* increment the local refcount for proxy
*/
void
PmmRegistryREFCNT_inc(ProxyNodePtr proxy)
{
/* warn("Registry inc\n"); */
LocalProxyNodePtr lp = PmmRegistryLookup( proxy );
if( lp )
lp->count++;
else
PmmRegisterProxyNode( proxy )->count++;
}
/*
* decrement the local refcount for proxy and remove the local pointer if zero
*/
void
PmmRegistryREFCNT_dec(ProxyNodePtr proxy)
{
/* warn("Registry dec\n"); */
LocalProxyNodePtr lp = PmmRegistryLookup(proxy);
if( lp && --(lp->count) == 0 )
PmmUnregisterProxyNode(proxy);
}
/*
* internal, used by PmmCloneProxyNodes
*/
void *
PmmRegistryHashCopier(void *payload, xmlChar *name)
{
ProxyNodePtr proxy = ((LocalProxyNodePtr) payload)->proxy;
LocalProxyNodePtr lp;
Newc(0, lp, 1, LocalProxyNode, LocalProxyNode);
memcpy(lp, payload, sizeof(LocalProxyNode));
PmmREFCNT_inc(proxy);
return lp;
}
/*
* increments all proxy node counters by one (called on thread spawn)
*/
void
PmmCloneProxyNodes()
{
SV *sv_reg = get_sv("XML::LibXML::__PROXY_NODE_REGISTRY",0);
xmlHashTablePtr reg_copy;
SvLOCK(PROXY_NODE_REGISTRY_MUTEX);
reg_copy = xmlHashCopy(PmmREGISTRY, PmmRegistryHashCopier);
SvIV_set(SvRV(sv_reg), PTR2IV(reg_copy));
SvUNLOCK(PROXY_NODE_REGISTRY_MUTEX);
}
/*
* returns the current number of proxy nodes in the registry
*/
int
PmmProxyNodeRegistrySize()
{
return xmlHashSize(PmmREGISTRY);
}
#endif /* end of XML_LIBXML_THREADS */
/* 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
PmmNewNode(xmlNodePtr node)
{
ProxyNodePtr proxy = NULL;
if ( node == NULL ) {
xs_warn( "PmmNewNode: no node found\n" );
return NULL;
}
if ( node->_private == NULL ) {
switch ( node->type ) {
case XML_DOCUMENT_NODE:
case XML_HTML_DOCUMENT_NODE:
case XML_DOCB_DOCUMENT_NODE:
proxy = (ProxyNodePtr)xmlMalloc(sizeof(struct _DocProxyNode));
if (proxy != NULL) {
((DocProxyNodePtr)proxy)->psvi_status = Pmm_NO_PSVI;
SetPmmENCODING(proxy, XML_CHAR_ENCODING_NONE);
}
break;
default:
proxy = (ProxyNodePtr)xmlMalloc(sizeof(struct _ProxyNode));
break;
}
if (proxy != NULL) {
proxy->node = node;
proxy->owner = NULL;
proxy->count = 0;
node->_private = (void*) proxy;
}
}
else {
proxy = (ProxyNodePtr)node->_private;
}
return proxy;
}
ProxyNodePtr
PmmNewFragment(xmlDocPtr doc)
{
ProxyNodePtr retval = NULL;
xmlNodePtr frag = NULL;
xs_warn("PmmNewFragment: new frag\n");
frag = xmlNewDocFragment( doc );
retval = PmmNewNode(frag);
/* fprintf(stderr, "REFCNT NOT incremented on frag: 0x%08.8X\n", retval); */
if ( doc != NULL ) {
xs_warn("PmmNewFragment: inc document\n");
/* under rare circumstances _private is not set correctly? */
if ( doc->_private != NULL ) {
xs_warn("PmmNewFragment: doc->_private being incremented!\n");
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 necessary. this method is aware that libxml2
* has several different nodetypes.
*/
void
PmmFreeNode( xmlNodePtr node )
{
switch( node->type ) {
case XML_DOCUMENT_NODE:
case XML_HTML_DOCUMENT_NODE:
xs_warn("PmmFreeNode: XML_DOCUMENT_NODE\n");
xmlFreeDoc( (xmlDocPtr) node );
break;
case XML_ATTRIBUTE_NODE:
xs_warn("PmmFreeNode: XML_ATTRIBUTE_NODE\n");
if ( node->parent == NULL ) {
xs_warn( "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( "PmmFreeNode: XML_DTD_NODE\n");
node->doc = NULL;
xmlFreeDtd( (xmlDtdPtr)node );
}
} else {
xs_warn( "PmmFreeNode: XML_DTD_NODE (no doc)\n");
xmlFreeDtd( (xmlDtdPtr)node );
}
break;
case XML_DOCUMENT_FRAG_NODE:
xs_warn("PmmFreeNode: XML_DOCUMENT_FRAG_NODE\n");
default:
xs_warn( "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, PmmREFCNT_dec will fix the reference counts and delete
the subtree if it is not required any more.
*/
int
PmmREFCNT_dec( ProxyNodePtr node )
{
xmlNodePtr libnode = NULL;
ProxyNodePtr owner = NULL;
int retval = 0;
if ( node != NULL ) {
retval = PmmREFCNT(node)--;
/* fprintf(stderr, "REFCNT on 0x%08.8X decremented to %d\n", node, PmmREFCNT(node)); */
if ( PmmREFCNT(node) < 0 )
warn( "PmmREFCNT_dec: REFCNT decremented below 0 for %p!", node );
if ( PmmREFCNT(node) <= 0 ) {
xs_warn( "PmmREFCNT_dec: NODE DELETION\n" );
libnode = PmmNODE( node );
if ( libnode != NULL ) {
if ( libnode->_private != node ) {
xs_warn( "PmmREFCNT_dec: lost node\n" );
libnode = NULL;
}
else {
libnode->_private = NULL;
}
}
PmmNODE( node ) = NULL;
if ( PmmOWNER(node) && PmmOWNERPO(node) ) {
xs_warn( "PmmREFCNT_dec: DOC NODE!\n" );
owner = PmmOWNERPO(node);
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( "PmmREFCNT_dec: REAL DELETE\n" );
PmmFreeNode( libnode );
}
xs_warn( "PmmREFCNT_dec: decrease owner\n" );
PmmREFCNT_dec( owner );
}
else if ( libnode != NULL ) {
xs_warn( "PmmREFCNT_dec: STANDALONE REAL DELETE\n" );
PmmFreeNode( libnode );
}
else {
xs_warn( "PmmREFCNT_dec: NO OWNER\n" );
}
xmlFree( node );
}
}
else {
xs_warn("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*
PmmNodeToSv( xmlNodePtr node, ProxyNodePtr owner )
{
ProxyNodePtr dfProxy= NULL;
dTHX;
SV * retval = &PL_sv_undef;
const char * CLASS = "XML::LibXML::Node";
if ( node != NULL ) {
#ifdef XML_LIBXML_THREADS
if( PmmUSEREGISTRY )
SvLOCK(PROXY_NODE_REGISTRY_MUTEX);
#endif
/* find out about the class */
CLASS = PmmNodeTypeName( node );
xs_warn("PmmNodeToSv: return new perl node of class:\n");
xs_warn( CLASS );
if ( node->_private != NULL ) {
dfProxy = PmmNewNode(node);
/* fprintf(stderr, " at 0x%08.8X\n", dfProxy); */
}
else {
dfProxy = PmmNewNode(node);
/* fprintf(stderr, " at 0x%08.8X\n", dfProxy); */
if ( dfProxy != NULL ) {
if ( owner != NULL ) {
dfProxy->owner = PmmNODE( owner );
PmmREFCNT_inc( owner );
/* fprintf(stderr, "REFCNT incremented on owner: 0x%08.8X\n", owner); */
}
else {
xs_warn("PmmNodeToSv: node contains itself (owner==NULL)\n");
}
}
else {
croak("XML::LibXML: failed to create a proxy node (out of memory?)\n");
}
}
retval = NEWSV(0,0);
sv_setref_pv( retval, CLASS, (void*)dfProxy );
#ifdef XML_LIBXML_THREADS
if( PmmUSEREGISTRY )
PmmRegistryREFCNT_inc(dfProxy);
#endif
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 ) {
SetPmmENCODING(dfProxy, (int)xmlParseCharEncoding( (const char*)((xmlDocPtr)node)->encoding ));
}
break;
default:
break;
}
#ifdef XML_LIBXML_THREADS
if( PmmUSEREGISTRY )
SvUNLOCK(PROXY_NODE_REGISTRY_MUTEX);
#endif
}
else {
xs_warn( "PmmNodeToSv: no node found!\n" );
}
return retval;
}
xmlNodePtr
PmmCloneNode( xmlNodePtr node, int recursive )
{
xmlNodePtr retval = NULL;
if ( node != NULL ) {
switch ( node->type ) {
case XML_ELEMENT_NODE:
case XML_TEXT_NODE:
case XML_CDATA_SECTION_NODE:
case XML_ENTITY_REF_NODE:
case XML_PI_NODE:
case XML_COMMENT_NODE:
case XML_DOCUMENT_FRAG_NODE:
case XML_ENTITY_DECL:
retval = xmlCopyNode( node, recursive ? 1 : 2 );
break;
case XML_ATTRIBUTE_NODE:
retval = (xmlNodePtr) xmlCopyProp( NULL, (xmlAttrPtr) node );
break;
case XML_DOCUMENT_NODE:
case XML_HTML_DOCUMENT_NODE:
retval = (xmlNodePtr) xmlCopyDoc( (xmlDocPtr)node, recursive );
break;
case XML_DOCUMENT_TYPE_NODE:
case XML_DTD_NODE:
retval = (xmlNodePtr) xmlCopyDtd( (xmlDtdPtr)node );
break;
case XML_NAMESPACE_DECL:
retval = ( xmlNodePtr ) xmlCopyNamespace( (xmlNsPtr) node );
break;
default:
break;
}
}
return retval;
}
/* extracts the libxml2 node from a perl reference
*/
xmlNodePtr
PmmSvNodeExt( SV* perlnode, int copy )
{
xmlNodePtr retval = NULL;
ProxyNodePtr proxy = NULL;
dTHX;
if ( perlnode != NULL && perlnode != &PL_sv_undef ) {
/* if ( sv_derived_from(perlnode, "XML::LibXML::Node") */
/* && SvPROXYNODE(perlnode) != NULL ) { */
/* retval = PmmNODE( SvPROXYNODE(perlnode) ) ; */
/* } */
xs_warn("PmmSvNodeExt: perlnode found\n" );
if ( sv_derived_from(perlnode, "XML::LibXML::Node") ) {
proxy = SvPROXYNODE(perlnode);
if ( proxy != NULL ) {
xs_warn( "PmmSvNodeExt: is a xmlNodePtr structure\n" );
retval = PmmNODE( proxy ) ;
}
if ( retval != NULL
&& ((ProxyNodePtr)retval->_private) != proxy ) {
xs_warn( "PmmSvNodeExt: no node in proxy node\n" );
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( "PmmSvNodeExt: no XML::LibXML node found in GDOME object\n" );
}
else if ( copy == 1 ) {
retval = PmmCloneNode( retval, 1 );
}
}
}
#endif
}
return retval;
}
/* extracts the libxml2 owner node from a perl reference
*/
xmlNodePtr
PmmSvOwner( SV* perlnode )
{
dTHX;
xmlNodePtr retval = NULL;
if ( perlnode != NULL
&& perlnode != &PL_sv_undef
&& SvPROXYNODE(perlnode) != NULL ) {
retval = PmmOWNER( SvPROXYNODE(perlnode) );
}
return retval;
}
/* reverse to PmmSvOwner(). sets the owner of the current node. this
* will increase the proxy count of the owner.
*/
SV*
PmmSetSvOwner( SV* perlnode, SV* extra )
{
dTHX;
if ( perlnode != NULL && perlnode != &PL_sv_undef ) {
PmmOWNER( SvPROXYNODE(perlnode)) = PmmNODE( SvPROXYNODE(extra) );
PmmREFCNT_inc( SvPROXYNODE(extra) );
/* fprintf(stderr, "REFCNT incremented on new owner: 0x%08.8X\n", SvPROXYNODE(extra)); */
}
return perlnode;
}
void PmmFixOwnerList( xmlNodePtr list, ProxyNodePtr parent );
/**
* this functions fixes the reference counts for an entire subtree.
* it is very important to fix an entire subtree after node operations
* where the documents or the owner node may get changed. this method is
* aware about nodes that already belong to a certain owner node.
*
* the method uses the internal methods PmmFixNode and PmmChildNodes to
* do the real updates.
*
* in the worst case this traverses the subtree twice during a node
* operation. this case is only given when the node has to be
* adopted by the document. Since the ownerdocument and the effective
* owner may differ this double traversing makes sense.
*/
int
PmmFixOwner( ProxyNodePtr nodetofix, ProxyNodePtr parent )
{
ProxyNodePtr oldParent = NULL;
if ( nodetofix != NULL ) {
switch ( PmmNODE(nodetofix)->type ) {
case XML_ENTITY_DECL:
case XML_ATTRIBUTE_DECL:
case XML_NAMESPACE_DECL:
case XML_ELEMENT_DECL:
case XML_DOCUMENT_NODE:
xs_warn( "PmmFixOwner: don't need to fix this type of node\n" );
return(0);
default:
break;
}
if ( PmmOWNER(nodetofix) != NULL ) {
oldParent = PmmOWNERPO(nodetofix);
}
/* The owner data is only fixed if the node is neither a
* fragment nor a document. Also no update will happen if
* the node is already his owner or the owner has not
* changed during previous operations.
*/
if( oldParent != parent ) {
xs_warn( "PmmFixOwner: re-parenting node\n" );
/* fprintf(stderr, " 0x%08.8X (%s)\n", nodetofix, PmmNODE(nodetofix)->name); */
if ( parent && parent != nodetofix ){
PmmOWNER(nodetofix) = PmmNODE(parent);
PmmREFCNT_inc( parent );
/* fprintf(stderr, "REFCNT incremented on new parent: 0x%08.8X\n", parent); */
}
else {
PmmOWNER(nodetofix) = NULL;
}
if ( oldParent != NULL && oldParent != nodetofix )
PmmREFCNT_dec(oldParent);
if ( PmmNODE(nodetofix)->type != XML_ATTRIBUTE_NODE
&& PmmNODE(nodetofix)->type != XML_DTD_NODE
&& PmmNODE(nodetofix)->properties != NULL ) {
PmmFixOwnerList( (xmlNodePtr)PmmNODE(nodetofix)->properties,
parent );
}
if ( parent == NULL || PmmNODE(nodetofix)->parent == NULL ) {
/* fix to self */
parent = nodetofix;
}
PmmFixOwnerList(PmmNODE(nodetofix)->children, parent);
}
else {
xs_warn( "PmmFixOwner: node doesn't need to get fixed\n" );
}
return(1);
}
return(0);
}
void
PmmFixOwnerList( xmlNodePtr list, ProxyNodePtr parent )
{
if ( list != NULL ) {
xmlNodePtr iterator = list;
while ( iterator != NULL ) {
switch ( iterator->type ) {
case XML_ENTITY_DECL:
case XML_ATTRIBUTE_DECL:
case XML_NAMESPACE_DECL:
case XML_ELEMENT_DECL:
xs_warn( "PmmFixOwnerList: don't need to fix this type of node\n" );
iterator = iterator->next;
continue;
break;
default:
break;
}
if ( iterator->_private != NULL ) {
PmmFixOwner( (ProxyNodePtr)iterator->_private, parent );
}
else {
if ( iterator->type != XML_ATTRIBUTE_NODE
&& iterator->properties != NULL ){
PmmFixOwnerList( (xmlNodePtr)iterator->properties, parent );
}
PmmFixOwnerList(iterator->children, parent);
}
iterator = iterator->next;
}
}
}
void
PmmFixOwnerNode( xmlNodePtr node, ProxyNodePtr parent )
{
if ( node != NULL && parent != NULL ) {
if ( node->_private != NULL ) {
xs_warn( "PmmFixOwnerNode: calling PmmFixOwner\n" );
PmmFixOwner( node->_private, parent );
}
else {
xs_warn( "PmmFixOwnerNode: calling PmmFixOwnerList\n" );
PmmFixOwnerList(node->children, parent );
}
}
}
ProxyNodePtr
PmmNewContext(xmlParserCtxtPtr node)
{
ProxyNodePtr proxy = NULL;
proxy = (ProxyNodePtr)xmlMalloc(sizeof(ProxyNode));
if (proxy != NULL) {
proxy->node = (xmlNodePtr)node;
proxy->owner = NULL;
proxy->count = 0;
}
else {
warn( "empty context" );
}
return proxy;
}
int
PmmContextREFCNT_dec( ProxyNodePtr node )
{
xmlParserCtxtPtr libnode = NULL;
int retval = 0;
if ( node != NULL ) {
retval = PmmREFCNT(node)--;
/* fprintf(stderr, "REFCNT on context %p decremented to %d\n", node, PmmREFCNT(node)); */
if ( PmmREFCNT(node) <= 0 ) {
xs_warn( "PmmContextREFCNT_dec: NODE DELETION\n" );
libnode = (xmlParserCtxtPtr)PmmNODE( node );
if ( libnode != NULL ) {
if (libnode->_private != NULL ) {
if ( libnode->_private != (void*)node ) {
PmmSAXCloseContext( libnode );
}
else {
xmlFree( libnode->_private );
}
libnode->_private = NULL;
}
PmmNODE( node ) = NULL;
xmlFreeParserCtxt(libnode);
}
}
xmlFree( node );
}
return retval;
}
SV*
PmmContextSv( xmlParserCtxtPtr ctxt )
{
ProxyNodePtr dfProxy= NULL;
dTHX;
SV * retval = &PL_sv_undef;
const char * CLASS = "XML::LibXML::ParserContext";
if ( ctxt != NULL ) {
dfProxy = PmmNewContext(ctxt);
retval = NEWSV(0,0);
sv_setref_pv( retval, CLASS, (void*)dfProxy );
PmmREFCNT_inc(dfProxy);
/* fprintf(stderr, "REFCNT incremented on new context: 0x%08.8X\n", dfProxy); */
}
else {
xs_warn( "PmmContextSv: no node found!\n" );
}
return retval;
}
xmlParserCtxtPtr
PmmSvContext( SV * scalar )
{
xmlParserCtxtPtr retval = NULL;
dTHX;
if ( scalar != NULL
&& scalar != &PL_sv_undef
&& sv_isa( scalar, "XML::LibXML::ParserContext" )
&& SvPROXYNODE(scalar) != NULL ) {
retval = (xmlParserCtxtPtr)PmmNODE( SvPROXYNODE(scalar) );
}
else {
if ( scalar == NULL
&& scalar == &PL_sv_undef ) {
xs_warn( "PmmSvContext: no scalar!\n" );
}
else if ( ! sv_isa( scalar, "XML::LibXML::ParserContext" ) ) {
xs_warn( "PmmSvContext: bad object\n" );
}
else if (SvPROXYNODE(scalar) == NULL) {
xs_warn( "PmmSvContext: empty object\n" );
}
else {
xs_warn( "PmmSvContext: nothing was wrong!\n");
}
}
return retval;
}
xmlChar*
PmmFastEncodeString( int charset,
const xmlChar *string,
const xmlChar *encoding,
STRLEN len )
{
xmlCharEncodingHandlerPtr coder = NULL;
xmlChar *retval = NULL;
xmlBufferPtr in = NULL, out = NULL;
int i;
/* first check that the input is not ascii */
/* since we do not want to recode ascii as, say, UTF-16 */
if (len == 0)
len=xmlStrlen(string);
for (i=0; i<len; i++) {
if(!string[i] || string[i] & 0x80) {
break;
}
}
if (i>=len) return xmlStrdup( string );
xs_warn("PmmFastEncodeString: string is non-ascii\n");
if ( charset == XML_CHAR_ENCODING_ERROR){
if (xmlStrcmp(encoding,(const xmlChar*)"UTF-16LE")==0) {
charset = XML_CHAR_ENCODING_UTF16LE;
} else if (xmlStrcmp(encoding,(const xmlChar*) "UTF-16BE")==0) {
charset = XML_CHAR_ENCODING_UTF16BE;
}
}
if ( charset == XML_CHAR_ENCODING_UTF8 ) {
/* warn("use UTF8 for encoding ... %s ", string); */
return xmlStrdup( string );
}
else if ( charset == XML_CHAR_ENCODING_UTF16LE || charset == XML_CHAR_ENCODING_UTF16BE ){
/* detect and strip BOM, if any */
if (len>=2 && (char)string[0]=='\xFE' && (char)string[1]=='\xFF') {
xs_warn("detected BE BOM\n");
string += 2;
len -= 2;
coder = xmlGetCharEncodingHandler( XML_CHAR_ENCODING_UTF16BE );
} else if (len>=2 && (char)string[0]=='\xFF' && (char)string[1]=='\xFE') {
xs_warn("detected LE BOM\n");
string += 2;
len -= 2;
coder = xmlGetCharEncodingHandler( XML_CHAR_ENCODING_UTF16LE );
} else {
coder= xmlGetCharEncodingHandler( charset );
}
}
else if ( charset == XML_CHAR_ENCODING_ERROR ){
/* warn("no standard encoding %s\n", encoding); */
coder =xmlFindCharEncodingHandler( (const char *)encoding );
}
else if ( charset == XML_CHAR_ENCODING_NONE ){
xs_warn("PmmFastEncodeString: no encoding found\n");
}
else {
/* warn( "use document encoding %s (%d)", encoding, charset ); */
coder= xmlGetCharEncodingHandler( charset );
}
if ( coder != NULL ) {
xs_warn("PmmFastEncodeString: coding machine found \n");
in = xmlBufferCreateStatic((void*)string, len);
out = xmlBufferCreate();
if ( xmlCharEncInFunc( coder, out, in ) >= 0 ) {
retval = xmlStrdup( out->content );
/* warn( "encoded string is %s" , retval); */
}
else {
/* warn( "b0rked encoiding!\n"); */
}
xmlBufferFree( in );
xmlBufferFree( out );