includes/parser/Preprocessor_Hash.php

   1 <?php
   2 /**
   3  * Preprocessor using PHP arrays
   4  *
   5  * This program is free software; you can redistribute it and/or modify
   6  * it under the terms of the GNU General Public License as published by
   7  * the Free Software Foundation; either version 2 of the License, or
   8  * (at your option) any later version.
   9  *
  10  * This program is distributed in the hope that it will be useful,
  11  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13  * GNU General Public License for more details.
  14  *
  15  * You should have received a copy of the GNU General Public License along
  16  * with this program; if not, write to the Free Software Foundation, Inc.,
  17  * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
  18  * http://www.gnu.org/copyleft/gpl.html
  19  *
  20  * @file
  21  * @ingroup Parser
  22  */
  23
  24 /**
  25  * Differences from DOM schema:
  26  *   * attribute nodes are children
  27  *   * "<h>" nodes that aren't at the top are replaced with <possible-h>
  28  * @ingroup Parser
  29  */
  30 class Preprocessor_Hash implements Preprocessor {
  31         /**
  32          * @var Parser
  33          */
  34         var $parser;
  35
  36         const CACHE_VERSION = 1;
  37
  38         function __construct( $parser ) {
  39                 $this->parser = $parser;
  40         }
  41
  42         /**
  43          * @return PPFrame_Hash
  44          */
  45         function newFrame() {
  46                 return new PPFrame_Hash( $this );
  47         }
  48
  49         /**
  50          * @param array $args
  51          * @return PPCustomFrame_Hash
  52          */
  53         function newCustomFrame( $args ) {
  54                 return new PPCustomFrame_Hash( $this, $args );
  55         }
  56
  57         /**
  58          * @param array $values
  59          * @return PPNode_Hash_Array
  60          */
  61         function newPartNodeArray( $values ) {
  62                 $list = array();
  63
  64                 foreach ( $values as $k => $val ) {
  65                         $partNode = new PPNode_Hash_Tree( 'part' );
  66                         $nameNode = new PPNode_Hash_Tree( 'name' );
  67
  68                         if ( is_int( $k ) ) {
  69                                 $nameNode->addChild( new PPNode_Hash_Attr( 'index', $k ) );
  70                                 $partNode->addChild( $nameNode );
  71                         } else {
  72                                 $nameNode->addChild( new PPNode_Hash_Text( $k ) );
  73                                 $partNode->addChild( $nameNode );
  74                                 $partNode->addChild( new PPNode_Hash_Text( '=' ) );
  75                         }
  76
  77                         $valueNode = new PPNode_Hash_Tree( 'value' );
  78                         $valueNode->addChild( new PPNode_Hash_Text( $val ) );
  79                         $partNode->addChild( $valueNode );
  80
  81                         $list[] = $partNode;
  82                 }
  83
  84                 $node = new PPNode_Hash_Array( $list );
  85                 return $node;
  86         }
  87
  88         /**
  89          * Preprocess some wikitext and return the document tree.
  90          * This is the ghost of Parser::replace_variables().
  91          *
  92          * @param string $text The text to parse
  93          * @param int $flags Bitwise combination of:
  94          *    Parser::PTD_FOR_INCLUSION    Handle "<noinclude>" and "<includeonly>" as if the text is being
  95          *                                 included. Default is to assume a direct page view.
  96          *
  97          * The generated DOM tree must depend only on the input text and the flags.
  98          * The DOM tree must be the same in OT_HTML and OT_WIKI mode, to avoid a regression of bug 4899.
  99          *
 100          * Any flag added to the $flags parameter here, or any other parameter liable to cause a
 101          * change in the DOM tree for a given text, must be passed through the section identifier
 102          * in the section edit link and thus back to extractSections().
 103          *
 104          * The output of this function is currently only cached in process memory, but a persistent
 105          * cache may be implemented at a later date which takes further advantage of these strict
 106          * dependency requirements.
 107          *
 108          * @throws MWException
 109          * @return PPNode_Hash_Tree
 110          */
 111         function preprocessToObj( $text, $flags = 0 ) {
 112                 wfProfileIn( __METHOD__ );
 113
 114                 // Check cache.
 115                 global $wgMemc, $wgPreprocessorCacheThreshold;
 116
 117                 $cacheable = $wgPreprocessorCacheThreshold !== false
 118                         && strlen( $text ) > $wgPreprocessorCacheThreshold;
 119
 120                 if ( $cacheable ) {
 121                         wfProfileIn( __METHOD__ . '-cacheable' );
 122
 123                         $cacheKey = wfMemcKey( 'preprocess-hash', md5( $text ), $flags );
 124                         $cacheValue = $wgMemc->get( $cacheKey );
 125                         if ( $cacheValue ) {
 126                                 $version = substr( $cacheValue, 0, 8 );
 127                                 if ( intval( $version ) == self::CACHE_VERSION ) {
 128                                         $hash = unserialize( substr( $cacheValue, 8 ) );
 129                                         // From the cache
 130                                         wfDebugLog( "Preprocessor",
 131                                                 "Loaded preprocessor hash from memcached (key $cacheKey)" );
 132                                         wfProfileOut( __METHOD__ . '-cacheable' );
 133                                         wfProfileOut( __METHOD__ );
 134                                         return $hash;
 135                                 }
 136                         }
 137                         wfProfileIn( __METHOD__ . '-cache-miss' );
 138                 }
 139
 140                 $rules = array(
 141                         '{' => array(
 142                                 'end' => '}',
 143                                 'names' => array(
 144                                         2 => 'template',
 145                                         3 => 'tplarg',
 146                                 ),
 147                                 'min' => 2,
 148                                 'max' => 3,
 149                         ),
 150                         '[' => array(
 151                                 'end' => ']',
 152                                 'names' => array( 2 => null ),
 153                                 'min' => 2,
 154                                 'max' => 2,
 155                         )
 156                 );
 157
 158                 $forInclusion = $flags & Parser::PTD_FOR_INCLUSION;
 159
 160                 $xmlishElements = $this->parser->getStripList();
 161                 $enableOnlyinclude = false;
 162                 if ( $forInclusion ) {
 163                         $ignoredTags = array( 'includeonly', '/includeonly' );
 164                         $ignoredElements = array( 'noinclude' );
 165                         $xmlishElements[] = 'noinclude';
 166                         if ( strpos( $text, '<onlyinclude>' ) !== false
 167                                 && strpos( $text, '</onlyinclude>' ) !== false
 168                         ) {
 169                                 $enableOnlyinclude = true;
 170                         }
 171                 } else {
 172                         $ignoredTags = array( 'noinclude', '/noinclude', 'onlyinclude', '/onlyinclude' );
 173                         $ignoredElements = array( 'includeonly' );
 174                         $xmlishElements[] = 'includeonly';
 175                 }
 176                 $xmlishRegex = implode( '|', array_merge( $xmlishElements, $ignoredTags ) );
 177
 178                 // Use "A" modifier (anchored) instead of "^", because ^ doesn't work with an offset
 179                 $elementsRegex = "~($xmlishRegex)(?:\s|\/>|>)|(!--)~iA";
 180
 181                 $stack = new PPDStack_Hash;
 182
 183                 $searchBase = "[{<\n";
 184                 // For fast reverse searches
 185                 $revText = strrev( $text );
 186                 $lengthText = strlen( $text );
 187
 188                 // Input pointer, starts out pointing to a pseudo-newline before the start
 189                 $i = 0;
 190                 // Current accumulator
 191                 $accum =& $stack->getAccum();
 192                 // True to find equals signs in arguments
 193                 $findEquals = false;
 194                 // True to take notice of pipe characters
 195                 $findPipe = false;
 196                 $headingIndex = 1;
 197                 // True if $i is inside a possible heading
 198                 $inHeading = false;
 199                 // True if there are no more greater-than (>) signs right of $i
 200                 $noMoreGT = false;
 201                 // True to ignore all input up to the next <onlyinclude>
 202                 $findOnlyinclude = $enableOnlyinclude;
 203                 // Do a line-start run without outputting an LF character
 204                 $fakeLineStart = true;
 205
 206                 while ( true ) {
 207                         //$this->memCheck();
 208
 209                         if ( $findOnlyinclude ) {
 210                                 // Ignore all input up to the next <onlyinclude>
 211                                 $startPos = strpos( $text, '<onlyinclude>', $i );
 212                                 if ( $startPos === false ) {
 213                                         // Ignored section runs to the end
 214                                         $accum->addNodeWithText( 'ignore', substr( $text, $i ) );
 215                                         break;
 216                                 }
 217                                 $tagEndPos = $startPos + strlen( '<onlyinclude>' ); // past-the-end
 218                                 $accum->addNodeWithText( 'ignore', substr( $text, $i, $tagEndPos - $i ) );
 219                                 $i = $tagEndPos;
 220                                 $findOnlyinclude = false;
 221                         }
 222
 223                         if ( $fakeLineStart ) {
 224                                 $found = 'line-start';
 225                                 $curChar = '';
 226                         } else {
 227                                 # Find next opening brace, closing brace or pipe
 228                                 $search = $searchBase;
 229                                 if ( $stack->top === false ) {
 230                                         $currentClosing = '';
 231                                 } else {
 232                                         $currentClosing = $stack->top->close;
 233                                         $search .= $currentClosing;
 234                                 }
 235                                 if ( $findPipe ) {
 236                                         $search .= '|';
 237                                 }
 238                                 if ( $findEquals ) {
 239                                         // First equals will be for the template
 240                                         $search .= '=';
 241                                 }
 242                                 $rule = null;
 243                                 # Output literal section, advance input counter
 244                                 $literalLength = strcspn( $text, $search, $i );
 245                                 if ( $literalLength > 0 ) {
 246                                         $accum->addLiteral( substr( $text, $i, $literalLength ) );
 247                                         $i += $literalLength;
 248                                 }
 249                                 if ( $i >= $lengthText ) {
 250                                         if ( $currentClosing == "\n" ) {
 251                                                 // Do a past-the-end run to finish off the heading
 252                                                 $curChar = '';
 253                                                 $found = 'line-end';
 254                                         } else {
 255                                                 # All done
 256                                                 break;
 257                                         }
 258                                 } else {
 259                                         $curChar = $text[$i];
 260                                         if ( $curChar == '|' ) {
 261                                                 $found = 'pipe';
 262                                         } elseif ( $curChar == '=' ) {
 263                                                 $found = 'equals';
 264                                         } elseif ( $curChar == '<' ) {
 265                                                 $found = 'angle';
 266                                         } elseif ( $curChar == "\n" ) {
 267                                                 if ( $inHeading ) {
 268                                                         $found = 'line-end';
 269                                                 } else {
 270                                                         $found = 'line-start';
 271                                                 }
 272                                         } elseif ( $curChar == $currentClosing ) {
 273                                                 $found = 'close';
 274                                         } elseif ( isset( $rules[$curChar] ) ) {
 275                                                 $found = 'open';
 276                                                 $rule = $rules[$curChar];
 277                                         } else {
 278                                                 # Some versions of PHP have a strcspn which stops on null characters
 279                                                 # Ignore and continue
 280                                                 ++$i;
 281                                                 continue;
 282                                         }
 283                                 }
 284                         }
 285
 286                         if ( $found == 'angle' ) {
 287                                 $matches = false;
 288                                 // Handle </onlyinclude>
 289                                 if ( $enableOnlyinclude
 290                                         && substr( $text, $i, strlen( '</onlyinclude>' ) ) == '</onlyinclude>'
 291                                 ) {
 292                                         $findOnlyinclude = true;
 293                                         continue;
 294                                 }
 295
 296                                 // Determine element name
 297                                 if ( !preg_match( $elementsRegex, $text, $matches, 0, $i + 1 ) ) {
 298                                         // Element name missing or not listed
 299                                         $accum->addLiteral( '<' );
 300                                         ++$i;
 301                                         continue;
 302                                 }
 303                                 // Handle comments
 304                                 if ( isset( $matches[2] ) && $matches[2] == '!--' ) {
 305
 306                                         // To avoid leaving blank lines, when a sequence of
 307                                         // space-separated comments is both preceded and followed by
 308                                         // a newline (ignoring spaces), then
 309                                         // trim leading and trailing spaces and the trailing newline.
 310
 311                                         // Find the end
 312                                         $endPos = strpos( $text, '-->', $i + 4 );
 313                                         if ( $endPos === false ) {
 314                                                 // Unclosed comment in input, runs to end
 315                                                 $inner = substr( $text, $i );
 316                                                 $accum->addNodeWithText( 'comment', $inner );
 317                                                 $i = $lengthText;
 318                                         } else {
 319                                                 // Search backwards for leading whitespace
 320                                                 $wsStart = $i ? ( $i - strspn( $revText, " \t", $lengthText - $i ) ) : 0;
 321
 322                                                 // Search forwards for trailing whitespace
 323                                                 // $wsEnd will be the position of the last space (or the '>' if there's none)
 324                                                 $wsEnd = $endPos + 2 + strspn( $text, " \t", $endPos + 3 );
 325
 326                                                 // Keep looking forward as long as we're finding more
 327                                                 // comments.
 328                                                 $comments = array( array( $wsStart, $wsEnd ) );
 329                                                 while ( substr( $text, $wsEnd + 1, 4 ) == '<!--' ) {
 330                                                         $c = strpos( $text, '-->', $wsEnd + 4 );
 331                                                         if ( $c === false ) {
 332                                                                 break;
 333                                                         }
 334                                                         $c = $c + 2 + strspn( $text, " \t", $c + 3 );
 335                                                         $comments[] = array( $wsEnd + 1, $c );
 336                                                         $wsEnd = $c;
 337                                                 }
 338
 339                                                 // Eat the line if possible
 340                                                 // TODO: This could theoretically be done if $wsStart == 0, i.e. for comments at
 341                                                 // the overall start. That's not how Sanitizer::removeHTMLcomments() did it, but
 342                                                 // it's a possible beneficial b/c break.
 343                                                 if ( $wsStart > 0 && substr( $text, $wsStart - 1, 1 ) == "\n"
 344                                                         && substr( $text, $wsEnd + 1, 1 ) == "\n"
 345                                                 ) {
 346                                                         // Remove leading whitespace from the end of the accumulator
 347                                                         // Sanity check first though
 348                                                         $wsLength = $i - $wsStart;
 349                                                         if ( $wsLength > 0
 350                                                                 && $accum->lastNode instanceof PPNode_Hash_Text
 351                                                                 && strspn( $accum->lastNode->value, " \t", -$wsLength ) === $wsLength
 352                                                         ) {
 353                                                                 $accum->lastNode->value = substr( $accum->lastNode->value, 0, -$wsLength );
 354                                                         }
 355
 356                                                         // Dump all but the last comment to the accumulator
 357                                                         foreach ( $comments as $j => $com ) {
 358                                                                 $startPos = $com[0];
 359                                                                 $endPos = $com[1] + 1;
 360                                                                 if ( $j == ( count( $comments ) - 1 ) ) {
 361                                                                         break;
 362                                                                 }
 363                                                                 $inner = substr( $text, $startPos, $endPos - $startPos );
 364                                                                 $accum->addNodeWithText( 'comment', $inner );
 365                                                         }
 366
 367                                                         // Do a line-start run next time to look for headings after the comment
 368                                                         $fakeLineStart = true;
 369                                                 } else {
 370                                                         // No line to eat, just take the comment itself
 371                                                         $startPos = $i;
 372                                                         $endPos += 2;
 373                                                 }
 374
 375                                                 if ( $stack->top ) {
 376                                                         $part = $stack->top->getCurrentPart();
 377                                                         if ( !( isset( $part->commentEnd ) && $part->commentEnd == $wsStart - 1 ) ) {
 378                                                                 $part->visualEnd = $wsStart;
 379                                                         }
 380                                                         // Else comments abutting, no change in visual end
 381                                                         $part->commentEnd = $endPos;
 382                                                 }
 383                                                 $i = $endPos + 1;
 384                                                 $inner = substr( $text, $startPos, $endPos - $startPos + 1 );
 385                                                 $accum->addNodeWithText( 'comment', $inner );
 386                                         }
 387                                         continue;
 388                                 }
 389                                 $name = $matches[1];
 390                                 $lowerName = strtolower( $name );
 391                                 $attrStart = $i + strlen( $name ) + 1;
 392
 393                                 // Find end of tag
 394                                 $tagEndPos = $noMoreGT ? false : strpos( $text, '>', $attrStart );
 395                                 if ( $tagEndPos === false ) {
 396                                         // Infinite backtrack
 397                                         // Disable tag search to prevent worst-case O(N^2) performance
 398                                         $noMoreGT = true;
 399                                         $accum->addLiteral( '<' );
 400                                         ++$i;
 401                                         continue;
 402                                 }
 403
 404                                 // Handle ignored tags
 405                                 if ( in_array( $lowerName, $ignoredTags ) ) {
 406                                         $accum->addNodeWithText( 'ignore', substr( $text, $i, $tagEndPos - $i + 1 ) );
 407                                         $i = $tagEndPos + 1;
 408                                         continue;
 409                                 }
 410
 411                                 $tagStartPos = $i;
 412                                 if ( $text[$tagEndPos - 1] == '/' ) {
 413                                         // Short end tag
 414                                         $attrEnd = $tagEndPos - 1;
 415                                         $inner = null;
 416                                         $i = $tagEndPos + 1;
 417                                         $close = null;
 418                                 } else {
 419                                         $attrEnd = $tagEndPos;
 420                                         // Find closing tag
 421                                         if ( preg_match( "/<\/" . preg_quote( $name, '/' ) . "\s*>/i",
 422                                                         $text, $matches, PREG_OFFSET_CAPTURE, $tagEndPos + 1 )
 423                                         ) {
 424                                                 $inner = substr( $text, $tagEndPos + 1, $matches[0][1] - $tagEndPos - 1 );
 425                                                 $i = $matches[0][1] + strlen( $matches[0][0] );
 426                                                 $close = $matches[0][0];
 427                                         } else {
 428                                                 // No end tag -- let it run out to the end of the text.
 429                                                 $inner = substr( $text, $tagEndPos + 1 );
 430                                                 $i = $lengthText;
 431                                                 $close = null;
 432                                         }
 433                                 }
 434                                 // <includeonly> and <noinclude> just become <ignore> tags
 435                                 if ( in_array( $lowerName, $ignoredElements ) ) {
 436                                         $accum->addNodeWithText( 'ignore', substr( $text, $tagStartPos, $i - $tagStartPos ) );
 437                                         continue;
 438                                 }
 439
 440                                 if ( $attrEnd <= $attrStart ) {
 441                                         $attr = '';
 442                                 } else {
 443                                         // Note that the attr element contains the whitespace between name and attribute,
 444                                         // this is necessary for precise reconstruction during pre-save transform.
 445                                         $attr = substr( $text, $attrStart, $attrEnd - $attrStart );
 446                                 }
 447
 448                                 $extNode = new PPNode_Hash_Tree( 'ext' );
 449                                 $extNode->addChild( PPNode_Hash_Tree::newWithText( 'name', $name ) );
 450                                 $extNode->addChild( PPNode_Hash_Tree::newWithText( 'attr', $attr ) );
 451                                 if ( $inner !== null ) {
 452                                         $extNode->addChild( PPNode_Hash_Tree::newWithText( 'inner', $inner ) );
 453                                 }
 454                                 if ( $close !== null ) {
 455                                         $extNode->addChild( PPNode_Hash_Tree::newWithText( 'close', $close ) );
 456                                 }
 457                                 $accum->addNode( $extNode );
 458                         } elseif ( $found == 'line-start' ) {
 459                                 // Is this the start of a heading?
 460                                 // Line break belongs before the heading element in any case
 461                                 if ( $fakeLineStart ) {
 462                                         $fakeLineStart = false;
 463                                 } else {
 464                                         $accum->addLiteral( $curChar );
 465                                         $i++;
 466                                 }
 467
 468                                 $count = strspn( $text, '=', $i, 6 );
 469                                 if ( $count == 1 && $findEquals ) {
 470                                         // DWIM: This looks kind of like a name/value separator.
 471                                         // Let's let the equals handler have it and break the potential
 472                                         // heading. This is heuristic, but AFAICT the methods for
 473                                         // completely correct disambiguation are very complex.
 474                                 } elseif ( $count > 0 ) {
 475                                         $piece = array(
 476                                                 'open' => "\n",
 477                                                 'close' => "\n",
 478                                                 'parts' => array( new PPDPart_Hash( str_repeat( '=', $count ) ) ),
 479                                                 'startPos' => $i,
 480                                                 'count' => $count );
 481                                         $stack->push( $piece );
 482                                         $accum =& $stack->getAccum();
 483                                         extract( $stack->getFlags() );
 484                                         $i += $count;
 485                                 }
 486                         } elseif ( $found == 'line-end' ) {
 487                                 $piece = $stack->top;
 488                                 // A heading must be open, otherwise \n wouldn't have been in the search list
 489                                 assert( '$piece->open == "\n"' );
 490                                 $part = $piece->getCurrentPart();
 491                                 // Search back through the input to see if it has a proper close.
 492                                 // Do this using the reversed string since the other solutions
 493                                 // (end anchor, etc.) are inefficient.
 494                                 $wsLength = strspn( $revText, " \t", $lengthText - $i );
 495                                 $searchStart = $i - $wsLength;
 496                                 if ( isset( $part->commentEnd ) && $searchStart - 1 == $part->commentEnd ) {
 497                                         // Comment found at line end
 498                                         // Search for equals signs before the comment
 499                                         $searchStart = $part->visualEnd;
 500                                         $searchStart -= strspn( $revText, " \t", $lengthText - $searchStart );
 501                                 }
 502                                 $count = $piece->count;
 503                                 $equalsLength = strspn( $revText, '=', $lengthText - $searchStart );
 504                                 if ( $equalsLength > 0 ) {
 505                                         if ( $searchStart - $equalsLength == $piece->startPos ) {
 506                                                 // This is just a single string of equals signs on its own line
 507                                                 // Replicate the doHeadings behavior /={count}(.+)={count}/
 508                                                 // First find out how many equals signs there really are (don't stop at 6)
 509                                                 $count = $equalsLength;
 510                                                 if ( $count < 3 ) {
 511                                                         $count = 0;
 512                                                 } else {
 513                                                         $count = min( 6, intval( ( $count - 1 ) / 2 ) );
 514                                                 }
 515                                         } else {
 516                                                 $count = min( $equalsLength, $count );
 517                                         }
 518                                         if ( $count > 0 ) {
 519                                                 // Normal match, output <h>
 520                                                 $element = new PPNode_Hash_Tree( 'possible-h' );
 521                                                 $element->addChild( new PPNode_Hash_Attr( 'level', $count ) );
 522                                                 $element->addChild( new PPNode_Hash_Attr( 'i', $headingIndex++ ) );
 523                                                 $element->lastChild->nextSibling = $accum->firstNode;
 524                                                 $element->lastChild = $accum->lastNode;
 525                                         } else {
 526                                                 // Single equals sign on its own line, count=0
 527                                                 $element = $accum;
 528                                         }
 529                                 } else {
 530                                         // No match, no <h>, just pass down the inner text
 531                                         $element = $accum;
 532                                 }
 533                                 // Unwind the stack
 534                                 $stack->pop();
 535                                 $accum =& $stack->getAccum();
 536                                 extract( $stack->getFlags() );
 537
 538                                 // Append the result to the enclosing accumulator
 539                                 if ( $element instanceof PPNode ) {
 540                                         $accum->addNode( $element );
 541                                 } else {
 542                                         $accum->addAccum( $element );
 543                                 }
 544                                 // Note that we do NOT increment the input pointer.
 545                                 // This is because the closing linebreak could be the opening linebreak of
 546                                 // another heading. Infinite loops are avoided because the next iteration MUST
 547                                 // hit the heading open case above, which unconditionally increments the
 548                                 // input pointer.
 549                         } elseif ( $found == 'open' ) {
 550                                 # count opening brace characters
 551                                 $count = strspn( $text, $curChar, $i );
 552
 553                                 # we need to add to stack only if opening brace count is enough for one of the rules
 554                                 if ( $count >= $rule['min'] ) {
 555                                         # Add it to the stack
 556                                         $piece = array(
 557                                                 'open' => $curChar,
 558                                                 'close' => $rule['end'],
 559                                                 'count' => $count,
 560                                                 'lineStart' => ( $i > 0 && $text[$i - 1] == "\n" ),
 561                                         );
 562
 563                                         $stack->push( $piece );
 564                                         $accum =& $stack->getAccum();
 565                                         extract( $stack->getFlags() );
 566                                 } else {
 567                                         # Add literal brace(s)
 568                                         $accum->addLiteral( str_repeat( $curChar, $count ) );
 569                                 }
 570                                 $i += $count;
 571                         } elseif ( $found == 'close' ) {
 572                                 $piece = $stack->top;
 573                                 # lets check if there are enough characters for closing brace
 574                                 $maxCount = $piece->count;
 575                                 $count = strspn( $text, $curChar, $i, $maxCount );
 576
 577                                 # check for maximum matching characters (if there are 5 closing
 578                                 # characters, we will probably need only 3 - depending on the rules)
 579                                 $rule = $rules[$piece->open];
 580                                 if ( $count > $rule['max'] ) {
 581                                         # The specified maximum exists in the callback array, unless the caller
 582                                         # has made an error
 583                                         $matchingCount = $rule['max'];
 584                                 } else {
 585                                         # Count is less than the maximum
 586                                         # Skip any gaps in the callback array to find the true largest match
 587                                         # Need to use array_key_exists not isset because the callback can be null
 588                                         $matchingCount = $count;
 589                                         while ( $matchingCount > 0 && !array_key_exists( $matchingCount, $rule['names'] ) ) {
 590                                                 --$matchingCount;
 591                                         }
 592                                 }
 593
 594                                 if ( $matchingCount <= 0 ) {
 595                                         # No matching element found in callback array
 596                                         # Output a literal closing brace and continue
 597                                         $accum->addLiteral( str_repeat( $curChar, $count ) );
 598                                         $i += $count;
 599                                         continue;
 600                                 }
 601                                 $name = $rule['names'][$matchingCount];
 602                                 if ( $name === null ) {
 603                                         // No element, just literal text
 604                                         $element = $piece->breakSyntax( $matchingCount );
 605                                         $element->addLiteral( str_repeat( $rule['end'], $matchingCount ) );
 606                                 } else {
 607                                         # Create XML element
 608                                         # Note: $parts is already XML, does not need to be encoded further
 609                                         $parts = $piece->parts;
 610                                         $titleAccum = $parts[0]->out;
 611                                         unset( $parts[0] );
 612
 613                                         $element = new PPNode_Hash_Tree( $name );
 614
 615                                         # The invocation is at the start of the line if lineStart is set in
 616                                         # the stack, and all opening brackets are used up.
 617                                         if ( $maxCount == $matchingCount && !empty( $piece->lineStart ) ) {
 618                                                 $element->addChild( new PPNode_Hash_Attr( 'lineStart', 1 ) );
 619                                         }
 620                                         $titleNode = new PPNode_Hash_Tree( 'title' );
 621                                         $titleNode->firstChild = $titleAccum->firstNode;
 622                                         $titleNode->lastChild = $titleAccum->lastNode;
 623                                         $element->addChild( $titleNode );
 624                                         $argIndex = 1;
 625                                         foreach ( $parts as $part ) {
 626                                                 if ( isset( $part->eqpos ) ) {
 627                                                         // Find equals
 628                                                         $lastNode = false;
 629                                                         for ( $node = $part->out->firstNode; $node; $node = $node->nextSibling ) {
 630                                                                 if ( $node === $part->eqpos ) {
 631                                                                         break;
 632                                                                 }
 633                                                                 $lastNode = $node;
 634                                                         }
 635                                                         if ( !$node ) {
 636                                                                 if ( $cacheable ) {
 637                                                                         wfProfileOut( __METHOD__ . '-cache-miss' );
 638                                                                         wfProfileOut( __METHOD__ . '-cacheable' );
 639                                                                 }
 640                                                                 wfProfileOut( __METHOD__ );
 641                                                                 throw new MWException( __METHOD__ . ': eqpos not found' );
 642                                                         }
 643                                                         if ( $node->name !== 'equals' ) {
 644                                                                 if ( $cacheable ) {
 645                                                                         wfProfileOut( __METHOD__ . '-cache-miss' );
 646                                                                         wfProfileOut( __METHOD__ . '-cacheable' );
 647                                                                 }
 648                                                                 wfProfileOut( __METHOD__ );
 649                                                                 throw new MWException( __METHOD__ . ': eqpos is not equals' );
 650                                                         }
 651                                                         $equalsNode = $node;
 652
 653                                                         // Construct name node
 654                                                         $nameNode = new PPNode_Hash_Tree( 'name' );
 655                                                         if ( $lastNode !== false ) {
 656                                                                 $lastNode->nextSibling = false;
 657                                                                 $nameNode->firstChild = $part->out->firstNode;
 658                                                                 $nameNode->lastChild = $lastNode;
 659                                                         }
 660
 661                                                         // Construct value node
 662                                                         $valueNode = new PPNode_Hash_Tree( 'value' );
 663                                                         if ( $equalsNode->nextSibling !== false ) {
 664                                                                 $valueNode->firstChild = $equalsNode->nextSibling;
 665                                                                 $valueNode->lastChild = $part->out->lastNode;
 666                                                         }
 667                                                         $partNode = new PPNode_Hash_Tree( 'part' );
 668                                                         $partNode->addChild( $nameNode );
 669                                                         $partNode->addChild( $equalsNode->firstChild );
 670                                                         $partNode->addChild( $valueNode );
 671                                                         $element->addChild( $partNode );
 672                                                 } else {
 673                                                         $partNode = new PPNode_Hash_Tree( 'part' );
 674                                                         $nameNode = new PPNode_Hash_Tree( 'name' );
 675                                                         $nameNode->addChild( new PPNode_Hash_Attr( 'index', $argIndex++ ) );
 676                                                         $valueNode = new PPNode_Hash_Tree( 'value' );
 677                                                         $valueNode->firstChild = $part->out->firstNode;
 678                                                         $valueNode->lastChild = $part->out->lastNode;
 679                                                         $partNode->addChild( $nameNode );
 680                                                         $partNode->addChild( $valueNode );
 681                                                         $element->addChild( $partNode );
 682                                                 }
 683                                         }
 684                                 }
 685
 686                                 # Advance input pointer
 687                                 $i += $matchingCount;
 688
 689                                 # Unwind the stack
 690                                 $stack->pop();
 691                                 $accum =& $stack->getAccum();
 692
 693                                 # Re-add the old stack element if it still has unmatched opening characters remaining
 694                                 if ( $matchingCount < $piece->count ) {
 695                                         $piece->parts = array( new PPDPart_Hash );
 696                                         $piece->count -= $matchingCount;
 697                                         # do we still qualify for any callback with remaining count?
 698                                         $min = $rules[$piece->open]['min'];
 699                                         if ( $piece->count >= $min ) {
 700                                                 $stack->push( $piece );
 701                                                 $accum =& $stack->getAccum();
 702                                         } else {
 703                                                 $accum->addLiteral( str_repeat( $piece->open, $piece->count ) );
 704                                         }
 705                                 }
 706
 707                                 extract( $stack->getFlags() );
 708
 709                                 # Add XML element to the enclosing accumulator
 710                                 if ( $element instanceof PPNode ) {
 711                                         $accum->addNode( $element );
 712                                 } else {
 713                                         $accum->addAccum( $element );
 714                                 }
 715                         } elseif ( $found == 'pipe' ) {
 716                                 $findEquals = true; // shortcut for getFlags()
 717                                 $stack->addPart();
 718                                 $accum =& $stack->getAccum();
 719                                 ++$i;
 720                         } elseif ( $found == 'equals' ) {
 721                                 $findEquals = false; // shortcut for getFlags()
 722                                 $accum->addNodeWithText( 'equals', '=' );
 723                                 $stack->getCurrentPart()->eqpos = $accum->lastNode;
 724                                 ++$i;
 725                         }
 726                 }
 727
 728                 # Output any remaining unclosed brackets
 729                 foreach ( $stack->stack as $piece ) {
 730                         $stack->rootAccum->addAccum( $piece->breakSyntax() );
 731                 }
 732
 733                 # Enable top-level headings
 734                 for ( $node = $stack->rootAccum->firstNode; $node; $node = $node->nextSibling ) {
 735                         if ( isset( $node->name ) && $node->name === 'possible-h' ) {
 736                                 $node->name = 'h';
 737                         }
 738                 }
 739
 740                 $rootNode = new PPNode_Hash_Tree( 'root' );
 741                 $rootNode->firstChild = $stack->rootAccum->firstNode;
 742                 $rootNode->lastChild = $stack->rootAccum->lastNode;
 743
 744                 // Cache
 745                 if ( $cacheable ) {
 746                         $cacheValue = sprintf( "%08d", self::CACHE_VERSION ) . serialize( $rootNode );
 747                         $wgMemc->set( $cacheKey, $cacheValue, 86400 );
 748                         wfProfileOut( __METHOD__ . '-cache-miss' );
 749                         wfProfileOut( __METHOD__ . '-cacheable' );
 750                         wfDebugLog( "Preprocessor", "Saved preprocessor Hash to memcached (key $cacheKey)" );
 751                 }
 752
 753                 wfProfileOut( __METHOD__ );
 754                 return $rootNode;
 755         }
 756 }
 757
 758 /**
 759  * Stack class to help Preprocessor::preprocessToObj()
 760  * @ingroup Parser
 761  */
 762 class PPDStack_Hash extends PPDStack {
 763         function __construct() {
 764                 $this->elementClass = 'PPDStackElement_Hash';
 765                 parent::__construct();
 766                 $this->rootAccum = new PPDAccum_Hash;
 767         }
 768 }
 769
 770 /**
 771  * @ingroup Parser
 772  */
 773 class PPDStackElement_Hash extends PPDStackElement {
 774         function __construct( $data = array() ) {
 775                 $this->partClass = 'PPDPart_Hash';
 776                 parent::__construct( $data );
 777         }
 778
 779         /**
 780          * Get the accumulator that would result if the close is not found.
 781          *
 782          * @param int|bool $openingCount
 783          * @return PPDAccum_Hash
 784          */
 785         function breakSyntax( $openingCount = false ) {
 786                 if ( $this->open == "\n" ) {
 787                         $accum = $this->parts[0]->out;
 788                 } else {
 789                         if ( $openingCount === false ) {
 790                                 $openingCount = $this->count;
 791                         }
 792                         $accum = new PPDAccum_Hash;
 793                         $accum->addLiteral( str_repeat( $this->open, $openingCount ) );
 794                         $first = true;
 795                         foreach ( $this->parts as $part ) {
 796                                 if ( $first ) {
 797                                         $first = false;
 798                                 } else {
 799                                         $accum->addLiteral( '|' );
 800                                 }
 801                                 $accum->addAccum( $part->out );
 802                         }
 803                 }
 804                 return $accum;
 805         }
 806 }
 807
 808 /**
 809  * @ingroup Parser
 810  */
 811 class PPDPart_Hash extends PPDPart {
 812         function __construct( $out = '' ) {
 813                 $accum = new PPDAccum_Hash;
 814                 if ( $out !== '' ) {
 815                         $accum->addLiteral( $out );
 816                 }
 817                 parent::__construct( $accum );
 818         }
 819 }
 820
 821 /**
 822  * @ingroup Parser
 823  */
 824 class PPDAccum_Hash {
 825         var $firstNode, $lastNode;
 826
 827         function __construct() {
 828                 $this->firstNode = $this->lastNode = false;
 829         }
 830
 831         /**
 832          * Append a string literal
 833          * @param string $s
 834          */
 835         function addLiteral( $s ) {
 836                 if ( $this->lastNode === false ) {
 837                         $this->firstNode = $this->lastNode = new PPNode_Hash_Text( $s );
 838                 } elseif ( $this->lastNode instanceof PPNode_Hash_Text ) {
 839                         $this->lastNode->value .= $s;
 840                 } else {
 841                         $this->lastNode->nextSibling = new PPNode_Hash_Text( $s );
 842                         $this->lastNode = $this->lastNode->nextSibling;
 843                 }
 844         }
 845
 846         /**
 847          * Append a PPNode
 848          * @param PPNode $node
 849          */
 850         function addNode( PPNode $node ) {
 851                 if ( $this->lastNode === false ) {
 852                         $this->firstNode = $this->lastNode = $node;
 853                 } else {
 854                         $this->lastNode->nextSibling = $node;
 855                         $this->lastNode = $node;
 856                 }
 857         }
 858
 859         /**
 860          * Append a tree node with text contents
 861          * @param string $name
 862          * @param string $value
 863          */
 864         function addNodeWithText( $name, $value ) {
 865                 $node = PPNode_Hash_Tree::newWithText( $name, $value );
 866                 $this->addNode( $node );
 867         }
 868
 869         /**
 870          * Append a PPDAccum_Hash
 871          * Takes over ownership of the nodes in the source argument. These nodes may
 872          * subsequently be modified, especially nextSibling.
 873          * @param PPDAccum_Hash $accum
 874          */
 875         function addAccum( $accum ) {
 876                 if ( $accum->lastNode === false ) {
 877                         // nothing to add
 878                 } elseif ( $this->lastNode === false ) {
 879                         $this->firstNode = $accum->firstNode;
 880                         $this->lastNode = $accum->lastNode;
 881                 } else {
 882                         $this->lastNode->nextSibling = $accum->firstNode;
 883                         $this->lastNode = $accum->lastNode;
 884                 }
 885         }
 886 }
 887
 888 /**
 889  * An expansion frame, used as a context to expand the result of preprocessToObj()
 890  * @ingroup Parser
 891  */
 892 class PPFrame_Hash implements PPFrame {
 893
 894         /**
 895          * @var Parser
 896          */
 897         var $parser;
 898
 899         /**
 900          * @var Preprocessor
 901          */
 902         var $preprocessor;
 903
 904         /**
 905          * @var Title
 906          */
 907         var $title;
 908         var $titleCache;
 909
 910         /**
 911          * Hashtable listing templates which are disallowed for expansion in this frame,
 912          * having been encountered previously in parent frames.
 913          */
 914         var $loopCheckHash;
 915
 916         /**
 917          * Recursion depth of this frame, top = 0
 918          * Note that this is NOT the same as expansion depth in expand()
 919          */
 920         var $depth;
 921
 922         /**
 923          * @var array
 924          */
 925         protected $childExpansionCache;
 926
 927         /**
 928          * Construct a new preprocessor frame.
 929          * @param Preprocessor $preprocessor The parent preprocessor
 930          */
 931         function __construct( $preprocessor ) {
 932                 $this->preprocessor = $preprocessor;
 933                 $this->parser = $preprocessor->parser;
 934                 $this->title = $this->parser->mTitle;
 935                 $this->titleCache = array( $this->title ? $this->title->getPrefixedDBkey() : false );
 936                 $this->loopCheckHash = array();
 937                 $this->depth = 0;
 938                 $this->childExpansionCache = array();
 939         }
 940
 941         /**
 942          * Create a new child frame
 943          * $args is optionally a multi-root PPNode or array containing the template arguments
 944          *
 945          * @param array|bool|PPNode_Hash_Array $args
 946          * @param Title|bool $title
 947          * @param int $indexOffset
 948          * @throws MWException
 949          * @return PPTemplateFrame_Hash
 950          */
 951         function newChild( $args = false, $title = false, $indexOffset = 0 ) {
 952                 $namedArgs = array();
 953                 $numberedArgs = array();
 954                 if ( $title === false ) {
 955                         $title = $this->title;
 956                 }
 957                 if ( $args !== false ) {
 958                         if ( $args instanceof PPNode_Hash_Array ) {
 959                                 $args = $args->value;
 960                         } elseif ( !is_array( $args ) ) {
 961                                 throw new MWException( __METHOD__ . ': $args must be array or PPNode_Hash_Array' );
 962                         }
 963                         foreach ( $args as $arg ) {
 964                                 $bits = $arg->splitArg();
 965                                 if ( $bits['index'] !== '' ) {
 966                                         // Numbered parameter
 967                                         $index = $bits['index'] - $indexOffset;
 968                                         $numberedArgs[$index] = $bits['value'];
 969                                         unset( $namedArgs[$index] );
 970                                 } else {
 971                                         // Named parameter
 972                                         $name = trim( $this->expand( $bits['name'], PPFrame::STRIP_COMMENTS ) );
 973                                         $namedArgs[$name] = $bits['value'];
 974                                         unset( $numberedArgs[$name] );
 975                                 }
 976                         }
 977                 }
 978                 return new PPTemplateFrame_Hash( $this->preprocessor, $this, $numberedArgs, $namedArgs, $title );
 979         }
 980
 981         /**
 982          * @throws MWException
 983          * @param string|int $key
 984          * @param string|PPNode_Hash|DOMDocument $root
 985          * @param int $flags
 986          * @return string
 987          */
 988         function cachedExpand( $key, $root, $flags = 0 ) {
 989                 // we don't have a parent, so we don't have a cache
 990                 return $this->expand( $root, $flags );
 991         }
 992
 993         /**
 994          * @throws MWException
 995          * @param string|PPNode$root
 996          * @param int $flags
 997          * @return string
 998          */
 999         function expand( $root, $flags = 0 ) {
1000                 static $expansionDepth = 0;
1001                 if ( is_string( $root ) ) {
1002                         return $root;
1003                 }
1004
1005                 if ( ++$this->parser->mPPNodeCount > $this->parser->mOptions->getMaxPPNodeCount() ) {
1006                         $this->parser->limitationWarn( 'node-count-exceeded',
1007                                         $this->parser->mPPNodeCount,
1008                                         $this->parser->mOptions->getMaxPPNodeCount()
1009                         );
1010                         return '<span class="error">Node-count limit exceeded</span>';
1011                 }
1012                 if ( $expansionDepth > $this->parser->mOptions->getMaxPPExpandDepth() ) {
1013                         $this->parser->limitationWarn( 'expansion-depth-exceeded',
1014                                         $expansionDepth,
1015                                         $this->parser->mOptions->getMaxPPExpandDepth()
1016                         );
1017                         return '<span class="error">Expansion depth limit exceeded</span>';
1018                 }
1019                 ++$expansionDepth;
1020                 if ( $expansionDepth > $this->parser->mHighestExpansionDepth ) {
1021                         $this->parser->mHighestExpansionDepth = $expansionDepth;
1022                 }
1023
1024                 $outStack = array( '', '' );
1025                 $iteratorStack = array( false, $root );
1026                 $indexStack = array( 0, 0 );
1027
1028                 while ( count( $iteratorStack ) > 1 ) {
1029                         $level = count( $outStack ) - 1;
1030                         $iteratorNode =& $iteratorStack[$level];
1031                         $out =& $outStack[$level];
1032                         $index =& $indexStack[$level];
1033
1034                         if ( is_array( $iteratorNode ) ) {
1035                                 if ( $index >= count( $iteratorNode ) ) {
1036                                         // All done with this iterator
1037                                         $iteratorStack[$level] = false;
1038                                         $contextNode = false;
1039                                 } else {
1040                                         $contextNode = $iteratorNode[$index];
1041                                         $index++;
1042                                 }
1043                         } elseif ( $iteratorNode instanceof PPNode_Hash_Array ) {
1044                                 if ( $index >= $iteratorNode->getLength() ) {
1045                                         // All done with this iterator
1046                                         $iteratorStack[$level] = false;
1047                                         $contextNode = false;
1048                                 } else {
1049                                         $contextNode = $iteratorNode->item( $index );
1050                                         $index++;
1051                                 }
1052                         } else {
1053                                 // Copy to $contextNode and then delete from iterator stack,
1054                                 // because this is not an iterator but we do have to execute it once
1055                                 $contextNode = $iteratorStack[$level];
1056                                 $iteratorStack[$level] = false;
1057                         }
1058
1059                         $newIterator = false;
1060
1061                         if ( $contextNode === false ) {
1062                                 // nothing to do
1063                         } elseif ( is_string( $contextNode ) ) {
1064                                 $out .= $contextNode;
1065                         } elseif ( is_array( $contextNode ) || $contextNode instanceof PPNode_Hash_Array ) {
1066                                 $newIterator = $contextNode;
1067                         } elseif ( $contextNode instanceof PPNode_Hash_Attr ) {
1068                                 // No output
1069                         } elseif ( $contextNode instanceof PPNode_Hash_Text ) {
1070                                 $out .= $contextNode->value;
1071                         } elseif ( $contextNode instanceof PPNode_Hash_Tree ) {
1072                                 if ( $contextNode->name == 'template' ) {
1073                                         # Double-brace expansion
1074                                         $bits = $contextNode->splitTemplate();
1075                                         if ( $flags & PPFrame::NO_TEMPLATES ) {
1076                                                 $newIterator = $this->virtualBracketedImplode(
1077                                                         '{{', '|', '}}',
1078                                                         $bits['title'],
1079                                                         $bits['parts']
1080                                                 );
1081                                         } else {
1082                                                 $ret = $this->parser->braceSubstitution( $bits, $this );
1083                                                 if ( isset( $ret['object'] ) ) {
1084                                                         $newIterator = $ret['object'];
1085                                                 } else {
1086                                                         $out .= $ret['text'];
1087                                                 }
1088                                         }
1089                                 } elseif ( $contextNode->name == 'tplarg' ) {
1090                                         # Triple-brace expansion
1091                                         $bits = $contextNode->splitTemplate();
1092                                         if ( $flags & PPFrame::NO_ARGS ) {
1093                                                 $newIterator = $this->virtualBracketedImplode(
1094                                                         '{{{', '|', '}}}',
1095                                                         $bits['title'],
1096                                                         $bits['parts']
1097                                                 );
1098                                         } else {
1099                                                 $ret = $this->parser->argSubstitution( $bits, $this );
1100                                                 if ( isset( $ret['object'] ) ) {
1101                                                         $newIterator = $ret['object'];
1102                                                 } else {
1103                                                         $out .= $ret['text'];
1104                                                 }
1105                                         }
1106                                 } elseif ( $contextNode->name == 'comment' ) {
1107                                         # HTML-style comment
1108                                         # Remove it in HTML, pre+remove and STRIP_COMMENTS modes
1109                                         if ( $this->parser->ot['html']
1110                                                 || ( $this->parser->ot['pre'] && $this->parser->mOptions->getRemoveComments() )
1111                                                 || ( $flags & PPFrame::STRIP_COMMENTS )
1112                                         ) {
1113                                                 $out .= '';
1114                                         } elseif ( $this->parser->ot['wiki'] && !( $flags & PPFrame::RECOVER_COMMENTS ) ) {
1115                                                 # Add a strip marker in PST mode so that pstPass2() can
1116                                                 # run some old-fashioned regexes on the result.
1117                                                 # Not in RECOVER_COMMENTS mode (extractSections) though.
1118                                                 $out .= $this->parser->insertStripItem( $contextNode->firstChild->value );
1119                                         } else {
1120                                                 # Recover the literal comment in RECOVER_COMMENTS and pre+no-remove
1121                                                 $out .= $contextNode->firstChild->value;
1122                                         }
1123                                 } elseif ( $contextNode->name == 'ignore' ) {
1124                                         # Output suppression used by <includeonly> etc.
1125                                         # OT_WIKI will only respect <ignore> in substed templates.
1126                                         # The other output types respect it unless NO_IGNORE is set.
1127                                         # extractSections() sets NO_IGNORE and so never respects it.
1128                                         if ( ( !isset( $this->parent ) && $this->parser->ot['wiki'] )
1129                                                 || ( $flags & PPFrame::NO_IGNORE )
1130                                         ) {
1131                                                 $out .= $contextNode->firstChild->value;
1132                                         } else {
1133                                                 //$out .= '';
1134                                         }
1135                                 } elseif ( $contextNode->name == 'ext' ) {
1136                                         # Extension tag
1137                                         $bits = $contextNode->splitExt() + array( 'attr' => null, 'inner' => null, 'close' => null );
1138                                         $out .= $this->parser->extensionSubstitution( $bits, $this );
1139                                 } elseif ( $contextNode->name == 'h' ) {
1140                                         # Heading
1141                                         if ( $this->parser->ot['html'] ) {
1142                                                 # Expand immediately and insert heading index marker
1143                                                 $s = '';
1144                                                 for ( $node = $contextNode->firstChild; $node; $node = $node->nextSibling ) {
1145                                                         $s .= $this->expand( $node, $flags );
1146                                                 }
1147
1148                                                 $bits = $contextNode->splitHeading();
1149                                                 $titleText = $this->title->getPrefixedDBkey();
1150                                                 $this->parser->mHeadings[] = array( $titleText, $bits['i'] );
1151                                                 $serial = count( $this->parser->mHeadings ) - 1;
1152                                                 $marker = "{$this->parser->mUniqPrefix}-h-$serial-" . Parser::MARKER_SUFFIX;
1153                                                 $s = substr( $s, 0, $bits['level'] ) . $marker . substr( $s, $bits['level'] );
1154                                                 $this->parser->mStripState->addGeneral( $marker, '' );
1155                                                 $out .= $s;
1156                                         } else {
1157                                                 # Expand in virtual stack
1158                                                 $newIterator = $contextNode->getChildren();
1159                                         }
1160                                 } else {
1161                                         # Generic recursive expansion
1162                                         $newIterator = $contextNode->getChildren();
1163                                 }
1164                         } else {
1165                                 throw new MWException( __METHOD__ . ': Invalid parameter type' );
1166                         }
1167
1168                         if ( $newIterator !== false ) {
1169                                 $outStack[] = '';
1170                                 $iteratorStack[] = $newIterator;
1171                                 $indexStack[] = 0;
1172                         } elseif ( $iteratorStack[$level] === false ) {
1173                                 // Return accumulated value to parent
1174                                 // With tail recursion
1175                                 while ( $iteratorStack[$level] === false && $level > 0 ) {
1176                                         $outStack[$level - 1] .= $out;
1177                                         array_pop( $outStack );
1178                                         array_pop( $iteratorStack );
1179                                         array_pop( $indexStack );
1180                                         $level--;
1181                                 }
1182                         }
1183                 }
1184                 --$expansionDepth;
1185                 return $outStack[0];
1186         }
1187
1188         /**
1189          * @param string $sep
1190          * @param int $flags
1191          * @return string
1192          */
1193         function implodeWithFlags( $sep, $flags /*, ... */ ) {
1194                 $args = array_slice( func_get_args(), 2 );
1195
1196                 $first = true;
1197                 $s = '';
1198                 foreach ( $args as $root ) {
1199                         if ( $root instanceof PPNode_Hash_Array ) {
1200                                 $root = $root->value;
1201                         }
1202                         if ( !is_array( $root ) ) {
1203                                 $root = array( $root );
1204                         }
1205                         foreach ( $root as $node ) {
1206                                 if ( $first ) {
1207                                         $first = false;
1208                                 } else {
1209                                         $s .= $sep;
1210                                 }
1211                                 $s .= $this->expand( $node, $flags );
1212                         }
1213                 }
1214                 return $s;
1215         }
1216
1217         /**
1218          * Implode with no flags specified
1219          * This previously called implodeWithFlags but has now been inlined to reduce stack depth
1220          * @param string $sep
1221          * @return string
1222          */
1223         function implode( $sep /*, ... */ ) {
1224                 $args = array_slice( func_get_args(), 1 );
1225
1226                 $first = true;
1227                 $s = '';
1228                 foreach ( $args as $root ) {
1229                         if ( $root instanceof PPNode_Hash_Array ) {
1230                                 $root = $root->value;
1231                         }
1232                         if ( !is_array( $root ) ) {
1233                                 $root = array( $root );
1234                         }
1235                         foreach ( $root as $node ) {
1236                                 if ( $first ) {
1237                                         $first = false;
1238                                 } else {
1239                                         $s .= $sep;
1240                                 }
1241                                 $s .= $this->expand( $node );
1242                         }
1243                 }
1244                 return $s;
1245         }
1246
1247         /**
1248          * Makes an object that, when expand()ed, will be the same as one obtained
1249          * with implode()
1250          *
1251          * @param string $sep
1252          * @return PPNode_Hash_Array
1253          */
1254         function virtualImplode( $sep /*, ... */ ) {
1255                 $args = array_slice( func_get_args(), 1 );
1256                 $out = array();
1257                 $first = true;
1258
1259                 foreach ( $args as $root ) {
1260                         if ( $root instanceof PPNode_Hash_Array ) {
1261                                 $root = $root->value;
1262                         }
1263                         if ( !is_array( $root ) ) {
1264                                 $root = array( $root );
1265                         }
1266                         foreach ( $root as $node ) {
1267                                 if ( $first ) {
1268                                         $first = false;
1269                                 } else {
1270                                         $out[] = $sep;
1271                                 }
1272                                 $out[] = $node;
1273                         }
1274                 }
1275                 return new PPNode_Hash_Array( $out );
1276         }
1277
1278         /**
1279          * Virtual implode with brackets
1280          *
1281          * @param string $start
1282          * @param string $sep
1283          * @param string $end
1284          * @return PPNode_Hash_Array
1285          */
1286         function virtualBracketedImplode( $start, $sep, $end /*, ... */ ) {
1287                 $args = array_slice( func_get_args(), 3 );
1288                 $out = array( $start );
1289                 $first = true;
1290
1291                 foreach ( $args as $root ) {
1292                         if ( $root instanceof PPNode_Hash_Array ) {
1293                                 $root = $root->value;
1294                         }
1295                         if ( !is_array( $root ) ) {
1296                                 $root = array( $root );
1297                         }
1298                         foreach ( $root as $node ) {
1299                                 if ( $first ) {
1300                                         $first = false;
1301                                 } else {
1302                                         $out[] = $sep;
1303                                 }
1304                                 $out[] = $node;
1305                         }
1306                 }
1307                 $out[] = $end;
1308                 return new PPNode_Hash_Array( $out );
1309         }
1310
1311         function __toString() {
1312                 return 'frame{}';
1313         }
1314
1315         /**
1316          * @param bool $level
1317          * @return array|bool|string
1318          */
1319         function getPDBK( $level = false ) {
1320                 if ( $level === false ) {
1321                         return $this->title->getPrefixedDBkey();
1322                 } else {
1323                         return isset( $this->titleCache[$level] ) ? $this->titleCache[$level] : false;
1324                 }
1325         }
1326
1327         /**
1328          * @return array
1329          */
1330         function getArguments() {
1331                 return array();
1332         }
1333
1334         /**
1335          * @return array
1336          */
1337         function getNumberedArguments() {
1338                 return array();
1339         }
1340
1341         /**
1342          * @return array
1343          */
1344         function getNamedArguments() {
1345                 return array();
1346         }
1347
1348         /**
1349          * Returns true if there are no arguments in this frame
1350          *
1351          * @return bool
1352          */
1353         function isEmpty() {
1354                 return true;
1355         }
1356
1357         /**
1358          * @param string $name
1359          * @return bool
1360          */
1361         function getArgument( $name ) {
1362                 return false;
1363         }
1364
1365         /**
1366          * Returns true if the infinite loop check is OK, false if a loop is detected
1367          *
1368          * @param Title $title
1369          *
1370          * @return bool
1371          */
1372         function loopCheck( $title ) {
1373                 return !isset( $this->loopCheckHash[$title->getPrefixedDBkey()] );
1374         }
1375
1376         /**
1377          * Return true if the frame is a template frame
1378          *
1379          * @return bool
1380          */
1381         function isTemplate() {
1382                 return false;
1383         }
1384
1385         /**
1386          * Get a title of frame
1387          *
1388          * @return Title
1389          */
1390         function getTitle() {
1391                 return $this->title;
1392         }
1393 }
1394
1395 /**
1396  * Expansion frame with template arguments
1397  * @ingroup Parser
1398  */
1399 class PPTemplateFrame_Hash extends PPFrame_Hash {
1400         var $numberedArgs, $namedArgs, $parent;
1401         var $numberedExpansionCache, $namedExpansionCache;
1402
1403         /**
1404          * @param Preprocessor $preprocessor
1405          * @param bool|PPFrame $parent
1406          * @param array $numberedArgs
1407          * @param array $namedArgs
1408          * @param bool|Title $title
1409          */
1410         function __construct( $preprocessor, $parent = false, $numberedArgs = array(),
1411                 $namedArgs = array(), $title = false
1412         ) {
1413                 parent::__construct( $preprocessor );
1414
1415                 $this->parent = $parent;
1416                 $this->numberedArgs = $numberedArgs;
1417                 $this->namedArgs = $namedArgs;
1418                 $this->title = $title;
1419                 $pdbk = $title ? $title->getPrefixedDBkey() : false;
1420                 $this->titleCache = $parent->titleCache;
1421                 $this->titleCache[] = $pdbk;
1422                 $this->loopCheckHash = /*clone*/ $parent->loopCheckHash;
1423                 if ( $pdbk !== false ) {
1424                         $this->loopCheckHash[$pdbk] = true;
1425                 }
1426                 $this->depth = $parent->depth + 1;
1427                 $this->numberedExpansionCache = $this->namedExpansionCache = array();
1428         }
1429
1430         function __toString() {
1431                 $s = 'tplframe{';
1432                 $first = true;
1433                 $args = $this->numberedArgs + $this->namedArgs;
1434                 foreach ( $args as $name => $value ) {
1435                         if ( $first ) {
1436                                 $first = false;
1437                         } else {
1438                                 $s .= ', ';
1439                         }
1440                         $s .= "\"$name\":\"" .
1441                                 str_replace( '"', '\\"', $value->__toString() ) . '"';
1442                 }
1443                 $s .= '}';
1444                 return $s;
1445         }
1446
1447         /**
1448          * @throws MWException
1449          * @param string|int $key
1450          * @param string|PPNode_Hash|DOMDocument $root
1451          * @param int $flags
1452          * @return string
1453          */
1454         function cachedExpand( $key, $root, $flags = 0 ) {
1455                 if ( !isset( $this->parent->childExpansionCache[$key] ) ) {
1456                         $this->parent->childExpansionCache[$key] = $this->expand( $root, $flags );
1457                 }
1458                 return $this->parent->childExpansionCache[$key];
1459         }
1460
1461         /**
1462          * Returns true if there are no arguments in this frame
1463          *
1464          * @return bool
1465          */
1466         function isEmpty() {
1467                 return !count( $this->numberedArgs ) && !count( $this->namedArgs );
1468         }
1469
1470         /**
1471          * @return array
1472          */
1473         function getArguments() {
1474                 $arguments = array();
1475                 foreach ( array_merge(
1476                                 array_keys( $this->numberedArgs ),
1477                                 array_keys( $this->namedArgs ) ) as $key ) {
1478                         $arguments[$key] = $this->getArgument( $key );
1479                 }
1480                 return $arguments;
1481         }
1482
1483         /**
1484          * @return array
1485          */
1486         function getNumberedArguments() {
1487                 $arguments = array();
1488                 foreach ( array_keys( $this->numberedArgs ) as $key ) {
1489                         $arguments[$key] = $this->getArgument( $key );
1490                 }
1491                 return $arguments;
1492         }
1493
1494         /**
1495          * @return array
1496          */
1497         function getNamedArguments() {
1498                 $arguments = array();
1499                 foreach ( array_keys( $this->namedArgs ) as $key ) {
1500                         $arguments[$key] = $this->getArgument( $key );
1501                 }
1502                 return $arguments;
1503         }
1504
1505         /**
1506          * @param int $index
1507          * @return array|bool
1508          */
1509         function getNumberedArgument( $index ) {
1510                 if ( !isset( $this->numberedArgs[$index] ) ) {
1511                         return false;
1512                 }
1513                 if ( !isset( $this->numberedExpansionCache[$index] ) ) {
1514                         # No trimming for unnamed arguments
1515                         $this->numberedExpansionCache[$index] = $this->parent->expand(
1516                                 $this->numberedArgs[$index],
1517                                 PPFrame::STRIP_COMMENTS
1518                         );
1519                 }
1520                 return $this->numberedExpansionCache[$index];
1521         }
1522
1523         /**
1524          * @param string $name
1525          * @return bool
1526          */
1527         function getNamedArgument( $name ) {
1528                 if ( !isset( $this->namedArgs[$name] ) ) {
1529                         return false;
1530                 }
1531                 if ( !isset( $this->namedExpansionCache[$name] ) ) {
1532                         # Trim named arguments post-expand, for backwards compatibility
1533                         $this->namedExpansionCache[$name] = trim(
1534                                 $this->parent->expand( $this->namedArgs[$name], PPFrame::STRIP_COMMENTS ) );
1535                 }
1536                 return $this->namedExpansionCache[$name];
1537         }
1538
1539         /**
1540          * @param string $name
1541          * @return array|bool
1542          */
1543         function getArgument( $name ) {
1544                 $text = $this->getNumberedArgument( $name );
1545                 if ( $text === false ) {
1546                         $text = $this->getNamedArgument( $name );
1547                 }
1548                 return $text;
1549         }
1550
1551         /**
1552          * Return true if the frame is a template frame
1553          *
1554          * @return bool
1555          */
1556         function isTemplate() {
1557                 return true;
1558         }
1559 }
1560
1561 /**
1562  * Expansion frame with custom arguments
1563  * @ingroup Parser
1564  */
1565 class PPCustomFrame_Hash extends PPFrame_Hash {
1566         var $args;
1567
1568         function __construct( $preprocessor, $args ) {
1569                 parent::__construct( $preprocessor );
1570                 $this->args = $args;
1571         }
1572
1573         function __toString() {
1574                 $s = 'cstmframe{';
1575                 $first = true;
1576                 foreach ( $this->args as $name => $value ) {
1577                         if ( $first ) {
1578                                 $first = false;
1579                         } else {
1580                                 $s .= ', ';
1581                         }
1582                         $s .= "\"$name\":\"" .
1583                                 str_replace( '"', '\\"', $value->__toString() ) . '"';
1584                 }
1585                 $s .= '}';
1586                 return $s;
1587         }
1588
1589         /**
1590          * @return bool
1591          */
1592         function isEmpty() {
1593                 return !count( $this->args );
1594         }
1595
1596         /**
1597          * @param int $index
1598          * @return bool
1599          */
1600         function getArgument( $index ) {
1601                 if ( !isset( $this->args[$index] ) ) {
1602                         return false;
1603                 }
1604                 return $this->args[$index];
1605         }
1606
1607         function getArguments() {
1608                 return $this->args;
1609         }
1610 }
1611
1612 /**
1613  * @ingroup Parser
1614  */
1615 class PPNode_Hash_Tree implements PPNode {
1616         var $name, $firstChild, $lastChild, $nextSibling;
1617
1618         function __construct( $name ) {
1619                 $this->name = $name;
1620                 $this->firstChild = $this->lastChild = $this->nextSibling = false;
1621         }
1622
1623         function __toString() {
1624                 $inner = '';
1625                 $attribs = '';
1626                 for ( $node = $this->firstChild; $node; $node = $node->nextSibling ) {
1627                         if ( $node instanceof PPNode_Hash_Attr ) {
1628                                 $attribs .= ' ' . $node->name . '="' . htmlspecialchars( $node->value ) . '"';
1629                         } else {
1630                                 $inner .= $node->__toString();
1631                         }
1632                 }
1633                 if ( $inner === '' ) {
1634                         return "<{$this->name}$attribs/>";
1635                 } else {
1636                         return "<{$this->name}$attribs>$inner</{$this->name}>";
1637                 }
1638         }
1639
1640         /**
1641          * @param string $name
1642          * @param string $text
1643          * @return PPNode_Hash_Tree
1644          */
1645         static function newWithText( $name, $text ) {
1646                 $obj = new self( $name );
1647                 $obj->addChild( new PPNode_Hash_Text( $text ) );
1648                 return $obj;
1649         }
1650
1651         function addChild( $node ) {
1652                 if ( $this->lastChild === false ) {
1653                         $this->firstChild = $this->lastChild = $node;
1654                 } else {
1655                         $this->lastChild->nextSibling = $node;
1656                         $this->lastChild = $node;
1657                 }
1658         }
1659
1660         /**
1661          * @return PPNode_Hash_Array
1662          */
1663         function getChildren() {
1664                 $children = array();
1665                 for ( $child = $this->firstChild; $child; $child = $child->nextSibling ) {
1666                         $children[] = $child;
1667                 }
1668                 return new PPNode_Hash_Array( $children );
1669         }
1670
1671         function getFirstChild() {
1672                 return $this->firstChild;
1673         }
1674
1675         function getNextSibling() {
1676                 return $this->nextSibling;
1677         }
1678
1679         function getChildrenOfType( $name ) {
1680                 $children = array();
1681                 for ( $child = $this->firstChild; $child; $child = $child->nextSibling ) {
1682                         if ( isset( $child->name ) && $child->name === $name ) {
1683                                 $children[] = $child;
1684                         }
1685                 }
1686                 return $children;
1687         }
1688
1689         /**
1690          * @return bool
1691          */
1692         function getLength() {
1693                 return false;
1694         }
1695
1696         /**
1697          * @param int $i
1698          * @return bool
1699          */
1700         function item( $i ) {
1701                 return false;
1702         }
1703
1704         /**
1705          * @return string
1706          */
1707         function getName() {
1708                 return $this->name;
1709         }
1710
1711         /**
1712          * Split a "<part>" node into an associative array containing:
1713          *  - name          PPNode name
1714          *  - index         String index
1715          *  - value         PPNode value
1716          *
1717          * @throws MWException
1718          * @return array
1719          */
1720         function splitArg() {
1721                 $bits = array();
1722                 for ( $child = $this->firstChild; $child; $child = $child->nextSibling ) {
1723                         if ( !isset( $child->name ) ) {
1724                                 continue;
1725                         }
1726                         if ( $child->name === 'name' ) {
1727                                 $bits['name'] = $child;
1728                                 if ( $child->firstChild instanceof PPNode_Hash_Attr
1729                                         && $child->firstChild->name === 'index'
1730                                 ) {
1731                                         $bits['index'] = $child->firstChild->value;
1732                                 }
1733                         } elseif ( $child->name === 'value' ) {
1734                                 $bits['value'] = $child;
1735                         }
1736                 }
1737
1738                 if ( !isset( $bits['name'] ) ) {
1739                         throw new MWException( 'Invalid brace node passed to ' . __METHOD__ );
1740                 }
1741                 if ( !isset( $bits['index'] ) ) {
1742                         $bits['index'] = '';
1743                 }
1744                 return $bits;
1745         }
1746
1747         /**
1748          * Split an "<ext>" node into an associative array containing name, attr, inner and close
1749          * All values in the resulting array are PPNodes. Inner and close are optional.
1750          *
1751          * @throws MWException
1752          * @return array
1753          */
1754         function splitExt() {
1755                 $bits = array();
1756                 for ( $child = $this->firstChild; $child; $child = $child->nextSibling ) {
1757                         if ( !isset( $child->name ) ) {
1758                                 continue;
1759                         }
1760                         if ( $child->name == 'name' ) {
1761                                 $bits['name'] = $child;
1762                         } elseif ( $child->name == 'attr' ) {
1763                                 $bits['attr'] = $child;
1764                         } elseif ( $child->name == 'inner' ) {
1765                                 $bits['inner'] = $child;
1766                         } elseif ( $child->name == 'close' ) {
1767                                 $bits['close'] = $child;
1768                         }
1769                 }
1770                 if ( !isset( $bits['name'] ) ) {
1771                         throw new MWException( 'Invalid ext node passed to ' . __METHOD__ );
1772                 }
1773                 return $bits;
1774         }
1775
1776         /**
1777          * Split an "<h>" node
1778          *
1779          * @throws MWException
1780          * @return array
1781          */
1782         function splitHeading() {
1783                 if ( $this->name !== 'h' ) {
1784                         throw new MWException( 'Invalid h node passed to ' . __METHOD__ );
1785                 }
1786                 $bits = array();
1787                 for ( $child = $this->firstChild; $child; $child = $child->nextSibling ) {
1788                         if ( !isset( $child->name ) ) {
1789                                 continue;
1790                         }
1791                         if ( $child->name == 'i' ) {
1792                                 $bits['i'] = $child->value;
1793                         } elseif ( $child->name == 'level' ) {
1794                                 $bits['level'] = $child->value;
1795                         }
1796                 }
1797                 if ( !isset( $bits['i'] ) ) {
1798                         throw new MWException( 'Invalid h node passed to ' . __METHOD__ );
1799                 }
1800                 return $bits;
1801         }
1802
1803         /**
1804          * Split a "<template>" or "<tplarg>" node
1805          *
1806          * @throws MWException
1807          * @return array
1808          */
1809         function splitTemplate() {
1810                 $parts = array();
1811                 $bits = array( 'lineStart' => '' );
1812                 for ( $child = $this->firstChild; $child; $child = $child->nextSibling ) {
1813                         if ( !isset( $child->name ) ) {
1814                                 continue;
1815                         }
1816                         if ( $child->name == 'title' ) {
1817                                 $bits['title'] = $child;
1818                         }
1819                         if ( $child->name == 'part' ) {
1820                                 $parts[] = $child;
1821                         }
1822                         if ( $child->name == 'lineStart' ) {
1823                                 $bits['lineStart'] = '1';
1824                         }
1825                 }
1826                 if ( !isset( $bits['title'] ) ) {
1827                         throw new MWException( 'Invalid node passed to ' . __METHOD__ );
1828                 }
1829                 $bits['parts'] = new PPNode_Hash_Array( $parts );
1830                 return $bits;
1831         }
1832 }
1833
1834 /**
1835  * @ingroup Parser
1836  */
1837 class PPNode_Hash_Text implements PPNode {
1838         var $value, $nextSibling;
1839
1840         function __construct( $value ) {
1841                 if ( is_object( $value ) ) {
1842                         throw new MWException( __CLASS__ . ' given object instead of string' );
1843                 }
1844                 $this->value = $value;
1845         }
1846
1847         function __toString() {
1848                 return htmlspecialchars( $this->value );
1849         }
1850
1851         function getNextSibling() {
1852                 return $this->nextSibling;
1853         }
1854
1855         function getChildren() {
1856                 return false;
1857         }
1858
1859         function getFirstChild() {
1860                 return false;
1861         }
1862
1863         function getChildrenOfType( $name ) {
1864                 return false;
1865         }
1866
1867         function getLength() {
1868                 return false;
1869         }
1870
1871         function item( $i ) {
1872                 return false;
1873         }
1874
1875         function getName() {
1876                 return '#text';
1877         }
1878
1879         function splitArg() {
1880                 throw new MWException( __METHOD__ . ': not supported' );
1881         }
1882
1883         function splitExt() {
1884                 throw new MWException( __METHOD__ . ': not supported' );
1885         }
1886
1887         function splitHeading() {
1888                 throw new MWException( __METHOD__ . ': not supported' );
1889         }
1890 }
1891
1892 /**
1893  * @ingroup Parser
1894  */
1895 class PPNode_Hash_Array implements PPNode {
1896         var $value, $nextSibling;
1897
1898         function __construct( $value ) {
1899                 $this->value = $value;
1900         }
1901
1902         function __toString() {
1903                 return var_export( $this, true );
1904         }
1905
1906         function getLength() {
1907                 return count( $this->value );
1908         }
1909
1910         function item( $i ) {
1911                 return $this->value[$i];
1912         }
1913
1914         function getName() {
1915                 return '#nodelist';
1916         }
1917
1918         function getNextSibling() {
1919                 return $this->nextSibling;
1920         }
1921
1922         function getChildren() {
1923                 return false;
1924         }
1925
1926         function getFirstChild() {
1927                 return false;
1928         }
1929
1930         function getChildrenOfType( $name ) {
1931                 return false;
1932         }
1933
1934         function splitArg() {
1935                 throw new MWException( __METHOD__ . ': not supported' );
1936         }
1937
1938         function splitExt() {
1939                 throw new MWException( __METHOD__ . ': not supported' );
1940         }
1941
1942         function splitHeading() {
1943                 throw new MWException( __METHOD__ . ': not supported' );
1944         }
1945 }
1946
1947 /**
1948  * @ingroup Parser
1949  */
1950 class PPNode_Hash_Attr implements PPNode {
1951         var $name, $value, $nextSibling;
1952
1953         function __construct( $name, $value ) {
1954                 $this->name = $name;
1955                 $this->value = $value;
1956         }
1957
1958         function __toString() {
1959                 return "<@{$this->name}>" . htmlspecialchars( $this->value ) . "</@{$this->name}>";
1960         }
1961
1962         function getName() {
1963                 return $this->name;
1964         }
1965
1966         function getNextSibling() {
1967                 return $this->nextSibling;
1968         }
1969
1970         function getChildren() {
1971                 return false;
1972         }
1973
1974         function getFirstChild() {
1975                 return false;
1976         }
1977
1978         function getChildrenOfType( $name ) {
1979                 return false;
1980         }
1981
1982         function getLength() {
1983                 return false;
1984         }
1985
1986         function item( $i ) {
1987                 return false;
1988         }
1989
1990         function splitArg() {
1991                 throw new MWException( __METHOD__ . ': not supported' );
1992         }
1993
1994         function splitExt() {
1995                 throw new MWException( __METHOD__ . ': not supported' );
1996         }
1997
1998         function splitHeading() {
1999                 throw new MWException( __METHOD__ . ': not supported' );
2000         }
2001 }