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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "axiom_node_internal.h"
#include "axiom_stax_builder_internal.h"
#include <axiom_element.h>
#include <axiom_text.h>
#include <axiom_data_source.h>
#include <axiom_comment.h>
#include <axiom_processing_instruction.h>
#include <axiom_doctype.h>
#include <axiom_document.h>
#include <axiom_stax_builder.h>
struct axiom_node
{
/* stax builder */
axiom_stax_builder_t *builder;
/* whether current node is the owner of stax builder. If so, it has to free it */
axis2_bool_t own_builder;
/** parent node */
axiom_node_t *parent;
/** previous sibling */
axiom_node_t *prev_sibling;
/** next sibling */
axiom_node_t *next_sibling;
/** first child */
axiom_node_t *first_child;
/** last child */
axiom_node_t *last_child;
/** node type, indicates the type stored in data_element */
axiom_types_t node_type;
/** done true means that this node is completely built , false otherwise */
int done;
/** instances of an om struct, whose type is defined by node type */
void *data_element;
};
AXIS2_EXTERN axiom_node_t *AXIS2_CALL
axiom_node_create(
const axutil_env_t * env)
{
axiom_node_t *node = NULL;
AXIS2_ENV_CHECK(env, NULL);
node = (axiom_node_t *)AXIS2_MALLOC(env->allocator, sizeof(axiom_node_t));
if(!node)
{
env->error->error_number = AXIS2_ERROR_NO_MEMORY;
return NULL;
}
node->first_child = NULL;
node->last_child = NULL;
node->next_sibling = NULL;
node->prev_sibling = NULL;
node->parent = NULL;
node->node_type = AXIOM_INVALID;
node->done = AXIS2_FALSE;
node->data_element = NULL;
node->builder = NULL;
node->own_builder = AXIS2_FALSE;
return node;
}
AXIS2_EXTERN axiom_node_t* AXIS2_CALL
axiom_node_create_from_buffer(
const axutil_env_t * env,
axis2_char_t *buffer)
{
axiom_xml_reader_t *reader = NULL;
axiom_stax_builder_t *builder = NULL;
axiom_document_t *document = NULL;
axiom_node_t *om_node = NULL;
reader = axiom_xml_reader_create_for_memory(env, buffer, axutil_strlen(buffer), "UTF-8",
AXIS2_XML_PARSER_TYPE_BUFFER);
if(!reader)
{
return NULL;
}
builder = axiom_stax_builder_create(env, reader);
if(!builder)
{
return NULL;
}
document = axiom_stax_builder_get_document(builder, env);
if(!document)
{
AXIS2_LOG_ERROR(env->log, AXIS2_LOG_SI, "Document is null for deserialization");
return NULL;
}
om_node = axiom_document_get_root_element(document, env);
if(!om_node)
{
AXIS2_LOG_ERROR(env->log, AXIS2_LOG_SI, "Root element of the document is not found");
return NULL;
}
axiom_document_build_all(document, env);
axiom_stax_builder_free_self(builder, env);
return om_node;
}
static void
axiom_node_free_detached_subtree(
axiom_node_t * om_node,
const axutil_env_t * env)
{
/* Free any child nodes first */
if(om_node->first_child)
{
axiom_node_t *child_node = om_node->first_child, *next_sibling;
while(child_node)
{
next_sibling = child_node->next_sibling;
axiom_node_free_detached_subtree(child_node, env);
child_node = next_sibling;
}
}
if(om_node->node_type == AXIOM_ELEMENT)
{
if(om_node->data_element)
{
axiom_element_free((axiom_element_t *)(om_node->data_element), env);
}
}
else if(om_node->node_type == AXIOM_COMMENT)
{
if(om_node->data_element)
{
axiom_comment_free((axiom_comment_t *)(om_node->data_element), env);
}
}
else if(om_node->node_type == AXIOM_DOCTYPE)
{
/*axiom_doctype_free((axiom_doctype_t*)(om_node->data_element), env); */
}
else if(om_node->node_type == AXIOM_PROCESSING_INSTRUCTION)
{
if(om_node->data_element)
{
axiom_processing_instruction_free(
(axiom_processing_instruction_t *)(om_node->data_element), env);
}
}
else if(om_node->node_type == AXIOM_TEXT)
{
if(om_node->data_element)
{
axiom_text_free((axiom_text_t *)(om_node->data_element), env);
}
}
else if(om_node->node_type == AXIOM_DATA_SOURCE)
{
if(om_node->data_element)
{
axiom_data_source_free((axiom_data_source_t *)(om_node->data_element), env);
}
}
AXIS2_FREE(env->allocator, om_node);
}
/**
* This free function will free an om_element and all the children contained in it
* If the node is still attached to the tree, it will be detached first
*/
AXIS2_EXTERN void AXIS2_CALL
axiom_node_free_tree(
axiom_node_t * om_node,
const axutil_env_t * env)
{
AXIS2_ENV_CHECK(env, void);
if(!om_node)
{
return;
}
/* Detach this node before freeing it and its subtree. */
axiom_node_detach_without_namespaces(om_node, env);
/* if the owner of the builder, then free the builder */
if(om_node->own_builder)
{
axiom_stax_builder_free_internal(om_node->builder, env);
}
/* Free this node and its subtree */
axiom_node_free_detached_subtree(om_node, env);
}
AXIS2_EXTERN axis2_status_t AXIS2_CALL
axiom_node_add_child(
axiom_node_t * om_node,
const axutil_env_t * env,
axiom_node_t * child)
{
AXIS2_PARAM_CHECK(env->error, child, AXIS2_FAILURE);
AXIS2_PARAM_CHECK(env->error, om_node, AXIS2_FAILURE);
if(child->parent)
{
child = axiom_node_detach(child, env);
}
if(!om_node->first_child)
{
om_node->first_child = child;
}
else
{
axiom_node_t *last_sib = om_node->last_child;
last_sib->next_sibling = child;
child->prev_sibling = last_sib;
}
child->parent = om_node;
om_node->last_child = child;
return AXIS2_SUCCESS;
}
/**
* Detaches given node from the parent and reset the links. will not adjust the namespace as
* in the case of axiom_node_detach.
* @param om_node node to be detached, cannot be NULL.
* @param env Environment. MUST NOT be NULL, .
* @return a pointer to detached node,returns NULL on error
*/
AXIS2_EXTERN axiom_node_t *AXIS2_CALL
axiom_node_detach_without_namespaces(
axiom_node_t * om_node,
const axutil_env_t * env)
{
axiom_node_t *parent = NULL;
parent = om_node->parent;
if(!parent)
{
/* Node is already detached */
return om_node;
}
if(!om_node->prev_sibling)
{
parent->first_child = om_node->next_sibling;
}
else
{
axiom_node_t *prev_sib = NULL;
prev_sib = om_node->prev_sibling;
if(prev_sib)
{
prev_sib->next_sibling = om_node->next_sibling;
}
}
if(om_node->next_sibling)
{
axiom_node_t *next_sibling = NULL;
next_sibling = om_node->next_sibling;
if(next_sibling)
{
next_sibling->prev_sibling = om_node->prev_sibling;
}
}
if(parent->last_child && (parent->last_child == om_node))
{
parent->last_child = om_node->prev_sibling;
}
/* if the STAX builder's last node is what we are detaching, then we should adjust the
* last node if previous sibling is available, set that as the builder's last node. Else set the
* parent as the last node*/
if(om_node->builder && (axiom_stax_builder_get_lastnode(om_node->builder, env) == om_node))
{
axiom_node_t *lastnode = parent;
if(om_node->prev_sibling)
{
lastnode = om_node->prev_sibling;
}
axiom_stax_builder_set_lastnode(om_node->builder, env, lastnode);
}
om_node->parent = NULL;
om_node->prev_sibling = NULL;
om_node->next_sibling = NULL;
om_node->builder = NULL;
return om_node;
}
/**
* Detaches given node from the parent and reset the links. Will recreate "namespace defined in
* the parent and used in detached node" within detached node itself
* @param om_node node to be detached, cannot be NULL.
* @param env Environment. MUST NOT be NULL, .
* @return a pointer to detached node,returns NULL on error
*/
AXIS2_EXTERN axiom_node_t *AXIS2_CALL
axiom_node_detach(
axiom_node_t * om_node,
const axutil_env_t * env)
{
axutil_hash_t *inscope_namespaces = NULL;
axiom_element_t *om_element = NULL;
AXIS2_ENV_CHECK(env, NULL);
if(!om_node)
{
return NULL;
}
/* If this is an element node, determine which namespaces are available to it
from its parent nodes. */
if((om_node->node_type == AXIOM_ELEMENT) && (om_element = om_node->data_element))
{
inscope_namespaces = axiom_element_gather_parent_namespaces(om_element, env, om_node);
}
/* Detach this node from its parent. */
om_node = axiom_node_detach_without_namespaces(om_node, env);
/* If this is an element node, ensure that any namespaces available to it or its
children remain available after the detach. */
if(om_node && inscope_namespaces)
{
axiom_element_redeclare_parent_namespaces(om_element, env, om_node, om_element,
inscope_namespaces);
}
if(inscope_namespaces)
{
axutil_hash_free(inscope_namespaces, env);
}
return om_node;
}
/**
Internal function , only used in om and soap
not to be used by users
*/
axis2_status_t AXIS2_CALL
axiom_node_set_parent(
axiom_node_t * om_node,
const axutil_env_t * env,
axiom_node_t * parent)
{
if(parent == om_node->parent)
{ /* same parent already exist */
return AXIS2_SUCCESS;
}
/* if a new parent is assigned in place of existing one first the node should be detached
*/
if(om_node->parent)
{
om_node = axiom_node_detach(om_node, env);
}
om_node->parent = parent;
return AXIS2_SUCCESS;
}
/**
* This will insert a sibling just after the current information item
* @param node the node in consideration
* @param nodeto_insert the node that will be inserted
*/
AXIS2_EXTERN axis2_status_t AXIS2_CALL
axiom_node_insert_sibling_after(
axiom_node_t * om_node,
const axutil_env_t * env,
axiom_node_t * node_to_insert)
{
axiom_node_t *next_sib = NULL;
AXIS2_ENV_CHECK(env, AXIS2_FAILURE);
AXIS2_PARAM_CHECK(env->error, node_to_insert, AXIS2_FAILURE);
if(!om_node->parent)
{
/* We shouldn't add a sibling because this node doesn't has a parent.
* This can be the root node of the tree*/
return AXIS2_FAILURE;
}
node_to_insert->parent = om_node->parent;
node_to_insert->prev_sibling = om_node;
next_sib = om_node->next_sibling;
if(next_sib)
{
next_sib->prev_sibling = node_to_insert;
}
node_to_insert->next_sibling = om_node->next_sibling;
om_node->next_sibling = node_to_insert;
return AXIS2_SUCCESS;
}
AXIS2_EXTERN axis2_status_t AXIS2_CALL
axiom_node_insert_sibling_before(
axiom_node_t * om_node,
const axutil_env_t * env,
axiom_node_t * node_to_insert)
{
axiom_node_t *prev_sibling = NULL;
AXIS2_ENV_CHECK(env, AXIS2_FAILURE);
AXIS2_PARAM_CHECK(env->error, node_to_insert, AXIS2_FAILURE);
if(!om_node->parent)
{
/* We shouldn't add a sibling because this node doesn't has a parent.
* This can be the root node of the tree*/
return AXIS2_FAILURE;
}
node_to_insert->parent = om_node->parent;
node_to_insert->prev_sibling = om_node->prev_sibling;
node_to_insert->next_sibling = om_node;
prev_sibling = om_node->prev_sibling;
if(!prev_sibling)
{
axiom_node_t *parent = om_node->parent;
parent->first_child = node_to_insert;
}
else
{
axiom_node_t *prev_sibling = om_node->prev_sibling;
if(prev_sibling)
{
prev_sibling->next_sibling = node_to_insert;
}
}
om_node->prev_sibling = node_to_insert;
return AXIS2_SUCCESS;
}
AXIS2_EXTERN axis2_status_t AXIS2_CALL
axiom_node_serialize(
axiom_node_t * om_node,
const axutil_env_t * env,
axiom_output_t * om_output)
{
int status = AXIS2_SUCCESS;
axiom_node_t *temp_node = NULL;
axiom_node_t *nodes[256];
int count = 0;
AXIS2_ENV_CHECK(env, AXIS2_FAILURE);
if(!om_node)
{
return AXIS2_SUCCESS;
}
nodes[count++] = om_node;
AXIS2_PARAM_CHECK(env->error, om_output, AXIS2_FAILURE);
do
{
if(om_node->node_type == AXIOM_ELEMENT)
{
if(om_node->data_element)
{
status = axiom_element_serialize_start_part(
(axiom_element_t *)(om_node-> data_element), env, om_output, om_node);
}
if(status != AXIS2_SUCCESS)
{
return status;
}
}
else if(om_node->node_type == AXIOM_DATA_SOURCE)
{
if(om_node->data_element)
{
status = axiom_data_source_serialize(
(axiom_data_source_t *)(om_node->data_element), env, om_output);
}
if(status != AXIS2_SUCCESS)
{
return status;
}
}
else if(om_node->node_type == AXIOM_TEXT)
{
if(om_node->data_element)
{
status = axiom_text_serialize((axiom_text_t *)(om_node-> data_element), env,
om_output);
}
if(status != AXIS2_SUCCESS)
{
return status;
}
}
else if(om_node->node_type == AXIOM_COMMENT)
{
if(om_node->data_element)
{
status = axiom_comment_serialize((axiom_comment_t *)(om_node-> data_element), env,
om_output);
}
if(status != AXIS2_SUCCESS)
{
return status;
}
}
else if(om_node->node_type == AXIOM_DOCTYPE)
{
if(om_node->data_element)
{
status = axiom_doctype_serialize((axiom_doctype_t *)(om_node-> data_element), env,
om_output);
}
if(status != AXIS2_SUCCESS)
{
return status;
}
}
else if(om_node->node_type == AXIOM_PROCESSING_INSTRUCTION)
{
if(om_node->data_element)
{
status = axiom_processing_instruction_serialize(
(axiom_processing_instruction_t *)(om_node->data_element), env, om_output);
}
if(status != AXIS2_SUCCESS)
{
return status;
}
}
temp_node = axiom_node_get_first_child(om_node, env);
/* serialize children of this node */
if(temp_node)
{
om_node = temp_node;
nodes[count++] = om_node;
}
else
{
if(om_node->node_type == AXIOM_ELEMENT)
{
if(om_node->data_element)
{
status = axiom_element_serialize_end_part(
(axiom_element_t *)(om_node-> data_element), env, om_output);
}
if(status != AXIS2_SUCCESS)
{
return status;
}
}
temp_node = axiom_node_get_next_sibling(om_node, env);
if(temp_node)
{
om_node = temp_node;
nodes[count - 1] = om_node;
}
else
{
while(count > 1 && !temp_node)
{
count--;
om_node = nodes[count - 1];
if(om_node->node_type == AXIOM_ELEMENT)
{
if(om_node->data_element)
{
status = axiom_element_serialize_end_part(
(axiom_element_t *)(om_node->data_element), env, om_output);
}
if(status != AXIS2_SUCCESS)
{
return status;
}
}
temp_node = axiom_node_get_next_sibling(om_node, env);
}
if(temp_node && count > 1)
{
om_node = temp_node;
nodes[count - 1] = om_node;
}
else
{
count--;
}
}
}
}
while(count > 0);
return status;
}
AXIS2_EXTERN axis2_status_t AXIS2_CALL
axiom_node_serialize_sub_tree(
axiom_node_t * om_node,
const axutil_env_t * env,
axiom_output_t * om_output)
{
int status = AXIS2_SUCCESS;
axiom_node_t *temp_node = NULL;
axiom_node_t *nodes[256];
int count = 0;
axutil_hash_t *namespaces = NULL;
axutil_hash_t *namespaces_from_parents = NULL;
AXIS2_ENV_CHECK(env, AXIS2_FAILURE);
if(!om_node)
{
return AXIS2_SUCCESS;
}
namespaces = axutil_hash_make(env);
if(!namespaces)
{
AXIS2_LOG_ERROR(env->log, AXIS2_LOG_SI, "hash for namespaces creation failed");
return AXIS2_FAILURE;
}
namespaces_from_parents = axutil_hash_make(env);
if(!namespaces_from_parents)
{
AXIS2_LOG_ERROR(env->log, AXIS2_LOG_SI, "hash for namespaces_from_parents creation failed");
return AXIS2_FAILURE;
}
nodes[count++] = om_node;
AXIS2_PARAM_CHECK(env->error, om_output, AXIS2_FAILURE);
do
{
if(om_node->node_type == AXIOM_ELEMENT)
{
if(om_node->data_element)
{
axutil_hash_t *temp_namespaces = NULL;
axutil_hash_t *temp_attributes = NULL;
axiom_namespace_t *namespace = NULL;
status = axiom_element_serialize_start_part(
(axiom_element_t *)(om_node-> data_element), env, om_output, om_node);
temp_namespaces = axiom_element_get_namespaces(
(axiom_element_t *)(om_node-> data_element), env);
if(temp_namespaces)
{
axutil_hash_t *new_hash = NULL;
new_hash = axutil_hash_overlay(temp_namespaces, env, namespaces);
if(namespaces)
axutil_hash_free(namespaces, env);
namespaces = new_hash;
}
namespace = axiom_element_get_namespace(
(axiom_element_t *)(om_node-> data_element), env, om_node);
if(namespace)
{
axiom_namespace_t *ns = NULL;
axis2_char_t *prefix = NULL;
prefix = axiom_namespace_get_prefix(namespace, env);
if(prefix)
{
ns = axutil_hash_get(namespaces, prefix, AXIS2_HASH_KEY_STRING);
if(!ns)
{
ns = axutil_hash_get(namespaces_from_parents, prefix,
AXIS2_HASH_KEY_STRING);
if(!ns)
{
axiom_namespace_serialize(namespace, env, om_output);
axutil_hash_set(namespaces_from_parents, prefix,
AXIS2_HASH_KEY_STRING, namespace);
}
}
}
}
temp_attributes = axiom_element_get_all_attributes(
(axiom_element_t *)(om_node->data_element), env);
if(temp_attributes)
{
axutil_hash_index_t *hi;
void *val;
for(hi = axutil_hash_first(temp_attributes, env); hi; hi = axutil_hash_next(
env, hi))
{
axutil_hash_this(hi, NULL, NULL, &val);
if(val)
{
axiom_namespace_t *ns = NULL;
axis2_char_t *prefix = NULL;
namespace
= axiom_attribute_get_namespace((axiom_attribute_t *)val, env);
if(namespace)
{
prefix = axiom_namespace_get_prefix(namespace, env);
if(prefix)
{
ns = axutil_hash_get(namespaces, prefix, AXIS2_HASH_KEY_STRING);
if(!ns)
{
ns = axutil_hash_get(namespaces_from_parents, prefix,
AXIS2_HASH_KEY_STRING);
if(!ns)
{
axiom_namespace_serialize(namespace, env, om_output);
axutil_hash_set(namespaces_from_parents, prefix,
AXIS2_HASH_KEY_STRING, namespace);
}
}
}
}
}
else
{
status = AXIS2_FAILURE;
}
}
}
}
if(status != AXIS2_SUCCESS)
{
break;
}
}
else if(om_node->node_type == AXIOM_DATA_SOURCE)
{
if(om_node->data_element)
{
status = axiom_data_source_serialize(
(axiom_data_source_t *)(om_node->data_element), env, om_output);
}
if(status != AXIS2_SUCCESS)
{
break;
}
}
else if(om_node->node_type == AXIOM_TEXT)
{
if(om_node->data_element)
{
status = axiom_text_serialize((axiom_text_t *)(om_node-> data_element), env,
om_output);
}
if(status != AXIS2_SUCCESS)
{
break;
}
}
else if(om_node->node_type == AXIOM_COMMENT)
{
if(om_node->data_element)
{
status = axiom_comment_serialize((axiom_comment_t *)(om_node-> data_element), env,
om_output);
}
if(status != AXIS2_SUCCESS)
{
break;
}
}
else if(om_node->node_type == AXIOM_DOCTYPE)
{
if(om_node->data_element)
{
status = axiom_doctype_serialize((axiom_doctype_t *)(om_node-> data_element), env,
om_output);
}
if(status != AXIS2_SUCCESS)
{
break;
}
}
else if(om_node->node_type == AXIOM_PROCESSING_INSTRUCTION)
{
if(om_node->data_element)
{
status = axiom_processing_instruction_serialize(
(axiom_processing_instruction_t *)(om_node->data_element), env, om_output);
}
if(status != AXIS2_SUCCESS)
{
break;
}
}
temp_node = axiom_node_get_first_child(om_node, env);
/* serialize children of this node */
if(temp_node)
{
om_node = temp_node;
nodes[count++] = om_node;
}
else
{
if(om_node->node_type == AXIOM_ELEMENT)
{
if(om_node->data_element)
{
axutil_hash_t *temp_attributes = NULL;
axiom_namespace_t *namespace = NULL;
/* at the writing of end part all the namespaces declared
specially to that element should be cancelled */
/* first checking the element namespace */
namespace = axiom_element_get_namespace(
(axiom_element_t *)(om_node-> data_element), env, om_node);
if(namespace)
{
axiom_namespace_t *ns = NULL;
axis2_char_t *prefix = NULL;
prefix = axiom_namespace_get_prefix(namespace, env);
if(prefix)
{
ns = axutil_hash_get(namespaces_from_parents, prefix,
AXIS2_HASH_KEY_STRING);
if(ns)
{
axutil_hash_set(namespaces_from_parents, prefix,
AXIS2_HASH_KEY_STRING, NULL);
}
}
}
/* then checking the attribute namespaces */
temp_attributes = axiom_element_get_all_attributes(
(axiom_element_t *)(om_node->data_element), env);
if(temp_attributes)
{
axutil_hash_index_t *hi;
void *val;
for(hi = axutil_hash_first(temp_attributes, env); hi; hi
= axutil_hash_next(env, hi))
{
axutil_hash_this(hi, NULL, NULL, &val);
if(val)
{
axiom_namespace_t *ns = NULL;
axis2_char_t *prefix = NULL;
namespace = axiom_attribute_get_namespace((axiom_attribute_t *)val,
env);
if(namespace)
{
prefix = axiom_namespace_get_prefix(namespace, env);
if(prefix)
{
ns = axutil_hash_get(namespaces_from_parents, prefix,
AXIS2_HASH_KEY_STRING);
if(ns)
{
axutil_hash_set(namespaces_from_parents, prefix,
AXIS2_HASH_KEY_STRING, NULL);
}
}
}
}
}
}
status = axiom_element_serialize_end_part(
(axiom_element_t *)(om_node-> data_element), env, om_output);
}
if(status != AXIS2_SUCCESS)
{
break;
}
}
/* We need to make make sure that om_node is not the root when we take the next sibling */
if(count > 1)
{
temp_node = axiom_node_get_next_sibling(om_node, env);
}
if(temp_node)
{
om_node = temp_node;
nodes[count - 1] = om_node;
}
else
{
while(count > 1 && !temp_node)
{
count--;
om_node = nodes[count - 1];
if(om_node->node_type == AXIOM_ELEMENT)
{
if(om_node->data_element)
{
axutil_hash_t *temp_attributes = NULL;
axiom_namespace_t *namespace = NULL;
/* similar to the earlier time, whenever the ending is happened
* namespaces declared specially to that element should be cancelled */
/* first checking the element namespace */
namespace = axiom_element_get_namespace(
(axiom_element_t *)(om_node-> data_element), env, om_node);
if(namespace)
{
axiom_namespace_t *ns = NULL;
axis2_char_t *prefix = NULL;
prefix = axiom_namespace_get_prefix(namespace, env);
if(prefix)
{
ns = axutil_hash_get(namespaces_from_parents, prefix,
AXIS2_HASH_KEY_STRING);
if(ns)
{
axutil_hash_set(namespaces_from_parents, prefix,
AXIS2_HASH_KEY_STRING, NULL);
}
}
}
/* then checking the attribute namespaces */
temp_attributes = axiom_element_get_all_attributes(
(axiom_element_t *)(om_node->data_element), env);
if(temp_attributes)
{
axutil_hash_index_t *hi;
void *val;
for(hi = axutil_hash_first(temp_attributes, env); hi; hi
= axutil_hash_next(env, hi))
{
axutil_hash_this(hi, NULL, NULL, &val);
if(val)
{
axiom_namespace_t *ns = NULL;
axis2_char_t *prefix = NULL;
namespace = axiom_attribute_get_namespace(
(axiom_attribute_t *)val, env);
if(namespace)
{
prefix = axiom_namespace_get_prefix(namespace, env);
if(prefix)
{
ns = axutil_hash_get(namespaces_from_parents,
prefix, AXIS2_HASH_KEY_STRING);
if(ns)
{
axutil_hash_set(namespaces_from_parents,
prefix, AXIS2_HASH_KEY_STRING, NULL);
}
}
}
}
}
}
status = axiom_element_serialize_end_part(
(axiom_element_t *)(om_node->data_element), env, om_output);
}
if(status != AXIS2_SUCCESS)
{
break;
}
}
temp_node = axiom_node_get_next_sibling(om_node, env);
}
if(temp_node && count > 1)
{
om_node = temp_node;
nodes[count - 1] = om_node;
}
else
{
count--;
}
}
}
}
while(count > 0);
axutil_hash_free(namespaces_from_parents, env);
axutil_hash_free(namespaces, env);
return status;
}
AXIS2_EXTERN axiom_node_t *AXIS2_CALL
axiom_node_get_parent(
axiom_node_t * om_node,
const axutil_env_t * env)
{
return om_node->parent;
}
AXIS2_EXTERN axiom_node_t *AXIS2_CALL
axiom_node_get_first_child(
axiom_node_t * om_node,
const axutil_env_t * env)
{
int token = 0;
if(!om_node)
{
return NULL;
}
/**********************************************************/
while(!(om_node->first_child) && !(om_node->done) && om_node->builder)
{
token = axiom_stax_builder_next_with_token(om_node->builder, env);
if(token == -1)
{
return NULL;
}
}
/**********************************************************/
return om_node->first_child;
}
AXIS2_EXTERN axiom_node_t *AXIS2_CALL
axiom_node_get_first_element(
axiom_node_t * om_node,
const axutil_env_t * env)
{
int token = 0;
axiom_node_t *first_element;
if(!om_node)
{
return NULL;
}
/**********************************************************/
while(!(om_node->first_child) && !(om_node->done) && om_node->builder)
{
token = axiom_stax_builder_next_with_token(om_node->builder, env);
if(token == -1)
{
return NULL;
}
}
/**********************************************************/
first_element = om_node->first_child;
while(first_element && (axiom_node_get_node_type(first_element, env) != AXIOM_ELEMENT))
{
first_element = axiom_node_get_next_sibling(first_element, env);
}
return first_element;
}
AXIS2_EXTERN axiom_node_t *AXIS2_CALL
axiom_node_get_last_child(
axiom_node_t * om_node,
const axutil_env_t * env)
{
return om_node->last_child;
}
AXIS2_EXTERN axiom_node_t *AXIS2_CALL
axiom_node_get_previous_sibling(
axiom_node_t * om_node,
const axutil_env_t * env)
{
return om_node->prev_sibling;
}
AXIS2_EXTERN axiom_node_t *AXIS2_CALL
axiom_node_get_next_sibling(
axiom_node_t * om_node,
const axutil_env_t * env)
{
int token = 0;
if(!om_node)
{
return NULL;
}
while(!(om_node->next_sibling) && om_node->parent && om_node->builder
&& !(axiom_node_is_complete(om_node->parent, env)))
{
token = axiom_stax_builder_next_with_token(om_node->builder, env);
if(token == -1)
{
return NULL;
}
}
return om_node->next_sibling;
}
AXIS2_EXTERN axiom_types_t AXIS2_CALL
axiom_node_get_node_type(
axiom_node_t * om_node,
const axutil_env_t * env)
{
return om_node->node_type;
}
AXIS2_EXTERN axis2_bool_t AXIS2_CALL
axiom_node_is_complete(
axiom_node_t * om_node,
const axutil_env_t * env)
{
return om_node->done;
}
AXIS2_EXTERN struct axiom_document *AXIS2_CALL
axiom_node_get_document(
axiom_node_t * om_node,
const axutil_env_t * env)
{
if(om_node->builder)
{
return axiom_stax_builder_get_document(om_node->builder, env);
}
return NULL;
}
AXIS2_EXTERN void *AXIS2_CALL
axiom_node_get_data_element(
axiom_node_t * om_node,
const axutil_env_t * env)
{
return om_node->data_element;
}
/**
internal function , not to be used by users
only sets the first_child link because this is needed by builder
*/
void AXIS2_CALL
axiom_node_set_first_child(
axiom_node_t * om_node,
const axutil_env_t * env,
axiom_node_t * first_child)
{
/** set the parent */
axiom_node_set_parent(first_child, env, om_node);
om_node->first_child = first_child;
}
/**
internal function not to be used by users
only sets the previous sibling link as it is needed by builders
*/
void AXIS2_CALL
axiom_node_set_previous_sibling(
axiom_node_t * om_node,
const axutil_env_t * env,
axiom_node_t * prev_sibling)
{
om_node->prev_sibling = prev_sibling;
}
/**
internal function, not to be used by users
only sets the next sibling link;
*/
void AXIS2_CALL
axiom_node_set_next_sibling(
axiom_node_t * om_node,
const axutil_env_t * env,
axiom_node_t * next_sibling)
{
om_node->next_sibling = next_sibling;
}
/**
internal function not to be used by users
sets the node type only used in soap and om
*/
axis2_status_t AXIS2_CALL
axiom_node_set_node_type(
axiom_node_t * om_node,
const axutil_env_t * env,
axiom_types_t type)
{
om_node->node_type = type;
return AXIS2_SUCCESS;
}
/**
internal function , not to be used by users
only used in om and soap
*/
void AXIS2_CALL
axiom_node_set_data_element(
axiom_node_t * om_node,
const axutil_env_t * env,
void *data_element)
{
om_node->data_element = data_element;
}
/**
internal function not to be used by users
only sets the build status
*/
void AXIS2_CALL
axiom_node_set_complete(
axiom_node_t * om_node,
const axutil_env_t * env,
axis2_bool_t done)
{
om_node->done = done;
}
/**
internal function only sets the builder reference ,
should not be used by user
*/
void AXIS2_CALL
axiom_node_set_builder(
axiom_node_t * om_node,
const axutil_env_t * env,
axiom_stax_builder_t * builder)
{
/* builder == NULL is a valid case */
om_node->builder = builder;
}
void AXIS2_CALL
axiom_node_assume_builder_ownership(
axiom_node_t *om_node,
const axutil_env_t * env)
{
om_node->own_builder = AXIS2_TRUE;
}
AXIS2_EXTERN axis2_char_t *AXIS2_CALL
axiom_node_to_string(
axiom_node_t * om_node,
const axutil_env_t * env)
{
int status = AXIS2_SUCCESS;
axiom_output_t *om_output = NULL;
axiom_xml_writer_t *xml_writer = NULL;
axis2_char_t *xml = NULL;
AXIS2_ENV_CHECK(env, NULL);
AXIS2_PARAM_CHECK(env->error, om_node, NULL);
xml_writer = axiom_xml_writer_create_for_memory(env, NULL, AXIS2_TRUE, 0,
AXIS2_XML_PARSER_TYPE_BUFFER);
if(!xml_writer)
{
return NULL;
}
om_output = axiom_output_create(env, xml_writer);
if(!om_output)
{
axiom_xml_writer_free(xml_writer, env);
return NULL;
}
status = axiom_node_serialize(om_node, env, om_output);
if(status == AXIS2_SUCCESS)
{
xml = axutil_strdup(env, (axis2_char_t *)axiom_xml_writer_get_xml(xml_writer, env));
}
axiom_output_free(om_output, env);
return xml;
}
AXIS2_EXTERN axis2_char_t *AXIS2_CALL
axiom_node_sub_tree_to_string(
axiom_node_t * om_node,
const axutil_env_t * env)
{
int status = AXIS2_SUCCESS;
axiom_output_t *om_output = NULL;
axiom_xml_writer_t *xml_writer = NULL;
axis2_char_t *xml = NULL;
AXIS2_ENV_CHECK(env, NULL);
AXIS2_PARAM_CHECK(env->error, om_node, NULL);
xml_writer = axiom_xml_writer_create_for_memory(env, NULL, AXIS2_TRUE, 0,
AXIS2_XML_PARSER_TYPE_BUFFER);
if(!xml_writer)
{
return NULL;
}
om_output = axiom_output_create(env, xml_writer);
if(!om_output)
{
axiom_xml_writer_free(xml_writer, env);
return NULL;
}
status = axiom_node_serialize_sub_tree(om_node, env, om_output);
if(status == AXIS2_SUCCESS)
{
xml = axutil_strdup(env, (axis2_char_t *)axiom_xml_writer_get_xml(xml_writer, env));
}
axiom_output_free(om_output, env);
return xml;
}
AXIS2_EXTERN axis2_char_t *AXIS2_CALL
axiom_node_to_string_non_optimized(
axiom_node_t * om_node,
const axutil_env_t * env)
{
int status = AXIS2_SUCCESS;
axiom_output_t *om_output = NULL;
axiom_xml_writer_t *xml_writer = NULL;
axis2_char_t *xml = NULL;
AXIS2_ENV_CHECK(env, NULL);
AXIS2_PARAM_CHECK(env->error, om_node, NULL);
xml_writer = axiom_xml_writer_create_for_memory(env, NULL, AXIS2_TRUE, 0,
AXIS2_XML_PARSER_TYPE_BUFFER);
if(!xml_writer)
{
return NULL;
}
om_output = axiom_output_create(env, xml_writer);
if(!om_output)
{
axiom_xml_writer_free(xml_writer, env);
return NULL;
}
/*This is where we set the output to be non-optimized*/
axiom_output_set_do_optimize(om_output, env, AXIS2_FALSE);
status = axiom_node_serialize(om_node, env, om_output);
if(status == AXIS2_SUCCESS)
{
xml = axutil_strdup(env, (axis2_char_t *)axiom_xml_writer_get_xml(xml_writer, env));
}
axiom_output_free(om_output, env);
return xml;
}
#if 0
/**
internal function not to be used by users
only used by om builder
*/
AXIS2_EXTERN axis2_status_t AXIS2_CALL
axiom_node_set_document(
axiom_node_t * om_node,
const axutil_env_t * env,
struct axiom_document * om_doc)
{
/* om_doc == NULL is a valid case */
om_node->om_doc = om_doc;
return AXIS2_SUCCESS;
}
/**
* This is an internal function
*/
AXIS2_EXTERN axiom_stax_builder_t *AXIS2_CALL
axiom_node_get_builder(
axiom_node_t * om_node,
const axutil_env_t * env)
{
if(!om_node)
{
return NULL;
}
return om_node->builder;
}
#endif
|