blob: 3d64a7e38f9935240932b60ba54805d0742ba281 [file] [log] [blame]
Daniel Veillard4255d502002-04-16 15:50:10 +00001/*
2 * schemastypes.c : implementation of the XML Schema Datatypes
3 * definition and validity checking
4 *
5 * See Copyright for the status of this software.
6 *
7 * Daniel Veillard <veillard@redhat.com>
8 */
9
10#define IN_LIBXML
11#include "libxml.h"
12
13#ifdef LIBXML_SCHEMAS_ENABLED
14
15#include <string.h>
16#include <libxml/xmlmemory.h>
17#include <libxml/parser.h>
18#include <libxml/parserInternals.h>
19#include <libxml/hash.h>
20#include <libxml/valid.h>
Daniel Veillard96a4b252003-02-06 08:22:32 +000021#include <libxml/xpath.h>
22#include <libxml/uri.h>
Daniel Veillard4255d502002-04-16 15:50:10 +000023
24#include <libxml/xmlschemas.h>
25#include <libxml/schemasInternals.h>
26#include <libxml/xmlschemastypes.h>
27
Daniel Veillard070803b2002-05-03 07:29:38 +000028#ifdef HAVE_MATH_H
29#include <math.h>
30#endif
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +000031#ifdef HAVE_FLOAT_H
32#include <float.h>
33#endif
Daniel Veillard070803b2002-05-03 07:29:38 +000034
Daniel Veillard4255d502002-04-16 15:50:10 +000035#define DEBUG
36
Daniel Veillardd0cf7f62004-11-09 16:17:02 +000037#ifndef LIBXML_XPATH_ENABLED
38extern double xmlXPathNAN;
39extern double xmlXPathPINF;
40extern double xmlXPathNINF;
41#endif
42
Daniel Veillard4255d502002-04-16 15:50:10 +000043#define TODO \
44 xmlGenericError(xmlGenericErrorContext, \
45 "Unimplemented block at %s:%d\n", \
46 __FILE__, __LINE__);
47
48#define XML_SCHEMAS_NAMESPACE_NAME \
49 (const xmlChar *)"http://www.w3.org/2001/XMLSchema"
50
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +000051#define IS_WSP_REPLACE_CH(c) ((((c) == 0x9) || ((c) == 0xa)) || \
52 ((c) == 0xd))
53
54#define IS_WSP_SPACE_CH(c) ((c) == 0x20)
55
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +000056#define IS_WSP_BLANK_CH(c) IS_BLANK_CH(c)
57
Daniel Veillard070803b2002-05-03 07:29:38 +000058/* Date value */
59typedef struct _xmlSchemaValDate xmlSchemaValDate;
60typedef xmlSchemaValDate *xmlSchemaValDatePtr;
61struct _xmlSchemaValDate {
62 long year;
63 unsigned int mon :4; /* 1 <= mon <= 12 */
64 unsigned int day :5; /* 1 <= day <= 31 */
65 unsigned int hour :5; /* 0 <= hour <= 23 */
66 unsigned int min :6; /* 0 <= min <= 59 */
67 double sec;
Daniel Veillarda77cf712003-05-09 23:09:55 +000068 unsigned int tz_flag :1; /* is tzo explicitely set? */
Kasimier T. Buchcik285b3672005-05-12 13:10:22 +000069 signed int tzo :12; /* -1440 <= tzo <= 1440;
70 currently only -840 to +840 are needed */
Daniel Veillard070803b2002-05-03 07:29:38 +000071};
72
73/* Duration value */
74typedef struct _xmlSchemaValDuration xmlSchemaValDuration;
75typedef xmlSchemaValDuration *xmlSchemaValDurationPtr;
76struct _xmlSchemaValDuration {
77 long mon; /* mon stores years also */
78 long day;
79 double sec; /* sec stores min and hour also */
80};
81
Daniel Veillard4255d502002-04-16 15:50:10 +000082typedef struct _xmlSchemaValDecimal xmlSchemaValDecimal;
83typedef xmlSchemaValDecimal *xmlSchemaValDecimalPtr;
84struct _xmlSchemaValDecimal {
85 /* would use long long but not portable */
Daniel Veillarde637c4a2003-03-30 21:10:09 +000086 unsigned long lo;
87 unsigned long mi;
88 unsigned long hi;
Daniel Veillard4255d502002-04-16 15:50:10 +000089 unsigned int extra;
Daniel Veillard5a872412002-05-22 06:40:27 +000090 unsigned int sign:1;
William M. Brackc1939562003-08-05 15:52:22 +000091 unsigned int frac:7;
92 unsigned int total:8;
Daniel Veillard4255d502002-04-16 15:50:10 +000093};
94
Daniel Veillarde637c4a2003-03-30 21:10:09 +000095typedef struct _xmlSchemaValQName xmlSchemaValQName;
96typedef xmlSchemaValQName *xmlSchemaValQNamePtr;
97struct _xmlSchemaValQName {
98 xmlChar *name;
99 xmlChar *uri;
100};
101
Daniel Veillard70bcb0e2003-08-08 14:00:28 +0000102typedef struct _xmlSchemaValHex xmlSchemaValHex;
103typedef xmlSchemaValHex *xmlSchemaValHexPtr;
104struct _xmlSchemaValHex {
105 xmlChar *str;
106 unsigned int total;
107};
108
Daniel Veillard1ac24d32003-08-27 14:15:15 +0000109typedef struct _xmlSchemaValBase64 xmlSchemaValBase64;
110typedef xmlSchemaValBase64 *xmlSchemaValBase64Ptr;
111struct _xmlSchemaValBase64 {
112 xmlChar *str;
113 unsigned int total;
114};
115
Daniel Veillard4255d502002-04-16 15:50:10 +0000116struct _xmlSchemaVal {
117 xmlSchemaValType type;
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000118 struct _xmlSchemaVal *next;
Daniel Veillard4255d502002-04-16 15:50:10 +0000119 union {
Daniel Veillard5a872412002-05-22 06:40:27 +0000120 xmlSchemaValDecimal decimal;
Daniel Veillard070803b2002-05-03 07:29:38 +0000121 xmlSchemaValDate date;
122 xmlSchemaValDuration dur;
Daniel Veillarde637c4a2003-03-30 21:10:09 +0000123 xmlSchemaValQName qname;
Daniel Veillard70bcb0e2003-08-08 14:00:28 +0000124 xmlSchemaValHex hex;
Daniel Veillard1ac24d32003-08-27 14:15:15 +0000125 xmlSchemaValBase64 base64;
Daniel Veillard84d70a42002-09-16 10:51:38 +0000126 float f;
127 double d;
Daniel Veillardc5a70f22003-02-06 23:41:59 +0000128 int b;
Daniel Veillardc4c21552003-03-29 10:53:38 +0000129 xmlChar *str;
Daniel Veillard4255d502002-04-16 15:50:10 +0000130 } value;
131};
132
133static int xmlSchemaTypesInitialized = 0;
134static xmlHashTablePtr xmlSchemaTypesBank = NULL;
135
Daniel Veillardc6e997c2003-01-27 12:35:42 +0000136/*
137 * Basic types
138 */
Daniel Veillard4255d502002-04-16 15:50:10 +0000139static xmlSchemaTypePtr xmlSchemaTypeStringDef = NULL;
140static xmlSchemaTypePtr xmlSchemaTypeAnyTypeDef = NULL;
141static xmlSchemaTypePtr xmlSchemaTypeAnySimpleTypeDef = NULL;
142static xmlSchemaTypePtr xmlSchemaTypeDecimalDef = NULL;
Daniel Veillard070803b2002-05-03 07:29:38 +0000143static xmlSchemaTypePtr xmlSchemaTypeDatetimeDef = NULL;
Daniel Veillard4255d502002-04-16 15:50:10 +0000144static xmlSchemaTypePtr xmlSchemaTypeDateDef = NULL;
Daniel Veillard070803b2002-05-03 07:29:38 +0000145static xmlSchemaTypePtr xmlSchemaTypeTimeDef = NULL;
146static xmlSchemaTypePtr xmlSchemaTypeGYearDef = NULL;
147static xmlSchemaTypePtr xmlSchemaTypeGYearMonthDef = NULL;
148static xmlSchemaTypePtr xmlSchemaTypeGDayDef = NULL;
149static xmlSchemaTypePtr xmlSchemaTypeGMonthDayDef = NULL;
150static xmlSchemaTypePtr xmlSchemaTypeGMonthDef = NULL;
151static xmlSchemaTypePtr xmlSchemaTypeDurationDef = NULL;
Daniel Veillard84d70a42002-09-16 10:51:38 +0000152static xmlSchemaTypePtr xmlSchemaTypeFloatDef = NULL;
Daniel Veillardc5a70f22003-02-06 23:41:59 +0000153static xmlSchemaTypePtr xmlSchemaTypeBooleanDef = NULL;
Daniel Veillard84d70a42002-09-16 10:51:38 +0000154static xmlSchemaTypePtr xmlSchemaTypeDoubleDef = NULL;
Daniel Veillard560c2a42003-07-06 21:13:49 +0000155static xmlSchemaTypePtr xmlSchemaTypeHexBinaryDef = NULL;
Daniel Veillard1ac24d32003-08-27 14:15:15 +0000156static xmlSchemaTypePtr xmlSchemaTypeBase64BinaryDef = NULL;
Daniel Veillarde5b110b2003-02-04 14:43:39 +0000157static xmlSchemaTypePtr xmlSchemaTypeAnyURIDef = NULL;
Daniel Veillard4255d502002-04-16 15:50:10 +0000158
159/*
Daniel Veillardc6e997c2003-01-27 12:35:42 +0000160 * Derived types
161 */
162static xmlSchemaTypePtr xmlSchemaTypePositiveIntegerDef = NULL;
163static xmlSchemaTypePtr xmlSchemaTypeNonPositiveIntegerDef = NULL;
164static xmlSchemaTypePtr xmlSchemaTypeNegativeIntegerDef = NULL;
165static xmlSchemaTypePtr xmlSchemaTypeNonNegativeIntegerDef = NULL;
166static xmlSchemaTypePtr xmlSchemaTypeIntegerDef = NULL;
167static xmlSchemaTypePtr xmlSchemaTypeLongDef = NULL;
168static xmlSchemaTypePtr xmlSchemaTypeIntDef = NULL;
169static xmlSchemaTypePtr xmlSchemaTypeShortDef = NULL;
170static xmlSchemaTypePtr xmlSchemaTypeByteDef = NULL;
171static xmlSchemaTypePtr xmlSchemaTypeUnsignedLongDef = NULL;
172static xmlSchemaTypePtr xmlSchemaTypeUnsignedIntDef = NULL;
173static xmlSchemaTypePtr xmlSchemaTypeUnsignedShortDef = NULL;
174static xmlSchemaTypePtr xmlSchemaTypeUnsignedByteDef = NULL;
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000175static xmlSchemaTypePtr xmlSchemaTypeNormStringDef = NULL;
176static xmlSchemaTypePtr xmlSchemaTypeTokenDef = NULL;
177static xmlSchemaTypePtr xmlSchemaTypeLanguageDef = NULL;
178static xmlSchemaTypePtr xmlSchemaTypeNameDef = NULL;
179static xmlSchemaTypePtr xmlSchemaTypeQNameDef = NULL;
Daniel Veillarde5b110b2003-02-04 14:43:39 +0000180static xmlSchemaTypePtr xmlSchemaTypeNCNameDef = NULL;
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000181static xmlSchemaTypePtr xmlSchemaTypeIdDef = NULL;
182static xmlSchemaTypePtr xmlSchemaTypeIdrefDef = NULL;
183static xmlSchemaTypePtr xmlSchemaTypeIdrefsDef = NULL;
Daniel Veillarda1a9d042003-03-18 16:53:17 +0000184static xmlSchemaTypePtr xmlSchemaTypeEntityDef = NULL;
185static xmlSchemaTypePtr xmlSchemaTypeEntitiesDef = NULL;
Daniel Veillarde637c4a2003-03-30 21:10:09 +0000186static xmlSchemaTypePtr xmlSchemaTypeNotationDef = NULL;
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000187static xmlSchemaTypePtr xmlSchemaTypeNmtokenDef = NULL;
188static xmlSchemaTypePtr xmlSchemaTypeNmtokensDef = NULL;
Daniel Veillardc6e997c2003-01-27 12:35:42 +0000189
Daniel Veillardd0c9c322003-10-10 00:49:42 +0000190/************************************************************************
191 * *
192 * Datatype error handlers *
193 * *
194 ************************************************************************/
195/**
196 * xmlSchemaTypeErrMemory:
197 * @extra: extra informations
198 *
199 * Handle an out of memory condition
200 */
201static void
202xmlSchemaTypeErrMemory(xmlNodePtr node, const char *extra)
203{
204 __xmlSimpleError(XML_FROM_DATATYPE, XML_ERR_NO_MEMORY, node, NULL, extra);
205}
206
207/************************************************************************
208 * *
209 * Base types support *
210 * *
211 ************************************************************************/
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000212
213/**
214 * xmlSchemaNewValue:
215 * @type: the value type
216 *
217 * Allocate a new simple type value
218 *
219 * Returns a pointer to the new value or NULL in case of error
220 */
221static xmlSchemaValPtr
222xmlSchemaNewValue(xmlSchemaValType type) {
223 xmlSchemaValPtr value;
224
225 value = (xmlSchemaValPtr) xmlMalloc(sizeof(xmlSchemaVal));
226 if (value == NULL) {
227 return(NULL);
228 }
229 memset(value, 0, sizeof(xmlSchemaVal));
230 value->type = type;
231 return(value);
232}
233
234static xmlSchemaFacetPtr
235xmlSchemaNewMinLengthFacet(int value)
236{
237 xmlSchemaFacetPtr ret;
238
239 ret = xmlSchemaNewFacet();
240 ret->type = XML_SCHEMA_FACET_MINLENGTH;
241 ret->val = xmlSchemaNewValue(XML_SCHEMAS_NNINTEGER);
242 ret->val->value.decimal.lo = value;
243 return (ret);
244}
245
Daniel Veillardc6e997c2003-01-27 12:35:42 +0000246/*
Daniel Veillard4255d502002-04-16 15:50:10 +0000247 * xmlSchemaInitBasicType:
248 * @name: the type name
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000249 * @type: the value type associated
Daniel Veillard4255d502002-04-16 15:50:10 +0000250 *
Daniel Veillard01fa6152004-06-29 17:04:39 +0000251 * Initialize one primitive built-in type
Daniel Veillard4255d502002-04-16 15:50:10 +0000252 */
253static xmlSchemaTypePtr
Daniel Veillard01fa6152004-06-29 17:04:39 +0000254xmlSchemaInitBasicType(const char *name, xmlSchemaValType type,
255 xmlSchemaTypePtr baseType) {
Daniel Veillard4255d502002-04-16 15:50:10 +0000256 xmlSchemaTypePtr ret;
257
258 ret = (xmlSchemaTypePtr) xmlMalloc(sizeof(xmlSchemaType));
259 if (ret == NULL) {
Daniel Veillardd0c9c322003-10-10 00:49:42 +0000260 xmlSchemaTypeErrMemory(NULL, "could not initialize basic types");
Daniel Veillard4255d502002-04-16 15:50:10 +0000261 return(NULL);
262 }
263 memset(ret, 0, sizeof(xmlSchemaType));
Daniel Veillardbe9c6322003-11-22 20:37:51 +0000264 ret->name = (const xmlChar *)name;
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000265 ret->targetNamespace = XML_SCHEMAS_NAMESPACE_NAME;
Daniel Veillard4255d502002-04-16 15:50:10 +0000266 ret->type = XML_SCHEMA_TYPE_BASIC;
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000267 ret->baseType = baseType;
Daniel Veillard4255d502002-04-16 15:50:10 +0000268 ret->contentType = XML_SCHEMA_CONTENT_BASIC;
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000269 /*
270 * Primitive types.
271 */
272 switch (type) {
Daniel Veillard01fa6152004-06-29 17:04:39 +0000273 case XML_SCHEMAS_STRING:
274 case XML_SCHEMAS_DECIMAL:
275 case XML_SCHEMAS_DATE:
276 case XML_SCHEMAS_DATETIME:
277 case XML_SCHEMAS_TIME:
278 case XML_SCHEMAS_GYEAR:
279 case XML_SCHEMAS_GYEARMONTH:
280 case XML_SCHEMAS_GMONTH:
281 case XML_SCHEMAS_GMONTHDAY:
282 case XML_SCHEMAS_GDAY:
283 case XML_SCHEMAS_DURATION:
284 case XML_SCHEMAS_FLOAT:
285 case XML_SCHEMAS_DOUBLE:
286 case XML_SCHEMAS_BOOLEAN:
287 case XML_SCHEMAS_ANYURI:
288 case XML_SCHEMAS_HEXBINARY:
289 case XML_SCHEMAS_BASE64BINARY:
290 case XML_SCHEMAS_QNAME:
291 case XML_SCHEMAS_NOTATION:
292 ret->flags |= XML_SCHEMAS_TYPE_BUILTIN_PRIMITIVE;
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000293 break;
William M. Brack96d2eff2004-06-30 11:48:47 +0000294 default:
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000295 break;
Daniel Veillard01fa6152004-06-29 17:04:39 +0000296 }
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000297 /*
298 * Set variety.
299 */
300 switch (type) {
301 case XML_SCHEMAS_ANYTYPE:
302 case XML_SCHEMAS_ANYSIMPLETYPE:
303 break;
304 case XML_SCHEMAS_IDREFS:
305 case XML_SCHEMAS_NMTOKENS:
306 case XML_SCHEMAS_ENTITIES:
307 ret->flags |= XML_SCHEMAS_TYPE_VARIETY_LIST;
308 ret->facets = xmlSchemaNewMinLengthFacet(1);
309 ret->flags |= XML_SCHEMAS_TYPE_HAS_FACETS;
310 break;
311 default:
312 ret->flags |= XML_SCHEMAS_TYPE_VARIETY_ATOMIC;
313 break;
314 }
Daniel Veillard4255d502002-04-16 15:50:10 +0000315 xmlHashAddEntry2(xmlSchemaTypesBank, ret->name,
316 XML_SCHEMAS_NAMESPACE_NAME, ret);
Daniel Veillard01fa6152004-06-29 17:04:39 +0000317 ret->builtInType = type;
Daniel Veillard4255d502002-04-16 15:50:10 +0000318 return(ret);
319}
320
321/*
Kasimier T. Buchcik11162b72005-07-28 00:50:22 +0000322* WARNING: Those type reside normally in xmlschemas.c but are
323* redefined here locally in oder of being able to use them for xs:anyType-
324* TODO: Remove those definition if we move the types to a header file.
325* TODO: Always keep those structs up-to-date with the originals.
326*/
327#define UNBOUNDED (1 << 30)
328
329typedef struct _xmlSchemaTreeItem xmlSchemaTreeItem;
330typedef xmlSchemaTreeItem *xmlSchemaTreeItemPtr;
331struct _xmlSchemaTreeItem {
332 xmlSchemaTypeType type;
333 xmlSchemaAnnotPtr annot;
334 xmlSchemaTreeItemPtr next;
335 xmlSchemaTreeItemPtr children;
336};
337
338typedef struct _xmlSchemaParticle xmlSchemaParticle;
339typedef xmlSchemaParticle *xmlSchemaParticlePtr;
340struct _xmlSchemaParticle {
341 xmlSchemaTypeType type;
342 xmlSchemaAnnotPtr annot;
343 xmlSchemaTreeItemPtr next;
344 xmlSchemaTreeItemPtr children;
345 int minOccurs;
346 int maxOccurs;
347 xmlNodePtr node;
348};
349
350typedef struct _xmlSchemaModelGroup xmlSchemaModelGroup;
351typedef xmlSchemaModelGroup *xmlSchemaModelGroupPtr;
352struct _xmlSchemaModelGroup {
353 xmlSchemaTypeType type;
354 xmlSchemaAnnotPtr annot;
355 xmlSchemaTreeItemPtr next;
356 xmlSchemaTreeItemPtr children;
357 xmlNodePtr node;
358};
359
360static xmlSchemaParticlePtr
361xmlSchemaAddParticle(void)
362{
363 xmlSchemaParticlePtr ret = NULL;
364
365 ret = (xmlSchemaParticlePtr)
366 xmlMalloc(sizeof(xmlSchemaParticle));
367 if (ret == NULL) {
368 xmlSchemaTypeErrMemory(NULL, "allocating particle component");
369 return (NULL);
370 }
371 memset(ret, 0, sizeof(xmlSchemaParticle));
372 ret->type = XML_SCHEMA_TYPE_PARTICLE;
373 ret->minOccurs = 1;
374 ret->maxOccurs = 1;
375 return (ret);
376}
377
378/*
Daniel Veillard4255d502002-04-16 15:50:10 +0000379 * xmlSchemaInitTypes:
380 *
381 * Initialize the default XML Schemas type library
382 */
383void
Daniel Veillard6560a422003-03-27 21:25:38 +0000384xmlSchemaInitTypes(void)
385{
Daniel Veillard4255d502002-04-16 15:50:10 +0000386 if (xmlSchemaTypesInitialized != 0)
Daniel Veillard6560a422003-03-27 21:25:38 +0000387 return;
Daniel Veillard4255d502002-04-16 15:50:10 +0000388 xmlSchemaTypesBank = xmlHashCreate(40);
Daniel Veillard6560a422003-03-27 21:25:38 +0000389
Daniel Veillard01fa6152004-06-29 17:04:39 +0000390
Daniel Veillardc6e997c2003-01-27 12:35:42 +0000391 /*
Daniel Veillard01fa6152004-06-29 17:04:39 +0000392 * 3.4.7 Built-in Complex Type Definition
393 */
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000394 xmlSchemaTypeAnyTypeDef = xmlSchemaInitBasicType("anyType",
William M. Brack2f2a6632004-08-20 23:09:47 +0000395 XML_SCHEMAS_ANYTYPE,
Daniel Veillard01fa6152004-06-29 17:04:39 +0000396 NULL);
397 xmlSchemaTypeAnyTypeDef->baseType = xmlSchemaTypeAnyTypeDef;
398 xmlSchemaTypeAnyTypeDef->contentType = XML_SCHEMA_CONTENT_MIXED;
Kasimier T. Buchcik11162b72005-07-28 00:50:22 +0000399 /*
400 * Init the content type.
401 */
402 xmlSchemaTypeAnyTypeDef->contentType = XML_SCHEMA_CONTENT_MIXED;
Daniel Veillard01fa6152004-06-29 17:04:39 +0000403 {
Kasimier T. Buchcik11162b72005-07-28 00:50:22 +0000404 xmlSchemaParticlePtr particle;
405 xmlSchemaModelGroupPtr sequence;
Daniel Veillard01fa6152004-06-29 17:04:39 +0000406 xmlSchemaWildcardPtr wild;
Kasimier T. Buchcik11162b72005-07-28 00:50:22 +0000407 /* First particle. */
408 particle = xmlSchemaAddParticle();
409 if (particle == NULL)
410 return;
411 xmlSchemaTypeAnyTypeDef->subtypes = (xmlSchemaTypePtr) particle;
412 /* Sequence model group. */
413 sequence = (xmlSchemaModelGroupPtr)
414 xmlMalloc(sizeof(xmlSchemaModelGroup));
415 if (sequence == NULL) {
416 xmlSchemaTypeErrMemory(NULL, "allocating model group component");
417 return;
418 }
419 memset(sequence, 0, sizeof(xmlSchemaModelGroup));
420 sequence->type = XML_SCHEMA_TYPE_SEQUENCE;
421 particle->children = (xmlSchemaTreeItemPtr) sequence;
422 /* Second particle. */
423 particle = xmlSchemaAddParticle();
424 if (particle == NULL)
425 return;
426 particle->minOccurs = 0;
427 particle->maxOccurs = UNBOUNDED;
428 sequence->children = (xmlSchemaTreeItemPtr) particle;
429 /* The wildcard */
Daniel Veillard01fa6152004-06-29 17:04:39 +0000430 wild = (xmlSchemaWildcardPtr) xmlMalloc(sizeof(xmlSchemaWildcard));
431 if (wild == NULL) {
Kasimier T. Buchcik11162b72005-07-28 00:50:22 +0000432 xmlSchemaTypeErrMemory(NULL, "allocating wildcard component");
433 return;
434 }
435 memset(wild, 0, sizeof(xmlSchemaWildcard));
436 wild->type = XML_SCHEMA_TYPE_ANY;
437 wild->any = 1;
438 wild->minOccurs = 1;
439 wild->maxOccurs = 1;
440 wild->processContents = XML_SCHEMAS_ANY_LAX;
441 particle->children = (xmlSchemaTreeItemPtr) wild;
442 /*
443 * Create the attribute wildcard.
444 */
445 wild = (xmlSchemaWildcardPtr) xmlMalloc(sizeof(xmlSchemaWildcard));
446 if (wild == NULL) {
447 xmlSchemaTypeErrMemory(NULL, "could not create an attribute "
448 "wildcard on anyType");
Daniel Veillard01fa6152004-06-29 17:04:39 +0000449 return;
450 }
451 memset(wild, 0, sizeof(xmlSchemaWildcard));
452 wild->any = 1;
453 wild->processContents = XML_SCHEMAS_ANY_LAX;
454 wild->minOccurs = 1;
455 wild->maxOccurs = 1;
456 xmlSchemaTypeAnyTypeDef->attributeWildcard = wild;
457 }
458 xmlSchemaTypeAnySimpleTypeDef = xmlSchemaInitBasicType("anySimpleType",
William M. Brack2f2a6632004-08-20 23:09:47 +0000459 XML_SCHEMAS_ANYSIMPLETYPE,
Daniel Veillard01fa6152004-06-29 17:04:39 +0000460 xmlSchemaTypeAnyTypeDef);
461 /*
462 * primitive datatypes
463 */
464 xmlSchemaTypeStringDef = xmlSchemaInitBasicType("string",
465 XML_SCHEMAS_STRING,
466 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000467 xmlSchemaTypeDecimalDef = xmlSchemaInitBasicType("decimal",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000468 XML_SCHEMAS_DECIMAL,
469 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000470 xmlSchemaTypeDateDef = xmlSchemaInitBasicType("date",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000471 XML_SCHEMAS_DATE,
472 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000473 xmlSchemaTypeDatetimeDef = xmlSchemaInitBasicType("dateTime",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000474 XML_SCHEMAS_DATETIME,
475 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000476 xmlSchemaTypeTimeDef = xmlSchemaInitBasicType("time",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000477 XML_SCHEMAS_TIME,
478 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000479 xmlSchemaTypeGYearDef = xmlSchemaInitBasicType("gYear",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000480 XML_SCHEMAS_GYEAR,
481 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000482 xmlSchemaTypeGYearMonthDef = xmlSchemaInitBasicType("gYearMonth",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000483 XML_SCHEMAS_GYEARMONTH,
484 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000485 xmlSchemaTypeGMonthDef = xmlSchemaInitBasicType("gMonth",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000486 XML_SCHEMAS_GMONTH,
487 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000488 xmlSchemaTypeGMonthDayDef = xmlSchemaInitBasicType("gMonthDay",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000489 XML_SCHEMAS_GMONTHDAY,
490 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000491 xmlSchemaTypeGDayDef = xmlSchemaInitBasicType("gDay",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000492 XML_SCHEMAS_GDAY,
493 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000494 xmlSchemaTypeDurationDef = xmlSchemaInitBasicType("duration",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000495 XML_SCHEMAS_DURATION,
496 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000497 xmlSchemaTypeFloatDef = xmlSchemaInitBasicType("float",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000498 XML_SCHEMAS_FLOAT,
499 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000500 xmlSchemaTypeDoubleDef = xmlSchemaInitBasicType("double",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000501 XML_SCHEMAS_DOUBLE,
502 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000503 xmlSchemaTypeBooleanDef = xmlSchemaInitBasicType("boolean",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000504 XML_SCHEMAS_BOOLEAN,
505 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000506 xmlSchemaTypeAnyURIDef = xmlSchemaInitBasicType("anyURI",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000507 XML_SCHEMAS_ANYURI,
508 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard560c2a42003-07-06 21:13:49 +0000509 xmlSchemaTypeHexBinaryDef = xmlSchemaInitBasicType("hexBinary",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000510 XML_SCHEMAS_HEXBINARY,
511 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard1ac24d32003-08-27 14:15:15 +0000512 xmlSchemaTypeBase64BinaryDef
Daniel Veillard01fa6152004-06-29 17:04:39 +0000513 = xmlSchemaInitBasicType("base64Binary", XML_SCHEMAS_BASE64BINARY,
514 xmlSchemaTypeAnySimpleTypeDef);
515 xmlSchemaTypeNotationDef = xmlSchemaInitBasicType("NOTATION",
516 XML_SCHEMAS_NOTATION,
517 xmlSchemaTypeAnySimpleTypeDef);
518 xmlSchemaTypeQNameDef = xmlSchemaInitBasicType("QName",
519 XML_SCHEMAS_QNAME,
520 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard4255d502002-04-16 15:50:10 +0000521
Daniel Veillardc6e997c2003-01-27 12:35:42 +0000522 /*
523 * derived datatypes
524 */
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000525 xmlSchemaTypeIntegerDef = xmlSchemaInitBasicType("integer",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000526 XML_SCHEMAS_INTEGER,
527 xmlSchemaTypeDecimalDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000528 xmlSchemaTypeNonPositiveIntegerDef =
529 xmlSchemaInitBasicType("nonPositiveInteger",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000530 XML_SCHEMAS_NPINTEGER,
531 xmlSchemaTypeIntegerDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000532 xmlSchemaTypeNegativeIntegerDef =
Daniel Veillard01fa6152004-06-29 17:04:39 +0000533 xmlSchemaInitBasicType("negativeInteger", XML_SCHEMAS_NINTEGER,
534 xmlSchemaTypeNonPositiveIntegerDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000535 xmlSchemaTypeLongDef =
Daniel Veillard01fa6152004-06-29 17:04:39 +0000536 xmlSchemaInitBasicType("long", XML_SCHEMAS_LONG,
537 xmlSchemaTypeIntegerDef);
538 xmlSchemaTypeIntDef = xmlSchemaInitBasicType("int", XML_SCHEMAS_INT,
539 xmlSchemaTypeLongDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000540 xmlSchemaTypeShortDef = xmlSchemaInitBasicType("short",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000541 XML_SCHEMAS_SHORT,
542 xmlSchemaTypeIntDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000543 xmlSchemaTypeByteDef = xmlSchemaInitBasicType("byte",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000544 XML_SCHEMAS_BYTE,
545 xmlSchemaTypeShortDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000546 xmlSchemaTypeNonNegativeIntegerDef =
547 xmlSchemaInitBasicType("nonNegativeInteger",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000548 XML_SCHEMAS_NNINTEGER,
549 xmlSchemaTypeIntegerDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000550 xmlSchemaTypeUnsignedLongDef =
Daniel Veillard01fa6152004-06-29 17:04:39 +0000551 xmlSchemaInitBasicType("unsignedLong", XML_SCHEMAS_ULONG,
552 xmlSchemaTypeNonNegativeIntegerDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000553 xmlSchemaTypeUnsignedIntDef =
Daniel Veillard01fa6152004-06-29 17:04:39 +0000554 xmlSchemaInitBasicType("unsignedInt", XML_SCHEMAS_UINT,
555 xmlSchemaTypeUnsignedLongDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000556 xmlSchemaTypeUnsignedShortDef =
Daniel Veillard01fa6152004-06-29 17:04:39 +0000557 xmlSchemaInitBasicType("unsignedShort", XML_SCHEMAS_USHORT,
558 xmlSchemaTypeUnsignedIntDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000559 xmlSchemaTypeUnsignedByteDef =
Daniel Veillard01fa6152004-06-29 17:04:39 +0000560 xmlSchemaInitBasicType("unsignedByte", XML_SCHEMAS_UBYTE,
561 xmlSchemaTypeUnsignedShortDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000562 xmlSchemaTypePositiveIntegerDef =
Daniel Veillard01fa6152004-06-29 17:04:39 +0000563 xmlSchemaInitBasicType("positiveInteger", XML_SCHEMAS_PINTEGER,
564 xmlSchemaTypeNonNegativeIntegerDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000565 xmlSchemaTypeNormStringDef = xmlSchemaInitBasicType("normalizedString",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000566 XML_SCHEMAS_NORMSTRING,
567 xmlSchemaTypeStringDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000568 xmlSchemaTypeTokenDef = xmlSchemaInitBasicType("token",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000569 XML_SCHEMAS_TOKEN,
570 xmlSchemaTypeNormStringDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000571 xmlSchemaTypeLanguageDef = xmlSchemaInitBasicType("language",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000572 XML_SCHEMAS_LANGUAGE,
573 xmlSchemaTypeTokenDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000574 xmlSchemaTypeNameDef = xmlSchemaInitBasicType("Name",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000575 XML_SCHEMAS_NAME,
576 xmlSchemaTypeTokenDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000577 xmlSchemaTypeNmtokenDef = xmlSchemaInitBasicType("NMTOKEN",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000578 XML_SCHEMAS_NMTOKEN,
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000579 xmlSchemaTypeTokenDef);
Daniel Veillard01fa6152004-06-29 17:04:39 +0000580 xmlSchemaTypeNCNameDef = xmlSchemaInitBasicType("NCName",
581 XML_SCHEMAS_NCNAME,
582 xmlSchemaTypeNameDef);
583 xmlSchemaTypeIdDef = xmlSchemaInitBasicType("ID", XML_SCHEMAS_ID,
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000584 xmlSchemaTypeNCNameDef);
Daniel Veillard01fa6152004-06-29 17:04:39 +0000585 xmlSchemaTypeIdrefDef = xmlSchemaInitBasicType("IDREF",
586 XML_SCHEMAS_IDREF,
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000587 xmlSchemaTypeNCNameDef);
Daniel Veillard01fa6152004-06-29 17:04:39 +0000588 xmlSchemaTypeEntityDef = xmlSchemaInitBasicType("ENTITY",
589 XML_SCHEMAS_ENTITY,
590 xmlSchemaTypeNCNameDef);
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000591 /*
592 * Derived list types.
593 */
594 /* ENTITIES */
Daniel Veillard01fa6152004-06-29 17:04:39 +0000595 xmlSchemaTypeEntitiesDef = xmlSchemaInitBasicType("ENTITIES",
596 XML_SCHEMAS_ENTITIES,
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000597 xmlSchemaTypeAnySimpleTypeDef);
598 xmlSchemaTypeEntitiesDef->subtypes = xmlSchemaTypeEntityDef;
599 /* IDREFS */
600 xmlSchemaTypeIdrefsDef = xmlSchemaInitBasicType("IDREFS",
601 XML_SCHEMAS_IDREFS,
602 xmlSchemaTypeAnySimpleTypeDef);
603 xmlSchemaTypeIdrefsDef->subtypes = xmlSchemaTypeIdrefDef;
604
605 /* NMTOKENS */
606 xmlSchemaTypeNmtokensDef = xmlSchemaInitBasicType("NMTOKENS",
607 XML_SCHEMAS_NMTOKENS,
608 xmlSchemaTypeAnySimpleTypeDef);
609 xmlSchemaTypeNmtokensDef->subtypes = xmlSchemaTypeNmtokenDef;
610
Daniel Veillard4255d502002-04-16 15:50:10 +0000611 xmlSchemaTypesInitialized = 1;
612}
613
614/**
615 * xmlSchemaCleanupTypes:
616 *
617 * Cleanup the default XML Schemas type library
618 */
619void
620xmlSchemaCleanupTypes(void) {
621 if (xmlSchemaTypesInitialized == 0)
622 return;
Kasimier T. Buchcik11162b72005-07-28 00:50:22 +0000623 /*
624 * Free xs:anyType.
625 */
626 {
627 xmlSchemaParticlePtr particle;
628 /* Attribute wildcard. */
629 xmlSchemaFreeWildcard(xmlSchemaTypeAnyTypeDef->attributeWildcard);
630 /* Content type. */
631 particle = (xmlSchemaParticlePtr) xmlSchemaTypeAnyTypeDef->subtypes;
632 /* Wildcard. */
633 xmlSchemaFreeWildcard((xmlSchemaWildcardPtr)
634 particle->children->children->children);
635 xmlFree((xmlSchemaParticlePtr) particle->children->children);
636 /* Sequence model group. */
637 xmlFree((xmlSchemaModelGroupPtr) particle->children);
638 xmlFree((xmlSchemaParticlePtr) particle);
639 xmlSchemaTypeAnyTypeDef->subtypes = NULL;
640 }
Daniel Veillard4255d502002-04-16 15:50:10 +0000641 xmlHashFree(xmlSchemaTypesBank, (xmlHashDeallocator) xmlSchemaFreeType);
642 xmlSchemaTypesInitialized = 0;
643}
644
645/**
Daniel Veillard6927b102004-10-27 17:29:04 +0000646 * xmlSchemaIsBuiltInTypeFacet:
Daniel Veillard01fa6152004-06-29 17:04:39 +0000647 * @type: the built-in type
648 * @facetType: the facet type
649 *
650 * Evaluates if a specific facet can be
651 * used in conjunction with a type.
652 *
653 * Returns 1 if the facet can be used with the given built-in type,
654 * 0 otherwise and -1 in case the type is not a built-in type.
655 */
656int
657xmlSchemaIsBuiltInTypeFacet(xmlSchemaTypePtr type, int facetType)
658{
Daniel Veillardce682bc2004-11-05 17:22:25 +0000659 if (type == NULL)
660 return (-1);
Daniel Veillard01fa6152004-06-29 17:04:39 +0000661 if (type->type != XML_SCHEMA_TYPE_BASIC)
662 return (-1);
663 switch (type->builtInType) {
664 case XML_SCHEMAS_BOOLEAN:
665 if ((facetType == XML_SCHEMA_FACET_PATTERN) ||
666 (facetType == XML_SCHEMA_FACET_WHITESPACE))
667 return (1);
668 else
669 return (0);
670 case XML_SCHEMAS_STRING:
671 case XML_SCHEMAS_NOTATION:
672 case XML_SCHEMAS_QNAME:
673 case XML_SCHEMAS_ANYURI:
674 case XML_SCHEMAS_BASE64BINARY:
675 case XML_SCHEMAS_HEXBINARY:
676 if ((facetType == XML_SCHEMA_FACET_LENGTH) ||
677 (facetType == XML_SCHEMA_FACET_MINLENGTH) ||
678 (facetType == XML_SCHEMA_FACET_MAXLENGTH) ||
679 (facetType == XML_SCHEMA_FACET_PATTERN) ||
680 (facetType == XML_SCHEMA_FACET_ENUMERATION) ||
681 (facetType == XML_SCHEMA_FACET_WHITESPACE))
682 return (1);
683 else
684 return (0);
685 case XML_SCHEMAS_DECIMAL:
686 if ((facetType == XML_SCHEMA_FACET_TOTALDIGITS) ||
687 (facetType == XML_SCHEMA_FACET_FRACTIONDIGITS) ||
688 (facetType == XML_SCHEMA_FACET_PATTERN) ||
689 (facetType == XML_SCHEMA_FACET_WHITESPACE) ||
690 (facetType == XML_SCHEMA_FACET_ENUMERATION) ||
691 (facetType == XML_SCHEMA_FACET_MAXINCLUSIVE) ||
692 (facetType == XML_SCHEMA_FACET_MAXEXCLUSIVE) ||
693 (facetType == XML_SCHEMA_FACET_MININCLUSIVE) ||
694 (facetType == XML_SCHEMA_FACET_MINEXCLUSIVE))
695 return (1);
696 else
697 return (0);
698 case XML_SCHEMAS_TIME:
699 case XML_SCHEMAS_GDAY:
700 case XML_SCHEMAS_GMONTH:
701 case XML_SCHEMAS_GMONTHDAY:
702 case XML_SCHEMAS_GYEAR:
703 case XML_SCHEMAS_GYEARMONTH:
704 case XML_SCHEMAS_DATE:
705 case XML_SCHEMAS_DATETIME:
706 case XML_SCHEMAS_DURATION:
707 case XML_SCHEMAS_FLOAT:
708 case XML_SCHEMAS_DOUBLE:
709 if ((facetType == XML_SCHEMA_FACET_PATTERN) ||
710 (facetType == XML_SCHEMA_FACET_ENUMERATION) ||
711 (facetType == XML_SCHEMA_FACET_WHITESPACE) ||
712 (facetType == XML_SCHEMA_FACET_MAXINCLUSIVE) ||
713 (facetType == XML_SCHEMA_FACET_MAXEXCLUSIVE) ||
714 (facetType == XML_SCHEMA_FACET_MININCLUSIVE) ||
715 (facetType == XML_SCHEMA_FACET_MINEXCLUSIVE))
716 return (1);
717 else
718 return (0);
719 default:
Daniel Veillardc7e3cc42004-09-28 12:33:52 +0000720 break;
Daniel Veillard01fa6152004-06-29 17:04:39 +0000721 }
722 return (0);
723}
724
725/**
726 * xmlSchemaGetBuiltInType:
727 * @type: the type of the built in type
728 *
729 * Gives you the type struct for a built-in
730 * type by its type id.
731 *
732 * Returns the type if found, NULL otherwise.
733 */
734xmlSchemaTypePtr
735xmlSchemaGetBuiltInType(xmlSchemaValType type)
736{
737 if (xmlSchemaTypesInitialized == 0)
738 xmlSchemaInitTypes();
739 switch (type) {
740
741 case XML_SCHEMAS_ANYSIMPLETYPE:
742 return (xmlSchemaTypeAnySimpleTypeDef);
743 case XML_SCHEMAS_STRING:
744 return (xmlSchemaTypeStringDef);
745 case XML_SCHEMAS_NORMSTRING:
746 return (xmlSchemaTypeNormStringDef);
747 case XML_SCHEMAS_DECIMAL:
748 return (xmlSchemaTypeDecimalDef);
749 case XML_SCHEMAS_TIME:
750 return (xmlSchemaTypeTimeDef);
751 case XML_SCHEMAS_GDAY:
752 return (xmlSchemaTypeGDayDef);
753 case XML_SCHEMAS_GMONTH:
754 return (xmlSchemaTypeGMonthDef);
755 case XML_SCHEMAS_GMONTHDAY:
756 return (xmlSchemaTypeGMonthDayDef);
757 case XML_SCHEMAS_GYEAR:
758 return (xmlSchemaTypeGYearDef);
759 case XML_SCHEMAS_GYEARMONTH:
760 return (xmlSchemaTypeGYearMonthDef);
761 case XML_SCHEMAS_DATE:
762 return (xmlSchemaTypeDateDef);
763 case XML_SCHEMAS_DATETIME:
764 return (xmlSchemaTypeDatetimeDef);
765 case XML_SCHEMAS_DURATION:
766 return (xmlSchemaTypeDurationDef);
767 case XML_SCHEMAS_FLOAT:
768 return (xmlSchemaTypeFloatDef);
769 case XML_SCHEMAS_DOUBLE:
770 return (xmlSchemaTypeDoubleDef);
771 case XML_SCHEMAS_BOOLEAN:
772 return (xmlSchemaTypeBooleanDef);
773 case XML_SCHEMAS_TOKEN:
774 return (xmlSchemaTypeTokenDef);
775 case XML_SCHEMAS_LANGUAGE:
776 return (xmlSchemaTypeLanguageDef);
777 case XML_SCHEMAS_NMTOKEN:
778 return (xmlSchemaTypeNmtokenDef);
779 case XML_SCHEMAS_NMTOKENS:
780 return (xmlSchemaTypeNmtokensDef);
781 case XML_SCHEMAS_NAME:
782 return (xmlSchemaTypeNameDef);
783 case XML_SCHEMAS_QNAME:
784 return (xmlSchemaTypeQNameDef);
785 case XML_SCHEMAS_NCNAME:
786 return (xmlSchemaTypeNCNameDef);
787 case XML_SCHEMAS_ID:
788 return (xmlSchemaTypeIdDef);
789 case XML_SCHEMAS_IDREF:
790 return (xmlSchemaTypeIdrefDef);
791 case XML_SCHEMAS_IDREFS:
792 return (xmlSchemaTypeIdrefsDef);
793 case XML_SCHEMAS_ENTITY:
794 return (xmlSchemaTypeEntityDef);
795 case XML_SCHEMAS_ENTITIES:
796 return (xmlSchemaTypeEntitiesDef);
797 case XML_SCHEMAS_NOTATION:
798 return (xmlSchemaTypeNotationDef);
799 case XML_SCHEMAS_ANYURI:
800 return (xmlSchemaTypeAnyURIDef);
801 case XML_SCHEMAS_INTEGER:
802 return (xmlSchemaTypeIntegerDef);
803 case XML_SCHEMAS_NPINTEGER:
804 return (xmlSchemaTypeNonPositiveIntegerDef);
805 case XML_SCHEMAS_NINTEGER:
806 return (xmlSchemaTypeNegativeIntegerDef);
807 case XML_SCHEMAS_NNINTEGER:
808 return (xmlSchemaTypeNonNegativeIntegerDef);
809 case XML_SCHEMAS_PINTEGER:
810 return (xmlSchemaTypePositiveIntegerDef);
811 case XML_SCHEMAS_INT:
812 return (xmlSchemaTypeIntDef);
813 case XML_SCHEMAS_UINT:
814 return (xmlSchemaTypeUnsignedIntDef);
815 case XML_SCHEMAS_LONG:
816 return (xmlSchemaTypeLongDef);
817 case XML_SCHEMAS_ULONG:
818 return (xmlSchemaTypeUnsignedLongDef);
819 case XML_SCHEMAS_SHORT:
820 return (xmlSchemaTypeShortDef);
821 case XML_SCHEMAS_USHORT:
822 return (xmlSchemaTypeUnsignedShortDef);
823 case XML_SCHEMAS_BYTE:
824 return (xmlSchemaTypeByteDef);
825 case XML_SCHEMAS_UBYTE:
826 return (xmlSchemaTypeUnsignedByteDef);
827 case XML_SCHEMAS_HEXBINARY:
828 return (xmlSchemaTypeHexBinaryDef);
829 case XML_SCHEMAS_BASE64BINARY:
830 return (xmlSchemaTypeBase64BinaryDef);
831 case XML_SCHEMAS_ANYTYPE:
832 return (xmlSchemaTypeAnyTypeDef);
833 default:
834 return (NULL);
835 }
836}
837
Kasimier T. Buchcik7f6e0242005-06-15 13:36:10 +0000838/**
839 * xmlSchemaValueAppend:
840 * @prev: the value
841 * @cur: the value to be appended
842 *
843 * Appends a next sibling to a list of computed values.
844 *
845 * Returns 0 if succeeded and -1 on API errors.
846 */
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000847int
848xmlSchemaValueAppend(xmlSchemaValPtr prev, xmlSchemaValPtr cur) {
Daniel Veillard4255d502002-04-16 15:50:10 +0000849
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000850 if ((prev == NULL) || (cur == NULL))
851 return (-1);
852 prev->next = cur;
853 return (0);
854}
855
Kasimier T. Buchcik7f6e0242005-06-15 13:36:10 +0000856/**
857 * xmlSchemaValueGetNext:
858 * @cur: the value
859 *
860 * Accessor for the next sibling of a list of computed values.
861 *
862 * Returns the next value or NULL if there was none, or on
863 * API errors.
864 */
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000865xmlSchemaValPtr
866xmlSchemaValueGetNext(xmlSchemaValPtr cur) {
867
868 if (cur == NULL)
869 return (NULL);
870 return (cur->next);
871}
872
Kasimier T. Buchcik7f6e0242005-06-15 13:36:10 +0000873/**
874 * xmlSchemaValueGetAsString:
875 * @val: the value
876 *
877 * Accessor for the string value of a computed value.
878 *
879 * Returns the string value or NULL if there was none, or on
880 * API errors.
881 */
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000882const xmlChar *
883xmlSchemaValueGetAsString(xmlSchemaValPtr val)
884{
885 if (val == NULL)
886 return (NULL);
887 switch (val->type) {
888 case XML_SCHEMAS_STRING:
889 case XML_SCHEMAS_NORMSTRING:
890 case XML_SCHEMAS_ANYSIMPLETYPE:
891 case XML_SCHEMAS_TOKEN:
892 case XML_SCHEMAS_LANGUAGE:
893 case XML_SCHEMAS_NMTOKEN:
894 case XML_SCHEMAS_NAME:
895 case XML_SCHEMAS_NCNAME:
896 case XML_SCHEMAS_ID:
897 case XML_SCHEMAS_IDREF:
898 case XML_SCHEMAS_ENTITY:
899 case XML_SCHEMAS_ANYURI:
900 return (BAD_CAST val->value.str);
901 default:
902 break;
Daniel Veillard4255d502002-04-16 15:50:10 +0000903 }
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000904 return (NULL);
905}
906
Kasimier T. Buchcik7f6e0242005-06-15 13:36:10 +0000907/**
908 * xmlSchemaValueGetAsBoolean:
909 * @val: the value
910 *
911 * Accessor for the boolean value of a computed value.
912 *
913 * Returns 1 if true and 0 if false, or in case of an error. Hmm.
914 */
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000915int
916xmlSchemaValueGetAsBoolean(xmlSchemaValPtr val)
917{
918 if ((val == NULL) || (val->type != XML_SCHEMAS_BOOLEAN))
919 return (0);
920 return (val->value.b);
Daniel Veillard4255d502002-04-16 15:50:10 +0000921}
922
923/**
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +0000924 * xmlSchemaNewStringValue:
925 * @type: the value type
Daniel Veillardb5839c32005-02-19 18:27:14 +0000926 * @value: the value
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +0000927 *
928 * Allocate a new simple type value. The type can be
Kasimier T. Buchcik2ee855d2005-03-07 11:14:14 +0000929 * of XML_SCHEMAS_STRING.
930 * WARNING: This one is intended to be expanded for other
931 * string based types. We need this for anySimpleType as well.
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000932 * The given value is consumed and freed with the struct.
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +0000933 *
934 * Returns a pointer to the new value or NULL in case of error
935 */
936xmlSchemaValPtr
937xmlSchemaNewStringValue(xmlSchemaValType type,
938 const xmlChar *value)
939{
940 xmlSchemaValPtr val;
941
942 if (type != XML_SCHEMAS_STRING)
943 return(NULL);
944 val = (xmlSchemaValPtr) xmlMalloc(sizeof(xmlSchemaVal));
945 if (val == NULL) {
946 return(NULL);
947 }
948 memset(val, 0, sizeof(xmlSchemaVal));
949 val->type = type;
950 val->value.str = (xmlChar *) value;
951 return(val);
952}
953
Kasimier T. Buchcikb06b4de2005-02-17 19:00:23 +0000954/**
955 * xmlSchemaNewNOTATIONValue:
Daniel Veillardb5839c32005-02-19 18:27:14 +0000956 * @name: the notation name
957 * @ns: the notation namespace name or NULL
Kasimier T. Buchcikb06b4de2005-02-17 19:00:23 +0000958 *
959 * Allocate a new NOTATION value.
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000960 * The given values are consumed and freed with the struct.
Kasimier T. Buchcikb06b4de2005-02-17 19:00:23 +0000961 *
962 * Returns a pointer to the new value or NULL in case of error
963 */
964xmlSchemaValPtr
965xmlSchemaNewNOTATIONValue(const xmlChar *name,
966 const xmlChar *ns)
967{
968 xmlSchemaValPtr val;
969
970 val = xmlSchemaNewValue(XML_SCHEMAS_NOTATION);
971 if (val == NULL)
972 return (NULL);
973
William M. Brack12d37ab2005-02-21 13:54:07 +0000974 val->value.qname.name = (xmlChar *)name;
Kasimier T. Buchcikb06b4de2005-02-17 19:00:23 +0000975 if (ns != NULL)
William M. Brack12d37ab2005-02-21 13:54:07 +0000976 val->value.qname.uri = (xmlChar *)ns;
Kasimier T. Buchcikb06b4de2005-02-17 19:00:23 +0000977 return(val);
978}
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +0000979
980/**
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000981 * xmlSchemaNewQNameValue:
982 * @namespaceName: the namespace name
983 * @localName: the local name
984 *
985 * Allocate a new QName value.
986 * The given values are consumed and freed with the struct.
987 *
988 * Returns a pointer to the new value or NULL in case of an error.
989 */
990xmlSchemaValPtr
991xmlSchemaNewQNameValue(const xmlChar *namespaceName,
992 const xmlChar *localName)
993{
994 xmlSchemaValPtr val;
995
996 val = xmlSchemaNewValue(XML_SCHEMAS_QNAME);
997 if (val == NULL)
998 return (NULL);
999
1000 val->value.qname.name = (xmlChar *) localName;
1001 val->value.qname.uri = (xmlChar *) namespaceName;
1002 return(val);
1003}
1004
1005/**
Daniel Veillard4255d502002-04-16 15:50:10 +00001006 * xmlSchemaFreeValue:
1007 * @value: the value to free
1008 *
1009 * Cleanup the default XML Schemas type library
1010 */
1011void
1012xmlSchemaFreeValue(xmlSchemaValPtr value) {
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00001013 xmlSchemaValPtr prev;
1014
1015 while (value != NULL) {
1016 switch (value->type) {
1017 case XML_SCHEMAS_STRING:
1018 case XML_SCHEMAS_NORMSTRING:
1019 case XML_SCHEMAS_TOKEN:
1020 case XML_SCHEMAS_LANGUAGE:
1021 case XML_SCHEMAS_NMTOKEN:
1022 case XML_SCHEMAS_NMTOKENS:
1023 case XML_SCHEMAS_NAME:
1024 case XML_SCHEMAS_NCNAME:
1025 case XML_SCHEMAS_ID:
1026 case XML_SCHEMAS_IDREF:
1027 case XML_SCHEMAS_IDREFS:
1028 case XML_SCHEMAS_ENTITY:
1029 case XML_SCHEMAS_ENTITIES:
1030 case XML_SCHEMAS_ANYURI:
1031 case XML_SCHEMAS_ANYSIMPLETYPE:
1032 if (value->value.str != NULL)
1033 xmlFree(value->value.str);
1034 break;
1035 case XML_SCHEMAS_NOTATION:
1036 case XML_SCHEMAS_QNAME:
1037 if (value->value.qname.uri != NULL)
1038 xmlFree(value->value.qname.uri);
1039 if (value->value.qname.name != NULL)
1040 xmlFree(value->value.qname.name);
1041 break;
1042 case XML_SCHEMAS_HEXBINARY:
1043 if (value->value.hex.str != NULL)
1044 xmlFree(value->value.hex.str);
1045 break;
1046 case XML_SCHEMAS_BASE64BINARY:
1047 if (value->value.base64.str != NULL)
1048 xmlFree(value->value.base64.str);
1049 break;
1050 default:
1051 break;
1052 }
1053 prev = value;
1054 value = value->next;
1055 xmlFree(prev);
1056 }
Daniel Veillard4255d502002-04-16 15:50:10 +00001057}
1058
1059/**
1060 * xmlSchemaGetPredefinedType:
1061 * @name: the type name
1062 * @ns: the URI of the namespace usually "http://www.w3.org/2001/XMLSchema"
1063 *
1064 * Lookup a type in the default XML Schemas type library
1065 *
1066 * Returns the type if found, NULL otherwise
1067 */
1068xmlSchemaTypePtr
1069xmlSchemaGetPredefinedType(const xmlChar *name, const xmlChar *ns) {
1070 if (xmlSchemaTypesInitialized == 0)
1071 xmlSchemaInitTypes();
1072 if (name == NULL)
1073 return(NULL);
1074 return((xmlSchemaTypePtr) xmlHashLookup2(xmlSchemaTypesBank, name, ns));
1075}
Daniel Veillard070803b2002-05-03 07:29:38 +00001076
Daniel Veillard01fa6152004-06-29 17:04:39 +00001077/**
1078 * xmlSchemaGetBuiltInListSimpleTypeItemType:
1079 * @type: the built-in simple type.
1080 *
Daniel Veillard6927b102004-10-27 17:29:04 +00001081 * Lookup function
1082 *
Daniel Veillardc0826a72004-08-10 14:17:33 +00001083 * Returns the item type of @type as defined by the built-in datatype
1084 * hierarchy of XML Schema Part 2: Datatypes, or NULL in case of an error.
Daniel Veillard01fa6152004-06-29 17:04:39 +00001085 */
1086xmlSchemaTypePtr
1087xmlSchemaGetBuiltInListSimpleTypeItemType(xmlSchemaTypePtr type)
1088{
Daniel Veillard42595322004-11-08 10:52:06 +00001089 if ((type == NULL) || (type->type != XML_SCHEMA_TYPE_BASIC))
Daniel Veillard01fa6152004-06-29 17:04:39 +00001090 return (NULL);
1091 switch (type->builtInType) {
1092 case XML_SCHEMAS_NMTOKENS:
1093 return (xmlSchemaTypeNmtokenDef );
1094 case XML_SCHEMAS_IDREFS:
1095 return (xmlSchemaTypeIdrefDef);
1096 case XML_SCHEMAS_ENTITIES:
1097 return (xmlSchemaTypeEntityDef);
1098 default:
1099 return (NULL);
1100 }
1101}
1102
Daniel Veillard070803b2002-05-03 07:29:38 +00001103/****************************************************************
1104 * *
1105 * Convenience macros and functions *
1106 * *
1107 ****************************************************************/
1108
1109#define IS_TZO_CHAR(c) \
1110 ((c == 0) || (c == 'Z') || (c == '+') || (c == '-'))
1111
1112#define VALID_YEAR(yr) (yr != 0)
1113#define VALID_MONTH(mon) ((mon >= 1) && (mon <= 12))
1114/* VALID_DAY should only be used when month is unknown */
1115#define VALID_DAY(day) ((day >= 1) && (day <= 31))
1116#define VALID_HOUR(hr) ((hr >= 0) && (hr <= 23))
1117#define VALID_MIN(min) ((min >= 0) && (min <= 59))
1118#define VALID_SEC(sec) ((sec >= 0) && (sec < 60))
Kasimier T. Buchcik690a6802005-05-12 13:16:01 +00001119#define VALID_TZO(tzo) ((tzo > -840) && (tzo < 840))
Daniel Veillard070803b2002-05-03 07:29:38 +00001120#define IS_LEAP(y) \
1121 (((y % 4 == 0) && (y % 100 != 0)) || (y % 400 == 0))
1122
Daniel Veillardebe25d42004-03-25 09:35:49 +00001123static const unsigned int daysInMonth[12] =
Daniel Veillard070803b2002-05-03 07:29:38 +00001124 { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
Daniel Veillardebe25d42004-03-25 09:35:49 +00001125static const unsigned int daysInMonthLeap[12] =
Daniel Veillard070803b2002-05-03 07:29:38 +00001126 { 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
1127
Daniel Veillard5a872412002-05-22 06:40:27 +00001128#define MAX_DAYINMONTH(yr,mon) \
1129 (IS_LEAP(yr) ? daysInMonthLeap[mon - 1] : daysInMonth[mon - 1])
1130
Daniel Veillard070803b2002-05-03 07:29:38 +00001131#define VALID_MDAY(dt) \
1132 (IS_LEAP(dt->year) ? \
1133 (dt->day <= daysInMonthLeap[dt->mon - 1]) : \
1134 (dt->day <= daysInMonth[dt->mon - 1]))
1135
1136#define VALID_DATE(dt) \
1137 (VALID_YEAR(dt->year) && VALID_MONTH(dt->mon) && VALID_MDAY(dt))
1138
1139#define VALID_TIME(dt) \
1140 (VALID_HOUR(dt->hour) && VALID_MIN(dt->min) && \
1141 VALID_SEC(dt->sec) && VALID_TZO(dt->tzo))
1142
1143#define VALID_DATETIME(dt) \
1144 (VALID_DATE(dt) && VALID_TIME(dt))
1145
1146#define SECS_PER_MIN (60)
1147#define SECS_PER_HOUR (60 * SECS_PER_MIN)
1148#define SECS_PER_DAY (24 * SECS_PER_HOUR)
1149
Daniel Veillard5a872412002-05-22 06:40:27 +00001150static const long dayInYearByMonth[12] =
1151 { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334 };
1152static const long dayInLeapYearByMonth[12] =
1153 { 0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335 };
1154
1155#define DAY_IN_YEAR(day, month, year) \
1156 ((IS_LEAP(year) ? \
1157 dayInLeapYearByMonth[month - 1] : \
1158 dayInYearByMonth[month - 1]) + day)
1159
1160#ifdef DEBUG
1161#define DEBUG_DATE(dt) \
1162 xmlGenericError(xmlGenericErrorContext, \
1163 "type=%o %04ld-%02u-%02uT%02u:%02u:%03f", \
1164 dt->type,dt->value.date.year,dt->value.date.mon, \
1165 dt->value.date.day,dt->value.date.hour,dt->value.date.min, \
1166 dt->value.date.sec); \
1167 if (dt->value.date.tz_flag) \
1168 if (dt->value.date.tzo != 0) \
1169 xmlGenericError(xmlGenericErrorContext, \
1170 "%+05d\n",dt->value.date.tzo); \
1171 else \
1172 xmlGenericError(xmlGenericErrorContext, "Z\n"); \
1173 else \
1174 xmlGenericError(xmlGenericErrorContext,"\n")
1175#else
1176#define DEBUG_DATE(dt)
1177#endif
1178
Daniel Veillard070803b2002-05-03 07:29:38 +00001179/**
1180 * _xmlSchemaParseGYear:
1181 * @dt: pointer to a date structure
1182 * @str: pointer to the string to analyze
1183 *
1184 * Parses a xs:gYear without time zone and fills in the appropriate
1185 * field of the @dt structure. @str is updated to point just after the
1186 * xs:gYear. It is supposed that @dt->year is big enough to contain
1187 * the year.
1188 *
1189 * Returns 0 or the error code
1190 */
1191static int
1192_xmlSchemaParseGYear (xmlSchemaValDatePtr dt, const xmlChar **str) {
1193 const xmlChar *cur = *str, *firstChar;
1194 int isneg = 0, digcnt = 0;
1195
1196 if (((*cur < '0') || (*cur > '9')) &&
1197 (*cur != '-') && (*cur != '+'))
1198 return -1;
1199
1200 if (*cur == '-') {
1201 isneg = 1;
1202 cur++;
1203 }
1204
1205 firstChar = cur;
1206
1207 while ((*cur >= '0') && (*cur <= '9')) {
1208 dt->year = dt->year * 10 + (*cur - '0');
1209 cur++;
1210 digcnt++;
1211 }
1212
1213 /* year must be at least 4 digits (CCYY); over 4
1214 * digits cannot have a leading zero. */
1215 if ((digcnt < 4) || ((digcnt > 4) && (*firstChar == '0')))
1216 return 1;
1217
1218 if (isneg)
1219 dt->year = - dt->year;
1220
1221 if (!VALID_YEAR(dt->year))
1222 return 2;
1223
1224 *str = cur;
1225 return 0;
1226}
1227
1228/**
1229 * PARSE_2_DIGITS:
1230 * @num: the integer to fill in
1231 * @cur: an #xmlChar *
1232 * @invalid: an integer
1233 *
1234 * Parses a 2-digits integer and updates @num with the value. @cur is
1235 * updated to point just after the integer.
1236 * In case of error, @invalid is set to %TRUE, values of @num and
1237 * @cur are undefined.
1238 */
1239#define PARSE_2_DIGITS(num, cur, invalid) \
1240 if ((cur[0] < '0') || (cur[0] > '9') || \
1241 (cur[1] < '0') || (cur[1] > '9')) \
1242 invalid = 1; \
1243 else \
1244 num = (cur[0] - '0') * 10 + (cur[1] - '0'); \
1245 cur += 2;
1246
1247/**
1248 * PARSE_FLOAT:
1249 * @num: the double to fill in
1250 * @cur: an #xmlChar *
1251 * @invalid: an integer
1252 *
1253 * Parses a float and updates @num with the value. @cur is
1254 * updated to point just after the float. The float must have a
1255 * 2-digits integer part and may or may not have a decimal part.
1256 * In case of error, @invalid is set to %TRUE, values of @num and
1257 * @cur are undefined.
1258 */
1259#define PARSE_FLOAT(num, cur, invalid) \
1260 PARSE_2_DIGITS(num, cur, invalid); \
1261 if (!invalid && (*cur == '.')) { \
1262 double mult = 1; \
1263 cur++; \
1264 if ((*cur < '0') || (*cur > '9')) \
1265 invalid = 1; \
1266 while ((*cur >= '0') && (*cur <= '9')) { \
1267 mult /= 10; \
1268 num += (*cur - '0') * mult; \
1269 cur++; \
1270 } \
1271 }
1272
1273/**
1274 * _xmlSchemaParseGMonth:
1275 * @dt: pointer to a date structure
1276 * @str: pointer to the string to analyze
1277 *
1278 * Parses a xs:gMonth without time zone and fills in the appropriate
1279 * field of the @dt structure. @str is updated to point just after the
1280 * xs:gMonth.
1281 *
1282 * Returns 0 or the error code
1283 */
1284static int
1285_xmlSchemaParseGMonth (xmlSchemaValDatePtr dt, const xmlChar **str) {
1286 const xmlChar *cur = *str;
1287 int ret = 0;
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001288 unsigned int value = 0;
Daniel Veillard070803b2002-05-03 07:29:38 +00001289
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001290 PARSE_2_DIGITS(value, cur, ret);
Daniel Veillard070803b2002-05-03 07:29:38 +00001291 if (ret != 0)
1292 return ret;
1293
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001294 if (!VALID_MONTH(value))
Daniel Veillard070803b2002-05-03 07:29:38 +00001295 return 2;
1296
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001297 dt->mon = value;
1298
Daniel Veillard070803b2002-05-03 07:29:38 +00001299 *str = cur;
1300 return 0;
1301}
1302
1303/**
1304 * _xmlSchemaParseGDay:
1305 * @dt: pointer to a date structure
1306 * @str: pointer to the string to analyze
1307 *
1308 * Parses a xs:gDay without time zone and fills in the appropriate
1309 * field of the @dt structure. @str is updated to point just after the
1310 * xs:gDay.
1311 *
1312 * Returns 0 or the error code
1313 */
1314static int
1315_xmlSchemaParseGDay (xmlSchemaValDatePtr dt, const xmlChar **str) {
1316 const xmlChar *cur = *str;
1317 int ret = 0;
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001318 unsigned int value = 0;
Daniel Veillard070803b2002-05-03 07:29:38 +00001319
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001320 PARSE_2_DIGITS(value, cur, ret);
Daniel Veillard070803b2002-05-03 07:29:38 +00001321 if (ret != 0)
1322 return ret;
1323
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001324 if (!VALID_DAY(value))
Daniel Veillard070803b2002-05-03 07:29:38 +00001325 return 2;
1326
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001327 dt->day = value;
Daniel Veillard070803b2002-05-03 07:29:38 +00001328 *str = cur;
1329 return 0;
1330}
1331
1332/**
1333 * _xmlSchemaParseTime:
1334 * @dt: pointer to a date structure
1335 * @str: pointer to the string to analyze
1336 *
1337 * Parses a xs:time without time zone and fills in the appropriate
1338 * fields of the @dt structure. @str is updated to point just after the
1339 * xs:time.
1340 * In case of error, values of @dt fields are undefined.
1341 *
1342 * Returns 0 or the error code
1343 */
1344static int
1345_xmlSchemaParseTime (xmlSchemaValDatePtr dt, const xmlChar **str) {
Kasimier T. Buchcik285b3672005-05-12 13:10:22 +00001346 const xmlChar *cur = *str;
Daniel Veillard070803b2002-05-03 07:29:38 +00001347 int ret = 0;
Kasimier T. Buchcik285b3672005-05-12 13:10:22 +00001348 int value = 0;
Daniel Veillard070803b2002-05-03 07:29:38 +00001349
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001350 PARSE_2_DIGITS(value, cur, ret);
Daniel Veillard070803b2002-05-03 07:29:38 +00001351 if (ret != 0)
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001352 return ret;
Daniel Veillard070803b2002-05-03 07:29:38 +00001353 if (*cur != ':')
1354 return 1;
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001355 if (!VALID_HOUR(value))
1356 return 2;
Daniel Veillard070803b2002-05-03 07:29:38 +00001357 cur++;
1358
1359 /* the ':' insures this string is xs:time */
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001360 dt->hour = value;
Daniel Veillard070803b2002-05-03 07:29:38 +00001361
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001362 PARSE_2_DIGITS(value, cur, ret);
Daniel Veillard070803b2002-05-03 07:29:38 +00001363 if (ret != 0)
1364 return ret;
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001365 if (!VALID_MIN(value))
1366 return 2;
1367 dt->min = value;
Daniel Veillard070803b2002-05-03 07:29:38 +00001368
1369 if (*cur != ':')
1370 return 1;
1371 cur++;
1372
1373 PARSE_FLOAT(dt->sec, cur, ret);
1374 if (ret != 0)
1375 return ret;
1376
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001377 if ((!VALID_SEC(dt->sec)) || (!VALID_TZO(dt->tzo)))
Daniel Veillard070803b2002-05-03 07:29:38 +00001378 return 2;
1379
1380 *str = cur;
1381 return 0;
1382}
1383
1384/**
1385 * _xmlSchemaParseTimeZone:
1386 * @dt: pointer to a date structure
1387 * @str: pointer to the string to analyze
1388 *
1389 * Parses a time zone without time zone and fills in the appropriate
1390 * field of the @dt structure. @str is updated to point just after the
1391 * time zone.
1392 *
1393 * Returns 0 or the error code
1394 */
1395static int
1396_xmlSchemaParseTimeZone (xmlSchemaValDatePtr dt, const xmlChar **str) {
1397 const xmlChar *cur = *str;
1398 int ret = 0;
1399
1400 if (str == NULL)
1401 return -1;
1402
1403 switch (*cur) {
1404 case 0:
1405 dt->tz_flag = 0;
1406 dt->tzo = 0;
1407 break;
1408
1409 case 'Z':
1410 dt->tz_flag = 1;
1411 dt->tzo = 0;
1412 cur++;
1413 break;
1414
1415 case '+':
1416 case '-': {
1417 int isneg = 0, tmp = 0;
1418 isneg = (*cur == '-');
1419
1420 cur++;
1421
1422 PARSE_2_DIGITS(tmp, cur, ret);
1423 if (ret != 0)
1424 return ret;
1425 if (!VALID_HOUR(tmp))
1426 return 2;
1427
1428 if (*cur != ':')
1429 return 1;
1430 cur++;
1431
1432 dt->tzo = tmp * 60;
1433
1434 PARSE_2_DIGITS(tmp, cur, ret);
1435 if (ret != 0)
1436 return ret;
1437 if (!VALID_MIN(tmp))
1438 return 2;
1439
1440 dt->tzo += tmp;
1441 if (isneg)
1442 dt->tzo = - dt->tzo;
1443
1444 if (!VALID_TZO(dt->tzo))
1445 return 2;
1446
Daniel Veillard5a872412002-05-22 06:40:27 +00001447 dt->tz_flag = 1;
Daniel Veillard070803b2002-05-03 07:29:38 +00001448 break;
1449 }
1450 default:
1451 return 1;
1452 }
1453
1454 *str = cur;
1455 return 0;
1456}
1457
Daniel Veillard1ac24d32003-08-27 14:15:15 +00001458/**
1459 * _xmlSchemaBase64Decode:
1460 * @ch: a character
1461 *
1462 * Converts a base64 encoded character to its base 64 value.
1463 *
1464 * Returns 0-63 (value), 64 (pad), or -1 (not recognized)
1465 */
1466static int
1467_xmlSchemaBase64Decode (const xmlChar ch) {
1468 if (('A' <= ch) && (ch <= 'Z')) return ch - 'A';
1469 if (('a' <= ch) && (ch <= 'z')) return ch - 'a' + 26;
1470 if (('0' <= ch) && (ch <= '9')) return ch - '0' + 52;
1471 if ('+' == ch) return 62;
1472 if ('/' == ch) return 63;
1473 if ('=' == ch) return 64;
1474 return -1;
1475}
1476
Daniel Veillard070803b2002-05-03 07:29:38 +00001477/****************************************************************
1478 * *
1479 * XML Schema Dates/Times Datatypes Handling *
1480 * *
1481 ****************************************************************/
1482
1483/**
1484 * PARSE_DIGITS:
1485 * @num: the integer to fill in
1486 * @cur: an #xmlChar *
1487 * @num_type: an integer flag
1488 *
1489 * Parses a digits integer and updates @num with the value. @cur is
1490 * updated to point just after the integer.
1491 * In case of error, @num_type is set to -1, values of @num and
1492 * @cur are undefined.
1493 */
1494#define PARSE_DIGITS(num, cur, num_type) \
1495 if ((*cur < '0') || (*cur > '9')) \
1496 num_type = -1; \
1497 else \
1498 while ((*cur >= '0') && (*cur <= '9')) { \
1499 num = num * 10 + (*cur - '0'); \
1500 cur++; \
1501 }
1502
1503/**
1504 * PARSE_NUM:
1505 * @num: the double to fill in
1506 * @cur: an #xmlChar *
1507 * @num_type: an integer flag
1508 *
1509 * Parses a float or integer and updates @num with the value. @cur is
1510 * updated to point just after the number. If the number is a float,
1511 * then it must have an integer part and a decimal part; @num_type will
1512 * be set to 1. If there is no decimal part, @num_type is set to zero.
1513 * In case of error, @num_type is set to -1, values of @num and
1514 * @cur are undefined.
1515 */
1516#define PARSE_NUM(num, cur, num_type) \
1517 num = 0; \
1518 PARSE_DIGITS(num, cur, num_type); \
1519 if (!num_type && (*cur == '.')) { \
1520 double mult = 1; \
1521 cur++; \
1522 if ((*cur < '0') || (*cur > '9')) \
1523 num_type = -1; \
1524 else \
1525 num_type = 1; \
1526 while ((*cur >= '0') && (*cur <= '9')) { \
1527 mult /= 10; \
1528 num += (*cur - '0') * mult; \
1529 cur++; \
1530 } \
1531 }
1532
1533/**
Daniel Veillard5a872412002-05-22 06:40:27 +00001534 * xmlSchemaValidateDates:
Daniel Veillard455cc072003-03-31 10:13:23 +00001535 * @type: the expected type or XML_SCHEMAS_UNKNOWN
Daniel Veillard070803b2002-05-03 07:29:38 +00001536 * @dateTime: string to analyze
1537 * @val: the return computed value
1538 *
1539 * Check that @dateTime conforms to the lexical space of one of the date types.
1540 * if true a value is computed and returned in @val.
1541 *
1542 * Returns 0 if this validates, a positive error code number otherwise
1543 * and -1 in case of internal or API error.
1544 */
1545static int
Daniel Veillard455cc072003-03-31 10:13:23 +00001546xmlSchemaValidateDates (xmlSchemaValType type,
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00001547 const xmlChar *dateTime, xmlSchemaValPtr *val,
1548 int collapse) {
Daniel Veillard070803b2002-05-03 07:29:38 +00001549 xmlSchemaValPtr dt;
1550 int ret;
1551 const xmlChar *cur = dateTime;
1552
1553#define RETURN_TYPE_IF_VALID(t) \
1554 if (IS_TZO_CHAR(*cur)) { \
1555 ret = _xmlSchemaParseTimeZone(&(dt->value.date), &cur); \
1556 if (ret == 0) { \
1557 if (*cur != 0) \
1558 goto error; \
1559 dt->type = t; \
Daniel Veillard455cc072003-03-31 10:13:23 +00001560 goto done; \
Daniel Veillard070803b2002-05-03 07:29:38 +00001561 } \
1562 }
1563
1564 if (dateTime == NULL)
1565 return -1;
1566
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00001567 if (collapse)
1568 while IS_WSP_BLANK_CH(*cur) cur++;
1569
Daniel Veillard070803b2002-05-03 07:29:38 +00001570 if ((*cur != '-') && (*cur < '0') && (*cur > '9'))
1571 return 1;
1572
1573 dt = xmlSchemaNewValue(XML_SCHEMAS_UNKNOWN);
1574 if (dt == NULL)
1575 return -1;
1576
1577 if ((cur[0] == '-') && (cur[1] == '-')) {
1578 /*
1579 * It's an incomplete date (xs:gMonthDay, xs:gMonth or
1580 * xs:gDay)
1581 */
1582 cur += 2;
1583
1584 /* is it an xs:gDay? */
1585 if (*cur == '-') {
Daniel Veillard455cc072003-03-31 10:13:23 +00001586 if (type == XML_SCHEMAS_GMONTH)
1587 goto error;
Daniel Veillard070803b2002-05-03 07:29:38 +00001588 ++cur;
1589 ret = _xmlSchemaParseGDay(&(dt->value.date), &cur);
1590 if (ret != 0)
1591 goto error;
1592
1593 RETURN_TYPE_IF_VALID(XML_SCHEMAS_GDAY);
1594
1595 goto error;
1596 }
1597
1598 /*
1599 * it should be an xs:gMonthDay or xs:gMonth
1600 */
1601 ret = _xmlSchemaParseGMonth(&(dt->value.date), &cur);
1602 if (ret != 0)
1603 goto error;
1604
Daniel Veillardd3b9cd82003-04-09 11:24:17 +00001605 /*
1606 * a '-' char could indicate this type is xs:gMonthDay or
1607 * a negative time zone offset. Check for xs:gMonthDay first.
1608 * Also the first three char's of a negative tzo (-MM:SS) can
1609 * appear to be a valid day; so even if the day portion
1610 * of the xs:gMonthDay verifies, we must insure it was not
1611 * a tzo.
1612 */
1613 if (*cur == '-') {
1614 const xmlChar *rewnd = cur;
1615 cur++;
Daniel Veillard070803b2002-05-03 07:29:38 +00001616
Daniel Veillardd3b9cd82003-04-09 11:24:17 +00001617 ret = _xmlSchemaParseGDay(&(dt->value.date), &cur);
1618 if ((ret == 0) && ((*cur == 0) || (*cur != ':'))) {
1619
1620 /*
1621 * we can use the VALID_MDAY macro to validate the month
1622 * and day because the leap year test will flag year zero
1623 * as a leap year (even though zero is an invalid year).
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00001624 * FUTURE TODO: Zero will become valid in XML Schema 1.1
1625 * probably.
Daniel Veillardd3b9cd82003-04-09 11:24:17 +00001626 */
1627 if (VALID_MDAY((&(dt->value.date)))) {
1628
1629 RETURN_TYPE_IF_VALID(XML_SCHEMAS_GMONTHDAY);
1630
1631 goto error;
1632 }
1633 }
1634
1635 /*
1636 * not xs:gMonthDay so rewind and check if just xs:gMonth
1637 * with an optional time zone.
1638 */
1639 cur = rewnd;
1640 }
1641
1642 RETURN_TYPE_IF_VALID(XML_SCHEMAS_GMONTH);
Daniel Veillard070803b2002-05-03 07:29:38 +00001643
1644 goto error;
1645 }
1646
1647 /*
1648 * It's a right-truncated date or an xs:time.
1649 * Try to parse an xs:time then fallback on right-truncated dates.
1650 */
1651 if ((*cur >= '0') && (*cur <= '9')) {
1652 ret = _xmlSchemaParseTime(&(dt->value.date), &cur);
1653 if (ret == 0) {
1654 /* it's an xs:time */
1655 RETURN_TYPE_IF_VALID(XML_SCHEMAS_TIME);
1656 }
1657 }
1658
1659 /* fallback on date parsing */
1660 cur = dateTime;
1661
1662 ret = _xmlSchemaParseGYear(&(dt->value.date), &cur);
1663 if (ret != 0)
1664 goto error;
1665
1666 /* is it an xs:gYear? */
1667 RETURN_TYPE_IF_VALID(XML_SCHEMAS_GYEAR);
1668
1669 if (*cur != '-')
1670 goto error;
1671 cur++;
1672
1673 ret = _xmlSchemaParseGMonth(&(dt->value.date), &cur);
1674 if (ret != 0)
1675 goto error;
1676
1677 /* is it an xs:gYearMonth? */
1678 RETURN_TYPE_IF_VALID(XML_SCHEMAS_GYEARMONTH);
1679
1680 if (*cur != '-')
1681 goto error;
1682 cur++;
1683
1684 ret = _xmlSchemaParseGDay(&(dt->value.date), &cur);
1685 if ((ret != 0) || !VALID_DATE((&(dt->value.date))))
1686 goto error;
1687
1688 /* is it an xs:date? */
1689 RETURN_TYPE_IF_VALID(XML_SCHEMAS_DATE);
1690
1691 if (*cur != 'T')
1692 goto error;
1693 cur++;
1694
1695 /* it should be an xs:dateTime */
1696 ret = _xmlSchemaParseTime(&(dt->value.date), &cur);
1697 if (ret != 0)
1698 goto error;
1699
1700 ret = _xmlSchemaParseTimeZone(&(dt->value.date), &cur);
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00001701 if (collapse)
1702 while IS_WSP_BLANK_CH(*cur) cur++;
Daniel Veillard070803b2002-05-03 07:29:38 +00001703 if ((ret != 0) || (*cur != 0) || !VALID_DATETIME((&(dt->value.date))))
1704 goto error;
1705
Daniel Veillard455cc072003-03-31 10:13:23 +00001706
Daniel Veillard070803b2002-05-03 07:29:38 +00001707 dt->type = XML_SCHEMAS_DATETIME;
1708
Daniel Veillard455cc072003-03-31 10:13:23 +00001709done:
Daniel Veillardd3b9cd82003-04-09 11:24:17 +00001710#if 1
1711 if ((type != XML_SCHEMAS_UNKNOWN) && (type != dt->type))
1712 goto error;
1713#else
1714 /*
1715 * insure the parsed type is equal to or less significant (right
1716 * truncated) than the desired type.
1717 */
1718 if ((type != XML_SCHEMAS_UNKNOWN) && (type != dt->type)) {
1719
1720 /* time only matches time */
1721 if ((type == XML_SCHEMAS_TIME) && (dt->type == XML_SCHEMAS_TIME))
1722 goto error;
1723
1724 if ((type == XML_SCHEMAS_DATETIME) &&
1725 ((dt->type != XML_SCHEMAS_DATE) ||
1726 (dt->type != XML_SCHEMAS_GYEARMONTH) ||
1727 (dt->type != XML_SCHEMAS_GYEAR)))
1728 goto error;
1729
1730 if ((type == XML_SCHEMAS_DATE) &&
1731 ((dt->type != XML_SCHEMAS_GYEAR) ||
1732 (dt->type != XML_SCHEMAS_GYEARMONTH)))
1733 goto error;
1734
1735 if ((type == XML_SCHEMAS_GYEARMONTH) && (dt->type != XML_SCHEMAS_GYEAR))
1736 goto error;
1737
1738 if ((type == XML_SCHEMAS_GMONTHDAY) && (dt->type != XML_SCHEMAS_GMONTH))
1739 goto error;
1740 }
Daniel Veillard455cc072003-03-31 10:13:23 +00001741#endif
1742
Daniel Veillard070803b2002-05-03 07:29:38 +00001743 if (val != NULL)
1744 *val = dt;
Daniel Veillard80b19092003-03-28 13:29:53 +00001745 else
1746 xmlSchemaFreeValue(dt);
Daniel Veillard070803b2002-05-03 07:29:38 +00001747
1748 return 0;
1749
1750error:
1751 if (dt != NULL)
1752 xmlSchemaFreeValue(dt);
1753 return 1;
1754}
1755
1756/**
Daniel Veillard5a872412002-05-22 06:40:27 +00001757 * xmlSchemaValidateDuration:
Daniel Veillard070803b2002-05-03 07:29:38 +00001758 * @type: the predefined type
1759 * @duration: string to analyze
1760 * @val: the return computed value
1761 *
1762 * Check that @duration conforms to the lexical space of the duration type.
1763 * if true a value is computed and returned in @val.
1764 *
1765 * Returns 0 if this validates, a positive error code number otherwise
1766 * and -1 in case of internal or API error.
1767 */
1768static int
Daniel Veillarddda8f1b2002-09-26 09:47:36 +00001769xmlSchemaValidateDuration (xmlSchemaTypePtr type ATTRIBUTE_UNUSED,
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00001770 const xmlChar *duration, xmlSchemaValPtr *val,
1771 int collapse) {
Daniel Veillard070803b2002-05-03 07:29:38 +00001772 const xmlChar *cur = duration;
1773 xmlSchemaValPtr dur;
1774 int isneg = 0;
1775 unsigned int seq = 0;
Daniel Veillardd3b9cd82003-04-09 11:24:17 +00001776 double num;
1777 int num_type = 0; /* -1 = invalid, 0 = int, 1 = floating */
1778 const xmlChar desig[] = {'Y', 'M', 'D', 'H', 'M', 'S'};
1779 const double multi[] = { 0.0, 0.0, 86400.0, 3600.0, 60.0, 1.0, 0.0};
Daniel Veillard070803b2002-05-03 07:29:38 +00001780
1781 if (duration == NULL)
1782 return -1;
1783
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00001784 if (collapse)
1785 while IS_WSP_BLANK_CH(*cur) cur++;
1786
Daniel Veillard070803b2002-05-03 07:29:38 +00001787 if (*cur == '-') {
1788 isneg = 1;
1789 cur++;
1790 }
1791
1792 /* duration must start with 'P' (after sign) */
1793 if (*cur++ != 'P')
1794 return 1;
1795
Daniel Veillard80b19092003-03-28 13:29:53 +00001796 if (*cur == 0)
1797 return 1;
1798
Daniel Veillard070803b2002-05-03 07:29:38 +00001799 dur = xmlSchemaNewValue(XML_SCHEMAS_DURATION);
1800 if (dur == NULL)
1801 return -1;
1802
1803 while (*cur != 0) {
Daniel Veillard070803b2002-05-03 07:29:38 +00001804
1805 /* input string should be empty or invalid date/time item */
1806 if (seq >= sizeof(desig))
1807 goto error;
1808
1809 /* T designator must be present for time items */
1810 if (*cur == 'T') {
1811 if (seq <= 3) {
1812 seq = 3;
1813 cur++;
1814 } else
1815 return 1;
1816 } else if (seq == 3)
1817 goto error;
1818
1819 /* parse the number portion of the item */
1820 PARSE_NUM(num, cur, num_type);
1821
1822 if ((num_type == -1) || (*cur == 0))
1823 goto error;
1824
1825 /* update duration based on item type */
1826 while (seq < sizeof(desig)) {
1827 if (*cur == desig[seq]) {
1828
1829 /* verify numeric type; only seconds can be float */
1830 if ((num_type != 0) && (seq < (sizeof(desig)-1)))
1831 goto error;
1832
1833 switch (seq) {
1834 case 0:
1835 dur->value.dur.mon = (long)num * 12;
1836 break;
1837 case 1:
1838 dur->value.dur.mon += (long)num;
1839 break;
1840 default:
1841 /* convert to seconds using multiplier */
1842 dur->value.dur.sec += num * multi[seq];
1843 seq++;
1844 break;
1845 }
1846
1847 break; /* exit loop */
1848 }
1849 /* no date designators found? */
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00001850 if ((++seq == 3) || (seq == 6))
Daniel Veillard070803b2002-05-03 07:29:38 +00001851 goto error;
1852 }
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00001853 cur++;
1854 if (collapse)
1855 while IS_WSP_BLANK_CH(*cur) cur++;
Daniel Veillard070803b2002-05-03 07:29:38 +00001856 }
1857
1858 if (isneg) {
1859 dur->value.dur.mon = -dur->value.dur.mon;
1860 dur->value.dur.day = -dur->value.dur.day;
1861 dur->value.dur.sec = -dur->value.dur.sec;
1862 }
1863
1864 if (val != NULL)
1865 *val = dur;
Daniel Veillard80b19092003-03-28 13:29:53 +00001866 else
1867 xmlSchemaFreeValue(dur);
Daniel Veillard070803b2002-05-03 07:29:38 +00001868
1869 return 0;
1870
1871error:
1872 if (dur != NULL)
1873 xmlSchemaFreeValue(dur);
1874 return 1;
1875}
1876
Daniel Veillarda1a9d042003-03-18 16:53:17 +00001877/**
1878 * xmlSchemaStrip:
1879 * @value: a value
1880 *
1881 * Removes the leading and ending spaces of a string
1882 *
1883 * Returns the new string or NULL if no change was required.
1884 */
1885static xmlChar *
1886xmlSchemaStrip(const xmlChar *value) {
1887 const xmlChar *start = value, *end, *f;
1888
1889 if (value == NULL) return(NULL);
William M. Brack76e95df2003-10-18 16:20:14 +00001890 while ((*start != 0) && (IS_BLANK_CH(*start))) start++;
Daniel Veillarda1a9d042003-03-18 16:53:17 +00001891 end = start;
1892 while (*end != 0) end++;
1893 f = end;
1894 end--;
William M. Brack76e95df2003-10-18 16:20:14 +00001895 while ((end > start) && (IS_BLANK_CH(*end))) end--;
Daniel Veillarda1a9d042003-03-18 16:53:17 +00001896 end++;
1897 if ((start == value) && (f == end)) return(NULL);
1898 return(xmlStrndup(start, end - start));
1899}
Daniel Veillard96a4b252003-02-06 08:22:32 +00001900
1901/**
Kasimier T. Buchcik91feaf82004-11-12 14:04:58 +00001902 * xmlSchemaWhiteSpaceReplace:
1903 * @value: a value
1904 *
1905 * Replaces 0xd, 0x9 and 0xa with a space.
1906 *
1907 * Returns the new string or NULL if no change was required.
1908 */
1909xmlChar *
1910xmlSchemaWhiteSpaceReplace(const xmlChar *value) {
1911 const xmlChar *cur = value;
1912 xmlChar *ret = NULL, *mcur;
1913
1914 if (value == NULL)
1915 return(NULL);
1916
1917 while ((*cur != 0) &&
1918 (((*cur) != 0xd) && ((*cur) != 0x9) && ((*cur) != 0xa))) {
1919 cur++;
1920 }
1921 if (*cur == 0)
1922 return (NULL);
1923 ret = xmlStrdup(value);
1924 /* TODO FIXME: I guess gcc will bark at this. */
1925 mcur = (xmlChar *) (ret + (cur - value));
1926 do {
1927 if ( ((*mcur) == 0xd) || ((*mcur) == 0x9) || ((*mcur) == 0xa) )
1928 *mcur = ' ';
1929 mcur++;
1930 } while (*mcur != 0);
1931 return(ret);
1932}
1933
1934/**
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001935 * xmlSchemaCollapseString:
1936 * @value: a value
1937 *
1938 * Removes and normalize white spaces in the string
1939 *
1940 * Returns the new string or NULL if no change was required.
1941 */
Daniel Veillard01fa6152004-06-29 17:04:39 +00001942xmlChar *
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001943xmlSchemaCollapseString(const xmlChar *value) {
1944 const xmlChar *start = value, *end, *f;
1945 xmlChar *g;
1946 int col = 0;
1947
1948 if (value == NULL) return(NULL);
William M. Brack76e95df2003-10-18 16:20:14 +00001949 while ((*start != 0) && (IS_BLANK_CH(*start))) start++;
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001950 end = start;
1951 while (*end != 0) {
William M. Brack76e95df2003-10-18 16:20:14 +00001952 if ((*end == ' ') && (IS_BLANK_CH(end[1]))) {
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001953 col = end - start;
1954 break;
1955 } else if ((*end == 0xa) || (*end == 0x9) || (*end == 0xd)) {
1956 col = end - start;
1957 break;
1958 }
1959 end++;
1960 }
1961 if (col == 0) {
1962 f = end;
1963 end--;
William M. Brack76e95df2003-10-18 16:20:14 +00001964 while ((end > start) && (IS_BLANK_CH(*end))) end--;
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001965 end++;
1966 if ((start == value) && (f == end)) return(NULL);
1967 return(xmlStrndup(start, end - start));
1968 }
1969 start = xmlStrdup(start);
1970 if (start == NULL) return(NULL);
1971 g = (xmlChar *) (start + col);
1972 end = g;
1973 while (*end != 0) {
William M. Brack76e95df2003-10-18 16:20:14 +00001974 if (IS_BLANK_CH(*end)) {
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001975 end++;
William M. Brack76e95df2003-10-18 16:20:14 +00001976 while (IS_BLANK_CH(*end)) end++;
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001977 if (*end != 0)
1978 *g++ = ' ';
1979 } else
1980 *g++ = *end++;
1981 }
1982 *g = 0;
1983 return((xmlChar *) start);
1984}
1985
1986/**
Daniel Veillard28c52ab2003-03-18 11:39:17 +00001987 * xmlSchemaValAtomicListNode:
1988 * @type: the predefined atomic type for a token in the list
1989 * @value: the list value to check
1990 * @ret: the return computed value
1991 * @node: the node containing the value
1992 *
1993 * Check that a value conforms to the lexical space of the predefined
1994 * list type. if true a value is computed and returned in @ret.
1995 *
Daniel Veillarda1a9d042003-03-18 16:53:17 +00001996 * Returns the number of items if this validates, a negative error code
1997 * number otherwise
Daniel Veillard28c52ab2003-03-18 11:39:17 +00001998 */
1999static int
2000xmlSchemaValAtomicListNode(xmlSchemaTypePtr type, const xmlChar *value,
2001 xmlSchemaValPtr *ret, xmlNodePtr node) {
2002 xmlChar *val, *cur, *endval;
2003 int nb_values = 0;
Daniel Veillard580ced82003-03-21 21:22:48 +00002004 int tmp = 0;
Daniel Veillard28c52ab2003-03-18 11:39:17 +00002005
2006 if (value == NULL) {
2007 return(-1);
2008 }
2009 val = xmlStrdup(value);
2010 if (val == NULL) {
2011 return(-1);
2012 }
Daniel Veillard6fc5db02005-01-16 00:05:58 +00002013 if (ret != NULL) {
2014 *ret = NULL;
2015 }
Daniel Veillard28c52ab2003-03-18 11:39:17 +00002016 cur = val;
2017 /*
2018 * Split the list
2019 */
William M. Brack76e95df2003-10-18 16:20:14 +00002020 while (IS_BLANK_CH(*cur)) *cur++ = 0;
Daniel Veillard28c52ab2003-03-18 11:39:17 +00002021 while (*cur != 0) {
William M. Brack76e95df2003-10-18 16:20:14 +00002022 if (IS_BLANK_CH(*cur)) {
Daniel Veillard28c52ab2003-03-18 11:39:17 +00002023 *cur = 0;
2024 cur++;
William M. Brack76e95df2003-10-18 16:20:14 +00002025 while (IS_BLANK_CH(*cur)) *cur++ = 0;
Daniel Veillard28c52ab2003-03-18 11:39:17 +00002026 } else {
2027 nb_values++;
2028 cur++;
William M. Brack76e95df2003-10-18 16:20:14 +00002029 while ((*cur != 0) && (!IS_BLANK_CH(*cur))) cur++;
Daniel Veillard28c52ab2003-03-18 11:39:17 +00002030 }
2031 }
2032 if (nb_values == 0) {
Daniel Veillard28c52ab2003-03-18 11:39:17 +00002033 xmlFree(val);
Daniel Veillarda1a9d042003-03-18 16:53:17 +00002034 return(nb_values);
Daniel Veillard28c52ab2003-03-18 11:39:17 +00002035 }
2036 endval = cur;
2037 cur = val;
2038 while ((*cur == 0) && (cur != endval)) cur++;
2039 while (cur != endval) {
2040 tmp = xmlSchemaValPredefTypeNode(type, cur, NULL, node);
2041 if (tmp != 0)
2042 break;
2043 while (*cur != 0) cur++;
2044 while ((*cur == 0) && (cur != endval)) cur++;
2045 }
Daniel Veillard6fc5db02005-01-16 00:05:58 +00002046 /* TODO what return value ? c.f. bug #158628
Daniel Veillard28c52ab2003-03-18 11:39:17 +00002047 if (ret != NULL) {
2048 TODO
Daniel Veillard6fc5db02005-01-16 00:05:58 +00002049 } */
2050 xmlFree(val);
Daniel Veillarda1a9d042003-03-18 16:53:17 +00002051 if (tmp == 0)
2052 return(nb_values);
2053 return(-1);
Daniel Veillard28c52ab2003-03-18 11:39:17 +00002054}
2055
2056/**
Daniel Veillarde637c4a2003-03-30 21:10:09 +00002057 * xmlSchemaParseUInt:
2058 * @str: pointer to the string R/W
2059 * @llo: pointer to the low result
2060 * @lmi: pointer to the mid result
2061 * @lhi: pointer to the high result
2062 *
2063 * Parse an unsigned long into 3 fields.
2064 *
William M. Brackec3b4b72005-03-15 15:50:17 +00002065 * Returns the number of significant digits in the number or
2066 * -1 if overflow of the capacity
Daniel Veillarde637c4a2003-03-30 21:10:09 +00002067 */
2068static int
2069xmlSchemaParseUInt(const xmlChar **str, unsigned long *llo,
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00002070 unsigned long *lmi, unsigned long *lhi) {
Daniel Veillarde637c4a2003-03-30 21:10:09 +00002071 unsigned long lo = 0, mi = 0, hi = 0;
2072 const xmlChar *tmp, *cur = *str;
2073 int ret = 0, i = 0;
2074
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00002075 while (*cur == '0') { /* ignore leading zeroes */
2076 cur++;
Daniel Veillarde637c4a2003-03-30 21:10:09 +00002077 }
2078 tmp = cur;
2079 while ((*tmp != 0) && (*tmp >= '0') && (*tmp <= '9')) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00002080 i++;tmp++;ret++;
Daniel Veillarde637c4a2003-03-30 21:10:09 +00002081 }
2082 if (i > 24) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00002083 *str = tmp;
2084 return(-1);
Daniel Veillarde637c4a2003-03-30 21:10:09 +00002085 }
2086 while (i > 16) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00002087 hi = hi * 10 + (*cur++ - '0');
2088 i--;
Daniel Veillarde637c4a2003-03-30 21:10:09 +00002089 }
2090 while (i > 8) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00002091 mi = mi * 10 + (*cur++ - '0');
2092 i--;
Daniel Veillarde637c4a2003-03-30 21:10:09 +00002093 }
2094 while (i > 0) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00002095 lo = lo * 10 + (*cur++ - '0');
2096 i--;
Daniel Veillarde637c4a2003-03-30 21:10:09 +00002097 }
2098
2099 *str = cur;
2100 *llo = lo;
2101 *lmi = mi;
2102 *lhi = hi;
2103 return(ret);
2104}
2105
2106/**
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002107 * xmlSchemaValAtomicType:
2108 * @type: the predefined type
2109 * @value: the value to check
2110 * @val: the return computed value
2111 * @node: the node containing the value
2112 * flags: flags to control the vlidation
2113 *
2114 * Check that a value conforms to the lexical space of the atomic type.
2115 * if true a value is computed and returned in @val.
Daniel Veillard01fa6152004-06-29 17:04:39 +00002116 * This checks the value space for list types as well (IDREFS, NMTOKENS).
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002117 *
2118 * Returns 0 if this validates, a positive error code number otherwise
2119 * and -1 in case of internal or API error.
2120 */
2121static int
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002122xmlSchemaValAtomicType(xmlSchemaTypePtr type, const xmlChar * value,
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002123 xmlSchemaValPtr * val, xmlNodePtr node, int flags,
2124 xmlSchemaWhitespaceValueType ws,
2125 int normOnTheFly, int applyNorm, int createStringValue)
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002126{
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002127 xmlSchemaValPtr v;
2128 xmlChar *norm = NULL;
Daniel Veillardd3b9cd82003-04-09 11:24:17 +00002129 int ret = 0;
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002130
2131 if (xmlSchemaTypesInitialized == 0)
Daniel Veillard01fa6152004-06-29 17:04:39 +00002132 xmlSchemaInitTypes();
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002133 if (type == NULL)
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002134 return (-1);
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002135
Daniel Veillardeebd6332004-08-26 10:30:44 +00002136 /*
2137 * validating a non existant text node is similar to validating
2138 * an empty one.
2139 */
2140 if (value == NULL)
2141 value = BAD_CAST "";
2142
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002143 if (val != NULL)
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002144 *val = NULL;
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002145 if ((flags == 0) && (value != NULL)) {
Kasimier T. Buchcik91feaf82004-11-12 14:04:58 +00002146
Daniel Veillard01fa6152004-06-29 17:04:39 +00002147 if ((type->builtInType != XML_SCHEMAS_STRING) &&
Kasimier T. Buchcik91feaf82004-11-12 14:04:58 +00002148 (type->builtInType != XML_SCHEMAS_ANYTYPE) &&
2149 (type->builtInType != XML_SCHEMAS_ANYSIMPLETYPE)) {
2150 if (type->builtInType == XML_SCHEMAS_NORMSTRING)
2151 norm = xmlSchemaWhiteSpaceReplace(value);
2152 else
2153 norm = xmlSchemaCollapseString(value);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002154 if (norm != NULL)
2155 value = norm;
2156 }
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002157 }
2158
Daniel Veillard01fa6152004-06-29 17:04:39 +00002159 switch (type->builtInType) {
William M. Brack2f2a6632004-08-20 23:09:47 +00002160 case XML_SCHEMAS_UNKNOWN:
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002161 goto error;
William M. Brack2f2a6632004-08-20 23:09:47 +00002162 case XML_SCHEMAS_ANYTYPE:
2163 case XML_SCHEMAS_ANYSIMPLETYPE:
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002164 if ((createStringValue) && (val != NULL)) {
2165 v = xmlSchemaNewValue(XML_SCHEMAS_ANYSIMPLETYPE);
2166 if (v != NULL) {
2167 v->value.str = xmlStrdup(value);
2168 *val = v;
2169 } else {
2170 goto error;
2171 }
2172 }
William M. Brack2f2a6632004-08-20 23:09:47 +00002173 goto return0;
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002174 case XML_SCHEMAS_STRING:
2175 if (! normOnTheFly) {
2176 const xmlChar *cur = value;
2177
2178 if (ws == XML_SCHEMA_WHITESPACE_REPLACE) {
2179 while (*cur != 0) {
2180 if ((*cur == 0xd) || (*cur == 0xa) || (*cur == 0x9)) {
2181 goto return1;
2182 } else {
2183 cur++;
2184 }
2185 }
2186 } else if (ws == XML_SCHEMA_WHITESPACE_COLLAPSE) {
2187 while (*cur != 0) {
2188 if ((*cur == 0xd) || (*cur == 0xa) || (*cur == 0x9)) {
2189 goto return1;
2190 } else if IS_WSP_SPACE_CH(*cur) {
2191 cur++;
2192 if IS_WSP_SPACE_CH(*cur)
2193 goto return1;
2194 } else {
2195 cur++;
2196 }
2197 }
2198 }
2199 }
2200 if (createStringValue && (val != NULL)) {
2201 if (applyNorm) {
2202 if (ws == XML_SCHEMA_WHITESPACE_COLLAPSE)
2203 norm = xmlSchemaCollapseString(value);
2204 else if (ws == XML_SCHEMA_WHITESPACE_REPLACE)
2205 norm = xmlSchemaWhiteSpaceReplace(value);
2206 if (norm != NULL)
2207 value = norm;
2208 }
2209 v = xmlSchemaNewValue(XML_SCHEMAS_STRING);
2210 if (v != NULL) {
2211 v->value.str = xmlStrdup(value);
2212 *val = v;
2213 } else {
2214 goto error;
2215 }
2216 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002217 goto return0;
Daniel Veillard1516d5b2004-01-22 07:27:45 +00002218 case XML_SCHEMAS_NORMSTRING:{
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002219 if (normOnTheFly) {
2220 if (applyNorm) {
2221 if (ws == XML_SCHEMA_WHITESPACE_COLLAPSE)
2222 norm = xmlSchemaCollapseString(value);
2223 else
2224 norm = xmlSchemaWhiteSpaceReplace(value);
2225 if (norm != NULL)
2226 value = norm;
2227 }
2228 } else {
2229 const xmlChar *cur = value;
2230 while (*cur != 0) {
2231 if ((*cur == 0xd) || (*cur == 0xa) || (*cur == 0x9)) {
2232 goto return1;
2233 } else {
2234 cur++;
2235 }
2236 }
2237 }
Daniel Veillard1516d5b2004-01-22 07:27:45 +00002238 if (val != NULL) {
2239 v = xmlSchemaNewValue(XML_SCHEMAS_NORMSTRING);
2240 if (v != NULL) {
2241 v->value.str = xmlStrdup(value);
2242 *val = v;
2243 } else {
2244 goto error;
2245 }
2246 }
2247 goto return0;
2248 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002249 case XML_SCHEMAS_DECIMAL:{
William M. Brack273670f2005-03-11 15:55:14 +00002250 const xmlChar *cur = value;
2251 unsigned int len, neg = 0;
2252 xmlChar cval[25];
2253 xmlChar *cptr = cval;
2254 int dec = -1;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002255
2256 if (cur == NULL)
2257 goto return1;
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002258
2259 if (normOnTheFly)
2260 while IS_WSP_BLANK_CH(*cur) cur++;
2261
William M. Brack273670f2005-03-11 15:55:14 +00002262 /* First we handle an optional sign */
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002263 if (*cur == '+')
2264 cur++;
2265 else if (*cur == '-') {
2266 neg = 1;
2267 cur++;
2268 }
William M. Brack273670f2005-03-11 15:55:14 +00002269 /*
2270 * Next we "pre-parse" the number, in preparation for calling
2271 * the common routine xmlSchemaParseUInt. We get rid of any
2272 * leading zeroes (because we have reserved only 25 chars),
2273 * and note the position of any decimal point.
2274 */
2275 len = 0;
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00002276 /*
2277 * Skip leading zeroes.
2278 */
2279 while (*cur == '0')
William M. Brack273670f2005-03-11 15:55:14 +00002280 cur++;
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00002281 if (*cur != 0) {
2282 while (len < 24) {
2283 if ((*cur >= '0') && (*cur <= '9')) {
2284 *cptr++ = *cur++;
2285 len++;
2286 } else if (*cur == '.') {
2287 if (dec != -1)
2288 goto return1; /* multiple decimal points */
2289 cur++;
2290 if ((*cur == 0) && (cur -1 == value))
2291 goto return1;
2292
2293 dec = len;
2294 while ((len < 24) && (*cur >= '0') &&
2295 (*cur <= '9')) {
2296 *cptr++ = *cur++;
2297 len++;
2298 }
2299 break;
2300 } else
2301 break;
2302 }
William M. Brack273670f2005-03-11 15:55:14 +00002303 }
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002304 if (normOnTheFly)
2305 while IS_WSP_BLANK_CH(*cur) cur++;
William M. Brack273670f2005-03-11 15:55:14 +00002306 if (*cur != 0)
2307 goto return1; /* error if any extraneous chars */
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002308 if (val != NULL) {
2309 v = xmlSchemaNewValue(XML_SCHEMAS_DECIMAL);
2310 if (v != NULL) {
William M. Brack273670f2005-03-11 15:55:14 +00002311 /*
2312 * If a mixed decimal, get rid of trailing zeroes
2313 */
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00002314 if (dec != -1) {
Kasimier T. Buchcik6d30ff22005-07-06 11:44:51 +00002315 while ((len > dec) && (cptr > cval) &&
2316 (*(cptr-1) == '0')) {
William M. Brack273670f2005-03-11 15:55:14 +00002317 cptr--;
2318 len--;
2319 }
2320 }
2321 *cptr = 0; /* Terminate our (preparsed) string */
2322 cptr = cval;
2323 /*
2324 * Now evaluate the significant digits of the number
2325 */
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00002326 if (*cptr != 0)
2327 xmlSchemaParseUInt((const xmlChar **)&cptr,
William M. Brack273670f2005-03-11 15:55:14 +00002328 &v->value.decimal.lo,
2329 &v->value.decimal.mi,
2330 &v->value.decimal.hi);
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00002331 /*
2332 * Set the total digits to 1 if a zero value.
2333 */
2334 if (len == 0)
2335 len++;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002336 v->value.decimal.sign = neg;
William M. Brack273670f2005-03-11 15:55:14 +00002337 if (dec == -1) {
2338 v->value.decimal.frac = 0;
2339 v->value.decimal.total = len;
2340 } else {
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00002341 v->value.decimal.frac = len - dec;
2342 v->value.decimal.total = len;
William M. Brack273670f2005-03-11 15:55:14 +00002343 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002344 *val = v;
2345 }
2346 }
2347 goto return0;
2348 }
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002349 case XML_SCHEMAS_TIME:
2350 case XML_SCHEMAS_GDAY:
2351 case XML_SCHEMAS_GMONTH:
2352 case XML_SCHEMAS_GMONTHDAY:
2353 case XML_SCHEMAS_GYEAR:
2354 case XML_SCHEMAS_GYEARMONTH:
2355 case XML_SCHEMAS_DATE:
2356 case XML_SCHEMAS_DATETIME:
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002357 ret = xmlSchemaValidateDates(type->builtInType, value, val,
2358 normOnTheFly);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002359 break;
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002360 case XML_SCHEMAS_DURATION:
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002361 ret = xmlSchemaValidateDuration(type, value, val,
2362 normOnTheFly);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002363 break;
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002364 case XML_SCHEMAS_FLOAT:
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002365 case XML_SCHEMAS_DOUBLE:{
2366 const xmlChar *cur = value;
2367 int neg = 0;
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002368
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002369 if (cur == NULL)
Daniel Veillard70bcb0e2003-08-08 14:00:28 +00002370 goto return1;
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002371
2372 if (normOnTheFly)
2373 while IS_WSP_BLANK_CH(*cur) cur++;
2374
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002375 if ((cur[0] == 'N') && (cur[1] == 'a') && (cur[2] == 'N')) {
2376 cur += 3;
2377 if (*cur != 0)
2378 goto return1;
2379 if (val != NULL) {
2380 if (type == xmlSchemaTypeFloatDef) {
2381 v = xmlSchemaNewValue(XML_SCHEMAS_FLOAT);
2382 if (v != NULL) {
2383 v->value.f = (float) xmlXPathNAN;
2384 } else {
2385 xmlSchemaFreeValue(v);
2386 goto error;
2387 }
2388 } else {
2389 v = xmlSchemaNewValue(XML_SCHEMAS_DOUBLE);
2390 if (v != NULL) {
2391 v->value.d = xmlXPathNAN;
2392 } else {
2393 xmlSchemaFreeValue(v);
2394 goto error;
2395 }
2396 }
2397 *val = v;
2398 }
2399 goto return0;
2400 }
2401 if (*cur == '-') {
2402 neg = 1;
2403 cur++;
2404 }
2405 if ((cur[0] == 'I') && (cur[1] == 'N') && (cur[2] == 'F')) {
2406 cur += 3;
2407 if (*cur != 0)
2408 goto return1;
2409 if (val != NULL) {
2410 if (type == xmlSchemaTypeFloatDef) {
2411 v = xmlSchemaNewValue(XML_SCHEMAS_FLOAT);
2412 if (v != NULL) {
2413 if (neg)
2414 v->value.f = (float) xmlXPathNINF;
2415 else
2416 v->value.f = (float) xmlXPathPINF;
2417 } else {
2418 xmlSchemaFreeValue(v);
2419 goto error;
2420 }
2421 } else {
2422 v = xmlSchemaNewValue(XML_SCHEMAS_DOUBLE);
2423 if (v != NULL) {
2424 if (neg)
2425 v->value.d = xmlXPathNINF;
2426 else
2427 v->value.d = xmlXPathPINF;
2428 } else {
2429 xmlSchemaFreeValue(v);
2430 goto error;
2431 }
2432 }
2433 *val = v;
2434 }
2435 goto return0;
2436 }
2437 if ((neg == 0) && (*cur == '+'))
2438 cur++;
2439 if ((cur[0] == 0) || (cur[0] == '+') || (cur[0] == '-'))
2440 goto return1;
2441 while ((*cur >= '0') && (*cur <= '9')) {
2442 cur++;
2443 }
2444 if (*cur == '.') {
2445 cur++;
2446 while ((*cur >= '0') && (*cur <= '9'))
2447 cur++;
2448 }
2449 if ((*cur == 'e') || (*cur == 'E')) {
2450 cur++;
2451 if ((*cur == '-') || (*cur == '+'))
2452 cur++;
2453 while ((*cur >= '0') && (*cur <= '9'))
2454 cur++;
2455 }
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002456 if (normOnTheFly)
2457 while IS_WSP_BLANK_CH(*cur) cur++;
2458
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002459 if (*cur != 0)
2460 goto return1;
2461 if (val != NULL) {
2462 if (type == xmlSchemaTypeFloatDef) {
2463 v = xmlSchemaNewValue(XML_SCHEMAS_FLOAT);
2464 if (v != NULL) {
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00002465 /*
2466 * TODO: sscanf seems not to give the correct
2467 * value for extremely high/low values.
2468 * E.g. "1E-149" results in zero.
2469 */
Daniel Veillardd0c9c322003-10-10 00:49:42 +00002470 if (sscanf((const char *) value, "%f",
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002471 &(v->value.f)) == 1) {
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00002472 *val = v;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002473 } else {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002474 xmlSchemaFreeValue(v);
2475 goto return1;
2476 }
2477 } else {
2478 goto error;
2479 }
2480 } else {
2481 v = xmlSchemaNewValue(XML_SCHEMAS_DOUBLE);
2482 if (v != NULL) {
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00002483 /*
2484 * TODO: sscanf seems not to give the correct
2485 * value for extremely high/low values.
2486 */
Daniel Veillardd0c9c322003-10-10 00:49:42 +00002487 if (sscanf((const char *) value, "%lf",
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002488 &(v->value.d)) == 1) {
2489 *val = v;
2490 } else {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002491 xmlSchemaFreeValue(v);
2492 goto return1;
2493 }
2494 } else {
2495 goto error;
2496 }
2497 }
2498 }
2499 goto return0;
Daniel Veillard70bcb0e2003-08-08 14:00:28 +00002500 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002501 case XML_SCHEMAS_BOOLEAN:{
2502 const xmlChar *cur = value;
2503
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002504 if (normOnTheFly) {
2505 while IS_WSP_BLANK_CH(*cur) cur++;
2506 if (*cur == '0') {
2507 ret = 0;
2508 cur++;
2509 } else if (*cur == '1') {
2510 ret = 1;
2511 cur++;
2512 } else if (*cur == 't') {
2513 cur++;
2514 if ((*cur++ == 'r') && (*cur++ == 'u') &&
2515 (*cur++ == 'e')) {
2516 ret = 1;
2517 } else
2518 goto return1;
2519 } else if (*cur == 'f') {
2520 cur++;
2521 if ((*cur++ == 'a') && (*cur++ == 'l') &&
2522 (*cur++ == 's') && (*cur++ == 'e')) {
2523 ret = 0;
2524 } else
2525 goto return1;
2526 }
2527 if (*cur != 0) {
2528 while IS_WSP_BLANK_CH(*cur) cur++;
2529 if (*cur != 0)
2530 goto return1;
2531 }
2532 } else {
2533 if ((cur[0] == '0') && (cur[1] == 0))
2534 ret = 0;
2535 else if ((cur[0] == '1') && (cur[1] == 0))
2536 ret = 1;
2537 else if ((cur[0] == 't') && (cur[1] == 'r')
2538 && (cur[2] == 'u') && (cur[3] == 'e')
2539 && (cur[4] == 0))
2540 ret = 1;
2541 else if ((cur[0] == 'f') && (cur[1] == 'a')
2542 && (cur[2] == 'l') && (cur[3] == 's')
2543 && (cur[4] == 'e') && (cur[5] == 0))
2544 ret = 0;
2545 else
2546 goto return1;
2547 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002548 if (val != NULL) {
2549 v = xmlSchemaNewValue(XML_SCHEMAS_BOOLEAN);
2550 if (v != NULL) {
2551 v->value.b = ret;
2552 *val = v;
2553 } else {
2554 goto error;
2555 }
2556 }
2557 goto return0;
2558 }
2559 case XML_SCHEMAS_TOKEN:{
2560 const xmlChar *cur = value;
2561
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002562 if (! normOnTheFly) {
2563 while (*cur != 0) {
2564 if ((*cur == 0xd) || (*cur == 0xa) || (*cur == 0x9)) {
2565 goto return1;
2566 } else if (*cur == ' ') {
2567 cur++;
2568 if (*cur == 0)
2569 goto return1;
2570 if (*cur == ' ')
2571 goto return1;
2572 } else {
2573 cur++;
2574 }
2575 }
2576 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002577 if (val != NULL) {
2578 v = xmlSchemaNewValue(XML_SCHEMAS_TOKEN);
2579 if (v != NULL) {
2580 v->value.str = xmlStrdup(value);
2581 *val = v;
2582 } else {
2583 goto error;
2584 }
2585 }
2586 goto return0;
2587 }
2588 case XML_SCHEMAS_LANGUAGE:
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002589 if (normOnTheFly) {
2590 norm = xmlSchemaCollapseString(value);
2591 if (norm != NULL)
2592 value = norm;
2593 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002594 if (xmlCheckLanguageID(value) == 1) {
2595 if (val != NULL) {
2596 v = xmlSchemaNewValue(XML_SCHEMAS_LANGUAGE);
2597 if (v != NULL) {
2598 v->value.str = xmlStrdup(value);
2599 *val = v;
2600 } else {
2601 goto error;
2602 }
2603 }
2604 goto return0;
2605 }
2606 goto return1;
2607 case XML_SCHEMAS_NMTOKEN:
2608 if (xmlValidateNMToken(value, 1) == 0) {
2609 if (val != NULL) {
2610 v = xmlSchemaNewValue(XML_SCHEMAS_NMTOKEN);
2611 if (v != NULL) {
2612 v->value.str = xmlStrdup(value);
2613 *val = v;
2614 } else {
2615 goto error;
2616 }
2617 }
2618 goto return0;
2619 }
2620 goto return1;
2621 case XML_SCHEMAS_NMTOKENS:
2622 ret = xmlSchemaValAtomicListNode(xmlSchemaTypeNmtokenDef,
2623 value, val, node);
2624 if (ret > 0)
2625 ret = 0;
2626 else
2627 ret = 1;
2628 goto done;
2629 case XML_SCHEMAS_NAME:
2630 ret = xmlValidateName(value, 1);
Daniel Veillarddf292f72005-01-16 19:00:15 +00002631 if ((ret == 0) && (val != NULL) && (value != NULL)) {
2632 v = xmlSchemaNewValue(XML_SCHEMAS_NAME);
2633 if (v != NULL) {
2634 const xmlChar *start = value, *end;
2635 while (IS_BLANK_CH(*start)) start++;
2636 end = start;
2637 while ((*end != 0) && (!IS_BLANK_CH(*end))) end++;
2638 v->value.str = xmlStrndup(start, end - start);
2639 *val = v;
2640 } else {
2641 goto error;
2642 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002643 }
2644 goto done;
2645 case XML_SCHEMAS_QNAME:{
Kasimier T. Buchcik1c720df2005-06-09 14:54:59 +00002646 const xmlChar *uri = NULL;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002647 xmlChar *local = NULL;
2648
2649 ret = xmlValidateQName(value, 1);
Kasimier T. Buchcik1c720df2005-06-09 14:54:59 +00002650 if (ret != 0)
2651 goto done;
2652 if (node != NULL) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002653 xmlChar *prefix;
Kasimier T. Buchcik1c720df2005-06-09 14:54:59 +00002654 xmlNsPtr ns;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002655
2656 local = xmlSplitQName2(value, &prefix);
Kasimier T. Buchcik1c720df2005-06-09 14:54:59 +00002657 ns = xmlSearchNs(node->doc, node, prefix);
2658 if ((ns == NULL) && (prefix != NULL)) {
2659 xmlFree(prefix);
2660 if (local != NULL)
2661 xmlFree(local);
2662 goto return1;
2663 }
2664 if (ns != NULL)
2665 uri = ns->href;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002666 if (prefix != NULL)
2667 xmlFree(prefix);
2668 }
Kasimier T. Buchcik1c720df2005-06-09 14:54:59 +00002669 if (val != NULL) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002670 v = xmlSchemaNewValue(XML_SCHEMAS_QNAME);
Kasimier T. Buchcik1c720df2005-06-09 14:54:59 +00002671 if (v == NULL) {
2672 if (local != NULL)
2673 xmlFree(local);
2674 goto error;
2675 }
2676 if (local != NULL)
2677 v->value.qname.name = local;
2678 else
2679 v->value.qname.name = xmlStrdup(value);
2680 if (uri != NULL)
2681 v->value.qname.uri = xmlStrdup(uri);
2682 *val = v;
2683 } else
2684 if (local != NULL)
2685 xmlFree(local);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002686 goto done;
2687 }
2688 case XML_SCHEMAS_NCNAME:
2689 ret = xmlValidateNCName(value, 1);
2690 if ((ret == 0) && (val != NULL)) {
2691 v = xmlSchemaNewValue(XML_SCHEMAS_NCNAME);
2692 if (v != NULL) {
2693 v->value.str = xmlStrdup(value);
2694 *val = v;
2695 } else {
2696 goto error;
2697 }
2698 }
2699 goto done;
2700 case XML_SCHEMAS_ID:
2701 ret = xmlValidateNCName(value, 1);
2702 if ((ret == 0) && (val != NULL)) {
2703 v = xmlSchemaNewValue(XML_SCHEMAS_ID);
2704 if (v != NULL) {
2705 v->value.str = xmlStrdup(value);
2706 *val = v;
2707 } else {
2708 goto error;
2709 }
2710 }
2711 if ((ret == 0) && (node != NULL) &&
2712 (node->type == XML_ATTRIBUTE_NODE)) {
2713 xmlAttrPtr attr = (xmlAttrPtr) node;
2714
2715 /*
2716 * NOTE: the IDness might have already be declared in the DTD
2717 */
2718 if (attr->atype != XML_ATTRIBUTE_ID) {
2719 xmlIDPtr res;
2720 xmlChar *strip;
2721
2722 strip = xmlSchemaStrip(value);
2723 if (strip != NULL) {
2724 res = xmlAddID(NULL, node->doc, strip, attr);
2725 xmlFree(strip);
2726 } else
2727 res = xmlAddID(NULL, node->doc, value, attr);
2728 if (res == NULL) {
2729 ret = 2;
2730 } else {
2731 attr->atype = XML_ATTRIBUTE_ID;
2732 }
2733 }
2734 }
2735 goto done;
2736 case XML_SCHEMAS_IDREF:
2737 ret = xmlValidateNCName(value, 1);
2738 if ((ret == 0) && (val != NULL)) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00002739 v = xmlSchemaNewValue(XML_SCHEMAS_IDREF);
2740 if (v == NULL)
2741 goto error;
2742 v->value.str = xmlStrdup(value);
2743 *val = v;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002744 }
2745 if ((ret == 0) && (node != NULL) &&
2746 (node->type == XML_ATTRIBUTE_NODE)) {
2747 xmlAttrPtr attr = (xmlAttrPtr) node;
2748 xmlChar *strip;
2749
2750 strip = xmlSchemaStrip(value);
2751 if (strip != NULL) {
2752 xmlAddRef(NULL, node->doc, strip, attr);
2753 xmlFree(strip);
2754 } else
2755 xmlAddRef(NULL, node->doc, value, attr);
2756 attr->atype = XML_ATTRIBUTE_IDREF;
2757 }
2758 goto done;
2759 case XML_SCHEMAS_IDREFS:
2760 ret = xmlSchemaValAtomicListNode(xmlSchemaTypeIdrefDef,
2761 value, val, node);
2762 if (ret < 0)
2763 ret = 2;
2764 else
2765 ret = 0;
2766 if ((ret == 0) && (node != NULL) &&
2767 (node->type == XML_ATTRIBUTE_NODE)) {
2768 xmlAttrPtr attr = (xmlAttrPtr) node;
2769
2770 attr->atype = XML_ATTRIBUTE_IDREFS;
2771 }
2772 goto done;
2773 case XML_SCHEMAS_ENTITY:{
2774 xmlChar *strip;
2775
2776 ret = xmlValidateNCName(value, 1);
2777 if ((node == NULL) || (node->doc == NULL))
2778 ret = 3;
2779 if (ret == 0) {
2780 xmlEntityPtr ent;
2781
2782 strip = xmlSchemaStrip(value);
2783 if (strip != NULL) {
2784 ent = xmlGetDocEntity(node->doc, strip);
2785 xmlFree(strip);
2786 } else {
2787 ent = xmlGetDocEntity(node->doc, value);
2788 }
2789 if ((ent == NULL) ||
2790 (ent->etype !=
2791 XML_EXTERNAL_GENERAL_UNPARSED_ENTITY))
2792 ret = 4;
2793 }
2794 if ((ret == 0) && (val != NULL)) {
2795 TODO;
2796 }
2797 if ((ret == 0) && (node != NULL) &&
2798 (node->type == XML_ATTRIBUTE_NODE)) {
2799 xmlAttrPtr attr = (xmlAttrPtr) node;
2800
2801 attr->atype = XML_ATTRIBUTE_ENTITY;
2802 }
2803 goto done;
2804 }
2805 case XML_SCHEMAS_ENTITIES:
2806 if ((node == NULL) || (node->doc == NULL))
2807 goto return3;
2808 ret = xmlSchemaValAtomicListNode(xmlSchemaTypeEntityDef,
2809 value, val, node);
2810 if (ret <= 0)
2811 ret = 1;
2812 else
2813 ret = 0;
2814 if ((ret == 0) && (node != NULL) &&
2815 (node->type == XML_ATTRIBUTE_NODE)) {
2816 xmlAttrPtr attr = (xmlAttrPtr) node;
2817
2818 attr->atype = XML_ATTRIBUTE_ENTITIES;
2819 }
2820 goto done;
2821 case XML_SCHEMAS_NOTATION:{
2822 xmlChar *uri = NULL;
2823 xmlChar *local = NULL;
2824
2825 ret = xmlValidateQName(value, 1);
2826 if ((ret == 0) && (node != NULL)) {
2827 xmlChar *prefix;
2828
2829 local = xmlSplitQName2(value, &prefix);
2830 if (prefix != NULL) {
2831 xmlNsPtr ns;
2832
2833 ns = xmlSearchNs(node->doc, node, prefix);
2834 if (ns == NULL)
2835 ret = 1;
2836 else if (val != NULL)
2837 uri = xmlStrdup(ns->href);
2838 }
2839 if ((local != NULL) && ((val == NULL) || (ret != 0)))
2840 xmlFree(local);
2841 if (prefix != NULL)
2842 xmlFree(prefix);
2843 }
2844 if ((node == NULL) || (node->doc == NULL))
2845 ret = 3;
2846 if (ret == 0) {
2847 ret = xmlValidateNotationUse(NULL, node->doc, value);
2848 if (ret == 1)
2849 ret = 0;
2850 else
2851 ret = 1;
2852 }
2853 if ((ret == 0) && (val != NULL)) {
2854 v = xmlSchemaNewValue(XML_SCHEMAS_NOTATION);
2855 if (v != NULL) {
2856 if (local != NULL)
2857 v->value.qname.name = local;
2858 else
2859 v->value.qname.name = xmlStrdup(value);
2860 if (uri != NULL)
2861 v->value.qname.uri = uri;
2862
2863 *val = v;
2864 } else {
2865 if (local != NULL)
2866 xmlFree(local);
2867 if (uri != NULL)
2868 xmlFree(uri);
2869 goto error;
2870 }
2871 }
2872 goto done;
2873 }
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002874 case XML_SCHEMAS_ANYURI:{
Daniel Veillard11c466a2004-03-14 12:20:15 +00002875 if (*value != 0) {
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002876 xmlURIPtr uri;
2877 if (normOnTheFly) {
2878 norm = xmlSchemaCollapseString(value);
2879 if (norm != NULL)
2880 value = norm;
2881 }
2882 uri = xmlParseURI((const char *) value);
Daniel Veillard11c466a2004-03-14 12:20:15 +00002883 if (uri == NULL)
2884 goto return1;
2885 xmlFreeURI(uri);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002886 }
Daniel Veillard11c466a2004-03-14 12:20:15 +00002887
2888 if (val != NULL) {
2889 v = xmlSchemaNewValue(XML_SCHEMAS_ANYURI);
2890 if (v == NULL)
2891 goto error;
2892 v->value.str = xmlStrdup(value);
2893 *val = v;
2894 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002895 goto return0;
2896 }
2897 case XML_SCHEMAS_HEXBINARY:{
Kasimier T. Buchcik8dd1e1b2005-06-09 13:14:38 +00002898 const xmlChar *cur = value, *start;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002899 xmlChar *base;
2900 int total, i = 0;
2901
Daniel Veillardf34a20e2004-08-31 08:42:17 +00002902 if (cur == NULL)
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002903 goto return1;
2904
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002905 if (normOnTheFly)
2906 while IS_WSP_BLANK_CH(*cur) cur++;
2907
Kasimier T. Buchcik8dd1e1b2005-06-09 13:14:38 +00002908 start = cur;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002909 while (((*cur >= '0') && (*cur <= '9')) ||
2910 ((*cur >= 'A') && (*cur <= 'F')) ||
2911 ((*cur >= 'a') && (*cur <= 'f'))) {
2912 i++;
2913 cur++;
2914 }
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002915 if (normOnTheFly)
2916 while IS_WSP_BLANK_CH(*cur) cur++;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002917
2918 if (*cur != 0)
2919 goto return1;
2920 if ((i % 2) != 0)
2921 goto return1;
2922
2923 if (val != NULL) {
2924
2925 v = xmlSchemaNewValue(XML_SCHEMAS_HEXBINARY);
2926 if (v == NULL)
2927 goto error;
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002928 /*
2929 * Copy only the normalized piece.
2930 * CRITICAL TODO: Check this.
2931 */
Kasimier T. Buchcik8dd1e1b2005-06-09 13:14:38 +00002932 cur = xmlStrndup(start, i);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002933 if (cur == NULL) {
Daniel Veillardd0c9c322003-10-10 00:49:42 +00002934 xmlSchemaTypeErrMemory(node, "allocating hexbin data");
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002935 xmlFree(v);
2936 goto return1;
2937 }
2938
2939 total = i / 2; /* number of octets */
2940
2941 base = (xmlChar *) cur;
2942 while (i-- > 0) {
2943 if (*base >= 'a')
2944 *base = *base - ('a' - 'A');
2945 base++;
2946 }
2947
2948 v->value.hex.str = (xmlChar *) cur;
2949 v->value.hex.total = total;
2950 *val = v;
2951 }
2952 goto return0;
2953 }
2954 case XML_SCHEMAS_BASE64BINARY:{
2955 /* ISSUE:
2956 *
2957 * Ignore all stray characters? (yes, currently)
2958 * Worry about long lines? (no, currently)
2959 *
2960 * rfc2045.txt:
2961 *
2962 * "The encoded output stream must be represented in lines of
2963 * no more than 76 characters each. All line breaks or other
2964 * characters not found in Table 1 must be ignored by decoding
2965 * software. In base64 data, characters other than those in
2966 * Table 1, line breaks, and other white space probably
2967 * indicate a transmission error, about which a warning
2968 * message or even a message rejection might be appropriate
2969 * under some circumstances." */
2970 const xmlChar *cur = value;
2971 xmlChar *base;
2972 int total, i = 0, pad = 0;
2973
2974 if (cur == NULL)
2975 goto return1;
2976
2977 for (; *cur; ++cur) {
2978 int decc;
2979
2980 decc = _xmlSchemaBase64Decode(*cur);
2981 if (decc < 0) ;
2982 else if (decc < 64)
2983 i++;
2984 else
2985 break;
2986 }
2987 for (; *cur; ++cur) {
2988 int decc;
2989
2990 decc = _xmlSchemaBase64Decode(*cur);
2991 if (decc < 0) ;
2992 else if (decc < 64)
2993 goto return1;
2994 if (decc == 64)
2995 pad++;
2996 }
2997
2998 /* rfc2045.txt: "Special processing is performed if fewer than
2999 * 24 bits are available at the end of the data being encoded.
3000 * A full encoding quantum is always completed at the end of a
3001 * body. When fewer than 24 input bits are available in an
3002 * input group, zero bits are added (on the right) to form an
3003 * integral number of 6-bit groups. Padding at the end of the
3004 * data is performed using the "=" character. Since all
3005 * base64 input is an integral number of octets, only the
3006 * following cases can arise: (1) the final quantum of
3007 * encoding input is an integral multiple of 24 bits; here,
3008 * the final unit of encoded output will be an integral
3009 * multiple ofindent: Standard input:701: Warning:old style
3010 * assignment ambiguity in "=*". Assuming "= *" 4 characters
3011 * with no "=" padding, (2) the final
3012 * quantum of encoding input is exactly 8 bits; here, the
3013 * final unit of encoded output will be two characters
3014 * followed by two "=" padding characters, or (3) the final
3015 * quantum of encoding input is exactly 16 bits; here, the
3016 * final unit of encoded output will be three characters
3017 * followed by one "=" padding character." */
3018
3019 total = 3 * (i / 4);
3020 if (pad == 0) {
3021 if (i % 4 != 0)
3022 goto return1;
3023 } else if (pad == 1) {
3024 int decc;
3025
3026 if (i % 4 != 3)
3027 goto return1;
3028 for (decc = _xmlSchemaBase64Decode(*cur);
3029 (decc < 0) || (decc > 63);
3030 decc = _xmlSchemaBase64Decode(*cur))
3031 --cur;
3032 /* 16bits in 24bits means 2 pad bits: nnnnnn nnmmmm mmmm00*/
3033 /* 00111100 -> 0x3c */
3034 if (decc & ~0x3c)
3035 goto return1;
3036 total += 2;
3037 } else if (pad == 2) {
3038 int decc;
3039
3040 if (i % 4 != 2)
3041 goto return1;
3042 for (decc = _xmlSchemaBase64Decode(*cur);
3043 (decc < 0) || (decc > 63);
3044 decc = _xmlSchemaBase64Decode(*cur))
3045 --cur;
3046 /* 8bits in 12bits means 4 pad bits: nnnnnn nn0000 */
3047 /* 00110000 -> 0x30 */
3048 if (decc & ~0x30)
3049 goto return1;
3050 total += 1;
3051 } else
3052 goto return1;
3053
3054 if (val != NULL) {
3055 v = xmlSchemaNewValue(XML_SCHEMAS_BASE64BINARY);
3056 if (v == NULL)
3057 goto error;
3058 base =
3059 (xmlChar *) xmlMallocAtomic((i + pad + 1) *
3060 sizeof(xmlChar));
3061 if (base == NULL) {
Daniel Veillardd0c9c322003-10-10 00:49:42 +00003062 xmlSchemaTypeErrMemory(node, "allocating base64 data");
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003063 xmlFree(v);
3064 goto return1;
3065 }
3066 v->value.base64.str = base;
3067 for (cur = value; *cur; ++cur)
3068 if (_xmlSchemaBase64Decode(*cur) >= 0) {
3069 *base = *cur;
3070 ++base;
3071 }
3072 *base = 0;
3073 v->value.base64.total = total;
3074 *val = v;
3075 }
3076 goto return0;
3077 }
Daniel Veillarde637c4a2003-03-30 21:10:09 +00003078 case XML_SCHEMAS_INTEGER:
3079 case XML_SCHEMAS_PINTEGER:
3080 case XML_SCHEMAS_NPINTEGER:
Daniel Veillardb6c7f412003-03-29 16:41:55 +00003081 case XML_SCHEMAS_NINTEGER:
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003082 case XML_SCHEMAS_NNINTEGER:{
3083 const xmlChar *cur = value;
3084 unsigned long lo, mi, hi;
William M. Brackec3b4b72005-03-15 15:50:17 +00003085 int sign = 0;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003086
3087 if (cur == NULL)
3088 goto return1;
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003089 if (normOnTheFly)
3090 while IS_WSP_BLANK_CH(*cur) cur++;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003091 if (*cur == '-') {
3092 sign = 1;
3093 cur++;
3094 } else if (*cur == '+')
3095 cur++;
William M. Brackec3b4b72005-03-15 15:50:17 +00003096 ret = xmlSchemaParseUInt(&cur, &lo, &mi, &hi);
3097 if (ret == -1)
3098 goto return1;
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003099 if (normOnTheFly)
3100 while IS_WSP_BLANK_CH(*cur) cur++;
William M. Brackec3b4b72005-03-15 15:50:17 +00003101 if (*cur != 0)
3102 goto return1;
Daniel Veillard01fa6152004-06-29 17:04:39 +00003103 if (type->builtInType == XML_SCHEMAS_NPINTEGER) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003104 if ((sign == 0) &&
3105 ((hi != 0) || (mi != 0) || (lo != 0)))
3106 goto return1;
Daniel Veillard01fa6152004-06-29 17:04:39 +00003107 } else if (type->builtInType == XML_SCHEMAS_PINTEGER) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003108 if (sign == 1)
3109 goto return1;
3110 if ((hi == 0) && (mi == 0) && (lo == 0))
3111 goto return1;
Daniel Veillard01fa6152004-06-29 17:04:39 +00003112 } else if (type->builtInType == XML_SCHEMAS_NINTEGER) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003113 if (sign == 0)
3114 goto return1;
3115 if ((hi == 0) && (mi == 0) && (lo == 0))
3116 goto return1;
Daniel Veillard01fa6152004-06-29 17:04:39 +00003117 } else if (type->builtInType == XML_SCHEMAS_NNINTEGER) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003118 if ((sign == 1) &&
3119 ((hi != 0) || (mi != 0) || (lo != 0)))
3120 goto return1;
3121 }
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00003122 if (val != NULL) {
Daniel Veillard01fa6152004-06-29 17:04:39 +00003123 v = xmlSchemaNewValue(type->builtInType);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003124 if (v != NULL) {
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00003125 if (ret == 0)
3126 ret++;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003127 v->value.decimal.lo = lo;
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00003128 v->value.decimal.mi = mi;
3129 v->value.decimal.hi = hi;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003130 v->value.decimal.sign = sign;
3131 v->value.decimal.frac = 0;
William M. Brackec3b4b72005-03-15 15:50:17 +00003132 v->value.decimal.total = ret;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003133 *val = v;
3134 }
3135 }
3136 goto return0;
3137 }
Daniel Veillarde637c4a2003-03-30 21:10:09 +00003138 case XML_SCHEMAS_LONG:
3139 case XML_SCHEMAS_BYTE:
3140 case XML_SCHEMAS_SHORT:
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003141 case XML_SCHEMAS_INT:{
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00003142 const xmlChar *cur = value;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003143 unsigned long lo, mi, hi;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003144 int sign = 0;
3145
3146 if (cur == NULL)
3147 goto return1;
3148 if (*cur == '-') {
3149 sign = 1;
3150 cur++;
3151 } else if (*cur == '+')
3152 cur++;
William M. Brackec3b4b72005-03-15 15:50:17 +00003153 ret = xmlSchemaParseUInt(&cur, &lo, &mi, &hi);
3154 if (ret < 0)
3155 goto return1;
3156 if (*cur != 0)
3157 goto return1;
Daniel Veillard01fa6152004-06-29 17:04:39 +00003158 if (type->builtInType == XML_SCHEMAS_LONG) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003159 if (hi >= 922) {
3160 if (hi > 922)
3161 goto return1;
3162 if (mi >= 33720368) {
3163 if (mi > 33720368)
3164 goto return1;
3165 if ((sign == 0) && (lo > 54775807))
3166 goto return1;
3167 if ((sign == 1) && (lo > 54775808))
3168 goto return1;
3169 }
3170 }
Daniel Veillard01fa6152004-06-29 17:04:39 +00003171 } else if (type->builtInType == XML_SCHEMAS_INT) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003172 if (hi != 0)
3173 goto return1;
3174 if (mi >= 21) {
3175 if (mi > 21)
3176 goto return1;
3177 if ((sign == 0) && (lo > 47483647))
3178 goto return1;
3179 if ((sign == 1) && (lo > 47483648))
3180 goto return1;
3181 }
Daniel Veillard01fa6152004-06-29 17:04:39 +00003182 } else if (type->builtInType == XML_SCHEMAS_SHORT) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003183 if ((mi != 0) || (hi != 0))
3184 goto return1;
3185 if ((sign == 1) && (lo > 32768))
3186 goto return1;
3187 if ((sign == 0) && (lo > 32767))
3188 goto return1;
Daniel Veillard01fa6152004-06-29 17:04:39 +00003189 } else if (type->builtInType == XML_SCHEMAS_BYTE) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003190 if ((mi != 0) || (hi != 0))
3191 goto return1;
3192 if ((sign == 1) && (lo > 128))
3193 goto return1;
3194 if ((sign == 0) && (lo > 127))
3195 goto return1;
3196 }
3197 if (val != NULL) {
Daniel Veillard01fa6152004-06-29 17:04:39 +00003198 v = xmlSchemaNewValue(type->builtInType);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003199 if (v != NULL) {
3200 v->value.decimal.lo = lo;
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00003201 v->value.decimal.mi = mi;
3202 v->value.decimal.hi = hi;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003203 v->value.decimal.sign = sign;
3204 v->value.decimal.frac = 0;
William M. Brackec3b4b72005-03-15 15:50:17 +00003205 v->value.decimal.total = ret;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003206 *val = v;
3207 }
3208 }
3209 goto return0;
3210 }
Daniel Veillardb6c7f412003-03-29 16:41:55 +00003211 case XML_SCHEMAS_UINT:
Daniel Veillardb6c7f412003-03-29 16:41:55 +00003212 case XML_SCHEMAS_ULONG:
Daniel Veillardb6c7f412003-03-29 16:41:55 +00003213 case XML_SCHEMAS_USHORT:
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003214 case XML_SCHEMAS_UBYTE:{
3215 const xmlChar *cur = value;
3216 unsigned long lo, mi, hi;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003217
3218 if (cur == NULL)
3219 goto return1;
William M. Brackec3b4b72005-03-15 15:50:17 +00003220 ret = xmlSchemaParseUInt(&cur, &lo, &mi, &hi);
3221 if (ret < 0)
3222 goto return1;
3223 if (*cur != 0)
3224 goto return1;
Daniel Veillard01fa6152004-06-29 17:04:39 +00003225 if (type->builtInType == XML_SCHEMAS_ULONG) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003226 if (hi >= 1844) {
3227 if (hi > 1844)
3228 goto return1;
3229 if (mi >= 67440737) {
3230 if (mi > 67440737)
3231 goto return1;
3232 if (lo > 9551615)
3233 goto return1;
3234 }
3235 }
Daniel Veillard01fa6152004-06-29 17:04:39 +00003236 } else if (type->builtInType == XML_SCHEMAS_UINT) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003237 if (hi != 0)
3238 goto return1;
3239 if (mi >= 42) {
3240 if (mi > 42)
3241 goto return1;
3242 if (lo > 94967295)
3243 goto return1;
3244 }
Daniel Veillard01fa6152004-06-29 17:04:39 +00003245 } else if (type->builtInType == XML_SCHEMAS_USHORT) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003246 if ((mi != 0) || (hi != 0))
3247 goto return1;
3248 if (lo > 65535)
3249 goto return1;
Daniel Veillard01fa6152004-06-29 17:04:39 +00003250 } else if (type->builtInType == XML_SCHEMAS_UBYTE) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003251 if ((mi != 0) || (hi != 0))
3252 goto return1;
3253 if (lo > 255)
3254 goto return1;
3255 }
3256 if (val != NULL) {
Daniel Veillard01fa6152004-06-29 17:04:39 +00003257 v = xmlSchemaNewValue(type->builtInType);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003258 if (v != NULL) {
3259 v->value.decimal.lo = lo;
3260 v->value.decimal.mi = mi;
3261 v->value.decimal.hi = hi;
3262 v->value.decimal.sign = 0;
3263 v->value.decimal.frac = 0;
William M. Brackec3b4b72005-03-15 15:50:17 +00003264 v->value.decimal.total = ret;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003265 *val = v;
3266 }
3267 }
3268 goto return0;
3269 }
Daniel Veillardb6c7f412003-03-29 16:41:55 +00003270 }
3271
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003272 done:
3273 if (norm != NULL)
3274 xmlFree(norm);
3275 return (ret);
3276 return3:
3277 if (norm != NULL)
3278 xmlFree(norm);
3279 return (3);
3280 return1:
3281 if (norm != NULL)
3282 xmlFree(norm);
3283 return (1);
3284 return0:
3285 if (norm != NULL)
3286 xmlFree(norm);
3287 return (0);
3288 error:
3289 if (norm != NULL)
3290 xmlFree(norm);
3291 return (-1);
Daniel Veillardb6c7f412003-03-29 16:41:55 +00003292}
3293
3294/**
Daniel Veillardc3da18a2003-03-18 00:31:04 +00003295 * xmlSchemaValPredefTypeNode:
Daniel Veillard4255d502002-04-16 15:50:10 +00003296 * @type: the predefined type
3297 * @value: the value to check
3298 * @val: the return computed value
Daniel Veillardc3da18a2003-03-18 00:31:04 +00003299 * @node: the node containing the value
Daniel Veillard4255d502002-04-16 15:50:10 +00003300 *
3301 * Check that a value conforms to the lexical space of the predefined type.
3302 * if true a value is computed and returned in @val.
3303 *
3304 * Returns 0 if this validates, a positive error code number otherwise
3305 * and -1 in case of internal or API error.
3306 */
3307int
Daniel Veillardc3da18a2003-03-18 00:31:04 +00003308xmlSchemaValPredefTypeNode(xmlSchemaTypePtr type, const xmlChar *value,
3309 xmlSchemaValPtr *val, xmlNodePtr node) {
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003310 return(xmlSchemaValAtomicType(type, value, val, node, 0,
3311 XML_SCHEMA_WHITESPACE_UNKNOWN, 1, 1, 0));
Daniel Veillard4255d502002-04-16 15:50:10 +00003312}
3313
3314/**
Daniel Veillardc0826a72004-08-10 14:17:33 +00003315 * xmlSchemaValPredefTypeNodeNoNorm:
3316 * @type: the predefined type
3317 * @value: the value to check
3318 * @val: the return computed value
3319 * @node: the node containing the value
3320 *
3321 * Check that a value conforms to the lexical space of the predefined type.
3322 * if true a value is computed and returned in @val.
3323 * This one does apply any normalization to the value.
3324 *
3325 * Returns 0 if this validates, a positive error code number otherwise
3326 * and -1 in case of internal or API error.
3327 */
3328int
3329xmlSchemaValPredefTypeNodeNoNorm(xmlSchemaTypePtr type, const xmlChar *value,
3330 xmlSchemaValPtr *val, xmlNodePtr node) {
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003331 return(xmlSchemaValAtomicType(type, value, val, node, 1,
3332 XML_SCHEMA_WHITESPACE_UNKNOWN, 1, 0, 1));
Daniel Veillardc0826a72004-08-10 14:17:33 +00003333}
3334
3335/**
Daniel Veillardc3da18a2003-03-18 00:31:04 +00003336 * xmlSchemaValidatePredefinedType:
3337 * @type: the predefined type
3338 * @value: the value to check
3339 * @val: the return computed value
3340 *
3341 * Check that a value conforms to the lexical space of the predefined type.
3342 * if true a value is computed and returned in @val.
3343 *
3344 * Returns 0 if this validates, a positive error code number otherwise
3345 * and -1 in case of internal or API error.
3346 */
3347int
3348xmlSchemaValidatePredefinedType(xmlSchemaTypePtr type, const xmlChar *value,
3349 xmlSchemaValPtr *val) {
3350 return(xmlSchemaValPredefTypeNode(type, value, val, NULL));
3351}
3352
3353/**
Daniel Veillard4255d502002-04-16 15:50:10 +00003354 * xmlSchemaCompareDecimals:
3355 * @x: a first decimal value
3356 * @y: a second decimal value
3357 *
3358 * Compare 2 decimals
3359 *
3360 * Returns -1 if x < y, 0 if x == y, 1 if x > y and -2 in case of error
3361 */
3362static int
3363xmlSchemaCompareDecimals(xmlSchemaValPtr x, xmlSchemaValPtr y)
3364{
3365 xmlSchemaValPtr swp;
William M. Brack273670f2005-03-11 15:55:14 +00003366 int order = 1, integx, integy, dlen;
3367 unsigned long hi, mi, lo;
Daniel Veillard4255d502002-04-16 15:50:10 +00003368
William M. Brack273670f2005-03-11 15:55:14 +00003369 /*
3370 * First test: If x is -ve and not zero
3371 */
Daniel Veillarde637c4a2003-03-30 21:10:09 +00003372 if ((x->value.decimal.sign) &&
3373 ((x->value.decimal.lo != 0) ||
3374 (x->value.decimal.mi != 0) ||
3375 (x->value.decimal.hi != 0))) {
William M. Brack273670f2005-03-11 15:55:14 +00003376 /*
3377 * Then if y is -ve and not zero reverse the compare
3378 */
Daniel Veillarde637c4a2003-03-30 21:10:09 +00003379 if ((y->value.decimal.sign) &&
3380 ((y->value.decimal.lo != 0) ||
3381 (y->value.decimal.mi != 0) ||
3382 (y->value.decimal.hi != 0)))
Daniel Veillard80b19092003-03-28 13:29:53 +00003383 order = -1;
William M. Brack273670f2005-03-11 15:55:14 +00003384 /*
3385 * Otherwise (y >= 0) we have the answer
3386 */
Daniel Veillard80b19092003-03-28 13:29:53 +00003387 else
3388 return (-1);
William M. Brack273670f2005-03-11 15:55:14 +00003389 /*
3390 * If x is not -ve and y is -ve we have the answer
3391 */
Daniel Veillarde637c4a2003-03-30 21:10:09 +00003392 } else if ((y->value.decimal.sign) &&
3393 ((y->value.decimal.lo != 0) ||
3394 (y->value.decimal.mi != 0) ||
3395 (y->value.decimal.hi != 0))) {
Daniel Veillard4255d502002-04-16 15:50:10 +00003396 return (1);
Daniel Veillard80b19092003-03-28 13:29:53 +00003397 }
William M. Brack273670f2005-03-11 15:55:14 +00003398 /*
3399 * If it's not simply determined by a difference in sign,
3400 * then we need to compare the actual values of the two nums.
3401 * To do this, we start by looking at the integral parts.
3402 * If the number of integral digits differ, then we have our
3403 * answer.
3404 */
3405 integx = x->value.decimal.total - x->value.decimal.frac;
3406 integy = y->value.decimal.total - y->value.decimal.frac;
3407 if (integx > integy)
3408 return order;
3409 else if (integy > integx)
3410 return -order;
3411 /*
3412 * If the number of integral digits is the same for both numbers,
3413 * then things get a little more complicated. We need to "normalize"
3414 * the numbers in order to properly compare them. To do this, we
3415 * look at the total length of each number (length => number of
3416 * significant digits), and divide the "shorter" by 10 (decreasing
3417 * the length) until they are of equal length.
3418 */
3419 dlen = x->value.decimal.total - y->value.decimal.total;
3420 if (dlen < 0) { /* y has more digits than x */
3421 swp = x;
3422 hi = y->value.decimal.hi;
3423 mi = y->value.decimal.mi;
3424 lo = y->value.decimal.lo;
3425 dlen = -dlen;
3426 order = -order;
3427 } else { /* x has more digits than y */
3428 swp = y;
3429 hi = x->value.decimal.hi;
3430 mi = x->value.decimal.mi;
3431 lo = x->value.decimal.lo;
Daniel Veillard4255d502002-04-16 15:50:10 +00003432 }
William M. Brack273670f2005-03-11 15:55:14 +00003433 while (dlen > 8) { /* in effect, right shift by 10**8 */
3434 lo = mi;
3435 mi = hi;
3436 hi = 0;
3437 dlen -= 8;
Daniel Veillard4255d502002-04-16 15:50:10 +00003438 }
William M. Brack273670f2005-03-11 15:55:14 +00003439 while (dlen > 0) {
3440 unsigned long rem1, rem2;
3441 rem1 = (hi % 10) * 100000000L;
3442 hi = hi / 10;
3443 rem2 = (mi % 10) * 100000000L;
3444 mi = (mi + rem1) / 10;
3445 lo = (lo + rem2) / 10;
3446 dlen--;
3447 }
3448 if (hi > swp->value.decimal.hi) {
3449 return order;
3450 } else if (hi == swp->value.decimal.hi) {
3451 if (mi > swp->value.decimal.mi) {
3452 return order;
3453 } else if (mi == swp->value.decimal.mi) {
3454 if (lo > swp->value.decimal.lo) {
3455 return order;
3456 } else if (lo == swp->value.decimal.lo) {
3457 if (x->value.decimal.total == y->value.decimal.total) {
3458 return 0;
3459 } else {
3460 return order;
3461 }
3462 }
3463 }
3464 }
3465 return -order;
Daniel Veillard4255d502002-04-16 15:50:10 +00003466}
3467
3468/**
Daniel Veillard070803b2002-05-03 07:29:38 +00003469 * xmlSchemaCompareDurations:
3470 * @x: a first duration value
3471 * @y: a second duration value
3472 *
3473 * Compare 2 durations
3474 *
3475 * Returns -1 if x < y, 0 if x == y, 1 if x > y, 2 if x <> y, and -2 in
3476 * case of error
3477 */
3478static int
3479xmlSchemaCompareDurations(xmlSchemaValPtr x, xmlSchemaValPtr y)
3480{
3481 long carry, mon, day;
3482 double sec;
Daniel Veillard80b19092003-03-28 13:29:53 +00003483 int invert = 1;
3484 long xmon, xday, myear, minday, maxday;
Daniel Veillard070803b2002-05-03 07:29:38 +00003485 static const long dayRange [2][12] = {
3486 { 0, 28, 59, 89, 120, 150, 181, 212, 242, 273, 303, 334, },
3487 { 0, 31, 62, 92, 123, 153, 184, 215, 245, 276, 306, 337} };
3488
3489 if ((x == NULL) || (y == NULL))
Daniel Veillard5a872412002-05-22 06:40:27 +00003490 return -2;
Daniel Veillard070803b2002-05-03 07:29:38 +00003491
3492 /* months */
3493 mon = x->value.dur.mon - y->value.dur.mon;
3494
3495 /* seconds */
3496 sec = x->value.dur.sec - y->value.dur.sec;
3497 carry = (long)sec / SECS_PER_DAY;
3498 sec -= (double)(carry * SECS_PER_DAY);
3499
3500 /* days */
3501 day = x->value.dur.day - y->value.dur.day + carry;
3502
3503 /* easy test */
3504 if (mon == 0) {
3505 if (day == 0)
3506 if (sec == 0.0)
3507 return 0;
3508 else if (sec < 0.0)
3509 return -1;
3510 else
3511 return 1;
3512 else if (day < 0)
3513 return -1;
3514 else
3515 return 1;
3516 }
3517
3518 if (mon > 0) {
3519 if ((day >= 0) && (sec >= 0.0))
3520 return 1;
3521 else {
3522 xmon = mon;
3523 xday = -day;
3524 }
3525 } else if ((day <= 0) && (sec <= 0.0)) {
3526 return -1;
3527 } else {
Daniel Veillard80b19092003-03-28 13:29:53 +00003528 invert = -1;
Daniel Veillard070803b2002-05-03 07:29:38 +00003529 xmon = -mon;
3530 xday = day;
3531 }
3532
3533 myear = xmon / 12;
Daniel Veillard80b19092003-03-28 13:29:53 +00003534 if (myear == 0) {
3535 minday = 0;
3536 maxday = 0;
3537 } else {
3538 maxday = 366 * ((myear + 3) / 4) +
3539 365 * ((myear - 1) % 4);
3540 minday = maxday - 1;
3541 }
3542
Daniel Veillard070803b2002-05-03 07:29:38 +00003543 xmon = xmon % 12;
3544 minday += dayRange[0][xmon];
3545 maxday += dayRange[1][xmon];
3546
Daniel Veillard80b19092003-03-28 13:29:53 +00003547 if ((maxday == minday) && (maxday == xday))
3548 return(0); /* can this really happen ? */
Daniel Veillard070803b2002-05-03 07:29:38 +00003549 if (maxday < xday)
Daniel Veillard80b19092003-03-28 13:29:53 +00003550 return(-invert);
3551 if (minday > xday)
3552 return(invert);
Daniel Veillard070803b2002-05-03 07:29:38 +00003553
3554 /* indeterminate */
Daniel Veillard5a872412002-05-22 06:40:27 +00003555 return 2;
3556}
3557
3558/*
3559 * macros for adding date/times and durations
3560 */
3561#define FQUOTIENT(a,b) (floor(((double)a/(double)b)))
3562#define MODULO(a,b) (a - FQUOTIENT(a,b) * b)
3563#define FQUOTIENT_RANGE(a,low,high) (FQUOTIENT((a-low),(high-low)))
3564#define MODULO_RANGE(a,low,high) ((MODULO((a-low),(high-low)))+low)
3565
3566/**
Daniel Veillard669adfc2004-05-29 20:12:46 +00003567 * xmlSchemaDupVal:
3568 * @v: the #xmlSchemaValPtr value to duplicate
3569 *
3570 * Makes a copy of @v. The calling program is responsible for freeing
3571 * the returned value.
3572 *
3573 * returns a pointer to a duplicated #xmlSchemaValPtr or NULL if error.
3574 */
3575static xmlSchemaValPtr
3576xmlSchemaDupVal (xmlSchemaValPtr v)
3577{
3578 xmlSchemaValPtr ret = xmlSchemaNewValue(v->type);
3579 if (ret == NULL)
3580 return NULL;
3581
3582 memcpy(ret, v, sizeof(xmlSchemaVal));
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003583 ret->next = NULL;
Daniel Veillard669adfc2004-05-29 20:12:46 +00003584 return ret;
3585}
3586
3587/**
Kasimier T. Buchcik285ebab2005-03-04 18:04:59 +00003588 * xmlSchemaCopyValue:
3589 * @val: the precomputed value to be copied
3590 *
3591 * Copies the precomputed value. This duplicates any string within.
3592 *
3593 * Returns the copy or NULL if a copy for a data-type is not implemented.
3594 */
3595xmlSchemaValPtr
3596xmlSchemaCopyValue(xmlSchemaValPtr val)
3597{
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003598 xmlSchemaValPtr ret = NULL, prev = NULL, cur;
Kasimier T. Buchcik285ebab2005-03-04 18:04:59 +00003599
Kasimier T. Buchcik285ebab2005-03-04 18:04:59 +00003600 /*
3601 * Copy the string values.
3602 */
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003603 while (val != NULL) {
3604 switch (val->type) {
3605 case XML_SCHEMAS_ANYTYPE:
3606 case XML_SCHEMAS_IDREFS:
3607 case XML_SCHEMAS_ENTITIES:
3608 case XML_SCHEMAS_NMTOKENS:
3609 xmlSchemaFreeValue(ret);
3610 return (NULL);
3611 case XML_SCHEMAS_ANYSIMPLETYPE:
3612 case XML_SCHEMAS_STRING:
3613 case XML_SCHEMAS_NORMSTRING:
3614 case XML_SCHEMAS_TOKEN:
3615 case XML_SCHEMAS_LANGUAGE:
3616 case XML_SCHEMAS_NAME:
3617 case XML_SCHEMAS_NCNAME:
3618 case XML_SCHEMAS_ID:
3619 case XML_SCHEMAS_IDREF:
3620 case XML_SCHEMAS_ENTITY:
3621 case XML_SCHEMAS_NMTOKEN:
3622 case XML_SCHEMAS_ANYURI:
3623 cur = xmlSchemaDupVal(val);
3624 if (val->value.str != NULL)
3625 cur->value.str = xmlStrdup(BAD_CAST val->value.str);
3626 break;
3627 case XML_SCHEMAS_QNAME:
3628 case XML_SCHEMAS_NOTATION:
3629 cur = xmlSchemaDupVal(val);
3630 if (val->value.qname.name != NULL)
3631 cur->value.qname.name =
Kasimier T. Buchcik285ebab2005-03-04 18:04:59 +00003632 xmlStrdup(BAD_CAST val->value.qname.name);
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003633 if (val->value.qname.uri != NULL)
3634 cur->value.qname.uri =
Kasimier T. Buchcik285ebab2005-03-04 18:04:59 +00003635 xmlStrdup(BAD_CAST val->value.qname.uri);
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003636 break;
3637 case XML_SCHEMAS_HEXBINARY:
3638 cur = xmlSchemaDupVal(val);
3639 if (val->value.hex.str != NULL)
3640 cur->value.hex.str = xmlStrdup(BAD_CAST val->value.hex.str);
3641 break;
3642 case XML_SCHEMAS_BASE64BINARY:
3643 cur = xmlSchemaDupVal(val);
3644 if (val->value.base64.str != NULL)
3645 cur->value.base64.str =
Kasimier T. Buchcik285ebab2005-03-04 18:04:59 +00003646 xmlStrdup(BAD_CAST val->value.base64.str);
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003647 break;
3648 default:
3649 cur = xmlSchemaDupVal(val);
3650 break;
3651 }
3652 if (ret == NULL)
3653 ret = cur;
3654 else
3655 prev->next = cur;
3656 prev = cur;
3657 val = val->next;
Kasimier T. Buchcik285ebab2005-03-04 18:04:59 +00003658 }
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003659 return (ret);
Kasimier T. Buchcik285ebab2005-03-04 18:04:59 +00003660}
3661
3662/**
Daniel Veillard5a872412002-05-22 06:40:27 +00003663 * _xmlSchemaDateAdd:
3664 * @dt: an #xmlSchemaValPtr
3665 * @dur: an #xmlSchemaValPtr of type #XS_DURATION
3666 *
3667 * Compute a new date/time from @dt and @dur. This function assumes @dt
3668 * is either #XML_SCHEMAS_DATETIME, #XML_SCHEMAS_DATE, #XML_SCHEMAS_GYEARMONTH,
Daniel Veillard669adfc2004-05-29 20:12:46 +00003669 * or #XML_SCHEMAS_GYEAR. The returned #xmlSchemaVal is the same type as
3670 * @dt. The calling program is responsible for freeing the returned value.
Daniel Veillard5a872412002-05-22 06:40:27 +00003671 *
Daniel Veillard669adfc2004-05-29 20:12:46 +00003672 * Returns a pointer to a new #xmlSchemaVal or NULL if error.
Daniel Veillard5a872412002-05-22 06:40:27 +00003673 */
3674static xmlSchemaValPtr
3675_xmlSchemaDateAdd (xmlSchemaValPtr dt, xmlSchemaValPtr dur)
3676{
Daniel Veillard669adfc2004-05-29 20:12:46 +00003677 xmlSchemaValPtr ret, tmp;
Daniel Veillard5a872412002-05-22 06:40:27 +00003678 long carry, tempdays, temp;
3679 xmlSchemaValDatePtr r, d;
3680 xmlSchemaValDurationPtr u;
3681
3682 if ((dt == NULL) || (dur == NULL))
3683 return NULL;
3684
3685 ret = xmlSchemaNewValue(dt->type);
3686 if (ret == NULL)
3687 return NULL;
3688
Daniel Veillard669adfc2004-05-29 20:12:46 +00003689 /* make a copy so we don't alter the original value */
3690 tmp = xmlSchemaDupVal(dt);
3691 if (tmp == NULL) {
3692 xmlSchemaFreeValue(ret);
3693 return NULL;
3694 }
3695
Daniel Veillard5a872412002-05-22 06:40:27 +00003696 r = &(ret->value.date);
Daniel Veillard669adfc2004-05-29 20:12:46 +00003697 d = &(tmp->value.date);
Daniel Veillard5a872412002-05-22 06:40:27 +00003698 u = &(dur->value.dur);
3699
3700 /* normalization */
3701 if (d->mon == 0)
3702 d->mon = 1;
3703
3704 /* normalize for time zone offset */
3705 u->sec -= (d->tzo * 60);
3706 d->tzo = 0;
3707
3708 /* normalization */
3709 if (d->day == 0)
3710 d->day = 1;
3711
3712 /* month */
3713 carry = d->mon + u->mon;
Daniel Veillardebe25d42004-03-25 09:35:49 +00003714 r->mon = (unsigned int) MODULO_RANGE(carry, 1, 13);
3715 carry = (long) FQUOTIENT_RANGE(carry, 1, 13);
Daniel Veillard5a872412002-05-22 06:40:27 +00003716
3717 /* year (may be modified later) */
3718 r->year = d->year + carry;
3719 if (r->year == 0) {
3720 if (d->year > 0)
3721 r->year--;
3722 else
3723 r->year++;
3724 }
3725
3726 /* time zone */
3727 r->tzo = d->tzo;
3728 r->tz_flag = d->tz_flag;
3729
3730 /* seconds */
3731 r->sec = d->sec + u->sec;
Daniel Veillardebe25d42004-03-25 09:35:49 +00003732 carry = (long) FQUOTIENT((long)r->sec, 60);
Daniel Veillard5a872412002-05-22 06:40:27 +00003733 if (r->sec != 0.0) {
3734 r->sec = MODULO(r->sec, 60.0);
3735 }
3736
3737 /* minute */
3738 carry += d->min;
Daniel Veillardebe25d42004-03-25 09:35:49 +00003739 r->min = (unsigned int) MODULO(carry, 60);
3740 carry = (long) FQUOTIENT(carry, 60);
Daniel Veillard5a872412002-05-22 06:40:27 +00003741
3742 /* hours */
3743 carry += d->hour;
Daniel Veillardebe25d42004-03-25 09:35:49 +00003744 r->hour = (unsigned int) MODULO(carry, 24);
3745 carry = (long)FQUOTIENT(carry, 24);
Daniel Veillard5a872412002-05-22 06:40:27 +00003746
3747 /*
3748 * days
3749 * Note we use tempdays because the temporary values may need more
3750 * than 5 bits
3751 */
3752 if ((VALID_YEAR(r->year)) && (VALID_MONTH(r->mon)) &&
3753 (d->day > MAX_DAYINMONTH(r->year, r->mon)))
3754 tempdays = MAX_DAYINMONTH(r->year, r->mon);
3755 else if (d->day < 1)
3756 tempdays = 1;
3757 else
3758 tempdays = d->day;
3759
3760 tempdays += u->day + carry;
3761
3762 while (1) {
3763 if (tempdays < 1) {
Daniel Veillardebe25d42004-03-25 09:35:49 +00003764 long tmon = (long) MODULO_RANGE(r->mon-1, 1, 13);
3765 long tyr = r->year + (long)FQUOTIENT_RANGE(r->mon-1, 1, 13);
Daniel Veillard5a872412002-05-22 06:40:27 +00003766 if (tyr == 0)
3767 tyr--;
3768 tempdays += MAX_DAYINMONTH(tyr, tmon);
3769 carry = -1;
Daniel Veillardebe25d42004-03-25 09:35:49 +00003770 } else if (tempdays > (long) MAX_DAYINMONTH(r->year, r->mon)) {
Daniel Veillard5a872412002-05-22 06:40:27 +00003771 tempdays = tempdays - MAX_DAYINMONTH(r->year, r->mon);
3772 carry = 1;
3773 } else
3774 break;
3775
3776 temp = r->mon + carry;
Daniel Veillardebe25d42004-03-25 09:35:49 +00003777 r->mon = (unsigned int) MODULO_RANGE(temp, 1, 13);
3778 r->year = r->year + (unsigned int) FQUOTIENT_RANGE(temp, 1, 13);
Daniel Veillard5a872412002-05-22 06:40:27 +00003779 if (r->year == 0) {
3780 if (temp < 1)
3781 r->year--;
3782 else
3783 r->year++;
3784 }
3785 }
3786
3787 r->day = tempdays;
3788
3789 /*
3790 * adjust the date/time type to the date values
3791 */
3792 if (ret->type != XML_SCHEMAS_DATETIME) {
3793 if ((r->hour) || (r->min) || (r->sec))
3794 ret->type = XML_SCHEMAS_DATETIME;
3795 else if (ret->type != XML_SCHEMAS_DATE) {
3796 if ((r->mon != 1) && (r->day != 1))
3797 ret->type = XML_SCHEMAS_DATE;
3798 else if ((ret->type != XML_SCHEMAS_GYEARMONTH) && (r->mon != 1))
3799 ret->type = XML_SCHEMAS_GYEARMONTH;
3800 }
3801 }
3802
Daniel Veillard669adfc2004-05-29 20:12:46 +00003803 xmlSchemaFreeValue(tmp);
Daniel Veillard5a872412002-05-22 06:40:27 +00003804
Daniel Veillard5a872412002-05-22 06:40:27 +00003805 return ret;
3806}
3807
3808/**
3809 * xmlSchemaDateNormalize:
Daniel Veillard669adfc2004-05-29 20:12:46 +00003810 * @dt: an #xmlSchemaValPtr of a date/time type value.
3811 * @offset: number of seconds to adjust @dt by.
Daniel Veillard5a872412002-05-22 06:40:27 +00003812 *
Daniel Veillard669adfc2004-05-29 20:12:46 +00003813 * Normalize @dt to GMT time. The @offset parameter is subtracted from
3814 * the return value is a time-zone offset is present on @dt.
Daniel Veillard5a872412002-05-22 06:40:27 +00003815 *
Daniel Veillard669adfc2004-05-29 20:12:46 +00003816 * Returns a normalized copy of @dt or NULL if error.
Daniel Veillard5a872412002-05-22 06:40:27 +00003817 */
3818static xmlSchemaValPtr
3819xmlSchemaDateNormalize (xmlSchemaValPtr dt, double offset)
3820{
3821 xmlSchemaValPtr dur, ret;
3822
3823 if (dt == NULL)
3824 return NULL;
3825
3826 if (((dt->type != XML_SCHEMAS_TIME) &&
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00003827 (dt->type != XML_SCHEMAS_DATETIME) &&
3828 (dt->type != XML_SCHEMAS_DATE)) || (dt->value.date.tzo == 0))
Daniel Veillard5a872412002-05-22 06:40:27 +00003829 return xmlSchemaDupVal(dt);
3830
3831 dur = xmlSchemaNewValue(XML_SCHEMAS_DURATION);
3832 if (dur == NULL)
3833 return NULL;
3834
3835 dur->value.date.sec -= offset;
3836
3837 ret = _xmlSchemaDateAdd(dt, dur);
3838 if (ret == NULL)
3839 return NULL;
3840
3841 xmlSchemaFreeValue(dur);
3842
3843 /* ret->value.date.tzo = 0; */
3844 return ret;
3845}
3846
3847/**
3848 * _xmlSchemaDateCastYMToDays:
3849 * @dt: an #xmlSchemaValPtr
3850 *
3851 * Convert mon and year of @dt to total number of days. Take the
3852 * number of years since (or before) 1 AD and add the number of leap
3853 * years. This is a function because negative
3854 * years must be handled a little differently and there is no zero year.
3855 *
3856 * Returns number of days.
3857 */
3858static long
3859_xmlSchemaDateCastYMToDays (const xmlSchemaValPtr dt)
3860{
3861 long ret;
Daniel Veillard49e89632004-09-23 16:24:36 +00003862 int mon;
Daniel Veillard5a872412002-05-22 06:40:27 +00003863
Daniel Veillard49e89632004-09-23 16:24:36 +00003864 mon = dt->value.date.mon;
3865 if (mon <= 0) mon = 1; /* normalization */
3866
3867 if (dt->value.date.year <= 0)
Daniel Veillard5a872412002-05-22 06:40:27 +00003868 ret = (dt->value.date.year * 365) +
3869 (((dt->value.date.year+1)/4)-((dt->value.date.year+1)/100)+
3870 ((dt->value.date.year+1)/400)) +
Daniel Veillard49e89632004-09-23 16:24:36 +00003871 DAY_IN_YEAR(0, mon, dt->value.date.year);
Daniel Veillard5a872412002-05-22 06:40:27 +00003872 else
3873 ret = ((dt->value.date.year-1) * 365) +
3874 (((dt->value.date.year-1)/4)-((dt->value.date.year-1)/100)+
3875 ((dt->value.date.year-1)/400)) +
Daniel Veillard49e89632004-09-23 16:24:36 +00003876 DAY_IN_YEAR(0, mon, dt->value.date.year);
Daniel Veillard5a872412002-05-22 06:40:27 +00003877
3878 return ret;
3879}
3880
3881/**
3882 * TIME_TO_NUMBER:
3883 * @dt: an #xmlSchemaValPtr
3884 *
3885 * Calculates the number of seconds in the time portion of @dt.
3886 *
3887 * Returns seconds.
3888 */
3889#define TIME_TO_NUMBER(dt) \
3890 ((double)((dt->value.date.hour * SECS_PER_HOUR) + \
Daniel Veillardb3721c22003-03-31 11:22:25 +00003891 (dt->value.date.min * SECS_PER_MIN) + \
3892 (dt->value.date.tzo * SECS_PER_MIN)) + \
3893 dt->value.date.sec)
Daniel Veillard5a872412002-05-22 06:40:27 +00003894
3895/**
3896 * xmlSchemaCompareDates:
3897 * @x: a first date/time value
3898 * @y: a second date/time value
3899 *
3900 * Compare 2 date/times
3901 *
3902 * Returns -1 if x < y, 0 if x == y, 1 if x > y, 2 if x <> y, and -2 in
3903 * case of error
3904 */
3905static int
3906xmlSchemaCompareDates (xmlSchemaValPtr x, xmlSchemaValPtr y)
3907{
3908 unsigned char xmask, ymask, xor_mask, and_mask;
3909 xmlSchemaValPtr p1, p2, q1, q2;
3910 long p1d, p2d, q1d, q2d;
3911
3912 if ((x == NULL) || (y == NULL))
3913 return -2;
3914
3915 if (x->value.date.tz_flag) {
3916
3917 if (!y->value.date.tz_flag) {
3918 p1 = xmlSchemaDateNormalize(x, 0);
3919 p1d = _xmlSchemaDateCastYMToDays(p1) + p1->value.date.day;
3920 /* normalize y + 14:00 */
3921 q1 = xmlSchemaDateNormalize(y, (14 * SECS_PER_HOUR));
3922
3923 q1d = _xmlSchemaDateCastYMToDays(q1) + q1->value.date.day;
Daniel Veillardfdc91562002-07-01 21:52:03 +00003924 if (p1d < q1d) {
3925 xmlSchemaFreeValue(p1);
3926 xmlSchemaFreeValue(q1);
Daniel Veillard5a872412002-05-22 06:40:27 +00003927 return -1;
Daniel Veillardfdc91562002-07-01 21:52:03 +00003928 } else if (p1d == q1d) {
Daniel Veillard5a872412002-05-22 06:40:27 +00003929 double sec;
3930
3931 sec = TIME_TO_NUMBER(p1) - TIME_TO_NUMBER(q1);
Daniel Veillardfdc91562002-07-01 21:52:03 +00003932 if (sec < 0.0) {
3933 xmlSchemaFreeValue(p1);
3934 xmlSchemaFreeValue(q1);
Daniel Veillard5a872412002-05-22 06:40:27 +00003935 return -1;
Daniel Veillardfdc91562002-07-01 21:52:03 +00003936 } else {
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003937 int ret = 0;
Daniel Veillard5a872412002-05-22 06:40:27 +00003938 /* normalize y - 14:00 */
3939 q2 = xmlSchemaDateNormalize(y, -(14 * SECS_PER_HOUR));
3940 q2d = _xmlSchemaDateCastYMToDays(q2) + q2->value.date.day;
3941 if (p1d > q2d)
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003942 ret = 1;
Daniel Veillard5a872412002-05-22 06:40:27 +00003943 else if (p1d == q2d) {
3944 sec = TIME_TO_NUMBER(p1) - TIME_TO_NUMBER(q2);
3945 if (sec > 0.0)
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003946 ret = 1;
Daniel Veillard5a872412002-05-22 06:40:27 +00003947 else
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003948 ret = 2; /* indeterminate */
Daniel Veillard5a872412002-05-22 06:40:27 +00003949 }
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003950 xmlSchemaFreeValue(p1);
3951 xmlSchemaFreeValue(q1);
3952 xmlSchemaFreeValue(q2);
3953 if (ret != 0)
3954 return(ret);
Daniel Veillard5a872412002-05-22 06:40:27 +00003955 }
Daniel Veillardfdc91562002-07-01 21:52:03 +00003956 } else {
3957 xmlSchemaFreeValue(p1);
3958 xmlSchemaFreeValue(q1);
3959 }
Daniel Veillard5a872412002-05-22 06:40:27 +00003960 }
3961 } else if (y->value.date.tz_flag) {
3962 q1 = xmlSchemaDateNormalize(y, 0);
3963 q1d = _xmlSchemaDateCastYMToDays(q1) + q1->value.date.day;
3964
3965 /* normalize x - 14:00 */
3966 p1 = xmlSchemaDateNormalize(x, -(14 * SECS_PER_HOUR));
3967 p1d = _xmlSchemaDateCastYMToDays(p1) + p1->value.date.day;
3968
Daniel Veillardfdc91562002-07-01 21:52:03 +00003969 if (p1d < q1d) {
3970 xmlSchemaFreeValue(p1);
3971 xmlSchemaFreeValue(q1);
Daniel Veillard5a872412002-05-22 06:40:27 +00003972 return -1;
Daniel Veillardfdc91562002-07-01 21:52:03 +00003973 } else if (p1d == q1d) {
Daniel Veillard5a872412002-05-22 06:40:27 +00003974 double sec;
3975
3976 sec = TIME_TO_NUMBER(p1) - TIME_TO_NUMBER(q1);
Daniel Veillardfdc91562002-07-01 21:52:03 +00003977 if (sec < 0.0) {
3978 xmlSchemaFreeValue(p1);
3979 xmlSchemaFreeValue(q1);
Daniel Veillard5a872412002-05-22 06:40:27 +00003980 return -1;
Daniel Veillardfdc91562002-07-01 21:52:03 +00003981 } else {
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003982 int ret = 0;
Daniel Veillard5a872412002-05-22 06:40:27 +00003983 /* normalize x + 14:00 */
3984 p2 = xmlSchemaDateNormalize(x, (14 * SECS_PER_HOUR));
3985 p2d = _xmlSchemaDateCastYMToDays(p2) + p2->value.date.day;
3986
Daniel Veillard6560a422003-03-27 21:25:38 +00003987 if (p2d > q1d) {
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003988 ret = 1;
Daniel Veillard6560a422003-03-27 21:25:38 +00003989 } else if (p2d == q1d) {
Daniel Veillard5a872412002-05-22 06:40:27 +00003990 sec = TIME_TO_NUMBER(p2) - TIME_TO_NUMBER(q1);
3991 if (sec > 0.0)
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003992 ret = 1;
Daniel Veillard5a872412002-05-22 06:40:27 +00003993 else
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003994 ret = 2; /* indeterminate */
Daniel Veillard5a872412002-05-22 06:40:27 +00003995 }
Daniel Veillard6560a422003-03-27 21:25:38 +00003996 xmlSchemaFreeValue(p1);
3997 xmlSchemaFreeValue(q1);
3998 xmlSchemaFreeValue(p2);
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003999 if (ret != 0)
4000 return(ret);
Daniel Veillard5a872412002-05-22 06:40:27 +00004001 }
Daniel Veillardfdc91562002-07-01 21:52:03 +00004002 } else {
4003 xmlSchemaFreeValue(p1);
4004 xmlSchemaFreeValue(q1);
Daniel Veillard5a872412002-05-22 06:40:27 +00004005 }
4006 }
4007
4008 /*
4009 * if the same type then calculate the difference
4010 */
4011 if (x->type == y->type) {
Daniel Veillard4aede2e2003-10-17 12:43:59 +00004012 int ret = 0;
Daniel Veillard5a872412002-05-22 06:40:27 +00004013 q1 = xmlSchemaDateNormalize(y, 0);
4014 q1d = _xmlSchemaDateCastYMToDays(q1) + q1->value.date.day;
4015
4016 p1 = xmlSchemaDateNormalize(x, 0);
4017 p1d = _xmlSchemaDateCastYMToDays(p1) + p1->value.date.day;
4018
Daniel Veillardfdc91562002-07-01 21:52:03 +00004019 if (p1d < q1d) {
Daniel Veillard4aede2e2003-10-17 12:43:59 +00004020 ret = -1;
Daniel Veillardfdc91562002-07-01 21:52:03 +00004021 } else if (p1d > q1d) {
Daniel Veillard4aede2e2003-10-17 12:43:59 +00004022 ret = 1;
Daniel Veillardfdc91562002-07-01 21:52:03 +00004023 } else {
Daniel Veillard5a872412002-05-22 06:40:27 +00004024 double sec;
4025
4026 sec = TIME_TO_NUMBER(p1) - TIME_TO_NUMBER(q1);
4027 if (sec < 0.0)
Daniel Veillard4aede2e2003-10-17 12:43:59 +00004028 ret = -1;
Daniel Veillard5a872412002-05-22 06:40:27 +00004029 else if (sec > 0.0)
Daniel Veillard4aede2e2003-10-17 12:43:59 +00004030 ret = 1;
Daniel Veillard5a872412002-05-22 06:40:27 +00004031
4032 }
Daniel Veillard4aede2e2003-10-17 12:43:59 +00004033 xmlSchemaFreeValue(p1);
4034 xmlSchemaFreeValue(q1);
4035 return(ret);
Daniel Veillard5a872412002-05-22 06:40:27 +00004036 }
4037
4038 switch (x->type) {
4039 case XML_SCHEMAS_DATETIME:
4040 xmask = 0xf;
4041 break;
4042 case XML_SCHEMAS_DATE:
4043 xmask = 0x7;
4044 break;
4045 case XML_SCHEMAS_GYEAR:
4046 xmask = 0x1;
4047 break;
4048 case XML_SCHEMAS_GMONTH:
4049 xmask = 0x2;
4050 break;
4051 case XML_SCHEMAS_GDAY:
4052 xmask = 0x3;
4053 break;
4054 case XML_SCHEMAS_GYEARMONTH:
4055 xmask = 0x3;
4056 break;
4057 case XML_SCHEMAS_GMONTHDAY:
4058 xmask = 0x6;
4059 break;
4060 case XML_SCHEMAS_TIME:
4061 xmask = 0x8;
4062 break;
4063 default:
4064 xmask = 0;
4065 break;
4066 }
4067
4068 switch (y->type) {
4069 case XML_SCHEMAS_DATETIME:
4070 ymask = 0xf;
4071 break;
4072 case XML_SCHEMAS_DATE:
4073 ymask = 0x7;
4074 break;
4075 case XML_SCHEMAS_GYEAR:
4076 ymask = 0x1;
4077 break;
4078 case XML_SCHEMAS_GMONTH:
4079 ymask = 0x2;
4080 break;
4081 case XML_SCHEMAS_GDAY:
4082 ymask = 0x3;
4083 break;
4084 case XML_SCHEMAS_GYEARMONTH:
4085 ymask = 0x3;
4086 break;
4087 case XML_SCHEMAS_GMONTHDAY:
4088 ymask = 0x6;
4089 break;
4090 case XML_SCHEMAS_TIME:
4091 ymask = 0x8;
4092 break;
4093 default:
4094 ymask = 0;
4095 break;
4096 }
4097
4098 xor_mask = xmask ^ ymask; /* mark type differences */
4099 and_mask = xmask & ymask; /* mark field specification */
4100
4101 /* year */
4102 if (xor_mask & 1)
4103 return 2; /* indeterminate */
4104 else if (and_mask & 1) {
4105 if (x->value.date.year < y->value.date.year)
4106 return -1;
4107 else if (x->value.date.year > y->value.date.year)
4108 return 1;
4109 }
4110
4111 /* month */
4112 if (xor_mask & 2)
4113 return 2; /* indeterminate */
4114 else if (and_mask & 2) {
4115 if (x->value.date.mon < y->value.date.mon)
4116 return -1;
4117 else if (x->value.date.mon > y->value.date.mon)
4118 return 1;
4119 }
4120
4121 /* day */
4122 if (xor_mask & 4)
4123 return 2; /* indeterminate */
4124 else if (and_mask & 4) {
4125 if (x->value.date.day < y->value.date.day)
4126 return -1;
4127 else if (x->value.date.day > y->value.date.day)
4128 return 1;
4129 }
4130
4131 /* time */
4132 if (xor_mask & 8)
4133 return 2; /* indeterminate */
4134 else if (and_mask & 8) {
4135 if (x->value.date.hour < y->value.date.hour)
4136 return -1;
4137 else if (x->value.date.hour > y->value.date.hour)
4138 return 1;
4139 else if (x->value.date.min < y->value.date.min)
4140 return -1;
4141 else if (x->value.date.min > y->value.date.min)
4142 return 1;
4143 else if (x->value.date.sec < y->value.date.sec)
4144 return -1;
4145 else if (x->value.date.sec > y->value.date.sec)
4146 return 1;
4147 }
4148
Daniel Veillard070803b2002-05-03 07:29:38 +00004149 return 0;
4150}
4151
4152/**
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004153 * xmlSchemaComparePreserveReplaceStrings:
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004154 * @x: a first string value
4155 * @y: a second string value
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004156 * @invert: inverts the result if x < y or x > y.
4157 *
4158 * Compare 2 string for their normalized values.
4159 * @x is a string with whitespace of "preserve", @y is
4160 * a string with a whitespace of "replace". I.e. @x could
4161 * be an "xsd:string" and @y an "xsd:normalizedString".
4162 *
4163 * Returns -1 if x < y, 0 if x == y, 1 if x > y, and -2 in
4164 * case of error
4165 */
4166static int
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004167xmlSchemaComparePreserveReplaceStrings(const xmlChar *x,
4168 const xmlChar *y,
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004169 int invert)
4170{
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004171 int tmp;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004172
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004173 while ((*x != 0) && (*y != 0)) {
4174 if (IS_WSP_REPLACE_CH(*y)) {
4175 if (! IS_WSP_SPACE_CH(*x)) {
4176 if ((*x - 0x20) < 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004177 if (invert)
4178 return(1);
4179 else
4180 return(-1);
4181 } else {
4182 if (invert)
4183 return(-1);
4184 else
4185 return(1);
4186 }
4187 }
4188 } else {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004189 tmp = *x - *y;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004190 if (tmp < 0) {
4191 if (invert)
4192 return(1);
4193 else
4194 return(-1);
4195 }
4196 if (tmp > 0) {
4197 if (invert)
4198 return(-1);
4199 else
4200 return(1);
4201 }
4202 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004203 x++;
4204 y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004205 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004206 if (*x != 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004207 if (invert)
4208 return(-1);
4209 else
4210 return(1);
4211 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004212 if (*y != 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004213 if (invert)
4214 return(1);
4215 else
4216 return(-1);
4217 }
4218 return(0);
4219}
4220
4221/**
4222 * xmlSchemaComparePreserveCollapseStrings:
4223 * @x: a first string value
4224 * @y: a second string value
4225 *
4226 * Compare 2 string for their normalized values.
4227 * @x is a string with whitespace of "preserve", @y is
4228 * a string with a whitespace of "collapse". I.e. @x could
4229 * be an "xsd:string" and @y an "xsd:normalizedString".
4230 *
4231 * Returns -1 if x < y, 0 if x == y, 1 if x > y, and -2 in
4232 * case of error
4233 */
4234static int
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004235xmlSchemaComparePreserveCollapseStrings(const xmlChar *x,
4236 const xmlChar *y,
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004237 int invert)
4238{
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004239 int tmp;
4240
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004241 /*
4242 * Skip leading blank chars of the collapsed string.
4243 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004244 while IS_WSP_BLANK_CH(*y)
4245 y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004246
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004247 while ((*x != 0) && (*y != 0)) {
4248 if IS_WSP_BLANK_CH(*y) {
4249 if (! IS_WSP_SPACE_CH(*x)) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004250 /*
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004251 * The yv character would have been replaced to 0x20.
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004252 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004253 if ((*x - 0x20) < 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004254 if (invert)
4255 return(1);
4256 else
4257 return(-1);
4258 } else {
4259 if (invert)
4260 return(-1);
4261 else
4262 return(1);
4263 }
4264 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004265 x++;
4266 y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004267 /*
4268 * Skip contiguous blank chars of the collapsed string.
4269 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004270 while IS_WSP_BLANK_CH(*y)
4271 y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004272 } else {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004273 tmp = *x++ - *y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004274 if (tmp < 0) {
4275 if (invert)
4276 return(1);
4277 else
4278 return(-1);
4279 }
4280 if (tmp > 0) {
4281 if (invert)
4282 return(-1);
4283 else
4284 return(1);
4285 }
4286 }
4287 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004288 if (*x != 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004289 if (invert)
4290 return(-1);
4291 else
4292 return(1);
4293 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004294 if (*y != 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004295 /*
4296 * Skip trailing blank chars of the collapsed string.
4297 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004298 while IS_WSP_BLANK_CH(*y)
4299 y++;
4300 if (*y != 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004301 if (invert)
4302 return(1);
4303 else
4304 return(-1);
4305 }
4306 }
4307 return(0);
4308}
4309
4310/**
4311 * xmlSchemaComparePreserveCollapseStrings:
4312 * @x: a first string value
4313 * @y: a second string value
4314 *
4315 * Compare 2 string for their normalized values.
4316 * @x is a string with whitespace of "preserve", @y is
4317 * a string with a whitespace of "collapse". I.e. @x could
4318 * be an "xsd:string" and @y an "xsd:normalizedString".
4319 *
4320 * Returns -1 if x < y, 0 if x == y, 1 if x > y, and -2 in
4321 * case of error
4322 */
4323static int
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004324xmlSchemaCompareReplaceCollapseStrings(const xmlChar *x,
4325 const xmlChar *y,
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004326 int invert)
4327{
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004328 int tmp;
4329
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004330 /*
4331 * Skip leading blank chars of the collapsed string.
4332 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004333 while IS_WSP_BLANK_CH(*y)
4334 y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004335
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004336 while ((*x != 0) && (*y != 0)) {
4337 if IS_WSP_BLANK_CH(*y) {
4338 if (! IS_WSP_BLANK_CH(*x)) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004339 /*
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004340 * The yv character would have been replaced to 0x20.
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004341 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004342 if ((*x - 0x20) < 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004343 if (invert)
4344 return(1);
4345 else
4346 return(-1);
4347 } else {
4348 if (invert)
4349 return(-1);
4350 else
4351 return(1);
4352 }
4353 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004354 x++;
4355 y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004356 /*
4357 * Skip contiguous blank chars of the collapsed string.
4358 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004359 while IS_WSP_BLANK_CH(*y)
4360 y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004361 } else {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004362 if IS_WSP_BLANK_CH(*x) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004363 /*
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004364 * The xv character would have been replaced to 0x20.
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004365 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004366 if ((0x20 - *y) < 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004367 if (invert)
4368 return(1);
4369 else
4370 return(-1);
4371 } else {
4372 if (invert)
4373 return(-1);
4374 else
4375 return(1);
4376 }
4377 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004378 tmp = *x++ - *y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004379 if (tmp < 0)
4380 return(-1);
4381 if (tmp > 0)
4382 return(1);
4383 }
4384 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004385 if (*x != 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004386 if (invert)
4387 return(-1);
4388 else
4389 return(1);
4390 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004391 if (*y != 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004392 /*
4393 * Skip trailing blank chars of the collapsed string.
4394 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004395 while IS_WSP_BLANK_CH(*y)
4396 y++;
4397 if (*y != 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004398 if (invert)
4399 return(1);
4400 else
4401 return(-1);
4402 }
4403 }
4404 return(0);
4405}
4406
4407
4408/**
4409 * xmlSchemaCompareReplacedStrings:
4410 * @x: a first string value
4411 * @y: a second string value
4412 *
4413 * Compare 2 string for their normalized values.
4414 *
4415 * Returns -1 if x < y, 0 if x == y, 1 if x > y, and -2 in
4416 * case of error
4417 */
4418static int
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004419xmlSchemaCompareReplacedStrings(const xmlChar *x,
4420 const xmlChar *y)
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004421{
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004422 int tmp;
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004423
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004424 while ((*x != 0) && (*y != 0)) {
4425 if IS_WSP_BLANK_CH(*y) {
4426 if (! IS_WSP_BLANK_CH(*x)) {
4427 if ((*x - 0x20) < 0)
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004428 return(-1);
4429 else
4430 return(1);
4431 }
4432 } else {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004433 if IS_WSP_BLANK_CH(*x) {
4434 if ((0x20 - *y) < 0)
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004435 return(-1);
4436 else
4437 return(1);
4438 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004439 tmp = *x - *y;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004440 if (tmp < 0)
4441 return(-1);
4442 if (tmp > 0)
4443 return(1);
4444 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004445 x++;
4446 y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004447 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004448 if (*x != 0)
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004449 return(1);
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004450 if (*y != 0)
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004451 return(-1);
4452 return(0);
4453}
4454
4455/**
Daniel Veillardc4c21552003-03-29 10:53:38 +00004456 * xmlSchemaCompareNormStrings:
4457 * @x: a first string value
4458 * @y: a second string value
4459 *
4460 * Compare 2 string for their normalized values.
4461 *
4462 * Returns -1 if x < y, 0 if x == y, 1 if x > y, and -2 in
4463 * case of error
4464 */
4465static int
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004466xmlSchemaCompareNormStrings(const xmlChar *x,
4467 const xmlChar *y) {
Daniel Veillardc4c21552003-03-29 10:53:38 +00004468 int tmp;
Daniel Veillardc4c21552003-03-29 10:53:38 +00004469
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004470 while (IS_BLANK_CH(*x)) x++;
4471 while (IS_BLANK_CH(*y)) y++;
4472 while ((*x != 0) && (*y != 0)) {
4473 if (IS_BLANK_CH(*x)) {
4474 if (!IS_BLANK_CH(*y)) {
4475 tmp = *x - *y;
Daniel Veillardc4c21552003-03-29 10:53:38 +00004476 return(tmp);
4477 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004478 while (IS_BLANK_CH(*x)) x++;
4479 while (IS_BLANK_CH(*y)) y++;
Daniel Veillardc4c21552003-03-29 10:53:38 +00004480 } else {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004481 tmp = *x++ - *y++;
Daniel Veillardc4c21552003-03-29 10:53:38 +00004482 if (tmp < 0)
4483 return(-1);
4484 if (tmp > 0)
4485 return(1);
4486 }
4487 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004488 if (*x != 0) {
4489 while (IS_BLANK_CH(*x)) x++;
4490 if (*x != 0)
Daniel Veillardc4c21552003-03-29 10:53:38 +00004491 return(1);
4492 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004493 if (*y != 0) {
4494 while (IS_BLANK_CH(*y)) y++;
4495 if (*y != 0)
Daniel Veillardc4c21552003-03-29 10:53:38 +00004496 return(-1);
4497 }
4498 return(0);
4499}
4500
4501/**
Daniel Veillardb6c7f412003-03-29 16:41:55 +00004502 * xmlSchemaCompareFloats:
4503 * @x: a first float or double value
4504 * @y: a second float or double value
4505 *
4506 * Compare 2 values
4507 *
4508 * Returns -1 if x < y, 0 if x == y, 1 if x > y, 2 if x <> y, and -2 in
4509 * case of error
4510 */
4511static int
4512xmlSchemaCompareFloats(xmlSchemaValPtr x, xmlSchemaValPtr y) {
4513 double d1, d2;
4514
4515 if ((x == NULL) || (y == NULL))
4516 return(-2);
4517
4518 /*
4519 * Cast everything to doubles.
4520 */
4521 if (x->type == XML_SCHEMAS_DOUBLE)
4522 d1 = x->value.d;
4523 else if (x->type == XML_SCHEMAS_FLOAT)
4524 d1 = x->value.f;
4525 else
4526 return(-2);
4527
4528 if (y->type == XML_SCHEMAS_DOUBLE)
4529 d2 = y->value.d;
4530 else if (y->type == XML_SCHEMAS_FLOAT)
4531 d2 = y->value.f;
4532 else
4533 return(-2);
4534
4535 /*
4536 * Check for special cases.
4537 */
4538 if (xmlXPathIsNaN(d1)) {
4539 if (xmlXPathIsNaN(d2))
4540 return(0);
4541 return(1);
4542 }
4543 if (xmlXPathIsNaN(d2))
4544 return(-1);
4545 if (d1 == xmlXPathPINF) {
4546 if (d2 == xmlXPathPINF)
4547 return(0);
4548 return(1);
4549 }
4550 if (d2 == xmlXPathPINF)
4551 return(-1);
4552 if (d1 == xmlXPathNINF) {
4553 if (d2 == xmlXPathNINF)
4554 return(0);
4555 return(-1);
4556 }
4557 if (d2 == xmlXPathNINF)
4558 return(1);
4559
4560 /*
4561 * basic tests, the last one we should have equality, but
4562 * portability is more important than speed and handling
4563 * NaN or Inf in a portable way is always a challenge, so ...
4564 */
4565 if (d1 < d2)
4566 return(-1);
4567 if (d1 > d2)
4568 return(1);
4569 if (d1 == d2)
4570 return(0);
4571 return(2);
4572}
4573
4574/**
Daniel Veillard4255d502002-04-16 15:50:10 +00004575 * xmlSchemaCompareValues:
4576 * @x: a first value
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004577 * @xvalue: the first value as a string (optional)
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004578 * @xwtsp: the whitespace type
Daniel Veillard4255d502002-04-16 15:50:10 +00004579 * @y: a second value
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004580 * @xvalue: the second value as a string (optional)
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004581 * @ywtsp: the whitespace type
Daniel Veillard4255d502002-04-16 15:50:10 +00004582 *
4583 * Compare 2 values
4584 *
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00004585 * Returns -1 if x < y, 0 if x == y, 1 if x > y, 2 if x <> y, 3 if not
4586 * comparable and -2 in case of error
Daniel Veillard4255d502002-04-16 15:50:10 +00004587 */
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004588static int
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004589xmlSchemaCompareValuesInternal(xmlSchemaValType xtype,
4590 xmlSchemaValPtr x,
4591 const xmlChar *xvalue,
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004592 xmlSchemaWhitespaceValueType xws,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004593 xmlSchemaValType ytype,
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004594 xmlSchemaValPtr y,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004595 const xmlChar *yvalue,
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004596 xmlSchemaWhitespaceValueType yws)
4597{
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004598 switch (xtype) {
Daniel Veillard80b19092003-03-28 13:29:53 +00004599 case XML_SCHEMAS_UNKNOWN:
William M. Brack2f2a6632004-08-20 23:09:47 +00004600 case XML_SCHEMAS_ANYTYPE:
Daniel Veillard80b19092003-03-28 13:29:53 +00004601 return(-2);
4602 case XML_SCHEMAS_INTEGER:
4603 case XML_SCHEMAS_NPINTEGER:
4604 case XML_SCHEMAS_NINTEGER:
4605 case XML_SCHEMAS_NNINTEGER:
4606 case XML_SCHEMAS_PINTEGER:
4607 case XML_SCHEMAS_INT:
4608 case XML_SCHEMAS_UINT:
4609 case XML_SCHEMAS_LONG:
4610 case XML_SCHEMAS_ULONG:
4611 case XML_SCHEMAS_SHORT:
4612 case XML_SCHEMAS_USHORT:
4613 case XML_SCHEMAS_BYTE:
4614 case XML_SCHEMAS_UBYTE:
Daniel Veillard4255d502002-04-16 15:50:10 +00004615 case XML_SCHEMAS_DECIMAL:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004616 if ((x == NULL) || (y == NULL))
4617 return(-2);
4618 if (ytype == xtype)
Daniel Veillard80b19092003-03-28 13:29:53 +00004619 return(xmlSchemaCompareDecimals(x, y));
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004620 if ((ytype == XML_SCHEMAS_DECIMAL) ||
4621 (ytype == XML_SCHEMAS_INTEGER) ||
4622 (ytype == XML_SCHEMAS_NPINTEGER) ||
4623 (ytype == XML_SCHEMAS_NINTEGER) ||
4624 (ytype == XML_SCHEMAS_NNINTEGER) ||
4625 (ytype == XML_SCHEMAS_PINTEGER) ||
4626 (ytype == XML_SCHEMAS_INT) ||
4627 (ytype == XML_SCHEMAS_UINT) ||
4628 (ytype == XML_SCHEMAS_LONG) ||
4629 (ytype == XML_SCHEMAS_ULONG) ||
4630 (ytype == XML_SCHEMAS_SHORT) ||
4631 (ytype == XML_SCHEMAS_USHORT) ||
4632 (ytype == XML_SCHEMAS_BYTE) ||
4633 (ytype == XML_SCHEMAS_UBYTE))
Daniel Veillard4255d502002-04-16 15:50:10 +00004634 return(xmlSchemaCompareDecimals(x, y));
Daniel Veillard5a872412002-05-22 06:40:27 +00004635 return(-2);
Daniel Veillard070803b2002-05-03 07:29:38 +00004636 case XML_SCHEMAS_DURATION:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004637 if ((x == NULL) || (y == NULL))
4638 return(-2);
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004639 if (ytype == XML_SCHEMAS_DURATION)
Daniel Veillard070803b2002-05-03 07:29:38 +00004640 return(xmlSchemaCompareDurations(x, y));
Daniel Veillard5a872412002-05-22 06:40:27 +00004641 return(-2);
4642 case XML_SCHEMAS_TIME:
4643 case XML_SCHEMAS_GDAY:
4644 case XML_SCHEMAS_GMONTH:
4645 case XML_SCHEMAS_GMONTHDAY:
4646 case XML_SCHEMAS_GYEAR:
4647 case XML_SCHEMAS_GYEARMONTH:
4648 case XML_SCHEMAS_DATE:
4649 case XML_SCHEMAS_DATETIME:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004650 if ((x == NULL) || (y == NULL))
4651 return(-2);
4652 if ((ytype == XML_SCHEMAS_DATETIME) ||
4653 (ytype == XML_SCHEMAS_TIME) ||
4654 (ytype == XML_SCHEMAS_GDAY) ||
4655 (ytype == XML_SCHEMAS_GMONTH) ||
4656 (ytype == XML_SCHEMAS_GMONTHDAY) ||
4657 (ytype == XML_SCHEMAS_GYEAR) ||
4658 (ytype == XML_SCHEMAS_DATE) ||
4659 (ytype == XML_SCHEMAS_GYEARMONTH))
Daniel Veillard5a872412002-05-22 06:40:27 +00004660 return (xmlSchemaCompareDates(x, y));
Daniel Veillard5a872412002-05-22 06:40:27 +00004661 return (-2);
Kasimier T. Buchcik2ee855d2005-03-07 11:14:14 +00004662 /*
4663 * Note that we will support comparison of string types against
4664 * anySimpleType as well.
4665 */
4666 case XML_SCHEMAS_ANYSIMPLETYPE:
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004667 case XML_SCHEMAS_STRING:
4668 case XML_SCHEMAS_NORMSTRING:
Daniel Veillard80b19092003-03-28 13:29:53 +00004669 case XML_SCHEMAS_TOKEN:
4670 case XML_SCHEMAS_LANGUAGE:
4671 case XML_SCHEMAS_NMTOKEN:
Daniel Veillard80b19092003-03-28 13:29:53 +00004672 case XML_SCHEMAS_NAME:
Daniel Veillard80b19092003-03-28 13:29:53 +00004673 case XML_SCHEMAS_NCNAME:
4674 case XML_SCHEMAS_ID:
4675 case XML_SCHEMAS_IDREF:
Daniel Veillard80b19092003-03-28 13:29:53 +00004676 case XML_SCHEMAS_ENTITY:
Daniel Veillard80b19092003-03-28 13:29:53 +00004677 case XML_SCHEMAS_ANYURI:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004678 {
4679 const xmlChar *xv, *yv;
4680
4681 if (x == NULL)
4682 xv = xvalue;
4683 else
4684 xv = x->value.str;
4685 if (y == NULL)
4686 yv = yvalue;
4687 else
4688 yv = y->value.str;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004689 /*
4690 * TODO: Compare those against QName.
4691 */
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004692 if (ytype == XML_SCHEMAS_QNAME) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004693 TODO
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004694 if (y == NULL)
4695 return(-2);
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004696 return (-2);
4697 }
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004698 if ((ytype == XML_SCHEMAS_ANYSIMPLETYPE) ||
4699 (ytype == XML_SCHEMAS_STRING) ||
4700 (ytype == XML_SCHEMAS_NORMSTRING) ||
4701 (ytype == XML_SCHEMAS_TOKEN) ||
4702 (ytype == XML_SCHEMAS_LANGUAGE) ||
4703 (ytype == XML_SCHEMAS_NMTOKEN) ||
4704 (ytype == XML_SCHEMAS_NAME) ||
4705 (ytype == XML_SCHEMAS_NCNAME) ||
4706 (ytype == XML_SCHEMAS_ID) ||
4707 (ytype == XML_SCHEMAS_IDREF) ||
4708 (ytype == XML_SCHEMAS_ENTITY) ||
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004709 (ytype == XML_SCHEMAS_ANYURI)) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004710
4711 if (xws == XML_SCHEMA_WHITESPACE_PRESERVE) {
4712
4713 if (yws == XML_SCHEMA_WHITESPACE_PRESERVE) {
4714 /* TODO: What about x < y or x > y. */
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004715 if (xmlStrEqual(xv, yv))
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004716 return (0);
4717 else
4718 return (2);
4719 } else if (yws == XML_SCHEMA_WHITESPACE_REPLACE)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004720 return (xmlSchemaComparePreserveReplaceStrings(xv, yv, 0));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004721 else if (yws == XML_SCHEMA_WHITESPACE_COLLAPSE)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004722 return (xmlSchemaComparePreserveCollapseStrings(xv, yv, 0));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004723
4724 } else if (xws == XML_SCHEMA_WHITESPACE_REPLACE) {
4725
4726 if (yws == XML_SCHEMA_WHITESPACE_PRESERVE)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004727 return (xmlSchemaComparePreserveReplaceStrings(yv, xv, 1));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004728 if (yws == XML_SCHEMA_WHITESPACE_REPLACE)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004729 return (xmlSchemaCompareReplacedStrings(xv, yv));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004730 if (yws == XML_SCHEMA_WHITESPACE_COLLAPSE)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004731 return (xmlSchemaCompareReplaceCollapseStrings(xv, yv, 0));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004732
4733 } else if (xws == XML_SCHEMA_WHITESPACE_COLLAPSE) {
4734
4735 if (yws == XML_SCHEMA_WHITESPACE_PRESERVE)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004736 return (xmlSchemaComparePreserveCollapseStrings(yv, xv, 1));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004737 if (yws == XML_SCHEMA_WHITESPACE_REPLACE)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004738 return (xmlSchemaCompareReplaceCollapseStrings(yv, xv, 1));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004739 if (yws == XML_SCHEMA_WHITESPACE_COLLAPSE)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004740 return (xmlSchemaCompareNormStrings(xv, yv));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004741 } else
4742 return (-2);
4743
4744 }
Daniel Veillardc4c21552003-03-29 10:53:38 +00004745 return (-2);
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004746 }
Daniel Veillarde637c4a2003-03-30 21:10:09 +00004747 case XML_SCHEMAS_QNAME:
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00004748 case XML_SCHEMAS_NOTATION:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004749 if ((x == NULL) || (y == NULL))
4750 return(-2);
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00004751 if ((ytype == XML_SCHEMAS_QNAME) ||
4752 (ytype == XML_SCHEMAS_NOTATION)) {
Daniel Veillarde637c4a2003-03-30 21:10:09 +00004753 if ((xmlStrEqual(x->value.qname.name, y->value.qname.name)) &&
4754 (xmlStrEqual(x->value.qname.uri, y->value.qname.uri)))
4755 return(0);
4756 return(2);
4757 }
4758 return (-2);
Daniel Veillardc4c21552003-03-29 10:53:38 +00004759 case XML_SCHEMAS_FLOAT:
4760 case XML_SCHEMAS_DOUBLE:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004761 if ((x == NULL) || (y == NULL))
4762 return(-2);
4763 if ((ytype == XML_SCHEMAS_FLOAT) ||
4764 (ytype == XML_SCHEMAS_DOUBLE))
Daniel Veillardb6c7f412003-03-29 16:41:55 +00004765 return (xmlSchemaCompareFloats(x, y));
4766 return (-2);
Daniel Veillardc4c21552003-03-29 10:53:38 +00004767 case XML_SCHEMAS_BOOLEAN:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004768 if ((x == NULL) || (y == NULL))
4769 return(-2);
4770 if (ytype == XML_SCHEMAS_BOOLEAN) {
Daniel Veillardb6c7f412003-03-29 16:41:55 +00004771 if (x->value.b == y->value.b)
4772 return(0);
4773 if (x->value.b == 0)
4774 return(-1);
4775 return(1);
4776 }
4777 return (-2);
Daniel Veillard560c2a42003-07-06 21:13:49 +00004778 case XML_SCHEMAS_HEXBINARY:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004779 if ((x == NULL) || (y == NULL))
4780 return(-2);
4781 if (ytype == XML_SCHEMAS_HEXBINARY) {
Daniel Veillard70bcb0e2003-08-08 14:00:28 +00004782 if (x->value.hex.total == y->value.hex.total) {
4783 int ret = xmlStrcmp(x->value.hex.str, y->value.hex.str);
4784 if (ret > 0)
4785 return(1);
4786 else if (ret == 0)
4787 return(0);
4788 }
4789 else if (x->value.hex.total > y->value.hex.total)
4790 return(1);
4791
4792 return(-1);
4793 }
Daniel Veillard560c2a42003-07-06 21:13:49 +00004794 return (-2);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00004795 case XML_SCHEMAS_BASE64BINARY:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004796 if ((x == NULL) || (y == NULL))
4797 return(-2);
4798 if (ytype == XML_SCHEMAS_BASE64BINARY) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00004799 if (x->value.base64.total == y->value.base64.total) {
4800 int ret = xmlStrcmp(x->value.base64.str,
4801 y->value.base64.str);
4802 if (ret > 0)
4803 return(1);
4804 else if (ret == 0)
4805 return(0);
Daniel Veillardd369b132005-07-14 15:54:44 +00004806 else
4807 return(-1);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00004808 }
4809 else if (x->value.base64.total > y->value.base64.total)
4810 return(1);
4811 else
4812 return(-1);
4813 }
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004814 return (-2);
Daniel Veillardc4c21552003-03-29 10:53:38 +00004815 case XML_SCHEMAS_IDREFS:
4816 case XML_SCHEMAS_ENTITIES:
4817 case XML_SCHEMAS_NMTOKENS:
4818 TODO
4819 break;
Daniel Veillard4255d502002-04-16 15:50:10 +00004820 }
Daniel Veillard5a872412002-05-22 06:40:27 +00004821 return -2;
Daniel Veillard4255d502002-04-16 15:50:10 +00004822}
4823
4824/**
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004825 * xmlSchemaCompareValues:
4826 * @x: a first value
4827 * @y: a second value
4828 *
4829 * Compare 2 values
4830 *
4831 * Returns -1 if x < y, 0 if x == y, 1 if x > y, 2 if x <> y, and -2 in
4832 * case of error
4833 */
4834int
4835xmlSchemaCompareValues(xmlSchemaValPtr x, xmlSchemaValPtr y) {
4836 xmlSchemaWhitespaceValueType xws, yws;
4837
Daniel Veillard5e094142005-02-18 19:36:12 +00004838 if ((x == NULL) || (y == NULL))
4839 return(-2);
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004840 if (x->type == XML_SCHEMAS_STRING)
4841 xws = XML_SCHEMA_WHITESPACE_PRESERVE;
4842 else if (x->type == XML_SCHEMAS_NORMSTRING)
4843 xws = XML_SCHEMA_WHITESPACE_REPLACE;
4844 else
4845 xws = XML_SCHEMA_WHITESPACE_COLLAPSE;
4846
4847 if (y->type == XML_SCHEMAS_STRING)
4848 yws = XML_SCHEMA_WHITESPACE_PRESERVE;
4849 else if (x->type == XML_SCHEMAS_NORMSTRING)
4850 yws = XML_SCHEMA_WHITESPACE_REPLACE;
4851 else
4852 yws = XML_SCHEMA_WHITESPACE_COLLAPSE;
4853
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004854 return(xmlSchemaCompareValuesInternal(x->type, x, NULL, xws, y->type,
4855 y, NULL, yws));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004856}
4857
4858/**
4859 * xmlSchemaCompareValuesWhtsp:
4860 * @x: a first value
4861 * @xws: the whitespace value of x
4862 * @y: a second value
4863 * @yws: the whitespace value of y
4864 *
4865 * Compare 2 values
4866 *
4867 * Returns -1 if x < y, 0 if x == y, 1 if x > y, 2 if x <> y, and -2 in
4868 * case of error
4869 */
4870int
4871xmlSchemaCompareValuesWhtsp(xmlSchemaValPtr x,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004872 xmlSchemaWhitespaceValueType xws,
4873 xmlSchemaValPtr y,
4874 xmlSchemaWhitespaceValueType yws)
4875{
Kasimier T. Buchcik9dbb0ce2005-03-16 16:39:23 +00004876 if ((x == NULL) || (y == NULL))
4877 return(-2);
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004878 return(xmlSchemaCompareValuesInternal(x->type, x, NULL, xws, y->type,
4879 y, NULL, yws));
4880}
4881
4882/**
4883 * xmlSchemaCompareValuesWhtspExt:
4884 * @x: a first value
4885 * @xws: the whitespace value of x
4886 * @y: a second value
4887 * @yws: the whitespace value of y
4888 *
4889 * Compare 2 values
4890 *
4891 * Returns -1 if x < y, 0 if x == y, 1 if x > y, 2 if x <> y, and -2 in
4892 * case of error
4893 */
4894static int
4895xmlSchemaCompareValuesWhtspExt(xmlSchemaValType xtype,
4896 xmlSchemaValPtr x,
4897 const xmlChar *xvalue,
4898 xmlSchemaWhitespaceValueType xws,
4899 xmlSchemaValType ytype,
4900 xmlSchemaValPtr y,
4901 const xmlChar *yvalue,
4902 xmlSchemaWhitespaceValueType yws)
4903{
4904 return(xmlSchemaCompareValuesInternal(xtype, x, xvalue, xws, ytype, y,
4905 yvalue, yws));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004906}
4907
4908/**
Daniel Veillardc4c21552003-03-29 10:53:38 +00004909 * xmlSchemaNormLen:
4910 * @value: a string
4911 *
4912 * Computes the UTF8 length of the normalized value of the string
4913 *
4914 * Returns the length or -1 in case of error.
4915 */
4916static int
4917xmlSchemaNormLen(const xmlChar *value) {
4918 const xmlChar *utf;
4919 int ret = 0;
4920
4921 if (value == NULL)
4922 return(-1);
4923 utf = value;
William M. Brack76e95df2003-10-18 16:20:14 +00004924 while (IS_BLANK_CH(*utf)) utf++;
Daniel Veillardc4c21552003-03-29 10:53:38 +00004925 while (*utf != 0) {
4926 if (utf[0] & 0x80) {
4927 if ((utf[1] & 0xc0) != 0x80)
4928 return(-1);
4929 if ((utf[0] & 0xe0) == 0xe0) {
4930 if ((utf[2] & 0xc0) != 0x80)
4931 return(-1);
4932 if ((utf[0] & 0xf0) == 0xf0) {
4933 if ((utf[0] & 0xf8) != 0xf0 || (utf[3] & 0xc0) != 0x80)
4934 return(-1);
4935 utf += 4;
4936 } else {
4937 utf += 3;
4938 }
4939 } else {
4940 utf += 2;
4941 }
William M. Brack76e95df2003-10-18 16:20:14 +00004942 } else if (IS_BLANK_CH(*utf)) {
4943 while (IS_BLANK_CH(*utf)) utf++;
Daniel Veillardc4c21552003-03-29 10:53:38 +00004944 if (*utf == 0)
4945 break;
4946 } else {
4947 utf++;
4948 }
4949 ret++;
4950 }
4951 return(ret);
4952}
4953
Daniel Veillard6927b102004-10-27 17:29:04 +00004954/**
4955 * xmlSchemaGetFacetValueAsULong:
4956 * @facet: an schemas type facet
4957 *
4958 * Extract the value of a facet
4959 *
4960 * Returns the value as a long
4961 */
Daniel Veillardc0826a72004-08-10 14:17:33 +00004962unsigned long
4963xmlSchemaGetFacetValueAsULong(xmlSchemaFacetPtr facet)
4964{
4965 /*
4966 * TODO: Check if this is a decimal.
4967 */
William M. Brack094dd862004-11-14 14:28:34 +00004968 if (facet == NULL)
4969 return 0;
Daniel Veillardc0826a72004-08-10 14:17:33 +00004970 return ((unsigned long) facet->val->value.decimal.lo);
4971}
4972
Daniel Veillardc4c21552003-03-29 10:53:38 +00004973/**
Daniel Veillard01fa6152004-06-29 17:04:39 +00004974 * xmlSchemaValidateListSimpleTypeFacet:
4975 * @facet: the facet to check
4976 * @value: the lexical repr of the value to validate
4977 * @actualLen: the number of list items
4978 * @expectedLen: the resulting expected number of list items
4979 *
4980 * Checks the value of a list simple type against a facet.
4981 *
4982 * Returns 0 if the value is valid, a positive error code
4983 * number otherwise and -1 in case of an internal error.
4984 */
4985int
4986xmlSchemaValidateListSimpleTypeFacet(xmlSchemaFacetPtr facet,
4987 const xmlChar *value,
4988 unsigned long actualLen,
4989 unsigned long *expectedLen)
4990{
Daniel Veillardce682bc2004-11-05 17:22:25 +00004991 if (facet == NULL)
4992 return(-1);
Daniel Veillard01fa6152004-06-29 17:04:39 +00004993 /*
4994 * TODO: Check if this will work with large numbers.
4995 * (compare value.decimal.mi and value.decimal.hi as well?).
4996 */
4997 if (facet->type == XML_SCHEMA_FACET_LENGTH) {
4998 if (actualLen != facet->val->value.decimal.lo) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004999 if (expectedLen != NULL)
Daniel Veillardc0826a72004-08-10 14:17:33 +00005000 *expectedLen = facet->val->value.decimal.lo;
Daniel Veillard01fa6152004-06-29 17:04:39 +00005001 return (XML_SCHEMAV_CVC_LENGTH_VALID);
5002 }
5003 } else if (facet->type == XML_SCHEMA_FACET_MINLENGTH) {
5004 if (actualLen < facet->val->value.decimal.lo) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005005 if (expectedLen != NULL)
Daniel Veillardc0826a72004-08-10 14:17:33 +00005006 *expectedLen = facet->val->value.decimal.lo;
Daniel Veillard01fa6152004-06-29 17:04:39 +00005007 return (XML_SCHEMAV_CVC_MINLENGTH_VALID);
5008 }
5009 } else if (facet->type == XML_SCHEMA_FACET_MAXLENGTH) {
5010 if (actualLen > facet->val->value.decimal.lo) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005011 if (expectedLen != NULL)
Daniel Veillardc0826a72004-08-10 14:17:33 +00005012 *expectedLen = facet->val->value.decimal.lo;
Daniel Veillard01fa6152004-06-29 17:04:39 +00005013 return (XML_SCHEMAV_CVC_MAXLENGTH_VALID);
5014 }
5015 } else
5016 /*
5017 * NOTE: That we can pass NULL as xmlSchemaValPtr to
5018 * xmlSchemaValidateFacet, since the remaining facet types
5019 * are: XML_SCHEMA_FACET_PATTERN, XML_SCHEMA_FACET_ENUMERATION.
5020 */
5021 return(xmlSchemaValidateFacet(NULL, facet, value, NULL));
5022 return (0);
5023}
5024
5025/**
Daniel Veillard6927b102004-10-27 17:29:04 +00005026 * xmlSchemaValidateLengthFacet:
Daniel Veillardc0826a72004-08-10 14:17:33 +00005027 * @type: the built-in type
5028 * @facet: the facet to check
5029 * @value: the lexical repr. of the value to be validated
5030 * @val: the precomputed value
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005031 * @ws: the whitespace type of the value
5032 * @length: the actual length of the value
5033 *
5034 * Checka a value against a "length", "minLength" and "maxLength"
5035 * facet; sets @length to the computed length of @value.
5036 *
5037 * Returns 0 if the value is valid, a positive error code
5038 * otherwise and -1 in case of an internal or API error.
5039 */
5040static int
5041xmlSchemaValidateLengthFacetInternal(xmlSchemaFacetPtr facet,
5042 xmlSchemaTypeType valType,
5043 const xmlChar *value,
5044 xmlSchemaValPtr val,
5045 unsigned long *length,
5046 xmlSchemaWhitespaceValueType ws)
5047{
5048 unsigned int len = 0;
5049
5050 if ((length == NULL) || (facet == NULL))
5051 return (-1);
5052 *length = 0;
5053 if ((facet->type != XML_SCHEMA_FACET_LENGTH) &&
5054 (facet->type != XML_SCHEMA_FACET_MAXLENGTH) &&
5055 (facet->type != XML_SCHEMA_FACET_MINLENGTH))
5056 return (-1);
5057
5058 /*
5059 * TODO: length, maxLength and minLength must be of type
5060 * nonNegativeInteger only. Check if decimal is used somehow.
5061 */
5062 if ((facet->val == NULL) ||
5063 ((facet->val->type != XML_SCHEMAS_DECIMAL) &&
5064 (facet->val->type != XML_SCHEMAS_NNINTEGER)) ||
5065 (facet->val->value.decimal.frac != 0)) {
5066 return(-1);
5067 }
5068 if ((val != NULL) && (val->type == XML_SCHEMAS_HEXBINARY))
5069 len = val->value.hex.total;
5070 else if ((val != NULL) && (val->type == XML_SCHEMAS_BASE64BINARY))
5071 len = val->value.base64.total;
5072 else {
5073 switch (valType) {
5074 case XML_SCHEMAS_STRING:
5075 case XML_SCHEMAS_NORMSTRING:
5076 if (ws == XML_SCHEMA_WHITESPACE_UNKNOWN) {
5077 /*
5078 * This is to ensure API compatibility with the old
5079 * xmlSchemaValidateLengthFacet(). Anyway, this was and
5080 * is not the correct handling.
5081 * TODO: Get rid of this case somehow.
5082 */
5083 if (valType == XML_SCHEMAS_STRING)
5084 len = xmlUTF8Strlen(value);
5085 else
5086 len = xmlSchemaNormLen(value);
5087 } else if (value != NULL) {
5088 if (ws == XML_SCHEMA_WHITESPACE_COLLAPSE)
5089 len = xmlSchemaNormLen(value);
5090 else
5091 /*
5092 * Should be OK for "preserve" as well.
5093 */
5094 len = xmlUTF8Strlen(value);
5095 }
5096 break;
5097 case XML_SCHEMAS_IDREF:
5098 case XML_SCHEMAS_TOKEN:
5099 case XML_SCHEMAS_LANGUAGE:
5100 case XML_SCHEMAS_NMTOKEN:
5101 case XML_SCHEMAS_NAME:
5102 case XML_SCHEMAS_NCNAME:
Kasimier T. Buchcikbd6c3f72005-05-25 17:29:36 +00005103 case XML_SCHEMAS_ID:
5104 /*
5105 * FIXME: What exactly to do with anyURI?
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005106 */
5107 case XML_SCHEMAS_ANYURI:
5108 if (value != NULL)
5109 len = xmlSchemaNormLen(value);
5110 break;
Kasimier T. Buchcikbd6c3f72005-05-25 17:29:36 +00005111 case XML_SCHEMAS_QNAME:
5112 case XML_SCHEMAS_NOTATION:
5113 /*
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00005114 * For QName and NOTATION, those facets are
5115 * deprecated and should be ignored.
Kasimier T. Buchcikbd6c3f72005-05-25 17:29:36 +00005116 */
5117 return (0);
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005118 default:
5119 TODO
5120 }
5121 }
5122 *length = (unsigned long) len;
5123 /*
5124 * TODO: Return the whole expected value, i.e. "lo", "mi" and "hi".
5125 */
5126 if (facet->type == XML_SCHEMA_FACET_LENGTH) {
5127 if (len != facet->val->value.decimal.lo)
5128 return(XML_SCHEMAV_CVC_LENGTH_VALID);
5129 } else if (facet->type == XML_SCHEMA_FACET_MINLENGTH) {
5130 if (len < facet->val->value.decimal.lo)
5131 return(XML_SCHEMAV_CVC_MINLENGTH_VALID);
5132 } else {
5133 if (len > facet->val->value.decimal.lo)
5134 return(XML_SCHEMAV_CVC_MAXLENGTH_VALID);
5135 }
5136
5137 return (0);
5138}
5139
5140/**
5141 * xmlSchemaValidateLengthFacet:
5142 * @type: the built-in type
5143 * @facet: the facet to check
5144 * @value: the lexical repr. of the value to be validated
5145 * @val: the precomputed value
Daniel Veillardc0826a72004-08-10 14:17:33 +00005146 * @length: the actual length of the value
5147 *
5148 * Checka a value against a "length", "minLength" and "maxLength"
5149 * facet; sets @length to the computed length of @value.
5150 *
5151 * Returns 0 if the value is valid, a positive error code
5152 * otherwise and -1 in case of an internal or API error.
5153 */
5154int
5155xmlSchemaValidateLengthFacet(xmlSchemaTypePtr type,
5156 xmlSchemaFacetPtr facet,
5157 const xmlChar *value,
5158 xmlSchemaValPtr val,
5159 unsigned long *length)
5160{
Daniel Veillardcc5e2332005-03-16 21:55:35 +00005161 if (type == NULL)
5162 return(-1);
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005163 return (xmlSchemaValidateLengthFacetInternal(facet,
5164 type->builtInType, value, val, length,
5165 XML_SCHEMA_WHITESPACE_UNKNOWN));
5166}
Daniel Veillardc0826a72004-08-10 14:17:33 +00005167
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005168/**
5169 * xmlSchemaValidateLengthFacetWhtsp:
5170 * @facet: the facet to check
5171 * @valType: the built-in type
5172 * @value: the lexical repr. of the value to be validated
5173 * @val: the precomputed value
5174 * @ws: the whitespace type of the value
5175 * @length: the actual length of the value
5176 *
5177 * Checka a value against a "length", "minLength" and "maxLength"
5178 * facet; sets @length to the computed length of @value.
5179 *
5180 * Returns 0 if the value is valid, a positive error code
5181 * otherwise and -1 in case of an internal or API error.
5182 */
5183int
5184xmlSchemaValidateLengthFacetWhtsp(xmlSchemaFacetPtr facet,
5185 xmlSchemaValType valType,
5186 const xmlChar *value,
5187 xmlSchemaValPtr val,
5188 unsigned long *length,
5189 xmlSchemaWhitespaceValueType ws)
5190{
5191 return (xmlSchemaValidateLengthFacetInternal(facet, valType, value, val,
5192 length, ws));
Daniel Veillardc0826a72004-08-10 14:17:33 +00005193}
5194
5195/**
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005196 * xmlSchemaValidateFacetInternal:
Daniel Veillard4255d502002-04-16 15:50:10 +00005197 * @facet: the facet to check
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005198 * @fws: the whitespace type of the facet's value
5199 * @valType: the built-in type of the value
Daniel Veillard4255d502002-04-16 15:50:10 +00005200 * @value: the lexical repr of the value to validate
5201 * @val: the precomputed value
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005202 * @ws: the whitespace type of the value
Daniel Veillard4255d502002-04-16 15:50:10 +00005203 *
5204 * Check a value against a facet condition
5205 *
5206 * Returns 0 if the element is schemas valid, a positive error code
5207 * number otherwise and -1 in case of internal or API error.
5208 */
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005209static int
5210xmlSchemaValidateFacetInternal(xmlSchemaFacetPtr facet,
5211 xmlSchemaWhitespaceValueType fws,
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005212 xmlSchemaValType valType,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005213 const xmlChar *value,
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005214 xmlSchemaValPtr val,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005215 xmlSchemaWhitespaceValueType ws)
Daniel Veillard4255d502002-04-16 15:50:10 +00005216{
5217 int ret;
5218
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005219 if (facet == NULL)
5220 return(-1);
5221
Daniel Veillard4255d502002-04-16 15:50:10 +00005222 switch (facet->type) {
5223 case XML_SCHEMA_FACET_PATTERN:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005224 /*
5225 * NOTE that for patterns, the @value needs to be the normalized
5226 * value, *not* the lexical initial value or the canonical value.
5227 */
5228 if (value == NULL)
5229 return(-1);
Daniel Veillard4255d502002-04-16 15:50:10 +00005230 ret = xmlRegexpExec(facet->regexp, value);
5231 if (ret == 1)
5232 return(0);
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005233 if (ret == 0)
Daniel Veillard01fa6152004-06-29 17:04:39 +00005234 return(XML_SCHEMAV_CVC_PATTERN_VALID);
Daniel Veillard4255d502002-04-16 15:50:10 +00005235 return(ret);
5236 case XML_SCHEMA_FACET_MAXEXCLUSIVE:
5237 ret = xmlSchemaCompareValues(val, facet->val);
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005238 if (ret == -2)
Daniel Veillard4255d502002-04-16 15:50:10 +00005239 return(-1);
Daniel Veillard4255d502002-04-16 15:50:10 +00005240 if (ret == -1)
5241 return(0);
Daniel Veillard01fa6152004-06-29 17:04:39 +00005242 return(XML_SCHEMAV_CVC_MAXEXCLUSIVE_VALID);
Daniel Veillard070803b2002-05-03 07:29:38 +00005243 case XML_SCHEMA_FACET_MAXINCLUSIVE:
5244 ret = xmlSchemaCompareValues(val, facet->val);
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005245 if (ret == -2)
Daniel Veillard070803b2002-05-03 07:29:38 +00005246 return(-1);
Daniel Veillard070803b2002-05-03 07:29:38 +00005247 if ((ret == -1) || (ret == 0))
5248 return(0);
Daniel Veillard01fa6152004-06-29 17:04:39 +00005249 return(XML_SCHEMAV_CVC_MAXINCLUSIVE_VALID);
Daniel Veillard070803b2002-05-03 07:29:38 +00005250 case XML_SCHEMA_FACET_MINEXCLUSIVE:
5251 ret = xmlSchemaCompareValues(val, facet->val);
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005252 if (ret == -2)
Daniel Veillard070803b2002-05-03 07:29:38 +00005253 return(-1);
Daniel Veillard070803b2002-05-03 07:29:38 +00005254 if (ret == 1)
5255 return(0);
Daniel Veillard01fa6152004-06-29 17:04:39 +00005256 return(XML_SCHEMAV_CVC_MINEXCLUSIVE_VALID);
Daniel Veillard070803b2002-05-03 07:29:38 +00005257 case XML_SCHEMA_FACET_MININCLUSIVE:
5258 ret = xmlSchemaCompareValues(val, facet->val);
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005259 if (ret == -2)
Daniel Veillard070803b2002-05-03 07:29:38 +00005260 return(-1);
Daniel Veillard070803b2002-05-03 07:29:38 +00005261 if ((ret == 1) || (ret == 0))
5262 return(0);
Daniel Veillard01fa6152004-06-29 17:04:39 +00005263 return(XML_SCHEMAV_CVC_MININCLUSIVE_VALID);
Daniel Veillard8651f532002-04-17 09:06:27 +00005264 case XML_SCHEMA_FACET_WHITESPACE:
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005265 /* TODO whitespaces */
Daniel Veillard01fa6152004-06-29 17:04:39 +00005266 /*
5267 * NOTE: Whitespace should be handled to normalize
5268 * the value to be validated against a the facets;
5269 * not to normalize the value in-between.
5270 */
Daniel Veillard8651f532002-04-17 09:06:27 +00005271 return(0);
Daniel Veillard88c58912002-04-23 07:12:20 +00005272 case XML_SCHEMA_FACET_ENUMERATION:
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005273 if (ws == XML_SCHEMA_WHITESPACE_UNKNOWN) {
5274 /*
5275 * This is to ensure API compatibility with the old
5276 * xmlSchemaValidateFacet().
5277 * TODO: Get rid of this case.
5278 */
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005279 if ((facet->value != NULL) &&
5280 (xmlStrEqual(facet->value, value)))
5281 return(0);
5282 } else {
5283 ret = xmlSchemaCompareValuesWhtspExt(facet->val->type,
5284 facet->val, facet->value, fws, valType, val,
5285 value, ws);
5286 if (ret == -2)
5287 return(-1);
5288 if (ret == 0)
5289 return(0);
5290 }
Daniel Veillard01fa6152004-06-29 17:04:39 +00005291 return(XML_SCHEMAV_CVC_ENUMERATION_VALID);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005292 case XML_SCHEMA_FACET_LENGTH:
Kasimier T. Buchcikaba15f72005-04-01 15:17:27 +00005293 /*
5294 * SPEC (1.3) "if {primitive type definition} is QName or NOTATION,
5295 * then any {value} is facet-valid."
5296 */
5297 if ((valType == XML_SCHEMAS_QNAME) ||
5298 (valType == XML_SCHEMAS_NOTATION))
5299 return (0);
5300 /* No break on purpose. */
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005301 case XML_SCHEMA_FACET_MAXLENGTH:
5302 case XML_SCHEMA_FACET_MINLENGTH: {
5303 unsigned int len = 0;
5304
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00005305 if ((valType == XML_SCHEMAS_QNAME) ||
5306 (valType == XML_SCHEMAS_NOTATION))
5307 return (0);
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005308 /*
5309 * TODO: length, maxLength and minLength must be of type
5310 * nonNegativeInteger only. Check if decimal is used somehow.
5311 */
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005312 if ((facet->val == NULL) ||
Daniel Veillarde637c4a2003-03-30 21:10:09 +00005313 ((facet->val->type != XML_SCHEMAS_DECIMAL) &&
5314 (facet->val->type != XML_SCHEMAS_NNINTEGER)) ||
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005315 (facet->val->value.decimal.frac != 0)) {
5316 return(-1);
5317 }
Daniel Veillard560c2a42003-07-06 21:13:49 +00005318 if ((val != NULL) && (val->type == XML_SCHEMAS_HEXBINARY))
Daniel Veillard70bcb0e2003-08-08 14:00:28 +00005319 len = val->value.hex.total;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00005320 else if ((val != NULL) && (val->type == XML_SCHEMAS_BASE64BINARY))
5321 len = val->value.base64.total;
5322 else {
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005323 switch (valType) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005324 case XML_SCHEMAS_STRING:
5325 case XML_SCHEMAS_NORMSTRING:
5326 if (ws == XML_SCHEMA_WHITESPACE_UNKNOWN) {
5327 /*
5328 * This is to ensure API compatibility with the old
5329 * xmlSchemaValidateFacet(). Anyway, this was and
5330 * is not the correct handling.
5331 * TODO: Get rid of this case somehow.
5332 */
5333 if (valType == XML_SCHEMAS_STRING)
5334 len = xmlUTF8Strlen(value);
5335 else
5336 len = xmlSchemaNormLen(value);
5337 } else if (value != NULL) {
5338 if (ws == XML_SCHEMA_WHITESPACE_COLLAPSE)
5339 len = xmlSchemaNormLen(value);
5340 else
5341 /*
5342 * Should be OK for "preserve" as well.
5343 */
5344 len = xmlUTF8Strlen(value);
5345 }
5346 break;
5347 case XML_SCHEMAS_IDREF:
Daniel Veillard560c2a42003-07-06 21:13:49 +00005348 case XML_SCHEMAS_TOKEN:
5349 case XML_SCHEMAS_LANGUAGE:
5350 case XML_SCHEMAS_NMTOKEN:
5351 case XML_SCHEMAS_NAME:
5352 case XML_SCHEMAS_NCNAME:
5353 case XML_SCHEMAS_ID:
Daniel Veillard01fa6152004-06-29 17:04:39 +00005354 case XML_SCHEMAS_ANYURI:
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005355 if (value != NULL)
5356 len = xmlSchemaNormLen(value);
5357 break;
Daniel Veillard560c2a42003-07-06 21:13:49 +00005358 default:
5359 TODO
Daniel Veillard70bcb0e2003-08-08 14:00:28 +00005360 }
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005361 }
5362 if (facet->type == XML_SCHEMA_FACET_LENGTH) {
Daniel Veillarde637c4a2003-03-30 21:10:09 +00005363 if (len != facet->val->value.decimal.lo)
Daniel Veillard01fa6152004-06-29 17:04:39 +00005364 return(XML_SCHEMAV_CVC_LENGTH_VALID);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005365 } else if (facet->type == XML_SCHEMA_FACET_MINLENGTH) {
Daniel Veillarde637c4a2003-03-30 21:10:09 +00005366 if (len < facet->val->value.decimal.lo)
Daniel Veillard01fa6152004-06-29 17:04:39 +00005367 return(XML_SCHEMAV_CVC_MINLENGTH_VALID);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005368 } else {
Daniel Veillarde637c4a2003-03-30 21:10:09 +00005369 if (len > facet->val->value.decimal.lo)
Daniel Veillard01fa6152004-06-29 17:04:39 +00005370 return(XML_SCHEMAV_CVC_MAXLENGTH_VALID);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005371 }
5372 break;
5373 }
Daniel Veillard560c2a42003-07-06 21:13:49 +00005374 case XML_SCHEMA_FACET_TOTALDIGITS:
5375 case XML_SCHEMA_FACET_FRACTIONDIGITS:
5376
5377 if ((facet->val == NULL) ||
5378 ((facet->val->type != XML_SCHEMAS_DECIMAL) &&
5379 (facet->val->type != XML_SCHEMAS_NNINTEGER)) ||
5380 (facet->val->value.decimal.frac != 0)) {
5381 return(-1);
5382 }
5383 if ((val == NULL) ||
5384 ((val->type != XML_SCHEMAS_DECIMAL) &&
5385 (val->type != XML_SCHEMAS_INTEGER) &&
5386 (val->type != XML_SCHEMAS_NPINTEGER) &&
5387 (val->type != XML_SCHEMAS_NINTEGER) &&
5388 (val->type != XML_SCHEMAS_NNINTEGER) &&
5389 (val->type != XML_SCHEMAS_PINTEGER) &&
5390 (val->type != XML_SCHEMAS_INT) &&
5391 (val->type != XML_SCHEMAS_UINT) &&
5392 (val->type != XML_SCHEMAS_LONG) &&
5393 (val->type != XML_SCHEMAS_ULONG) &&
5394 (val->type != XML_SCHEMAS_SHORT) &&
5395 (val->type != XML_SCHEMAS_USHORT) &&
5396 (val->type != XML_SCHEMAS_BYTE) &&
5397 (val->type != XML_SCHEMAS_UBYTE))) {
5398 return(-1);
5399 }
5400 if (facet->type == XML_SCHEMA_FACET_TOTALDIGITS) {
5401 if (val->value.decimal.total > facet->val->value.decimal.lo)
Daniel Veillard01fa6152004-06-29 17:04:39 +00005402 return(XML_SCHEMAV_CVC_TOTALDIGITS_VALID);
Daniel Veillard560c2a42003-07-06 21:13:49 +00005403
5404 } else if (facet->type == XML_SCHEMA_FACET_FRACTIONDIGITS) {
5405 if (val->value.decimal.frac > facet->val->value.decimal.lo)
Daniel Veillard01fa6152004-06-29 17:04:39 +00005406 return(XML_SCHEMAV_CVC_FRACTIONDIGITS_VALID);
Daniel Veillard560c2a42003-07-06 21:13:49 +00005407 }
5408 break;
Daniel Veillard4255d502002-04-16 15:50:10 +00005409 default:
5410 TODO
5411 }
5412 return(0);
Daniel Veillardb6c7f412003-03-29 16:41:55 +00005413
Daniel Veillard4255d502002-04-16 15:50:10 +00005414}
5415
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005416/**
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005417 * xmlSchemaValidateFacet:
5418 * @base: the base type
5419 * @facet: the facet to check
5420 * @value: the lexical repr of the value to validate
5421 * @val: the precomputed value
5422 *
5423 * Check a value against a facet condition
5424 *
5425 * Returns 0 if the element is schemas valid, a positive error code
5426 * number otherwise and -1 in case of internal or API error.
5427 */
5428int
Kasimier T. Buchcik9dbb0ce2005-03-16 16:39:23 +00005429xmlSchemaValidateFacet(xmlSchemaTypePtr base,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005430 xmlSchemaFacetPtr facet,
5431 const xmlChar *value,
5432 xmlSchemaValPtr val)
5433{
5434 /*
5435 * This tries to ensure API compatibility regarding the old
5436 * xmlSchemaValidateFacet() and the new xmlSchemaValidateFacetInternal() and
5437 * xmlSchemaValidateFacetWhtsp().
5438 */
Kasimier T. Buchcik9dbb0ce2005-03-16 16:39:23 +00005439 if (val != NULL)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005440 return(xmlSchemaValidateFacetInternal(facet,
Kasimier T. Buchcik9dbb0ce2005-03-16 16:39:23 +00005441 XML_SCHEMA_WHITESPACE_UNKNOWN, val->type, value, val,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005442 XML_SCHEMA_WHITESPACE_UNKNOWN));
Kasimier T. Buchcik9dbb0ce2005-03-16 16:39:23 +00005443 else if (base != NULL)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005444 return(xmlSchemaValidateFacetInternal(facet,
Kasimier T. Buchcik9dbb0ce2005-03-16 16:39:23 +00005445 XML_SCHEMA_WHITESPACE_UNKNOWN, base->builtInType, value, val,
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005446 XML_SCHEMA_WHITESPACE_UNKNOWN));
Kasimier T. Buchcik9dbb0ce2005-03-16 16:39:23 +00005447 return(-1);
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005448}
5449
5450/**
5451 * xmlSchemaValidateFacetWhtsp:
5452 * @facet: the facet to check
5453 * @fws: the whitespace type of the facet's value
5454 * @valType: the built-in type of the value
5455 * @value: the lexical (or normalized for pattern) repr of the value to validate
5456 * @val: the precomputed value
5457 * @ws: the whitespace type of the value
5458 *
5459 * Check a value against a facet condition. This takes value normalization
5460 * according to the specified whitespace types into account.
5461 * Note that @value needs to be the *normalized* value if the facet
5462 * is of type "pattern".
5463 *
5464 * Returns 0 if the element is schemas valid, a positive error code
5465 * number otherwise and -1 in case of internal or API error.
5466 */
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005467int
5468xmlSchemaValidateFacetWhtsp(xmlSchemaFacetPtr facet,
5469 xmlSchemaWhitespaceValueType fws,
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005470 xmlSchemaValType valType,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005471 const xmlChar *value,
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005472 xmlSchemaValPtr val,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005473 xmlSchemaWhitespaceValueType ws)
5474{
5475 return(xmlSchemaValidateFacetInternal(facet, fws, valType,
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005476 value, val, ws));
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005477}
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005478
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005479#if 0
5480#ifndef DBL_DIG
5481#define DBL_DIG 16
5482#endif
5483#ifndef DBL_EPSILON
5484#define DBL_EPSILON 1E-9
5485#endif
5486
5487#define INTEGER_DIGITS DBL_DIG
5488#define FRACTION_DIGITS (DBL_DIG + 1)
5489#define EXPONENT_DIGITS (3 + 2)
5490
5491/**
5492 * xmlXPathFormatNumber:
5493 * @number: number to format
5494 * @buffer: output buffer
5495 * @buffersize: size of output buffer
5496 *
5497 * Convert the number into a string representation.
5498 */
5499static void
5500xmlSchemaFormatFloat(double number, char buffer[], int buffersize)
5501{
5502 switch (xmlXPathIsInf(number)) {
5503 case 1:
5504 if (buffersize > (int)sizeof("INF"))
5505 snprintf(buffer, buffersize, "INF");
5506 break;
5507 case -1:
5508 if (buffersize > (int)sizeof("-INF"))
5509 snprintf(buffer, buffersize, "-INF");
5510 break;
5511 default:
5512 if (xmlXPathIsNaN(number)) {
5513 if (buffersize > (int)sizeof("NaN"))
5514 snprintf(buffer, buffersize, "NaN");
5515 } else if (number == 0) {
5516 snprintf(buffer, buffersize, "0.0E0");
5517 } else {
5518 /* 3 is sign, decimal point, and terminating zero */
5519 char work[DBL_DIG + EXPONENT_DIGITS + 3];
5520 int integer_place, fraction_place;
5521 char *ptr;
5522 char *after_fraction;
5523 double absolute_value;
5524 int size;
5525
5526 absolute_value = fabs(number);
5527
5528 /*
5529 * Result is in work, and after_fraction points
5530 * just past the fractional part.
5531 * Use scientific notation
5532 */
5533 integer_place = DBL_DIG + EXPONENT_DIGITS + 1;
5534 fraction_place = DBL_DIG - 1;
5535 snprintf(work, sizeof(work),"%*.*e",
5536 integer_place, fraction_place, number);
5537 after_fraction = strchr(work + DBL_DIG, 'e');
5538 /* Remove fractional trailing zeroes */
5539 ptr = after_fraction;
5540 while (*(--ptr) == '0')
5541 ;
5542 if (*ptr != '.')
5543 ptr++;
5544 while ((*ptr++ = *after_fraction++) != 0);
5545
5546 /* Finally copy result back to caller */
5547 size = strlen(work) + 1;
5548 if (size > buffersize) {
5549 work[buffersize - 1] = 0;
5550 size = buffersize;
5551 }
5552 memmove(buffer, work, size);
5553 }
5554 break;
5555 }
5556}
5557#endif
5558
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005559/**
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005560 * xmlSchemaGetCanonValue:
5561 * @val: the precomputed value
5562 * @retValue: the returned value
5563 *
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005564 * Get a the cononical lexical representation of the value.
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005565 * The caller has to FREE the returned retValue.
5566 *
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005567 * WARNING: Some value types are not supported yet, resulting
5568 * in a @retValue of "???".
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005569 *
5570 * TODO: XML Schema 1.0 does not define canonical representations
5571 * for: duration, gYearMonth, gYear, gMonthDay, gMonth, gDay,
5572 * anyURI, QName, NOTATION. This will be fixed in XML Schema 1.1.
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005573 *
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005574 *
5575 * Returns 0 if the value could be built, 1 if the value type is
5576 * not supported yet and -1 in case of API errors.
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005577 */
5578int
Daniel Veillardb5839c32005-02-19 18:27:14 +00005579xmlSchemaGetCanonValue(xmlSchemaValPtr val, const xmlChar **retValue)
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005580{
Daniel Veillardb5839c32005-02-19 18:27:14 +00005581 if ((retValue == NULL) || (val == NULL))
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005582 return (-1);
5583 *retValue = NULL;
5584 switch (val->type) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005585 case XML_SCHEMAS_STRING:
5586 if (val->value.str == NULL)
5587 *retValue = BAD_CAST xmlStrdup(BAD_CAST "");
5588 else
5589 *retValue =
5590 BAD_CAST xmlStrdup((const xmlChar *) val->value.str);
5591 break;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005592 case XML_SCHEMAS_NORMSTRING:
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005593 if (val->value.str == NULL)
5594 *retValue = BAD_CAST xmlStrdup(BAD_CAST "");
5595 else {
5596 *retValue = xmlSchemaWhiteSpaceReplace(
5597 (const xmlChar *) val->value.str);
5598 if ((*retValue) == NULL)
5599 *retValue = BAD_CAST xmlStrdup(
5600 (const xmlChar *) val->value.str);
5601 }
5602 break;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005603 case XML_SCHEMAS_TOKEN:
5604 case XML_SCHEMAS_LANGUAGE:
5605 case XML_SCHEMAS_NMTOKEN:
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005606 case XML_SCHEMAS_NAME:
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005607 case XML_SCHEMAS_NCNAME:
5608 case XML_SCHEMAS_ID:
5609 case XML_SCHEMAS_IDREF:
5610 case XML_SCHEMAS_ENTITY:
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005611 case XML_SCHEMAS_NOTATION: /* Unclear */
5612 case XML_SCHEMAS_ANYURI: /* Unclear */
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005613 if (val->value.str == NULL)
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005614 return (-1);
Kasimier T. Buchcikaba15f72005-04-01 15:17:27 +00005615 *retValue =
5616 BAD_CAST xmlSchemaCollapseString(BAD_CAST val->value.str);
5617 if (*retValue == NULL)
5618 *retValue =
5619 BAD_CAST xmlStrdup((const xmlChar *) val->value.str);
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005620 break;
5621 case XML_SCHEMAS_QNAME:
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005622 /* TODO: Unclear in XML Schema 1.0. */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005623 if (val->value.qname.uri == NULL) {
5624 *retValue = BAD_CAST xmlStrdup(BAD_CAST val->value.qname.name);
5625 return (0);
5626 } else {
5627 *retValue = BAD_CAST xmlStrdup(BAD_CAST "{");
5628 *retValue = BAD_CAST xmlStrcat((xmlChar *) (*retValue),
5629 BAD_CAST val->value.qname.uri);
5630 *retValue = BAD_CAST xmlStrcat((xmlChar *) (*retValue),
5631 BAD_CAST "}");
5632 *retValue = BAD_CAST xmlStrcat((xmlChar *) (*retValue),
5633 BAD_CAST val->value.qname.uri);
5634 }
5635 break;
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005636 case XML_SCHEMAS_DECIMAL:
5637 /*
5638 * TODO: Lookout for a more simple implementation.
5639 */
5640 if ((val->value.decimal.total == 1) &&
5641 (val->value.decimal.lo == 0)) {
5642 *retValue = xmlStrdup(BAD_CAST "0.0");
5643 } else {
5644 xmlSchemaValDecimal dec = val->value.decimal;
5645 int bufsize;
5646 char *buf = NULL, *offs;
5647
5648 /* Add room for the decimal point as well. */
5649 bufsize = dec.total + 2;
5650 if (dec.sign)
5651 bufsize++;
5652 /* Add room for leading/trailing zero. */
5653 if ((dec.frac == 0) || (dec.frac == dec.total))
5654 bufsize++;
5655 buf = xmlMalloc(bufsize);
5656 offs = buf;
5657 if (dec.sign)
5658 *offs++ = '-';
5659 if (dec.frac == dec.total) {
5660 *offs++ = '0';
5661 *offs++ = '.';
5662 }
5663 if (dec.hi != 0)
5664 snprintf(offs, bufsize - (offs - buf),
5665 "%lu%lu%lu", dec.hi, dec.mi, dec.lo);
5666 else if (dec.mi != 0)
5667 snprintf(offs, bufsize - (offs - buf),
5668 "%lu%lu", dec.mi, dec.lo);
5669 else
5670 snprintf(offs, bufsize - (offs - buf),
5671 "%lu", dec.lo);
5672
5673 if (dec.frac != 0) {
5674 if (dec.frac != dec.total) {
5675 int diff = dec.total - dec.frac;
5676 /*
5677 * Insert the decimal point.
5678 */
5679 memmove(offs + diff + 1, offs + diff, dec.frac +1);
5680 offs[diff] = '.';
5681 } else {
5682 unsigned int i = 0;
5683 /*
5684 * Insert missing zeroes behind the decimal point.
5685 */
5686 while (*(offs + i) != 0)
5687 i++;
5688 if (i < dec.total) {
5689 memmove(offs + (dec.total - i), offs, i +1);
5690 memset(offs, '0', dec.total - i);
5691 }
5692 }
5693 } else {
5694 /*
5695 * Append decimal point and zero.
5696 */
5697 offs = buf + bufsize - 1;
5698 *offs-- = 0;
5699 *offs-- = '0';
5700 *offs-- = '.';
5701 }
5702 *retValue = BAD_CAST buf;
5703 }
5704 break;
5705 case XML_SCHEMAS_INTEGER:
5706 case XML_SCHEMAS_PINTEGER:
5707 case XML_SCHEMAS_NPINTEGER:
5708 case XML_SCHEMAS_NINTEGER:
5709 case XML_SCHEMAS_NNINTEGER:
5710 case XML_SCHEMAS_LONG:
5711 case XML_SCHEMAS_BYTE:
5712 case XML_SCHEMAS_SHORT:
5713 case XML_SCHEMAS_INT:
5714 case XML_SCHEMAS_UINT:
5715 case XML_SCHEMAS_ULONG:
5716 case XML_SCHEMAS_USHORT:
5717 case XML_SCHEMAS_UBYTE:
5718 if ((val->value.decimal.total == 1) &&
5719 (val->value.decimal.lo == 0))
5720 *retValue = xmlStrdup(BAD_CAST "0");
5721 else {
5722 xmlSchemaValDecimal dec = val->value.decimal;
5723 int bufsize = dec.total + 1;
5724
5725 /* Add room for the decimal point as well. */
5726 if (dec.sign)
5727 bufsize++;
5728 *retValue = xmlMalloc(bufsize);
5729 if (dec.hi != 0) {
5730 if (dec.sign)
5731 snprintf((char *) *retValue, bufsize,
5732 "-%lu%lu%lu", dec.hi, dec.mi, dec.lo);
5733 else
5734 snprintf((char *) *retValue, bufsize,
5735 "%lu%lu%lu", dec.hi, dec.mi, dec.lo);
5736 } else if (dec.mi != 0) {
5737 if (dec.sign)
5738 snprintf((char *) *retValue, bufsize,
5739 "-%lu%lu", dec.mi, dec.lo);
5740 else
5741 snprintf((char *) *retValue, bufsize,
5742 "%lu%lu", dec.mi, dec.lo);
5743 } else {
5744 if (dec.sign)
5745 snprintf((char *) *retValue, bufsize, "-%lu", dec.lo);
5746 else
5747 snprintf((char *) *retValue, bufsize, "%lu", dec.lo);
5748 }
5749 }
5750 break;
5751 case XML_SCHEMAS_BOOLEAN:
5752 if (val->value.b)
5753 *retValue = BAD_CAST xmlStrdup(BAD_CAST "true");
5754 else
5755 *retValue = BAD_CAST xmlStrdup(BAD_CAST "false");
5756 break;
5757 case XML_SCHEMAS_DURATION: {
5758 char buf[100];
5759 unsigned long year;
5760 unsigned long mon, day, hour = 0, min = 0;
5761 double sec = 0, left;
5762
5763 /* TODO: Unclear in XML Schema 1.0 */
5764 /*
5765 * TODO: This results in a normalized output of the value
5766 * - which is NOT conformant to the spec -
5767 * since the exact values of each property are not
5768 * recoverable. Think about extending the structure to
5769 * provide a field for every property.
5770 */
5771 year = (unsigned long) FQUOTIENT(labs(val->value.dur.mon), 12);
5772 mon = labs(val->value.dur.mon) - 12 * year;
5773
5774 day = (unsigned long) FQUOTIENT(fabs(val->value.dur.sec), 86400);
5775 left = fabs(val->value.dur.sec) - day * 86400;
5776 if (left > 0) {
5777 hour = (unsigned long) FQUOTIENT(left, 3600);
5778 left = left - (hour * 3600);
5779 if (left > 0) {
5780 min = (unsigned long) FQUOTIENT(left, 60);
5781 sec = left - (min * 60);
5782 }
5783 }
5784 if ((val->value.dur.mon < 0) || (val->value.dur.sec < 0))
5785 snprintf(buf, 100, "P%luY%luM%luDT%luH%luM%.14gS",
5786 year, mon, day, hour, min, sec);
5787 else
5788 snprintf(buf, 100, "-P%luY%luM%luDT%luH%luM%.14gS",
5789 year, mon, day, hour, min, sec);
5790 *retValue = BAD_CAST xmlStrdup(BAD_CAST buf);
5791 }
5792 break;
5793 case XML_SCHEMAS_GYEAR: {
5794 char buf[30];
5795 /* TODO: Unclear in XML Schema 1.0 */
5796 /* TODO: What to do with the timezone? */
5797 snprintf(buf, 30, "%04ld", val->value.date.year);
5798 *retValue = BAD_CAST xmlStrdup(BAD_CAST buf);
5799 }
5800 break;
5801 case XML_SCHEMAS_GMONTH: {
5802 /* TODO: Unclear in XML Schema 1.0 */
5803 /* TODO: What to do with the timezone? */
5804 *retValue = xmlMalloc(5);
5805 snprintf((char *) *retValue, 6, "--%02u",
5806 val->value.date.mon);
5807 }
5808 break;
5809 case XML_SCHEMAS_GDAY: {
5810 /* TODO: Unclear in XML Schema 1.0 */
5811 /* TODO: What to do with the timezone? */
5812 *retValue = xmlMalloc(6);
5813 snprintf((char *) *retValue, 6, "---%02u",
5814 val->value.date.day);
5815 }
5816 break;
5817 case XML_SCHEMAS_GMONTHDAY: {
5818 /* TODO: Unclear in XML Schema 1.0 */
5819 /* TODO: What to do with the timezone? */
5820 *retValue = xmlMalloc(8);
5821 snprintf((char *) *retValue, 8, "--%02u-%02u",
5822 val->value.date.mon, val->value.date.day);
5823 }
5824 break;
5825 case XML_SCHEMAS_GYEARMONTH: {
5826 char buf[35];
5827 /* TODO: Unclear in XML Schema 1.0 */
5828 /* TODO: What to do with the timezone? */
5829 if (val->value.date.year < 0)
5830 snprintf(buf, 35, "-%04ld-%02u",
5831 labs(val->value.date.year),
5832 val->value.date.mon);
5833 else
5834 snprintf(buf, 35, "%04ld-%02u",
5835 val->value.date.year, val->value.date.mon);
5836 *retValue = BAD_CAST xmlStrdup(BAD_CAST buf);
5837 }
5838 break;
5839 case XML_SCHEMAS_TIME:
5840 {
5841 char buf[30];
5842
5843 if (val->value.date.tz_flag) {
5844 xmlSchemaValPtr norm;
5845
5846 norm = xmlSchemaDateNormalize(val, 0);
5847 if (norm == NULL)
5848 return (-1);
5849 /*
5850 * TODO: Check if "%.14g" is portable.
5851 */
5852 snprintf(buf, 30,
5853 "%02u:%02u:%02.14gZ",
5854 norm->value.date.hour,
5855 norm->value.date.min,
5856 norm->value.date.sec);
5857 xmlSchemaFreeValue(norm);
5858 } else {
5859 snprintf(buf, 30,
5860 "%02u:%02u:%02.14g",
5861 val->value.date.hour,
5862 val->value.date.min,
5863 val->value.date.sec);
5864 }
5865 *retValue = BAD_CAST xmlStrdup(BAD_CAST buf);
5866 }
5867 break;
5868 case XML_SCHEMAS_DATE:
5869 {
5870 char buf[30];
5871
5872 if (val->value.date.tz_flag) {
5873 xmlSchemaValPtr norm;
5874
5875 norm = xmlSchemaDateNormalize(val, 0);
5876 if (norm == NULL)
5877 return (-1);
5878 /*
5879 * TODO: Append the canonical value of the
5880 * recoverable timezone and not "Z".
5881 */
5882 snprintf(buf, 30,
5883 "%04ld:%02u:%02uZ",
5884 norm->value.date.year, norm->value.date.mon,
5885 norm->value.date.day);
5886 xmlSchemaFreeValue(norm);
5887 } else {
5888 snprintf(buf, 30,
5889 "%04ld:%02u:%02u",
5890 val->value.date.year, val->value.date.mon,
5891 val->value.date.day);
5892 }
5893 *retValue = BAD_CAST xmlStrdup(BAD_CAST buf);
5894 }
5895 break;
5896 case XML_SCHEMAS_DATETIME:
5897 {
5898 char buf[50];
5899
5900 if (val->value.date.tz_flag) {
5901 xmlSchemaValPtr norm;
5902
5903 norm = xmlSchemaDateNormalize(val, 0);
5904 if (norm == NULL)
5905 return (-1);
5906 /*
5907 * TODO: Check if "%.14g" is portable.
5908 */
5909 snprintf(buf, 50,
5910 "%04ld:%02u:%02uT%02u:%02u:%02.14gZ",
5911 norm->value.date.year, norm->value.date.mon,
5912 norm->value.date.day, norm->value.date.hour,
5913 norm->value.date.min, norm->value.date.sec);
5914 xmlSchemaFreeValue(norm);
5915 } else {
5916 snprintf(buf, 50,
5917 "%04ld:%02u:%02uT%02u:%02u:%02.14g",
5918 val->value.date.year, val->value.date.mon,
5919 val->value.date.day, val->value.date.hour,
5920 val->value.date.min, val->value.date.sec);
5921 }
5922 *retValue = BAD_CAST xmlStrdup(BAD_CAST buf);
5923 }
5924 break;
5925 case XML_SCHEMAS_HEXBINARY:
5926 *retValue = BAD_CAST xmlStrdup(BAD_CAST val->value.hex.str);
5927 break;
5928 case XML_SCHEMAS_BASE64BINARY:
5929 /*
5930 * TODO: Is the following spec piece implemented?:
5931 * SPEC: "Note: For some values the canonical form defined
5932 * above does not conform to [RFC 2045], which requires breaking
5933 * with linefeeds at appropriate intervals."
5934 */
5935 *retValue = BAD_CAST xmlStrdup(BAD_CAST val->value.base64.str);
5936 break;
5937 case XML_SCHEMAS_FLOAT: {
5938 char buf[30];
5939 /*
5940 * |m| < 16777216, -149 <= e <= 104.
5941 * TODO: Handle, NaN, INF, -INF. The format is not
5942 * yet conformant. The c type float does not cover
5943 * the whole range.
5944 */
5945 snprintf(buf, 30, "%01.14e", val->value.f);
5946 *retValue = BAD_CAST xmlStrdup(BAD_CAST buf);
5947 }
5948 break;
5949 case XML_SCHEMAS_DOUBLE: {
5950 char buf[40];
5951 /* |m| < 9007199254740992, -1075 <= e <= 970 */
5952 /*
5953 * TODO: Handle, NaN, INF, -INF. The format is not
5954 * yet conformant. The c type float does not cover
5955 * the whole range.
5956 */
5957 snprintf(buf, 40, "%01.14e", val->value.d);
5958 *retValue = BAD_CAST xmlStrdup(BAD_CAST buf);
5959 }
5960 break;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005961 default:
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005962 *retValue = BAD_CAST xmlStrdup(BAD_CAST "???");
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005963 return (1);
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005964 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005965 return (0);
5966}
5967
Daniel Veillardbda59572005-04-01 17:15:17 +00005968/**
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005969 * xmlSchemaGetCanonValueWhtsp:
5970 * @val: the precomputed value
5971 * @retValue: the returned value
5972 * @ws: the whitespace type of the value
5973 *
5974 * Get a the cononical representation of the value.
5975 * The caller has to free the returned @retValue.
5976 *
5977 * Returns 0 if the value could be built, 1 if the value type is
5978 * not supported yet and -1 in case of API errors.
5979 */
5980int
5981xmlSchemaGetCanonValueWhtsp(xmlSchemaValPtr val,
5982 const xmlChar **retValue,
5983 xmlSchemaWhitespaceValueType ws)
5984{
5985 if ((retValue == NULL) || (val == NULL))
5986 return (-1);
5987 if ((ws == XML_SCHEMA_WHITESPACE_UNKNOWN) ||
5988 (ws > XML_SCHEMA_WHITESPACE_COLLAPSE))
5989 return (-1);
5990
5991 *retValue = NULL;
5992 switch (val->type) {
5993 case XML_SCHEMAS_STRING:
5994 if (val->value.str == NULL)
5995 *retValue = BAD_CAST xmlStrdup(BAD_CAST "");
5996 else if (ws == XML_SCHEMA_WHITESPACE_COLLAPSE)
5997 *retValue = xmlSchemaCollapseString(val->value.str);
5998 else if (ws == XML_SCHEMA_WHITESPACE_REPLACE)
5999 *retValue = xmlSchemaWhiteSpaceReplace(val->value.str);
6000 if ((*retValue) == NULL)
6001 *retValue = BAD_CAST xmlStrdup(val->value.str);
6002 break;
6003 case XML_SCHEMAS_NORMSTRING:
6004 if (val->value.str == NULL)
6005 *retValue = BAD_CAST xmlStrdup(BAD_CAST "");
6006 else {
6007 if (ws == XML_SCHEMA_WHITESPACE_COLLAPSE)
6008 *retValue = xmlSchemaCollapseString(val->value.str);
6009 else
6010 *retValue = xmlSchemaWhiteSpaceReplace(val->value.str);
6011 if ((*retValue) == NULL)
6012 *retValue = BAD_CAST xmlStrdup(val->value.str);
6013 }
6014 break;
6015 default:
6016 return (xmlSchemaGetCanonValue(val, retValue));
6017 }
6018 return (0);
6019}
6020
6021/**
Daniel Veillardbda59572005-04-01 17:15:17 +00006022 * xmlSchemaGetValType:
6023 * @val: a schemas value
6024 *
6025 * Accessor for the type of a value
6026 *
6027 * Returns the xmlSchemaValType of the value
6028 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00006029xmlSchemaValType
6030xmlSchemaGetValType(xmlSchemaValPtr val)
6031{
Daniel Veillardbda59572005-04-01 17:15:17 +00006032 if (val == NULL)
6033 return(XML_SCHEMAS_UNKNOWN);
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00006034 return (val->type);
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00006035}
6036
Daniel Veillard5d4644e2005-04-01 13:11:58 +00006037#define bottom_xmlschemastypes
6038#include "elfgcchack.h"
Daniel Veillard4255d502002-04-16 15:50:10 +00006039#endif /* LIBXML_SCHEMAS_ENABLED */