/usr/include/xalanc/XPath/XPathExpression.hpp is in libxalan110-dev 1.10-6.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 | /*
* Copyright 1999-2004 The Apache Software Foundation.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#if !defined(XPATHEXPRESSION_HEADER_GUARD_1357924680)
#define XPATHEXPRESSION_HEADER_GUARD_1357924680
// Base header file. Must be first.
#include <xalanc/XPath/XPathDefinitions.hpp>
#include <xalanc/Include/XalanVector.hpp>
#if defined(XALAN_CLASSIC_IOSTREAMS)
#include <iostream.h>
#else
#include <iosfwd>
#endif
#include <xalanc/XalanDOM/XalanDOMString.hpp>
#include <xalanc/PlatformSupport/DOMStringHelper.hpp>
#include <xalanc/PlatformSupport/PrintWriter.hpp>
#include <xalanc/XPath/XToken.hpp>
#include <xalanc/XPath/XalanXPathException.hpp>
XALAN_CPP_NAMESPACE_BEGIN
XALAN_USING_XERCES(MemoryManager)
class XALAN_XPATH_EXPORT XPathExpression
{
public:
typedef XALAN_STD_QUALIFIER ostream OstreamType;
typedef XalanVector<int> OpCodeMapType;
typedef XalanVector<XToken> TokenQueueType;
typedef OpCodeMapType::value_type OpCodeMapValueType;
typedef OpCodeMapValueType OpCodeMapSizeType;
typedef XalanVector<OpCodeMapValueType> OpCodeMapValueVectorType;
typedef XalanVector<double> NumberLiteralValueVectorType;
#define XALAN_XPATH_EXPRESSION_USE_ITERATORS
#if defined(XALAN_XPATH_EXPRESSION_USE_ITERATORS)
typedef OpCodeMapType::const_iterator OpCodeMapPositionType;
#else
typedef OpCodeMapSizeType OpCodeMapPositionType;
#endif
typedef OpCodeMapType::difference_type OpCodeMapDifferenceType;
typedef TokenQueueType::value_type TokenQueueValueType;
typedef int TokenQueueSizeType;
typedef TokenQueueSizeType TokenQueuePositionType;
/**
* List of operations codes.
*
* Code for the descriptions of the operations codes:
* [UPPER CASE] indicates a literal value,
* [lower case] is a description of a value,
* ([length] always indicates the length of the operation,
* including the operations code and the length integer.)
* {UPPER CASE} indicates the given production,
* {description} is the description of a new production,
* (For instance, {boolean expression} means some expression
* that should be resolved to a boolean.)
* * means that it occurs zero or more times,
* + means that it occurs one or more times,
* ? means that it is optional.
*
* returns: indicates what the production should return.
*/
enum eOpCodes
{
/**
* [ELEMWILDCARD]
* Means ELEMWILDCARD ("*"), used instead
* of string index in some places.
*/
eELEMWILDCARD = -3,
/**
* [EMPTY]
* Empty slot to indicate NULL.
*/
eEMPTY = -2,
/**
* [ENDOP]
* Some operators may like to have a terminator.
*/
eENDOP = -1,
/**
* [OP_XPATH]
* [length]
* {expression}
*
* returns:
* XNodeSet
* XNumber
* XString
* XBoolean
* XRTree
* XObject
*/
eOP_XPATH = 1,
/**
* [OP_OR]
* [length]
* {boolean expression}
* {boolean expression}
*
* returns:
* XBoolean
*/
eOP_OR = 2,
/**
* [OP_AND]
* [length]
* {boolean expression}
* {boolean expression}
*
* returns:
* XBoolean
*/
eOP_AND = 3,
/**
* [OP_NOTEQUALS]
* [length]
* {expression}
* {expression}
*
* returns:
* XBoolean
*/
eOP_NOTEQUALS = 4,
/**
* [OP_EQUALS]
* [length]
* {expression}
* {expression}
*
* returns:
* XBoolean
*/
eOP_EQUALS = 5,
/**
* [OP_LTE] (less-than-or-equals)
* [length]
* {number expression}
* {number expression}
*
* returns:
* XBoolean
*/
eOP_LTE = 6,
/**
* [OP_LT] (less-than)
* [length]
* {number expression}
* {number expression}
*
* returns:
* XBoolean
*/
eOP_LT = 7,
/**
* [OP_GTE] (greater-than-or-equals)
* [length]
* {number expression}
* {number expression}
*
* returns:
* XBoolean
*/
eOP_GTE = 8,
/**
* [OP_GT] (greater-than)
* [length]
* {number expression}
* {number expression}
*
* returns:
* XBoolean
*/
eOP_GT = 9,
/**
* [OP_PLUS]
* [length]
* {number expression}
* {number expression}
*
* returns:
* XNumber
*/
eOP_PLUS = 10,
/**
* [OP_MINUS]
* [length]
* {number expression}
* {number expression}
*
* returns:
* XNumber
*/
eOP_MINUS = 11,
/**
* [OP_MULT]
* [length]
* {number expression}
* {number expression}
*
* returns:
* XNumber
*/
eOP_MULT = 12,
/**
* [OP_DIV]
* [length]
* {number expression}
* {number expression}
*
* returns:
* XNumber
*/
eOP_DIV = 13,
/**
* [OP_MOD]
* [length]
* {number expression}
* {number expression}
*
* returns:
* XNumber
*/
eOP_MOD = 14,
/**
* [OP_NEG]
* [length]
* {number expression}
*
* returns:
* XNumber
*/
eOP_NEG = 15,
/**
* [OP_BOOL] (cast operation)
* [length]
* {expression}
*
* returns:
* XBoolean
*/
eOP_BOOL = 16,
/**
* [OP_UNION]
* [length]
* {PathExpr}+
*
* returns:
* XNodeSet
*/
eOP_UNION = 17,
/**
* [OP_LITERAL]
* [3]
* [index to token]
*
* returns:
* XString
*/
eOP_LITERAL = 18,
/**
* [OP_VARIABLE]
* [3]
* [index to token]
*
* returns:
* XString
*/
eOP_VARIABLE = 19,
/**
* [OP_GROUP]
* [length]
* {expression}
*
* returns:
* XNodeSet
* XNumber
* XString
* XBoolean
* XRTree
* XObject
*/
eOP_GROUP = 20,
/**
* [OP_NUMBERLIT] (Number literal.)
* [3]
* [index to token]
*
* returns:
* XString
*/
eOP_NUMBERLIT = 21,
/**
* [OP_ARGUMENT] (Function argument.)
* [length]
* {expression}
*
* returns:
* XNodeSet
* XNumber
* XString
* XBoolean
* XRTree
* XObject
*/
eOP_ARGUMENT = 22,
/**
* [OP_EXTFUNCTION] (Extension function.)
* [length]
* [index to namespace token]
* [index to function name token]
* {OP_ARGUMENT}*
*
* returns:
* XNodeSet
* XNumber
* XString
* XBoolean
* XRTree
* XObject
*/
eOP_EXTFUNCTION = 23,
/**
* [OP_FUNCTION]
* [length]
* [FUNC_ID]
* [arg count]
* {OP_ARGUMENT}*
* [ENDOP]
*
* returns:
* XNodeSet
* XNumber
* XString
* XBoolean
* XRTree
* XObject
*/
eOP_FUNCTION = 24,
/**
* [OP_LOCATIONPATH]
* [length]
* {FROM_stepType}
* | {function}{predicate}*
* [ENDOP]
*
* (Note that element and attribute namespaces and
* names can be wildcarded '*'.)
*
* returns:
* XNodeSet
*/
eOP_LOCATIONPATH = 25,
/**
* [OP_PREDICATE]
* [length]
* {expression}
* [ENDOP] (For safety)
*
* returns:
* XBoolean or XNumber
*/
eOP_PREDICATE = 26,
/**
* [NODETYPE_COMMENT]
* No size or arguments.
*
* returns:
* XBoolean
*/
eNODETYPE_COMMENT = 27,
/**
* [NODETYPE_TEXT]
* No size or arguments.
*
* returns:
* XBoolean
*/
eNODETYPE_TEXT = 28,
/**
* [NODETYPE_PI]
* [index to token]
*
* returns:
* XBoolean
*/
eNODETYPE_PI = 29,
/**
* [NODETYPE_NODE]
* No size or arguments.
*
* returns:
* XBoolean
*/
eNODETYPE_NODE = 30,
/**
* [NODENAME]
* [index to ns token or EMPTY]
* [index to name token]
*
* returns:
* XBoolean
*/
eNODENAME = 31,
/**
* [NODETYPE_ROOT]
* No size or arguments.
*
* returns:
* XBoolean
*/
eNODETYPE_ROOT = 32,
/**
* [NODETYPE_ANY]
* No size or arguments.
*
* returns:
* XBoolean
*/
eNODETYPE_ANYELEMENT = 33,
/**
* [FROM_stepType]
* [length, including predicates]
* [length of just the step, without the predicates]
* {node test}
* {predicates}?
*
* returns:
* XBoolean
*/
eFROM_ANCESTORS = 34,
eFROM_ANCESTORS_OR_SELF = 35,
eFROM_ATTRIBUTES = 36,
eFROM_CHILDREN = 37,
eFROM_DESCENDANTS = 38,
eFROM_DESCENDANTS_OR_SELF = 39,
eFROM_FOLLOWING = 40,
eFROM_FOLLOWING_SIBLINGS = 41,
eFROM_PARENT = 42,
eFROM_PRECEDING = 43,
eFROM_PRECEDING_SIBLINGS = 44,
eFROM_SELF = 45,
eFROM_NAMESPACE = 46,
eFROM_ROOT = 47,
/**
* [OP_UNION]
* [length]
* {PathExpr}+
*
* returns:
* XNodeSet
*/
eOP_MATCHPATTERN = 48,
/**
* [OP_UNION]
* [length]
* {PathExpr}+
*
* returns:
* XNodeSet
*/
eOP_LOCATIONPATHPATTERN = 49,
// For match patterns
eMATCH_ATTRIBUTE = 50,
eMATCH_ANY_ANCESTOR = 51,
eMATCH_IMMEDIATE_ANCESTOR = 52,
eMATCH_ANY_ANCESTOR_WITH_PREDICATE = 53,
eMATCH_ANY_ANCESTOR_WITH_FUNCTION_CALL = 54,
/**
* [OP_PREDICATE_WITH_POSITION]
* [length]
* {expression}
* [ENDOP] (For safety)
*
* returns:
* XBoolean or XNumber
*/
eOP_PREDICATE_WITH_POSITION = 55,
/**
* These are values for intrinsic functions which
* have been compiled directly into the op map.
*/
eOP_FUNCTION_POSITION = 56,
eOP_FUNCTION_LAST = 57,
eOP_FUNCTION_COUNT = 58,
eOP_FUNCTION_NOT = 59,
eOP_FUNCTION_TRUE = 60,
eOP_FUNCTION_FALSE = 61,
eOP_FUNCTION_BOOLEAN = 62,
eOP_FUNCTION_NAME_0 = 63,
eOP_FUNCTION_NAME_1 = 64,
eOP_FUNCTION_LOCALNAME_0 = 65,
eOP_FUNCTION_LOCALNAME_1 = 66,
eOP_FUNCTION_FLOOR = 67,
eOP_FUNCTION_CEILING = 68,
eOP_FUNCTION_ROUND = 69,
eOP_FUNCTION_NUMBER_0 = 70,
eOP_FUNCTION_NUMBER_1 = 71,
eOP_FUNCTION_STRING_0 = 72,
eOP_FUNCTION_STRING_1 = 73,
eOP_FUNCTION_STRINGLENGTH_0 = 74,
eOP_FUNCTION_STRINGLENGTH_1 = 75,
eOP_FUNCTION_NAMESPACEURI_0 = 76,
eOP_FUNCTION_NAMESPACEURI_1 = 77,
eOP_FUNCTION_SUM = 78,
eOP_FUNCTION_CONCAT = 79,
// Always add _before_ this one and update
// s_opCodeLengthArray.
eOpCodeNextAvailable
}; // enum eOpCodes
/**
* Exception class thrown when an invalid XPath expression is encountered
*/
class XALAN_XPATH_EXPORT XPathExpressionException : public XalanXPathException
{
public:
/**
* Construct an XPathExpressionException object.
*
* @param theMessage string error message
*/
XPathExpressionException(const XalanDOMString& theMessage,
MemoryManagerType& theManager);
virtual~
XPathExpressionException();
};
/**
* Exception class thrown when an invalid XPath operation code is encountered
*/
class XALAN_XPATH_EXPORT InvalidOpCodeException : public XPathExpressionException
{
public:
/**
* Construct an InvalidOpCodeException object.
*
* @param theOpCode operation code that caused the exception
*/
InvalidOpCodeException(OpCodeMapValueType theOpCode,
XalanDOMString& theResult);
virtual~
InvalidOpCodeException();
private:
static XalanDOMString&
FormatErrorMessage(OpCodeMapValueType theOpCode,
XalanDOMString& theResult);
};
/**
* Exception class thrown when an invalid number of XPath arguments is
* encountered
*/
class XALAN_XPATH_EXPORT InvalidArgumentCountException : public XPathExpressionException
{
public:
/**
* Construct an InvalidArgumentCountException object.
*
* @param theOpCode operation code that caused the exception
* @param theExpectedCount the correct number of arguments for "opcode"
* @param theSuppliedCount the number of arguments supplied
*/
InvalidArgumentCountException(
OpCodeMapValueType theOpCode,
OpCodeMapValueType theExpectedCount,
OpCodeMapValueType theSuppliedCount,
XalanDOMString& theResult);
virtual~
InvalidArgumentCountException();
private:
static XalanDOMString&
FormatErrorMessage(
OpCodeMapValueType theOpCode,
OpCodeMapValueType theExpectedCount,
OpCodeMapValueType theSuppliedCount,
XalanDOMString& theResult);
};
/**
* Exception class thrown when an invalid XPath argument is encountered
*/
class XALAN_XPATH_EXPORT InvalidArgumentException : public XPathExpressionException
{
public:
/**
* Construct an InvalidArgumentException object.
*
* @param theOpCode operation code that caused the exception
* @param theValue invalid argument value
*/
InvalidArgumentException(
OpCodeMapValueType theOpCode,
OpCodeMapValueType theValue,
XalanDOMString& theResult);
virtual~
InvalidArgumentException();
private:
static XalanDOMString&
FormatErrorMessage(
OpCodeMapValueType theOpCode,
OpCodeMapValueType theValue,
XalanDOMString& theResult);
};
/**
* The length is always the opcode position + 1. Length is always expressed
* as the opcode+length bytes, so it is always 2 or greater. This is the
* offset from the op code where the length is stored. It will always
* remain one.
*/
#if defined(XALAN_INLINE_INITIALIZATION)
static const TokenQueueSizeType s_opCodeMapLengthIndex = 1;
#else
enum eDummy
{
s_opCodeMapLengthIndex = 1
};
#endif
explicit
XPathExpression(MemoryManagerType& theManager);
~XPathExpression();
MemoryManagerType&
getMemoryManager()
{
return m_opMap.getMemoryManager();
}
/**
* Reset the expression.
*/
void
reset();
/**
* Shrink internal tables.
*/
void
shrink();
/**
* Retrieve number of elements in the operations code map.
*
* @return size of operations code map
*/
OpCodeMapSizeType
opCodeMapSize() const
{
return OpCodeMapSizeType(m_opMap.size());
}
/**
* Retrieve length of the operations code map stored in the map. The length
* of the entire map is stored after the first op code. That offset is
* determined by this const static member. Note that as expressions are
* defined recursively, this is really just the length of the first
* expression in the map, which is the top of the parse tree. Any
* subexpression will also have a length entry at the same offset from the
* beginning of the subexpression.
*
* @return length of operations code map
*/
OpCodeMapValueType
opCodeMapLength() const
{
const OpCodeMapSizeType theSize = opCodeMapSize();
if (theSize > s_opCodeMapLengthIndex)
{
assert(theSize == OpCodeMapSizeType(m_opMap[s_opCodeMapLengthIndex]));
return m_opMap[s_opCodeMapLengthIndex];
}
else
{
assert(theSize == OpCodeMapValueType(theSize));
return OpCodeMapValueType(theSize);
}
}
OpCodeMapPositionType
getInitialOpCodePosition() const
{
#if defined(XALAN_XPATH_EXPRESSION_USE_ITERATORS)
return m_opMap.begin();
#else
return 0;
#endif
}
bool
isValidOpCodePosition(OpCodeMapPositionType opPos) const
{
const OpCodeMapDifferenceType theDifference =
OpCodeMapDifferenceType(opPos - getInitialOpCodePosition());
return theDifference >= 0 &&
theDifference < opCodeMapSize();
}
#if defined(XALAN_XPATH_EXPRESSION_USE_ITERATORS)
bool
isValidOpCodePosition(OpCodeMapSizeType theIndex) const
{
return theIndex >= 0 && theIndex < opCodeMapSize();
}
/**
* Retrieve the value of an operation code at a specified index in the
* op code map.
*
* @param theIndex The index in list
* @return value of operation code
*/
OpCodeMapValueType
getOpCodeMapValue(OpCodeMapSizeType theIndex) const
{
assert(theIndex < opCodeMapLength());
return m_opMap[theIndex];
}
#endif
/**
* Retrieve the value of an operation code at a specified position in the
* list.
*
* @param opPos position in list
* @return value of operation code
*/
OpCodeMapValueType
getOpCodeMapValue(OpCodeMapPositionType opPos) const
{
assert(opPos < getInitialOpCodePosition() + opCodeMapLength());
#if defined(XALAN_XPATH_EXPRESSION_USE_ITERATORS)
return *opPos;
#else
return m_opMap[opPos];
#endif
}
/**
* Set the value of an operation code at a specified index in the
* OpCode map.
*
* @param theOpCodeMapIndex The index in the OpCode map
* @param theValue value of operation code
*/
void
setOpCodeMapValue(
OpCodeMapSizeType theOpCodeMapIndex,
const OpCodeMapValueType& theValue)
{
assert(theOpCodeMapIndex < opCodeMapLength());
m_opMap[theOpCodeMapIndex] = theValue;
}
OpCodeMapValueType
getOpCodeArgumentLength(OpCodeMapPositionType opPos) const
{
return getOpCodeMapValue(opPos + XPathExpression::s_opCodeMapLengthIndex + 1) - 3;
}
/**
* Retrieve the length of an operation code at a specified position in the
* op map.
*
* @param opPos position in the op map
* @return length of operation code
*/
OpCodeMapValueType
getOpCodeLengthFromOpMap(OpCodeMapPositionType opPos,
MemoryManagerType& theManager) const;
#if defined(XALAN_XPATH_EXPRESSION_USE_ITERATORS)
/**
* Retrieve the length of an operation code at a specified index in the
* op map.
*
* @param theIndex The index in the op map
* @return length of operation code
*/
OpCodeMapValueType
getOpCodeLengthFromOpMap(OpCodeMapSizeType theIndex,
MemoryManagerType& theManager) const;
#endif
#if defined(XALAN_XPATH_EXPRESSION_USE_ITERATORS)
/**
* Retrieve the position of the next operation code at a specified position
* in the list.
*
* @param opPos position in list
* @return position of next operation code
*/
OpCodeMapPositionType
getNextOpCodePosition(OpCodeMapPositionType opPos) const
{
assert(opPos < getInitialOpCodePosition() + opCodeMapLength());
return opPos + *(opPos + s_opCodeMapLengthIndex);
}
#endif
/**
* Retrieve the position of the next operation code at a specified index
* in the list.
*
* @param theIndex theIndex in list
* @return position of next operation code
*/
OpCodeMapSizeType
#if defined(XALAN_XPATH_EXPRESSION_USE_ITERATORS)
getNextOpCodePosition(OpCodeMapSizeType theIndex) const
#else
getNextOpCodePosition(OpCodeMapPositionType theIndex) const
#endif
{
assert(theIndex < opCodeMapLength());
assert(theIndex + m_opMap[theIndex + s_opCodeMapLengthIndex] ==
OpCodeMapSizeType(theIndex + m_opMap[theIndex + s_opCodeMapLengthIndex]));
return OpCodeMapSizeType(theIndex + m_opMap[theIndex + s_opCodeMapLengthIndex]);
}
/**
* Set the arguments for an operation code at a specified index in the
* list.
*
* @param opPos position in list
* @param theOpCode operation code
* @param theIndex index in list
* @param theArgs vector or arguments to supply
*/
void
setOpCodeArgs(
eOpCodes theOpCode,
OpCodeMapSizeType theIndex,
const OpCodeMapValueVectorType& theArgs);
/**
* Add an operation code to the list.
*
* @param theOpCode operation code
* @return the position of the op code
*/
OpCodeMapSizeType
appendOpCode(eOpCodes theOpCode);
/**
* Add an operation code with supplied arguments to the list.
*
* @param theOpCode operation code
* @param theArgs vector or arguments to supply
*/
OpCodeMapSizeType
appendOpCode(
eOpCodes theOpCode,
const OpCodeMapValueVectorType& theArgs)
{
const OpCodeMapSizeType thePosition = appendOpCode(theOpCode);
setOpCodeArgs(theOpCode,
thePosition,
theArgs);
return thePosition;
}
/**
* Replace an operation code with supplied code.
*
* @param theIndex The index of the old operation code
* @param theOldOpCode The old operation code
* @param theNewOpCode The new operation code
*/
void
replaceOpCode(
OpCodeMapSizeType theIndex,
eOpCodes theOldOpCode,
eOpCodes theNewOpCode);
/**
* Insert an operation code at a specified index in the list.
*
* @param theOpCode operation code
* @param theIndex index in list
*/
OpCodeMapValueType
insertOpCode(
eOpCodes theOpCode,
OpCodeMapSizeType theIndex);
/**
* Update the length of an operation code at a specified index in the list.
* This presumes that the other opcodes have been appended to the
* expression, and that the specified op code's length needs to be set.
* The size includes the normal length of the opcode, plus the length of
* its subexpressions.
*
* @param theIndex index in list
*/
void
updateOpCodeLength(OpCodeMapSizeType theIndex)
{
assert(theIndex < opCodeMapSize());
updateOpCodeLength(m_opMap[theIndex], theIndex);
}
/**
* Update the length of an operation code that has moved to a new index in
* the list.
*
* @param theOpCode operation code
* @param theOriginalIndex original index in list
* @param theNewIndex new index in list
*/
void
updateShiftedOpCodeLength(
OpCodeMapValueType theOpCode,
OpCodeMapSizeType theOriginalIndex,
OpCodeMapSizeType theNewIndex);
/**
* Update the length of an operation code at a specified index in the list.
* This presumes that the other opcodes have been appended to the
* expression, and that the specified op code's length needs to be set.
* The size includes the normal length of the opcode, plus the length of
* its subexpressions.
*
* @param theOpCode operation code at specified index
* @param theIndex index in list
*/
void
updateOpCodeLength(
OpCodeMapValueType theOpCode,
OpCodeMapSizeType theIndex);
/**
* Whether the operation code is one of the node test types, for example,
* "ancestor::" or "child::"
*
* @param theOpCode operation code
* @return true if code represents a node test
*/
static bool
isNodeTestOpCode(OpCodeMapValueType theOpCode);
/**
* Update the length of an operation code after a node test code.
*
* @param theIndex index in list
*/
void
updateOpCodeLengthAfterNodeTest(OpCodeMapSizeType theIndex);
/**
* Whether there are any more tokens in the token queue.
*
* @return true if there are more tokens
*/
bool
hasMoreTokens() const
{
return tokenQueueSize() > m_currentPosition ? true : false;
}
/**
* Retrieve number of elements in the token queue.
*
* @return size of token queue
*/
TokenQueueSizeType
tokenQueueSize() const
{
return TokenQueueSizeType(m_tokenQueue.size());
}
bool
isValidTokenQueuePosition(TokenQueueSizeType thePosition) const
{
return thePosition < tokenQueueSize();
}
/**
* Retrieve the current position in the token queue.
*
* @return position in queue
*/
TokenQueueSizeType
getTokenPosition() const
{
return m_currentPosition;
}
/**
* Set the current position in the token queue to zero.
*/
void
resetTokenPosition()
{
m_currentPosition = 0;
}
/**
* Retrieve a token at the specified position in the token queue.
*
* @param thePosition position in queue
* @return pointer to XObject token
*/
const XToken*
getToken(TokenQueuePositionType thePosition) const
{
assert(thePosition < tokenQueueSize());
return &m_tokenQueue[thePosition];
}
/**
* Retrieve the next token in the token queue.
*
* @return pointer to XObject token
*/
const XToken*
getNextToken()
{
if (hasMoreTokens() == true)
{
return getToken(m_currentPosition++);
}
else
{
return 0;
}
}
/**
* Retrieve the previous token in the token queue.
*
* @return pointer to XObject token
*/
const XToken*
getPreviousToken()
{
if (m_currentPosition > 0)
{
return getToken(--m_currentPosition);
}
else
{
return 0;
}
}
enum eRelativeDirection
{
eRelativeBackward,
eRelativeForward
};
/**
* Retrieve a token at the specified offset relative to the current
* position in the token queue.
*
* @param theOffset offset from current position
* @param theDirection the direction in which to move
* @return pointer to XObject token
*/
const XToken*
getRelativeToken(
TokenQueuePositionType theOffset,
eRelativeDirection theDirection) const
{
const TokenQueuePositionType thePosition =
calculateRelativePosition(theOffset, theDirection);
if (thePosition == tokenQueueSize())
{
return 0;
}
else
{
return getToken(thePosition);
}
}
/**
* Push a token onto the token queue.
*
* @param theToken the string value to push
*/
void
pushToken(const XalanDOMString& theToken)
{
m_tokenQueue.push_back(XToken(theToken, getMemoryManager()));
}
/**
* Push a token onto the token queue.
*
* @param theNumber the number value to push
* @param theString the string value to push
*/
void
pushToken(
double theNumber,
const XalanDOMString& theString)
{
m_tokenQueue.push_back(XToken(theNumber, theString));
}
/**
* Insert a token onto the token queue at the
* current position.
*
* @param theToken the string value to push
*/
void
insertToken(const XalanDOMString& theToken)
{
m_tokenQueue.insert(m_tokenQueue.begin() + (m_currentPosition - 1), XToken(theToken, getMemoryManager()));
}
/**
* Insert a token onto the token queue at the
* current position.
*
* @param theNumber the number value to push
* @param theString the string value to push
*/
void
insertToken(
double theNumber,
const XalanDOMString& theString)
{
m_tokenQueue.insert(m_tokenQueue.begin() + (m_currentPosition - 1), XToken(theNumber, theString));
}
/**
* Replace a token in the token queue.
*
* @param theOffset the offset at which to replace the token.
* @param theString The string data for the token. The instance will keep a pointer to this string, so it must be persistent.
*/
void
replaceRelativeToken(
TokenQueuePositionType theOffset,
eRelativeDirection theDirection,
const XalanDOMString& theString)
{
const TokenQueuePositionType thePosition =
calculateRelativePosition(theOffset, theDirection);
assert(thePosition < tokenQueueSize());
m_tokenQueue[thePosition].set(theString, getMemoryManager());
}
/**
* Diagnostic function to output the operation code map.
*
* @param thePrintWriter output device
* @param theStartPosition starting position in map
*/
void
dumpOpCodeMap(
PrintWriter& thePrintWriter,
OpCodeMapSizeType theStartPosition = 0) const;
/**
* Diagnostic function to output the operation code map.
*
* @param theStream output stream
* @param theStartPosition starting position in map
*/
void
dumpOpCodeMap(
OstreamType& theStream,
OpCodeMapSizeType theStartPosition = 0) const;
/**
* Diagnostic function to output the token queue.
*
* @param thePrintWriter output device
* @param theStartPosition starting position in token queue
*/
void
dumpTokenQueue(
PrintWriter& thePrintWriter,
TokenQueueSizeType theStartPosition = 0) const;
/**
* Diagnostic function to output the token queue.
*
* @param thePrintWriter output device
* @param theStartPosition starting position in token queue
*/
void
dumpTokenQueue(
OstreamType& theStream,
TokenQueueSizeType theStartPosition = 0) const;
/**
* Diagnostic function to output the remaining tokens in the token queue.
*
* @param thePrintWriter output device
*/
void
dumpRemainingTokenQueue(PrintWriter& thePrintWriter) const;
/**
* Diagnostic function to output the remaining tokens in the token queue.
*
* @param theStream The output stream
* @param theMemoryManager The MemoryManager instance.
*/
void
dumpRemainingTokenQueue(
OstreamType& theStream,
MemoryManager& theMemoryManager) const;
/**
* Push a value onto the operations code
* map.
*
* @param theToken string value of the token to push
*/
void
pushValueOnOpCodeMap(const OpCodeMapType::value_type& theValue)
{
// Push the index onto the op map.
m_opMap.push_back(theValue);
// Update the op map length.
++m_opMap[s_opCodeMapLengthIndex];
}
/**
* Push a token onto the token queue and its index onto the operations code
* map.
*
* @param theXToken the XToken to push
*/
void
pushArgumentOnOpCodeMap(const XToken& theXToken);
/**
* Push a token onto the token queue and its index onto the operations code
* map.
*
* @param theString The string data for the token. The instance will keep a pointer to this string, so it must be persistent.
*/
void
pushArgumentOnOpCodeMap(const XalanDOMString& theString);
/**
* Push a token onto the token queue and its index onto the operations code
* map.
*
* @param theNumber The numeric data for the token. This must be consistent with the lexical value in theString.
* @param theString The string data for the token. The instance will keep a pointer to this string, so it must be persistent.
*/
void
pushArgumentOnOpCodeMap(
double theNumber,
const XalanDOMString& theString);
/**
* Push a number literal onto the vector of number literals and its index onto
* the operations code map.
*
* @param theToken number value of the token to push
*/
void
pushNumberLiteralOnOpCodeMap(double theNumber);
/**
* Get a number literal from the vector of number literals.
*
* @param theIndex The index of the desired value.
*/
double
getNumberLiteral(int theIndex) const
{
assert(theIndex >= 0 &&
NumberLiteralValueVectorType::size_type(theIndex) < m_numberLiteralValues.size());
return m_numberLiteralValues[NumberLiteralValueVectorType::size_type(theIndex)];
}
/**
* Push the current position in the token queue onto the operations code
* map.
*/
void
pushCurrentTokenOnOpCodeMap();
/**
* Change the current pattern in the pattern map.
*
* @param thePattern match pattern to make current
*/
void
setCurrentPattern(const XalanDOMString& thePattern)
{
m_currentPattern = &thePattern;
}
/**
* Retrieve the current pattern in the pattern map.
*
* @return string for current match pattern
*/
const XalanDOMString&
getCurrentPattern() const
{
assert(m_currentPattern != 0);
return *m_currentPattern;
}
private:
/**
* Calculate the relative token position given the offset
* and direction. Returns the size of the token queue
* if the offset is not valid.
*
* @param theOffset offset from current position
* @param theDirection the direction in which to move
* @return thePosition
*/
TokenQueuePositionType
calculateRelativePosition(
TokenQueuePositionType theOffset,
eRelativeDirection theDirection) const
{
if (theDirection == eRelativeBackward &&
theOffset <= m_currentPosition)
{
return m_currentPosition - theOffset;
}
else if (theDirection == eRelativeForward &&
m_currentPosition + theOffset < tokenQueueSize())
{
return m_currentPosition + theOffset;
}
else
{
return tokenQueueSize();
}
}
/**
* An operations map is used instead of a proper parse tree. It contains
* operations codes and indexes into the m_tokenQueue. We use an array
* instead of a full parse tree in order to cut down on the number of
* objects created.
*/
OpCodeMapType m_opMap;
/**
* The index of the last opcode that was appended or inserted.
*
*/
OpCodeMapSizeType m_lastOpCodeIndex;
/**
* The queue of used tokens. The current token is the token at the end of
* the m_tokenQueue. The idea is that the queue can be marked and a
* sequence of tokens can be reused.
*/
TokenQueueType m_tokenQueue;
/**
* The current position in the token queue.
*/
TokenQueueSizeType m_currentPosition;
/**
* The current pattern string, for diagnostics purposes.
*/
const XalanDOMString* m_currentPattern;
// Default vector allocation sizes.
enum
{
eDefaultOpMapSize = 100,
eDefaultTokenQueueSize = 30
};
NumberLiteralValueVectorType m_numberLiteralValues;
};
XALAN_CPP_NAMESPACE_END
#endif // XPATHEXPRESSION_HEADER_GUARD_1357924680
|