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
|
/*###################################################################################
#
# Embperl - Copyright (c) 1997-2008 Gerald Richter / ecos gmbh www.ecos.de
# Embperl - Copyright (c) 2008-2014 Gerald Richter
#
# You may distribute under the terms of either the GNU General Public
# License or the Artistic License, as specified in the Perl README file.
#
# THIS PACKAGE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR
# IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
# WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
#
# $Id: epdom.h 1578075 2014-03-16 14:01:14Z richter $
#
###################################################################################*/
struct tArrayCtrl
{
#ifdef DMALLOC
char sSig [6] ;
char * sFile ;
int nLine ;
#endif
int nFill ; /* index of last element */
int nMax ; /* number of last element for which is space */
int nAdd ; /* number of elements to add on grow */
int nElementSize ; /* number of bytes per element */
} ;
typedef void tArray ;
typedef unsigned char tUInt8 ;
typedef signed char tSInt8 ;
typedef unsigned short tUInt16 ;
typedef signed short tSInt16 ;
typedef unsigned long tUInt32 ;
typedef signed long tSInt32 ;
typedef tSInt32 tIndex ;
typedef tSInt16 tIndexShort ;
typedef tIndex tStringIndex ;
typedef tUInt8 tNodeType ;
typedef tIndex tNode ;
typedef tIndex tAttr ;
typedef tUInt16 tRepeatLevel ;
struct tNodeData
{
tNodeType nType ;
tUInt8 bFlags ;
tIndexShort xDomTree ;
tIndex xNdx ;
tStringIndex nText ;
tNode xChilds ;
tUInt16 numAttr ;
tUInt16 nLinenumber ;
tNode xPrev ;
tNode xNext ;
tNode xParent ;
tRepeatLevel nRepeatLevel ;
} ;
typedef struct tNodeData tNodeData ;
struct tAttrData
{
tNodeType nType ; /* must be at the same offset as tNodeData.nType ! */
tUInt8 bFlags ;
tUInt16 nNodeOffset ;
tIndex xNdx ; /* must be at the same offset as tNodeData.xNdx ! */
tIndex xName ;
tIndex xValue ; /* must be at the same offset as tNodeData.xChilds ! */
} ;
typedef struct tAttrData tAttrData ;
struct tDomNode
{
tIndex xDomTree ;
tNode xNode ;
SV * pDomNodeSV ;
} ;
typedef struct tDomNode tDomNode ;
/*
Node Types
*/
/* ------------------------------------------------------------------------
interface Node {
# NodeType
const unsigned short ELEMENT_NODE = 1;
const unsigned short ATTRIBUTE_NODE = 2;
const unsigned short TEXT_NODE = 3;
const unsigned short CDATA_SECTION_NODE = 4;
const unsigned short ENTITY_REFERENCE_NODE = 5;
const unsigned short ENTITY_NODE = 6;
const unsigned short PROCESSING_INSTRUCTION_NODE = 7;
const unsigned short COMMENT_NODE = 8;
const unsigned short DOCUMENT_NODE = 9;
const unsigned short DOCUMENT_TYPE_NODE = 10;
const unsigned short DOCUMENT_FRAGMENT_NODE = 11;
const unsigned short NOTATION_NODE = 12;
*/
enum tNodeTypeValues
{
ntypTag = 1,
ntypStartTag = 1 + 0x20,
ntypStartEndTag = 1 + 0x80,
ntypEndTag = 1 + 0x40,
ntypEndStartTag = 1 + 0x60,
ntypAttr = 2,
ntypAttrValue = 2 + 0x20,
ntypText = 3,
ntypTextHTML = 3 + 0x20, /* same as text, but with html encoding */
ntypCDATA = 4,
ntypEntityRef = 5,
ntypEntity = 6,
ntypProcessingInstr = 7,
ntypComment = 8,
ntypDocument = 9,
ntypDocumentType = 10,
ntypDocumentFraq = 11,
ntypNotation = 12
} ;
#define ntypMask 0x1f
enum tNodeFlags
{
nflgDeleted = 0,
nflgOK = 1,
nflgEscUrl = 2,
nflgEscChar = 4,
nflgIgnore = 16, /**< Ignore this node */
nflgNewLevelNext = 32, /**< Next sibling has new RepeatLevel */
nflgNewLevelPrev = 64, /**< Previous sibling has new RepeatLevel */
nflgStopOutput = 8, /**< Do not make any further output after this node */
nflgEscUTF8 = 128
} ;
enum tAttrFlags
{
aflgDeleted = 0,
aflgOK = 1,
aflgAttrValue = 2,
aflgAttrChilds = 4,
aflgSingleQuote = 8
} ;
struct tDomTreeOrder
{
tNode xFromNode ;
tNode xToNode ;
} ;
typedef struct tDomTreeOrder tDomTreeOrder ;
struct tDomTreeCheckpoint
{
tNode xNode ;
} ;
typedef struct tDomTreeCheckpoint tDomTreeCheckpoint ;
struct tDomTreeCheckpointStatus
{
tRepeatLevel nRepeatLevel ; /**< Repeatlevel when last passed this checkpoint */
tIndex nCompileCheckpoint ; /**< r -> nCurrCheckpoint when last passed this checkpoint */
tNode xJumpFromNode ; /**< node from which backward jump started */
tNode xJumpToNode ; /**< node to which backward jump was */
} ;
typedef struct tDomTreeCheckpointStatus tDomTreeCheckpointStatus ;
struct tRepeatLevelLookupItem
{
tNodeData * pNode ; /* pointer to actual node data */
struct tRepeatLevelLookupItem * pNext ; /* next node with same node index but different nRepeatLevel */
} ;
typedef struct tRepeatLevelLookupItem tRepeatLevelLookupItem ;
struct tRepeatLevelLookup
{
tNode xNullNode ; /**< node index of node with RepeatLevel == 0 */
tRepeatLevel numItems ; /**< size of table (must be 2^n) */
tRepeatLevel nMask ; /**< mask (usualy numItems - 1) */
tRepeatLevelLookupItem items[1] ; /**< array with numItems items */
} ;
typedef struct tRepeatLevelLookup tRepeatLevelLookup ;
struct tLookupItem
{
void * pLookup ; /* table for converting tNode and tAttr to pointers */
tRepeatLevelLookup * pLookupLevel ; /* hash table used to index xNode/nRepeatLevel */
} ;
typedef struct tLookupItem tLookupItem ;
struct tDomTree
{
tLookupItem * pLookup ; /**< \_en table for converting tNode and tAttr to pointers \endif */
/**< \_de Tabelle um tNode und tAttr Indexe zu Zeigern umzuwandeln \endif */
tDomTreeCheckpoint * pCheckpoints ; /**< \_en checkpoints in the code, to check against execution order when running \endif*/
/**< \_de checkpoints im Code. Diese Liste wird wird der Reiehenfolge der
tatschlichen Ausfhrung verglichen um den DomTree entsprechend zu modifizieren \endif*/
tDomTreeCheckpointStatus * pCheckpointStatus ; /**< \_en status of checkpoint while generating new DomTree \endif */
/**< \_de Status eines checkpoints whrend dem neu Erzeugen eines DomTree \endif */
tIndexShort xNdx ; /**< \_en Index of Dom Tree \endif */
/**< \_de Index des Dom Tree \endif */
tIndexShort xSourceNdx ; /**< \_en When a cloned DomTree this is the index of the source Dom Tree \endif */
/**< \_de Wenn dieser Dom Tree gecloned ist, ist dies der Index des Quellen Dom Tree \endif */
tNode xDocument ; /**< \_en Index of the root document node \endif */
/**< \_en Index des Wurzelknotenes des DomTrees \endif */
tNode xLastNode ; /**< last node that was compiled */
tNode xCurrNode ; /**< curr node that is compiled */
tIndex xFilename ; /**< name of source file */
SV * pSV ; /**< general purpose SV */
SV * pDomTreeSV ; /**< SV that's hold the Index */
/**< Domtree will be deleted when this SV is delted */
tUInt16 nLastLinenumber ;
AV * pDependsOn ; /**< List of DomTree on which this one depends */
} ;
typedef struct tDomTree tDomTree ;
extern tDomTree * pDomTrees ; /* Array with all Dom Trees */
extern HE * * pStringTableArray ; /* Array with pointers to strings */
extern tIndex xNoName ; /* String index for Attribut with noname */
extern tIndex xDomTreeAttr ; /* String index for Attribut which holds the DomTree index */
extern tIndex xDocument ; /* String index for Document */
extern tIndex xDocumentFraq ; /* String index for Document Fraquent */
extern tIndex xOrderIndexAttr ; /* String index for Attribute which holds the OrderIndex */
struct tApp ; /* forward */
tStringIndex String2NdxInc (/*in*/ struct tApp * a,
/*in*/ const char * sText,
/*in*/ int nLen,
/*in*/ int bInc) ;
tStringIndex String2UniqueNdx (/*in*/ struct tApp * a,
/*in*/ const char * sText,
/*in*/ int nLen) ;
void NdxStringFree (/*in*/ struct tApp * a,
/*in*/ tStringIndex nNdx) ;
#define SV2String(pSV,l) (SvOK (pSV)?SvPV (pSV, l):(l=0,((char *)NULL)))
#define String2NdxNoInc(a,sText,nLen) String2NdxInc(a,sText,nLen,0)
#define String2Ndx(a,sText,nLen) String2NdxInc(a,sText,nLen,1)
#define Ndx2String(nNdx) (HeKEY (pStringTableArray[nNdx]))
#define Ndx2StringLen(nNdx,sVal,nLen) { HE * pHE = pStringTableArray[nNdx] ; nLen=HeKLEN(pHE) ; sVal = HeKEY (pHE) ; }
#define NdxStringRefcntInc(a,nNdx) (SvREFCNT_inc (HeVAL (pStringTableArray[nNdx])))
#ifdef DMALLOC
int ArrayNew_dbg (/*in*/ struct tApp * a,
/*in*/ const tArray * pArray,
/*in*/ int nAdd,
/*in*/ int nElementSize,
/*in*/ char * sFile,
/*in*/ int nLine) ;
int ArrayNewZero_dbg (/*in*/ struct tApp * a,
/*in*/ const tArray * pArray,
/*in*/ int nAdd,
/*in*/ int nElementSize,
/*in*/ char * sFile,
/*in*/ int nLine) ;
int ArrayClone_dbg (/*in*/ struct tApp * a,
/*in*/ const tArray * pOrgArray,
/*out*/ const tArray * pNewArray,
/*in*/ char * sFile,
/*in*/ int nLine) ;
#undef ArrayNew
#define ArrayNew(app,a,n,s) ArrayNew_dbg(app,a,n,s,__FILE__,__LINE__)
#undef ArrayNewZero
#define ArrayNewZero(app,a,n,s) ArrayNewZero_dbg(app,a,n,s,__FILE__,__LINE__)
#undef ArrayClone
#define ArrayClone(app,o,n) ArrayClone_dbg(app,o,n,__FILE__,__LINE__)
#else
int ArrayNew (/*in*/ struct tApp * a,
/*in*/ const tArray * pArray,
/*in*/ int nAdd,
/*in*/ int nElementSize) ;
int ArrayNewZero (/*in*/ struct tApp * a,
/*in*/ const tArray * pArray,
/*in*/ int nAdd,
/*in*/ int nElementSize) ;
int ArrayClone (/*in*/ struct tApp * a,
/*in*/ const tArray * pOrgArray,
/*out*/ const tArray * pNewArray) ;
#endif
int ArrayFree (/*in*/ struct tApp * a,
/*in*/ const tArray * pArray) ;
int ArraySet (/*in*/ struct tApp * a,
/*in*/ const tArray * pArray,
/*in*/ int numElements) ;
int ArraySetSize (/*in*/ struct tApp * a,
/*in*/ const tArray * pArray,
/*in*/ int numElements) ;
int ArrayGetSize (/*in*/ struct tApp * a,
/*in*/ const tArray * pArray) ;
int ArrayAdd (/*in*/ struct tApp * a,
/*in*/ const tArray * pArray,
/*in*/ int numElements) ;
int ArraySub (/*in*/ struct tApp * a,
/*in*/ const tArray * pArray,
/*in*/ int numElements) ;
#ifdef DMALLOC
void StringNew_dbg (/*in*/ struct tApp * a,
/*in*/ char * * pArray,
/*in*/ int nAdd,
/*in*/ char * sFile,
/*in*/ int nLine) ;
#undef StringNew
#define StringNew(app,a,n) StringNew_dbg(app,a,n,__FILE__,__LINE__)
#else
void StringNew (/*in*/ struct tApp * a,
/*in*/ char * * pArray,
/*in*/ int nAdd) ;
#endif
void StringFree (/*in*/ struct tApp * a,
/*in*/ char * * pArray) ;
int StringAdd (/*in*/ struct tApp * a,
/*in*/ char * * pArray,
/*in*/ const char * sAdd,
/*in*/ int nLen) ;
int DomInit (/*in*/ struct tApp * a) ;
void DomStats (/*in*/ struct tApp * a) ;
int DomTree_clone (/*in*/ struct tApp * a,
/*in*/ tDomTree * pOrgDomTree,
/*out*/tDomTree * * pNewDomTree,
/*in*/ int bForceDocFraq) ;
int DomTree_new (/*in*/ struct tApp * a,
tDomTree * * pNewLookup) ;
int DomTree_delete (/*in*/ struct tApp * a,
tDomTree * pDomTree) ;
void DomTree_checkpoint (struct tReq * r, tIndex nRunCheckpoint) ;
void DomTree_discardAfterCheckpoint (struct tReq * r, tIndex nRunCheckpoint) ;
#define DomTree_SV(pSV) SvIVX(pSV)
#define DomTree_selfSV(pSV) (DomTree_self(SvIVX(pSV)))
#define SV_DomTree(xDomTree) (DomTree_self (xDomTree) -> pDomTreeSV)
#define SV_DomTree_self(pDomTree) (pDomTree -> pDomTreeSV)
#define DomTree_filename(xDomTree) (Ndx2String (DomTree_self(xDomTree) -> xFilename))
#define DomTree_selfFilename(pDomTree) (Ndx2String ((pDomTree) -> xFilename))
tNodeData * Node_selfLevelItem (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ tNode xNode,
/*in*/ tRepeatLevel nLevel) ;
tNode Node_appendChild (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ tNode xParent,
/*in*/ tRepeatLevel nRepeatLevel,
/*in*/ tNodeType nType,
/*in*/ int bForceAttrValue,
/*in*/ const char * sText,
/*in*/ int nTextLen,
/*in*/ int nLevel,
/*in*/ int nLinenumber,
/*in*/ const char * sLogMsg) ;
struct tNodeData * Node_selfNthChild (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ struct tNodeData * pNode,
/*in*/ tRepeatLevel nRepeatLevel,
/*in*/ int nChildNo) ;
tNodeData * Node_selfLastChild (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ tNodeData * pNode,
/*in*/ tRepeatLevel nRepeatLevel) ;
tNodeData * Node_selfNextSibling (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ tNodeData * pNode,
/*in*/ tRepeatLevel nRepeatLevel) ;
tNode Node_nextSibling (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ tNode xNode,
/*in*/ tRepeatLevel nRepeatLevel) ;
tNodeData * Node_selfPreviousSibling (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ tNodeData * pNode,
/*in*/ tRepeatLevel nRepeatLevel) ;
tNode Node_previousSibling (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ tNode xNode,
/*in*/ tRepeatLevel nRepeatLevel) ;
#define DomTree_self(xDomTree) (&pDomTrees[xDomTree])
#define Node_self(pDomTree,xNode) ((struct tNodeData *)(pDomTree -> pLookup[xNode].pLookup))
#define Node_selfLevel(a,pDomTree,xNode,nLevel) \
(pDomTree -> pLookup[xNode].pLookup == NULL?NULL: \
(((struct tNodeData *)(pDomTree -> pLookup[xNode].pLookup)) -> nRepeatLevel == nLevel? \
((struct tNodeData *)(pDomTree -> pLookup[xNode].pLookup)): \
Node_selfLevelItem(a,pDomTree,xNode,nLevel)))
#define Node_selfNotNullLevel(a,pDomTree,xNode,nLevel) \
(pDomTree -> pLookup[xNode].pLookup == NULL?NULL: \
(((struct tNodeData *)(pDomTree -> pLookup[xNode].pLookup)) -> xDomTree == pDomTree -> xNdx? \
((struct tNodeData *)(pDomTree -> pLookup[xNode].pLookup)): \
Node_selfLevelItem(a,pDomTree,xNode,nLevel)))
#if 0
(pDomTree -> pLookup[xNode].pLookup == ? \
((((struct tNodeData *)(pDomTree -> pLookup[xNode].pLookup)) -> nRepeatLevel == nLevel || \
((struct tNodeData *)(pDomTree -> pLookup[xNode].pLookup)) -> nRepeatLevel != 0 || \
pDomTree -> pLookup[xNode].pLookupLevel == NULL)? \
((struct tNodeData *)(pDomTree -> pLookup[xNode].pLookup)): \
Node_selfLevelItem(a,pDomTree,xNode,nLevel)): \
NULL)
#endif
#define xNode_selfLevelNull(pDomTree,pNode) ((pDomTree) -> pLookup[(pNode)->xNdx].pLookupLevel?(pDomTree) -> pLookup[(pNode)->xNdx].pLookupLevel -> xNullNode:(pNode) -> xNdx)
#define xNode_levelNull(pDomTree,xNode) ((pDomTree) -> pLookup[(xNode)].pLookupLevel?(pDomTree) -> pLookup[(xNode)].pLookupLevel -> xNullNode:(xNode))
#define Node_parentNode(a,pDomTree,xNode,nLevel) (Node_selfLevel(a,pDomTree,xNode,nLevel)->xParent)
#define Node_selfParentNode(a,pDomTree,pNode,nLevel) (Node_selfLevel(a,pDomTree,(pNode)->xParent,nLevel))
#define xNode_selfParentNode(pDomTree,pNode) ((pNode)->xParent)
#define Node_firstChild(a,pDomTree,xNode,nLevel) (Node_selfLevel(a,pDomTree,xNode,nLevel)->xChilds)
#define Node_selfFirstChild(a,pDomTree,pNode,nLevel) (Node_selfLevel(a,pDomTree,(pNode)->xChilds,nLevel))
#define Node_selfNodeNameNdx(pNode) ((pNode) -> nText) ;
#define Node_selfNodeName(pNode) (Ndx2String ((pNode) -> nText))
#define Node_nodeName(a,pDomTree,xNode,nLevel) (Ndx2String (Node_selfLevel (a,pDomTree,xNode,nLevel) -> nText))
#define Node_selfFirstAttr(pNode) ((tAttrData *)((pNode) + 1))
tNodeData * Node_selfCloneNode (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ tNodeData * pNode,
/*in*/ tRepeatLevel nRepeatLevel,
/*in*/ int bDeep) ;
tNodeData * Node_selfCondCloneNode (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ tNodeData * pNode,
/*in*/ tRepeatLevel nRepeatLevel) ;
tNodeData * Node_selfForceLevel(/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ tNode xNode,
/*in*/ tRepeatLevel nRepeatLevel) ;
tNode Node_cloneNode (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ tNode xNode,
/*in*/ tRepeatLevel nRepeatLevel,
/*in*/ int bDeep) ;
void Node_toString (/*i/o*/ register req * r,
/*in*/ tDomTree * pDomTree,
/*in*/ tNode xNode,
/*in*/ tRepeatLevel nRepeatLevel) ;
struct tNodeData * Node_selfRemoveChild (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ tNode xNode,
/*in*/ struct tNodeData * pChild) ;
tNode Node_removeChild (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ tNode xNode,
/*in*/ tNode xChild,
/*in*/ tRepeatLevel nRepeatLevel) ;
tNode Node_insertBefore_CDATA (/*in*/ struct tApp * a,
/*in*/ const char * sText,
/*in*/ int nTextLen,
/*in*/ int nEscMode,
/*in*/ tDomTree * pRefNodeDomTree,
/*in*/ tNode xRefNode,
/*in*/ tRepeatLevel nRefRepeatLevel) ;
tNode Node_insertAfter (/*in*/ struct tApp * a,
/*in*/ tDomTree * pNewNodeDomTree,
/*in*/ tNode xNewNode,
/*in*/ tRepeatLevel nNewRepeatLevel,
/*in*/ tDomTree * pRefNodeDomTree,
/*in*/ tNode xRefNode,
/*in*/ tRepeatLevel nRefRepeatLevel) ;
tNode Node_insertAfter_CDATA (/*in*/ struct tApp * a,
/*in*/ const char * sText,
/*in*/ int nTextLen,
/*in*/ int nEscMode,
/*in*/ tDomTree * pRefNodeDomTree,
/*in*/ tNode xRefNode,
/*in*/ tRepeatLevel nRefRepeatLevel) ;
tNode Node_replaceChildWithNode (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ tNode xNode,
/*in*/ tRepeatLevel nRepeatLevel,
/*in*/ tDomTree * pOldChildDomTree,
/*in*/ tNode xOldChild,
/*in*/ tRepeatLevel nOldRepeatLevel) ;
tNode Node_replaceChildWithCDATA (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ tNode xOldChild,
/*in*/ tRepeatLevel nRepeatLevel,
/*in*/ const char * sText,
/*in*/ int nTextLen,
/*in*/ int nEscMode,
/*in*/ int bFlags) ;
char * Node_childsText (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ tNode xNode,
/*in*/ tRepeatLevel nRepeatLevel,
/*i/o*/ char * * ppText,
/*in*/ int bDeep) ;
tAttrData * Element_selfGetAttribut (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ struct tNodeData * pNode,
/*in*/ const char * sAttrName,
/*in*/ int nAttrNameLen) ;
tAttrData * Element_selfGetNthAttribut (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ struct tNodeData * pNode,
/*in*/ int n) ;
tAttrData * Element_selfSetAttribut (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ struct tNodeData * pNode,
/*in*/ tRepeatLevel nRepeatLevel,
/*in*/ const char * sAttrName,
/*in*/ int nAttrNameLen,
/*in*/ const char * sNewValue,
/*in*/ int nNewValueLen) ;
tAttrData * Element_selfRemoveAttributPtr (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ struct tNodeData * pNode,
/*in*/ tRepeatLevel nRepeatLevel,
/*in*/ tAttrData * pAttr) ;
tAttrData * Element_selfRemoveNthAttribut (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ struct tNodeData * pNode,
/*in*/ tRepeatLevel nRepeatLevel,
/*in*/ int n) ;
tAttrData * Element_selfRemoveAttribut (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ struct tNodeData * pNode,
/*in*/ tRepeatLevel nRepeatLevel,
/*in*/ const char * sAttrName,
/*in*/ int nAttrNameLen) ;
#define Attr_self(pDomTree,xAttr) ((struct tAttrData *)(pDomTree -> pLookup[xAttr].pLookup))
#define Attr_selfNode(pAttr) ((struct tNodeData * )(((tUInt8 *)pAttr) - pAttr -> nNodeOffset))
#define Attr_selfAttrNum(pAttr) (pAttr - Node_selfFirstAttr (Attr_selfNode(pAttr)))
char * Attr_selfValue (/*in*/ struct tApp * a,
/*in*/ tDomTree * pDomTree,
/*in*/ struct tAttrData * pAttr,
/*in*/ tRepeatLevel nRepeatLevel,
/*out*/ char * * ppAttr) ;
#define NodeAttr_selfParentNode(pDomTree,pNode,nLevel) (pNode->nType == ntypAttr?Attr_selfNode(((tAttrData *)pNode)):(Node_self(pDomTree,(pNode)->xParent)))
|
