blob: 7f141686df59f33200fb69c6d49fce1a44d3797a [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/*
322 * xmlSchemaInitTypes:
323 *
324 * Initialize the default XML Schemas type library
325 */
326void
Daniel Veillard6560a422003-03-27 21:25:38 +0000327xmlSchemaInitTypes(void)
328{
Daniel Veillard4255d502002-04-16 15:50:10 +0000329 if (xmlSchemaTypesInitialized != 0)
Daniel Veillard6560a422003-03-27 21:25:38 +0000330 return;
Daniel Veillard4255d502002-04-16 15:50:10 +0000331 xmlSchemaTypesBank = xmlHashCreate(40);
Daniel Veillard6560a422003-03-27 21:25:38 +0000332
Daniel Veillard01fa6152004-06-29 17:04:39 +0000333
Daniel Veillardc6e997c2003-01-27 12:35:42 +0000334 /*
Daniel Veillard01fa6152004-06-29 17:04:39 +0000335 * 3.4.7 Built-in Complex Type Definition
336 */
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000337 xmlSchemaTypeAnyTypeDef = xmlSchemaInitBasicType("anyType",
William M. Brack2f2a6632004-08-20 23:09:47 +0000338 XML_SCHEMAS_ANYTYPE,
Daniel Veillard01fa6152004-06-29 17:04:39 +0000339 NULL);
340 xmlSchemaTypeAnyTypeDef->baseType = xmlSchemaTypeAnyTypeDef;
341 xmlSchemaTypeAnyTypeDef->contentType = XML_SCHEMA_CONTENT_MIXED;
342 {
343 xmlSchemaWildcardPtr wild;
344
345 wild = (xmlSchemaWildcardPtr) xmlMalloc(sizeof(xmlSchemaWildcard));
346 if (wild == NULL) {
William M. Brack2f2a6632004-08-20 23:09:47 +0000347 xmlSchemaTypeErrMemory(NULL, "could not create an attribute wildcard on anyType");
Daniel Veillard01fa6152004-06-29 17:04:39 +0000348 return;
349 }
350 memset(wild, 0, sizeof(xmlSchemaWildcard));
351 wild->any = 1;
352 wild->processContents = XML_SCHEMAS_ANY_LAX;
353 wild->minOccurs = 1;
354 wild->maxOccurs = 1;
355 xmlSchemaTypeAnyTypeDef->attributeWildcard = wild;
356 }
357 xmlSchemaTypeAnySimpleTypeDef = xmlSchemaInitBasicType("anySimpleType",
William M. Brack2f2a6632004-08-20 23:09:47 +0000358 XML_SCHEMAS_ANYSIMPLETYPE,
Daniel Veillard01fa6152004-06-29 17:04:39 +0000359 xmlSchemaTypeAnyTypeDef);
360 /*
361 * primitive datatypes
362 */
363 xmlSchemaTypeStringDef = xmlSchemaInitBasicType("string",
364 XML_SCHEMAS_STRING,
365 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000366 xmlSchemaTypeDecimalDef = xmlSchemaInitBasicType("decimal",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000367 XML_SCHEMAS_DECIMAL,
368 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000369 xmlSchemaTypeDateDef = xmlSchemaInitBasicType("date",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000370 XML_SCHEMAS_DATE,
371 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000372 xmlSchemaTypeDatetimeDef = xmlSchemaInitBasicType("dateTime",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000373 XML_SCHEMAS_DATETIME,
374 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000375 xmlSchemaTypeTimeDef = xmlSchemaInitBasicType("time",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000376 XML_SCHEMAS_TIME,
377 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000378 xmlSchemaTypeGYearDef = xmlSchemaInitBasicType("gYear",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000379 XML_SCHEMAS_GYEAR,
380 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000381 xmlSchemaTypeGYearMonthDef = xmlSchemaInitBasicType("gYearMonth",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000382 XML_SCHEMAS_GYEARMONTH,
383 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000384 xmlSchemaTypeGMonthDef = xmlSchemaInitBasicType("gMonth",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000385 XML_SCHEMAS_GMONTH,
386 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000387 xmlSchemaTypeGMonthDayDef = xmlSchemaInitBasicType("gMonthDay",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000388 XML_SCHEMAS_GMONTHDAY,
389 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000390 xmlSchemaTypeGDayDef = xmlSchemaInitBasicType("gDay",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000391 XML_SCHEMAS_GDAY,
392 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000393 xmlSchemaTypeDurationDef = xmlSchemaInitBasicType("duration",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000394 XML_SCHEMAS_DURATION,
395 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000396 xmlSchemaTypeFloatDef = xmlSchemaInitBasicType("float",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000397 XML_SCHEMAS_FLOAT,
398 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000399 xmlSchemaTypeDoubleDef = xmlSchemaInitBasicType("double",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000400 XML_SCHEMAS_DOUBLE,
401 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000402 xmlSchemaTypeBooleanDef = xmlSchemaInitBasicType("boolean",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000403 XML_SCHEMAS_BOOLEAN,
404 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000405 xmlSchemaTypeAnyURIDef = xmlSchemaInitBasicType("anyURI",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000406 XML_SCHEMAS_ANYURI,
407 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard560c2a42003-07-06 21:13:49 +0000408 xmlSchemaTypeHexBinaryDef = xmlSchemaInitBasicType("hexBinary",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000409 XML_SCHEMAS_HEXBINARY,
410 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard1ac24d32003-08-27 14:15:15 +0000411 xmlSchemaTypeBase64BinaryDef
Daniel Veillard01fa6152004-06-29 17:04:39 +0000412 = xmlSchemaInitBasicType("base64Binary", XML_SCHEMAS_BASE64BINARY,
413 xmlSchemaTypeAnySimpleTypeDef);
414 xmlSchemaTypeNotationDef = xmlSchemaInitBasicType("NOTATION",
415 XML_SCHEMAS_NOTATION,
416 xmlSchemaTypeAnySimpleTypeDef);
417 xmlSchemaTypeQNameDef = xmlSchemaInitBasicType("QName",
418 XML_SCHEMAS_QNAME,
419 xmlSchemaTypeAnySimpleTypeDef);
Daniel Veillard4255d502002-04-16 15:50:10 +0000420
Daniel Veillardc6e997c2003-01-27 12:35:42 +0000421 /*
422 * derived datatypes
423 */
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000424 xmlSchemaTypeIntegerDef = xmlSchemaInitBasicType("integer",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000425 XML_SCHEMAS_INTEGER,
426 xmlSchemaTypeDecimalDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000427 xmlSchemaTypeNonPositiveIntegerDef =
428 xmlSchemaInitBasicType("nonPositiveInteger",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000429 XML_SCHEMAS_NPINTEGER,
430 xmlSchemaTypeIntegerDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000431 xmlSchemaTypeNegativeIntegerDef =
Daniel Veillard01fa6152004-06-29 17:04:39 +0000432 xmlSchemaInitBasicType("negativeInteger", XML_SCHEMAS_NINTEGER,
433 xmlSchemaTypeNonPositiveIntegerDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000434 xmlSchemaTypeLongDef =
Daniel Veillard01fa6152004-06-29 17:04:39 +0000435 xmlSchemaInitBasicType("long", XML_SCHEMAS_LONG,
436 xmlSchemaTypeIntegerDef);
437 xmlSchemaTypeIntDef = xmlSchemaInitBasicType("int", XML_SCHEMAS_INT,
438 xmlSchemaTypeLongDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000439 xmlSchemaTypeShortDef = xmlSchemaInitBasicType("short",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000440 XML_SCHEMAS_SHORT,
441 xmlSchemaTypeIntDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000442 xmlSchemaTypeByteDef = xmlSchemaInitBasicType("byte",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000443 XML_SCHEMAS_BYTE,
444 xmlSchemaTypeShortDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000445 xmlSchemaTypeNonNegativeIntegerDef =
446 xmlSchemaInitBasicType("nonNegativeInteger",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000447 XML_SCHEMAS_NNINTEGER,
448 xmlSchemaTypeIntegerDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000449 xmlSchemaTypeUnsignedLongDef =
Daniel Veillard01fa6152004-06-29 17:04:39 +0000450 xmlSchemaInitBasicType("unsignedLong", XML_SCHEMAS_ULONG,
451 xmlSchemaTypeNonNegativeIntegerDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000452 xmlSchemaTypeUnsignedIntDef =
Daniel Veillard01fa6152004-06-29 17:04:39 +0000453 xmlSchemaInitBasicType("unsignedInt", XML_SCHEMAS_UINT,
454 xmlSchemaTypeUnsignedLongDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000455 xmlSchemaTypeUnsignedShortDef =
Daniel Veillard01fa6152004-06-29 17:04:39 +0000456 xmlSchemaInitBasicType("unsignedShort", XML_SCHEMAS_USHORT,
457 xmlSchemaTypeUnsignedIntDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000458 xmlSchemaTypeUnsignedByteDef =
Daniel Veillard01fa6152004-06-29 17:04:39 +0000459 xmlSchemaInitBasicType("unsignedByte", XML_SCHEMAS_UBYTE,
460 xmlSchemaTypeUnsignedShortDef);
Daniel Veillard6560a422003-03-27 21:25:38 +0000461 xmlSchemaTypePositiveIntegerDef =
Daniel Veillard01fa6152004-06-29 17:04:39 +0000462 xmlSchemaInitBasicType("positiveInteger", XML_SCHEMAS_PINTEGER,
463 xmlSchemaTypeNonNegativeIntegerDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000464 xmlSchemaTypeNormStringDef = xmlSchemaInitBasicType("normalizedString",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000465 XML_SCHEMAS_NORMSTRING,
466 xmlSchemaTypeStringDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000467 xmlSchemaTypeTokenDef = xmlSchemaInitBasicType("token",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000468 XML_SCHEMAS_TOKEN,
469 xmlSchemaTypeNormStringDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000470 xmlSchemaTypeLanguageDef = xmlSchemaInitBasicType("language",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000471 XML_SCHEMAS_LANGUAGE,
472 xmlSchemaTypeTokenDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000473 xmlSchemaTypeNameDef = xmlSchemaInitBasicType("Name",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000474 XML_SCHEMAS_NAME,
475 xmlSchemaTypeTokenDef);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +0000476 xmlSchemaTypeNmtokenDef = xmlSchemaInitBasicType("NMTOKEN",
Daniel Veillard01fa6152004-06-29 17:04:39 +0000477 XML_SCHEMAS_NMTOKEN,
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000478 xmlSchemaTypeTokenDef);
Daniel Veillard01fa6152004-06-29 17:04:39 +0000479 xmlSchemaTypeNCNameDef = xmlSchemaInitBasicType("NCName",
480 XML_SCHEMAS_NCNAME,
481 xmlSchemaTypeNameDef);
482 xmlSchemaTypeIdDef = xmlSchemaInitBasicType("ID", XML_SCHEMAS_ID,
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000483 xmlSchemaTypeNCNameDef);
Daniel Veillard01fa6152004-06-29 17:04:39 +0000484 xmlSchemaTypeIdrefDef = xmlSchemaInitBasicType("IDREF",
485 XML_SCHEMAS_IDREF,
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000486 xmlSchemaTypeNCNameDef);
Daniel Veillard01fa6152004-06-29 17:04:39 +0000487 xmlSchemaTypeEntityDef = xmlSchemaInitBasicType("ENTITY",
488 XML_SCHEMAS_ENTITY,
489 xmlSchemaTypeNCNameDef);
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000490 /*
491 * Derived list types.
492 */
493 /* ENTITIES */
Daniel Veillard01fa6152004-06-29 17:04:39 +0000494 xmlSchemaTypeEntitiesDef = xmlSchemaInitBasicType("ENTITIES",
495 XML_SCHEMAS_ENTITIES,
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000496 xmlSchemaTypeAnySimpleTypeDef);
497 xmlSchemaTypeEntitiesDef->subtypes = xmlSchemaTypeEntityDef;
498 /* IDREFS */
499 xmlSchemaTypeIdrefsDef = xmlSchemaInitBasicType("IDREFS",
500 XML_SCHEMAS_IDREFS,
501 xmlSchemaTypeAnySimpleTypeDef);
502 xmlSchemaTypeIdrefsDef->subtypes = xmlSchemaTypeIdrefDef;
503
504 /* NMTOKENS */
505 xmlSchemaTypeNmtokensDef = xmlSchemaInitBasicType("NMTOKENS",
506 XML_SCHEMAS_NMTOKENS,
507 xmlSchemaTypeAnySimpleTypeDef);
508 xmlSchemaTypeNmtokensDef->subtypes = xmlSchemaTypeNmtokenDef;
509
Daniel Veillard4255d502002-04-16 15:50:10 +0000510 xmlSchemaTypesInitialized = 1;
511}
512
513/**
514 * xmlSchemaCleanupTypes:
515 *
516 * Cleanup the default XML Schemas type library
517 */
518void
519xmlSchemaCleanupTypes(void) {
520 if (xmlSchemaTypesInitialized == 0)
521 return;
Daniel Veillard01fa6152004-06-29 17:04:39 +0000522 xmlSchemaFreeWildcard(xmlSchemaTypeAnyTypeDef->attributeWildcard);
Daniel Veillard4255d502002-04-16 15:50:10 +0000523 xmlHashFree(xmlSchemaTypesBank, (xmlHashDeallocator) xmlSchemaFreeType);
524 xmlSchemaTypesInitialized = 0;
525}
526
527/**
Daniel Veillard6927b102004-10-27 17:29:04 +0000528 * xmlSchemaIsBuiltInTypeFacet:
Daniel Veillard01fa6152004-06-29 17:04:39 +0000529 * @type: the built-in type
530 * @facetType: the facet type
531 *
532 * Evaluates if a specific facet can be
533 * used in conjunction with a type.
534 *
535 * Returns 1 if the facet can be used with the given built-in type,
536 * 0 otherwise and -1 in case the type is not a built-in type.
537 */
538int
539xmlSchemaIsBuiltInTypeFacet(xmlSchemaTypePtr type, int facetType)
540{
Daniel Veillardce682bc2004-11-05 17:22:25 +0000541 if (type == NULL)
542 return (-1);
Daniel Veillard01fa6152004-06-29 17:04:39 +0000543 if (type->type != XML_SCHEMA_TYPE_BASIC)
544 return (-1);
545 switch (type->builtInType) {
546 case XML_SCHEMAS_BOOLEAN:
547 if ((facetType == XML_SCHEMA_FACET_PATTERN) ||
548 (facetType == XML_SCHEMA_FACET_WHITESPACE))
549 return (1);
550 else
551 return (0);
552 case XML_SCHEMAS_STRING:
553 case XML_SCHEMAS_NOTATION:
554 case XML_SCHEMAS_QNAME:
555 case XML_SCHEMAS_ANYURI:
556 case XML_SCHEMAS_BASE64BINARY:
557 case XML_SCHEMAS_HEXBINARY:
558 if ((facetType == XML_SCHEMA_FACET_LENGTH) ||
559 (facetType == XML_SCHEMA_FACET_MINLENGTH) ||
560 (facetType == XML_SCHEMA_FACET_MAXLENGTH) ||
561 (facetType == XML_SCHEMA_FACET_PATTERN) ||
562 (facetType == XML_SCHEMA_FACET_ENUMERATION) ||
563 (facetType == XML_SCHEMA_FACET_WHITESPACE))
564 return (1);
565 else
566 return (0);
567 case XML_SCHEMAS_DECIMAL:
568 if ((facetType == XML_SCHEMA_FACET_TOTALDIGITS) ||
569 (facetType == XML_SCHEMA_FACET_FRACTIONDIGITS) ||
570 (facetType == XML_SCHEMA_FACET_PATTERN) ||
571 (facetType == XML_SCHEMA_FACET_WHITESPACE) ||
572 (facetType == XML_SCHEMA_FACET_ENUMERATION) ||
573 (facetType == XML_SCHEMA_FACET_MAXINCLUSIVE) ||
574 (facetType == XML_SCHEMA_FACET_MAXEXCLUSIVE) ||
575 (facetType == XML_SCHEMA_FACET_MININCLUSIVE) ||
576 (facetType == XML_SCHEMA_FACET_MINEXCLUSIVE))
577 return (1);
578 else
579 return (0);
580 case XML_SCHEMAS_TIME:
581 case XML_SCHEMAS_GDAY:
582 case XML_SCHEMAS_GMONTH:
583 case XML_SCHEMAS_GMONTHDAY:
584 case XML_SCHEMAS_GYEAR:
585 case XML_SCHEMAS_GYEARMONTH:
586 case XML_SCHEMAS_DATE:
587 case XML_SCHEMAS_DATETIME:
588 case XML_SCHEMAS_DURATION:
589 case XML_SCHEMAS_FLOAT:
590 case XML_SCHEMAS_DOUBLE:
591 if ((facetType == XML_SCHEMA_FACET_PATTERN) ||
592 (facetType == XML_SCHEMA_FACET_ENUMERATION) ||
593 (facetType == XML_SCHEMA_FACET_WHITESPACE) ||
594 (facetType == XML_SCHEMA_FACET_MAXINCLUSIVE) ||
595 (facetType == XML_SCHEMA_FACET_MAXEXCLUSIVE) ||
596 (facetType == XML_SCHEMA_FACET_MININCLUSIVE) ||
597 (facetType == XML_SCHEMA_FACET_MINEXCLUSIVE))
598 return (1);
599 else
600 return (0);
601 default:
Daniel Veillardc7e3cc42004-09-28 12:33:52 +0000602 break;
Daniel Veillard01fa6152004-06-29 17:04:39 +0000603 }
604 return (0);
605}
606
607/**
608 * xmlSchemaGetBuiltInType:
609 * @type: the type of the built in type
610 *
611 * Gives you the type struct for a built-in
612 * type by its type id.
613 *
614 * Returns the type if found, NULL otherwise.
615 */
616xmlSchemaTypePtr
617xmlSchemaGetBuiltInType(xmlSchemaValType type)
618{
619 if (xmlSchemaTypesInitialized == 0)
620 xmlSchemaInitTypes();
621 switch (type) {
622
623 case XML_SCHEMAS_ANYSIMPLETYPE:
624 return (xmlSchemaTypeAnySimpleTypeDef);
625 case XML_SCHEMAS_STRING:
626 return (xmlSchemaTypeStringDef);
627 case XML_SCHEMAS_NORMSTRING:
628 return (xmlSchemaTypeNormStringDef);
629 case XML_SCHEMAS_DECIMAL:
630 return (xmlSchemaTypeDecimalDef);
631 case XML_SCHEMAS_TIME:
632 return (xmlSchemaTypeTimeDef);
633 case XML_SCHEMAS_GDAY:
634 return (xmlSchemaTypeGDayDef);
635 case XML_SCHEMAS_GMONTH:
636 return (xmlSchemaTypeGMonthDef);
637 case XML_SCHEMAS_GMONTHDAY:
638 return (xmlSchemaTypeGMonthDayDef);
639 case XML_SCHEMAS_GYEAR:
640 return (xmlSchemaTypeGYearDef);
641 case XML_SCHEMAS_GYEARMONTH:
642 return (xmlSchemaTypeGYearMonthDef);
643 case XML_SCHEMAS_DATE:
644 return (xmlSchemaTypeDateDef);
645 case XML_SCHEMAS_DATETIME:
646 return (xmlSchemaTypeDatetimeDef);
647 case XML_SCHEMAS_DURATION:
648 return (xmlSchemaTypeDurationDef);
649 case XML_SCHEMAS_FLOAT:
650 return (xmlSchemaTypeFloatDef);
651 case XML_SCHEMAS_DOUBLE:
652 return (xmlSchemaTypeDoubleDef);
653 case XML_SCHEMAS_BOOLEAN:
654 return (xmlSchemaTypeBooleanDef);
655 case XML_SCHEMAS_TOKEN:
656 return (xmlSchemaTypeTokenDef);
657 case XML_SCHEMAS_LANGUAGE:
658 return (xmlSchemaTypeLanguageDef);
659 case XML_SCHEMAS_NMTOKEN:
660 return (xmlSchemaTypeNmtokenDef);
661 case XML_SCHEMAS_NMTOKENS:
662 return (xmlSchemaTypeNmtokensDef);
663 case XML_SCHEMAS_NAME:
664 return (xmlSchemaTypeNameDef);
665 case XML_SCHEMAS_QNAME:
666 return (xmlSchemaTypeQNameDef);
667 case XML_SCHEMAS_NCNAME:
668 return (xmlSchemaTypeNCNameDef);
669 case XML_SCHEMAS_ID:
670 return (xmlSchemaTypeIdDef);
671 case XML_SCHEMAS_IDREF:
672 return (xmlSchemaTypeIdrefDef);
673 case XML_SCHEMAS_IDREFS:
674 return (xmlSchemaTypeIdrefsDef);
675 case XML_SCHEMAS_ENTITY:
676 return (xmlSchemaTypeEntityDef);
677 case XML_SCHEMAS_ENTITIES:
678 return (xmlSchemaTypeEntitiesDef);
679 case XML_SCHEMAS_NOTATION:
680 return (xmlSchemaTypeNotationDef);
681 case XML_SCHEMAS_ANYURI:
682 return (xmlSchemaTypeAnyURIDef);
683 case XML_SCHEMAS_INTEGER:
684 return (xmlSchemaTypeIntegerDef);
685 case XML_SCHEMAS_NPINTEGER:
686 return (xmlSchemaTypeNonPositiveIntegerDef);
687 case XML_SCHEMAS_NINTEGER:
688 return (xmlSchemaTypeNegativeIntegerDef);
689 case XML_SCHEMAS_NNINTEGER:
690 return (xmlSchemaTypeNonNegativeIntegerDef);
691 case XML_SCHEMAS_PINTEGER:
692 return (xmlSchemaTypePositiveIntegerDef);
693 case XML_SCHEMAS_INT:
694 return (xmlSchemaTypeIntDef);
695 case XML_SCHEMAS_UINT:
696 return (xmlSchemaTypeUnsignedIntDef);
697 case XML_SCHEMAS_LONG:
698 return (xmlSchemaTypeLongDef);
699 case XML_SCHEMAS_ULONG:
700 return (xmlSchemaTypeUnsignedLongDef);
701 case XML_SCHEMAS_SHORT:
702 return (xmlSchemaTypeShortDef);
703 case XML_SCHEMAS_USHORT:
704 return (xmlSchemaTypeUnsignedShortDef);
705 case XML_SCHEMAS_BYTE:
706 return (xmlSchemaTypeByteDef);
707 case XML_SCHEMAS_UBYTE:
708 return (xmlSchemaTypeUnsignedByteDef);
709 case XML_SCHEMAS_HEXBINARY:
710 return (xmlSchemaTypeHexBinaryDef);
711 case XML_SCHEMAS_BASE64BINARY:
712 return (xmlSchemaTypeBase64BinaryDef);
713 case XML_SCHEMAS_ANYTYPE:
714 return (xmlSchemaTypeAnyTypeDef);
715 default:
716 return (NULL);
717 }
718}
719
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000720int
721xmlSchemaValueAppend(xmlSchemaValPtr prev, xmlSchemaValPtr cur) {
Daniel Veillard4255d502002-04-16 15:50:10 +0000722
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000723 if ((prev == NULL) || (cur == NULL))
724 return (-1);
725 prev->next = cur;
726 return (0);
727}
728
729xmlSchemaValPtr
730xmlSchemaValueGetNext(xmlSchemaValPtr cur) {
731
732 if (cur == NULL)
733 return (NULL);
734 return (cur->next);
735}
736
737const xmlChar *
738xmlSchemaValueGetAsString(xmlSchemaValPtr val)
739{
740 if (val == NULL)
741 return (NULL);
742 switch (val->type) {
743 case XML_SCHEMAS_STRING:
744 case XML_SCHEMAS_NORMSTRING:
745 case XML_SCHEMAS_ANYSIMPLETYPE:
746 case XML_SCHEMAS_TOKEN:
747 case XML_SCHEMAS_LANGUAGE:
748 case XML_SCHEMAS_NMTOKEN:
749 case XML_SCHEMAS_NAME:
750 case XML_SCHEMAS_NCNAME:
751 case XML_SCHEMAS_ID:
752 case XML_SCHEMAS_IDREF:
753 case XML_SCHEMAS_ENTITY:
754 case XML_SCHEMAS_ANYURI:
755 return (BAD_CAST val->value.str);
756 default:
757 break;
Daniel Veillard4255d502002-04-16 15:50:10 +0000758 }
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000759 return (NULL);
760}
761
762int
763xmlSchemaValueGetAsBoolean(xmlSchemaValPtr val)
764{
765 if ((val == NULL) || (val->type != XML_SCHEMAS_BOOLEAN))
766 return (0);
767 return (val->value.b);
Daniel Veillard4255d502002-04-16 15:50:10 +0000768}
769
770/**
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +0000771 * xmlSchemaNewStringValue:
772 * @type: the value type
Daniel Veillardb5839c32005-02-19 18:27:14 +0000773 * @value: the value
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +0000774 *
775 * Allocate a new simple type value. The type can be
Kasimier T. Buchcik2ee855d2005-03-07 11:14:14 +0000776 * of XML_SCHEMAS_STRING.
777 * WARNING: This one is intended to be expanded for other
778 * string based types. We need this for anySimpleType as well.
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000779 * The given value is consumed and freed with the struct.
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +0000780 *
781 * Returns a pointer to the new value or NULL in case of error
782 */
783xmlSchemaValPtr
784xmlSchemaNewStringValue(xmlSchemaValType type,
785 const xmlChar *value)
786{
787 xmlSchemaValPtr val;
788
789 if (type != XML_SCHEMAS_STRING)
790 return(NULL);
791 val = (xmlSchemaValPtr) xmlMalloc(sizeof(xmlSchemaVal));
792 if (val == NULL) {
793 return(NULL);
794 }
795 memset(val, 0, sizeof(xmlSchemaVal));
796 val->type = type;
797 val->value.str = (xmlChar *) value;
798 return(val);
799}
800
Kasimier T. Buchcikb06b4de2005-02-17 19:00:23 +0000801/**
802 * xmlSchemaNewNOTATIONValue:
Daniel Veillardb5839c32005-02-19 18:27:14 +0000803 * @name: the notation name
804 * @ns: the notation namespace name or NULL
Kasimier T. Buchcikb06b4de2005-02-17 19:00:23 +0000805 *
806 * Allocate a new NOTATION value.
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000807 * The given values are consumed and freed with the struct.
Kasimier T. Buchcikb06b4de2005-02-17 19:00:23 +0000808 *
809 * Returns a pointer to the new value or NULL in case of error
810 */
811xmlSchemaValPtr
812xmlSchemaNewNOTATIONValue(const xmlChar *name,
813 const xmlChar *ns)
814{
815 xmlSchemaValPtr val;
816
817 val = xmlSchemaNewValue(XML_SCHEMAS_NOTATION);
818 if (val == NULL)
819 return (NULL);
820
William M. Brack12d37ab2005-02-21 13:54:07 +0000821 val->value.qname.name = (xmlChar *)name;
Kasimier T. Buchcikb06b4de2005-02-17 19:00:23 +0000822 if (ns != NULL)
William M. Brack12d37ab2005-02-21 13:54:07 +0000823 val->value.qname.uri = (xmlChar *)ns;
Kasimier T. Buchcikb06b4de2005-02-17 19:00:23 +0000824 return(val);
825}
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +0000826
827/**
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000828 * xmlSchemaNewQNameValue:
829 * @namespaceName: the namespace name
830 * @localName: the local name
831 *
832 * Allocate a new QName value.
833 * The given values are consumed and freed with the struct.
834 *
835 * Returns a pointer to the new value or NULL in case of an error.
836 */
837xmlSchemaValPtr
838xmlSchemaNewQNameValue(const xmlChar *namespaceName,
839 const xmlChar *localName)
840{
841 xmlSchemaValPtr val;
842
843 val = xmlSchemaNewValue(XML_SCHEMAS_QNAME);
844 if (val == NULL)
845 return (NULL);
846
847 val->value.qname.name = (xmlChar *) localName;
848 val->value.qname.uri = (xmlChar *) namespaceName;
849 return(val);
850}
851
852/**
Daniel Veillard4255d502002-04-16 15:50:10 +0000853 * xmlSchemaFreeValue:
854 * @value: the value to free
855 *
856 * Cleanup the default XML Schemas type library
857 */
858void
859xmlSchemaFreeValue(xmlSchemaValPtr value) {
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +0000860 xmlSchemaValPtr prev;
861
862 while (value != NULL) {
863 switch (value->type) {
864 case XML_SCHEMAS_STRING:
865 case XML_SCHEMAS_NORMSTRING:
866 case XML_SCHEMAS_TOKEN:
867 case XML_SCHEMAS_LANGUAGE:
868 case XML_SCHEMAS_NMTOKEN:
869 case XML_SCHEMAS_NMTOKENS:
870 case XML_SCHEMAS_NAME:
871 case XML_SCHEMAS_NCNAME:
872 case XML_SCHEMAS_ID:
873 case XML_SCHEMAS_IDREF:
874 case XML_SCHEMAS_IDREFS:
875 case XML_SCHEMAS_ENTITY:
876 case XML_SCHEMAS_ENTITIES:
877 case XML_SCHEMAS_ANYURI:
878 case XML_SCHEMAS_ANYSIMPLETYPE:
879 if (value->value.str != NULL)
880 xmlFree(value->value.str);
881 break;
882 case XML_SCHEMAS_NOTATION:
883 case XML_SCHEMAS_QNAME:
884 if (value->value.qname.uri != NULL)
885 xmlFree(value->value.qname.uri);
886 if (value->value.qname.name != NULL)
887 xmlFree(value->value.qname.name);
888 break;
889 case XML_SCHEMAS_HEXBINARY:
890 if (value->value.hex.str != NULL)
891 xmlFree(value->value.hex.str);
892 break;
893 case XML_SCHEMAS_BASE64BINARY:
894 if (value->value.base64.str != NULL)
895 xmlFree(value->value.base64.str);
896 break;
897 default:
898 break;
899 }
900 prev = value;
901 value = value->next;
902 xmlFree(prev);
903 }
Daniel Veillard4255d502002-04-16 15:50:10 +0000904}
905
906/**
907 * xmlSchemaGetPredefinedType:
908 * @name: the type name
909 * @ns: the URI of the namespace usually "http://www.w3.org/2001/XMLSchema"
910 *
911 * Lookup a type in the default XML Schemas type library
912 *
913 * Returns the type if found, NULL otherwise
914 */
915xmlSchemaTypePtr
916xmlSchemaGetPredefinedType(const xmlChar *name, const xmlChar *ns) {
917 if (xmlSchemaTypesInitialized == 0)
918 xmlSchemaInitTypes();
919 if (name == NULL)
920 return(NULL);
921 return((xmlSchemaTypePtr) xmlHashLookup2(xmlSchemaTypesBank, name, ns));
922}
Daniel Veillard070803b2002-05-03 07:29:38 +0000923
Daniel Veillard01fa6152004-06-29 17:04:39 +0000924/**
925 * xmlSchemaGetBuiltInListSimpleTypeItemType:
926 * @type: the built-in simple type.
927 *
Daniel Veillard6927b102004-10-27 17:29:04 +0000928 * Lookup function
929 *
Daniel Veillardc0826a72004-08-10 14:17:33 +0000930 * Returns the item type of @type as defined by the built-in datatype
931 * hierarchy of XML Schema Part 2: Datatypes, or NULL in case of an error.
Daniel Veillard01fa6152004-06-29 17:04:39 +0000932 */
933xmlSchemaTypePtr
934xmlSchemaGetBuiltInListSimpleTypeItemType(xmlSchemaTypePtr type)
935{
Daniel Veillard42595322004-11-08 10:52:06 +0000936 if ((type == NULL) || (type->type != XML_SCHEMA_TYPE_BASIC))
Daniel Veillard01fa6152004-06-29 17:04:39 +0000937 return (NULL);
938 switch (type->builtInType) {
939 case XML_SCHEMAS_NMTOKENS:
940 return (xmlSchemaTypeNmtokenDef );
941 case XML_SCHEMAS_IDREFS:
942 return (xmlSchemaTypeIdrefDef);
943 case XML_SCHEMAS_ENTITIES:
944 return (xmlSchemaTypeEntityDef);
945 default:
946 return (NULL);
947 }
948}
949
Daniel Veillard070803b2002-05-03 07:29:38 +0000950/****************************************************************
951 * *
952 * Convenience macros and functions *
953 * *
954 ****************************************************************/
955
956#define IS_TZO_CHAR(c) \
957 ((c == 0) || (c == 'Z') || (c == '+') || (c == '-'))
958
959#define VALID_YEAR(yr) (yr != 0)
960#define VALID_MONTH(mon) ((mon >= 1) && (mon <= 12))
961/* VALID_DAY should only be used when month is unknown */
962#define VALID_DAY(day) ((day >= 1) && (day <= 31))
963#define VALID_HOUR(hr) ((hr >= 0) && (hr <= 23))
964#define VALID_MIN(min) ((min >= 0) && (min <= 59))
965#define VALID_SEC(sec) ((sec >= 0) && (sec < 60))
Kasimier T. Buchcik690a6802005-05-12 13:16:01 +0000966#define VALID_TZO(tzo) ((tzo > -840) && (tzo < 840))
Daniel Veillard070803b2002-05-03 07:29:38 +0000967#define IS_LEAP(y) \
968 (((y % 4 == 0) && (y % 100 != 0)) || (y % 400 == 0))
969
Daniel Veillardebe25d42004-03-25 09:35:49 +0000970static const unsigned int daysInMonth[12] =
Daniel Veillard070803b2002-05-03 07:29:38 +0000971 { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
Daniel Veillardebe25d42004-03-25 09:35:49 +0000972static const unsigned int daysInMonthLeap[12] =
Daniel Veillard070803b2002-05-03 07:29:38 +0000973 { 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
974
Daniel Veillard5a872412002-05-22 06:40:27 +0000975#define MAX_DAYINMONTH(yr,mon) \
976 (IS_LEAP(yr) ? daysInMonthLeap[mon - 1] : daysInMonth[mon - 1])
977
Daniel Veillard070803b2002-05-03 07:29:38 +0000978#define VALID_MDAY(dt) \
979 (IS_LEAP(dt->year) ? \
980 (dt->day <= daysInMonthLeap[dt->mon - 1]) : \
981 (dt->day <= daysInMonth[dt->mon - 1]))
982
983#define VALID_DATE(dt) \
984 (VALID_YEAR(dt->year) && VALID_MONTH(dt->mon) && VALID_MDAY(dt))
985
986#define VALID_TIME(dt) \
987 (VALID_HOUR(dt->hour) && VALID_MIN(dt->min) && \
988 VALID_SEC(dt->sec) && VALID_TZO(dt->tzo))
989
990#define VALID_DATETIME(dt) \
991 (VALID_DATE(dt) && VALID_TIME(dt))
992
993#define SECS_PER_MIN (60)
994#define SECS_PER_HOUR (60 * SECS_PER_MIN)
995#define SECS_PER_DAY (24 * SECS_PER_HOUR)
996
Daniel Veillard5a872412002-05-22 06:40:27 +0000997static const long dayInYearByMonth[12] =
998 { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334 };
999static const long dayInLeapYearByMonth[12] =
1000 { 0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335 };
1001
1002#define DAY_IN_YEAR(day, month, year) \
1003 ((IS_LEAP(year) ? \
1004 dayInLeapYearByMonth[month - 1] : \
1005 dayInYearByMonth[month - 1]) + day)
1006
1007#ifdef DEBUG
1008#define DEBUG_DATE(dt) \
1009 xmlGenericError(xmlGenericErrorContext, \
1010 "type=%o %04ld-%02u-%02uT%02u:%02u:%03f", \
1011 dt->type,dt->value.date.year,dt->value.date.mon, \
1012 dt->value.date.day,dt->value.date.hour,dt->value.date.min, \
1013 dt->value.date.sec); \
1014 if (dt->value.date.tz_flag) \
1015 if (dt->value.date.tzo != 0) \
1016 xmlGenericError(xmlGenericErrorContext, \
1017 "%+05d\n",dt->value.date.tzo); \
1018 else \
1019 xmlGenericError(xmlGenericErrorContext, "Z\n"); \
1020 else \
1021 xmlGenericError(xmlGenericErrorContext,"\n")
1022#else
1023#define DEBUG_DATE(dt)
1024#endif
1025
Daniel Veillard070803b2002-05-03 07:29:38 +00001026/**
1027 * _xmlSchemaParseGYear:
1028 * @dt: pointer to a date structure
1029 * @str: pointer to the string to analyze
1030 *
1031 * Parses a xs:gYear without time zone and fills in the appropriate
1032 * field of the @dt structure. @str is updated to point just after the
1033 * xs:gYear. It is supposed that @dt->year is big enough to contain
1034 * the year.
1035 *
1036 * Returns 0 or the error code
1037 */
1038static int
1039_xmlSchemaParseGYear (xmlSchemaValDatePtr dt, const xmlChar **str) {
1040 const xmlChar *cur = *str, *firstChar;
1041 int isneg = 0, digcnt = 0;
1042
1043 if (((*cur < '0') || (*cur > '9')) &&
1044 (*cur != '-') && (*cur != '+'))
1045 return -1;
1046
1047 if (*cur == '-') {
1048 isneg = 1;
1049 cur++;
1050 }
1051
1052 firstChar = cur;
1053
1054 while ((*cur >= '0') && (*cur <= '9')) {
1055 dt->year = dt->year * 10 + (*cur - '0');
1056 cur++;
1057 digcnt++;
1058 }
1059
1060 /* year must be at least 4 digits (CCYY); over 4
1061 * digits cannot have a leading zero. */
1062 if ((digcnt < 4) || ((digcnt > 4) && (*firstChar == '0')))
1063 return 1;
1064
1065 if (isneg)
1066 dt->year = - dt->year;
1067
1068 if (!VALID_YEAR(dt->year))
1069 return 2;
1070
1071 *str = cur;
1072 return 0;
1073}
1074
1075/**
1076 * PARSE_2_DIGITS:
1077 * @num: the integer to fill in
1078 * @cur: an #xmlChar *
1079 * @invalid: an integer
1080 *
1081 * Parses a 2-digits integer and updates @num with the value. @cur is
1082 * updated to point just after the integer.
1083 * In case of error, @invalid is set to %TRUE, values of @num and
1084 * @cur are undefined.
1085 */
1086#define PARSE_2_DIGITS(num, cur, invalid) \
1087 if ((cur[0] < '0') || (cur[0] > '9') || \
1088 (cur[1] < '0') || (cur[1] > '9')) \
1089 invalid = 1; \
1090 else \
1091 num = (cur[0] - '0') * 10 + (cur[1] - '0'); \
1092 cur += 2;
1093
1094/**
1095 * PARSE_FLOAT:
1096 * @num: the double to fill in
1097 * @cur: an #xmlChar *
1098 * @invalid: an integer
1099 *
1100 * Parses a float and updates @num with the value. @cur is
1101 * updated to point just after the float. The float must have a
1102 * 2-digits integer part and may or may not have a decimal part.
1103 * In case of error, @invalid is set to %TRUE, values of @num and
1104 * @cur are undefined.
1105 */
1106#define PARSE_FLOAT(num, cur, invalid) \
1107 PARSE_2_DIGITS(num, cur, invalid); \
1108 if (!invalid && (*cur == '.')) { \
1109 double mult = 1; \
1110 cur++; \
1111 if ((*cur < '0') || (*cur > '9')) \
1112 invalid = 1; \
1113 while ((*cur >= '0') && (*cur <= '9')) { \
1114 mult /= 10; \
1115 num += (*cur - '0') * mult; \
1116 cur++; \
1117 } \
1118 }
1119
1120/**
1121 * _xmlSchemaParseGMonth:
1122 * @dt: pointer to a date structure
1123 * @str: pointer to the string to analyze
1124 *
1125 * Parses a xs:gMonth without time zone and fills in the appropriate
1126 * field of the @dt structure. @str is updated to point just after the
1127 * xs:gMonth.
1128 *
1129 * Returns 0 or the error code
1130 */
1131static int
1132_xmlSchemaParseGMonth (xmlSchemaValDatePtr dt, const xmlChar **str) {
1133 const xmlChar *cur = *str;
1134 int ret = 0;
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001135 unsigned int value = 0;
Daniel Veillard070803b2002-05-03 07:29:38 +00001136
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001137 PARSE_2_DIGITS(value, cur, ret);
Daniel Veillard070803b2002-05-03 07:29:38 +00001138 if (ret != 0)
1139 return ret;
1140
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001141 if (!VALID_MONTH(value))
Daniel Veillard070803b2002-05-03 07:29:38 +00001142 return 2;
1143
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001144 dt->mon = value;
1145
Daniel Veillard070803b2002-05-03 07:29:38 +00001146 *str = cur;
1147 return 0;
1148}
1149
1150/**
1151 * _xmlSchemaParseGDay:
1152 * @dt: pointer to a date structure
1153 * @str: pointer to the string to analyze
1154 *
1155 * Parses a xs:gDay without time zone and fills in the appropriate
1156 * field of the @dt structure. @str is updated to point just after the
1157 * xs:gDay.
1158 *
1159 * Returns 0 or the error code
1160 */
1161static int
1162_xmlSchemaParseGDay (xmlSchemaValDatePtr dt, const xmlChar **str) {
1163 const xmlChar *cur = *str;
1164 int ret = 0;
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001165 unsigned int value = 0;
Daniel Veillard070803b2002-05-03 07:29:38 +00001166
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001167 PARSE_2_DIGITS(value, cur, ret);
Daniel Veillard070803b2002-05-03 07:29:38 +00001168 if (ret != 0)
1169 return ret;
1170
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001171 if (!VALID_DAY(value))
Daniel Veillard070803b2002-05-03 07:29:38 +00001172 return 2;
1173
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001174 dt->day = value;
Daniel Veillard070803b2002-05-03 07:29:38 +00001175 *str = cur;
1176 return 0;
1177}
1178
1179/**
1180 * _xmlSchemaParseTime:
1181 * @dt: pointer to a date structure
1182 * @str: pointer to the string to analyze
1183 *
1184 * Parses a xs:time without time zone and fills in the appropriate
1185 * fields of the @dt structure. @str is updated to point just after the
1186 * xs:time.
1187 * In case of error, values of @dt fields are undefined.
1188 *
1189 * Returns 0 or the error code
1190 */
1191static int
1192_xmlSchemaParseTime (xmlSchemaValDatePtr dt, const xmlChar **str) {
Kasimier T. Buchcik285b3672005-05-12 13:10:22 +00001193 const xmlChar *cur = *str;
Daniel Veillard070803b2002-05-03 07:29:38 +00001194 int ret = 0;
Kasimier T. Buchcik285b3672005-05-12 13:10:22 +00001195 int value = 0;
Daniel Veillard070803b2002-05-03 07:29:38 +00001196
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001197 PARSE_2_DIGITS(value, cur, ret);
Daniel Veillard070803b2002-05-03 07:29:38 +00001198 if (ret != 0)
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001199 return ret;
Daniel Veillard070803b2002-05-03 07:29:38 +00001200 if (*cur != ':')
1201 return 1;
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001202 if (!VALID_HOUR(value))
1203 return 2;
Daniel Veillard070803b2002-05-03 07:29:38 +00001204 cur++;
1205
1206 /* the ':' insures this string is xs:time */
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001207 dt->hour = value;
Daniel Veillard070803b2002-05-03 07:29:38 +00001208
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001209 PARSE_2_DIGITS(value, cur, ret);
Daniel Veillard070803b2002-05-03 07:29:38 +00001210 if (ret != 0)
1211 return ret;
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001212 if (!VALID_MIN(value))
1213 return 2;
1214 dt->min = value;
Daniel Veillard070803b2002-05-03 07:29:38 +00001215
1216 if (*cur != ':')
1217 return 1;
1218 cur++;
1219
1220 PARSE_FLOAT(dt->sec, cur, ret);
1221 if (ret != 0)
1222 return ret;
1223
Kasimier T. Buchcik64dc4d22005-04-19 15:58:31 +00001224 if ((!VALID_SEC(dt->sec)) || (!VALID_TZO(dt->tzo)))
Daniel Veillard070803b2002-05-03 07:29:38 +00001225 return 2;
1226
1227 *str = cur;
1228 return 0;
1229}
1230
1231/**
1232 * _xmlSchemaParseTimeZone:
1233 * @dt: pointer to a date structure
1234 * @str: pointer to the string to analyze
1235 *
1236 * Parses a time zone without time zone and fills in the appropriate
1237 * field of the @dt structure. @str is updated to point just after the
1238 * time zone.
1239 *
1240 * Returns 0 or the error code
1241 */
1242static int
1243_xmlSchemaParseTimeZone (xmlSchemaValDatePtr dt, const xmlChar **str) {
1244 const xmlChar *cur = *str;
1245 int ret = 0;
1246
1247 if (str == NULL)
1248 return -1;
1249
1250 switch (*cur) {
1251 case 0:
1252 dt->tz_flag = 0;
1253 dt->tzo = 0;
1254 break;
1255
1256 case 'Z':
1257 dt->tz_flag = 1;
1258 dt->tzo = 0;
1259 cur++;
1260 break;
1261
1262 case '+':
1263 case '-': {
1264 int isneg = 0, tmp = 0;
1265 isneg = (*cur == '-');
1266
1267 cur++;
1268
1269 PARSE_2_DIGITS(tmp, cur, ret);
1270 if (ret != 0)
1271 return ret;
1272 if (!VALID_HOUR(tmp))
1273 return 2;
1274
1275 if (*cur != ':')
1276 return 1;
1277 cur++;
1278
1279 dt->tzo = tmp * 60;
1280
1281 PARSE_2_DIGITS(tmp, cur, ret);
1282 if (ret != 0)
1283 return ret;
1284 if (!VALID_MIN(tmp))
1285 return 2;
1286
1287 dt->tzo += tmp;
1288 if (isneg)
1289 dt->tzo = - dt->tzo;
1290
1291 if (!VALID_TZO(dt->tzo))
1292 return 2;
1293
Daniel Veillard5a872412002-05-22 06:40:27 +00001294 dt->tz_flag = 1;
Daniel Veillard070803b2002-05-03 07:29:38 +00001295 break;
1296 }
1297 default:
1298 return 1;
1299 }
1300
1301 *str = cur;
1302 return 0;
1303}
1304
Daniel Veillard1ac24d32003-08-27 14:15:15 +00001305/**
1306 * _xmlSchemaBase64Decode:
1307 * @ch: a character
1308 *
1309 * Converts a base64 encoded character to its base 64 value.
1310 *
1311 * Returns 0-63 (value), 64 (pad), or -1 (not recognized)
1312 */
1313static int
1314_xmlSchemaBase64Decode (const xmlChar ch) {
1315 if (('A' <= ch) && (ch <= 'Z')) return ch - 'A';
1316 if (('a' <= ch) && (ch <= 'z')) return ch - 'a' + 26;
1317 if (('0' <= ch) && (ch <= '9')) return ch - '0' + 52;
1318 if ('+' == ch) return 62;
1319 if ('/' == ch) return 63;
1320 if ('=' == ch) return 64;
1321 return -1;
1322}
1323
Daniel Veillard070803b2002-05-03 07:29:38 +00001324/****************************************************************
1325 * *
1326 * XML Schema Dates/Times Datatypes Handling *
1327 * *
1328 ****************************************************************/
1329
1330/**
1331 * PARSE_DIGITS:
1332 * @num: the integer to fill in
1333 * @cur: an #xmlChar *
1334 * @num_type: an integer flag
1335 *
1336 * Parses a digits integer and updates @num with the value. @cur is
1337 * updated to point just after the integer.
1338 * In case of error, @num_type is set to -1, values of @num and
1339 * @cur are undefined.
1340 */
1341#define PARSE_DIGITS(num, cur, num_type) \
1342 if ((*cur < '0') || (*cur > '9')) \
1343 num_type = -1; \
1344 else \
1345 while ((*cur >= '0') && (*cur <= '9')) { \
1346 num = num * 10 + (*cur - '0'); \
1347 cur++; \
1348 }
1349
1350/**
1351 * PARSE_NUM:
1352 * @num: the double to fill in
1353 * @cur: an #xmlChar *
1354 * @num_type: an integer flag
1355 *
1356 * Parses a float or integer and updates @num with the value. @cur is
1357 * updated to point just after the number. If the number is a float,
1358 * then it must have an integer part and a decimal part; @num_type will
1359 * be set to 1. If there is no decimal part, @num_type is set to zero.
1360 * In case of error, @num_type is set to -1, values of @num and
1361 * @cur are undefined.
1362 */
1363#define PARSE_NUM(num, cur, num_type) \
1364 num = 0; \
1365 PARSE_DIGITS(num, cur, num_type); \
1366 if (!num_type && (*cur == '.')) { \
1367 double mult = 1; \
1368 cur++; \
1369 if ((*cur < '0') || (*cur > '9')) \
1370 num_type = -1; \
1371 else \
1372 num_type = 1; \
1373 while ((*cur >= '0') && (*cur <= '9')) { \
1374 mult /= 10; \
1375 num += (*cur - '0') * mult; \
1376 cur++; \
1377 } \
1378 }
1379
1380/**
Daniel Veillard5a872412002-05-22 06:40:27 +00001381 * xmlSchemaValidateDates:
Daniel Veillard455cc072003-03-31 10:13:23 +00001382 * @type: the expected type or XML_SCHEMAS_UNKNOWN
Daniel Veillard070803b2002-05-03 07:29:38 +00001383 * @dateTime: string to analyze
1384 * @val: the return computed value
1385 *
1386 * Check that @dateTime conforms to the lexical space of one of the date types.
1387 * if true a value is computed and returned in @val.
1388 *
1389 * Returns 0 if this validates, a positive error code number otherwise
1390 * and -1 in case of internal or API error.
1391 */
1392static int
Daniel Veillard455cc072003-03-31 10:13:23 +00001393xmlSchemaValidateDates (xmlSchemaValType type,
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00001394 const xmlChar *dateTime, xmlSchemaValPtr *val,
1395 int collapse) {
Daniel Veillard070803b2002-05-03 07:29:38 +00001396 xmlSchemaValPtr dt;
1397 int ret;
1398 const xmlChar *cur = dateTime;
1399
1400#define RETURN_TYPE_IF_VALID(t) \
1401 if (IS_TZO_CHAR(*cur)) { \
1402 ret = _xmlSchemaParseTimeZone(&(dt->value.date), &cur); \
1403 if (ret == 0) { \
1404 if (*cur != 0) \
1405 goto error; \
1406 dt->type = t; \
Daniel Veillard455cc072003-03-31 10:13:23 +00001407 goto done; \
Daniel Veillard070803b2002-05-03 07:29:38 +00001408 } \
1409 }
1410
1411 if (dateTime == NULL)
1412 return -1;
1413
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00001414 if (collapse)
1415 while IS_WSP_BLANK_CH(*cur) cur++;
1416
Daniel Veillard070803b2002-05-03 07:29:38 +00001417 if ((*cur != '-') && (*cur < '0') && (*cur > '9'))
1418 return 1;
1419
1420 dt = xmlSchemaNewValue(XML_SCHEMAS_UNKNOWN);
1421 if (dt == NULL)
1422 return -1;
1423
1424 if ((cur[0] == '-') && (cur[1] == '-')) {
1425 /*
1426 * It's an incomplete date (xs:gMonthDay, xs:gMonth or
1427 * xs:gDay)
1428 */
1429 cur += 2;
1430
1431 /* is it an xs:gDay? */
1432 if (*cur == '-') {
Daniel Veillard455cc072003-03-31 10:13:23 +00001433 if (type == XML_SCHEMAS_GMONTH)
1434 goto error;
Daniel Veillard070803b2002-05-03 07:29:38 +00001435 ++cur;
1436 ret = _xmlSchemaParseGDay(&(dt->value.date), &cur);
1437 if (ret != 0)
1438 goto error;
1439
1440 RETURN_TYPE_IF_VALID(XML_SCHEMAS_GDAY);
1441
1442 goto error;
1443 }
1444
1445 /*
1446 * it should be an xs:gMonthDay or xs:gMonth
1447 */
1448 ret = _xmlSchemaParseGMonth(&(dt->value.date), &cur);
1449 if (ret != 0)
1450 goto error;
1451
Daniel Veillardd3b9cd82003-04-09 11:24:17 +00001452 /*
1453 * a '-' char could indicate this type is xs:gMonthDay or
1454 * a negative time zone offset. Check for xs:gMonthDay first.
1455 * Also the first three char's of a negative tzo (-MM:SS) can
1456 * appear to be a valid day; so even if the day portion
1457 * of the xs:gMonthDay verifies, we must insure it was not
1458 * a tzo.
1459 */
1460 if (*cur == '-') {
1461 const xmlChar *rewnd = cur;
1462 cur++;
Daniel Veillard070803b2002-05-03 07:29:38 +00001463
Daniel Veillardd3b9cd82003-04-09 11:24:17 +00001464 ret = _xmlSchemaParseGDay(&(dt->value.date), &cur);
1465 if ((ret == 0) && ((*cur == 0) || (*cur != ':'))) {
1466
1467 /*
1468 * we can use the VALID_MDAY macro to validate the month
1469 * and day because the leap year test will flag year zero
1470 * as a leap year (even though zero is an invalid year).
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00001471 * FUTURE TODO: Zero will become valid in XML Schema 1.1
1472 * probably.
Daniel Veillardd3b9cd82003-04-09 11:24:17 +00001473 */
1474 if (VALID_MDAY((&(dt->value.date)))) {
1475
1476 RETURN_TYPE_IF_VALID(XML_SCHEMAS_GMONTHDAY);
1477
1478 goto error;
1479 }
1480 }
1481
1482 /*
1483 * not xs:gMonthDay so rewind and check if just xs:gMonth
1484 * with an optional time zone.
1485 */
1486 cur = rewnd;
1487 }
1488
1489 RETURN_TYPE_IF_VALID(XML_SCHEMAS_GMONTH);
Daniel Veillard070803b2002-05-03 07:29:38 +00001490
1491 goto error;
1492 }
1493
1494 /*
1495 * It's a right-truncated date or an xs:time.
1496 * Try to parse an xs:time then fallback on right-truncated dates.
1497 */
1498 if ((*cur >= '0') && (*cur <= '9')) {
1499 ret = _xmlSchemaParseTime(&(dt->value.date), &cur);
1500 if (ret == 0) {
1501 /* it's an xs:time */
1502 RETURN_TYPE_IF_VALID(XML_SCHEMAS_TIME);
1503 }
1504 }
1505
1506 /* fallback on date parsing */
1507 cur = dateTime;
1508
1509 ret = _xmlSchemaParseGYear(&(dt->value.date), &cur);
1510 if (ret != 0)
1511 goto error;
1512
1513 /* is it an xs:gYear? */
1514 RETURN_TYPE_IF_VALID(XML_SCHEMAS_GYEAR);
1515
1516 if (*cur != '-')
1517 goto error;
1518 cur++;
1519
1520 ret = _xmlSchemaParseGMonth(&(dt->value.date), &cur);
1521 if (ret != 0)
1522 goto error;
1523
1524 /* is it an xs:gYearMonth? */
1525 RETURN_TYPE_IF_VALID(XML_SCHEMAS_GYEARMONTH);
1526
1527 if (*cur != '-')
1528 goto error;
1529 cur++;
1530
1531 ret = _xmlSchemaParseGDay(&(dt->value.date), &cur);
1532 if ((ret != 0) || !VALID_DATE((&(dt->value.date))))
1533 goto error;
1534
1535 /* is it an xs:date? */
1536 RETURN_TYPE_IF_VALID(XML_SCHEMAS_DATE);
1537
1538 if (*cur != 'T')
1539 goto error;
1540 cur++;
1541
1542 /* it should be an xs:dateTime */
1543 ret = _xmlSchemaParseTime(&(dt->value.date), &cur);
1544 if (ret != 0)
1545 goto error;
1546
1547 ret = _xmlSchemaParseTimeZone(&(dt->value.date), &cur);
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00001548 if (collapse)
1549 while IS_WSP_BLANK_CH(*cur) cur++;
Daniel Veillard070803b2002-05-03 07:29:38 +00001550 if ((ret != 0) || (*cur != 0) || !VALID_DATETIME((&(dt->value.date))))
1551 goto error;
1552
Daniel Veillard455cc072003-03-31 10:13:23 +00001553
Daniel Veillard070803b2002-05-03 07:29:38 +00001554 dt->type = XML_SCHEMAS_DATETIME;
1555
Daniel Veillard455cc072003-03-31 10:13:23 +00001556done:
Daniel Veillardd3b9cd82003-04-09 11:24:17 +00001557#if 1
1558 if ((type != XML_SCHEMAS_UNKNOWN) && (type != dt->type))
1559 goto error;
1560#else
1561 /*
1562 * insure the parsed type is equal to or less significant (right
1563 * truncated) than the desired type.
1564 */
1565 if ((type != XML_SCHEMAS_UNKNOWN) && (type != dt->type)) {
1566
1567 /* time only matches time */
1568 if ((type == XML_SCHEMAS_TIME) && (dt->type == XML_SCHEMAS_TIME))
1569 goto error;
1570
1571 if ((type == XML_SCHEMAS_DATETIME) &&
1572 ((dt->type != XML_SCHEMAS_DATE) ||
1573 (dt->type != XML_SCHEMAS_GYEARMONTH) ||
1574 (dt->type != XML_SCHEMAS_GYEAR)))
1575 goto error;
1576
1577 if ((type == XML_SCHEMAS_DATE) &&
1578 ((dt->type != XML_SCHEMAS_GYEAR) ||
1579 (dt->type != XML_SCHEMAS_GYEARMONTH)))
1580 goto error;
1581
1582 if ((type == XML_SCHEMAS_GYEARMONTH) && (dt->type != XML_SCHEMAS_GYEAR))
1583 goto error;
1584
1585 if ((type == XML_SCHEMAS_GMONTHDAY) && (dt->type != XML_SCHEMAS_GMONTH))
1586 goto error;
1587 }
Daniel Veillard455cc072003-03-31 10:13:23 +00001588#endif
1589
Daniel Veillard070803b2002-05-03 07:29:38 +00001590 if (val != NULL)
1591 *val = dt;
Daniel Veillard80b19092003-03-28 13:29:53 +00001592 else
1593 xmlSchemaFreeValue(dt);
Daniel Veillard070803b2002-05-03 07:29:38 +00001594
1595 return 0;
1596
1597error:
1598 if (dt != NULL)
1599 xmlSchemaFreeValue(dt);
1600 return 1;
1601}
1602
1603/**
Daniel Veillard5a872412002-05-22 06:40:27 +00001604 * xmlSchemaValidateDuration:
Daniel Veillard070803b2002-05-03 07:29:38 +00001605 * @type: the predefined type
1606 * @duration: string to analyze
1607 * @val: the return computed value
1608 *
1609 * Check that @duration conforms to the lexical space of the duration type.
1610 * if true a value is computed and returned in @val.
1611 *
1612 * Returns 0 if this validates, a positive error code number otherwise
1613 * and -1 in case of internal or API error.
1614 */
1615static int
Daniel Veillarddda8f1b2002-09-26 09:47:36 +00001616xmlSchemaValidateDuration (xmlSchemaTypePtr type ATTRIBUTE_UNUSED,
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00001617 const xmlChar *duration, xmlSchemaValPtr *val,
1618 int collapse) {
Daniel Veillard070803b2002-05-03 07:29:38 +00001619 const xmlChar *cur = duration;
1620 xmlSchemaValPtr dur;
1621 int isneg = 0;
1622 unsigned int seq = 0;
Daniel Veillardd3b9cd82003-04-09 11:24:17 +00001623 double num;
1624 int num_type = 0; /* -1 = invalid, 0 = int, 1 = floating */
1625 const xmlChar desig[] = {'Y', 'M', 'D', 'H', 'M', 'S'};
1626 const double multi[] = { 0.0, 0.0, 86400.0, 3600.0, 60.0, 1.0, 0.0};
Daniel Veillard070803b2002-05-03 07:29:38 +00001627
1628 if (duration == NULL)
1629 return -1;
1630
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00001631 if (collapse)
1632 while IS_WSP_BLANK_CH(*cur) cur++;
1633
Daniel Veillard070803b2002-05-03 07:29:38 +00001634 if (*cur == '-') {
1635 isneg = 1;
1636 cur++;
1637 }
1638
1639 /* duration must start with 'P' (after sign) */
1640 if (*cur++ != 'P')
1641 return 1;
1642
Daniel Veillard80b19092003-03-28 13:29:53 +00001643 if (*cur == 0)
1644 return 1;
1645
Daniel Veillard070803b2002-05-03 07:29:38 +00001646 dur = xmlSchemaNewValue(XML_SCHEMAS_DURATION);
1647 if (dur == NULL)
1648 return -1;
1649
1650 while (*cur != 0) {
Daniel Veillard070803b2002-05-03 07:29:38 +00001651
1652 /* input string should be empty or invalid date/time item */
1653 if (seq >= sizeof(desig))
1654 goto error;
1655
1656 /* T designator must be present for time items */
1657 if (*cur == 'T') {
1658 if (seq <= 3) {
1659 seq = 3;
1660 cur++;
1661 } else
1662 return 1;
1663 } else if (seq == 3)
1664 goto error;
1665
1666 /* parse the number portion of the item */
1667 PARSE_NUM(num, cur, num_type);
1668
1669 if ((num_type == -1) || (*cur == 0))
1670 goto error;
1671
1672 /* update duration based on item type */
1673 while (seq < sizeof(desig)) {
1674 if (*cur == desig[seq]) {
1675
1676 /* verify numeric type; only seconds can be float */
1677 if ((num_type != 0) && (seq < (sizeof(desig)-1)))
1678 goto error;
1679
1680 switch (seq) {
1681 case 0:
1682 dur->value.dur.mon = (long)num * 12;
1683 break;
1684 case 1:
1685 dur->value.dur.mon += (long)num;
1686 break;
1687 default:
1688 /* convert to seconds using multiplier */
1689 dur->value.dur.sec += num * multi[seq];
1690 seq++;
1691 break;
1692 }
1693
1694 break; /* exit loop */
1695 }
1696 /* no date designators found? */
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00001697 if ((++seq == 3) || (seq == 6))
Daniel Veillard070803b2002-05-03 07:29:38 +00001698 goto error;
1699 }
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00001700 cur++;
1701 if (collapse)
1702 while IS_WSP_BLANK_CH(*cur) cur++;
Daniel Veillard070803b2002-05-03 07:29:38 +00001703 }
1704
1705 if (isneg) {
1706 dur->value.dur.mon = -dur->value.dur.mon;
1707 dur->value.dur.day = -dur->value.dur.day;
1708 dur->value.dur.sec = -dur->value.dur.sec;
1709 }
1710
1711 if (val != NULL)
1712 *val = dur;
Daniel Veillard80b19092003-03-28 13:29:53 +00001713 else
1714 xmlSchemaFreeValue(dur);
Daniel Veillard070803b2002-05-03 07:29:38 +00001715
1716 return 0;
1717
1718error:
1719 if (dur != NULL)
1720 xmlSchemaFreeValue(dur);
1721 return 1;
1722}
1723
Daniel Veillarda1a9d042003-03-18 16:53:17 +00001724/**
1725 * xmlSchemaStrip:
1726 * @value: a value
1727 *
1728 * Removes the leading and ending spaces of a string
1729 *
1730 * Returns the new string or NULL if no change was required.
1731 */
1732static xmlChar *
1733xmlSchemaStrip(const xmlChar *value) {
1734 const xmlChar *start = value, *end, *f;
1735
1736 if (value == NULL) return(NULL);
William M. Brack76e95df2003-10-18 16:20:14 +00001737 while ((*start != 0) && (IS_BLANK_CH(*start))) start++;
Daniel Veillarda1a9d042003-03-18 16:53:17 +00001738 end = start;
1739 while (*end != 0) end++;
1740 f = end;
1741 end--;
William M. Brack76e95df2003-10-18 16:20:14 +00001742 while ((end > start) && (IS_BLANK_CH(*end))) end--;
Daniel Veillarda1a9d042003-03-18 16:53:17 +00001743 end++;
1744 if ((start == value) && (f == end)) return(NULL);
1745 return(xmlStrndup(start, end - start));
1746}
Daniel Veillard96a4b252003-02-06 08:22:32 +00001747
1748/**
Kasimier T. Buchcik91feaf82004-11-12 14:04:58 +00001749 * xmlSchemaWhiteSpaceReplace:
1750 * @value: a value
1751 *
1752 * Replaces 0xd, 0x9 and 0xa with a space.
1753 *
1754 * Returns the new string or NULL if no change was required.
1755 */
1756xmlChar *
1757xmlSchemaWhiteSpaceReplace(const xmlChar *value) {
1758 const xmlChar *cur = value;
1759 xmlChar *ret = NULL, *mcur;
1760
1761 if (value == NULL)
1762 return(NULL);
1763
1764 while ((*cur != 0) &&
1765 (((*cur) != 0xd) && ((*cur) != 0x9) && ((*cur) != 0xa))) {
1766 cur++;
1767 }
1768 if (*cur == 0)
1769 return (NULL);
1770 ret = xmlStrdup(value);
1771 /* TODO FIXME: I guess gcc will bark at this. */
1772 mcur = (xmlChar *) (ret + (cur - value));
1773 do {
1774 if ( ((*mcur) == 0xd) || ((*mcur) == 0x9) || ((*mcur) == 0xa) )
1775 *mcur = ' ';
1776 mcur++;
1777 } while (*mcur != 0);
1778 return(ret);
1779}
1780
1781/**
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001782 * xmlSchemaCollapseString:
1783 * @value: a value
1784 *
1785 * Removes and normalize white spaces in the string
1786 *
1787 * Returns the new string or NULL if no change was required.
1788 */
Daniel Veillard01fa6152004-06-29 17:04:39 +00001789xmlChar *
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001790xmlSchemaCollapseString(const xmlChar *value) {
1791 const xmlChar *start = value, *end, *f;
1792 xmlChar *g;
1793 int col = 0;
1794
1795 if (value == NULL) return(NULL);
William M. Brack76e95df2003-10-18 16:20:14 +00001796 while ((*start != 0) && (IS_BLANK_CH(*start))) start++;
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001797 end = start;
1798 while (*end != 0) {
William M. Brack76e95df2003-10-18 16:20:14 +00001799 if ((*end == ' ') && (IS_BLANK_CH(end[1]))) {
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001800 col = end - start;
1801 break;
1802 } else if ((*end == 0xa) || (*end == 0x9) || (*end == 0xd)) {
1803 col = end - start;
1804 break;
1805 }
1806 end++;
1807 }
1808 if (col == 0) {
1809 f = end;
1810 end--;
William M. Brack76e95df2003-10-18 16:20:14 +00001811 while ((end > start) && (IS_BLANK_CH(*end))) end--;
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001812 end++;
1813 if ((start == value) && (f == end)) return(NULL);
1814 return(xmlStrndup(start, end - start));
1815 }
1816 start = xmlStrdup(start);
1817 if (start == NULL) return(NULL);
1818 g = (xmlChar *) (start + col);
1819 end = g;
1820 while (*end != 0) {
William M. Brack76e95df2003-10-18 16:20:14 +00001821 if (IS_BLANK_CH(*end)) {
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001822 end++;
William M. Brack76e95df2003-10-18 16:20:14 +00001823 while (IS_BLANK_CH(*end)) end++;
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001824 if (*end != 0)
1825 *g++ = ' ';
1826 } else
1827 *g++ = *end++;
1828 }
1829 *g = 0;
1830 return((xmlChar *) start);
1831}
1832
1833/**
Daniel Veillard28c52ab2003-03-18 11:39:17 +00001834 * xmlSchemaValAtomicListNode:
1835 * @type: the predefined atomic type for a token in the list
1836 * @value: the list value to check
1837 * @ret: the return computed value
1838 * @node: the node containing the value
1839 *
1840 * Check that a value conforms to the lexical space of the predefined
1841 * list type. if true a value is computed and returned in @ret.
1842 *
Daniel Veillarda1a9d042003-03-18 16:53:17 +00001843 * Returns the number of items if this validates, a negative error code
1844 * number otherwise
Daniel Veillard28c52ab2003-03-18 11:39:17 +00001845 */
1846static int
1847xmlSchemaValAtomicListNode(xmlSchemaTypePtr type, const xmlChar *value,
1848 xmlSchemaValPtr *ret, xmlNodePtr node) {
1849 xmlChar *val, *cur, *endval;
1850 int nb_values = 0;
Daniel Veillard580ced82003-03-21 21:22:48 +00001851 int tmp = 0;
Daniel Veillard28c52ab2003-03-18 11:39:17 +00001852
1853 if (value == NULL) {
1854 return(-1);
1855 }
1856 val = xmlStrdup(value);
1857 if (val == NULL) {
1858 return(-1);
1859 }
Daniel Veillard6fc5db02005-01-16 00:05:58 +00001860 if (ret != NULL) {
1861 *ret = NULL;
1862 }
Daniel Veillard28c52ab2003-03-18 11:39:17 +00001863 cur = val;
1864 /*
1865 * Split the list
1866 */
William M. Brack76e95df2003-10-18 16:20:14 +00001867 while (IS_BLANK_CH(*cur)) *cur++ = 0;
Daniel Veillard28c52ab2003-03-18 11:39:17 +00001868 while (*cur != 0) {
William M. Brack76e95df2003-10-18 16:20:14 +00001869 if (IS_BLANK_CH(*cur)) {
Daniel Veillard28c52ab2003-03-18 11:39:17 +00001870 *cur = 0;
1871 cur++;
William M. Brack76e95df2003-10-18 16:20:14 +00001872 while (IS_BLANK_CH(*cur)) *cur++ = 0;
Daniel Veillard28c52ab2003-03-18 11:39:17 +00001873 } else {
1874 nb_values++;
1875 cur++;
William M. Brack76e95df2003-10-18 16:20:14 +00001876 while ((*cur != 0) && (!IS_BLANK_CH(*cur))) cur++;
Daniel Veillard28c52ab2003-03-18 11:39:17 +00001877 }
1878 }
1879 if (nb_values == 0) {
Daniel Veillard28c52ab2003-03-18 11:39:17 +00001880 xmlFree(val);
Daniel Veillarda1a9d042003-03-18 16:53:17 +00001881 return(nb_values);
Daniel Veillard28c52ab2003-03-18 11:39:17 +00001882 }
1883 endval = cur;
1884 cur = val;
1885 while ((*cur == 0) && (cur != endval)) cur++;
1886 while (cur != endval) {
1887 tmp = xmlSchemaValPredefTypeNode(type, cur, NULL, node);
1888 if (tmp != 0)
1889 break;
1890 while (*cur != 0) cur++;
1891 while ((*cur == 0) && (cur != endval)) cur++;
1892 }
Daniel Veillard6fc5db02005-01-16 00:05:58 +00001893 /* TODO what return value ? c.f. bug #158628
Daniel Veillard28c52ab2003-03-18 11:39:17 +00001894 if (ret != NULL) {
1895 TODO
Daniel Veillard6fc5db02005-01-16 00:05:58 +00001896 } */
1897 xmlFree(val);
Daniel Veillarda1a9d042003-03-18 16:53:17 +00001898 if (tmp == 0)
1899 return(nb_values);
1900 return(-1);
Daniel Veillard28c52ab2003-03-18 11:39:17 +00001901}
1902
1903/**
Daniel Veillarde637c4a2003-03-30 21:10:09 +00001904 * xmlSchemaParseUInt:
1905 * @str: pointer to the string R/W
1906 * @llo: pointer to the low result
1907 * @lmi: pointer to the mid result
1908 * @lhi: pointer to the high result
1909 *
1910 * Parse an unsigned long into 3 fields.
1911 *
William M. Brackec3b4b72005-03-15 15:50:17 +00001912 * Returns the number of significant digits in the number or
1913 * -1 if overflow of the capacity
Daniel Veillarde637c4a2003-03-30 21:10:09 +00001914 */
1915static int
1916xmlSchemaParseUInt(const xmlChar **str, unsigned long *llo,
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00001917 unsigned long *lmi, unsigned long *lhi) {
Daniel Veillarde637c4a2003-03-30 21:10:09 +00001918 unsigned long lo = 0, mi = 0, hi = 0;
1919 const xmlChar *tmp, *cur = *str;
1920 int ret = 0, i = 0;
1921
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00001922 while (*cur == '0') { /* ignore leading zeroes */
1923 cur++;
Daniel Veillarde637c4a2003-03-30 21:10:09 +00001924 }
1925 tmp = cur;
1926 while ((*tmp != 0) && (*tmp >= '0') && (*tmp <= '9')) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00001927 i++;tmp++;ret++;
Daniel Veillarde637c4a2003-03-30 21:10:09 +00001928 }
1929 if (i > 24) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00001930 *str = tmp;
1931 return(-1);
Daniel Veillarde637c4a2003-03-30 21:10:09 +00001932 }
1933 while (i > 16) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00001934 hi = hi * 10 + (*cur++ - '0');
1935 i--;
Daniel Veillarde637c4a2003-03-30 21:10:09 +00001936 }
1937 while (i > 8) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00001938 mi = mi * 10 + (*cur++ - '0');
1939 i--;
Daniel Veillarde637c4a2003-03-30 21:10:09 +00001940 }
1941 while (i > 0) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00001942 lo = lo * 10 + (*cur++ - '0');
1943 i--;
Daniel Veillarde637c4a2003-03-30 21:10:09 +00001944 }
1945
1946 *str = cur;
1947 *llo = lo;
1948 *lmi = mi;
1949 *lhi = hi;
1950 return(ret);
1951}
1952
1953/**
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001954 * xmlSchemaValAtomicType:
1955 * @type: the predefined type
1956 * @value: the value to check
1957 * @val: the return computed value
1958 * @node: the node containing the value
1959 * flags: flags to control the vlidation
1960 *
1961 * Check that a value conforms to the lexical space of the atomic type.
1962 * if true a value is computed and returned in @val.
Daniel Veillard01fa6152004-06-29 17:04:39 +00001963 * This checks the value space for list types as well (IDREFS, NMTOKENS).
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001964 *
1965 * Returns 0 if this validates, a positive error code number otherwise
1966 * and -1 in case of internal or API error.
1967 */
1968static int
Daniel Veillard1ac24d32003-08-27 14:15:15 +00001969xmlSchemaValAtomicType(xmlSchemaTypePtr type, const xmlChar * value,
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00001970 xmlSchemaValPtr * val, xmlNodePtr node, int flags,
1971 xmlSchemaWhitespaceValueType ws,
1972 int normOnTheFly, int applyNorm, int createStringValue)
Daniel Veillard1ac24d32003-08-27 14:15:15 +00001973{
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001974 xmlSchemaValPtr v;
1975 xmlChar *norm = NULL;
Daniel Veillardd3b9cd82003-04-09 11:24:17 +00001976 int ret = 0;
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001977
1978 if (xmlSchemaTypesInitialized == 0)
Daniel Veillard01fa6152004-06-29 17:04:39 +00001979 xmlSchemaInitTypes();
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001980 if (type == NULL)
Daniel Veillard1ac24d32003-08-27 14:15:15 +00001981 return (-1);
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001982
Daniel Veillardeebd6332004-08-26 10:30:44 +00001983 /*
1984 * validating a non existant text node is similar to validating
1985 * an empty one.
1986 */
1987 if (value == NULL)
1988 value = BAD_CAST "";
1989
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001990 if (val != NULL)
Daniel Veillard1ac24d32003-08-27 14:15:15 +00001991 *val = NULL;
Daniel Veillardb6c7f412003-03-29 16:41:55 +00001992 if ((flags == 0) && (value != NULL)) {
Kasimier T. Buchcik91feaf82004-11-12 14:04:58 +00001993
Daniel Veillard01fa6152004-06-29 17:04:39 +00001994 if ((type->builtInType != XML_SCHEMAS_STRING) &&
Kasimier T. Buchcik91feaf82004-11-12 14:04:58 +00001995 (type->builtInType != XML_SCHEMAS_ANYTYPE) &&
1996 (type->builtInType != XML_SCHEMAS_ANYSIMPLETYPE)) {
1997 if (type->builtInType == XML_SCHEMAS_NORMSTRING)
1998 norm = xmlSchemaWhiteSpaceReplace(value);
1999 else
2000 norm = xmlSchemaCollapseString(value);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002001 if (norm != NULL)
2002 value = norm;
2003 }
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002004 }
2005
Daniel Veillard01fa6152004-06-29 17:04:39 +00002006 switch (type->builtInType) {
William M. Brack2f2a6632004-08-20 23:09:47 +00002007 case XML_SCHEMAS_UNKNOWN:
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002008 goto error;
William M. Brack2f2a6632004-08-20 23:09:47 +00002009 case XML_SCHEMAS_ANYTYPE:
2010 case XML_SCHEMAS_ANYSIMPLETYPE:
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002011 if ((createStringValue) && (val != NULL)) {
2012 v = xmlSchemaNewValue(XML_SCHEMAS_ANYSIMPLETYPE);
2013 if (v != NULL) {
2014 v->value.str = xmlStrdup(value);
2015 *val = v;
2016 } else {
2017 goto error;
2018 }
2019 }
William M. Brack2f2a6632004-08-20 23:09:47 +00002020 goto return0;
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002021 case XML_SCHEMAS_STRING:
2022 if (! normOnTheFly) {
2023 const xmlChar *cur = value;
2024
2025 if (ws == XML_SCHEMA_WHITESPACE_REPLACE) {
2026 while (*cur != 0) {
2027 if ((*cur == 0xd) || (*cur == 0xa) || (*cur == 0x9)) {
2028 goto return1;
2029 } else {
2030 cur++;
2031 }
2032 }
2033 } else if (ws == XML_SCHEMA_WHITESPACE_COLLAPSE) {
2034 while (*cur != 0) {
2035 if ((*cur == 0xd) || (*cur == 0xa) || (*cur == 0x9)) {
2036 goto return1;
2037 } else if IS_WSP_SPACE_CH(*cur) {
2038 cur++;
2039 if IS_WSP_SPACE_CH(*cur)
2040 goto return1;
2041 } else {
2042 cur++;
2043 }
2044 }
2045 }
2046 }
2047 if (createStringValue && (val != NULL)) {
2048 if (applyNorm) {
2049 if (ws == XML_SCHEMA_WHITESPACE_COLLAPSE)
2050 norm = xmlSchemaCollapseString(value);
2051 else if (ws == XML_SCHEMA_WHITESPACE_REPLACE)
2052 norm = xmlSchemaWhiteSpaceReplace(value);
2053 if (norm != NULL)
2054 value = norm;
2055 }
2056 v = xmlSchemaNewValue(XML_SCHEMAS_STRING);
2057 if (v != NULL) {
2058 v->value.str = xmlStrdup(value);
2059 *val = v;
2060 } else {
2061 goto error;
2062 }
2063 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002064 goto return0;
Daniel Veillard1516d5b2004-01-22 07:27:45 +00002065 case XML_SCHEMAS_NORMSTRING:{
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002066 if (normOnTheFly) {
2067 if (applyNorm) {
2068 if (ws == XML_SCHEMA_WHITESPACE_COLLAPSE)
2069 norm = xmlSchemaCollapseString(value);
2070 else
2071 norm = xmlSchemaWhiteSpaceReplace(value);
2072 if (norm != NULL)
2073 value = norm;
2074 }
2075 } else {
2076 const xmlChar *cur = value;
2077 while (*cur != 0) {
2078 if ((*cur == 0xd) || (*cur == 0xa) || (*cur == 0x9)) {
2079 goto return1;
2080 } else {
2081 cur++;
2082 }
2083 }
2084 }
Daniel Veillard1516d5b2004-01-22 07:27:45 +00002085 if (val != NULL) {
2086 v = xmlSchemaNewValue(XML_SCHEMAS_NORMSTRING);
2087 if (v != NULL) {
2088 v->value.str = xmlStrdup(value);
2089 *val = v;
2090 } else {
2091 goto error;
2092 }
2093 }
2094 goto return0;
2095 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002096 case XML_SCHEMAS_DECIMAL:{
William M. Brack273670f2005-03-11 15:55:14 +00002097 const xmlChar *cur = value;
2098 unsigned int len, neg = 0;
2099 xmlChar cval[25];
2100 xmlChar *cptr = cval;
2101 int dec = -1;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002102
2103 if (cur == NULL)
2104 goto return1;
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002105
2106 if (normOnTheFly)
2107 while IS_WSP_BLANK_CH(*cur) cur++;
2108
William M. Brack273670f2005-03-11 15:55:14 +00002109 /* First we handle an optional sign */
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002110 if (*cur == '+')
2111 cur++;
2112 else if (*cur == '-') {
2113 neg = 1;
2114 cur++;
2115 }
William M. Brack273670f2005-03-11 15:55:14 +00002116 /*
2117 * Next we "pre-parse" the number, in preparation for calling
2118 * the common routine xmlSchemaParseUInt. We get rid of any
2119 * leading zeroes (because we have reserved only 25 chars),
2120 * and note the position of any decimal point.
2121 */
2122 len = 0;
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00002123 /*
2124 * Skip leading zeroes.
2125 */
2126 while (*cur == '0')
William M. Brack273670f2005-03-11 15:55:14 +00002127 cur++;
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00002128 if (*cur != 0) {
2129 while (len < 24) {
2130 if ((*cur >= '0') && (*cur <= '9')) {
2131 *cptr++ = *cur++;
2132 len++;
2133 } else if (*cur == '.') {
2134 if (dec != -1)
2135 goto return1; /* multiple decimal points */
2136 cur++;
2137 if ((*cur == 0) && (cur -1 == value))
2138 goto return1;
2139
2140 dec = len;
2141 while ((len < 24) && (*cur >= '0') &&
2142 (*cur <= '9')) {
2143 *cptr++ = *cur++;
2144 len++;
2145 }
2146 break;
2147 } else
2148 break;
2149 }
William M. Brack273670f2005-03-11 15:55:14 +00002150 }
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002151 if (normOnTheFly)
2152 while IS_WSP_BLANK_CH(*cur) cur++;
William M. Brack273670f2005-03-11 15:55:14 +00002153 if (*cur != 0)
2154 goto return1; /* error if any extraneous chars */
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002155 if (val != NULL) {
2156 v = xmlSchemaNewValue(XML_SCHEMAS_DECIMAL);
2157 if (v != NULL) {
William M. Brack273670f2005-03-11 15:55:14 +00002158 /*
2159 * If a mixed decimal, get rid of trailing zeroes
2160 */
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00002161 if (dec != -1) {
William M. Brack273670f2005-03-11 15:55:14 +00002162 while ((cptr > cval) && (*(cptr-1) == '0')) {
2163 cptr--;
2164 len--;
2165 }
2166 }
2167 *cptr = 0; /* Terminate our (preparsed) string */
2168 cptr = cval;
2169 /*
2170 * Now evaluate the significant digits of the number
2171 */
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00002172 if (*cptr != 0)
2173 xmlSchemaParseUInt((const xmlChar **)&cptr,
William M. Brack273670f2005-03-11 15:55:14 +00002174 &v->value.decimal.lo,
2175 &v->value.decimal.mi,
2176 &v->value.decimal.hi);
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00002177 /*
2178 * Set the total digits to 1 if a zero value.
2179 */
2180 if (len == 0)
2181 len++;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002182 v->value.decimal.sign = neg;
William M. Brack273670f2005-03-11 15:55:14 +00002183 if (dec == -1) {
2184 v->value.decimal.frac = 0;
2185 v->value.decimal.total = len;
2186 } else {
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00002187 v->value.decimal.frac = len - dec;
2188 v->value.decimal.total = len;
William M. Brack273670f2005-03-11 15:55:14 +00002189 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002190 *val = v;
2191 }
2192 }
2193 goto return0;
2194 }
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002195 case XML_SCHEMAS_TIME:
2196 case XML_SCHEMAS_GDAY:
2197 case XML_SCHEMAS_GMONTH:
2198 case XML_SCHEMAS_GMONTHDAY:
2199 case XML_SCHEMAS_GYEAR:
2200 case XML_SCHEMAS_GYEARMONTH:
2201 case XML_SCHEMAS_DATE:
2202 case XML_SCHEMAS_DATETIME:
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002203 ret = xmlSchemaValidateDates(type->builtInType, value, val,
2204 normOnTheFly);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002205 break;
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002206 case XML_SCHEMAS_DURATION:
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002207 ret = xmlSchemaValidateDuration(type, value, val,
2208 normOnTheFly);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002209 break;
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002210 case XML_SCHEMAS_FLOAT:
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002211 case XML_SCHEMAS_DOUBLE:{
2212 const xmlChar *cur = value;
2213 int neg = 0;
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002214
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002215 if (cur == NULL)
Daniel Veillard70bcb0e2003-08-08 14:00:28 +00002216 goto return1;
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002217
2218 if (normOnTheFly)
2219 while IS_WSP_BLANK_CH(*cur) cur++;
2220
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002221 if ((cur[0] == 'N') && (cur[1] == 'a') && (cur[2] == 'N')) {
2222 cur += 3;
2223 if (*cur != 0)
2224 goto return1;
2225 if (val != NULL) {
2226 if (type == xmlSchemaTypeFloatDef) {
2227 v = xmlSchemaNewValue(XML_SCHEMAS_FLOAT);
2228 if (v != NULL) {
2229 v->value.f = (float) xmlXPathNAN;
2230 } else {
2231 xmlSchemaFreeValue(v);
2232 goto error;
2233 }
2234 } else {
2235 v = xmlSchemaNewValue(XML_SCHEMAS_DOUBLE);
2236 if (v != NULL) {
2237 v->value.d = xmlXPathNAN;
2238 } else {
2239 xmlSchemaFreeValue(v);
2240 goto error;
2241 }
2242 }
2243 *val = v;
2244 }
2245 goto return0;
2246 }
2247 if (*cur == '-') {
2248 neg = 1;
2249 cur++;
2250 }
2251 if ((cur[0] == 'I') && (cur[1] == 'N') && (cur[2] == 'F')) {
2252 cur += 3;
2253 if (*cur != 0)
2254 goto return1;
2255 if (val != NULL) {
2256 if (type == xmlSchemaTypeFloatDef) {
2257 v = xmlSchemaNewValue(XML_SCHEMAS_FLOAT);
2258 if (v != NULL) {
2259 if (neg)
2260 v->value.f = (float) xmlXPathNINF;
2261 else
2262 v->value.f = (float) xmlXPathPINF;
2263 } else {
2264 xmlSchemaFreeValue(v);
2265 goto error;
2266 }
2267 } else {
2268 v = xmlSchemaNewValue(XML_SCHEMAS_DOUBLE);
2269 if (v != NULL) {
2270 if (neg)
2271 v->value.d = xmlXPathNINF;
2272 else
2273 v->value.d = xmlXPathPINF;
2274 } else {
2275 xmlSchemaFreeValue(v);
2276 goto error;
2277 }
2278 }
2279 *val = v;
2280 }
2281 goto return0;
2282 }
2283 if ((neg == 0) && (*cur == '+'))
2284 cur++;
2285 if ((cur[0] == 0) || (cur[0] == '+') || (cur[0] == '-'))
2286 goto return1;
2287 while ((*cur >= '0') && (*cur <= '9')) {
2288 cur++;
2289 }
2290 if (*cur == '.') {
2291 cur++;
2292 while ((*cur >= '0') && (*cur <= '9'))
2293 cur++;
2294 }
2295 if ((*cur == 'e') || (*cur == 'E')) {
2296 cur++;
2297 if ((*cur == '-') || (*cur == '+'))
2298 cur++;
2299 while ((*cur >= '0') && (*cur <= '9'))
2300 cur++;
2301 }
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002302 if (normOnTheFly)
2303 while IS_WSP_BLANK_CH(*cur) cur++;
2304
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002305 if (*cur != 0)
2306 goto return1;
2307 if (val != NULL) {
2308 if (type == xmlSchemaTypeFloatDef) {
2309 v = xmlSchemaNewValue(XML_SCHEMAS_FLOAT);
2310 if (v != NULL) {
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00002311 /*
2312 * TODO: sscanf seems not to give the correct
2313 * value for extremely high/low values.
2314 * E.g. "1E-149" results in zero.
2315 */
Daniel Veillardd0c9c322003-10-10 00:49:42 +00002316 if (sscanf((const char *) value, "%f",
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002317 &(v->value.f)) == 1) {
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00002318 *val = v;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002319 } else {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002320 xmlSchemaFreeValue(v);
2321 goto return1;
2322 }
2323 } else {
2324 goto error;
2325 }
2326 } else {
2327 v = xmlSchemaNewValue(XML_SCHEMAS_DOUBLE);
2328 if (v != NULL) {
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00002329 /*
2330 * TODO: sscanf seems not to give the correct
2331 * value for extremely high/low values.
2332 */
Daniel Veillardd0c9c322003-10-10 00:49:42 +00002333 if (sscanf((const char *) value, "%lf",
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002334 &(v->value.d)) == 1) {
2335 *val = v;
2336 } else {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002337 xmlSchemaFreeValue(v);
2338 goto return1;
2339 }
2340 } else {
2341 goto error;
2342 }
2343 }
2344 }
2345 goto return0;
Daniel Veillard70bcb0e2003-08-08 14:00:28 +00002346 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002347 case XML_SCHEMAS_BOOLEAN:{
2348 const xmlChar *cur = value;
2349
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002350 if (normOnTheFly) {
2351 while IS_WSP_BLANK_CH(*cur) cur++;
2352 if (*cur == '0') {
2353 ret = 0;
2354 cur++;
2355 } else if (*cur == '1') {
2356 ret = 1;
2357 cur++;
2358 } else if (*cur == 't') {
2359 cur++;
2360 if ((*cur++ == 'r') && (*cur++ == 'u') &&
2361 (*cur++ == 'e')) {
2362 ret = 1;
2363 } else
2364 goto return1;
2365 } else if (*cur == 'f') {
2366 cur++;
2367 if ((*cur++ == 'a') && (*cur++ == 'l') &&
2368 (*cur++ == 's') && (*cur++ == 'e')) {
2369 ret = 0;
2370 } else
2371 goto return1;
2372 }
2373 if (*cur != 0) {
2374 while IS_WSP_BLANK_CH(*cur) cur++;
2375 if (*cur != 0)
2376 goto return1;
2377 }
2378 } else {
2379 if ((cur[0] == '0') && (cur[1] == 0))
2380 ret = 0;
2381 else if ((cur[0] == '1') && (cur[1] == 0))
2382 ret = 1;
2383 else if ((cur[0] == 't') && (cur[1] == 'r')
2384 && (cur[2] == 'u') && (cur[3] == 'e')
2385 && (cur[4] == 0))
2386 ret = 1;
2387 else if ((cur[0] == 'f') && (cur[1] == 'a')
2388 && (cur[2] == 'l') && (cur[3] == 's')
2389 && (cur[4] == 'e') && (cur[5] == 0))
2390 ret = 0;
2391 else
2392 goto return1;
2393 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002394 if (val != NULL) {
2395 v = xmlSchemaNewValue(XML_SCHEMAS_BOOLEAN);
2396 if (v != NULL) {
2397 v->value.b = ret;
2398 *val = v;
2399 } else {
2400 goto error;
2401 }
2402 }
2403 goto return0;
2404 }
2405 case XML_SCHEMAS_TOKEN:{
2406 const xmlChar *cur = value;
2407
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002408 if (! normOnTheFly) {
2409 while (*cur != 0) {
2410 if ((*cur == 0xd) || (*cur == 0xa) || (*cur == 0x9)) {
2411 goto return1;
2412 } else if (*cur == ' ') {
2413 cur++;
2414 if (*cur == 0)
2415 goto return1;
2416 if (*cur == ' ')
2417 goto return1;
2418 } else {
2419 cur++;
2420 }
2421 }
2422 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002423 if (val != NULL) {
2424 v = xmlSchemaNewValue(XML_SCHEMAS_TOKEN);
2425 if (v != NULL) {
2426 v->value.str = xmlStrdup(value);
2427 *val = v;
2428 } else {
2429 goto error;
2430 }
2431 }
2432 goto return0;
2433 }
2434 case XML_SCHEMAS_LANGUAGE:
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002435 if (normOnTheFly) {
2436 norm = xmlSchemaCollapseString(value);
2437 if (norm != NULL)
2438 value = norm;
2439 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002440 if (xmlCheckLanguageID(value) == 1) {
2441 if (val != NULL) {
2442 v = xmlSchemaNewValue(XML_SCHEMAS_LANGUAGE);
2443 if (v != NULL) {
2444 v->value.str = xmlStrdup(value);
2445 *val = v;
2446 } else {
2447 goto error;
2448 }
2449 }
2450 goto return0;
2451 }
2452 goto return1;
2453 case XML_SCHEMAS_NMTOKEN:
2454 if (xmlValidateNMToken(value, 1) == 0) {
2455 if (val != NULL) {
2456 v = xmlSchemaNewValue(XML_SCHEMAS_NMTOKEN);
2457 if (v != NULL) {
2458 v->value.str = xmlStrdup(value);
2459 *val = v;
2460 } else {
2461 goto error;
2462 }
2463 }
2464 goto return0;
2465 }
2466 goto return1;
2467 case XML_SCHEMAS_NMTOKENS:
2468 ret = xmlSchemaValAtomicListNode(xmlSchemaTypeNmtokenDef,
2469 value, val, node);
2470 if (ret > 0)
2471 ret = 0;
2472 else
2473 ret = 1;
2474 goto done;
2475 case XML_SCHEMAS_NAME:
2476 ret = xmlValidateName(value, 1);
Daniel Veillarddf292f72005-01-16 19:00:15 +00002477 if ((ret == 0) && (val != NULL) && (value != NULL)) {
2478 v = xmlSchemaNewValue(XML_SCHEMAS_NAME);
2479 if (v != NULL) {
2480 const xmlChar *start = value, *end;
2481 while (IS_BLANK_CH(*start)) start++;
2482 end = start;
2483 while ((*end != 0) && (!IS_BLANK_CH(*end))) end++;
2484 v->value.str = xmlStrndup(start, end - start);
2485 *val = v;
2486 } else {
2487 goto error;
2488 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002489 }
2490 goto done;
2491 case XML_SCHEMAS_QNAME:{
2492 xmlChar *uri = NULL;
2493 xmlChar *local = NULL;
2494
2495 ret = xmlValidateQName(value, 1);
2496 if ((ret == 0) && (node != NULL)) {
2497 xmlChar *prefix;
2498
2499 local = xmlSplitQName2(value, &prefix);
2500 if (prefix != NULL) {
2501 xmlNsPtr ns;
2502
2503 ns = xmlSearchNs(node->doc, node, prefix);
2504 if (ns == NULL)
2505 ret = 1;
2506 else if (val != NULL)
2507 uri = xmlStrdup(ns->href);
2508 }
2509 if ((local != NULL) && ((val == NULL) || (ret != 0)))
2510 xmlFree(local);
2511 if (prefix != NULL)
2512 xmlFree(prefix);
2513 }
2514 if ((ret == 0) && (val != NULL)) {
2515 v = xmlSchemaNewValue(XML_SCHEMAS_QNAME);
2516 if (v != NULL) {
2517 if (local != NULL)
2518 v->value.qname.name = local;
2519 else
2520 v->value.qname.name = xmlStrdup(value);
2521 if (uri != NULL)
2522 v->value.qname.uri = uri;
2523
2524 *val = v;
2525 } else {
2526 if (local != NULL)
2527 xmlFree(local);
2528 if (uri != NULL)
2529 xmlFree(uri);
2530 goto error;
2531 }
2532 }
2533 goto done;
2534 }
2535 case XML_SCHEMAS_NCNAME:
2536 ret = xmlValidateNCName(value, 1);
2537 if ((ret == 0) && (val != NULL)) {
2538 v = xmlSchemaNewValue(XML_SCHEMAS_NCNAME);
2539 if (v != NULL) {
2540 v->value.str = xmlStrdup(value);
2541 *val = v;
2542 } else {
2543 goto error;
2544 }
2545 }
2546 goto done;
2547 case XML_SCHEMAS_ID:
2548 ret = xmlValidateNCName(value, 1);
2549 if ((ret == 0) && (val != NULL)) {
2550 v = xmlSchemaNewValue(XML_SCHEMAS_ID);
2551 if (v != NULL) {
2552 v->value.str = xmlStrdup(value);
2553 *val = v;
2554 } else {
2555 goto error;
2556 }
2557 }
2558 if ((ret == 0) && (node != NULL) &&
2559 (node->type == XML_ATTRIBUTE_NODE)) {
2560 xmlAttrPtr attr = (xmlAttrPtr) node;
2561
2562 /*
2563 * NOTE: the IDness might have already be declared in the DTD
2564 */
2565 if (attr->atype != XML_ATTRIBUTE_ID) {
2566 xmlIDPtr res;
2567 xmlChar *strip;
2568
2569 strip = xmlSchemaStrip(value);
2570 if (strip != NULL) {
2571 res = xmlAddID(NULL, node->doc, strip, attr);
2572 xmlFree(strip);
2573 } else
2574 res = xmlAddID(NULL, node->doc, value, attr);
2575 if (res == NULL) {
2576 ret = 2;
2577 } else {
2578 attr->atype = XML_ATTRIBUTE_ID;
2579 }
2580 }
2581 }
2582 goto done;
2583 case XML_SCHEMAS_IDREF:
2584 ret = xmlValidateNCName(value, 1);
2585 if ((ret == 0) && (val != NULL)) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00002586 v = xmlSchemaNewValue(XML_SCHEMAS_IDREF);
2587 if (v == NULL)
2588 goto error;
2589 v->value.str = xmlStrdup(value);
2590 *val = v;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002591 }
2592 if ((ret == 0) && (node != NULL) &&
2593 (node->type == XML_ATTRIBUTE_NODE)) {
2594 xmlAttrPtr attr = (xmlAttrPtr) node;
2595 xmlChar *strip;
2596
2597 strip = xmlSchemaStrip(value);
2598 if (strip != NULL) {
2599 xmlAddRef(NULL, node->doc, strip, attr);
2600 xmlFree(strip);
2601 } else
2602 xmlAddRef(NULL, node->doc, value, attr);
2603 attr->atype = XML_ATTRIBUTE_IDREF;
2604 }
2605 goto done;
2606 case XML_SCHEMAS_IDREFS:
2607 ret = xmlSchemaValAtomicListNode(xmlSchemaTypeIdrefDef,
2608 value, val, node);
2609 if (ret < 0)
2610 ret = 2;
2611 else
2612 ret = 0;
2613 if ((ret == 0) && (node != NULL) &&
2614 (node->type == XML_ATTRIBUTE_NODE)) {
2615 xmlAttrPtr attr = (xmlAttrPtr) node;
2616
2617 attr->atype = XML_ATTRIBUTE_IDREFS;
2618 }
2619 goto done;
2620 case XML_SCHEMAS_ENTITY:{
2621 xmlChar *strip;
2622
2623 ret = xmlValidateNCName(value, 1);
2624 if ((node == NULL) || (node->doc == NULL))
2625 ret = 3;
2626 if (ret == 0) {
2627 xmlEntityPtr ent;
2628
2629 strip = xmlSchemaStrip(value);
2630 if (strip != NULL) {
2631 ent = xmlGetDocEntity(node->doc, strip);
2632 xmlFree(strip);
2633 } else {
2634 ent = xmlGetDocEntity(node->doc, value);
2635 }
2636 if ((ent == NULL) ||
2637 (ent->etype !=
2638 XML_EXTERNAL_GENERAL_UNPARSED_ENTITY))
2639 ret = 4;
2640 }
2641 if ((ret == 0) && (val != NULL)) {
2642 TODO;
2643 }
2644 if ((ret == 0) && (node != NULL) &&
2645 (node->type == XML_ATTRIBUTE_NODE)) {
2646 xmlAttrPtr attr = (xmlAttrPtr) node;
2647
2648 attr->atype = XML_ATTRIBUTE_ENTITY;
2649 }
2650 goto done;
2651 }
2652 case XML_SCHEMAS_ENTITIES:
2653 if ((node == NULL) || (node->doc == NULL))
2654 goto return3;
2655 ret = xmlSchemaValAtomicListNode(xmlSchemaTypeEntityDef,
2656 value, val, node);
2657 if (ret <= 0)
2658 ret = 1;
2659 else
2660 ret = 0;
2661 if ((ret == 0) && (node != NULL) &&
2662 (node->type == XML_ATTRIBUTE_NODE)) {
2663 xmlAttrPtr attr = (xmlAttrPtr) node;
2664
2665 attr->atype = XML_ATTRIBUTE_ENTITIES;
2666 }
2667 goto done;
2668 case XML_SCHEMAS_NOTATION:{
2669 xmlChar *uri = NULL;
2670 xmlChar *local = NULL;
2671
2672 ret = xmlValidateQName(value, 1);
2673 if ((ret == 0) && (node != NULL)) {
2674 xmlChar *prefix;
2675
2676 local = xmlSplitQName2(value, &prefix);
2677 if (prefix != NULL) {
2678 xmlNsPtr ns;
2679
2680 ns = xmlSearchNs(node->doc, node, prefix);
2681 if (ns == NULL)
2682 ret = 1;
2683 else if (val != NULL)
2684 uri = xmlStrdup(ns->href);
2685 }
2686 if ((local != NULL) && ((val == NULL) || (ret != 0)))
2687 xmlFree(local);
2688 if (prefix != NULL)
2689 xmlFree(prefix);
2690 }
2691 if ((node == NULL) || (node->doc == NULL))
2692 ret = 3;
2693 if (ret == 0) {
2694 ret = xmlValidateNotationUse(NULL, node->doc, value);
2695 if (ret == 1)
2696 ret = 0;
2697 else
2698 ret = 1;
2699 }
2700 if ((ret == 0) && (val != NULL)) {
2701 v = xmlSchemaNewValue(XML_SCHEMAS_NOTATION);
2702 if (v != NULL) {
2703 if (local != NULL)
2704 v->value.qname.name = local;
2705 else
2706 v->value.qname.name = xmlStrdup(value);
2707 if (uri != NULL)
2708 v->value.qname.uri = uri;
2709
2710 *val = v;
2711 } else {
2712 if (local != NULL)
2713 xmlFree(local);
2714 if (uri != NULL)
2715 xmlFree(uri);
2716 goto error;
2717 }
2718 }
2719 goto done;
2720 }
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002721 case XML_SCHEMAS_ANYURI:{
Daniel Veillard11c466a2004-03-14 12:20:15 +00002722 if (*value != 0) {
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002723 xmlURIPtr uri;
2724 if (normOnTheFly) {
2725 norm = xmlSchemaCollapseString(value);
2726 if (norm != NULL)
2727 value = norm;
2728 }
2729 uri = xmlParseURI((const char *) value);
Daniel Veillard11c466a2004-03-14 12:20:15 +00002730 if (uri == NULL)
2731 goto return1;
2732 xmlFreeURI(uri);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002733 }
Daniel Veillard11c466a2004-03-14 12:20:15 +00002734
2735 if (val != NULL) {
2736 v = xmlSchemaNewValue(XML_SCHEMAS_ANYURI);
2737 if (v == NULL)
2738 goto error;
2739 v->value.str = xmlStrdup(value);
2740 *val = v;
2741 }
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002742 goto return0;
2743 }
2744 case XML_SCHEMAS_HEXBINARY:{
Kasimier T. Buchcik8dd1e1b2005-06-09 13:14:38 +00002745 const xmlChar *cur = value, *start;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002746 xmlChar *base;
2747 int total, i = 0;
2748
Daniel Veillardf34a20e2004-08-31 08:42:17 +00002749 if (cur == NULL)
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002750 goto return1;
2751
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002752 if (normOnTheFly)
2753 while IS_WSP_BLANK_CH(*cur) cur++;
2754
Kasimier T. Buchcik8dd1e1b2005-06-09 13:14:38 +00002755 start = cur;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002756 while (((*cur >= '0') && (*cur <= '9')) ||
2757 ((*cur >= 'A') && (*cur <= 'F')) ||
2758 ((*cur >= 'a') && (*cur <= 'f'))) {
2759 i++;
2760 cur++;
2761 }
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002762 if (normOnTheFly)
2763 while IS_WSP_BLANK_CH(*cur) cur++;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002764
2765 if (*cur != 0)
2766 goto return1;
2767 if ((i % 2) != 0)
2768 goto return1;
2769
2770 if (val != NULL) {
2771
2772 v = xmlSchemaNewValue(XML_SCHEMAS_HEXBINARY);
2773 if (v == NULL)
2774 goto error;
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002775 /*
2776 * Copy only the normalized piece.
2777 * CRITICAL TODO: Check this.
2778 */
Kasimier T. Buchcik8dd1e1b2005-06-09 13:14:38 +00002779 cur = xmlStrndup(start, i);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002780 if (cur == NULL) {
Daniel Veillardd0c9c322003-10-10 00:49:42 +00002781 xmlSchemaTypeErrMemory(node, "allocating hexbin data");
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002782 xmlFree(v);
2783 goto return1;
2784 }
2785
2786 total = i / 2; /* number of octets */
2787
2788 base = (xmlChar *) cur;
2789 while (i-- > 0) {
2790 if (*base >= 'a')
2791 *base = *base - ('a' - 'A');
2792 base++;
2793 }
2794
2795 v->value.hex.str = (xmlChar *) cur;
2796 v->value.hex.total = total;
2797 *val = v;
2798 }
2799 goto return0;
2800 }
2801 case XML_SCHEMAS_BASE64BINARY:{
2802 /* ISSUE:
2803 *
2804 * Ignore all stray characters? (yes, currently)
2805 * Worry about long lines? (no, currently)
2806 *
2807 * rfc2045.txt:
2808 *
2809 * "The encoded output stream must be represented in lines of
2810 * no more than 76 characters each. All line breaks or other
2811 * characters not found in Table 1 must be ignored by decoding
2812 * software. In base64 data, characters other than those in
2813 * Table 1, line breaks, and other white space probably
2814 * indicate a transmission error, about which a warning
2815 * message or even a message rejection might be appropriate
2816 * under some circumstances." */
2817 const xmlChar *cur = value;
2818 xmlChar *base;
2819 int total, i = 0, pad = 0;
2820
2821 if (cur == NULL)
2822 goto return1;
2823
2824 for (; *cur; ++cur) {
2825 int decc;
2826
2827 decc = _xmlSchemaBase64Decode(*cur);
2828 if (decc < 0) ;
2829 else if (decc < 64)
2830 i++;
2831 else
2832 break;
2833 }
2834 for (; *cur; ++cur) {
2835 int decc;
2836
2837 decc = _xmlSchemaBase64Decode(*cur);
2838 if (decc < 0) ;
2839 else if (decc < 64)
2840 goto return1;
2841 if (decc == 64)
2842 pad++;
2843 }
2844
2845 /* rfc2045.txt: "Special processing is performed if fewer than
2846 * 24 bits are available at the end of the data being encoded.
2847 * A full encoding quantum is always completed at the end of a
2848 * body. When fewer than 24 input bits are available in an
2849 * input group, zero bits are added (on the right) to form an
2850 * integral number of 6-bit groups. Padding at the end of the
2851 * data is performed using the "=" character. Since all
2852 * base64 input is an integral number of octets, only the
2853 * following cases can arise: (1) the final quantum of
2854 * encoding input is an integral multiple of 24 bits; here,
2855 * the final unit of encoded output will be an integral
2856 * multiple ofindent: Standard input:701: Warning:old style
2857 * assignment ambiguity in "=*". Assuming "= *" 4 characters
2858 * with no "=" padding, (2) the final
2859 * quantum of encoding input is exactly 8 bits; here, the
2860 * final unit of encoded output will be two characters
2861 * followed by two "=" padding characters, or (3) the final
2862 * quantum of encoding input is exactly 16 bits; here, the
2863 * final unit of encoded output will be three characters
2864 * followed by one "=" padding character." */
2865
2866 total = 3 * (i / 4);
2867 if (pad == 0) {
2868 if (i % 4 != 0)
2869 goto return1;
2870 } else if (pad == 1) {
2871 int decc;
2872
2873 if (i % 4 != 3)
2874 goto return1;
2875 for (decc = _xmlSchemaBase64Decode(*cur);
2876 (decc < 0) || (decc > 63);
2877 decc = _xmlSchemaBase64Decode(*cur))
2878 --cur;
2879 /* 16bits in 24bits means 2 pad bits: nnnnnn nnmmmm mmmm00*/
2880 /* 00111100 -> 0x3c */
2881 if (decc & ~0x3c)
2882 goto return1;
2883 total += 2;
2884 } else if (pad == 2) {
2885 int decc;
2886
2887 if (i % 4 != 2)
2888 goto return1;
2889 for (decc = _xmlSchemaBase64Decode(*cur);
2890 (decc < 0) || (decc > 63);
2891 decc = _xmlSchemaBase64Decode(*cur))
2892 --cur;
2893 /* 8bits in 12bits means 4 pad bits: nnnnnn nn0000 */
2894 /* 00110000 -> 0x30 */
2895 if (decc & ~0x30)
2896 goto return1;
2897 total += 1;
2898 } else
2899 goto return1;
2900
2901 if (val != NULL) {
2902 v = xmlSchemaNewValue(XML_SCHEMAS_BASE64BINARY);
2903 if (v == NULL)
2904 goto error;
2905 base =
2906 (xmlChar *) xmlMallocAtomic((i + pad + 1) *
2907 sizeof(xmlChar));
2908 if (base == NULL) {
Daniel Veillardd0c9c322003-10-10 00:49:42 +00002909 xmlSchemaTypeErrMemory(node, "allocating base64 data");
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002910 xmlFree(v);
2911 goto return1;
2912 }
2913 v->value.base64.str = base;
2914 for (cur = value; *cur; ++cur)
2915 if (_xmlSchemaBase64Decode(*cur) >= 0) {
2916 *base = *cur;
2917 ++base;
2918 }
2919 *base = 0;
2920 v->value.base64.total = total;
2921 *val = v;
2922 }
2923 goto return0;
2924 }
Daniel Veillarde637c4a2003-03-30 21:10:09 +00002925 case XML_SCHEMAS_INTEGER:
2926 case XML_SCHEMAS_PINTEGER:
2927 case XML_SCHEMAS_NPINTEGER:
Daniel Veillardb6c7f412003-03-29 16:41:55 +00002928 case XML_SCHEMAS_NINTEGER:
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002929 case XML_SCHEMAS_NNINTEGER:{
2930 const xmlChar *cur = value;
2931 unsigned long lo, mi, hi;
William M. Brackec3b4b72005-03-15 15:50:17 +00002932 int sign = 0;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002933
2934 if (cur == NULL)
2935 goto return1;
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002936 if (normOnTheFly)
2937 while IS_WSP_BLANK_CH(*cur) cur++;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002938 if (*cur == '-') {
2939 sign = 1;
2940 cur++;
2941 } else if (*cur == '+')
2942 cur++;
William M. Brackec3b4b72005-03-15 15:50:17 +00002943 ret = xmlSchemaParseUInt(&cur, &lo, &mi, &hi);
2944 if (ret == -1)
2945 goto return1;
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00002946 if (normOnTheFly)
2947 while IS_WSP_BLANK_CH(*cur) cur++;
William M. Brackec3b4b72005-03-15 15:50:17 +00002948 if (*cur != 0)
2949 goto return1;
Daniel Veillard01fa6152004-06-29 17:04:39 +00002950 if (type->builtInType == XML_SCHEMAS_NPINTEGER) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002951 if ((sign == 0) &&
2952 ((hi != 0) || (mi != 0) || (lo != 0)))
2953 goto return1;
Daniel Veillard01fa6152004-06-29 17:04:39 +00002954 } else if (type->builtInType == XML_SCHEMAS_PINTEGER) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002955 if (sign == 1)
2956 goto return1;
2957 if ((hi == 0) && (mi == 0) && (lo == 0))
2958 goto return1;
Daniel Veillard01fa6152004-06-29 17:04:39 +00002959 } else if (type->builtInType == XML_SCHEMAS_NINTEGER) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002960 if (sign == 0)
2961 goto return1;
2962 if ((hi == 0) && (mi == 0) && (lo == 0))
2963 goto return1;
Daniel Veillard01fa6152004-06-29 17:04:39 +00002964 } else if (type->builtInType == XML_SCHEMAS_NNINTEGER) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002965 if ((sign == 1) &&
2966 ((hi != 0) || (mi != 0) || (lo != 0)))
2967 goto return1;
2968 }
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00002969 if (val != NULL) {
Daniel Veillard01fa6152004-06-29 17:04:39 +00002970 v = xmlSchemaNewValue(type->builtInType);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002971 if (v != NULL) {
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00002972 if (ret == 0)
2973 ret++;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002974 v->value.decimal.lo = lo;
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00002975 v->value.decimal.mi = mi;
2976 v->value.decimal.hi = hi;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002977 v->value.decimal.sign = sign;
2978 v->value.decimal.frac = 0;
William M. Brackec3b4b72005-03-15 15:50:17 +00002979 v->value.decimal.total = ret;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002980 *val = v;
2981 }
2982 }
2983 goto return0;
2984 }
Daniel Veillarde637c4a2003-03-30 21:10:09 +00002985 case XML_SCHEMAS_LONG:
2986 case XML_SCHEMAS_BYTE:
2987 case XML_SCHEMAS_SHORT:
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002988 case XML_SCHEMAS_INT:{
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00002989 const xmlChar *cur = value;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002990 unsigned long lo, mi, hi;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00002991 int sign = 0;
2992
2993 if (cur == NULL)
2994 goto return1;
2995 if (*cur == '-') {
2996 sign = 1;
2997 cur++;
2998 } else if (*cur == '+')
2999 cur++;
William M. Brackec3b4b72005-03-15 15:50:17 +00003000 ret = xmlSchemaParseUInt(&cur, &lo, &mi, &hi);
3001 if (ret < 0)
3002 goto return1;
3003 if (*cur != 0)
3004 goto return1;
Daniel Veillard01fa6152004-06-29 17:04:39 +00003005 if (type->builtInType == XML_SCHEMAS_LONG) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003006 if (hi >= 922) {
3007 if (hi > 922)
3008 goto return1;
3009 if (mi >= 33720368) {
3010 if (mi > 33720368)
3011 goto return1;
3012 if ((sign == 0) && (lo > 54775807))
3013 goto return1;
3014 if ((sign == 1) && (lo > 54775808))
3015 goto return1;
3016 }
3017 }
Daniel Veillard01fa6152004-06-29 17:04:39 +00003018 } else if (type->builtInType == XML_SCHEMAS_INT) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003019 if (hi != 0)
3020 goto return1;
3021 if (mi >= 21) {
3022 if (mi > 21)
3023 goto return1;
3024 if ((sign == 0) && (lo > 47483647))
3025 goto return1;
3026 if ((sign == 1) && (lo > 47483648))
3027 goto return1;
3028 }
Daniel Veillard01fa6152004-06-29 17:04:39 +00003029 } else if (type->builtInType == XML_SCHEMAS_SHORT) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003030 if ((mi != 0) || (hi != 0))
3031 goto return1;
3032 if ((sign == 1) && (lo > 32768))
3033 goto return1;
3034 if ((sign == 0) && (lo > 32767))
3035 goto return1;
Daniel Veillard01fa6152004-06-29 17:04:39 +00003036 } else if (type->builtInType == XML_SCHEMAS_BYTE) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003037 if ((mi != 0) || (hi != 0))
3038 goto return1;
3039 if ((sign == 1) && (lo > 128))
3040 goto return1;
3041 if ((sign == 0) && (lo > 127))
3042 goto return1;
3043 }
3044 if (val != NULL) {
Daniel Veillard01fa6152004-06-29 17:04:39 +00003045 v = xmlSchemaNewValue(type->builtInType);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003046 if (v != NULL) {
3047 v->value.decimal.lo = lo;
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00003048 v->value.decimal.mi = mi;
3049 v->value.decimal.hi = hi;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003050 v->value.decimal.sign = sign;
3051 v->value.decimal.frac = 0;
William M. Brackec3b4b72005-03-15 15:50:17 +00003052 v->value.decimal.total = ret;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003053 *val = v;
3054 }
3055 }
3056 goto return0;
3057 }
Daniel Veillardb6c7f412003-03-29 16:41:55 +00003058 case XML_SCHEMAS_UINT:
Daniel Veillardb6c7f412003-03-29 16:41:55 +00003059 case XML_SCHEMAS_ULONG:
Daniel Veillardb6c7f412003-03-29 16:41:55 +00003060 case XML_SCHEMAS_USHORT:
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003061 case XML_SCHEMAS_UBYTE:{
3062 const xmlChar *cur = value;
3063 unsigned long lo, mi, hi;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003064
3065 if (cur == NULL)
3066 goto return1;
William M. Brackec3b4b72005-03-15 15:50:17 +00003067 ret = xmlSchemaParseUInt(&cur, &lo, &mi, &hi);
3068 if (ret < 0)
3069 goto return1;
3070 if (*cur != 0)
3071 goto return1;
Daniel Veillard01fa6152004-06-29 17:04:39 +00003072 if (type->builtInType == XML_SCHEMAS_ULONG) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003073 if (hi >= 1844) {
3074 if (hi > 1844)
3075 goto return1;
3076 if (mi >= 67440737) {
3077 if (mi > 67440737)
3078 goto return1;
3079 if (lo > 9551615)
3080 goto return1;
3081 }
3082 }
Daniel Veillard01fa6152004-06-29 17:04:39 +00003083 } else if (type->builtInType == XML_SCHEMAS_UINT) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003084 if (hi != 0)
3085 goto return1;
3086 if (mi >= 42) {
3087 if (mi > 42)
3088 goto return1;
3089 if (lo > 94967295)
3090 goto return1;
3091 }
Daniel Veillard01fa6152004-06-29 17:04:39 +00003092 } else if (type->builtInType == XML_SCHEMAS_USHORT) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003093 if ((mi != 0) || (hi != 0))
3094 goto return1;
3095 if (lo > 65535)
3096 goto return1;
Daniel Veillard01fa6152004-06-29 17:04:39 +00003097 } else if (type->builtInType == XML_SCHEMAS_UBYTE) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003098 if ((mi != 0) || (hi != 0))
3099 goto return1;
3100 if (lo > 255)
3101 goto return1;
3102 }
3103 if (val != NULL) {
Daniel Veillard01fa6152004-06-29 17:04:39 +00003104 v = xmlSchemaNewValue(type->builtInType);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003105 if (v != NULL) {
3106 v->value.decimal.lo = lo;
3107 v->value.decimal.mi = mi;
3108 v->value.decimal.hi = hi;
3109 v->value.decimal.sign = 0;
3110 v->value.decimal.frac = 0;
William M. Brackec3b4b72005-03-15 15:50:17 +00003111 v->value.decimal.total = ret;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003112 *val = v;
3113 }
3114 }
3115 goto return0;
3116 }
Daniel Veillardb6c7f412003-03-29 16:41:55 +00003117 }
3118
Daniel Veillard1ac24d32003-08-27 14:15:15 +00003119 done:
3120 if (norm != NULL)
3121 xmlFree(norm);
3122 return (ret);
3123 return3:
3124 if (norm != NULL)
3125 xmlFree(norm);
3126 return (3);
3127 return1:
3128 if (norm != NULL)
3129 xmlFree(norm);
3130 return (1);
3131 return0:
3132 if (norm != NULL)
3133 xmlFree(norm);
3134 return (0);
3135 error:
3136 if (norm != NULL)
3137 xmlFree(norm);
3138 return (-1);
Daniel Veillardb6c7f412003-03-29 16:41:55 +00003139}
3140
3141/**
Daniel Veillardc3da18a2003-03-18 00:31:04 +00003142 * xmlSchemaValPredefTypeNode:
Daniel Veillard4255d502002-04-16 15:50:10 +00003143 * @type: the predefined type
3144 * @value: the value to check
3145 * @val: the return computed value
Daniel Veillardc3da18a2003-03-18 00:31:04 +00003146 * @node: the node containing the value
Daniel Veillard4255d502002-04-16 15:50:10 +00003147 *
3148 * Check that a value conforms to the lexical space of the predefined type.
3149 * if true a value is computed and returned in @val.
3150 *
3151 * Returns 0 if this validates, a positive error code number otherwise
3152 * and -1 in case of internal or API error.
3153 */
3154int
Daniel Veillardc3da18a2003-03-18 00:31:04 +00003155xmlSchemaValPredefTypeNode(xmlSchemaTypePtr type, const xmlChar *value,
3156 xmlSchemaValPtr *val, xmlNodePtr node) {
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003157 return(xmlSchemaValAtomicType(type, value, val, node, 0,
3158 XML_SCHEMA_WHITESPACE_UNKNOWN, 1, 1, 0));
Daniel Veillard4255d502002-04-16 15:50:10 +00003159}
3160
3161/**
Daniel Veillardc0826a72004-08-10 14:17:33 +00003162 * xmlSchemaValPredefTypeNodeNoNorm:
3163 * @type: the predefined type
3164 * @value: the value to check
3165 * @val: the return computed value
3166 * @node: the node containing the value
3167 *
3168 * Check that a value conforms to the lexical space of the predefined type.
3169 * if true a value is computed and returned in @val.
3170 * This one does apply any normalization to the value.
3171 *
3172 * Returns 0 if this validates, a positive error code number otherwise
3173 * and -1 in case of internal or API error.
3174 */
3175int
3176xmlSchemaValPredefTypeNodeNoNorm(xmlSchemaTypePtr type, const xmlChar *value,
3177 xmlSchemaValPtr *val, xmlNodePtr node) {
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003178 return(xmlSchemaValAtomicType(type, value, val, node, 1,
3179 XML_SCHEMA_WHITESPACE_UNKNOWN, 1, 0, 1));
Daniel Veillardc0826a72004-08-10 14:17:33 +00003180}
3181
3182/**
Daniel Veillardc3da18a2003-03-18 00:31:04 +00003183 * xmlSchemaValidatePredefinedType:
3184 * @type: the predefined type
3185 * @value: the value to check
3186 * @val: the return computed value
3187 *
3188 * Check that a value conforms to the lexical space of the predefined type.
3189 * if true a value is computed and returned in @val.
3190 *
3191 * Returns 0 if this validates, a positive error code number otherwise
3192 * and -1 in case of internal or API error.
3193 */
3194int
3195xmlSchemaValidatePredefinedType(xmlSchemaTypePtr type, const xmlChar *value,
3196 xmlSchemaValPtr *val) {
3197 return(xmlSchemaValPredefTypeNode(type, value, val, NULL));
3198}
3199
3200/**
Daniel Veillard4255d502002-04-16 15:50:10 +00003201 * xmlSchemaCompareDecimals:
3202 * @x: a first decimal value
3203 * @y: a second decimal value
3204 *
3205 * Compare 2 decimals
3206 *
3207 * Returns -1 if x < y, 0 if x == y, 1 if x > y and -2 in case of error
3208 */
3209static int
3210xmlSchemaCompareDecimals(xmlSchemaValPtr x, xmlSchemaValPtr y)
3211{
3212 xmlSchemaValPtr swp;
William M. Brack273670f2005-03-11 15:55:14 +00003213 int order = 1, integx, integy, dlen;
3214 unsigned long hi, mi, lo;
Daniel Veillard4255d502002-04-16 15:50:10 +00003215
William M. Brack273670f2005-03-11 15:55:14 +00003216 /*
3217 * First test: If x is -ve and not zero
3218 */
Daniel Veillarde637c4a2003-03-30 21:10:09 +00003219 if ((x->value.decimal.sign) &&
3220 ((x->value.decimal.lo != 0) ||
3221 (x->value.decimal.mi != 0) ||
3222 (x->value.decimal.hi != 0))) {
William M. Brack273670f2005-03-11 15:55:14 +00003223 /*
3224 * Then if y is -ve and not zero reverse the compare
3225 */
Daniel Veillarde637c4a2003-03-30 21:10:09 +00003226 if ((y->value.decimal.sign) &&
3227 ((y->value.decimal.lo != 0) ||
3228 (y->value.decimal.mi != 0) ||
3229 (y->value.decimal.hi != 0)))
Daniel Veillard80b19092003-03-28 13:29:53 +00003230 order = -1;
William M. Brack273670f2005-03-11 15:55:14 +00003231 /*
3232 * Otherwise (y >= 0) we have the answer
3233 */
Daniel Veillard80b19092003-03-28 13:29:53 +00003234 else
3235 return (-1);
William M. Brack273670f2005-03-11 15:55:14 +00003236 /*
3237 * If x is not -ve and y is -ve we have the answer
3238 */
Daniel Veillarde637c4a2003-03-30 21:10:09 +00003239 } else if ((y->value.decimal.sign) &&
3240 ((y->value.decimal.lo != 0) ||
3241 (y->value.decimal.mi != 0) ||
3242 (y->value.decimal.hi != 0))) {
Daniel Veillard4255d502002-04-16 15:50:10 +00003243 return (1);
Daniel Veillard80b19092003-03-28 13:29:53 +00003244 }
William M. Brack273670f2005-03-11 15:55:14 +00003245 /*
3246 * If it's not simply determined by a difference in sign,
3247 * then we need to compare the actual values of the two nums.
3248 * To do this, we start by looking at the integral parts.
3249 * If the number of integral digits differ, then we have our
3250 * answer.
3251 */
3252 integx = x->value.decimal.total - x->value.decimal.frac;
3253 integy = y->value.decimal.total - y->value.decimal.frac;
3254 if (integx > integy)
3255 return order;
3256 else if (integy > integx)
3257 return -order;
3258 /*
3259 * If the number of integral digits is the same for both numbers,
3260 * then things get a little more complicated. We need to "normalize"
3261 * the numbers in order to properly compare them. To do this, we
3262 * look at the total length of each number (length => number of
3263 * significant digits), and divide the "shorter" by 10 (decreasing
3264 * the length) until they are of equal length.
3265 */
3266 dlen = x->value.decimal.total - y->value.decimal.total;
3267 if (dlen < 0) { /* y has more digits than x */
3268 swp = x;
3269 hi = y->value.decimal.hi;
3270 mi = y->value.decimal.mi;
3271 lo = y->value.decimal.lo;
3272 dlen = -dlen;
3273 order = -order;
3274 } else { /* x has more digits than y */
3275 swp = y;
3276 hi = x->value.decimal.hi;
3277 mi = x->value.decimal.mi;
3278 lo = x->value.decimal.lo;
Daniel Veillard4255d502002-04-16 15:50:10 +00003279 }
William M. Brack273670f2005-03-11 15:55:14 +00003280 while (dlen > 8) { /* in effect, right shift by 10**8 */
3281 lo = mi;
3282 mi = hi;
3283 hi = 0;
3284 dlen -= 8;
Daniel Veillard4255d502002-04-16 15:50:10 +00003285 }
William M. Brack273670f2005-03-11 15:55:14 +00003286 while (dlen > 0) {
3287 unsigned long rem1, rem2;
3288 rem1 = (hi % 10) * 100000000L;
3289 hi = hi / 10;
3290 rem2 = (mi % 10) * 100000000L;
3291 mi = (mi + rem1) / 10;
3292 lo = (lo + rem2) / 10;
3293 dlen--;
3294 }
3295 if (hi > swp->value.decimal.hi) {
3296 return order;
3297 } else if (hi == swp->value.decimal.hi) {
3298 if (mi > swp->value.decimal.mi) {
3299 return order;
3300 } else if (mi == swp->value.decimal.mi) {
3301 if (lo > swp->value.decimal.lo) {
3302 return order;
3303 } else if (lo == swp->value.decimal.lo) {
3304 if (x->value.decimal.total == y->value.decimal.total) {
3305 return 0;
3306 } else {
3307 return order;
3308 }
3309 }
3310 }
3311 }
3312 return -order;
Daniel Veillard4255d502002-04-16 15:50:10 +00003313}
3314
3315/**
Daniel Veillard070803b2002-05-03 07:29:38 +00003316 * xmlSchemaCompareDurations:
3317 * @x: a first duration value
3318 * @y: a second duration value
3319 *
3320 * Compare 2 durations
3321 *
3322 * Returns -1 if x < y, 0 if x == y, 1 if x > y, 2 if x <> y, and -2 in
3323 * case of error
3324 */
3325static int
3326xmlSchemaCompareDurations(xmlSchemaValPtr x, xmlSchemaValPtr y)
3327{
3328 long carry, mon, day;
3329 double sec;
Daniel Veillard80b19092003-03-28 13:29:53 +00003330 int invert = 1;
3331 long xmon, xday, myear, minday, maxday;
Daniel Veillard070803b2002-05-03 07:29:38 +00003332 static const long dayRange [2][12] = {
3333 { 0, 28, 59, 89, 120, 150, 181, 212, 242, 273, 303, 334, },
3334 { 0, 31, 62, 92, 123, 153, 184, 215, 245, 276, 306, 337} };
3335
3336 if ((x == NULL) || (y == NULL))
Daniel Veillard5a872412002-05-22 06:40:27 +00003337 return -2;
Daniel Veillard070803b2002-05-03 07:29:38 +00003338
3339 /* months */
3340 mon = x->value.dur.mon - y->value.dur.mon;
3341
3342 /* seconds */
3343 sec = x->value.dur.sec - y->value.dur.sec;
3344 carry = (long)sec / SECS_PER_DAY;
3345 sec -= (double)(carry * SECS_PER_DAY);
3346
3347 /* days */
3348 day = x->value.dur.day - y->value.dur.day + carry;
3349
3350 /* easy test */
3351 if (mon == 0) {
3352 if (day == 0)
3353 if (sec == 0.0)
3354 return 0;
3355 else if (sec < 0.0)
3356 return -1;
3357 else
3358 return 1;
3359 else if (day < 0)
3360 return -1;
3361 else
3362 return 1;
3363 }
3364
3365 if (mon > 0) {
3366 if ((day >= 0) && (sec >= 0.0))
3367 return 1;
3368 else {
3369 xmon = mon;
3370 xday = -day;
3371 }
3372 } else if ((day <= 0) && (sec <= 0.0)) {
3373 return -1;
3374 } else {
Daniel Veillard80b19092003-03-28 13:29:53 +00003375 invert = -1;
Daniel Veillard070803b2002-05-03 07:29:38 +00003376 xmon = -mon;
3377 xday = day;
3378 }
3379
3380 myear = xmon / 12;
Daniel Veillard80b19092003-03-28 13:29:53 +00003381 if (myear == 0) {
3382 minday = 0;
3383 maxday = 0;
3384 } else {
3385 maxday = 366 * ((myear + 3) / 4) +
3386 365 * ((myear - 1) % 4);
3387 minday = maxday - 1;
3388 }
3389
Daniel Veillard070803b2002-05-03 07:29:38 +00003390 xmon = xmon % 12;
3391 minday += dayRange[0][xmon];
3392 maxday += dayRange[1][xmon];
3393
Daniel Veillard80b19092003-03-28 13:29:53 +00003394 if ((maxday == minday) && (maxday == xday))
3395 return(0); /* can this really happen ? */
Daniel Veillard070803b2002-05-03 07:29:38 +00003396 if (maxday < xday)
Daniel Veillard80b19092003-03-28 13:29:53 +00003397 return(-invert);
3398 if (minday > xday)
3399 return(invert);
Daniel Veillard070803b2002-05-03 07:29:38 +00003400
3401 /* indeterminate */
Daniel Veillard5a872412002-05-22 06:40:27 +00003402 return 2;
3403}
3404
3405/*
3406 * macros for adding date/times and durations
3407 */
3408#define FQUOTIENT(a,b) (floor(((double)a/(double)b)))
3409#define MODULO(a,b) (a - FQUOTIENT(a,b) * b)
3410#define FQUOTIENT_RANGE(a,low,high) (FQUOTIENT((a-low),(high-low)))
3411#define MODULO_RANGE(a,low,high) ((MODULO((a-low),(high-low)))+low)
3412
3413/**
Daniel Veillard669adfc2004-05-29 20:12:46 +00003414 * xmlSchemaDupVal:
3415 * @v: the #xmlSchemaValPtr value to duplicate
3416 *
3417 * Makes a copy of @v. The calling program is responsible for freeing
3418 * the returned value.
3419 *
3420 * returns a pointer to a duplicated #xmlSchemaValPtr or NULL if error.
3421 */
3422static xmlSchemaValPtr
3423xmlSchemaDupVal (xmlSchemaValPtr v)
3424{
3425 xmlSchemaValPtr ret = xmlSchemaNewValue(v->type);
3426 if (ret == NULL)
3427 return NULL;
3428
3429 memcpy(ret, v, sizeof(xmlSchemaVal));
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003430 ret->next = NULL;
Daniel Veillard669adfc2004-05-29 20:12:46 +00003431 return ret;
3432}
3433
3434/**
Kasimier T. Buchcik285ebab2005-03-04 18:04:59 +00003435 * xmlSchemaCopyValue:
3436 * @val: the precomputed value to be copied
3437 *
3438 * Copies the precomputed value. This duplicates any string within.
3439 *
3440 * Returns the copy or NULL if a copy for a data-type is not implemented.
3441 */
3442xmlSchemaValPtr
3443xmlSchemaCopyValue(xmlSchemaValPtr val)
3444{
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003445 xmlSchemaValPtr ret = NULL, prev = NULL, cur;
Kasimier T. Buchcik285ebab2005-03-04 18:04:59 +00003446
Kasimier T. Buchcik285ebab2005-03-04 18:04:59 +00003447 /*
3448 * Copy the string values.
3449 */
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003450 while (val != NULL) {
3451 switch (val->type) {
3452 case XML_SCHEMAS_ANYTYPE:
3453 case XML_SCHEMAS_IDREFS:
3454 case XML_SCHEMAS_ENTITIES:
3455 case XML_SCHEMAS_NMTOKENS:
3456 xmlSchemaFreeValue(ret);
3457 return (NULL);
3458 case XML_SCHEMAS_ANYSIMPLETYPE:
3459 case XML_SCHEMAS_STRING:
3460 case XML_SCHEMAS_NORMSTRING:
3461 case XML_SCHEMAS_TOKEN:
3462 case XML_SCHEMAS_LANGUAGE:
3463 case XML_SCHEMAS_NAME:
3464 case XML_SCHEMAS_NCNAME:
3465 case XML_SCHEMAS_ID:
3466 case XML_SCHEMAS_IDREF:
3467 case XML_SCHEMAS_ENTITY:
3468 case XML_SCHEMAS_NMTOKEN:
3469 case XML_SCHEMAS_ANYURI:
3470 cur = xmlSchemaDupVal(val);
3471 if (val->value.str != NULL)
3472 cur->value.str = xmlStrdup(BAD_CAST val->value.str);
3473 break;
3474 case XML_SCHEMAS_QNAME:
3475 case XML_SCHEMAS_NOTATION:
3476 cur = xmlSchemaDupVal(val);
3477 if (val->value.qname.name != NULL)
3478 cur->value.qname.name =
Kasimier T. Buchcik285ebab2005-03-04 18:04:59 +00003479 xmlStrdup(BAD_CAST val->value.qname.name);
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003480 if (val->value.qname.uri != NULL)
3481 cur->value.qname.uri =
Kasimier T. Buchcik285ebab2005-03-04 18:04:59 +00003482 xmlStrdup(BAD_CAST val->value.qname.uri);
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003483 break;
3484 case XML_SCHEMAS_HEXBINARY:
3485 cur = xmlSchemaDupVal(val);
3486 if (val->value.hex.str != NULL)
3487 cur->value.hex.str = xmlStrdup(BAD_CAST val->value.hex.str);
3488 break;
3489 case XML_SCHEMAS_BASE64BINARY:
3490 cur = xmlSchemaDupVal(val);
3491 if (val->value.base64.str != NULL)
3492 cur->value.base64.str =
Kasimier T. Buchcik285ebab2005-03-04 18:04:59 +00003493 xmlStrdup(BAD_CAST val->value.base64.str);
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003494 break;
3495 default:
3496 cur = xmlSchemaDupVal(val);
3497 break;
3498 }
3499 if (ret == NULL)
3500 ret = cur;
3501 else
3502 prev->next = cur;
3503 prev = cur;
3504 val = val->next;
Kasimier T. Buchcik285ebab2005-03-04 18:04:59 +00003505 }
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00003506 return (ret);
Kasimier T. Buchcik285ebab2005-03-04 18:04:59 +00003507}
3508
3509/**
Daniel Veillard5a872412002-05-22 06:40:27 +00003510 * _xmlSchemaDateAdd:
3511 * @dt: an #xmlSchemaValPtr
3512 * @dur: an #xmlSchemaValPtr of type #XS_DURATION
3513 *
3514 * Compute a new date/time from @dt and @dur. This function assumes @dt
3515 * is either #XML_SCHEMAS_DATETIME, #XML_SCHEMAS_DATE, #XML_SCHEMAS_GYEARMONTH,
Daniel Veillard669adfc2004-05-29 20:12:46 +00003516 * or #XML_SCHEMAS_GYEAR. The returned #xmlSchemaVal is the same type as
3517 * @dt. The calling program is responsible for freeing the returned value.
Daniel Veillard5a872412002-05-22 06:40:27 +00003518 *
Daniel Veillard669adfc2004-05-29 20:12:46 +00003519 * Returns a pointer to a new #xmlSchemaVal or NULL if error.
Daniel Veillard5a872412002-05-22 06:40:27 +00003520 */
3521static xmlSchemaValPtr
3522_xmlSchemaDateAdd (xmlSchemaValPtr dt, xmlSchemaValPtr dur)
3523{
Daniel Veillard669adfc2004-05-29 20:12:46 +00003524 xmlSchemaValPtr ret, tmp;
Daniel Veillard5a872412002-05-22 06:40:27 +00003525 long carry, tempdays, temp;
3526 xmlSchemaValDatePtr r, d;
3527 xmlSchemaValDurationPtr u;
3528
3529 if ((dt == NULL) || (dur == NULL))
3530 return NULL;
3531
3532 ret = xmlSchemaNewValue(dt->type);
3533 if (ret == NULL)
3534 return NULL;
3535
Daniel Veillard669adfc2004-05-29 20:12:46 +00003536 /* make a copy so we don't alter the original value */
3537 tmp = xmlSchemaDupVal(dt);
3538 if (tmp == NULL) {
3539 xmlSchemaFreeValue(ret);
3540 return NULL;
3541 }
3542
Daniel Veillard5a872412002-05-22 06:40:27 +00003543 r = &(ret->value.date);
Daniel Veillard669adfc2004-05-29 20:12:46 +00003544 d = &(tmp->value.date);
Daniel Veillard5a872412002-05-22 06:40:27 +00003545 u = &(dur->value.dur);
3546
3547 /* normalization */
3548 if (d->mon == 0)
3549 d->mon = 1;
3550
3551 /* normalize for time zone offset */
3552 u->sec -= (d->tzo * 60);
3553 d->tzo = 0;
3554
3555 /* normalization */
3556 if (d->day == 0)
3557 d->day = 1;
3558
3559 /* month */
3560 carry = d->mon + u->mon;
Daniel Veillardebe25d42004-03-25 09:35:49 +00003561 r->mon = (unsigned int) MODULO_RANGE(carry, 1, 13);
3562 carry = (long) FQUOTIENT_RANGE(carry, 1, 13);
Daniel Veillard5a872412002-05-22 06:40:27 +00003563
3564 /* year (may be modified later) */
3565 r->year = d->year + carry;
3566 if (r->year == 0) {
3567 if (d->year > 0)
3568 r->year--;
3569 else
3570 r->year++;
3571 }
3572
3573 /* time zone */
3574 r->tzo = d->tzo;
3575 r->tz_flag = d->tz_flag;
3576
3577 /* seconds */
3578 r->sec = d->sec + u->sec;
Daniel Veillardebe25d42004-03-25 09:35:49 +00003579 carry = (long) FQUOTIENT((long)r->sec, 60);
Daniel Veillard5a872412002-05-22 06:40:27 +00003580 if (r->sec != 0.0) {
3581 r->sec = MODULO(r->sec, 60.0);
3582 }
3583
3584 /* minute */
3585 carry += d->min;
Daniel Veillardebe25d42004-03-25 09:35:49 +00003586 r->min = (unsigned int) MODULO(carry, 60);
3587 carry = (long) FQUOTIENT(carry, 60);
Daniel Veillard5a872412002-05-22 06:40:27 +00003588
3589 /* hours */
3590 carry += d->hour;
Daniel Veillardebe25d42004-03-25 09:35:49 +00003591 r->hour = (unsigned int) MODULO(carry, 24);
3592 carry = (long)FQUOTIENT(carry, 24);
Daniel Veillard5a872412002-05-22 06:40:27 +00003593
3594 /*
3595 * days
3596 * Note we use tempdays because the temporary values may need more
3597 * than 5 bits
3598 */
3599 if ((VALID_YEAR(r->year)) && (VALID_MONTH(r->mon)) &&
3600 (d->day > MAX_DAYINMONTH(r->year, r->mon)))
3601 tempdays = MAX_DAYINMONTH(r->year, r->mon);
3602 else if (d->day < 1)
3603 tempdays = 1;
3604 else
3605 tempdays = d->day;
3606
3607 tempdays += u->day + carry;
3608
3609 while (1) {
3610 if (tempdays < 1) {
Daniel Veillardebe25d42004-03-25 09:35:49 +00003611 long tmon = (long) MODULO_RANGE(r->mon-1, 1, 13);
3612 long tyr = r->year + (long)FQUOTIENT_RANGE(r->mon-1, 1, 13);
Daniel Veillard5a872412002-05-22 06:40:27 +00003613 if (tyr == 0)
3614 tyr--;
3615 tempdays += MAX_DAYINMONTH(tyr, tmon);
3616 carry = -1;
Daniel Veillardebe25d42004-03-25 09:35:49 +00003617 } else if (tempdays > (long) MAX_DAYINMONTH(r->year, r->mon)) {
Daniel Veillard5a872412002-05-22 06:40:27 +00003618 tempdays = tempdays - MAX_DAYINMONTH(r->year, r->mon);
3619 carry = 1;
3620 } else
3621 break;
3622
3623 temp = r->mon + carry;
Daniel Veillardebe25d42004-03-25 09:35:49 +00003624 r->mon = (unsigned int) MODULO_RANGE(temp, 1, 13);
3625 r->year = r->year + (unsigned int) FQUOTIENT_RANGE(temp, 1, 13);
Daniel Veillard5a872412002-05-22 06:40:27 +00003626 if (r->year == 0) {
3627 if (temp < 1)
3628 r->year--;
3629 else
3630 r->year++;
3631 }
3632 }
3633
3634 r->day = tempdays;
3635
3636 /*
3637 * adjust the date/time type to the date values
3638 */
3639 if (ret->type != XML_SCHEMAS_DATETIME) {
3640 if ((r->hour) || (r->min) || (r->sec))
3641 ret->type = XML_SCHEMAS_DATETIME;
3642 else if (ret->type != XML_SCHEMAS_DATE) {
3643 if ((r->mon != 1) && (r->day != 1))
3644 ret->type = XML_SCHEMAS_DATE;
3645 else if ((ret->type != XML_SCHEMAS_GYEARMONTH) && (r->mon != 1))
3646 ret->type = XML_SCHEMAS_GYEARMONTH;
3647 }
3648 }
3649
Daniel Veillard669adfc2004-05-29 20:12:46 +00003650 xmlSchemaFreeValue(tmp);
Daniel Veillard5a872412002-05-22 06:40:27 +00003651
Daniel Veillard5a872412002-05-22 06:40:27 +00003652 return ret;
3653}
3654
3655/**
3656 * xmlSchemaDateNormalize:
Daniel Veillard669adfc2004-05-29 20:12:46 +00003657 * @dt: an #xmlSchemaValPtr of a date/time type value.
3658 * @offset: number of seconds to adjust @dt by.
Daniel Veillard5a872412002-05-22 06:40:27 +00003659 *
Daniel Veillard669adfc2004-05-29 20:12:46 +00003660 * Normalize @dt to GMT time. The @offset parameter is subtracted from
3661 * the return value is a time-zone offset is present on @dt.
Daniel Veillard5a872412002-05-22 06:40:27 +00003662 *
Daniel Veillard669adfc2004-05-29 20:12:46 +00003663 * Returns a normalized copy of @dt or NULL if error.
Daniel Veillard5a872412002-05-22 06:40:27 +00003664 */
3665static xmlSchemaValPtr
3666xmlSchemaDateNormalize (xmlSchemaValPtr dt, double offset)
3667{
3668 xmlSchemaValPtr dur, ret;
3669
3670 if (dt == NULL)
3671 return NULL;
3672
3673 if (((dt->type != XML_SCHEMAS_TIME) &&
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00003674 (dt->type != XML_SCHEMAS_DATETIME) &&
3675 (dt->type != XML_SCHEMAS_DATE)) || (dt->value.date.tzo == 0))
Daniel Veillard5a872412002-05-22 06:40:27 +00003676 return xmlSchemaDupVal(dt);
3677
3678 dur = xmlSchemaNewValue(XML_SCHEMAS_DURATION);
3679 if (dur == NULL)
3680 return NULL;
3681
3682 dur->value.date.sec -= offset;
3683
3684 ret = _xmlSchemaDateAdd(dt, dur);
3685 if (ret == NULL)
3686 return NULL;
3687
3688 xmlSchemaFreeValue(dur);
3689
3690 /* ret->value.date.tzo = 0; */
3691 return ret;
3692}
3693
3694/**
3695 * _xmlSchemaDateCastYMToDays:
3696 * @dt: an #xmlSchemaValPtr
3697 *
3698 * Convert mon and year of @dt to total number of days. Take the
3699 * number of years since (or before) 1 AD and add the number of leap
3700 * years. This is a function because negative
3701 * years must be handled a little differently and there is no zero year.
3702 *
3703 * Returns number of days.
3704 */
3705static long
3706_xmlSchemaDateCastYMToDays (const xmlSchemaValPtr dt)
3707{
3708 long ret;
Daniel Veillard49e89632004-09-23 16:24:36 +00003709 int mon;
Daniel Veillard5a872412002-05-22 06:40:27 +00003710
Daniel Veillard49e89632004-09-23 16:24:36 +00003711 mon = dt->value.date.mon;
3712 if (mon <= 0) mon = 1; /* normalization */
3713
3714 if (dt->value.date.year <= 0)
Daniel Veillard5a872412002-05-22 06:40:27 +00003715 ret = (dt->value.date.year * 365) +
3716 (((dt->value.date.year+1)/4)-((dt->value.date.year+1)/100)+
3717 ((dt->value.date.year+1)/400)) +
Daniel Veillard49e89632004-09-23 16:24:36 +00003718 DAY_IN_YEAR(0, mon, dt->value.date.year);
Daniel Veillard5a872412002-05-22 06:40:27 +00003719 else
3720 ret = ((dt->value.date.year-1) * 365) +
3721 (((dt->value.date.year-1)/4)-((dt->value.date.year-1)/100)+
3722 ((dt->value.date.year-1)/400)) +
Daniel Veillard49e89632004-09-23 16:24:36 +00003723 DAY_IN_YEAR(0, mon, dt->value.date.year);
Daniel Veillard5a872412002-05-22 06:40:27 +00003724
3725 return ret;
3726}
3727
3728/**
3729 * TIME_TO_NUMBER:
3730 * @dt: an #xmlSchemaValPtr
3731 *
3732 * Calculates the number of seconds in the time portion of @dt.
3733 *
3734 * Returns seconds.
3735 */
3736#define TIME_TO_NUMBER(dt) \
3737 ((double)((dt->value.date.hour * SECS_PER_HOUR) + \
Daniel Veillardb3721c22003-03-31 11:22:25 +00003738 (dt->value.date.min * SECS_PER_MIN) + \
3739 (dt->value.date.tzo * SECS_PER_MIN)) + \
3740 dt->value.date.sec)
Daniel Veillard5a872412002-05-22 06:40:27 +00003741
3742/**
3743 * xmlSchemaCompareDates:
3744 * @x: a first date/time value
3745 * @y: a second date/time value
3746 *
3747 * Compare 2 date/times
3748 *
3749 * Returns -1 if x < y, 0 if x == y, 1 if x > y, 2 if x <> y, and -2 in
3750 * case of error
3751 */
3752static int
3753xmlSchemaCompareDates (xmlSchemaValPtr x, xmlSchemaValPtr y)
3754{
3755 unsigned char xmask, ymask, xor_mask, and_mask;
3756 xmlSchemaValPtr p1, p2, q1, q2;
3757 long p1d, p2d, q1d, q2d;
3758
3759 if ((x == NULL) || (y == NULL))
3760 return -2;
3761
3762 if (x->value.date.tz_flag) {
3763
3764 if (!y->value.date.tz_flag) {
3765 p1 = xmlSchemaDateNormalize(x, 0);
3766 p1d = _xmlSchemaDateCastYMToDays(p1) + p1->value.date.day;
3767 /* normalize y + 14:00 */
3768 q1 = xmlSchemaDateNormalize(y, (14 * SECS_PER_HOUR));
3769
3770 q1d = _xmlSchemaDateCastYMToDays(q1) + q1->value.date.day;
Daniel Veillardfdc91562002-07-01 21:52:03 +00003771 if (p1d < q1d) {
3772 xmlSchemaFreeValue(p1);
3773 xmlSchemaFreeValue(q1);
Daniel Veillard5a872412002-05-22 06:40:27 +00003774 return -1;
Daniel Veillardfdc91562002-07-01 21:52:03 +00003775 } else if (p1d == q1d) {
Daniel Veillard5a872412002-05-22 06:40:27 +00003776 double sec;
3777
3778 sec = TIME_TO_NUMBER(p1) - TIME_TO_NUMBER(q1);
Daniel Veillardfdc91562002-07-01 21:52:03 +00003779 if (sec < 0.0) {
3780 xmlSchemaFreeValue(p1);
3781 xmlSchemaFreeValue(q1);
Daniel Veillard5a872412002-05-22 06:40:27 +00003782 return -1;
Daniel Veillardfdc91562002-07-01 21:52:03 +00003783 } else {
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003784 int ret = 0;
Daniel Veillard5a872412002-05-22 06:40:27 +00003785 /* normalize y - 14:00 */
3786 q2 = xmlSchemaDateNormalize(y, -(14 * SECS_PER_HOUR));
3787 q2d = _xmlSchemaDateCastYMToDays(q2) + q2->value.date.day;
3788 if (p1d > q2d)
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003789 ret = 1;
Daniel Veillard5a872412002-05-22 06:40:27 +00003790 else if (p1d == q2d) {
3791 sec = TIME_TO_NUMBER(p1) - TIME_TO_NUMBER(q2);
3792 if (sec > 0.0)
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003793 ret = 1;
Daniel Veillard5a872412002-05-22 06:40:27 +00003794 else
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003795 ret = 2; /* indeterminate */
Daniel Veillard5a872412002-05-22 06:40:27 +00003796 }
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003797 xmlSchemaFreeValue(p1);
3798 xmlSchemaFreeValue(q1);
3799 xmlSchemaFreeValue(q2);
3800 if (ret != 0)
3801 return(ret);
Daniel Veillard5a872412002-05-22 06:40:27 +00003802 }
Daniel Veillardfdc91562002-07-01 21:52:03 +00003803 } else {
3804 xmlSchemaFreeValue(p1);
3805 xmlSchemaFreeValue(q1);
3806 }
Daniel Veillard5a872412002-05-22 06:40:27 +00003807 }
3808 } else if (y->value.date.tz_flag) {
3809 q1 = xmlSchemaDateNormalize(y, 0);
3810 q1d = _xmlSchemaDateCastYMToDays(q1) + q1->value.date.day;
3811
3812 /* normalize x - 14:00 */
3813 p1 = xmlSchemaDateNormalize(x, -(14 * SECS_PER_HOUR));
3814 p1d = _xmlSchemaDateCastYMToDays(p1) + p1->value.date.day;
3815
Daniel Veillardfdc91562002-07-01 21:52:03 +00003816 if (p1d < q1d) {
3817 xmlSchemaFreeValue(p1);
3818 xmlSchemaFreeValue(q1);
Daniel Veillard5a872412002-05-22 06:40:27 +00003819 return -1;
Daniel Veillardfdc91562002-07-01 21:52:03 +00003820 } else if (p1d == q1d) {
Daniel Veillard5a872412002-05-22 06:40:27 +00003821 double sec;
3822
3823 sec = TIME_TO_NUMBER(p1) - TIME_TO_NUMBER(q1);
Daniel Veillardfdc91562002-07-01 21:52:03 +00003824 if (sec < 0.0) {
3825 xmlSchemaFreeValue(p1);
3826 xmlSchemaFreeValue(q1);
Daniel Veillard5a872412002-05-22 06:40:27 +00003827 return -1;
Daniel Veillardfdc91562002-07-01 21:52:03 +00003828 } else {
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003829 int ret = 0;
Daniel Veillard5a872412002-05-22 06:40:27 +00003830 /* normalize x + 14:00 */
3831 p2 = xmlSchemaDateNormalize(x, (14 * SECS_PER_HOUR));
3832 p2d = _xmlSchemaDateCastYMToDays(p2) + p2->value.date.day;
3833
Daniel Veillard6560a422003-03-27 21:25:38 +00003834 if (p2d > q1d) {
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003835 ret = 1;
Daniel Veillard6560a422003-03-27 21:25:38 +00003836 } else if (p2d == q1d) {
Daniel Veillard5a872412002-05-22 06:40:27 +00003837 sec = TIME_TO_NUMBER(p2) - TIME_TO_NUMBER(q1);
3838 if (sec > 0.0)
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003839 ret = 1;
Daniel Veillard5a872412002-05-22 06:40:27 +00003840 else
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003841 ret = 2; /* indeterminate */
Daniel Veillard5a872412002-05-22 06:40:27 +00003842 }
Daniel Veillard6560a422003-03-27 21:25:38 +00003843 xmlSchemaFreeValue(p1);
3844 xmlSchemaFreeValue(q1);
3845 xmlSchemaFreeValue(p2);
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003846 if (ret != 0)
3847 return(ret);
Daniel Veillard5a872412002-05-22 06:40:27 +00003848 }
Daniel Veillardfdc91562002-07-01 21:52:03 +00003849 } else {
3850 xmlSchemaFreeValue(p1);
3851 xmlSchemaFreeValue(q1);
Daniel Veillard5a872412002-05-22 06:40:27 +00003852 }
3853 }
3854
3855 /*
3856 * if the same type then calculate the difference
3857 */
3858 if (x->type == y->type) {
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003859 int ret = 0;
Daniel Veillard5a872412002-05-22 06:40:27 +00003860 q1 = xmlSchemaDateNormalize(y, 0);
3861 q1d = _xmlSchemaDateCastYMToDays(q1) + q1->value.date.day;
3862
3863 p1 = xmlSchemaDateNormalize(x, 0);
3864 p1d = _xmlSchemaDateCastYMToDays(p1) + p1->value.date.day;
3865
Daniel Veillardfdc91562002-07-01 21:52:03 +00003866 if (p1d < q1d) {
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003867 ret = -1;
Daniel Veillardfdc91562002-07-01 21:52:03 +00003868 } else if (p1d > q1d) {
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003869 ret = 1;
Daniel Veillardfdc91562002-07-01 21:52:03 +00003870 } else {
Daniel Veillard5a872412002-05-22 06:40:27 +00003871 double sec;
3872
3873 sec = TIME_TO_NUMBER(p1) - TIME_TO_NUMBER(q1);
3874 if (sec < 0.0)
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003875 ret = -1;
Daniel Veillard5a872412002-05-22 06:40:27 +00003876 else if (sec > 0.0)
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003877 ret = 1;
Daniel Veillard5a872412002-05-22 06:40:27 +00003878
3879 }
Daniel Veillard4aede2e2003-10-17 12:43:59 +00003880 xmlSchemaFreeValue(p1);
3881 xmlSchemaFreeValue(q1);
3882 return(ret);
Daniel Veillard5a872412002-05-22 06:40:27 +00003883 }
3884
3885 switch (x->type) {
3886 case XML_SCHEMAS_DATETIME:
3887 xmask = 0xf;
3888 break;
3889 case XML_SCHEMAS_DATE:
3890 xmask = 0x7;
3891 break;
3892 case XML_SCHEMAS_GYEAR:
3893 xmask = 0x1;
3894 break;
3895 case XML_SCHEMAS_GMONTH:
3896 xmask = 0x2;
3897 break;
3898 case XML_SCHEMAS_GDAY:
3899 xmask = 0x3;
3900 break;
3901 case XML_SCHEMAS_GYEARMONTH:
3902 xmask = 0x3;
3903 break;
3904 case XML_SCHEMAS_GMONTHDAY:
3905 xmask = 0x6;
3906 break;
3907 case XML_SCHEMAS_TIME:
3908 xmask = 0x8;
3909 break;
3910 default:
3911 xmask = 0;
3912 break;
3913 }
3914
3915 switch (y->type) {
3916 case XML_SCHEMAS_DATETIME:
3917 ymask = 0xf;
3918 break;
3919 case XML_SCHEMAS_DATE:
3920 ymask = 0x7;
3921 break;
3922 case XML_SCHEMAS_GYEAR:
3923 ymask = 0x1;
3924 break;
3925 case XML_SCHEMAS_GMONTH:
3926 ymask = 0x2;
3927 break;
3928 case XML_SCHEMAS_GDAY:
3929 ymask = 0x3;
3930 break;
3931 case XML_SCHEMAS_GYEARMONTH:
3932 ymask = 0x3;
3933 break;
3934 case XML_SCHEMAS_GMONTHDAY:
3935 ymask = 0x6;
3936 break;
3937 case XML_SCHEMAS_TIME:
3938 ymask = 0x8;
3939 break;
3940 default:
3941 ymask = 0;
3942 break;
3943 }
3944
3945 xor_mask = xmask ^ ymask; /* mark type differences */
3946 and_mask = xmask & ymask; /* mark field specification */
3947
3948 /* year */
3949 if (xor_mask & 1)
3950 return 2; /* indeterminate */
3951 else if (and_mask & 1) {
3952 if (x->value.date.year < y->value.date.year)
3953 return -1;
3954 else if (x->value.date.year > y->value.date.year)
3955 return 1;
3956 }
3957
3958 /* month */
3959 if (xor_mask & 2)
3960 return 2; /* indeterminate */
3961 else if (and_mask & 2) {
3962 if (x->value.date.mon < y->value.date.mon)
3963 return -1;
3964 else if (x->value.date.mon > y->value.date.mon)
3965 return 1;
3966 }
3967
3968 /* day */
3969 if (xor_mask & 4)
3970 return 2; /* indeterminate */
3971 else if (and_mask & 4) {
3972 if (x->value.date.day < y->value.date.day)
3973 return -1;
3974 else if (x->value.date.day > y->value.date.day)
3975 return 1;
3976 }
3977
3978 /* time */
3979 if (xor_mask & 8)
3980 return 2; /* indeterminate */
3981 else if (and_mask & 8) {
3982 if (x->value.date.hour < y->value.date.hour)
3983 return -1;
3984 else if (x->value.date.hour > y->value.date.hour)
3985 return 1;
3986 else if (x->value.date.min < y->value.date.min)
3987 return -1;
3988 else if (x->value.date.min > y->value.date.min)
3989 return 1;
3990 else if (x->value.date.sec < y->value.date.sec)
3991 return -1;
3992 else if (x->value.date.sec > y->value.date.sec)
3993 return 1;
3994 }
3995
Daniel Veillard070803b2002-05-03 07:29:38 +00003996 return 0;
3997}
3998
3999/**
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004000 * xmlSchemaComparePreserveReplaceStrings:
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004001 * @x: a first string value
4002 * @y: a second string value
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004003 * @invert: inverts the result if x < y or x > y.
4004 *
4005 * Compare 2 string for their normalized values.
4006 * @x is a string with whitespace of "preserve", @y is
4007 * a string with a whitespace of "replace". I.e. @x could
4008 * be an "xsd:string" and @y an "xsd:normalizedString".
4009 *
4010 * Returns -1 if x < y, 0 if x == y, 1 if x > y, and -2 in
4011 * case of error
4012 */
4013static int
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004014xmlSchemaComparePreserveReplaceStrings(const xmlChar *x,
4015 const xmlChar *y,
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004016 int invert)
4017{
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004018 int tmp;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004019
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004020 while ((*x != 0) && (*y != 0)) {
4021 if (IS_WSP_REPLACE_CH(*y)) {
4022 if (! IS_WSP_SPACE_CH(*x)) {
4023 if ((*x - 0x20) < 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004024 if (invert)
4025 return(1);
4026 else
4027 return(-1);
4028 } else {
4029 if (invert)
4030 return(-1);
4031 else
4032 return(1);
4033 }
4034 }
4035 } else {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004036 tmp = *x - *y;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004037 if (tmp < 0) {
4038 if (invert)
4039 return(1);
4040 else
4041 return(-1);
4042 }
4043 if (tmp > 0) {
4044 if (invert)
4045 return(-1);
4046 else
4047 return(1);
4048 }
4049 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004050 x++;
4051 y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004052 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004053 if (*x != 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004054 if (invert)
4055 return(-1);
4056 else
4057 return(1);
4058 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004059 if (*y != 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004060 if (invert)
4061 return(1);
4062 else
4063 return(-1);
4064 }
4065 return(0);
4066}
4067
4068/**
4069 * xmlSchemaComparePreserveCollapseStrings:
4070 * @x: a first string value
4071 * @y: a second string value
4072 *
4073 * Compare 2 string for their normalized values.
4074 * @x is a string with whitespace of "preserve", @y is
4075 * a string with a whitespace of "collapse". I.e. @x could
4076 * be an "xsd:string" and @y an "xsd:normalizedString".
4077 *
4078 * Returns -1 if x < y, 0 if x == y, 1 if x > y, and -2 in
4079 * case of error
4080 */
4081static int
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004082xmlSchemaComparePreserveCollapseStrings(const xmlChar *x,
4083 const xmlChar *y,
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004084 int invert)
4085{
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004086 int tmp;
4087
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004088 /*
4089 * Skip leading blank chars of the collapsed string.
4090 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004091 while IS_WSP_BLANK_CH(*y)
4092 y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004093
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004094 while ((*x != 0) && (*y != 0)) {
4095 if IS_WSP_BLANK_CH(*y) {
4096 if (! IS_WSP_SPACE_CH(*x)) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004097 /*
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004098 * The yv character would have been replaced to 0x20.
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004099 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004100 if ((*x - 0x20) < 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004101 if (invert)
4102 return(1);
4103 else
4104 return(-1);
4105 } else {
4106 if (invert)
4107 return(-1);
4108 else
4109 return(1);
4110 }
4111 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004112 x++;
4113 y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004114 /*
4115 * Skip contiguous blank chars of the collapsed string.
4116 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004117 while IS_WSP_BLANK_CH(*y)
4118 y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004119 } else {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004120 tmp = *x++ - *y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004121 if (tmp < 0) {
4122 if (invert)
4123 return(1);
4124 else
4125 return(-1);
4126 }
4127 if (tmp > 0) {
4128 if (invert)
4129 return(-1);
4130 else
4131 return(1);
4132 }
4133 }
4134 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004135 if (*x != 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004136 if (invert)
4137 return(-1);
4138 else
4139 return(1);
4140 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004141 if (*y != 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004142 /*
4143 * Skip trailing blank chars of the collapsed string.
4144 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004145 while IS_WSP_BLANK_CH(*y)
4146 y++;
4147 if (*y != 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004148 if (invert)
4149 return(1);
4150 else
4151 return(-1);
4152 }
4153 }
4154 return(0);
4155}
4156
4157/**
4158 * xmlSchemaComparePreserveCollapseStrings:
4159 * @x: a first string value
4160 * @y: a second string value
4161 *
4162 * Compare 2 string for their normalized values.
4163 * @x is a string with whitespace of "preserve", @y is
4164 * a string with a whitespace of "collapse". I.e. @x could
4165 * be an "xsd:string" and @y an "xsd:normalizedString".
4166 *
4167 * Returns -1 if x < y, 0 if x == y, 1 if x > y, and -2 in
4168 * case of error
4169 */
4170static int
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004171xmlSchemaCompareReplaceCollapseStrings(const xmlChar *x,
4172 const xmlChar *y,
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004173 int invert)
4174{
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004175 int tmp;
4176
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004177 /*
4178 * Skip leading blank chars of the collapsed string.
4179 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004180 while IS_WSP_BLANK_CH(*y)
4181 y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004182
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004183 while ((*x != 0) && (*y != 0)) {
4184 if IS_WSP_BLANK_CH(*y) {
4185 if (! IS_WSP_BLANK_CH(*x)) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004186 /*
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004187 * The yv character would have been replaced to 0x20.
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004188 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004189 if ((*x - 0x20) < 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004190 if (invert)
4191 return(1);
4192 else
4193 return(-1);
4194 } else {
4195 if (invert)
4196 return(-1);
4197 else
4198 return(1);
4199 }
4200 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004201 x++;
4202 y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004203 /*
4204 * Skip contiguous blank chars of the collapsed string.
4205 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004206 while IS_WSP_BLANK_CH(*y)
4207 y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004208 } else {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004209 if IS_WSP_BLANK_CH(*x) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004210 /*
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004211 * The xv character would have been replaced to 0x20.
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004212 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004213 if ((0x20 - *y) < 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004214 if (invert)
4215 return(1);
4216 else
4217 return(-1);
4218 } else {
4219 if (invert)
4220 return(-1);
4221 else
4222 return(1);
4223 }
4224 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004225 tmp = *x++ - *y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004226 if (tmp < 0)
4227 return(-1);
4228 if (tmp > 0)
4229 return(1);
4230 }
4231 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004232 if (*x != 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004233 if (invert)
4234 return(-1);
4235 else
4236 return(1);
4237 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004238 if (*y != 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004239 /*
4240 * Skip trailing blank chars of the collapsed string.
4241 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004242 while IS_WSP_BLANK_CH(*y)
4243 y++;
4244 if (*y != 0) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004245 if (invert)
4246 return(1);
4247 else
4248 return(-1);
4249 }
4250 }
4251 return(0);
4252}
4253
4254
4255/**
4256 * xmlSchemaCompareReplacedStrings:
4257 * @x: a first string value
4258 * @y: a second string value
4259 *
4260 * Compare 2 string for their normalized values.
4261 *
4262 * Returns -1 if x < y, 0 if x == y, 1 if x > y, and -2 in
4263 * case of error
4264 */
4265static int
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004266xmlSchemaCompareReplacedStrings(const xmlChar *x,
4267 const xmlChar *y)
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004268{
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004269 int tmp;
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004270
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004271 while ((*x != 0) && (*y != 0)) {
4272 if IS_WSP_BLANK_CH(*y) {
4273 if (! IS_WSP_BLANK_CH(*x)) {
4274 if ((*x - 0x20) < 0)
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004275 return(-1);
4276 else
4277 return(1);
4278 }
4279 } else {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004280 if IS_WSP_BLANK_CH(*x) {
4281 if ((0x20 - *y) < 0)
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004282 return(-1);
4283 else
4284 return(1);
4285 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004286 tmp = *x - *y;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004287 if (tmp < 0)
4288 return(-1);
4289 if (tmp > 0)
4290 return(1);
4291 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004292 x++;
4293 y++;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004294 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004295 if (*x != 0)
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004296 return(1);
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004297 if (*y != 0)
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004298 return(-1);
4299 return(0);
4300}
4301
4302/**
Daniel Veillardc4c21552003-03-29 10:53:38 +00004303 * xmlSchemaCompareNormStrings:
4304 * @x: a first string value
4305 * @y: a second string value
4306 *
4307 * Compare 2 string for their normalized values.
4308 *
4309 * Returns -1 if x < y, 0 if x == y, 1 if x > y, and -2 in
4310 * case of error
4311 */
4312static int
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004313xmlSchemaCompareNormStrings(const xmlChar *x,
4314 const xmlChar *y) {
Daniel Veillardc4c21552003-03-29 10:53:38 +00004315 int tmp;
Daniel Veillardc4c21552003-03-29 10:53:38 +00004316
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004317 while (IS_BLANK_CH(*x)) x++;
4318 while (IS_BLANK_CH(*y)) y++;
4319 while ((*x != 0) && (*y != 0)) {
4320 if (IS_BLANK_CH(*x)) {
4321 if (!IS_BLANK_CH(*y)) {
4322 tmp = *x - *y;
Daniel Veillardc4c21552003-03-29 10:53:38 +00004323 return(tmp);
4324 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004325 while (IS_BLANK_CH(*x)) x++;
4326 while (IS_BLANK_CH(*y)) y++;
Daniel Veillardc4c21552003-03-29 10:53:38 +00004327 } else {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004328 tmp = *x++ - *y++;
Daniel Veillardc4c21552003-03-29 10:53:38 +00004329 if (tmp < 0)
4330 return(-1);
4331 if (tmp > 0)
4332 return(1);
4333 }
4334 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004335 if (*x != 0) {
4336 while (IS_BLANK_CH(*x)) x++;
4337 if (*x != 0)
Daniel Veillardc4c21552003-03-29 10:53:38 +00004338 return(1);
4339 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004340 if (*y != 0) {
4341 while (IS_BLANK_CH(*y)) y++;
4342 if (*y != 0)
Daniel Veillardc4c21552003-03-29 10:53:38 +00004343 return(-1);
4344 }
4345 return(0);
4346}
4347
4348/**
Daniel Veillardb6c7f412003-03-29 16:41:55 +00004349 * xmlSchemaCompareFloats:
4350 * @x: a first float or double value
4351 * @y: a second float or double value
4352 *
4353 * Compare 2 values
4354 *
4355 * Returns -1 if x < y, 0 if x == y, 1 if x > y, 2 if x <> y, and -2 in
4356 * case of error
4357 */
4358static int
4359xmlSchemaCompareFloats(xmlSchemaValPtr x, xmlSchemaValPtr y) {
4360 double d1, d2;
4361
4362 if ((x == NULL) || (y == NULL))
4363 return(-2);
4364
4365 /*
4366 * Cast everything to doubles.
4367 */
4368 if (x->type == XML_SCHEMAS_DOUBLE)
4369 d1 = x->value.d;
4370 else if (x->type == XML_SCHEMAS_FLOAT)
4371 d1 = x->value.f;
4372 else
4373 return(-2);
4374
4375 if (y->type == XML_SCHEMAS_DOUBLE)
4376 d2 = y->value.d;
4377 else if (y->type == XML_SCHEMAS_FLOAT)
4378 d2 = y->value.f;
4379 else
4380 return(-2);
4381
4382 /*
4383 * Check for special cases.
4384 */
4385 if (xmlXPathIsNaN(d1)) {
4386 if (xmlXPathIsNaN(d2))
4387 return(0);
4388 return(1);
4389 }
4390 if (xmlXPathIsNaN(d2))
4391 return(-1);
4392 if (d1 == xmlXPathPINF) {
4393 if (d2 == xmlXPathPINF)
4394 return(0);
4395 return(1);
4396 }
4397 if (d2 == xmlXPathPINF)
4398 return(-1);
4399 if (d1 == xmlXPathNINF) {
4400 if (d2 == xmlXPathNINF)
4401 return(0);
4402 return(-1);
4403 }
4404 if (d2 == xmlXPathNINF)
4405 return(1);
4406
4407 /*
4408 * basic tests, the last one we should have equality, but
4409 * portability is more important than speed and handling
4410 * NaN or Inf in a portable way is always a challenge, so ...
4411 */
4412 if (d1 < d2)
4413 return(-1);
4414 if (d1 > d2)
4415 return(1);
4416 if (d1 == d2)
4417 return(0);
4418 return(2);
4419}
4420
4421/**
Daniel Veillard4255d502002-04-16 15:50:10 +00004422 * xmlSchemaCompareValues:
4423 * @x: a first value
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004424 * @xvalue: the first value as a string (optional)
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004425 * @xwtsp: the whitespace type
Daniel Veillard4255d502002-04-16 15:50:10 +00004426 * @y: a second value
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004427 * @xvalue: the second value as a string (optional)
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004428 * @ywtsp: the whitespace type
Daniel Veillard4255d502002-04-16 15:50:10 +00004429 *
4430 * Compare 2 values
4431 *
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00004432 * Returns -1 if x < y, 0 if x == y, 1 if x > y, 2 if x <> y, 3 if not
4433 * comparable and -2 in case of error
Daniel Veillard4255d502002-04-16 15:50:10 +00004434 */
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004435static int
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004436xmlSchemaCompareValuesInternal(xmlSchemaValType xtype,
4437 xmlSchemaValPtr x,
4438 const xmlChar *xvalue,
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004439 xmlSchemaWhitespaceValueType xws,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004440 xmlSchemaValType ytype,
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004441 xmlSchemaValPtr y,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004442 const xmlChar *yvalue,
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004443 xmlSchemaWhitespaceValueType yws)
4444{
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004445 switch (xtype) {
Daniel Veillard80b19092003-03-28 13:29:53 +00004446 case XML_SCHEMAS_UNKNOWN:
William M. Brack2f2a6632004-08-20 23:09:47 +00004447 case XML_SCHEMAS_ANYTYPE:
Daniel Veillard80b19092003-03-28 13:29:53 +00004448 return(-2);
4449 case XML_SCHEMAS_INTEGER:
4450 case XML_SCHEMAS_NPINTEGER:
4451 case XML_SCHEMAS_NINTEGER:
4452 case XML_SCHEMAS_NNINTEGER:
4453 case XML_SCHEMAS_PINTEGER:
4454 case XML_SCHEMAS_INT:
4455 case XML_SCHEMAS_UINT:
4456 case XML_SCHEMAS_LONG:
4457 case XML_SCHEMAS_ULONG:
4458 case XML_SCHEMAS_SHORT:
4459 case XML_SCHEMAS_USHORT:
4460 case XML_SCHEMAS_BYTE:
4461 case XML_SCHEMAS_UBYTE:
Daniel Veillard4255d502002-04-16 15:50:10 +00004462 case XML_SCHEMAS_DECIMAL:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004463 if ((x == NULL) || (y == NULL))
4464 return(-2);
4465 if (ytype == xtype)
Daniel Veillard80b19092003-03-28 13:29:53 +00004466 return(xmlSchemaCompareDecimals(x, y));
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004467 if ((ytype == XML_SCHEMAS_DECIMAL) ||
4468 (ytype == XML_SCHEMAS_INTEGER) ||
4469 (ytype == XML_SCHEMAS_NPINTEGER) ||
4470 (ytype == XML_SCHEMAS_NINTEGER) ||
4471 (ytype == XML_SCHEMAS_NNINTEGER) ||
4472 (ytype == XML_SCHEMAS_PINTEGER) ||
4473 (ytype == XML_SCHEMAS_INT) ||
4474 (ytype == XML_SCHEMAS_UINT) ||
4475 (ytype == XML_SCHEMAS_LONG) ||
4476 (ytype == XML_SCHEMAS_ULONG) ||
4477 (ytype == XML_SCHEMAS_SHORT) ||
4478 (ytype == XML_SCHEMAS_USHORT) ||
4479 (ytype == XML_SCHEMAS_BYTE) ||
4480 (ytype == XML_SCHEMAS_UBYTE))
Daniel Veillard4255d502002-04-16 15:50:10 +00004481 return(xmlSchemaCompareDecimals(x, y));
Daniel Veillard5a872412002-05-22 06:40:27 +00004482 return(-2);
Daniel Veillard070803b2002-05-03 07:29:38 +00004483 case XML_SCHEMAS_DURATION:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004484 if ((x == NULL) || (y == NULL))
4485 return(-2);
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004486 if (ytype == XML_SCHEMAS_DURATION)
Daniel Veillard070803b2002-05-03 07:29:38 +00004487 return(xmlSchemaCompareDurations(x, y));
Daniel Veillard5a872412002-05-22 06:40:27 +00004488 return(-2);
4489 case XML_SCHEMAS_TIME:
4490 case XML_SCHEMAS_GDAY:
4491 case XML_SCHEMAS_GMONTH:
4492 case XML_SCHEMAS_GMONTHDAY:
4493 case XML_SCHEMAS_GYEAR:
4494 case XML_SCHEMAS_GYEARMONTH:
4495 case XML_SCHEMAS_DATE:
4496 case XML_SCHEMAS_DATETIME:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004497 if ((x == NULL) || (y == NULL))
4498 return(-2);
4499 if ((ytype == XML_SCHEMAS_DATETIME) ||
4500 (ytype == XML_SCHEMAS_TIME) ||
4501 (ytype == XML_SCHEMAS_GDAY) ||
4502 (ytype == XML_SCHEMAS_GMONTH) ||
4503 (ytype == XML_SCHEMAS_GMONTHDAY) ||
4504 (ytype == XML_SCHEMAS_GYEAR) ||
4505 (ytype == XML_SCHEMAS_DATE) ||
4506 (ytype == XML_SCHEMAS_GYEARMONTH))
Daniel Veillard5a872412002-05-22 06:40:27 +00004507 return (xmlSchemaCompareDates(x, y));
Daniel Veillard5a872412002-05-22 06:40:27 +00004508 return (-2);
Kasimier T. Buchcik2ee855d2005-03-07 11:14:14 +00004509 /*
4510 * Note that we will support comparison of string types against
4511 * anySimpleType as well.
4512 */
4513 case XML_SCHEMAS_ANYSIMPLETYPE:
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004514 case XML_SCHEMAS_STRING:
4515 case XML_SCHEMAS_NORMSTRING:
Daniel Veillard80b19092003-03-28 13:29:53 +00004516 case XML_SCHEMAS_TOKEN:
4517 case XML_SCHEMAS_LANGUAGE:
4518 case XML_SCHEMAS_NMTOKEN:
Daniel Veillard80b19092003-03-28 13:29:53 +00004519 case XML_SCHEMAS_NAME:
Daniel Veillard80b19092003-03-28 13:29:53 +00004520 case XML_SCHEMAS_NCNAME:
4521 case XML_SCHEMAS_ID:
4522 case XML_SCHEMAS_IDREF:
Daniel Veillard80b19092003-03-28 13:29:53 +00004523 case XML_SCHEMAS_ENTITY:
Daniel Veillard80b19092003-03-28 13:29:53 +00004524 case XML_SCHEMAS_ANYURI:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004525 {
4526 const xmlChar *xv, *yv;
4527
4528 if (x == NULL)
4529 xv = xvalue;
4530 else
4531 xv = x->value.str;
4532 if (y == NULL)
4533 yv = yvalue;
4534 else
4535 yv = y->value.str;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004536 /*
4537 * TODO: Compare those against QName.
4538 */
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004539 if (ytype == XML_SCHEMAS_QNAME) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004540 TODO
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004541 if (y == NULL)
4542 return(-2);
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004543 return (-2);
4544 }
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004545 if ((ytype == XML_SCHEMAS_ANYSIMPLETYPE) ||
4546 (ytype == XML_SCHEMAS_STRING) ||
4547 (ytype == XML_SCHEMAS_NORMSTRING) ||
4548 (ytype == XML_SCHEMAS_TOKEN) ||
4549 (ytype == XML_SCHEMAS_LANGUAGE) ||
4550 (ytype == XML_SCHEMAS_NMTOKEN) ||
4551 (ytype == XML_SCHEMAS_NAME) ||
4552 (ytype == XML_SCHEMAS_NCNAME) ||
4553 (ytype == XML_SCHEMAS_ID) ||
4554 (ytype == XML_SCHEMAS_IDREF) ||
4555 (ytype == XML_SCHEMAS_ENTITY) ||
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004556 (ytype == XML_SCHEMAS_ANYURI)) {
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004557
4558 if (xws == XML_SCHEMA_WHITESPACE_PRESERVE) {
4559
4560 if (yws == XML_SCHEMA_WHITESPACE_PRESERVE) {
4561 /* TODO: What about x < y or x > y. */
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004562 if (xmlStrEqual(xv, yv))
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004563 return (0);
4564 else
4565 return (2);
4566 } else if (yws == XML_SCHEMA_WHITESPACE_REPLACE)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004567 return (xmlSchemaComparePreserveReplaceStrings(xv, yv, 0));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004568 else if (yws == XML_SCHEMA_WHITESPACE_COLLAPSE)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004569 return (xmlSchemaComparePreserveCollapseStrings(xv, yv, 0));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004570
4571 } else if (xws == XML_SCHEMA_WHITESPACE_REPLACE) {
4572
4573 if (yws == XML_SCHEMA_WHITESPACE_PRESERVE)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004574 return (xmlSchemaComparePreserveReplaceStrings(yv, xv, 1));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004575 if (yws == XML_SCHEMA_WHITESPACE_REPLACE)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004576 return (xmlSchemaCompareReplacedStrings(xv, yv));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004577 if (yws == XML_SCHEMA_WHITESPACE_COLLAPSE)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004578 return (xmlSchemaCompareReplaceCollapseStrings(xv, yv, 0));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004579
4580 } else if (xws == XML_SCHEMA_WHITESPACE_COLLAPSE) {
4581
4582 if (yws == XML_SCHEMA_WHITESPACE_PRESERVE)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004583 return (xmlSchemaComparePreserveCollapseStrings(yv, xv, 1));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004584 if (yws == XML_SCHEMA_WHITESPACE_REPLACE)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004585 return (xmlSchemaCompareReplaceCollapseStrings(yv, xv, 1));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004586 if (yws == XML_SCHEMA_WHITESPACE_COLLAPSE)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004587 return (xmlSchemaCompareNormStrings(xv, yv));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004588 } else
4589 return (-2);
4590
4591 }
Daniel Veillardc4c21552003-03-29 10:53:38 +00004592 return (-2);
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004593 }
Daniel Veillarde637c4a2003-03-30 21:10:09 +00004594 case XML_SCHEMAS_QNAME:
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00004595 case XML_SCHEMAS_NOTATION:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004596 if ((x == NULL) || (y == NULL))
4597 return(-2);
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00004598 if ((ytype == XML_SCHEMAS_QNAME) ||
4599 (ytype == XML_SCHEMAS_NOTATION)) {
Daniel Veillarde637c4a2003-03-30 21:10:09 +00004600 if ((xmlStrEqual(x->value.qname.name, y->value.qname.name)) &&
4601 (xmlStrEqual(x->value.qname.uri, y->value.qname.uri)))
4602 return(0);
4603 return(2);
4604 }
4605 return (-2);
Daniel Veillardc4c21552003-03-29 10:53:38 +00004606 case XML_SCHEMAS_FLOAT:
4607 case XML_SCHEMAS_DOUBLE:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004608 if ((x == NULL) || (y == NULL))
4609 return(-2);
4610 if ((ytype == XML_SCHEMAS_FLOAT) ||
4611 (ytype == XML_SCHEMAS_DOUBLE))
Daniel Veillardb6c7f412003-03-29 16:41:55 +00004612 return (xmlSchemaCompareFloats(x, y));
4613 return (-2);
Daniel Veillardc4c21552003-03-29 10:53:38 +00004614 case XML_SCHEMAS_BOOLEAN:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004615 if ((x == NULL) || (y == NULL))
4616 return(-2);
4617 if (ytype == XML_SCHEMAS_BOOLEAN) {
Daniel Veillardb6c7f412003-03-29 16:41:55 +00004618 if (x->value.b == y->value.b)
4619 return(0);
4620 if (x->value.b == 0)
4621 return(-1);
4622 return(1);
4623 }
4624 return (-2);
Daniel Veillard560c2a42003-07-06 21:13:49 +00004625 case XML_SCHEMAS_HEXBINARY:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004626 if ((x == NULL) || (y == NULL))
4627 return(-2);
4628 if (ytype == XML_SCHEMAS_HEXBINARY) {
Daniel Veillard70bcb0e2003-08-08 14:00:28 +00004629 if (x->value.hex.total == y->value.hex.total) {
4630 int ret = xmlStrcmp(x->value.hex.str, y->value.hex.str);
4631 if (ret > 0)
4632 return(1);
4633 else if (ret == 0)
4634 return(0);
4635 }
4636 else if (x->value.hex.total > y->value.hex.total)
4637 return(1);
4638
4639 return(-1);
4640 }
Daniel Veillard560c2a42003-07-06 21:13:49 +00004641 return (-2);
Daniel Veillard1ac24d32003-08-27 14:15:15 +00004642 case XML_SCHEMAS_BASE64BINARY:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004643 if ((x == NULL) || (y == NULL))
4644 return(-2);
4645 if (ytype == XML_SCHEMAS_BASE64BINARY) {
Daniel Veillard1ac24d32003-08-27 14:15:15 +00004646 if (x->value.base64.total == y->value.base64.total) {
4647 int ret = xmlStrcmp(x->value.base64.str,
4648 y->value.base64.str);
4649 if (ret > 0)
4650 return(1);
4651 else if (ret == 0)
4652 return(0);
4653 }
4654 else if (x->value.base64.total > y->value.base64.total)
4655 return(1);
4656 else
4657 return(-1);
4658 }
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004659 return (-2);
Daniel Veillardc4c21552003-03-29 10:53:38 +00004660 case XML_SCHEMAS_IDREFS:
4661 case XML_SCHEMAS_ENTITIES:
4662 case XML_SCHEMAS_NMTOKENS:
4663 TODO
4664 break;
Daniel Veillard4255d502002-04-16 15:50:10 +00004665 }
Daniel Veillard5a872412002-05-22 06:40:27 +00004666 return -2;
Daniel Veillard4255d502002-04-16 15:50:10 +00004667}
4668
4669/**
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004670 * xmlSchemaCompareValues:
4671 * @x: a first value
4672 * @y: a second value
4673 *
4674 * Compare 2 values
4675 *
4676 * Returns -1 if x < y, 0 if x == y, 1 if x > y, 2 if x <> y, and -2 in
4677 * case of error
4678 */
4679int
4680xmlSchemaCompareValues(xmlSchemaValPtr x, xmlSchemaValPtr y) {
4681 xmlSchemaWhitespaceValueType xws, yws;
4682
Daniel Veillard5e094142005-02-18 19:36:12 +00004683 if ((x == NULL) || (y == NULL))
4684 return(-2);
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004685 if (x->type == XML_SCHEMAS_STRING)
4686 xws = XML_SCHEMA_WHITESPACE_PRESERVE;
4687 else if (x->type == XML_SCHEMAS_NORMSTRING)
4688 xws = XML_SCHEMA_WHITESPACE_REPLACE;
4689 else
4690 xws = XML_SCHEMA_WHITESPACE_COLLAPSE;
4691
4692 if (y->type == XML_SCHEMAS_STRING)
4693 yws = XML_SCHEMA_WHITESPACE_PRESERVE;
4694 else if (x->type == XML_SCHEMAS_NORMSTRING)
4695 yws = XML_SCHEMA_WHITESPACE_REPLACE;
4696 else
4697 yws = XML_SCHEMA_WHITESPACE_COLLAPSE;
4698
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004699 return(xmlSchemaCompareValuesInternal(x->type, x, NULL, xws, y->type,
4700 y, NULL, yws));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004701}
4702
4703/**
4704 * xmlSchemaCompareValuesWhtsp:
4705 * @x: a first value
4706 * @xws: the whitespace value of x
4707 * @y: a second value
4708 * @yws: the whitespace value of y
4709 *
4710 * Compare 2 values
4711 *
4712 * Returns -1 if x < y, 0 if x == y, 1 if x > y, 2 if x <> y, and -2 in
4713 * case of error
4714 */
4715int
4716xmlSchemaCompareValuesWhtsp(xmlSchemaValPtr x,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004717 xmlSchemaWhitespaceValueType xws,
4718 xmlSchemaValPtr y,
4719 xmlSchemaWhitespaceValueType yws)
4720{
Kasimier T. Buchcik9dbb0ce2005-03-16 16:39:23 +00004721 if ((x == NULL) || (y == NULL))
4722 return(-2);
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00004723 return(xmlSchemaCompareValuesInternal(x->type, x, NULL, xws, y->type,
4724 y, NULL, yws));
4725}
4726
4727/**
4728 * xmlSchemaCompareValuesWhtspExt:
4729 * @x: a first value
4730 * @xws: the whitespace value of x
4731 * @y: a second value
4732 * @yws: the whitespace value of y
4733 *
4734 * Compare 2 values
4735 *
4736 * Returns -1 if x < y, 0 if x == y, 1 if x > y, 2 if x <> y, and -2 in
4737 * case of error
4738 */
4739static int
4740xmlSchemaCompareValuesWhtspExt(xmlSchemaValType xtype,
4741 xmlSchemaValPtr x,
4742 const xmlChar *xvalue,
4743 xmlSchemaWhitespaceValueType xws,
4744 xmlSchemaValType ytype,
4745 xmlSchemaValPtr y,
4746 const xmlChar *yvalue,
4747 xmlSchemaWhitespaceValueType yws)
4748{
4749 return(xmlSchemaCompareValuesInternal(xtype, x, xvalue, xws, ytype, y,
4750 yvalue, yws));
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00004751}
4752
4753/**
Daniel Veillardc4c21552003-03-29 10:53:38 +00004754 * xmlSchemaNormLen:
4755 * @value: a string
4756 *
4757 * Computes the UTF8 length of the normalized value of the string
4758 *
4759 * Returns the length or -1 in case of error.
4760 */
4761static int
4762xmlSchemaNormLen(const xmlChar *value) {
4763 const xmlChar *utf;
4764 int ret = 0;
4765
4766 if (value == NULL)
4767 return(-1);
4768 utf = value;
William M. Brack76e95df2003-10-18 16:20:14 +00004769 while (IS_BLANK_CH(*utf)) utf++;
Daniel Veillardc4c21552003-03-29 10:53:38 +00004770 while (*utf != 0) {
4771 if (utf[0] & 0x80) {
4772 if ((utf[1] & 0xc0) != 0x80)
4773 return(-1);
4774 if ((utf[0] & 0xe0) == 0xe0) {
4775 if ((utf[2] & 0xc0) != 0x80)
4776 return(-1);
4777 if ((utf[0] & 0xf0) == 0xf0) {
4778 if ((utf[0] & 0xf8) != 0xf0 || (utf[3] & 0xc0) != 0x80)
4779 return(-1);
4780 utf += 4;
4781 } else {
4782 utf += 3;
4783 }
4784 } else {
4785 utf += 2;
4786 }
William M. Brack76e95df2003-10-18 16:20:14 +00004787 } else if (IS_BLANK_CH(*utf)) {
4788 while (IS_BLANK_CH(*utf)) utf++;
Daniel Veillardc4c21552003-03-29 10:53:38 +00004789 if (*utf == 0)
4790 break;
4791 } else {
4792 utf++;
4793 }
4794 ret++;
4795 }
4796 return(ret);
4797}
4798
Daniel Veillard6927b102004-10-27 17:29:04 +00004799/**
4800 * xmlSchemaGetFacetValueAsULong:
4801 * @facet: an schemas type facet
4802 *
4803 * Extract the value of a facet
4804 *
4805 * Returns the value as a long
4806 */
Daniel Veillardc0826a72004-08-10 14:17:33 +00004807unsigned long
4808xmlSchemaGetFacetValueAsULong(xmlSchemaFacetPtr facet)
4809{
4810 /*
4811 * TODO: Check if this is a decimal.
4812 */
William M. Brack094dd862004-11-14 14:28:34 +00004813 if (facet == NULL)
4814 return 0;
Daniel Veillardc0826a72004-08-10 14:17:33 +00004815 return ((unsigned long) facet->val->value.decimal.lo);
4816}
4817
Daniel Veillardc4c21552003-03-29 10:53:38 +00004818/**
Daniel Veillard01fa6152004-06-29 17:04:39 +00004819 * xmlSchemaValidateListSimpleTypeFacet:
4820 * @facet: the facet to check
4821 * @value: the lexical repr of the value to validate
4822 * @actualLen: the number of list items
4823 * @expectedLen: the resulting expected number of list items
4824 *
4825 * Checks the value of a list simple type against a facet.
4826 *
4827 * Returns 0 if the value is valid, a positive error code
4828 * number otherwise and -1 in case of an internal error.
4829 */
4830int
4831xmlSchemaValidateListSimpleTypeFacet(xmlSchemaFacetPtr facet,
4832 const xmlChar *value,
4833 unsigned long actualLen,
4834 unsigned long *expectedLen)
4835{
Daniel Veillardce682bc2004-11-05 17:22:25 +00004836 if (facet == NULL)
4837 return(-1);
Daniel Veillard01fa6152004-06-29 17:04:39 +00004838 /*
4839 * TODO: Check if this will work with large numbers.
4840 * (compare value.decimal.mi and value.decimal.hi as well?).
4841 */
4842 if (facet->type == XML_SCHEMA_FACET_LENGTH) {
4843 if (actualLen != facet->val->value.decimal.lo) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004844 if (expectedLen != NULL)
Daniel Veillardc0826a72004-08-10 14:17:33 +00004845 *expectedLen = facet->val->value.decimal.lo;
Daniel Veillard01fa6152004-06-29 17:04:39 +00004846 return (XML_SCHEMAV_CVC_LENGTH_VALID);
4847 }
4848 } else if (facet->type == XML_SCHEMA_FACET_MINLENGTH) {
4849 if (actualLen < facet->val->value.decimal.lo) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004850 if (expectedLen != NULL)
Daniel Veillardc0826a72004-08-10 14:17:33 +00004851 *expectedLen = facet->val->value.decimal.lo;
Daniel Veillard01fa6152004-06-29 17:04:39 +00004852 return (XML_SCHEMAV_CVC_MINLENGTH_VALID);
4853 }
4854 } else if (facet->type == XML_SCHEMA_FACET_MAXLENGTH) {
4855 if (actualLen > facet->val->value.decimal.lo) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004856 if (expectedLen != NULL)
Daniel Veillardc0826a72004-08-10 14:17:33 +00004857 *expectedLen = facet->val->value.decimal.lo;
Daniel Veillard01fa6152004-06-29 17:04:39 +00004858 return (XML_SCHEMAV_CVC_MAXLENGTH_VALID);
4859 }
4860 } else
4861 /*
4862 * NOTE: That we can pass NULL as xmlSchemaValPtr to
4863 * xmlSchemaValidateFacet, since the remaining facet types
4864 * are: XML_SCHEMA_FACET_PATTERN, XML_SCHEMA_FACET_ENUMERATION.
4865 */
4866 return(xmlSchemaValidateFacet(NULL, facet, value, NULL));
4867 return (0);
4868}
4869
4870/**
Daniel Veillard6927b102004-10-27 17:29:04 +00004871 * xmlSchemaValidateLengthFacet:
Daniel Veillardc0826a72004-08-10 14:17:33 +00004872 * @type: the built-in type
4873 * @facet: the facet to check
4874 * @value: the lexical repr. of the value to be validated
4875 * @val: the precomputed value
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004876 * @ws: the whitespace type of the value
4877 * @length: the actual length of the value
4878 *
4879 * Checka a value against a "length", "minLength" and "maxLength"
4880 * facet; sets @length to the computed length of @value.
4881 *
4882 * Returns 0 if the value is valid, a positive error code
4883 * otherwise and -1 in case of an internal or API error.
4884 */
4885static int
4886xmlSchemaValidateLengthFacetInternal(xmlSchemaFacetPtr facet,
4887 xmlSchemaTypeType valType,
4888 const xmlChar *value,
4889 xmlSchemaValPtr val,
4890 unsigned long *length,
4891 xmlSchemaWhitespaceValueType ws)
4892{
4893 unsigned int len = 0;
4894
4895 if ((length == NULL) || (facet == NULL))
4896 return (-1);
4897 *length = 0;
4898 if ((facet->type != XML_SCHEMA_FACET_LENGTH) &&
4899 (facet->type != XML_SCHEMA_FACET_MAXLENGTH) &&
4900 (facet->type != XML_SCHEMA_FACET_MINLENGTH))
4901 return (-1);
4902
4903 /*
4904 * TODO: length, maxLength and minLength must be of type
4905 * nonNegativeInteger only. Check if decimal is used somehow.
4906 */
4907 if ((facet->val == NULL) ||
4908 ((facet->val->type != XML_SCHEMAS_DECIMAL) &&
4909 (facet->val->type != XML_SCHEMAS_NNINTEGER)) ||
4910 (facet->val->value.decimal.frac != 0)) {
4911 return(-1);
4912 }
4913 if ((val != NULL) && (val->type == XML_SCHEMAS_HEXBINARY))
4914 len = val->value.hex.total;
4915 else if ((val != NULL) && (val->type == XML_SCHEMAS_BASE64BINARY))
4916 len = val->value.base64.total;
4917 else {
4918 switch (valType) {
4919 case XML_SCHEMAS_STRING:
4920 case XML_SCHEMAS_NORMSTRING:
4921 if (ws == XML_SCHEMA_WHITESPACE_UNKNOWN) {
4922 /*
4923 * This is to ensure API compatibility with the old
4924 * xmlSchemaValidateLengthFacet(). Anyway, this was and
4925 * is not the correct handling.
4926 * TODO: Get rid of this case somehow.
4927 */
4928 if (valType == XML_SCHEMAS_STRING)
4929 len = xmlUTF8Strlen(value);
4930 else
4931 len = xmlSchemaNormLen(value);
4932 } else if (value != NULL) {
4933 if (ws == XML_SCHEMA_WHITESPACE_COLLAPSE)
4934 len = xmlSchemaNormLen(value);
4935 else
4936 /*
4937 * Should be OK for "preserve" as well.
4938 */
4939 len = xmlUTF8Strlen(value);
4940 }
4941 break;
4942 case XML_SCHEMAS_IDREF:
4943 case XML_SCHEMAS_TOKEN:
4944 case XML_SCHEMAS_LANGUAGE:
4945 case XML_SCHEMAS_NMTOKEN:
4946 case XML_SCHEMAS_NAME:
4947 case XML_SCHEMAS_NCNAME:
Kasimier T. Buchcikbd6c3f72005-05-25 17:29:36 +00004948 case XML_SCHEMAS_ID:
4949 /*
4950 * FIXME: What exactly to do with anyURI?
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004951 */
4952 case XML_SCHEMAS_ANYURI:
4953 if (value != NULL)
4954 len = xmlSchemaNormLen(value);
4955 break;
Kasimier T. Buchcikbd6c3f72005-05-25 17:29:36 +00004956 case XML_SCHEMAS_QNAME:
4957 case XML_SCHEMAS_NOTATION:
4958 /*
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00004959 * For QName and NOTATION, those facets are
4960 * deprecated and should be ignored.
Kasimier T. Buchcikbd6c3f72005-05-25 17:29:36 +00004961 */
4962 return (0);
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00004963 default:
4964 TODO
4965 }
4966 }
4967 *length = (unsigned long) len;
4968 /*
4969 * TODO: Return the whole expected value, i.e. "lo", "mi" and "hi".
4970 */
4971 if (facet->type == XML_SCHEMA_FACET_LENGTH) {
4972 if (len != facet->val->value.decimal.lo)
4973 return(XML_SCHEMAV_CVC_LENGTH_VALID);
4974 } else if (facet->type == XML_SCHEMA_FACET_MINLENGTH) {
4975 if (len < facet->val->value.decimal.lo)
4976 return(XML_SCHEMAV_CVC_MINLENGTH_VALID);
4977 } else {
4978 if (len > facet->val->value.decimal.lo)
4979 return(XML_SCHEMAV_CVC_MAXLENGTH_VALID);
4980 }
4981
4982 return (0);
4983}
4984
4985/**
4986 * xmlSchemaValidateLengthFacet:
4987 * @type: the built-in type
4988 * @facet: the facet to check
4989 * @value: the lexical repr. of the value to be validated
4990 * @val: the precomputed value
Daniel Veillardc0826a72004-08-10 14:17:33 +00004991 * @length: the actual length of the value
4992 *
4993 * Checka a value against a "length", "minLength" and "maxLength"
4994 * facet; sets @length to the computed length of @value.
4995 *
4996 * Returns 0 if the value is valid, a positive error code
4997 * otherwise and -1 in case of an internal or API error.
4998 */
4999int
5000xmlSchemaValidateLengthFacet(xmlSchemaTypePtr type,
5001 xmlSchemaFacetPtr facet,
5002 const xmlChar *value,
5003 xmlSchemaValPtr val,
5004 unsigned long *length)
5005{
Daniel Veillardcc5e2332005-03-16 21:55:35 +00005006 if (type == NULL)
5007 return(-1);
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005008 return (xmlSchemaValidateLengthFacetInternal(facet,
5009 type->builtInType, value, val, length,
5010 XML_SCHEMA_WHITESPACE_UNKNOWN));
5011}
Daniel Veillardc0826a72004-08-10 14:17:33 +00005012
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005013/**
5014 * xmlSchemaValidateLengthFacetWhtsp:
5015 * @facet: the facet to check
5016 * @valType: the built-in type
5017 * @value: the lexical repr. of the value to be validated
5018 * @val: the precomputed value
5019 * @ws: the whitespace type of the value
5020 * @length: the actual length of the value
5021 *
5022 * Checka a value against a "length", "minLength" and "maxLength"
5023 * facet; sets @length to the computed length of @value.
5024 *
5025 * Returns 0 if the value is valid, a positive error code
5026 * otherwise and -1 in case of an internal or API error.
5027 */
5028int
5029xmlSchemaValidateLengthFacetWhtsp(xmlSchemaFacetPtr facet,
5030 xmlSchemaValType valType,
5031 const xmlChar *value,
5032 xmlSchemaValPtr val,
5033 unsigned long *length,
5034 xmlSchemaWhitespaceValueType ws)
5035{
5036 return (xmlSchemaValidateLengthFacetInternal(facet, valType, value, val,
5037 length, ws));
Daniel Veillardc0826a72004-08-10 14:17:33 +00005038}
5039
5040/**
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005041 * xmlSchemaValidateFacetInternal:
Daniel Veillard4255d502002-04-16 15:50:10 +00005042 * @facet: the facet to check
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005043 * @fws: the whitespace type of the facet's value
5044 * @valType: the built-in type of the value
Daniel Veillard4255d502002-04-16 15:50:10 +00005045 * @value: the lexical repr of the value to validate
5046 * @val: the precomputed value
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005047 * @ws: the whitespace type of the value
Daniel Veillard4255d502002-04-16 15:50:10 +00005048 *
5049 * Check a value against a facet condition
5050 *
5051 * Returns 0 if the element is schemas valid, a positive error code
5052 * number otherwise and -1 in case of internal or API error.
5053 */
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005054static int
5055xmlSchemaValidateFacetInternal(xmlSchemaFacetPtr facet,
5056 xmlSchemaWhitespaceValueType fws,
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005057 xmlSchemaValType valType,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005058 const xmlChar *value,
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005059 xmlSchemaValPtr val,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005060 xmlSchemaWhitespaceValueType ws)
Daniel Veillard4255d502002-04-16 15:50:10 +00005061{
5062 int ret;
5063
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005064 if (facet == NULL)
5065 return(-1);
5066
Daniel Veillard4255d502002-04-16 15:50:10 +00005067 switch (facet->type) {
5068 case XML_SCHEMA_FACET_PATTERN:
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005069 /*
5070 * NOTE that for patterns, the @value needs to be the normalized
5071 * value, *not* the lexical initial value or the canonical value.
5072 */
5073 if (value == NULL)
5074 return(-1);
Daniel Veillard4255d502002-04-16 15:50:10 +00005075 ret = xmlRegexpExec(facet->regexp, value);
5076 if (ret == 1)
5077 return(0);
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005078 if (ret == 0)
Daniel Veillard01fa6152004-06-29 17:04:39 +00005079 return(XML_SCHEMAV_CVC_PATTERN_VALID);
Daniel Veillard4255d502002-04-16 15:50:10 +00005080 return(ret);
5081 case XML_SCHEMA_FACET_MAXEXCLUSIVE:
5082 ret = xmlSchemaCompareValues(val, facet->val);
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005083 if (ret == -2)
Daniel Veillard4255d502002-04-16 15:50:10 +00005084 return(-1);
Daniel Veillard4255d502002-04-16 15:50:10 +00005085 if (ret == -1)
5086 return(0);
Daniel Veillard01fa6152004-06-29 17:04:39 +00005087 return(XML_SCHEMAV_CVC_MAXEXCLUSIVE_VALID);
Daniel Veillard070803b2002-05-03 07:29:38 +00005088 case XML_SCHEMA_FACET_MAXINCLUSIVE:
5089 ret = xmlSchemaCompareValues(val, facet->val);
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005090 if (ret == -2)
Daniel Veillard070803b2002-05-03 07:29:38 +00005091 return(-1);
Daniel Veillard070803b2002-05-03 07:29:38 +00005092 if ((ret == -1) || (ret == 0))
5093 return(0);
Daniel Veillard01fa6152004-06-29 17:04:39 +00005094 return(XML_SCHEMAV_CVC_MAXINCLUSIVE_VALID);
Daniel Veillard070803b2002-05-03 07:29:38 +00005095 case XML_SCHEMA_FACET_MINEXCLUSIVE:
5096 ret = xmlSchemaCompareValues(val, facet->val);
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005097 if (ret == -2)
Daniel Veillard070803b2002-05-03 07:29:38 +00005098 return(-1);
Daniel Veillard070803b2002-05-03 07:29:38 +00005099 if (ret == 1)
5100 return(0);
Daniel Veillard01fa6152004-06-29 17:04:39 +00005101 return(XML_SCHEMAV_CVC_MINEXCLUSIVE_VALID);
Daniel Veillard070803b2002-05-03 07:29:38 +00005102 case XML_SCHEMA_FACET_MININCLUSIVE:
5103 ret = xmlSchemaCompareValues(val, facet->val);
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005104 if (ret == -2)
Daniel Veillard070803b2002-05-03 07:29:38 +00005105 return(-1);
Daniel Veillard070803b2002-05-03 07:29:38 +00005106 if ((ret == 1) || (ret == 0))
5107 return(0);
Daniel Veillard01fa6152004-06-29 17:04:39 +00005108 return(XML_SCHEMAV_CVC_MININCLUSIVE_VALID);
Daniel Veillard8651f532002-04-17 09:06:27 +00005109 case XML_SCHEMA_FACET_WHITESPACE:
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005110 /* TODO whitespaces */
Daniel Veillard01fa6152004-06-29 17:04:39 +00005111 /*
5112 * NOTE: Whitespace should be handled to normalize
5113 * the value to be validated against a the facets;
5114 * not to normalize the value in-between.
5115 */
Daniel Veillard8651f532002-04-17 09:06:27 +00005116 return(0);
Daniel Veillard88c58912002-04-23 07:12:20 +00005117 case XML_SCHEMA_FACET_ENUMERATION:
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005118 if (ws == XML_SCHEMA_WHITESPACE_UNKNOWN) {
5119 /*
5120 * This is to ensure API compatibility with the old
5121 * xmlSchemaValidateFacet().
5122 * TODO: Get rid of this case.
5123 */
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005124 if ((facet->value != NULL) &&
5125 (xmlStrEqual(facet->value, value)))
5126 return(0);
5127 } else {
5128 ret = xmlSchemaCompareValuesWhtspExt(facet->val->type,
5129 facet->val, facet->value, fws, valType, val,
5130 value, ws);
5131 if (ret == -2)
5132 return(-1);
5133 if (ret == 0)
5134 return(0);
5135 }
Daniel Veillard01fa6152004-06-29 17:04:39 +00005136 return(XML_SCHEMAV_CVC_ENUMERATION_VALID);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005137 case XML_SCHEMA_FACET_LENGTH:
Kasimier T. Buchcikaba15f72005-04-01 15:17:27 +00005138 /*
5139 * SPEC (1.3) "if {primitive type definition} is QName or NOTATION,
5140 * then any {value} is facet-valid."
5141 */
5142 if ((valType == XML_SCHEMAS_QNAME) ||
5143 (valType == XML_SCHEMAS_NOTATION))
5144 return (0);
5145 /* No break on purpose. */
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005146 case XML_SCHEMA_FACET_MAXLENGTH:
5147 case XML_SCHEMA_FACET_MINLENGTH: {
5148 unsigned int len = 0;
5149
Kasimier T. Buchcik4efd90d2005-06-09 10:32:53 +00005150 if ((valType == XML_SCHEMAS_QNAME) ||
5151 (valType == XML_SCHEMAS_NOTATION))
5152 return (0);
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005153 /*
5154 * TODO: length, maxLength and minLength must be of type
5155 * nonNegativeInteger only. Check if decimal is used somehow.
5156 */
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005157 if ((facet->val == NULL) ||
Daniel Veillarde637c4a2003-03-30 21:10:09 +00005158 ((facet->val->type != XML_SCHEMAS_DECIMAL) &&
5159 (facet->val->type != XML_SCHEMAS_NNINTEGER)) ||
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005160 (facet->val->value.decimal.frac != 0)) {
5161 return(-1);
5162 }
Daniel Veillard560c2a42003-07-06 21:13:49 +00005163 if ((val != NULL) && (val->type == XML_SCHEMAS_HEXBINARY))
Daniel Veillard70bcb0e2003-08-08 14:00:28 +00005164 len = val->value.hex.total;
Daniel Veillard1ac24d32003-08-27 14:15:15 +00005165 else if ((val != NULL) && (val->type == XML_SCHEMAS_BASE64BINARY))
5166 len = val->value.base64.total;
5167 else {
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005168 switch (valType) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005169 case XML_SCHEMAS_STRING:
5170 case XML_SCHEMAS_NORMSTRING:
5171 if (ws == XML_SCHEMA_WHITESPACE_UNKNOWN) {
5172 /*
5173 * This is to ensure API compatibility with the old
5174 * xmlSchemaValidateFacet(). Anyway, this was and
5175 * is not the correct handling.
5176 * TODO: Get rid of this case somehow.
5177 */
5178 if (valType == XML_SCHEMAS_STRING)
5179 len = xmlUTF8Strlen(value);
5180 else
5181 len = xmlSchemaNormLen(value);
5182 } else if (value != NULL) {
5183 if (ws == XML_SCHEMA_WHITESPACE_COLLAPSE)
5184 len = xmlSchemaNormLen(value);
5185 else
5186 /*
5187 * Should be OK for "preserve" as well.
5188 */
5189 len = xmlUTF8Strlen(value);
5190 }
5191 break;
5192 case XML_SCHEMAS_IDREF:
Daniel Veillard560c2a42003-07-06 21:13:49 +00005193 case XML_SCHEMAS_TOKEN:
5194 case XML_SCHEMAS_LANGUAGE:
5195 case XML_SCHEMAS_NMTOKEN:
5196 case XML_SCHEMAS_NAME:
5197 case XML_SCHEMAS_NCNAME:
5198 case XML_SCHEMAS_ID:
Daniel Veillard01fa6152004-06-29 17:04:39 +00005199 case XML_SCHEMAS_ANYURI:
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005200 if (value != NULL)
5201 len = xmlSchemaNormLen(value);
5202 break;
Daniel Veillard560c2a42003-07-06 21:13:49 +00005203 default:
5204 TODO
Daniel Veillard70bcb0e2003-08-08 14:00:28 +00005205 }
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005206 }
5207 if (facet->type == XML_SCHEMA_FACET_LENGTH) {
Daniel Veillarde637c4a2003-03-30 21:10:09 +00005208 if (len != facet->val->value.decimal.lo)
Daniel Veillard01fa6152004-06-29 17:04:39 +00005209 return(XML_SCHEMAV_CVC_LENGTH_VALID);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005210 } else if (facet->type == XML_SCHEMA_FACET_MINLENGTH) {
Daniel Veillarde637c4a2003-03-30 21:10:09 +00005211 if (len < facet->val->value.decimal.lo)
Daniel Veillard01fa6152004-06-29 17:04:39 +00005212 return(XML_SCHEMAV_CVC_MINLENGTH_VALID);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005213 } else {
Daniel Veillarde637c4a2003-03-30 21:10:09 +00005214 if (len > facet->val->value.decimal.lo)
Daniel Veillard01fa6152004-06-29 17:04:39 +00005215 return(XML_SCHEMAV_CVC_MAXLENGTH_VALID);
Daniel Veillard8bc6cf92003-02-27 17:42:22 +00005216 }
5217 break;
5218 }
Daniel Veillard560c2a42003-07-06 21:13:49 +00005219 case XML_SCHEMA_FACET_TOTALDIGITS:
5220 case XML_SCHEMA_FACET_FRACTIONDIGITS:
5221
5222 if ((facet->val == NULL) ||
5223 ((facet->val->type != XML_SCHEMAS_DECIMAL) &&
5224 (facet->val->type != XML_SCHEMAS_NNINTEGER)) ||
5225 (facet->val->value.decimal.frac != 0)) {
5226 return(-1);
5227 }
5228 if ((val == NULL) ||
5229 ((val->type != XML_SCHEMAS_DECIMAL) &&
5230 (val->type != XML_SCHEMAS_INTEGER) &&
5231 (val->type != XML_SCHEMAS_NPINTEGER) &&
5232 (val->type != XML_SCHEMAS_NINTEGER) &&
5233 (val->type != XML_SCHEMAS_NNINTEGER) &&
5234 (val->type != XML_SCHEMAS_PINTEGER) &&
5235 (val->type != XML_SCHEMAS_INT) &&
5236 (val->type != XML_SCHEMAS_UINT) &&
5237 (val->type != XML_SCHEMAS_LONG) &&
5238 (val->type != XML_SCHEMAS_ULONG) &&
5239 (val->type != XML_SCHEMAS_SHORT) &&
5240 (val->type != XML_SCHEMAS_USHORT) &&
5241 (val->type != XML_SCHEMAS_BYTE) &&
5242 (val->type != XML_SCHEMAS_UBYTE))) {
5243 return(-1);
5244 }
5245 if (facet->type == XML_SCHEMA_FACET_TOTALDIGITS) {
5246 if (val->value.decimal.total > facet->val->value.decimal.lo)
Daniel Veillard01fa6152004-06-29 17:04:39 +00005247 return(XML_SCHEMAV_CVC_TOTALDIGITS_VALID);
Daniel Veillard560c2a42003-07-06 21:13:49 +00005248
5249 } else if (facet->type == XML_SCHEMA_FACET_FRACTIONDIGITS) {
5250 if (val->value.decimal.frac > facet->val->value.decimal.lo)
Daniel Veillard01fa6152004-06-29 17:04:39 +00005251 return(XML_SCHEMAV_CVC_FRACTIONDIGITS_VALID);
Daniel Veillard560c2a42003-07-06 21:13:49 +00005252 }
5253 break;
Daniel Veillard4255d502002-04-16 15:50:10 +00005254 default:
5255 TODO
5256 }
5257 return(0);
Daniel Veillardb6c7f412003-03-29 16:41:55 +00005258
Daniel Veillard4255d502002-04-16 15:50:10 +00005259}
5260
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005261/**
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005262 * xmlSchemaValidateFacet:
5263 * @base: the base type
5264 * @facet: the facet to check
5265 * @value: the lexical repr of the value to validate
5266 * @val: the precomputed value
5267 *
5268 * Check a value against a facet condition
5269 *
5270 * Returns 0 if the element is schemas valid, a positive error code
5271 * number otherwise and -1 in case of internal or API error.
5272 */
5273int
Kasimier T. Buchcik9dbb0ce2005-03-16 16:39:23 +00005274xmlSchemaValidateFacet(xmlSchemaTypePtr base,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005275 xmlSchemaFacetPtr facet,
5276 const xmlChar *value,
5277 xmlSchemaValPtr val)
5278{
5279 /*
5280 * This tries to ensure API compatibility regarding the old
5281 * xmlSchemaValidateFacet() and the new xmlSchemaValidateFacetInternal() and
5282 * xmlSchemaValidateFacetWhtsp().
5283 */
Kasimier T. Buchcik9dbb0ce2005-03-16 16:39:23 +00005284 if (val != NULL)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005285 return(xmlSchemaValidateFacetInternal(facet,
Kasimier T. Buchcik9dbb0ce2005-03-16 16:39:23 +00005286 XML_SCHEMA_WHITESPACE_UNKNOWN, val->type, value, val,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005287 XML_SCHEMA_WHITESPACE_UNKNOWN));
Kasimier T. Buchcik9dbb0ce2005-03-16 16:39:23 +00005288 else if (base != NULL)
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005289 return(xmlSchemaValidateFacetInternal(facet,
Kasimier T. Buchcik9dbb0ce2005-03-16 16:39:23 +00005290 XML_SCHEMA_WHITESPACE_UNKNOWN, base->builtInType, value, val,
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005291 XML_SCHEMA_WHITESPACE_UNKNOWN));
Kasimier T. Buchcik9dbb0ce2005-03-16 16:39:23 +00005292 return(-1);
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005293}
5294
5295/**
5296 * xmlSchemaValidateFacetWhtsp:
5297 * @facet: the facet to check
5298 * @fws: the whitespace type of the facet's value
5299 * @valType: the built-in type of the value
5300 * @value: the lexical (or normalized for pattern) repr of the value to validate
5301 * @val: the precomputed value
5302 * @ws: the whitespace type of the value
5303 *
5304 * Check a value against a facet condition. This takes value normalization
5305 * according to the specified whitespace types into account.
5306 * Note that @value needs to be the *normalized* value if the facet
5307 * is of type "pattern".
5308 *
5309 * Returns 0 if the element is schemas valid, a positive error code
5310 * number otherwise and -1 in case of internal or API error.
5311 */
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005312int
5313xmlSchemaValidateFacetWhtsp(xmlSchemaFacetPtr facet,
5314 xmlSchemaWhitespaceValueType fws,
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005315 xmlSchemaValType valType,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005316 const xmlChar *value,
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005317 xmlSchemaValPtr val,
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005318 xmlSchemaWhitespaceValueType ws)
5319{
5320 return(xmlSchemaValidateFacetInternal(facet, fws, valType,
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005321 value, val, ws));
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005322}
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005323
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005324#if 0
5325#ifndef DBL_DIG
5326#define DBL_DIG 16
5327#endif
5328#ifndef DBL_EPSILON
5329#define DBL_EPSILON 1E-9
5330#endif
5331
5332#define INTEGER_DIGITS DBL_DIG
5333#define FRACTION_DIGITS (DBL_DIG + 1)
5334#define EXPONENT_DIGITS (3 + 2)
5335
5336/**
5337 * xmlXPathFormatNumber:
5338 * @number: number to format
5339 * @buffer: output buffer
5340 * @buffersize: size of output buffer
5341 *
5342 * Convert the number into a string representation.
5343 */
5344static void
5345xmlSchemaFormatFloat(double number, char buffer[], int buffersize)
5346{
5347 switch (xmlXPathIsInf(number)) {
5348 case 1:
5349 if (buffersize > (int)sizeof("INF"))
5350 snprintf(buffer, buffersize, "INF");
5351 break;
5352 case -1:
5353 if (buffersize > (int)sizeof("-INF"))
5354 snprintf(buffer, buffersize, "-INF");
5355 break;
5356 default:
5357 if (xmlXPathIsNaN(number)) {
5358 if (buffersize > (int)sizeof("NaN"))
5359 snprintf(buffer, buffersize, "NaN");
5360 } else if (number == 0) {
5361 snprintf(buffer, buffersize, "0.0E0");
5362 } else {
5363 /* 3 is sign, decimal point, and terminating zero */
5364 char work[DBL_DIG + EXPONENT_DIGITS + 3];
5365 int integer_place, fraction_place;
5366 char *ptr;
5367 char *after_fraction;
5368 double absolute_value;
5369 int size;
5370
5371 absolute_value = fabs(number);
5372
5373 /*
5374 * Result is in work, and after_fraction points
5375 * just past the fractional part.
5376 * Use scientific notation
5377 */
5378 integer_place = DBL_DIG + EXPONENT_DIGITS + 1;
5379 fraction_place = DBL_DIG - 1;
5380 snprintf(work, sizeof(work),"%*.*e",
5381 integer_place, fraction_place, number);
5382 after_fraction = strchr(work + DBL_DIG, 'e');
5383 /* Remove fractional trailing zeroes */
5384 ptr = after_fraction;
5385 while (*(--ptr) == '0')
5386 ;
5387 if (*ptr != '.')
5388 ptr++;
5389 while ((*ptr++ = *after_fraction++) != 0);
5390
5391 /* Finally copy result back to caller */
5392 size = strlen(work) + 1;
5393 if (size > buffersize) {
5394 work[buffersize - 1] = 0;
5395 size = buffersize;
5396 }
5397 memmove(buffer, work, size);
5398 }
5399 break;
5400 }
5401}
5402#endif
5403
Kasimier T. Buchcik6c81d0e2005-03-15 14:58:11 +00005404/**
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005405 * xmlSchemaGetCanonValue:
5406 * @val: the precomputed value
5407 * @retValue: the returned value
5408 *
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005409 * Get a the cononical lexical representation of the value.
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005410 * The caller has to FREE the returned retValue.
5411 *
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005412 * WARNING: Some value types are not supported yet, resulting
5413 * in a @retValue of "???".
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005414 *
5415 * TODO: XML Schema 1.0 does not define canonical representations
5416 * for: duration, gYearMonth, gYear, gMonthDay, gMonth, gDay,
5417 * anyURI, QName, NOTATION. This will be fixed in XML Schema 1.1.
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005418 *
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005419 *
5420 * Returns 0 if the value could be built, 1 if the value type is
5421 * not supported yet and -1 in case of API errors.
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005422 */
5423int
Daniel Veillardb5839c32005-02-19 18:27:14 +00005424xmlSchemaGetCanonValue(xmlSchemaValPtr val, const xmlChar **retValue)
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005425{
Daniel Veillardb5839c32005-02-19 18:27:14 +00005426 if ((retValue == NULL) || (val == NULL))
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005427 return (-1);
5428 *retValue = NULL;
5429 switch (val->type) {
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005430 case XML_SCHEMAS_STRING:
5431 if (val->value.str == NULL)
5432 *retValue = BAD_CAST xmlStrdup(BAD_CAST "");
5433 else
5434 *retValue =
5435 BAD_CAST xmlStrdup((const xmlChar *) val->value.str);
5436 break;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005437 case XML_SCHEMAS_NORMSTRING:
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005438 if (val->value.str == NULL)
5439 *retValue = BAD_CAST xmlStrdup(BAD_CAST "");
5440 else {
5441 *retValue = xmlSchemaWhiteSpaceReplace(
5442 (const xmlChar *) val->value.str);
5443 if ((*retValue) == NULL)
5444 *retValue = BAD_CAST xmlStrdup(
5445 (const xmlChar *) val->value.str);
5446 }
5447 break;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005448 case XML_SCHEMAS_TOKEN:
5449 case XML_SCHEMAS_LANGUAGE:
5450 case XML_SCHEMAS_NMTOKEN:
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005451 case XML_SCHEMAS_NAME:
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005452 case XML_SCHEMAS_NCNAME:
5453 case XML_SCHEMAS_ID:
5454 case XML_SCHEMAS_IDREF:
5455 case XML_SCHEMAS_ENTITY:
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005456 case XML_SCHEMAS_NOTATION: /* Unclear */
5457 case XML_SCHEMAS_ANYURI: /* Unclear */
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005458 if (val->value.str == NULL)
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005459 return (-1);
Kasimier T. Buchcikaba15f72005-04-01 15:17:27 +00005460 *retValue =
5461 BAD_CAST xmlSchemaCollapseString(BAD_CAST val->value.str);
5462 if (*retValue == NULL)
5463 *retValue =
5464 BAD_CAST xmlStrdup((const xmlChar *) val->value.str);
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005465 break;
5466 case XML_SCHEMAS_QNAME:
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005467 /* TODO: Unclear in XML Schema 1.0. */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005468 if (val->value.qname.uri == NULL) {
5469 *retValue = BAD_CAST xmlStrdup(BAD_CAST val->value.qname.name);
5470 return (0);
5471 } else {
5472 *retValue = BAD_CAST xmlStrdup(BAD_CAST "{");
5473 *retValue = BAD_CAST xmlStrcat((xmlChar *) (*retValue),
5474 BAD_CAST val->value.qname.uri);
5475 *retValue = BAD_CAST xmlStrcat((xmlChar *) (*retValue),
5476 BAD_CAST "}");
5477 *retValue = BAD_CAST xmlStrcat((xmlChar *) (*retValue),
5478 BAD_CAST val->value.qname.uri);
5479 }
5480 break;
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005481 case XML_SCHEMAS_DECIMAL:
5482 /*
5483 * TODO: Lookout for a more simple implementation.
5484 */
5485 if ((val->value.decimal.total == 1) &&
5486 (val->value.decimal.lo == 0)) {
5487 *retValue = xmlStrdup(BAD_CAST "0.0");
5488 } else {
5489 xmlSchemaValDecimal dec = val->value.decimal;
5490 int bufsize;
5491 char *buf = NULL, *offs;
5492
5493 /* Add room for the decimal point as well. */
5494 bufsize = dec.total + 2;
5495 if (dec.sign)
5496 bufsize++;
5497 /* Add room for leading/trailing zero. */
5498 if ((dec.frac == 0) || (dec.frac == dec.total))
5499 bufsize++;
5500 buf = xmlMalloc(bufsize);
5501 offs = buf;
5502 if (dec.sign)
5503 *offs++ = '-';
5504 if (dec.frac == dec.total) {
5505 *offs++ = '0';
5506 *offs++ = '.';
5507 }
5508 if (dec.hi != 0)
5509 snprintf(offs, bufsize - (offs - buf),
5510 "%lu%lu%lu", dec.hi, dec.mi, dec.lo);
5511 else if (dec.mi != 0)
5512 snprintf(offs, bufsize - (offs - buf),
5513 "%lu%lu", dec.mi, dec.lo);
5514 else
5515 snprintf(offs, bufsize - (offs - buf),
5516 "%lu", dec.lo);
5517
5518 if (dec.frac != 0) {
5519 if (dec.frac != dec.total) {
5520 int diff = dec.total - dec.frac;
5521 /*
5522 * Insert the decimal point.
5523 */
5524 memmove(offs + diff + 1, offs + diff, dec.frac +1);
5525 offs[diff] = '.';
5526 } else {
5527 unsigned int i = 0;
5528 /*
5529 * Insert missing zeroes behind the decimal point.
5530 */
5531 while (*(offs + i) != 0)
5532 i++;
5533 if (i < dec.total) {
5534 memmove(offs + (dec.total - i), offs, i +1);
5535 memset(offs, '0', dec.total - i);
5536 }
5537 }
5538 } else {
5539 /*
5540 * Append decimal point and zero.
5541 */
5542 offs = buf + bufsize - 1;
5543 *offs-- = 0;
5544 *offs-- = '0';
5545 *offs-- = '.';
5546 }
5547 *retValue = BAD_CAST buf;
5548 }
5549 break;
5550 case XML_SCHEMAS_INTEGER:
5551 case XML_SCHEMAS_PINTEGER:
5552 case XML_SCHEMAS_NPINTEGER:
5553 case XML_SCHEMAS_NINTEGER:
5554 case XML_SCHEMAS_NNINTEGER:
5555 case XML_SCHEMAS_LONG:
5556 case XML_SCHEMAS_BYTE:
5557 case XML_SCHEMAS_SHORT:
5558 case XML_SCHEMAS_INT:
5559 case XML_SCHEMAS_UINT:
5560 case XML_SCHEMAS_ULONG:
5561 case XML_SCHEMAS_USHORT:
5562 case XML_SCHEMAS_UBYTE:
5563 if ((val->value.decimal.total == 1) &&
5564 (val->value.decimal.lo == 0))
5565 *retValue = xmlStrdup(BAD_CAST "0");
5566 else {
5567 xmlSchemaValDecimal dec = val->value.decimal;
5568 int bufsize = dec.total + 1;
5569
5570 /* Add room for the decimal point as well. */
5571 if (dec.sign)
5572 bufsize++;
5573 *retValue = xmlMalloc(bufsize);
5574 if (dec.hi != 0) {
5575 if (dec.sign)
5576 snprintf((char *) *retValue, bufsize,
5577 "-%lu%lu%lu", dec.hi, dec.mi, dec.lo);
5578 else
5579 snprintf((char *) *retValue, bufsize,
5580 "%lu%lu%lu", dec.hi, dec.mi, dec.lo);
5581 } else if (dec.mi != 0) {
5582 if (dec.sign)
5583 snprintf((char *) *retValue, bufsize,
5584 "-%lu%lu", dec.mi, dec.lo);
5585 else
5586 snprintf((char *) *retValue, bufsize,
5587 "%lu%lu", dec.mi, dec.lo);
5588 } else {
5589 if (dec.sign)
5590 snprintf((char *) *retValue, bufsize, "-%lu", dec.lo);
5591 else
5592 snprintf((char *) *retValue, bufsize, "%lu", dec.lo);
5593 }
5594 }
5595 break;
5596 case XML_SCHEMAS_BOOLEAN:
5597 if (val->value.b)
5598 *retValue = BAD_CAST xmlStrdup(BAD_CAST "true");
5599 else
5600 *retValue = BAD_CAST xmlStrdup(BAD_CAST "false");
5601 break;
5602 case XML_SCHEMAS_DURATION: {
5603 char buf[100];
5604 unsigned long year;
5605 unsigned long mon, day, hour = 0, min = 0;
5606 double sec = 0, left;
5607
5608 /* TODO: Unclear in XML Schema 1.0 */
5609 /*
5610 * TODO: This results in a normalized output of the value
5611 * - which is NOT conformant to the spec -
5612 * since the exact values of each property are not
5613 * recoverable. Think about extending the structure to
5614 * provide a field for every property.
5615 */
5616 year = (unsigned long) FQUOTIENT(labs(val->value.dur.mon), 12);
5617 mon = labs(val->value.dur.mon) - 12 * year;
5618
5619 day = (unsigned long) FQUOTIENT(fabs(val->value.dur.sec), 86400);
5620 left = fabs(val->value.dur.sec) - day * 86400;
5621 if (left > 0) {
5622 hour = (unsigned long) FQUOTIENT(left, 3600);
5623 left = left - (hour * 3600);
5624 if (left > 0) {
5625 min = (unsigned long) FQUOTIENT(left, 60);
5626 sec = left - (min * 60);
5627 }
5628 }
5629 if ((val->value.dur.mon < 0) || (val->value.dur.sec < 0))
5630 snprintf(buf, 100, "P%luY%luM%luDT%luH%luM%.14gS",
5631 year, mon, day, hour, min, sec);
5632 else
5633 snprintf(buf, 100, "-P%luY%luM%luDT%luH%luM%.14gS",
5634 year, mon, day, hour, min, sec);
5635 *retValue = BAD_CAST xmlStrdup(BAD_CAST buf);
5636 }
5637 break;
5638 case XML_SCHEMAS_GYEAR: {
5639 char buf[30];
5640 /* TODO: Unclear in XML Schema 1.0 */
5641 /* TODO: What to do with the timezone? */
5642 snprintf(buf, 30, "%04ld", val->value.date.year);
5643 *retValue = BAD_CAST xmlStrdup(BAD_CAST buf);
5644 }
5645 break;
5646 case XML_SCHEMAS_GMONTH: {
5647 /* TODO: Unclear in XML Schema 1.0 */
5648 /* TODO: What to do with the timezone? */
5649 *retValue = xmlMalloc(5);
5650 snprintf((char *) *retValue, 6, "--%02u",
5651 val->value.date.mon);
5652 }
5653 break;
5654 case XML_SCHEMAS_GDAY: {
5655 /* TODO: Unclear in XML Schema 1.0 */
5656 /* TODO: What to do with the timezone? */
5657 *retValue = xmlMalloc(6);
5658 snprintf((char *) *retValue, 6, "---%02u",
5659 val->value.date.day);
5660 }
5661 break;
5662 case XML_SCHEMAS_GMONTHDAY: {
5663 /* TODO: Unclear in XML Schema 1.0 */
5664 /* TODO: What to do with the timezone? */
5665 *retValue = xmlMalloc(8);
5666 snprintf((char *) *retValue, 8, "--%02u-%02u",
5667 val->value.date.mon, val->value.date.day);
5668 }
5669 break;
5670 case XML_SCHEMAS_GYEARMONTH: {
5671 char buf[35];
5672 /* TODO: Unclear in XML Schema 1.0 */
5673 /* TODO: What to do with the timezone? */
5674 if (val->value.date.year < 0)
5675 snprintf(buf, 35, "-%04ld-%02u",
5676 labs(val->value.date.year),
5677 val->value.date.mon);
5678 else
5679 snprintf(buf, 35, "%04ld-%02u",
5680 val->value.date.year, val->value.date.mon);
5681 *retValue = BAD_CAST xmlStrdup(BAD_CAST buf);
5682 }
5683 break;
5684 case XML_SCHEMAS_TIME:
5685 {
5686 char buf[30];
5687
5688 if (val->value.date.tz_flag) {
5689 xmlSchemaValPtr norm;
5690
5691 norm = xmlSchemaDateNormalize(val, 0);
5692 if (norm == NULL)
5693 return (-1);
5694 /*
5695 * TODO: Check if "%.14g" is portable.
5696 */
5697 snprintf(buf, 30,
5698 "%02u:%02u:%02.14gZ",
5699 norm->value.date.hour,
5700 norm->value.date.min,
5701 norm->value.date.sec);
5702 xmlSchemaFreeValue(norm);
5703 } else {
5704 snprintf(buf, 30,
5705 "%02u:%02u:%02.14g",
5706 val->value.date.hour,
5707 val->value.date.min,
5708 val->value.date.sec);
5709 }
5710 *retValue = BAD_CAST xmlStrdup(BAD_CAST buf);
5711 }
5712 break;
5713 case XML_SCHEMAS_DATE:
5714 {
5715 char buf[30];
5716
5717 if (val->value.date.tz_flag) {
5718 xmlSchemaValPtr norm;
5719
5720 norm = xmlSchemaDateNormalize(val, 0);
5721 if (norm == NULL)
5722 return (-1);
5723 /*
5724 * TODO: Append the canonical value of the
5725 * recoverable timezone and not "Z".
5726 */
5727 snprintf(buf, 30,
5728 "%04ld:%02u:%02uZ",
5729 norm->value.date.year, norm->value.date.mon,
5730 norm->value.date.day);
5731 xmlSchemaFreeValue(norm);
5732 } else {
5733 snprintf(buf, 30,
5734 "%04ld:%02u:%02u",
5735 val->value.date.year, val->value.date.mon,
5736 val->value.date.day);
5737 }
5738 *retValue = BAD_CAST xmlStrdup(BAD_CAST buf);
5739 }
5740 break;
5741 case XML_SCHEMAS_DATETIME:
5742 {
5743 char buf[50];
5744
5745 if (val->value.date.tz_flag) {
5746 xmlSchemaValPtr norm;
5747
5748 norm = xmlSchemaDateNormalize(val, 0);
5749 if (norm == NULL)
5750 return (-1);
5751 /*
5752 * TODO: Check if "%.14g" is portable.
5753 */
5754 snprintf(buf, 50,
5755 "%04ld:%02u:%02uT%02u:%02u:%02.14gZ",
5756 norm->value.date.year, norm->value.date.mon,
5757 norm->value.date.day, norm->value.date.hour,
5758 norm->value.date.min, norm->value.date.sec);
5759 xmlSchemaFreeValue(norm);
5760 } else {
5761 snprintf(buf, 50,
5762 "%04ld:%02u:%02uT%02u:%02u:%02.14g",
5763 val->value.date.year, val->value.date.mon,
5764 val->value.date.day, val->value.date.hour,
5765 val->value.date.min, val->value.date.sec);
5766 }
5767 *retValue = BAD_CAST xmlStrdup(BAD_CAST buf);
5768 }
5769 break;
5770 case XML_SCHEMAS_HEXBINARY:
5771 *retValue = BAD_CAST xmlStrdup(BAD_CAST val->value.hex.str);
5772 break;
5773 case XML_SCHEMAS_BASE64BINARY:
5774 /*
5775 * TODO: Is the following spec piece implemented?:
5776 * SPEC: "Note: For some values the canonical form defined
5777 * above does not conform to [RFC 2045], which requires breaking
5778 * with linefeeds at appropriate intervals."
5779 */
5780 *retValue = BAD_CAST xmlStrdup(BAD_CAST val->value.base64.str);
5781 break;
5782 case XML_SCHEMAS_FLOAT: {
5783 char buf[30];
5784 /*
5785 * |m| < 16777216, -149 <= e <= 104.
5786 * TODO: Handle, NaN, INF, -INF. The format is not
5787 * yet conformant. The c type float does not cover
5788 * the whole range.
5789 */
5790 snprintf(buf, 30, "%01.14e", val->value.f);
5791 *retValue = BAD_CAST xmlStrdup(BAD_CAST buf);
5792 }
5793 break;
5794 case XML_SCHEMAS_DOUBLE: {
5795 char buf[40];
5796 /* |m| < 9007199254740992, -1075 <= e <= 970 */
5797 /*
5798 * TODO: Handle, NaN, INF, -INF. The format is not
5799 * yet conformant. The c type float does not cover
5800 * the whole range.
5801 */
5802 snprintf(buf, 40, "%01.14e", val->value.d);
5803 *retValue = BAD_CAST xmlStrdup(BAD_CAST buf);
5804 }
5805 break;
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005806 default:
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005807 *retValue = BAD_CAST xmlStrdup(BAD_CAST "???");
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005808 return (1);
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005809 }
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005810 return (0);
5811}
5812
Daniel Veillardbda59572005-04-01 17:15:17 +00005813/**
Kasimier T. Buchcikc872afb2005-04-18 10:57:04 +00005814 * xmlSchemaGetCanonValueWhtsp:
5815 * @val: the precomputed value
5816 * @retValue: the returned value
5817 * @ws: the whitespace type of the value
5818 *
5819 * Get a the cononical representation of the value.
5820 * The caller has to free the returned @retValue.
5821 *
5822 * Returns 0 if the value could be built, 1 if the value type is
5823 * not supported yet and -1 in case of API errors.
5824 */
5825int
5826xmlSchemaGetCanonValueWhtsp(xmlSchemaValPtr val,
5827 const xmlChar **retValue,
5828 xmlSchemaWhitespaceValueType ws)
5829{
5830 if ((retValue == NULL) || (val == NULL))
5831 return (-1);
5832 if ((ws == XML_SCHEMA_WHITESPACE_UNKNOWN) ||
5833 (ws > XML_SCHEMA_WHITESPACE_COLLAPSE))
5834 return (-1);
5835
5836 *retValue = NULL;
5837 switch (val->type) {
5838 case XML_SCHEMAS_STRING:
5839 if (val->value.str == NULL)
5840 *retValue = BAD_CAST xmlStrdup(BAD_CAST "");
5841 else if (ws == XML_SCHEMA_WHITESPACE_COLLAPSE)
5842 *retValue = xmlSchemaCollapseString(val->value.str);
5843 else if (ws == XML_SCHEMA_WHITESPACE_REPLACE)
5844 *retValue = xmlSchemaWhiteSpaceReplace(val->value.str);
5845 if ((*retValue) == NULL)
5846 *retValue = BAD_CAST xmlStrdup(val->value.str);
5847 break;
5848 case XML_SCHEMAS_NORMSTRING:
5849 if (val->value.str == NULL)
5850 *retValue = BAD_CAST xmlStrdup(BAD_CAST "");
5851 else {
5852 if (ws == XML_SCHEMA_WHITESPACE_COLLAPSE)
5853 *retValue = xmlSchemaCollapseString(val->value.str);
5854 else
5855 *retValue = xmlSchemaWhiteSpaceReplace(val->value.str);
5856 if ((*retValue) == NULL)
5857 *retValue = BAD_CAST xmlStrdup(val->value.str);
5858 }
5859 break;
5860 default:
5861 return (xmlSchemaGetCanonValue(val, retValue));
5862 }
5863 return (0);
5864}
5865
5866/**
Daniel Veillardbda59572005-04-01 17:15:17 +00005867 * xmlSchemaGetValType:
5868 * @val: a schemas value
5869 *
5870 * Accessor for the type of a value
5871 *
5872 * Returns the xmlSchemaValType of the value
5873 */
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005874xmlSchemaValType
5875xmlSchemaGetValType(xmlSchemaValPtr val)
5876{
Daniel Veillardbda59572005-04-01 17:15:17 +00005877 if (val == NULL)
5878 return(XML_SCHEMAS_UNKNOWN);
Kasimier T. Buchcik478d6932005-03-16 16:29:18 +00005879 return (val->type);
Kasimier T. Buchcik6e224f12005-02-17 11:10:44 +00005880}
5881
Daniel Veillard5d4644e2005-04-01 13:11:58 +00005882#define bottom_xmlschemastypes
5883#include "elfgcchack.h"
Daniel Veillard4255d502002-04-16 15:50:10 +00005884#endif /* LIBXML_SCHEMAS_ENABLED */