libxslt/pattern.c

   1 /*
   2  * pattern.c: Implemetation of the template match compilation and lookup
   3  *
   4  * Reference:
   5  *   http://www.w3.org/TR/1999/REC-xslt-19991116
   6  *
   7  * See Copyright for the status of this software.
   8  *
   9  * daniel@veillard.com
  10  */
  11
  12 /*
  13  * TODO: handle pathological cases like *[*[@a="b"]]
  14  * TODO: detect [number] at compilation, optimize accordingly
  15  */
  16
  17 #define IN_LIBXSLT
  18 #include "libxslt.h"
  19
  20 #include <string.h>
  21
  22 #include <libxml/xmlmemory.h>
  23 #include <libxml/tree.h>
  24 #include <libxml/valid.h>
  25 #include <libxml/hash.h>
  26 #include <libxml/xmlerror.h>
  27 #include <libxml/parserInternals.h>
  28 #include "xslt.h"
  29 #include "xsltInternals.h"
  30 #include "xsltutils.h"
  31 #include "imports.h"
  32 #include "templates.h"
  33 #include "keys.h"
  34 #include "pattern.h"
  35
  36 #ifdef WITH_XSLT_DEBUG
  37 #define WITH_XSLT_DEBUG_PATTERN
  38 #endif
  39
  40 /*
  41  * Types are private:
  42  */
  43
  44 typedef enum {
  45     XSLT_OP_END=0,
  46     XSLT_OP_ROOT,
  47     XSLT_OP_ELEM,
  48     XSLT_OP_CHILD,
  49     XSLT_OP_ATTR,
  50     XSLT_OP_PARENT,
  51     XSLT_OP_ANCESTOR,
  52     XSLT_OP_ID,
  53     XSLT_OP_KEY,
  54     XSLT_OP_NS,
  55     XSLT_OP_ALL,
  56     XSLT_OP_PI,
  57     XSLT_OP_COMMENT,
  58     XSLT_OP_TEXT,
  59     XSLT_OP_NODE,
  60     XSLT_OP_PREDICATE
  61 } xsltOp;
  62
  63
  64 typedef struct _xsltStepOp xsltStepOp;
  65 typedef xsltStepOp *xsltStepOpPtr;
  66 struct _xsltStepOp {
  67     xsltOp op;
  68     xmlChar *value;
  69     xmlChar *value2;
  70     xmlChar *value3;
  71     xmlXPathCompExprPtr comp;
  72     /*
  73      * Optimisations for count
  74      */
  75     int        previousExtra;
  76     int        indexExtra;
  77     int        lenExtra;
  78 };
  79
  80 struct _xsltCompMatch {
  81     struct _xsltCompMatch *next; /* siblings in the name hash */
  82     float priority;              /* the priority */
  83     const xmlChar *pattern;       /* the pattern */
  84     const xmlChar *mode;         /* the mode */
  85     const xmlChar *modeURI;      /* the mode URI */
  86     xsltTemplatePtr template;    /* the associated template */
  87
  88     /* TODO fix the statically allocated size steps[] */
  89     int nbStep;
  90     int maxStep;
  91     xmlNsPtr *nsList;           /* the namespaces in scope */
  92     int nsNr;                   /* the number of namespaces in scope */
  93     xsltStepOp steps[40];        /* ops for computation */
  94 };
  95
  96 typedef struct _xsltParserContext xsltParserContext;
  97 typedef xsltParserContext *xsltParserContextPtr;
  98 struct _xsltParserContext {
  99     xsltStylesheetPtr style;            /* the stylesheet */
 100     xsltTransformContextPtr ctxt;       /* the transformation or NULL */
 101     const xmlChar *cur;                 /* the current char being parsed */
 102     const xmlChar *base;                /* the full expression */
 103     xmlDocPtr      doc;                 /* the source document */
 104     xmlNodePtr    elem;                 /* the source element */
 105     int error;                          /* error code */
 106     xsltCompMatchPtr comp;              /* the result */
 107 };
 108
 109 /************************************************************************
 110  *                                                                      *
 111  *                      Type functions                                  *
 112  *                                                                      *
 113  ************************************************************************/
 114
 115 /**
 116  * xsltNewCompMatch:
 117  *
 118  * Create a new XSLT CompMatch
 119  *
 120  * Returns the newly allocated xsltCompMatchPtr or NULL in case of error
 121  */
 122 static xsltCompMatchPtr
 123 xsltNewCompMatch(void) {
 124     xsltCompMatchPtr cur;
 125
 126     cur = (xsltCompMatchPtr) xmlMalloc(sizeof(xsltCompMatch));
 127     if (cur == NULL) {
 128         xsltTransformError(NULL, NULL, NULL,
 129                 "xsltNewCompMatch : malloc failed\n");
 130         return(NULL);
 131     }
 132     memset(cur, 0, sizeof(xsltCompMatch));
 133     cur->maxStep = 40;
 134     cur->nsNr = 0;
 135     cur->nsList = NULL;
 136     return(cur);
 137 }
 138
 139 /**
 140  * xsltFreeCompMatch:
 141  * @comp:  an XSLT comp
 142  *
 143  * Free up the memory allocated by @comp
 144  */
 145 static void
 146 xsltFreeCompMatch(xsltCompMatchPtr comp) {
 147     xsltStepOpPtr op;
 148     int i;
 149
 150     if (comp == NULL)
 151         return;
 152     if (comp->pattern != NULL)
 153         xmlFree((xmlChar *)comp->pattern);
 154     if (comp->mode != NULL)
 155         xmlFree((xmlChar *)comp->mode);
 156     if (comp->modeURI != NULL)
 157         xmlFree((xmlChar *)comp->modeURI);
 158     if (comp->nsList != NULL)
 159         xmlFree(comp->nsList);
 160     for (i = 0;i < comp->nbStep;i++) {
 161         op = &comp->steps[i];
 162         if (op->value != NULL)
 163             xmlFree(op->value);
 164         if (op->value2 != NULL)
 165             xmlFree(op->value2);
 166         if (op->value3 != NULL)
 167             xmlFree(op->value3);
 168         if (op->comp != NULL)
 169             xmlXPathFreeCompExpr(op->comp);
 170     }
 171     memset(comp, -1, sizeof(xsltCompMatch));
 172     xmlFree(comp);
 173 }
 174
 175 /**
 176  * xsltFreeCompMatchList:
 177  * @comp:  an XSLT comp list
 178  *
 179  * Free up the memory allocated by all the elements of @comp
 180  */
 181 void
 182 xsltFreeCompMatchList(xsltCompMatchPtr comp) {
 183     xsltCompMatchPtr cur;
 184
 185     while (comp != NULL) {
 186         cur = comp;
 187         comp = comp->next;
 188         xsltFreeCompMatch(cur);
 189     }
 190 }
 191
 192 /**
 193  * xsltNormalizeCompSteps:
 194  * @payload: pointer to template hash table entry
 195  * @data: pointer to the stylesheet
 196  * @name: template match name
 197  *
 198  * This is a hashtable scanner function to normalize the compiled
 199  * steps of an imported stylesheet.
 200  */
 201 void xsltNormalizeCompSteps(void *payload,
 202         void *data, const xmlChar *name ATTRIBUTE_UNUSED) {
 203     xsltCompMatchPtr comp = payload;
 204     xsltStylesheetPtr style = data;
 205     int ix;
 206
 207     for (ix = 0; ix < comp->nbStep; ix++) {
 208         comp->steps[ix].previousExtra += style->extrasNr;
 209         comp->steps[ix].indexExtra += style->extrasNr;
 210         comp->steps[ix].lenExtra += style->extrasNr;
 211     }
 212 }
 213
 214 /**
 215  * xsltNewParserContext:
 216  * @style:  the stylesheet
 217  * @ctxt:  the transformation context, if done at run-time
 218  *
 219  * Create a new XSLT ParserContext
 220  *
 221  * Returns the newly allocated xsltParserContextPtr or NULL in case of error
 222  */
 223 static xsltParserContextPtr
 224 xsltNewParserContext(xsltStylesheetPtr style, xsltTransformContextPtr ctxt) {
 225     xsltParserContextPtr cur;
 226
 227     cur = (xsltParserContextPtr) xmlMalloc(sizeof(xsltParserContext));
 228     if (cur == NULL) {
 229         xsltTransformError(NULL, NULL, NULL,
 230                 "xsltNewParserContext : malloc failed\n");
 231         return(NULL);
 232     }
 233     memset(cur, 0, sizeof(xsltParserContext));
 234     cur->style = style;
 235     cur->ctxt = ctxt;
 236     return(cur);
 237 }
 238
 239 /**
 240  * xsltFreeParserContext:
 241  * @ctxt:  an XSLT parser context
 242  *
 243  * Free up the memory allocated by @ctxt
 244  */
 245 static void
 246 xsltFreeParserContext(xsltParserContextPtr ctxt) {
 247     if (ctxt == NULL)
 248         return;
 249     memset(ctxt, -1, sizeof(xsltParserContext));
 250     xmlFree(ctxt);
 251 }
 252
 253 /**
 254  * xsltCompMatchAdd:
 255  * @comp:  the compiled match expression
 256  * @op:  an op
 257  * @value:  the first value
 258  * @value2:  the second value
 259  *
 260  * Add an step to an XSLT Compiled Match
 261  *
 262  * Returns -1 in case of failure, 0 otherwise.
 263  */
 264 static int
 265 xsltCompMatchAdd(xsltParserContextPtr ctxt, xsltCompMatchPtr comp,
 266                  xsltOp op, xmlChar * value, xmlChar * value2)
 267 {
 268     if (comp->nbStep >= 40) {
 269         xsltTransformError(NULL, NULL, NULL,
 270                          "xsltCompMatchAdd: overflow\n");
 271         return (-1);
 272     }
 273     comp->steps[comp->nbStep].op = op;
 274     comp->steps[comp->nbStep].value = value;
 275     comp->steps[comp->nbStep].value2 = value2;
 276     if (ctxt->ctxt != NULL) {
 277         comp->steps[comp->nbStep].previousExtra =
 278             xsltAllocateExtraCtxt(ctxt->ctxt);
 279         comp->steps[comp->nbStep].indexExtra =
 280             xsltAllocateExtraCtxt(ctxt->ctxt);
 281         comp->steps[comp->nbStep].lenExtra =
 282             xsltAllocateExtraCtxt(ctxt->ctxt);
 283     } else {
 284         comp->steps[comp->nbStep].previousExtra =
 285             xsltAllocateExtra(ctxt->style);
 286         comp->steps[comp->nbStep].indexExtra =
 287             xsltAllocateExtra(ctxt->style);
 288         comp->steps[comp->nbStep].lenExtra =
 289             xsltAllocateExtra(ctxt->style);
 290     }
 291     if (op == XSLT_OP_PREDICATE) {
 292         comp->steps[comp->nbStep].comp = xsltXPathCompile(ctxt->style, value);
 293     }
 294     comp->nbStep++;
 295     return (0);
 296 }
 297
 298 /**
 299  * xsltSwapTopCompMatch:
 300  * @comp:  the compiled match expression
 301  *
 302  * reverse the two top steps.
 303  */
 304 static void
 305 xsltSwapTopCompMatch(xsltCompMatchPtr comp) {
 306     int i;
 307     int j = comp->nbStep - 1;
 308
 309     if (j > 0) {
 310         register xmlChar *tmp;
 311         register xsltOp op;
 312         register xmlXPathCompExprPtr expr;
 313         i = j - 1;
 314         tmp = comp->steps[i].value;
 315         comp->steps[i].value = comp->steps[j].value;
 316         comp->steps[j].value = tmp;
 317         tmp = comp->steps[i].value2;
 318         comp->steps[i].value2 = comp->steps[j].value2;
 319         comp->steps[j].value2 = tmp;
 320         op = comp->steps[i].op;
 321         comp->steps[i].op = comp->steps[j].op;
 322         comp->steps[j].op = op;
 323         expr = comp->steps[i].comp;
 324         comp->steps[i].comp = comp->steps[j].comp;
 325         comp->steps[j].comp = expr;
 326     }
 327 }
 328
 329 /**
 330  * xsltReverseCompMatch:
 331  * @comp:  the compiled match expression
 332  *
 333  * reverse all the stack of expressions
 334  */
 335 static void
 336 xsltReverseCompMatch(xsltCompMatchPtr comp) {
 337     int i = 0;
 338     int j = comp->nbStep - 1;
 339
 340     while (j > i) {
 341         register xmlChar *tmp;
 342         register xsltOp op;
 343         register xmlXPathCompExprPtr expr;
 344         tmp = comp->steps[i].value;
 345         comp->steps[i].value = comp->steps[j].value;
 346         comp->steps[j].value = tmp;
 347         tmp = comp->steps[i].value2;
 348         comp->steps[i].value2 = comp->steps[j].value2;
 349         comp->steps[j].value2 = tmp;
 350         op = comp->steps[i].op;
 351         comp->steps[i].op = comp->steps[j].op;
 352         comp->steps[j].op = op;
 353         expr = comp->steps[i].comp;
 354         comp->steps[i].comp = comp->steps[j].comp;
 355         comp->steps[j].comp = expr;
 356         j--;
 357         i++;
 358     }
 359     comp->steps[comp->nbStep++].op = XSLT_OP_END;
 360 }
 361
 362 /************************************************************************
 363  *                                                                      *
 364  *              The interpreter for the precompiled patterns            *
 365  *                                                                      *
 366  ************************************************************************/
 367
 368 /**
 369  * xsltTestCompMatch:
 370  * @ctxt:  a XSLT process context
 371  * @comp: the precompiled pattern
 372  * @node: a node
 373  * @mode:  the mode name or NULL
 374  * @modeURI:  the mode URI or NULL
 375  *
 376  * Test wether the node matches the pattern
 377  *
 378  * Returns 1 if it matches, 0 if it doesn't and -1 in case of failure
 379  */
 380 static int
 381 xsltTestCompMatch(xsltTransformContextPtr ctxt, xsltCompMatchPtr comp,
 382                   xmlNodePtr node, const xmlChar *mode,
 383                   const xmlChar *modeURI) {
 384     int i;
 385     xsltStepOpPtr step, sel = NULL;
 386
 387     if ((comp == NULL) || (node == NULL) || (ctxt == NULL)) {
 388         xsltTransformError(ctxt, NULL, node,
 389                 "xsltTestCompMatch: null arg\n");
 390         return(-1);
 391     }
 392     if (mode != NULL) {
 393         if (comp->mode == NULL)
 394             return(0);
 395         if ((comp->mode != mode) && (!xmlStrEqual(comp->mode, mode)))
 396             return(0);
 397     } else {
 398         if (comp->mode != NULL)
 399             return(0);
 400     }
 401     if (modeURI != NULL) {
 402         if (comp->modeURI == NULL)
 403             return(0);
 404         if ((comp->modeURI != modeURI) &&
 405             (!xmlStrEqual(comp->modeURI, modeURI)))
 406             return(0);
 407     } else {
 408         if (comp->modeURI != NULL)
 409             return(0);
 410     }
 411     for (i = 0;i < comp->nbStep;i++) {
 412         step = &comp->steps[i];
 413         if (step->op != XSLT_OP_PREDICATE)
 414             sel = step;
 415         switch (step->op) {
 416             case XSLT_OP_END:
 417                 return(1);
 418             case XSLT_OP_ROOT:
 419                 if ((node->type == XML_DOCUMENT_NODE) ||
 420 #ifdef LIBXML_DOCB_ENABLED
 421                     (node->type == XML_DOCB_DOCUMENT_NODE) ||
 422 #endif
 423                     (node->type == XML_HTML_DOCUMENT_NODE))
 424                     continue;
 425                 if ((node->type == XML_ELEMENT_NODE) && (node->name[0] == ' '))
 426                     continue;
 427                 return(0);
 428             case XSLT_OP_ELEM:
 429                 if (node->type != XML_ELEMENT_NODE)
 430                     return(0);
 431                 if (step->value == NULL)
 432                     continue;
 433                 if (step->value[0] != node->name[0])
 434                     return(0);
 435                 if (!xmlStrEqual(step->value, node->name))
 436                     return(0);
 437
 438                 /* Namespace test */
 439                 if (node->ns == NULL) {
 440                     if (step->value2 != NULL)
 441                         return(0);
 442                 } else if (node->ns->href != NULL) {
 443                     if (step->value2 == NULL)
 444                         return(0);
 445                     if (!xmlStrEqual(step->value2, node->ns->href))
 446                         return(0);
 447                 }
 448                 continue;
 449             case XSLT_OP_CHILD: {
 450                 xmlNodePtr lst;
 451
 452                 if ((node->type != XML_ELEMENT_NODE) &&
 453                     (node->type != XML_DOCUMENT_NODE) &&
 454 #ifdef LIBXML_DOCB_ENABLED
 455                     (node->type != XML_DOCB_DOCUMENT_NODE) &&
 456 #endif
 457                     (node->type != XML_HTML_DOCUMENT_NODE))
 458                     return(0);
 459
 460                 lst = node->children;
 461
 462                 if (step->value != NULL) {
 463                     while (lst != NULL) {
 464                         if ((lst->type == XML_ELEMENT_NODE) &&
 465                             (step->value[0] == lst->name[0]) &&
 466                             (xmlStrEqual(step->value, lst->name)))
 467                             break;
 468                         lst = lst->next;
 469                     }
 470                     if (lst != NULL)
 471                         continue;
 472                 }
 473                 return(0);
 474             }
 475             case XSLT_OP_ATTR:
 476                 if (node->type != XML_ATTRIBUTE_NODE)
 477                     return(0);
 478                 if (step->value != NULL) {
 479                     if (step->value[0] != node->name[0])
 480                         return(0);
 481                     if (!xmlStrEqual(step->value, node->name))
 482                         return(0);
 483                 }
 484                 /* Namespace test */
 485                 if (node->ns == NULL) {
 486                     if (step->value2 != NULL)
 487                         return(0);
 488                 } else if (step->value2 != NULL) {
 489                     if (!xmlStrEqual(step->value2, node->ns->href))
 490                         return(0);
 491                 }
 492                 continue;
 493             case XSLT_OP_PARENT:
 494                 if ((node->type == XML_DOCUMENT_NODE) ||
 495                     (node->type == XML_HTML_DOCUMENT_NODE) ||
 496 #ifdef LIBXML_DOCB_ENABLED
 497                     (node->type == XML_DOCB_DOCUMENT_NODE) ||
 498 #endif
 499                     (node->type == XML_NAMESPACE_DECL))
 500                     return(0);
 501                 node = node->parent;
 502                 if (node == NULL)
 503                     return(0);
 504                 if (step->value == NULL)
 505                     continue;
 506                 if (step->value[0] != node->name[0])
 507                     return(0);
 508                 if (!xmlStrEqual(step->value, node->name))
 509                     return(0);
 510                 /* Namespace test */
 511                 if (node->ns == NULL) {
 512                     if (step->value2 != NULL)
 513                         return(0);
 514                 } else if (node->ns->href != NULL) {
 515                     if (step->value2 == NULL)
 516                         return(0);
 517                     if (!xmlStrEqual(step->value2, node->ns->href))
 518                         return(0);
 519                 }
 520                 continue;
 521             case XSLT_OP_ANCESTOR:
 522                 /* TODO: implement coalescing of ANCESTOR/NODE ops */
 523                 if (step->value == NULL) {
 524                     i++;
 525                     step = &comp->steps[i];
 526                     if (step->op == XSLT_OP_ROOT)
 527                         return(1);
 528                     if (step->op != XSLT_OP_ELEM)
 529                         return(0);
 530                     if (step->value == NULL)
 531                         return(-1);
 532                 }
 533                 if (node == NULL)
 534                     return(0);
 535                 if ((node->type == XML_DOCUMENT_NODE) ||
 536                     (node->type == XML_HTML_DOCUMENT_NODE) ||
 537 #ifdef LIBXML_DOCB_ENABLED
 538                     (node->type == XML_DOCB_DOCUMENT_NODE) ||
 539 #endif
 540                     (node->type == XML_NAMESPACE_DECL))
 541                     return(0);
 542                 node = node->parent;
 543                 while (node != NULL) {
 544                     if (node == NULL)
 545                         return(0);
 546                     if ((node->type == XML_ELEMENT_NODE) &&
 547                         (step->value[0] == node->name[0]) &&
 548                         (xmlStrEqual(step->value, node->name))) {
 549                         /* Namespace test */
 550                         if (node->ns == NULL) {
 551                             if (step->value2 == NULL)
 552                                 break;
 553                         } else if (node->ns->href != NULL) {
 554                             if ((step->value2 != NULL) &&
 555                                 (xmlStrEqual(step->value2, node->ns->href)))
 556                                 break;
 557                         }
 558                     }
 559                     node = node->parent;
 560                 }
 561                 if (node == NULL)
 562                     return(0);
 563                 continue;
 564             case XSLT_OP_ID: {
 565                 /* TODO Handle IDs decently, must be done differently */
 566                 xmlAttrPtr id;
 567
 568                 if (node->type != XML_ELEMENT_NODE)
 569                     return(0);
 570
 571                 id = xmlGetID(node->doc, step->value);
 572                 if ((id == NULL) || (id->parent != node))
 573                     return(0);
 574                 break;
 575             }
 576             case XSLT_OP_KEY: {
 577                 xmlNodeSetPtr list;
 578                 int indx;
 579
 580                 list = xsltGetKey(ctxt, step->value,
 581                                   step->value3, step->value2);
 582                 if (list == NULL)
 583                     return(0);
 584                 for (indx = 0;indx < list->nodeNr;indx++)
 585                     if (list->nodeTab[indx] == node)
 586                         break;
 587                 if (indx >= list->nodeNr)
 588                     return(0);
 589                 break;
 590             }
 591             case XSLT_OP_NS:
 592                 if (node->type != XML_ELEMENT_NODE)
 593                     return(0);
 594                 if (node->ns == NULL) {
 595                     if (step->value != NULL)
 596                         return(0);
 597                 } else if (node->ns->href != NULL) {
 598                     if (step->value == NULL)
 599                         return(0);
 600                     if (!xmlStrEqual(step->value, node->ns->href))
 601                         return(0);
 602                 }
 603                 break;
 604             case XSLT_OP_ALL:
 605                 if (node->type != XML_ELEMENT_NODE)
 606                     return(0);
 607                 break;
 608             case XSLT_OP_PREDICATE: {
 609                 xmlNodePtr oldNode;
 610                 xmlDocPtr doc;
 611                 int oldCS, oldCP;
 612                 int pos = 0, len = 0;
 613                 int isRVT;
 614
 615                 doc = node->doc;
 616                 if ((doc != NULL) &&
 617                     (doc->name != NULL) &&
 618                     (doc->name[0] == ' ') &&
 619                     (xmlStrEqual(BAD_CAST doc->name,
 620                                  BAD_CAST " fake node libxslt")))
 621                     isRVT = 1;
 622                 else
 623                     isRVT = 0;
 624                 /*
 625                  * The simple existing predicate code cannot handle
 626                  * properly cascaded predicates. If in this situation
 627                  * compute directly the full node list once and check
 628                  * if the node is in the result list.
 629                  */
 630                 if (comp->steps[i + 1].op == XSLT_OP_PREDICATE) {
 631                     xmlDocPtr prevdoc;
 632                     xmlXPathObjectPtr list;
 633                     int ix, j;
 634                     int nocache = 0;
 635
 636                     prevdoc = (xmlDocPtr)
 637                         XSLT_RUNTIME_EXTRA(ctxt, sel->previousExtra);
 638                     ix = (int)
 639                         XSLT_RUNTIME_EXTRA(ctxt, sel->indexExtra);
 640                     list = (xmlXPathObjectPtr)
 641                         XSLT_RUNTIME_EXTRA_LST(ctxt, sel->lenExtra);
 642
 643                     if ((list == NULL) || (prevdoc != doc)) {
 644                         xmlChar *query;
 645                         xmlXPathObjectPtr newlist;
 646                         xmlNodePtr parent = node->parent;
 647                         xmlDocPtr olddoc;
 648                         xmlNodePtr oldnode;
 649
 650                         if (comp->pattern[0] == '/')
 651                             query = xmlStrdup(comp->pattern);
 652                         else {
 653                             query = xmlStrdup((const xmlChar *)"//");
 654                             query = xmlStrcat(query, comp->pattern);
 655                         }
 656                         oldnode = ctxt->xpathCtxt->node;
 657                         olddoc = ctxt->xpathCtxt->doc;
 658                         ctxt->xpathCtxt->node = node;
 659                         ctxt->xpathCtxt->doc = doc;
 660                         newlist = xmlXPathEval(query, ctxt->xpathCtxt);
 661                         ctxt->xpathCtxt->node = oldnode;
 662                         ctxt->xpathCtxt->doc = olddoc;
 663                         xmlFree(query);
 664                         if (newlist == NULL)
 665                             return(-1);
 666                         if (newlist->type != XPATH_NODESET) {
 667                             xmlXPathFreeObject(newlist);
 668                             return(-1);
 669                         }
 670                         ix = 0;
 671
 672                         if ((parent == NULL) || (node->doc == NULL) || isRVT)
 673                             nocache = 1;
 674
 675                         if (nocache == 0) {
 676                             if (list != NULL)
 677                                 xmlXPathFreeObject(list);
 678                             list = newlist;
 679
 680                             XSLT_RUNTIME_EXTRA_LST(ctxt, sel->lenExtra) =
 681                                 (void *) list;
 682                             XSLT_RUNTIME_EXTRA(ctxt, sel->previousExtra) =
 683                                 (void *) doc;
 684                             XSLT_RUNTIME_EXTRA(ctxt, sel->indexExtra) =
 685                                 0;
 686                             XSLT_RUNTIME_EXTRA_FREE(ctxt, sel->lenExtra) =
 687                                 (xmlFreeFunc) xmlXPathFreeObject;
 688                         } else
 689                             list = newlist;
 690                     }
 691                     if ((list->nodesetval == NULL) ||
 692                         (list->nodesetval->nodeNr <= 0)) {
 693                         if (nocache == 1)
 694                             xmlXPathFreeObject(list);
 695                         return(0);
 696                     }
 697                     /* TODO: store the index and use it for the scan */
 698                     if (ix == 0) {
 699                         for (j = 0;j < list->nodesetval->nodeNr;j++) {
 700                             if (list->nodesetval->nodeTab[j] == node) {
 701                                 if (nocache == 1)
 702                                     xmlXPathFreeObject(list);
 703                                 return(1);
 704                             }
 705                         }
 706                     } else {
 707                     }
 708                     if (nocache == 1)
 709                         xmlXPathFreeObject(list);
 710                     return(0);
 711                 }
 712                 /*
 713                  * Depending on the last selection, one may need to
 714                  * recompute contextSize and proximityPosition.
 715                  *
 716                  * TODO: make this thread safe !
 717                  */
 718                 oldCS = ctxt->xpathCtxt->contextSize;
 719                 oldCP = ctxt->xpathCtxt->proximityPosition;
 720                 if ((sel != NULL) &&
 721                     (sel->op == XSLT_OP_ELEM) &&
 722                     (sel->value != NULL) &&
 723                     (node->type == XML_ELEMENT_NODE) &&
 724                     (node->parent != NULL)) {
 725                     xmlNodePtr previous;
 726                     int ix, nocache = 0;
 727
 728                     previous = (xmlNodePtr)
 729                         XSLT_RUNTIME_EXTRA(ctxt, sel->previousExtra);
 730                     ix = (int)
 731                         XSLT_RUNTIME_EXTRA(ctxt, sel->indexExtra);
 732                     if ((previous != NULL) &&
 733                         (previous->parent == node->parent)) {
 734                         /*
 735                          * just walk back to adjust the index
 736                          */
 737                         int indx = 0;
 738                         xmlNodePtr sibling = node;
 739
 740                         while (sibling != NULL) {
 741                             if (sibling == previous)
 742                                 break;
 743                             if ((previous->type == XML_ELEMENT_NODE) &&
 744                                 (previous->name != NULL) &&
 745                                 (sibling->name != NULL) &&
 746                                 (previous->name[0] == sibling->name[0]) &&
 747                                 (xmlStrEqual(previous->name, sibling->name))) {
 748                                 if ((sel->value2 == NULL) ||
 749                                     ((sibling->ns != NULL) &&
 750                                      (xmlStrEqual(sel->value2,
 751                                                   sibling->ns->href))))
 752                                     indx++;
 753                             }
 754                             sibling = sibling->prev;
 755                         }
 756                         if (sibling == NULL) {
 757                             /* hum going backward in document order ... */
 758                             indx = 0;
 759                             sibling = node;
 760                             while (sibling != NULL) {
 761                                 if (sibling == previous)
 762                                     break;
 763                                 if ((sel->value2 == NULL) ||
 764                                     ((sibling->ns != NULL) &&
 765                                      (xmlStrEqual(sel->value2,
 766                                                   sibling->ns->href))))
 767                                     indx--;
 768                                 sibling = sibling->next;
 769                             }
 770                         }
 771                         if (sibling != NULL) {
 772                             pos = ix + indx;
 773                             /*
 774                              * If the node is in a Value Tree we need to
 775                              * save len, but cannot cache the node!
 776                              * (bugs 153137 and 158840)
 777                              */
 778                             if (node->doc != NULL) {
 779                                 len = (int)
 780                                     XSLT_RUNTIME_EXTRA(ctxt, sel->lenExtra);
 781                                 if (!isRVT) {
 782                                     XSLT_RUNTIME_EXTRA(ctxt,
 783                                         sel->previousExtra) = node;
 784                                     XSLT_RUNTIME_EXTRA(ctxt, sel->indexExtra) =
 785                                         (void *) pos;
 786                                 }
 787                             }
 788                             ix = pos;
 789                         } else
 790                             pos = 0;
 791                     } else {
 792                         /*
 793                          * recompute the index
 794                          */
 795                         xmlNodePtr siblings = node->parent->children;
 796                         xmlNodePtr parent = node->parent;
 797
 798                         while (siblings != NULL) {
 799                             if (siblings->type == XML_ELEMENT_NODE) {
 800                                 if (siblings == node) {
 801                                     len++;
 802                                     pos = len;
 803                                 } else if ((node->name != NULL) &&
 804                                            (siblings->name != NULL) &&
 805                                     (node->name[0] == siblings->name[0]) &&
 806                                     (xmlStrEqual(node->name, siblings->name))) {
 807                                     if ((sel->value2 == NULL) ||
 808                                         ((siblings->ns != NULL) &&
 809                                          (xmlStrEqual(sel->value2,
 810                                                       siblings->ns->href))))
 811                                         len++;
 812                                 }
 813                             }
 814                             siblings = siblings->next;
 815                         }
 816                         if ((parent == NULL) || (node->doc == NULL))
 817                             nocache = 1;
 818                         else {
 819                             while (parent->parent != NULL)
 820                                 parent = parent->parent;
 821                             if (((parent->type != XML_DOCUMENT_NODE) &&
 822                                  (parent->type != XML_HTML_DOCUMENT_NODE)) ||
 823                                  (parent != (xmlNodePtr) node->doc))
 824                                 nocache = 1;
 825                         }
 826                     }
 827                     if (pos != 0) {
 828                         ctxt->xpathCtxt->contextSize = len;
 829                         ctxt->xpathCtxt->proximityPosition = pos;
 830                         /*
 831                          * If the node is in a Value Tree we cannot
 832                          * cache it !
 833                          */
 834                         if ((!isRVT) && (node->doc != NULL) &&
 835                             (nocache == 0)) {
 836                             XSLT_RUNTIME_EXTRA(ctxt, sel->previousExtra) =
 837                                 node;
 838                             XSLT_RUNTIME_EXTRA(ctxt, sel->indexExtra) =
 839                                 (void *) pos;
 840                             XSLT_RUNTIME_EXTRA(ctxt, sel->lenExtra) =
 841                                 (void *) len;
 842                         }
 843                     }
 844                 } else if ((sel != NULL) && (sel->op == XSLT_OP_ALL) &&
 845                            (node->type == XML_ELEMENT_NODE)) {
 846                     xmlNodePtr previous;
 847                     int ix, nocache = 0;
 848
 849                     previous = (xmlNodePtr)
 850                         XSLT_RUNTIME_EXTRA(ctxt, sel->previousExtra);
 851                     ix = (int)
 852                         XSLT_RUNTIME_EXTRA(ctxt, sel->indexExtra);
 853                     if ((previous != NULL) &&
 854                         (previous->parent == node->parent)) {
 855                         /*
 856                          * just walk back to adjust the index
 857                          */
 858                         int indx = 0;
 859                         xmlNodePtr sibling = node;
 860
 861                         while (sibling != NULL) {
 862                             if (sibling == previous)
 863                                 break;
 864                             if (sibling->type == XML_ELEMENT_NODE)
 865                                 indx++;
 866                             sibling = sibling->prev;
 867                         }
 868                         if (sibling == NULL) {
 869                             /* hum going backward in document order ... */
 870                             indx = 0;
 871                             sibling = node;
 872                             while (sibling != NULL) {
 873                                 if (sibling == previous)
 874                                     break;
 875                                 if (sibling->type == XML_ELEMENT_NODE)
 876                                     indx--;
 877                                 sibling = sibling->next;
 878                             }
 879                         }
 880                         if (sibling != NULL) {
 881                             pos = ix + indx;
 882                             /*
 883                              * If the node is in a Value Tree we cannot
 884                              * cache it !
 885                              */
 886                             if ((node->doc != NULL) && !isRVT) {
 887                                 len = (int)
 888                                     XSLT_RUNTIME_EXTRA(ctxt, sel->lenExtra);
 889                                 XSLT_RUNTIME_EXTRA(ctxt,
 890                                         sel->previousExtra) = node;
 891                                 XSLT_RUNTIME_EXTRA(ctxt, sel->indexExtra) =
 892                                     (void *) pos;
 893                             }
 894                         } else
 895                             pos = 0;
 896                     } else {
 897                         /*
 898                          * recompute the index
 899                          */
 900                         xmlNodePtr siblings = node->parent->children;
 901                         xmlNodePtr parent = node->parent;
 902
 903                         while (siblings != NULL) {
 904                             if (siblings->type == XML_ELEMENT_NODE) {
 905                                 len++;
 906                                 if (siblings == node) {
 907                                     pos = len;
 908                                 }
 909                             }
 910                             siblings = siblings->next;
 911                         }
 912                         if ((parent == NULL) || (node->doc == NULL))
 913                             nocache = 1;
 914                         else {
 915                             while (parent->parent != NULL)
 916                                 parent = parent->parent;
 917                             if (((parent->type != XML_DOCUMENT_NODE) &&
 918                                  (parent->type != XML_HTML_DOCUMENT_NODE)) ||
 919                                  (parent != (xmlNodePtr) node->doc))
 920                                 nocache = 1;
 921                         }
 922                     }
 923                     if (pos != 0) {
 924                         ctxt->xpathCtxt->contextSize = len;
 925                         ctxt->xpathCtxt->proximityPosition = pos;
 926                         /*
 927                          * If the node is in a Value Tree we cannot
 928                          * cache it !
 929                          */
 930                         if ((node->doc != NULL) && (nocache == 0) && !isRVT) {
 931                             XSLT_RUNTIME_EXTRA(ctxt, sel->previousExtra) =
 932                                 node;
 933                             XSLT_RUNTIME_EXTRA(ctxt, sel->indexExtra) =
 934                                 (void *) pos;
 935                             XSLT_RUNTIME_EXTRA(ctxt, sel->lenExtra) =
 936                                 (void *) len;
 937                         }
 938                     }
 939                 }
 940                 oldNode = ctxt->node;
 941                 ctxt->node = node;
 942
 943                 if (step->value == NULL)
 944                     goto wrong_index;
 945                 if (step->comp == NULL)
 946                     goto wrong_index;
 947
 948                 if (!xsltEvalXPathPredicate(ctxt, step->comp, comp->nsList,
 949                                             comp->nsNr))
 950                     goto wrong_index;
 951
 952                 if (pos != 0) {
 953                     ctxt->xpathCtxt->contextSize = oldCS;
 954                     ctxt->xpathCtxt->proximityPosition = oldCP;
 955                 }
 956                 ctxt->node = oldNode;
 957                 break;
 958 wrong_index:
 959                 if (pos != 0) {
 960                     ctxt->xpathCtxt->contextSize = oldCS;
 961                     ctxt->xpathCtxt->proximityPosition = oldCP;
 962                 }
 963                 ctxt->node = oldNode;
 964                 return(0);
 965             }
 966             case XSLT_OP_PI:
 967                 if (node->type != XML_PI_NODE)
 968                     return(0);
 969                 if (step->value != NULL) {
 970                     if (!xmlStrEqual(step->value, node->name))
 971                         return(0);
 972                 }
 973                 break;
 974             case XSLT_OP_COMMENT:
 975                 if (node->type != XML_COMMENT_NODE)
 976                     return(0);
 977                 break;
 978             case XSLT_OP_TEXT:
 979                 if ((node->type != XML_TEXT_NODE) &&
 980                     (node->type != XML_CDATA_SECTION_NODE))
 981                     return(0);
 982                 break;
 983             case XSLT_OP_NODE:
 984                 switch (node->type) {
 985                     case XML_ELEMENT_NODE:
 986                     case XML_CDATA_SECTION_NODE:
 987                     case XML_PI_NODE:
 988                     case XML_COMMENT_NODE:
 989                     case XML_TEXT_NODE:
 990                         break;
 991                     default:
 992                         return(0);
 993                 }
 994                 break;
 995         }
 996     }
 997     return(1);
 998 }
 999
