/
erlsom_lib.erl
1241 lines (1106 loc) · 38.5 KB
/
erlsom_lib.erl
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
%%% Copyright (C) 2006 - 2008 Willem de Jong
%%%
%%% This file is part of Erlsom.
%%%
%%% Erlsom is free software: you can redistribute it and/or modify
%%% it under the terms of the GNU Lesser General Public License as
%%% published by the Free Software Foundation, either version 3 of
%%% the License, or (at your option) any later version.
%%%
%%% Erlsom is distributed in the hope that it will be useful,
%%% but WITHOUT ANY WARRANTY; without even the implied warranty of
%%% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
%%% GNU Lesser General Public License for more details.
%%%
%%% You should have received a copy of the GNU Lesser General Public
%%% License along with Erlsom. If not, see
%%% <http://www.gnu.org/licenses/>.
%%%
%%% Author contact: w.a.de.jong@gmail.com
%%% ====================================================================
%%% A couple of support functions for Erlsom
%%% ====================================================================
-module(erlsom_lib).
-export([convertPCData/4,
makeName/2, makeName/4, nameWithoutPrefix/1,
makeAttrName/2, makeTypeName/4, makeTypeName/2,
makeElementName/2, makeGroupName/2, makeTypeRef/3,
makeTypeRefAtom/2, makeGroupRef/2, makeElementRef/2,
makeAttrRef/2, makeTagFromRef/2,
makeTag/2, makeTag/3,
findPrefix/2, findPrefix2/2,
translateType/2,
minMax/1, multMinMax/2,
tagNamespace/2,
listLength/1,
prettyPrint/1,
xmlString/1,
toUnicode/1, detect_encoding/1, detectEncoding/3,
findFile/4, find_xsd/4, findType/6,
readImportFile/1,
newTree/0, addTreeElement/3, isAncestor/3, getAncestor/2,
getLeaves/2,
getDescendants/2,
documentAlternatives/1,
emptyListIfUndefined/1,
searchBase/2,
makeQname/1, localName/1,
getUriFromQname/1,
getTargetNamespaceFromXsd/1,
removePrefixes/1, unique/1,
check_int/2,
getTypeFromElement/2,
getNamespacesFromModel/1, getPrefixFromModel/2]).
-include("erlsom_compile.hrl").
-include("erlsom_sax.hrl").
-include("erlsom.hrl").
-include("erlsom_parse.hrl"). %% the record definitions
-define(SPACE, 32).
%% debug(Text) -> io:format("lib: ~p\n", [Text]).
%%debug(Text1, Text2) ->
%%io:format("~p ~p\n", [Text1, Text2]).
%% Convert text to the indicated type.
convertPCData(Text, Type, Namespaces, NamespaceMapping) ->
try
convertPCData2(Text, Type, Namespaces, NamespaceMapping)
catch
_:_ ->
throw({error,
lists:flatten(io_lib:format("Invalid value for type ~p : ~p", [Type, Text]))})
end.
convertPCData2(Text, char, _Namespaces, _NamespaceMapping) when is_binary(Text) ->
Text;
convertPCData2(Text, Type, Namespaces, NamespaceMapping) when is_binary(Text) ->
convertPCData2(erlsom_ucs:decode_utf8(Text), Type, Namespaces, NamespaceMapping);
convertPCData2(Text, Type, Namespaces, NamespaceMapping) ->
case Type of
char ->
Text;
atom ->
list_to_atom(Text);
ascii ->
%% this is only used by the compiler. Names (which have to be converted to atoms later on
%% in the process) have this type.
try
list_to_atom(Text)
catch
_Class:Exception -> throw(Exception)
end,
Text;
integer ->
list_to_integer(Text);
bool ->
case Text of
"true" -> true;
"false" -> false;
"0" -> false;
"1" -> true;
_ -> throw({error, "invalid value for boolean: " ++ Text})
end;
float ->
xml_to_float(Text);
qname ->
%% qname has form prefix:localname (or, if there is no prefix: localname)
%% split the two parts, look up the prefix to find the uri, and put it into
%% a qname record {localname, URI, prefix} (URI = undefined if there was no prefix)
{Prefix, LocalName} = splitOnColon(Text),
case lists:keysearch(Prefix, 3, Namespaces) of
{value, #ns{uri = URI}} ->
%% this is namespace qualified - now see whether a mapping applies
case lists:keysearch(URI, 2, NamespaceMapping) of
{value, #ns{prefix = MappedPrefix}} ->
#qname{localPart = LocalName, uri = URI, prefix = Prefix,
mappedPrefix = MappedPrefix};
_Else ->
#qname{localPart = LocalName, uri = URI, prefix = Prefix, mappedPrefix = Prefix}
end;
_Else ->
if
Prefix == [] -> %% no prefix, no default namespace
#qname{localPart = Text};
Prefix == "xml" -> %% by convention
#qname{localPart = LocalName, uri = "http://www.w3.org/XML/1998/namespace",
prefix = Prefix, mappedPrefix = Prefix};
true ->
throw({error, invalid})
end
end;
{integer, _} ->
convert_integer(Type, Text)
end.
xml_to_float("NaN") ->
'NaN';
xml_to_float("INF") ->
'INF';
xml_to_float("+INF") ->
'INF';
xml_to_float("-INF") ->
'-INF';
xml_to_float(Float) ->
try
list_to_float(Float)
catch
%% "10" is a problem
error:badarg ->
try
list_to_integer(Float) * 1.0
catch
%% "10E3" is also a problem
error:badarg ->
case string:tokens(Float, "Ee") of
[Mantissa, Exponent] ->
list_to_integer(Mantissa) *
math:pow(10, list_to_integer(Exponent))
end
end
end.
%% Tree is a data structure used to find out the relations between types.
%% It is actually a forest, in the sense that there doesn't have to be
%% a unique root.
newTree() -> [].
addTreeElement(Child, Parent, Tree) ->
[{Child, Parent} | Tree].
%% find out whether Ancestor is really an Ancestor of Element.
isAncestor(Element, Element, _Tree) -> true; %% added because of problem reported by Stu
isAncestor(Ancestor, Element, Tree) ->
case lists:keysearch(Element, 1, Tree) of
{value, {_, Ancestor}} -> true;
{value, {_, Parent} = Elem} ->
%% remove the element, just to be sure that we don't end up in an
%% endless loop.
isAncestor(Ancestor, Parent, lists:delete(Elem, Tree));
_ -> false
end.
%% get the ancestor of this type (if any)
getAncestor(Element, Tree) ->
case lists:keysearch(Element, 1, Tree) of
{value, {_, Ancestor}} -> {value, Ancestor};
_ -> false
end.
%% get all leaves (non-abstract types) of node (abstract type)
getLeaves(Node, Tree) ->
Children = [Child || {Child, N} <- Tree, N == Node],
getLeaves(Children, [], Tree).
getLeaves([], Leaves, _) ->
Leaves;
getLeaves([Node | T], Leaves, Tree) ->
Children = [Child || {Child, N} <- Tree, N == Node],
%% if Node has no children, it is a leave.
case Children of
[] ->
getLeaves(T, [Node | Leaves], Tree);
_ ->
%% If Node does have children, go one level deeper
%% Delete (one instance..) of Node from the tree, to prevent
%% endless looping
getLeaves(Children ++ T, Leaves, lists:keydelete(Node, 2, Tree))
end.
%% get all descendants of Node
getDescendants(Node, Tree) ->
Children = [Child || {Child, N} <- Tree, N == Node],
getDescendants(Children, Children, Tree).
getDescendants([], Descendants, _) ->
Descendants;
getDescendants([Node | T], Descendants, Tree) ->
Children = [Child || {Child, N} <- Tree, N == Node],
%% if Node has no children, it is a leave.
case Children of
[] ->
getDescendants(T, Descendants, Tree);
_ ->
%% If Node does have children, go one level deeper
%% Delete (one instance..) of Node from the tree, to prevent
%% endless looping
getDescendants(Children ++ T, Children ++ Descendants, lists:keydelete(Node, 2, Tree))
end.
minMax(undefined) ->
1;
minMax("unbounded") ->
unbound;
minMax(Integer) ->
list_to_integer(Integer).
multMinMax(0, _) -> 0;
multMinMax(_, 0) -> 0;
multMinMax(unbound, _) -> unbound;
multMinMax(_, unbound) -> unbound;
multMinMax(A, B) -> A * B.
%% returns the URI that belongs to a tag.
%% tag is an atom 'ppp:llll' or 'llll' (ppp = prefix, llll = local name)
%% namespaces is [#ns{prefix, uri}]
tagNamespace(Tag, Namespaces) ->
tagNamespace(atom_to_list(Tag), [], Namespaces).
tagNamespace([$: | _Tail], Acc, Namespaces) ->
case lists:keysearch(lists:reverse(Acc), #ns.prefix, Namespaces) of
{value, #ns{uri = Uri}} ->
Uri;
_Other ->
undefined
end;
tagNamespace([], _Acc, _Namespaces) ->
undefined;
tagNamespace([Char | Tail], Acc, Namespaces) ->
tagNamespace(Tail, [Char | Acc], Namespaces).
nameWithoutPrefix(Name) ->
nameWithoutPrefix(Name, []).
nameWithoutPrefix([$: | Tail], _Acc) ->
Tail;
nameWithoutPrefix([Char | Tail], Acc) ->
nameWithoutPrefix(Tail, [Char | Acc]);
nameWithoutPrefix([], Acc) ->
lists:reverse(Acc).
%% 'strict' == false
translateType(String, false) ->
case String of
"integer" ->
'integer';
"int" ->
'integer';
"QName" ->
'qname';
"boolean" ->
'bool';
_Else ->
'char'
end;
%% strict == true
translateType(String, true) ->
case String of
"integer" ->
integer;
"long" -> % -9223372036854775807 =< X =< 9223372036854775808
{integer, long};
"int" -> % -2147483648 =< X =< 2147483647
{integer, int};
"short" -> % -32768 =< X =< 32767
{integer, short};
"byte" ->
{integer, byte}; % -128 =< X =< 127
"QName" ->
qname;
"boolean" ->
bool;
"nonNegativeInteger" -> % X >= 0
{integer, nonNegativeInteger};
"positiveInteger" -> % X > 0
{integer, positiveInteger};
"unsignedLong" -> % 0 =< X =< 18446744073709551615
{integer, unsignedLong};
"unsignedInt" -> % 0 =< X =< 4294967295
{integer, unsignedInt};
"unsignedShort" -> % 0 =< X =< 65535
{integer, unsignedShort};
"unsignedByte" -> % 0 =< X =< 255
{integer, unsignedByte};
"nonPositiveInteger" -> % X =< 0
{integer, nonPositiveInteger};
"negativeInteger" -> % X < 0
{integer, negativeInteger};
"float" ->
float;
% TODO: add things like PositiveInteger here
_Else ->
'char'
end.
findPrefix(undefined, _Namespaces) ->
[];
findPrefix(Namespace, Namespaces) ->
case lists:keysearch(Namespace, #ns.uri, Namespaces) of
{value, #ns{prefix = undefined}} ->
"";
{value, #ns{prefix = Prefix}} ->
Prefix ++ ":";
_Else ->
throw({error, "Namespace not found " ++ Namespace})
end.
findPrefix2(undefined, _Namespaces) ->
[];
findPrefix2(Namespace, Namespaces) ->
case lists:keysearch(Namespace, #ns.uri, Namespaces) of
{value, #ns{prefix = undefined}} ->
"";
{value, #ns{prefix = Prefix}} ->
Prefix;
_Else ->
"P"
end.
makeTypeName(Name, Prefix) ->
TypePrefix = case get(erlsom_typePrefix) of
undefined -> "";
Value -> Value
end,
Prefix ++ TypePrefix ++ Name.
makeGroupName(Name, Prefix) ->
TypePrefix = case get(erlsom_groupPrefix) of
undefined -> "";
Value -> Value
end,
Prefix ++ TypePrefix ++ Name.
makeElementName(Name, Prefix) ->
%% TypePrefix = case get(erlsom_elementPrefix) of
%% undefined -> "";
%% Value -> Value
%% end,
Prefix ++ Name.
makeTypeName(NameInXsd, ElementFormDefault, Path, Prefix) ->
TypePrefix = case get(erlsom_typePrefix) of
undefined -> "";
Value -> Value
end,
makeName(NameInXsd, ElementFormDefault, TypePrefix ++ Path, Prefix).
makeName(NameInXsd, _ElementFormDefault = "qualified", Path, Prefix) ->
Prefix ++ Path ++ NameInXsd;
makeName(NameInXsd, _ElementFormDefault, Path, _Prefix) ->
Path ++ NameInXsd.
%% -record(schemaInfo, {targetNamespace, elementFormDefault, namespacePrefix, namespaces}).
makeName(NameInXsd, #schemaInfo{elementFormDefault="qualified", targetNamespace=TNS, namespaces=NS,
path=Path}) ->
%% find the target namespace in NS,
%% add the prefix and the path
case NameInXsd of
_ -> ok
end,
case lists:keysearch(TNS, 2, NS) of
{value, #ns{prefix = undefined}} ->
Path ++ NameInXsd;
{value, #ns{prefix = Prefix}} ->
Prefix ++ ":" ++ Path ++ NameInXsd;
_Else ->
if
TNS == undefined ->
Path ++ NameInXsd;
true ->
throw({error, "Namespace not found " ++ NameInXsd})
end
end;
makeName(NameInXsd, #schemaInfo{targetNamespace=TNS, namespaces=NS, path=[]}) ->
%% elementFormDefault = unqualified (or undefined)
%% since Path = [], this is a global element,and we need to add the prefix.
case lists:keysearch(TNS, 2, NS) of
{value, #ns{prefix = undefined}} ->
NameInXsd;
{value, #ns{prefix = Prefix}} ->
Prefix ++ ":" ++ NameInXsd;
_Else ->
if
TNS == undefined ->
NameInXsd;
true ->
throw({error, "Namespace not found " ++ NameInXsd})
end
end;
makeName(NameInXsd, #schemaInfo{targetNamespace=TNS, namespaces=NS, path=Path}) ->
%% elementFormDefault = unqualified (or undefined)
%% since Path /= [], this is a local element,and we need to add the prefix and the path.
case lists:keysearch(TNS, 2, NS) of
{value, #ns{prefix = undefined}} ->
NameInXsd;
{value, #ns{prefix = Prefix}} ->
Prefix ++ ":" ++ Path ++ NameInXsd;
_Else ->
if
TNS == undefined ->
Path ++ NameInXsd;
true ->
throw({error, "Namespace not found " ++ NameInXsd})
end
end.
%% -record(schemaInfo, {targetNamespace, elementFormDefault, namespacePrefix, namespaces}).
makeAttrName(NameInXsd, _Info) ->
NameInXsd.
makeTypeRefAtom(Qname, Namespaces) ->
%% This is only used when building the type-hierarchy. In that
%% context 'strict' is not relevant (so we can simply put 'false').
TypeRef = makeTypeRef(Qname, Namespaces, false),
case TypeRef of
{_, _} -> TypeRef;
_ -> list_to_atom(TypeRef)
end.
%% makeTypeRef creates a reference to a type. This can either be a type
%% defined in the XSD (or an imorted XSD), or a predefined type (like
%% xsd:string).
%% For the predefined types special codes are returned ({'#PCDATA', ...}).
%% input is a qname.
%% The output includes the prefix (as found in the Namespaces list), unless the
%% type is not in a particular namespace.
%% If a special prefix was defined for types, this prefix is also added (after
%% the namespace prefix. So the result could be P:t#MyType, for example.
%% The 'type-prefix' is taken from a proces-variable (not very nice, sorry).
%% TODO: should return an atom (or {'PCDATA', ...})?
makeTypeRef(undefined, _, _) ->
%% the 'ur-type': any type (and any attibute).
{'#PCDATA', 'char'};
makeTypeRef(Qname = #qname{uri = NS, localPart = Local}, Namespaces, Strict) ->
TypePrefix = case get(erlsom_typePrefix) of
undefined -> "";
Value -> Value
end,
case NS of
"http://www.w3.org/2001/XMLSchema" ->
{'#PCDATA', translateType(Local, Strict)};
_Else ->
makeRef(Qname, Namespaces, TypePrefix)
end.
makeElementRef(Qname, Namespaces) ->
%% ElementPrefix = case get(erlsom_elementPrefix) of
%% undefined -> "";
%% Value -> Value
%% end,
makeRef(Qname, Namespaces, "").
makeGroupRef(Qname, Namespaces) ->
GroupPrefix = case get(erlsom_groupPrefix) of
undefined -> "";
Value -> Value
end,
makeRef(Qname, Namespaces, GroupPrefix).
makeAttrRef(QName, Namespaces) ->
makeRef(QName, Namespaces, "").
makeTagFromRef(QName, Namespaces) ->
makeRef(QName, Namespaces, "").
%% ExtraPrefix is the additional prefix to distinguish
%% types, groups and elements
makeRef(#qname{uri = NS, localPart = Local}, Namespaces, ExtraPrefix) ->
case lists:keysearch(NS, 2, Namespaces) of
{value, #ns{prefix = undefined}} ->
ExtraPrefix ++ Local;
%% undefined ~~ ""
{value, #ns{prefix = ""}} ->
ExtraPrefix ++ Local;
{value, #ns{prefix = Prefix}} ->
Prefix ++ ":" ++ ExtraPrefix ++ Local;
_ ->
if
NS == undefined ->
ExtraPrefix ++ Local;
true ->
case {NS, Local} of
%% weird cases
{"http://www.w3.org/XML/1998/namespace", "lang"} -> "xml:lang";
{"http://www.w3.org/XML/1998/namespace", "space"} -> "xml:space";
_ ->
throw({error, "Namespace not found " ++ NS})
end
end
end.
makeTag(NameInXsd, Prefix, _ElementFormDefault = "qualified") ->
Prefix ++ NameInXsd;
makeTag(NameInXsd, _Prefix, _ElementFormDefault) ->
NameInXsd.
makeTag(NameInXsd, #schemaInfo{targetNamespace=undefined}) ->
NameInXsd;
makeTag(NameInXsd, #schemaInfo{elementFormDefault="qualified", targetNamespace=TNS, namespaces=NS}) ->
%% find the target namespace in NS,
%% add the prefix.
case lists:keysearch(TNS, 2, NS) of
{value, #ns{prefix = undefined}} ->
NameInXsd;
{value, #ns{prefix = Prefix}} ->
Prefix ++ ":" ++ NameInXsd;
_Else ->
if
TNS == undefined ->
NameInXsd;
true ->
throw({error, "Namespace not found " ++ TNS})
end
end;
makeTag(NameInXsd, _SchemaInfo) ->
%% defaultElementForm = unqualified, do not add the prefix (TODO: exept for global elements and types).
NameInXsd.
listLength(undefined) -> 0;
listLength(List) -> length(List).
toUnicode(Bin) ->
autodetect(Bin).
findType(TypeReference, Types, Attributes, TypeHierarchy, Namespaces, NamespaceMapping) ->
case lists:keysearch(TypeReference, #type.nm, Types) of
{value, Value} ->
case findXsiType(Attributes) of
{value, XsiType} ->
findDerivedType(TypeReference, XsiType, Types, TypeHierarchy, Namespaces, NamespaceMapping);
_ -> Value
end;
_Else ->
throw({error, "Type not found: " ++ atom_to_list(TypeReference)})
end.
findXsiType([]) -> false;
findXsiType([#attribute{localName= "type",
uri = "http://www.w3.org/2001/XMLSchema-instance",
value = Value}| _Tail]) -> {value, Value};
findXsiType([_| Tail]) ->
findXsiType(Tail).
findDerivedType(Type, XsiType, Types, TypeHierarchy, Namespaces, NamespaceMapping) ->
#qname{localPart = LocalName, mappedPrefix = MappedPrefix} =
convertPCData(XsiType, qname, Namespaces, NamespaceMapping),
XsiTypeMapped = list_to_atom(makeTypeName(LocalName, case MappedPrefix of undefined -> ""; _ -> MappedPrefix ++ ":" end)),
case isAncestor(Type, XsiTypeMapped, TypeHierarchy) of
false ->
throw({error, "Type not found in hierarchy: " ++ atom_to_list(Type)});
_ ->
case lists:keysearch(XsiTypeMapped, #type.nm, Types) of
{value, Value} ->
Value;
_ ->
throw({error, "Derived type not found: " ++ atom_to_list(Type)})
end
end.
autodetect(Input) ->
case detectEncoding(Input) of
ucs4be ->
xmerl_ucs:from_ucs4be(Input);
ucs4le ->
xmerl_ucs:from_ucs4le(Input);
utf16be ->
{Result, []} = erlsom_ucs:from_utf16be(Input),
Result;
utf16le ->
{Result, []} = erlsom_ucs:from_utf16le(Input),
Result;
utf8 ->
{Result, []} = erlsom_ucs:from_utf8(Input),
Result;
iso_8859_1 ->
binary_to_list(Input)
end.
%% CFun = {ContinuationFunction, ContinuationState} (or undefined)
detectEncoding(Xml, _CFun, CState) when is_list(Xml) ->
{list, Xml, CState};
detectEncoding(Xml, CFun, CState) when is_binary(Xml) ->
case Xml of
<<>> ->
case CFun(Xml, CState) of
{<<>>, _} ->
throw({error, "empty document"});
{Xml2, State2} ->
{detectEncoding(Xml2), Xml2, State2}
end;
_ ->
{detectEncoding(Xml), Xml, CState}
end.
%%------------------------------------------------------------------------------
%% This was copied from xmerl_lib (by Ulf Wiger), but modified to work
%% on binaries in stead of lists. I also removed the option to specify
%% a character set - the function only looks at the first 2 or 4 bytes.
%% Finally, I changed it to not remove the byte order mark (since
%% erlsom has no problem with the byte order mark).
%%
%% Auto detect what kind of character set we are dealing with and transform
%% to Erlang integer Unicode format if found.
%% Appendix F, Page 56-57, XML 1.0 W3C Recommendation 6 October 2000
%% (http://www.w3.org/TR/REC-xml)
%% 00 00 00 3C ( "<" in UCS-4 big-endian)
%% 3C 00 00 00 ( "<" in UCS-4 little-endian)
%% FE FF (UTF-16 - big-endian Mark)
%% FF FE (UTF-16 - little-endian Mark)
%% 00 3C 00 3F ( "<?" in UTF-16 big-endian)
%% 3C 00 3F 00 ( "<?" in UTF-16 big-endian)
%% 3C 3F (7-bit,8-bit or mixed width encoding)
%% 4C 6F A7 94 (EBCDIC) - Not Implemented!!!!
%% Check byte-order mark and transform to Unicode, Erlang integer
%%% --- With byte-order mark
detect_encoding(List)
when is_list(List) ->
detect_encoding(list_to_binary(List));
detect_encoding(Xml) ->
{detectEncoding(Xml), Xml}.
%% This is the internal version
%% the version detect_encoding() is there for reasons of backward
%% compatibility
detectEncoding(<<0,0,16#fe,16#ff, _Rest/binary>>) ->
ucs4be;
detectEncoding(<<16#ff,16#fe,0,0, _Rest/binary>>) ->
ucs4le;
detectEncoding(<<16#fe,16#ff, _Rest/binary>>) ->
utf16be;
detectEncoding(<<16#ff,16#fe, _Rest/binary>>) ->
utf16le;
detectEncoding(<<16#ef,16#bb,16#bf, _Rest/binary>>) ->
utf8;
%%% --- Without byte-order mark
detectEncoding(<<0,0,0,16#3c, _Rest/binary>>) ->
ucs4be;
detectEncoding(<<16#3c,0,0,0, _Rest/binary>>) ->
ucs4le;
detectEncoding(<<0,16#3c,0,16#3f, _Rest/binary>>) ->
utf16be;
detectEncoding(<<16#3c,0,16#3f,0, _Rest/binary>>) ->
utf16le;
%% based on a suggestion by Tobbe:
detectEncoding(<<$<,$?,$x,$m,$l, _Rest/binary>> = Content) ->
detect_encoding2(Content);
detectEncoding(_Input) ->
%% debug("unknown encoding? Assume UTF-8"),
utf8.
detect_encoding2(<<First100:100/binary, _Rest/binary>>) ->
Variables = parse_prolog(binary_to_list(First100)),
detect_encoding3(Variables);
detect_encoding2(Content) -> %% < 100 characters in the XML
Variables = parse_prolog(binary_to_list(Content)),
detect_encoding3(Variables).
detect_encoding3(Variables) ->
case lists:keysearch("encoding", 1, Variables) of
{value, {_, Encoding}} ->
case encoding_type(Encoding) of
'utf-8' ->
utf8;
'iso-8859-1' ->
iso_8859_1;
'iso-8859-15' ->
iso_8859_15;
'us-ascii' ->
iso_8859_1;
_ -> throw({error, "Encoding " ++ Encoding ++ " not supported"})
end;
_ ->
utf8
end.
encoding_type(Cs) when is_list(Cs) ->
case to_lower(Cs) of
"iso-8859-1" -> 'iso-8859-1';
"iso_8859_1" -> 'iso-8859-1';
"iso_8859-1" -> 'iso-8859-1';
"iso8859-1" -> 'iso-8859-1';
"iso-8859-15" -> 'iso-8859-15';
"iso_8859_15" -> 'iso-8859-15';
"iso_8859-15" -> 'iso-8859-15';
"iso8859-15" -> 'iso-8859-15';
"utf-8" -> 'utf-8';
"utf_8" -> 'utf-8';
"us-ascii" -> 'us-ascii';
_ -> false
end.
to_lower(Str) when is_list(Str) -> [to_lower(C) || C <- Str];
to_lower(C) when C >= $A, C =< $Z -> C+($a-$A);
to_lower(C) -> C.
%% end of the code based on Tobbes code
%% some code to parse the XML prolog.
%% returns a list of tuples {variable, value}
%% <?xml version = '1.0' encoding="utf-9" ?>
%% gives [{"version", "1.0"}, {"encoding", "utf-9"}]
parse_prolog("<?xml" ++ Tail) ->
parse_variables(Tail, []);
parse_prolog(_) -> [].
parse_variables([], _Acc) ->
%% error, but never mind
[];
parse_variables("?>" ++ _, Acc) -> Acc;
parse_variables(T = [X | Tail], Acc) ->
case typeOfMarkupChar(X) of
namestartchar ->
parse_variable(T, [], Acc);
whitespace ->
parse_variables(Tail, Acc);
_ -> []
end.
parse_variable([X| Tail], NameAcc, Acc) ->
case typeOfNameChar(X) of
namechar -> parse_variable(Tail, [X | NameAcc], Acc);
whitespace -> parse_variable_is(Tail, lists:reverse(NameAcc), Acc);
equalsign -> parse_to_quote(Tail, lists:reverse(NameAcc), Acc);
_ -> []
end.
parse_variable_is([X | Tail], Name, Acc) ->
case typeOfNameChar(X) of
whitespace -> parse_variable_is(Tail, Name, Acc);
equalsign -> parse_to_quote(Tail, Name, Acc);
_ -> []
end.
parse_to_quote([X|Tail], Name, Acc) ->
case typeOfMarkupChar(X) of
whitespace -> parse_to_quote(Tail, Name, Acc);
quote -> parse_value(Tail, [], Name, X, Acc);
_ -> []
end.
parse_value([Quote|Tail], ValueAcc, Name, Quote, Acc) ->
parse_variables(Tail, [{Name, lists:reverse(ValueAcc)} | Acc]);
parse_value([X|Tail], ValueAcc, Name, Quote, Acc) ->
parse_value(Tail, [X | ValueAcc], Name, Quote, Acc);
parse_value([], _ValueAcc, _Name, _Quote, _Acc) ->
[].
findFile(Namespace, Location, IncludeFiles, IncludeDirs) ->
case lists:keysearch(Namespace, 1, IncludeFiles) of
{value, {_, Prefix, Schema = #schemaType{}}} ->
{Schema, Prefix};
{value, {_, Prefix, undefined}} ->
{getFile(Location, IncludeDirs), Prefix};
{value, {_, Prefix, FileName}} ->
{getFile(FileName, IncludeDirs), Prefix};
_ ->
{getFile(Location, IncludeDirs), undefined}
end.
getFile("https://"++_ = URL, _) ->
case httpc:request(URL) of
{ok,{{_HTTP,200,_OK}, _Headers, Body}} ->
toUnicode(Body);
{ok,{{_HTTP,RC,Emsg}, _Headers, _Body}} ->
error_logger:error_msg("~p: http-request got: ~p~n",
[?MODULE, {RC, Emsg}]),
{error, "failed to retrieve: "++URL};
{error, Reason} ->
error_logger:error_msg("~p: http-request failed: ~p~n",
[?MODULE, Reason]),
{error, "failed to retrieve: "++URL}
end;
getFile(Location, IncludeDirs) ->
case filelib:is_file(Location) of
true ->
readImportFile(Location);
_ ->
%% debug(IncludeDirs),
findFileInDirs(Location, IncludeDirs)
end.
findFileInDirs(undefined, []) ->
throw({error, "Include file not found (undefined)"});
findFileInDirs(Location, []) ->
throw({error, "Include file not found " ++ Location});
findFileInDirs(Location, [H | T]) ->
Name = filename:join([H, Location]),
case filelib:is_file(Name) of
true ->
readImportFile(Name);
_ ->
findFileInDirs(Location, T)
end.
readImportFile(Name) ->
case file:read_file(Name) of
{ok, Bin} ->
toUnicode(Bin);
Error ->
throw({error,
lists:flatten(io_lib:format("Error reading include file ~p - ~p",
[Name, Error]))})
end.
%% Include_fun is a function that finds the files that are included or imported in
%% the XSD. It should be a function that takes 4 arguments:
%% - Namespace (from the XSD). This is a string or 'undefined'
%% - SchemaLocation (from the XSD). This is a string or 'undefined'
%% - Include_dirs. This is the value of the Include_dirs option if this option
%% was passed to compile_xsd(); 'undefined' otherwise.
%% - Inlcude_list. This is the value of the Include_list option if this
%% option was passed to compile_xsd(); 'undefined' otherwise.
%%
%% Include_fun should return {XSD, Prefix}, where XSD is a XSD = string(), Prefix
%% = string or 'undefined', see above.
find_xsd(Namespace, Location, Include_dirs, Include_list) ->
case get_url(Location) of
{ok, Body} ->
Prefix = prefix(Namespace),
{Body, Prefix};
_ ->
erlsom_lib:findFile(Namespace, Location, Include_dirs, Include_list)
end.
prefix(Namespace) ->
Tokens = string:tokens(Namespace, "/ "),
string:substr(lists:last(Tokens), 1, 5).
%%% --------------------------------------------------------------------
%%% Get a file from an URL spec.
%%% function created by Tobbe, copied from yaws_soap_lib
%%% slightly modified
%%% --------------------------------------------------------------------
get_url("http://"++_ = URL) ->
case httpc:request(URL) of
{ok, {{_HTTP, 200, _OK}, _Headers, Body}} ->
case http_uri:parse(URL) of
{ok, {_Method, _, _Host, _Port, _Path, _Qargs}} ->
{ok, Body};
_ ->
{error, "failed to retrieve: "++URL}
end;
_Error ->
{error, "failed to retrieve: "++URL}
end;
get_url(_) ->
{error, "not a URL"}.
emptyListIfUndefined(undefined) -> [];
emptyListIfUndefined(List) -> List.
%% Note: initially there can be more than 1 element in the list with the same name (an element and a type).
%% We are looking for the type.
searchBase(_Name, []) ->
not_found;
searchBase(Name, [H = #typeInfo{typeName = Name, typeType = TypeT} | _])
when TypeT /= globalElementRefOnly ->
{value, H};
searchBase(Name, [_H | T]) ->
searchBase(Name, T).
%% Context can be:
%% name, markup
%% Returns:
%% whitespace, lessthan, morethan, etc, see below.
typeOfNameChar(Char) ->
if
Char > 96 ->
if
Char < 123 -> namechar;
Char < 127 -> char;
true -> illegal
end;
Char > 64 ->
if
Char < 91 -> namechar;
Char == 95 -> namechar;
true -> char
end;
Char > 47 ->
if
Char < 59 -> namechar;
Char == 61 -> equalsign;
Char == 62 -> morethan;
Char == 63 -> questionmark;
true -> char
end;
Char > 32 ->
if
Char < 40 -> char;
Char < 45 -> illegal;
Char == 47 -> slash;
true -> namechar
end;
Char == 32 -> whitespace;
Char == 9 -> whitespace;
Char == 10 -> whitespace;
Char == 13 -> whitespace;
true -> illegal
end.
%% Context can be:
%% name, markup
%% Returns:
%% whitespace, lessthan, morethan, etc, see below.
typeOfMarkupChar(Char) ->
if
Char == 32 -> whitespace;
Char > 96 ->
if
Char < 123 -> namestartchar;
Char < 127 -> char;
true -> illegal
end;
Char > 64 ->
if
Char < 91 -> namestartchar;
Char == 95 -> namestartchar;
true -> char
end;
Char > 40 ->
if
Char == 47 -> slash;
Char < 60 -> char;
Char == 60 -> lessthan;
Char == 61 -> equalsign;
Char == 62 -> morethan;
true -> char
end;
Char > 32 ->
if