1000 /**
1001  * xsltTestCompMatchList:
1002  * @ctxt:  a XSLT process context
1003  * @node: a node
1004  * @comp: the precompiled pattern list
1005  *
1006  * Test wether the node matches one of the patterns in the list
1007  *
1008  * Returns 1 if it matches, 0 if it doesn't and -1 in case of failure
1009  */
1010 int
1011 xsltTestCompMatchList(xsltTransformContextPtr ctxt, xmlNodePtr node,
1012                       xsltCompMatchPtr comp) {
1013     int ret;
1014
1015     if ((ctxt == NULL) || (node == NULL))
1016         return(-1);
1017     while (comp != NULL) {
1018         ret = xsltTestCompMatch(ctxt, comp, node, NULL, NULL);
1019         if (ret == 1)
1020             return(1);
1021         comp = comp->next;
1022     }
1023     return(0);
1024 }
1025
1026 /************************************************************************
1027  *                                                                      *
1028  *                      Dedicated parser for templates                  *
1029  *                                                                      *
1030  ************************************************************************/
1031
1032 #define CUR (*ctxt->cur)
1033 #define SKIP(val) ctxt->cur += (val)
1034 #define NXT(val) ctxt->cur[(val)]
1035 #define CUR_PTR ctxt->cur
1036
1037 #define SKIP_BLANKS                                                     \
1038     while (IS_BLANK_CH(CUR)) NEXT
1039
1040 #define CURRENT (*ctxt->cur)
1041 #define NEXT ((*ctxt->cur) ?  ctxt->cur++: ctxt->cur)
1042
1043
1044 #define PUSH(op, val, val2)                                             \
1045     if (xsltCompMatchAdd(ctxt, ctxt->comp, (op), (val), (val2))) goto error;
1046
1047 #define SWAP()                                          \
1048     xsltSwapTopCompMatch(ctxt->comp);
1049
1050 #define XSLT_ERROR(X)                                                   \
1051     { xsltError(ctxt, __FILE__, __LINE__, X);                   \
1052       ctxt->error = (X); return; }
1053
1054 #define XSLT_ERROR0(X)                                                  \
1055     { xsltError(ctxt, __FILE__, __LINE__, X);                   \
1056       ctxt->error = (X); return(0); }
1057
1058 /**
1059  * xsltScanLiteral:
1060  * @ctxt:  the XPath Parser context
1061  *
1062  * Parse an XPath Litteral:
1063  *
1064  * [29] Literal ::= '"' [^"]* '"'
1065  *                | "'" [^']* "'"
1066  *
1067  * Returns the Literal parsed or NULL
1068  */
1069
1070 static xmlChar *
1071 xsltScanLiteral(xsltParserContextPtr ctxt) {
1072     const xmlChar *q, *cur;
1073     xmlChar *ret = NULL;
1074     int val, len;
1075
1076     SKIP_BLANKS;
1077     if (CUR == '"') {
1078         NEXT;
1079         cur = q = CUR_PTR;
1080         val = xmlStringCurrentChar(NULL, cur, &len);
1081         while ((IS_CHAR(val)) && (val != '"')) {
1082             cur += len;
1083             val = xmlStringCurrentChar(NULL, cur, &len);
1084         }
1085         if (!IS_CHAR(val)) {
1086             ctxt->error = 1;
1087             return(NULL);
1088         } else {
1089             ret = xmlStrndup(q, cur - q);
1090         }
1091         cur += len;
1092         CUR_PTR = cur;
1093     } else if (CUR == '\'') {
1094         NEXT;
1095         cur = q = CUR_PTR;
1096         val = xmlStringCurrentChar(NULL, cur, &len);
1097         while ((IS_CHAR(val)) && (val != '\'')) {
1098             cur += len;
1099             val = xmlStringCurrentChar(NULL, cur, &len);
1100         }
1101         if (!IS_CHAR(val)) {
1102             ctxt->error = 1;
1103             return(NULL);
1104         } else {
1105             ret = xmlStrndup(q, cur - q);
1106         }
1107         cur += len;
1108         CUR_PTR = cur;
1109     } else {
1110         /* XP_ERROR(XPATH_START_LITERAL_ERROR); */
1111         ctxt->error = 1;
1112         return(NULL);
1113     }
1114     return(ret);
1115 }
1116
1117 /**
1118  * xsltScanName:
1119  * @ctxt:  the XPath Parser context
1120  *
1121  * [4] NameChar ::= Letter | Digit | '.' | '-' | '_' |
1122  *                  CombiningChar | Extender
1123  *
1124  * [5] Name ::= (Letter | '_' | ':') (NameChar)*
1125  *
1126  * [6] Names ::= Name (S Name)*
1127  *
1128  * Returns the Name parsed or NULL
1129  */
1130
1131 static xmlChar *
1132 xsltScanName(xsltParserContextPtr ctxt) {
1133     const xmlChar *q, *cur;
1134     xmlChar *ret = NULL;
1135     int val, len;
1136
1137     SKIP_BLANKS;
1138
1139     cur = q = CUR_PTR;
1140     val = xmlStringCurrentChar(NULL, cur, &len);
1141     if (!IS_LETTER(val) && (val != '_') && (val != ':'))
1142         return(NULL);
1143
1144     while ((IS_LETTER(val)) || (IS_DIGIT(val)) ||
1145            (val == '.') || (val == '-') ||
1146            (val == '_') ||
1147            (IS_COMBINING(val)) ||
1148            (IS_EXTENDER(val))) {
1149         cur += len;
1150         val = xmlStringCurrentChar(NULL, cur, &len);
1151     }
1152     ret = xmlStrndup(q, cur - q);
1153     CUR_PTR = cur;
1154     return(ret);
1155 }
1156
1157 /**
1158  * xsltScanNCName:
1159  * @ctxt:  the XPath Parser context
1160  *
1161  * Parses a non qualified name
1162  *
1163  * Returns the Name parsed or NULL
1164  */
1165
1166 static xmlChar *
1167 xsltScanNCName(xsltParserContextPtr ctxt) {
1168     const xmlChar *q, *cur;
1169     xmlChar *ret = NULL;
1170     int val, len;
1171
1172     SKIP_BLANKS;
1173
1174     cur = q = CUR_PTR;
1175     val = xmlStringCurrentChar(NULL, cur, &len);
1176     if (!IS_LETTER(val) && (val != '_'))
1177         return(NULL);
1178
1179     while ((IS_LETTER(val)) || (IS_DIGIT(val)) ||
1180            (val == '.') || (val == '-') ||
1181            (val == '_') ||
1182            (IS_COMBINING(val)) ||
1183            (IS_EXTENDER(val))) {
1184         cur += len;
1185         val = xmlStringCurrentChar(NULL, cur, &len);
1186     }
1187     ret = xmlStrndup(q, cur - q);
1188     CUR_PTR = cur;
1189     return(ret);
1190 }
1191
1192 /**
1193  * xsltScanQName:
1194  * @ctxt:  the XPath Parser context
1195  * @prefix:  the place to store the prefix
1196  *
1197  * Parse a qualified name
1198  *
1199  * Returns the Name parsed or NULL
1200  */
1201
1202 static xmlChar *
1203 xsltScanQName(xsltParserContextPtr ctxt, xmlChar **prefix) {
1204     xmlChar *ret = NULL;
1205
1206     *prefix = NULL;
1207     ret = xsltScanNCName(ctxt);
1208     if (CUR == ':') {
1209         *prefix = ret;
1210         NEXT;
1211         ret = xsltScanNCName(ctxt);
1212     }
1213     return(ret);
1214 }
1215
1216 /*
1217  * xsltCompileIdKeyPattern:
1218  * @ctxt:  the compilation context
1219  * @name:  a preparsed name
1220  * @aid:  whether id/key are allowed there
1221  *
1222  * Compile the XSLT LocationIdKeyPattern
1223  * [3] IdKeyPattern ::= 'id' '(' Literal ')'
1224  *                    | 'key' '(' Literal ',' Literal ')'
1225  *
1226  * also handle NodeType and PI from:
1227  *
1228  * [7]  NodeTest ::= NameTest
1229  *                 | NodeType '(' ')'
1230  *                 | 'processing-instruction' '(' Literal ')'
1231  */
1232 static void
1233 xsltCompileIdKeyPattern(xsltParserContextPtr ctxt, xmlChar *name, int aid) {
1234     xmlChar *lit = NULL;
1235     xmlChar *lit2 = NULL;
1236
1237     if (CUR != '(') {
1238         xsltTransformError(NULL, NULL, NULL,
1239                 "xsltCompileIdKeyPattern : ( expected\n");
1240         ctxt->error = 1;
1241         return;
1242     }
1243     if ((aid) && (xmlStrEqual(name, (const xmlChar *)"id"))) {
1244         NEXT;
1245         SKIP_BLANKS;
1246         lit = xsltScanLiteral(ctxt);
1247         if (ctxt->error)
1248             return;
1249         SKIP_BLANKS;
1250         if (CUR != ')') {
1251             xsltTransformError(NULL, NULL, NULL,
1252                     "xsltCompileIdKeyPattern : ) expected\n");
1253             ctxt->error = 1;
1254             return;
1255         }
1256         NEXT;
1257         PUSH(XSLT_OP_ID, lit, NULL);
1258     } else if ((aid) && (xmlStrEqual(name, (const xmlChar *)"key"))) {
1259         NEXT;
1260         SKIP_BLANKS;
1261         lit = xsltScanLiteral(ctxt);
1262         if (ctxt->error)
1263             return;
1264         SKIP_BLANKS;
1265         if (CUR != ',') {
1266             xsltTransformError(NULL, NULL, NULL,
1267                     "xsltCompileIdKeyPattern : , expected\n");
1268             ctxt->error = 1;
1269             return;
1270         }
1271         NEXT;
1272         SKIP_BLANKS;
1273         lit2 = xsltScanLiteral(ctxt);
1274         if (ctxt->error)
1275             return;
1276         SKIP_BLANKS;
1277         if (CUR != ')') {
1278             xsltTransformError(NULL, NULL, NULL,
1279                     "xsltCompileIdKeyPattern : ) expected\n");
1280             ctxt->error = 1;
1281             return;
1282         }
1283         NEXT;
1284         /* TODO: support namespace in keys */
1285         PUSH(XSLT_OP_KEY, lit, lit2);
1286     } else if (xmlStrEqual(name, (const xmlChar *)"processing-instruction")) {
1287         NEXT;
1288         SKIP_BLANKS;
1289         if (CUR != ')') {
1290             lit = xsltScanLiteral(ctxt);
1291             if (ctxt->error)
1292                 return;
1293             SKIP_BLANKS;
1294             if (CUR != ')') {
1295                 xsltTransformError(NULL, NULL, NULL,
1296                         "xsltCompileIdKeyPattern : ) expected\n");
1297                 ctxt->error = 1;
1298                 return;
1299             }
1300         }
1301         NEXT;
1302         PUSH(XSLT_OP_PI, lit, NULL);
1303     } else if (xmlStrEqual(name, (const xmlChar *)"text")) {
1304         NEXT;
1305         SKIP_BLANKS;
1306         if (CUR != ')') {
1307             xsltTransformError(NULL, NULL, NULL,
1308                     "xsltCompileIdKeyPattern : ) expected\n");
1309             ctxt->error = 1;
1310             return;
1311         }
1312         NEXT;
1313         PUSH(XSLT_OP_TEXT, NULL, NULL);
1314     } else if (xmlStrEqual(name, (const xmlChar *)"comment")) {
1315         NEXT;
1316         SKIP_BLANKS;
1317         if (CUR != ')') {
1318             xsltTransformError(NULL, NULL, NULL,
1319                     "xsltCompileIdKeyPattern : ) expected\n");
1320             ctxt->error = 1;
1321             return;
1322         }
1323         NEXT;
1324         PUSH(XSLT_OP_COMMENT, NULL, NULL);
1325     } else if (xmlStrEqual(name, (const xmlChar *)"node")) {
1326         NEXT;
1327         SKIP_BLANKS;
1328         if (CUR != ')') {
1329             xsltTransformError(NULL, NULL, NULL,
1330                     "xsltCompileIdKeyPattern : ) expected\n");
1331             ctxt->error = 1;
1332             return;
1333         }
1334         NEXT;
1335         PUSH(XSLT_OP_NODE, NULL, NULL);
1336     } else if (aid) {
1337         xsltTransformError(NULL, NULL, NULL,
1338             "xsltCompileIdKeyPattern : expecting 'key' or 'id' or node type\n");
1339         ctxt->error = 1;
1340         return;
1341     } else {
1342         xsltTransformError(NULL, NULL, NULL,
1343             "xsltCompileIdKeyPattern : node type\n");
1344         ctxt->error = 1;
1345         return;
1346     }
1347 error:
1348     if (name != NULL)
1349         xmlFree(name);
1350 }
1351
1352 /**
1353  * xsltCompileStepPattern:
1354  * @ctxt:  the compilation context
1355  * @token:  a posible precompiled name
1356  *
1357  * Compile the XSLT StepPattern and generates a precompiled
1358  * form suitable for fast matching.
1359  *
1360  * [5] StepPattern ::= ChildOrAttributeAxisSpecifier NodeTest Predicate*
1361  * [6] ChildOrAttributeAxisSpecifier ::= AbbreviatedAxisSpecifier
1362  *                                     | ('child' | 'attribute') '::'
1363  * from XPath
1364  * [7]  NodeTest ::= NameTest
1365  *                 | NodeType '(' ')'
1366  *                 | 'processing-instruction' '(' Literal ')'
1367  * [8] Predicate ::= '[' PredicateExpr ']'
1368  * [9] PredicateExpr ::= Expr
1369  * [13] AbbreviatedAxisSpecifier ::= '@'?
1370  * [37] NameTest ::= '*' | NCName ':' '*' | QName
1371  */
1372
1373 static void
1374 xsltCompileStepPattern(xsltParserContextPtr ctxt, xmlChar *token) {
1375     xmlChar *name = NULL;
1376     const xmlChar *URI = NULL;
1377     xmlChar *URL = NULL;
1378     int level;
1379
1380     SKIP_BLANKS;
1381     if ((token == NULL) && (CUR == '@')) {
1382         xmlChar *prefix = NULL;
1383
1384         NEXT;
1385         if (CUR == '*') {
1386             NEXT;
1387             PUSH(XSLT_OP_ATTR, NULL, NULL);
1388             goto parse_predicate;
1389         }
1390         token = xsltScanQName(ctxt, &prefix);
1391         if (prefix != NULL) {
1392             xmlNsPtr ns;
1393
1394             ns = xmlSearchNs(ctxt->doc, ctxt->elem, prefix);
1395             if (ns == NULL) {
1396                 xsltTransformError(NULL, NULL, NULL,
1397                 "xsltCompileStepPattern : no namespace bound to prefix %s\n",
1398                                  prefix);
1399             } else {
1400                 URL = xmlStrdup(ns->href);
1401             }
1402             xmlFree(prefix);
1403         }
1404         if (token == NULL) {
1405             if (CUR == '*') {
1406                 NEXT;
1407                 PUSH(XSLT_OP_ATTR, NULL, URL);
1408                 return;
1409             }
1410             xsltTransformError(NULL, NULL, NULL,
1411                     "xsltCompileStepPattern : Name expected\n");
1412             ctxt->error = 1;
1413             goto error;
1414         }
1415         PUSH(XSLT_OP_ATTR, token, URL);
1416         goto parse_predicate;
1417     }
1418     if (token == NULL)
1419         token = xsltScanName(ctxt);
1420     if (token == NULL) {
1421         if (CUR == '*') {
1422             NEXT;
1423             PUSH(XSLT_OP_ALL, token, NULL);
1424             goto parse_predicate;
1425         } else {
1426             xsltTransformError(NULL, NULL, NULL,
1427                     "xsltCompileStepPattern : Name expected\n");
1428             ctxt->error = 1;
1429             goto error;
1430         }
1431     }
1432
1433
1434     SKIP_BLANKS;
1435     if (CUR == '(') {
1436         xsltCompileIdKeyPattern(ctxt, token, 0);
1437         if (ctxt->error)
1438             goto error;
1439     } else if (CUR == ':') {
1440         NEXT;
1441         if (CUR != ':') {
1442             xmlChar *prefix = token;
1443             xmlNsPtr ns;
1444
1445             /*
1446              * This is a namespace match
1447              */
1448             token = xsltScanName(ctxt);
1449             ns = xmlSearchNs(ctxt->doc, ctxt->elem, prefix);
1450             if (ns == NULL) {
1451                 xsltTransformError(NULL, NULL, NULL,
1452             "xsltCompileStepPattern : no namespace bound to prefix %s\n",
1453                                  prefix);
1454                 ctxt->error = 1;
1455                 goto error;
1456             } else {
1457                 URL = xmlStrdup(ns->href);
1458             }
1459             xmlFree(prefix);
1460             if (token == NULL) {
1461                 if (CUR == '*') {
1462                     NEXT;
1463                     PUSH(XSLT_OP_NS, URL, NULL);
1464                 } else {
1465                     xsltTransformError(NULL, NULL, NULL,
1466                             "xsltCompileStepPattern : Name expected\n");
1467                     ctxt->error = 1;
1468                     goto error;
1469                 }
1470             } else {
1471                 PUSH(XSLT_OP_ELEM, token, URL);
1472             }
1473         } else {
1474             NEXT;
1475             if (xmlStrEqual(token, (const xmlChar *) "child")) {
1476                 xmlFree(token);
1477                 token = xsltScanName(ctxt);
1478                 if (token == NULL) {
1479                     if (CUR == '*') {
1480                         NEXT;
1481                         PUSH(XSLT_OP_ALL, token, NULL);
1482                         goto parse_predicate;
1483                     } else {
1484                         xsltTransformError(NULL, NULL, NULL,
1485                             "xsltCompileStepPattern : QName expected\n");
1486                         ctxt->error = 1;
1487                         goto error;
1488                     }
1489                 }
1490                 URI = xsltGetQNameURI(ctxt->elem, &token);
1491                 if (token == NULL) {
1492                     ctxt->error = 1;
1493                     goto error;
1494                 } else {
1495                     name = xmlStrdup(token);
1496                     if (URI != NULL)
1497                         URL = xmlStrdup(URI);
1498                 }
1499                 PUSH(XSLT_OP_CHILD, name, URL);
1500             } else if (xmlStrEqual(token, (const xmlChar *) "attribute")) {
1501                 xmlFree(token);
1502                 token = xsltScanName(ctxt);
1503                 if (token == NULL) {
1504                     xsltTransformError(NULL, NULL, NULL,
1505                             "xsltCompileStepPattern : QName expected\n");
1506                     ctxt->error = 1;
1507                     goto error;
1508                 }
1509                 URI = xsltGetQNameURI(ctxt->elem, &token);
1510                 if (token == NULL) {
1511                     ctxt->error = 1;
1512                     goto error;
1513                 } else {
1514                     name = xmlStrdup(token);
1515                     if (URI != NULL)
1516                         URL = xmlStrdup(URI);
1517                 }
1518                 PUSH(XSLT_OP_ATTR, name, URL);
1519             } else {
1520                 xsltTransformError(NULL, NULL, NULL,
1521                     "xsltCompileStepPattern : 'child' or 'attribute' expected\n");
1522                 ctxt->error = 1;
1523                 goto error;
1524             }
1525             xmlFree(token);
1526         }
1527     } else if (CUR == '*') {
1528         NEXT;
1529         PUSH(XSLT_OP_ALL, token, NULL);
1530     } else {
1531         URI = xsltGetQNameURI(ctxt->elem, &token);
1532         if (token == NULL) {
1533             ctxt->error = 1;
1534             goto error;
1535         }
1536         if (URI != NULL)
1537             URL = xmlStrdup(URI);
1538         PUSH(XSLT_OP_ELEM, token, URL);
1539     }
1540 parse_predicate:
1541     SKIP_BLANKS;
1542     level = 0;
1543     while (CUR == '[') {
1544         const xmlChar *q;
1545         xmlChar *ret = NULL;
1546
1547         level++;
1548         NEXT;
1549         q = CUR_PTR;
1550         while (CUR != 0) {
1551             /* Skip over nested predicates */
1552             if (CUR == '[')
1553                 level++;
1554             else if (CUR == ']') {
1555                 level--;
1556                 if (level == 0)
1557                     break;
1558             } else if (CUR == '"') {
1559                 NEXT;
1560                 while ((CUR != 0) && (CUR != '"'))
1561                     NEXT;
1562             } else if (CUR == '\'') {
1563                 NEXT;
1564                 while ((CUR != 0) && (CUR != '\''))
1565                     NEXT;
1566             }
1567             NEXT;
1568         }
1569         if (CUR == 0) {
1570             xsltTransformError(NULL, NULL, NULL,
1571                     "xsltCompileStepPattern : ']' expected\n");
1572             ctxt->error = 1;
1573             return;
1574         }
1575         ret = xmlStrndup(q, CUR_PTR - q);
1576         PUSH(XSLT_OP_PREDICATE, ret, NULL);
1577         /* push the predicate lower than local test */
1578         SWAP();
1579         NEXT;
1580         SKIP_BLANKS;
1581     }
1582     return;
1583 error:
1584     if (token != NULL)
1585         xmlFree(token);
1586     if (name != NULL)
1587         xmlFree(name);
1588 }
1589
1590 /**
1591  * xsltCompileRelativePathPattern:
1592  * @comp:  the compilation context
1593  * @token:  a posible precompiled name
1594  *
1595  * Compile the XSLT RelativePathPattern and generates a precompiled
1596  * form suitable for fast matching.
1597  *
1598  * [4] RelativePathPattern ::= StepPattern
1599  *                           | RelativePathPattern '/' StepPattern
1600  *                           | RelativePathPattern '//' StepPattern
1601  */
1602 static void
1603 xsltCompileRelativePathPattern(xsltParserContextPtr ctxt, xmlChar *token) {
1604     xsltCompileStepPattern(ctxt, token);
1605     if (ctxt->error)
1606         goto error;
1607     SKIP_BLANKS;
1608     while ((CUR != 0) && (CUR != '|')) {
1609         if ((CUR == '/') && (NXT(1) == '/')) {
1610             PUSH(XSLT_OP_ANCESTOR, NULL, NULL);
1611             NEXT;
1612             NEXT;
1613             SKIP_BLANKS;
1614             xsltCompileStepPattern(ctxt, NULL);
1615         } else if (CUR == '/') {
1616             PUSH(XSLT_OP_PARENT, NULL, NULL);
1617             NEXT;
1618             SKIP_BLANKS;
1619             if ((CUR != 0) || (CUR == '|')) {
1620                 xsltCompileRelativePathPattern(ctxt, NULL);
1621             }
1622         } else {
1623             ctxt->error = 1;
1624         }
1625         if (ctxt->error)
1626             goto error;
1627         SKIP_BLANKS;
1628     }
1629 error:
1630     return;
1631 }
1632
1633 /**
1634  * xsltCompileLocationPathPattern:
1635  * @ctxt:  the compilation context
1636  *
1637  * Compile the XSLT LocationPathPattern and generates a precompiled
1638  * form suitable for fast matching.
1639  *
1640  * [2] LocationPathPattern ::= '/' RelativePathPattern?
1641  *                           | IdKeyPattern (('/' | '//') RelativePathPattern)?
1642  *                           | '//'? RelativePathPattern
1643  */
1644 static void
1645 xsltCompileLocationPathPattern(xsltParserContextPtr ctxt) {
1646     SKIP_BLANKS;
1647     if ((CUR == '/') && (NXT(1) == '/')) {
1648         /*
1649          * since we reverse the query
1650          * a leading // can be safely ignored
1651          */
1652         NEXT;
1653         NEXT;
1654         ctxt->comp->priority = 0.5;     /* '//' means not 0 priority */
1655         xsltCompileRelativePathPattern(ctxt, NULL);
1656     } else if (CUR == '/') {
1657         /*
1658          * We need to find root as the parent
1659          */
1660         NEXT;
1661         SKIP_BLANKS;
1662         PUSH(XSLT_OP_ROOT, NULL, NULL);
1663         if ((CUR != 0) || (CUR == '|')) {
1664             PUSH(XSLT_OP_PARENT, NULL, NULL);
1665             xsltCompileRelativePathPattern(ctxt, NULL);
1666         }
1667     } else if (CUR == '*') {
1668         xsltCompileRelativePathPattern(ctxt, NULL);
1669     } else if (CUR == '@') {
1670         xsltCompileRelativePathPattern(ctxt, NULL);
1671     } else {
1672         xmlChar *name;
1673         name = xsltScanName(ctxt);
1674         if (name == NULL) {
1675             xsltTransformError(NULL, NULL, NULL,
1676                     "xsltCompileLocationPathPattern : Name expected\n");
1677             ctxt->error = 1;
1678             return;
1679         }
1680         SKIP_BLANKS;
1681         if ((CUR == '(') && !xmlXPathIsNodeType(name)) {
1682             xsltCompileIdKeyPattern(ctxt, name, 1);
1683             if ((CUR == '/') && (NXT(1) == '/')) {
1684                 PUSH(XSLT_OP_ANCESTOR, NULL, NULL);
1685                 NEXT;
1686                 NEXT;
1687                 SKIP_BLANKS;
1688                 xsltCompileRelativePathPattern(ctxt, NULL);
1689             } else if (CUR == '/') {
1690                 PUSH(XSLT_OP_PARENT, NULL, NULL);
1691                 NEXT;
1692                 SKIP_BLANKS;
1693                 xsltCompileRelativePathPattern(ctxt, NULL);
1694             }
1695             return;
1696         }
1697         xsltCompileRelativePathPattern(ctxt, name);
1698     }
1699 error:
1700     return;
1701 }
1702
1703 /**
1704  * xsltCompilePattern:
1705  * @pattern: an XSLT pattern
1706  * @doc:  the containing document
1707  * @node:  the containing element
1708  * @style:  the stylesheet
1709  * @runtime:  the transformation context, if done at run-time
1710  *
1711  * Compile the XSLT pattern and generates a list of precompiled form suitable
1712  * for fast matching.
1713  *
1714  * [1] Pattern ::= LocationPathPattern | Pattern '|' LocationPathPattern
1715  *
1716  * Returns the generated pattern list or NULL in case of failure
1717  */
1718
1719 xsltCompMatchPtr
1720 xsltCompilePattern(const xmlChar *pattern, xmlDocPtr doc,
1721                    xmlNodePtr node, xsltStylesheetPtr style,
1722                    xsltTransformContextPtr runtime) {
1723     xsltParserContextPtr ctxt = NULL;
1724     xsltCompMatchPtr element, first = NULL, previous = NULL;
1725     int current, start, end, level, j;
1726
1727     if (pattern == NULL) {
1728         xsltTransformError(NULL, NULL, node,
1729                          "xsltCompilePattern : NULL pattern\n");
1730         return(NULL);
1731     }
1732
1733     ctxt = xsltNewParserContext(style, runtime);
1734     if (ctxt == NULL)
1735         return(NULL);
1736     ctxt->doc = doc;
1737     ctxt->elem = node;
1738     current = end = 0;
1739     while (pattern[current] != 0) {
1740         start = current;
1741         while (IS_BLANK_CH(pattern[current]))
1742             current++;
1743         end = current;
1744         level = 0;
1745         while ((pattern[end] != 0) && ((pattern[end] != '|') || (level != 0))) {
1746             if (pattern[end] == '[')
1747                 level++;
1748             else if (pattern[end] == ']')
1749                 level--;
1750             else if (pattern[end] == '\'') {
1751                 end++;
1752                 while ((pattern[end] != 0) && (pattern[end] != '\''))
1753                     end++;
1754             } else if (pattern[end] == '"') {
1755                 end++;
1756                 while ((pattern[end] != 0) && (pattern[end] != '"'))
1757                     end++;
1758             }
1759             end++;
1760         }
1761         if (current == end) {
1762             xsltTransformError(NULL, NULL, node,
1763                              "xsltCompilePattern : NULL pattern\n");
1764             goto error;
1765         }
1766         element = xsltNewCompMatch();
1767         if (element == NULL) {
1768             goto error;
1769         }
1770         if (first == NULL)
1771             first = element;
1772         else if (previous != NULL)
1773             previous->next = element;
1774         previous = element;
1775
1776         ctxt->comp = element;
1777         ctxt->base = xmlStrndup(&pattern[start], end - start);
1778         if (ctxt->base == NULL)
1779             goto error;
1780         ctxt->cur = &(ctxt->base)[current - start];
1781         element->pattern = ctxt->base;
1782         element->nsList = xmlGetNsList(doc, node);
1783         j = 0;
1784         if (element->nsList != NULL) {
1785             while (element->nsList[j] != NULL)
1786                 j++;
1787         }
1788         element->nsNr = j;
1789
1790
1791 #ifdef WITH_XSLT_DEBUG_PATTERN
1792         xsltGenericDebug(xsltGenericDebugContext,
1793                          "xsltCompilePattern : parsing '%s'\n",
1794                          element->pattern);
1795 #endif
1796         /*
1797          Preset default priority to be zero.
1798          This may be changed by xsltCompileLocationPathPattern.
1799          */
1800         element->priority = 0;
1801         xsltCompileLocationPathPattern(ctxt);
1802         if (ctxt->error) {
1803             xsltTransformError(NULL, style, node,
1804                              "xsltCompilePattern : failed to compile '%s'\n",
1805                              element->pattern);
1806             if (style != NULL) style->errors++;
1807             goto error;
1808         }
1809
1810         /*
1811          * Reverse for faster interpretation.
1812          */
1813         xsltReverseCompMatch(element);
1814
1815         /*
1816          * Set-up the priority
1817          */
1818         if (element->priority == 0) {   /* if not yet determined */
1819             if (((element->steps[0].op == XSLT_OP_ELEM) ||
1820                  (element->steps[0].op == XSLT_OP_ATTR) ||
1821                  (element->steps[0].op == XSLT_OP_PI)) &&
1822                 (element->steps[0].value != NULL) &&
1823                 (element->steps[1].op == XSLT_OP_END)) {
1824                 ;       /* previously preset */
1825             } else if ((element->steps[0].op == XSLT_OP_ATTR) &&
1826                        (element->steps[0].value2 != NULL) &&
1827                        (element->steps[1].op == XSLT_OP_END)) {
1828                         element->priority = -0.25;
1829             } else if ((element->steps[0].op == XSLT_OP_NS) &&
1830                        (element->steps[0].value != NULL) &&
1831                        (element->steps[1].op == XSLT_OP_END)) {
1832                         element->priority = -0.25;
1833             } else if ((element->steps[0].op == XSLT_OP_ATTR) &&
1834                        (element->steps[0].value == NULL) &&
1835                        (element->steps[0].value2 == NULL) &&
1836                        (element->steps[1].op == XSLT_OP_END)) {
1837                         element->priority = -0.5;
1838             } else if (((element->steps[0].op == XSLT_OP_PI) ||
1839                        (element->steps[0].op == XSLT_OP_TEXT) ||
1840                        (element->steps[0].op == XSLT_OP_ALL) ||
1841                        (element->steps[0].op == XSLT_OP_NODE) ||
1842                        (element->steps[0].op == XSLT_OP_COMMENT)) &&
1843                        (element->steps[1].op == XSLT_OP_END)) {
1844                         element->priority = -0.5;
1845             } else {
1846                 element->priority = 0.5;
1847             }
1848         }
1849 #ifdef WITH_XSLT_DEBUG_PATTERN
1850         xsltGenericDebug(xsltGenericDebugContext,
1851                      "xsltCompilePattern : parsed %s, default priority %f\n",
1852                          element->pattern, element->priority);
1853 #endif
1854         if (pattern[end] == '|')
1855             end++;
1856         current = end;
1857     }
1858     if (end == 0) {
1859         xsltTransformError(NULL, style, node,
1860                          "xsltCompilePattern : NULL pattern\n");
1861         if (style != NULL) style->errors++;
1862         goto error;
1863     }
1864
1865     xsltFreeParserContext(ctxt);
1866     return(first);
1867
1868 error:
1869     if (ctxt != NULL)
1870         xsltFreeParserContext(ctxt);
1871     if (first != NULL)
1872         xsltFreeCompMatchList(first);
1873     return(NULL);
1874 }
1875
1876 /************************************************************************
1877  *                                                                      *
1878  *                      Module interfaces                               *
1879  *                                                                      *
1880  ************************************************************************/
1881
1882 /**
1883  * xsltAddTemplate:
1884  * @style: an XSLT stylesheet
1885  * @cur: an XSLT template
1886  * @mode:  the mode name or NULL
1887  * @modeURI:  the mode URI or NULL
1888  *
1889  * Register the XSLT pattern associated to @cur
1890  *
1891  * Returns -1 in case of error, 0 otherwise
1892  */
1893 int
1894 xsltAddTemplate(xsltStylesheetPtr style, xsltTemplatePtr cur,
1895                 const xmlChar *mode, const xmlChar *modeURI) {
1896     xsltCompMatchPtr pat, list, *top = NULL, next;
1897     const xmlChar *name = NULL;
1898     float priority;              /* the priority */
1899
1900     if ((style == NULL) || (cur == NULL) || (cur->match == NULL))
1901         return(-1);
1902
1903     priority = cur->priority;
1904     pat = xsltCompilePattern(cur->match, style->doc, cur->elem, style, NULL);
1905     while (pat) {
1906         next = pat->next;
1907         pat->next = NULL;
1908         name = NULL;
1909
1910         pat->template = cur;
1911         if (mode != NULL)
1912             pat->mode = xmlStrdup(mode);
1913         if (modeURI != NULL)
1914             pat->modeURI = xmlStrdup(modeURI);
1915         if (priority != XSLT_PAT_NO_PRIORITY)
1916             pat->priority = priority;
1917
1918         /*
1919          * insert it in the hash table list corresponding to its lookup name
1920          */
1921         switch (pat->steps[0].op) {
1922         case XSLT_OP_ATTR:
1923             if (pat->steps[0].value != NULL)
1924                 name = pat->steps[0].value;
1925             else
1926                 top = (xsltCompMatchPtr *) &(style->attrMatch);
1927             break;
1928         case XSLT_OP_CHILD:
1929         case XSLT_OP_PARENT:
1930         case XSLT_OP_ANCESTOR:
1931             top = (xsltCompMatchPtr *) &(style->elemMatch);
1932             break;
1933         case XSLT_OP_ROOT:
1934             top = (xsltCompMatchPtr *) &(style->rootMatch);
1935             break;
1936         case XSLT_OP_KEY:
1937             top = (xsltCompMatchPtr *) &(style->keyMatch);
1938             break;
1939         case XSLT_OP_ID:
1940             /* TODO optimize ID !!! */
1941         case XSLT_OP_NS:
1942         case XSLT_OP_ALL:
1943             top = (xsltCompMatchPtr *) &(style->elemMatch);
1944             break;
1945         case XSLT_OP_END:
1946         case XSLT_OP_PREDICATE:
1947             xsltTransformError(NULL, style, NULL,
1948                              "xsltAddTemplate: invalid compiled pattern\n");
1949             xsltFreeCompMatch(pat);
1950             return(-1);
1951             /*
1952              * TODO: some flags at the top level about type based patterns
1953              *       would be faster than inclusion in the hash table.
1954              */
1955         case XSLT_OP_PI:
1956             if (pat->steps[0].value != NULL)
1957                 name = pat->steps[0].value;
1958             else
1959                 top = (xsltCompMatchPtr *) &(style->piMatch);
1960             break;
1961         case XSLT_OP_COMMENT:
1962             top = (xsltCompMatchPtr *) &(style->commentMatch);
1963             break;
1964         case XSLT_OP_TEXT:
1965             top = (xsltCompMatchPtr *) &(style->textMatch);
1966             break;
1967         case XSLT_OP_ELEM:
1968         case XSLT_OP_NODE:
1969             if (pat->steps[0].value != NULL)
1970                 name = pat->steps[0].value;
1971             else
1972                 top = (xsltCompMatchPtr *) &(style->elemMatch);
1973             break;
1974         }
1975         if (name != NULL) {
1976             if (style->templatesHash == NULL) {
1977                 style->templatesHash = xmlHashCreate(1024);
1978                 if (style->templatesHash == NULL) {
1979                     xsltFreeCompMatch(pat);
1980                     return(-1);
1981                 }
1982                 xmlHashAddEntry3(style->templatesHash, name, mode, modeURI, pat);
1983             } else {
1984                 list = (xsltCompMatchPtr) xmlHashLookup3(style->templatesHash,
1985                                                          name, mode, modeURI);
1986                 if (list == NULL) {
1987                     xmlHashAddEntry3(style->templatesHash, name,
1988                                      mode, modeURI, pat);
1989                 } else {
1990                     /*
1991                      * Note '<=' since one must choose among the matching
1992                      * template rules that are left, the one that occurs
1993                      * last in the stylesheet
1994                      */
1995                     if (list->priority <= pat->priority) {
1996                         pat->next = list;
1997                         xmlHashUpdateEntry3(style->templatesHash, name,
1998                                             mode, modeURI, pat, NULL);
1999                     } else {
2000                         while (list->next != NULL) {
2001                             if (list->next->priority <= pat->priority)
2002                                 break;
2003                             list = list->next;
2004                         }
2005                         pat->next = list->next;
2006                         list->next = pat;
2007                     }
2008                 }
2009             }
2010         } else if (top != NULL) {
2011             list = *top;
2012             if (list == NULL) {
2013                 *top = pat;
2014                 pat->next = NULL;
2015             } else if (list->priority <= pat->priority) {
2016                 pat->next = list;
2017                 *top = pat;
2018             } else {
2019                 while (list->next != NULL) {
2020                     if (list->next->priority <= pat->priority)
2021                         break;
2022                     list = list->next;
2023                 }
2024                 pat->next = list->next;
2025                 list->next = pat;
2026             }
2027         } else {
2028             xsltTransformError(NULL, style, NULL,
2029                              "xsltAddTemplate: invalid compiled pattern\n");
2030             xsltFreeCompMatch(pat);
2031             return(-1);
2032         }
2033 #ifdef WITH_XSLT_DEBUG_PATTERN
2034         if (mode)
2035             xsltGenericDebug(xsltGenericDebugContext,
2036                          "added pattern : '%s' mode '%s' priority %f\n",
2037                              pat->pattern, pat->mode, pat->priority);
2038         else
2039             xsltGenericDebug(xsltGenericDebugContext,
2040                          "added pattern : '%s' priority %f\n",
2041                              pat->pattern, pat->priority);
2042 #endif
2043
2044         pat = next;
2045     }
2046     return(0);
2047 }
2048
2049 /**
2050  * xsltGetTemplate:
2051  * @ctxt:  a XSLT process context
2052  * @node:  the node being processed
2053  * @style:  the current style
2054  *
2055  * Finds the template applying to this node, if @style is non-NULL
2056  * it means one needs to look for the next imported template in scope.
2057  *
2058  * Returns the xsltTemplatePtr or NULL if not found
2059  */
2060 xsltTemplatePtr
2061 xsltGetTemplate(xsltTransformContextPtr ctxt, xmlNodePtr node,
2062                 xsltStylesheetPtr style) {
2063     xsltStylesheetPtr curstyle;
2064     xsltTemplatePtr ret = NULL;
2065     const xmlChar *name = NULL;
2066     xsltCompMatchPtr list = NULL;
2067     float priority;
2068     int keyed = 0;
2069
2070     if ((ctxt == NULL) || (node == NULL))
2071         return(NULL);
2072
2073     if (style == NULL) {
2074         curstyle = ctxt->style;
2075     } else {
2076         curstyle = xsltNextImport(style);
2077     }
2078
2079     while ((curstyle != NULL) && (curstyle != style)) {
2080         priority = XSLT_PAT_NO_PRIORITY;
2081         /* TODO : handle IDs/keys here ! */
2082         if (curstyle->templatesHash != NULL) {
2083             /*
2084              * Use the top name as selector
2085              */
2086             switch (node->type) {
2087                 case XML_ELEMENT_NODE:
2088                     if (node->name[0] == ' ')
2089                         break;
2090                 case XML_ATTRIBUTE_NODE:
2091                 case XML_PI_NODE:
2092                     name = node->name;
2093                     break;
2094                 case XML_DOCUMENT_NODE:
2095                 case XML_HTML_DOCUMENT_NODE:
2096                 case XML_TEXT_NODE:
2097                 case XML_CDATA_SECTION_NODE:
2098                 case XML_COMMENT_NODE:
2099                 case XML_ENTITY_REF_NODE:
2100                 case XML_ENTITY_NODE:
2101                 case XML_DOCUMENT_TYPE_NODE:
2102                 case XML_DOCUMENT_FRAG_NODE:
2103                 case XML_NOTATION_NODE:
2104                 case XML_DTD_NODE:
2105                 case XML_ELEMENT_DECL:
2106                 case XML_ATTRIBUTE_DECL:
2107                 case XML_ENTITY_DECL:
2108                 case XML_NAMESPACE_DECL:
2109                 case XML_XINCLUDE_START:
2110                 case XML_XINCLUDE_END:
2111                     break;
2112                 default:
2113                     return(NULL);
2114
2115             }
2116         }
2117         if (name != NULL) {
2118             /*
2119              * find the list of appliable expressions based on the name
2120              */
2121             list = (xsltCompMatchPtr) xmlHashLookup3(curstyle->templatesHash,
2122                                              name, ctxt->mode, ctxt->modeURI);
2123         } else
2124             list = NULL;
2125         while (list != NULL) {
2126             if (xsltTestCompMatch(ctxt, list, node,
2127                                   ctxt->mode, ctxt->modeURI)) {
2128                 ret = list->template;
2129                 priority = list->priority;
2130                 break;
2131             }
2132             list = list->next;
2133         }
2134         list = NULL;
2135
2136         /*
2137          * find alternate generic matches
2138          */
2139         switch (node->type) {
2140             case XML_ELEMENT_NODE:
2141                 if (node->name[0] == ' ')
2142                     list = curstyle->rootMatch;
2143                 else
2144                     list = curstyle->elemMatch;
2145                 if (node->psvi != NULL) keyed = 1;
2146                 break;
2147             case XML_ATTRIBUTE_NODE: {
2148                 xmlAttrPtr attr;
2149
2150                 list = curstyle->attrMatch;
2151                 attr = (xmlAttrPtr) node;
2152                 if (attr->psvi != NULL) keyed = 1;
2153                 break;
2154             }
2155             case XML_PI_NODE:
2156                 list = curstyle->piMatch;
2157                 if (node->psvi != NULL) keyed = 1;
2158                 break;
2159             case XML_DOCUMENT_NODE:
2160             case XML_HTML_DOCUMENT_NODE: {
2161                 xmlDocPtr doc;
2162
2163                 list = curstyle->rootMatch;
2164                 doc = (xmlDocPtr) node;
2165                 if (doc->psvi != NULL) keyed = 1;
2166                 break;
2167             }
2168             case XML_TEXT_NODE:
2169             case XML_CDATA_SECTION_NODE:
2170                 list = curstyle->textMatch;
2171                 if (node->psvi != NULL) keyed = 1;
2172                 break;
2173             case XML_COMMENT_NODE:
2174                 list = curstyle->commentMatch;
2175                 if (node->psvi != NULL) keyed = 1;
2176                 break;
2177             case XML_ENTITY_REF_NODE:
2178             case XML_ENTITY_NODE:
2179             case XML_DOCUMENT_TYPE_NODE:
2180             case XML_DOCUMENT_FRAG_NODE:
2181             case XML_NOTATION_NODE:
2182             case XML_DTD_NODE:
2183             case XML_ELEMENT_DECL:
2184             case XML_ATTRIBUTE_DECL:
2185             case XML_ENTITY_DECL:
2186             case XML_NAMESPACE_DECL:
2187             case XML_XINCLUDE_START:
2188             case XML_XINCLUDE_END:
2189                 break;
2190             default:
2191                 break;
2192         }
2193         while ((list != NULL) &&
2194                ((ret == NULL)  || (list->priority > priority))) {
2195             if (xsltTestCompMatch(ctxt, list, node,
2196                                   ctxt->mode, ctxt->modeURI)) {
2197                 ret = list->template;
2198                 priority = list->priority;
2199                 break;
2200             }
2201             list = list->next;
2202         }
2203         /*
2204          * Some of the tests for elements can also apply to documents
2205          */
2206         if ((node->type == XML_DOCUMENT_NODE) ||
2207             (node->type == XML_HTML_DOCUMENT_NODE) ||
2208             (node->type == XML_TEXT_NODE)) {
2209             list = curstyle->elemMatch;
2210             while ((list != NULL) &&
2211                    ((ret == NULL)  || (list->priority > priority))) {
2212                 if (xsltTestCompMatch(ctxt, list, node,
2213                                       ctxt->mode, ctxt->modeURI)) {
2214                     ret = list->template;
2215                     priority = list->priority;
2216                     break;
2217                 }
2218                 list = list->next;
2219             }
2220         } else if ((node->type == XML_PI_NODE) ||
2221                    (node->type == XML_COMMENT_NODE)) {
2222             list = curstyle->elemMatch;
2223             while ((list != NULL) &&
2224                    ((ret == NULL)  || (list->priority > priority))) {
2225                 if (xsltTestCompMatch(ctxt, list, node,
2226                                       ctxt->mode, ctxt->modeURI)) {
2227                     ret = list->template;
2228                     priority = list->priority;
2229                     break;
2230                 }
2231                 list = list->next;
2232             }
2233         }
2234
2235         if (keyed) {
2236             list = curstyle->keyMatch;
2237             while ((list != NULL) &&
2238                    ((ret == NULL)  || (list->priority > priority))) {
2239                 if (xsltTestCompMatch(ctxt, list, node,
2240                                       ctxt->mode, ctxt->modeURI)) {
2241                     ret = list->template;
2242                     priority = list->priority;
2243                     break;
2244                 }
2245                 list = list->next;
2246             }
2247         }
2248         if (ret != NULL)
2249             return(ret);
2250
2251         /*
2252          * Cycle on next curstylesheet import.
2253          */
2254         curstyle = xsltNextImport(curstyle);
2255     }
2256     return(NULL);
2257 }
2258
2259 /**
2260  * xsltCleanupTemplates:
2261  * @style: an XSLT stylesheet
2262  *
2263  * Cleanup the state of the templates used by the stylesheet and
2264  * the ones it imports.
2265  */
2266 void
2267 xsltCleanupTemplates(xsltStylesheetPtr style ATTRIBUTE_UNUSED) {
2268 }
2269
2270 /**
2271  * xsltFreeTemplateHashes:
2272  * @style: an XSLT stylesheet
2273  *
2274  * Free up the memory used by xsltAddTemplate/xsltGetTemplate mechanism
2275  */
2276 void
2277 xsltFreeTemplateHashes(xsltStylesheetPtr style) {
2278     if (style->templatesHash != NULL)
2279         xmlHashFree((xmlHashTablePtr) style->templatesHash,
2280                     (xmlHashDeallocator) xsltFreeCompMatchList);
2281     if (style->rootMatch != NULL)
2282         xsltFreeCompMatchList(style->rootMatch);
2283     if (style->keyMatch != NULL)
2284         xsltFreeCompMatchList(style->keyMatch);
2285     if (style->elemMatch != NULL)
2286         xsltFreeCompMatchList(style->elemMatch);
2287     if (style->attrMatch != NULL)
2288         xsltFreeCompMatchList(style->attrMatch);
2289     if (style->parentMatch != NULL)
2290         xsltFreeCompMatchList(style->parentMatch);
2291     if (style->textMatch != NULL)
2292         xsltFreeCompMatchList(style->textMatch);
2293     if (style->piMatch != NULL)
2294         xsltFreeCompMatchList(style->piMatch);
2295     if (style->commentMatch != NULL)
2296         xsltFreeCompMatchList(style->commentMatch);
2297 }
2298