PageRenderTime 121ms CodeModel.GetById 17ms RepoModel.GetById 1ms app.codeStats 0ms

/locationPathExpr.cpp

https://bitbucket.org/aonyung/vtd-xml-c-64
C++ | 2314 lines | 2059 code | 146 blank | 109 comment | 536 complexity | 40f07237d0779123f6a08f3abc598f02 MD5 | raw file
    

  1. /* 

    2. 

  2.  * Copyright (C) 2002-2011 XimpleWare, info@ximpleware.com

    3. 

  3.  *

    4. 

  4.  * This program is free software; you can redistribute it and/or modify

    5. 

  5.  * it under the terms of the GNU General Public License as published by

    6. 

  6.  * the Free Software Foundation; either version 2 of the License, or

    7. 

  7.  * (at your option) any later version.

    8. 

  8.  *

    9. 

  9.  * This program is distributed in the hope that it will be useful,

    10. 

  10.  * but WITHOUT ANY WARRANTY; without even the implied warranty of

    11. 

  11.  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

    12. 

  12.  * GNU General Public License for more details.

    13. 

  13.  *

    14. 

  14.  * You should have received a copy of the GNU General Public License

    15. 

  15.  * along with this program; if not, write to the Free Software

    16. 

  16.  * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

    17. 

  17.  */

    18. 

  18. #include "locationPathExpr.h"

    19. 

  19. #include "autoPilot.h"

    20. 

  20. #include "textIter.h"

    21. 

  21. 

    22. 

  22. using namespace com_ximpleware;

    23. 

  23. 

    24. 

  24. LocationPathExpr::LocationPathExpr() try : 

    25. 

  25. pathType(RELATIVE_PATH),

    26. 

  26. s(NULL),

    27. 

  27. currentStep(NULL),

    28. 

  28. state(XPATH_EVAL_START),

    29. 

  29. ih(new IntHash())

    30. 

  30. {

    31. 

  31. }

    32. 

  32. catch (std::bad_alloc&){

    33. 

  33. 	throw OutOfMemException("Allocation failed for LocationPathExpr");

    34. 

  34. }

    35. 

  35. 

    36. 

  36. LocationPathExpr::~LocationPathExpr(){

    37. 

  37. 	Step *tmp, *tmp2;

    38. 

  38. 	if (s != NULL){

    39. 

  39. 		tmp = s;

    40. 

  40. 		tmp2 = tmp->nextS;

    41. 

  41. 		while(tmp2!=NULL){

    42. 

  42. 			delete(tmp);

    43. 

  43. 			tmp= tmp2;

    44. 

  44. 			tmp2 = tmp2->nextS;

    45. 

  45. 		}

    46. 

  46. 		delete(tmp);

    47. 

  47. 	}

    48. 

  48. 	delete(ih);

    49. 

  49. }

    50. 

  50. 

    51. 

  51. bool LocationPathExpr::evalBoolean(VTDNav *vn){

    52. 

  52. 	bool a = false;

    53. 

  53. 	int size;

    54. 

  54. 	vn->push2();

    55. 

  55. 	// record stack size

    56. 

  56. 	size = vn->contextBuf2->size;

    57. 

  57. 	try{

    58. 

  58. 		a = (evalNodeSet(vn) != -1);

    59. 

  59. 	}catch (...){

    60. 

  60. 	}

    61. 

  61. 	//rewind stack

    62. 

  62. 	vn->contextBuf2->size = size;

    63. 

  63. 	reset(vn);

    64. 

  64. 	vn->pop2();

    65. 

  65. 	return a;

    66. 

  66. }

    67. 

  67. double LocationPathExpr::evalNumber(VTDNav *vn){

    68. 

  68. 	double d = 0.0;

    69. 

  69. 	int a = getStringIndex(vn);

    70. 

  70. 	try{

    71. 

  71. 		if (a!=-1) return vn->parseDouble(a);

    72. 

  72. 	}catch (...){

    73. 

  73. 	}

    74. 

  74. 	return 0/d;

    75. 

  75. }

    76. 

  76. int LocationPathExpr::evalNodeSet(VTDNav *vn){

    77. 

  77.     int result;

    78. 

  78. 	if (currentStep == NULL) {

    79. 

  79. 		if ( pathType ==  ABSOLUTE_PATH){

    80. 

  80. 			vn->toElement(ROOT);

    81. 

  81. 			vn->toElement(PARENT);

    82. 

  82. 		}

    83. 

  83. 		currentStep =  s;

    84. 

  84. 		if (currentStep == NULL){

    85. 

  85. 			if (state ==  XPATH_EVAL_START){

    86. 

  86. 				state = XPATH_EVAL_END;

    87. 

  87. 				return 0;

    88. 

  88. 			}

    89. 

  89. 			else{

    90. 

  90. 				return -1;

    91. 

  91. 			}

    92. 

  92. 		}

    93. 

  93. 	}

    94. 

  94. 

    95. 

  95. 	while (true) {

    96. 

  96. 		switch (currentStep->axis_type) {

    97. 

  97. 			case AXIS_CHILD:

    98. 

  98. 			    if ( (result = process_child(vn))!=-2)

    99. 

  99. 				   return result;

    100. 

  100. 			    break;

    101. 

  101. 			case AXIS_DESCENDANT_OR_SELF:

    102. 

  102. 			case AXIS_DESCENDANT:

    103. 

  103. 			case AXIS_PRECEDING:

    104. 

  104. 			case AXIS_FOLLOWING:

    105. 

  105. 			    if ((result = process_DDFP(vn))!= -2)

    106. 

  106. 			        return result;

    107. 

  107. 			    break;

    108. 

  108. 			case AXIS_PARENT:

    109. 

  109. 			    if ((result = process_parent(vn))!= -2)

    110. 

  110. 			        return result;

    111. 

  111. 			    break;

    112. 

  112. 			case AXIS_ANCESTOR:

    113. 

  113. 			    if ((result = process_ancestor(vn))!= -2)

    114. 

  114. 			        return result;

    115. 

  115. 			    break;

    116. 

  116. 			case AXIS_ANCESTOR_OR_SELF:

    117. 

  117. 			    if ((result = process_ancestor_or_self(vn))!= -2)

    118. 

  118. 			        return result;

    119. 

  119. 			    break;

    120. 

  120. 			case AXIS_SELF:

    121. 

  121. 			    if ((result = process_self(vn))!= -2)

    122. 

  122. 			        return result;

    123. 

  123. 			    break;

    124. 

  124. 			case AXIS_FOLLOWING_SIBLING:

    125. 

  125. 			    if ((result = process_following_sibling(vn))!= -2)

    126. 

  126. 			        return result;

    127. 

  127. 			    break;

    128. 

  128. 			case AXIS_PRECEDING_SIBLING:

    129. 

  129. 			    if ((result = process_preceding_sibling(vn))!= -2)

    130. 

  130. 			        return result;

    131. 

  131. 			    break;

    132. 

  132. 			case AXIS_ATTRIBUTE:

    133. 

  133. 			    if ((result = process_attribute(vn))!= -2)

    134. 

  134. 			        return result;

    135. 

  135. 			    break;

    136. 

  136. 			case AXIS_NAMESPACE:

    137. 

  137. 			    if ((result = process_namespace(vn))!= -2)

    138. 

  138. 			        return result;

    139. 

  139. 				break;

    140. 

  140. 			default:

    141. 

  141. 				throw XPathEvalException("axis not supported");

    142. 

  142. 			}

    143. 

  143. 		}

    144. 

  144. }

    145. 

  145. UCSChar* LocationPathExpr::evalString(VTDNav *vn){

    146. 

  146. 	int a = getStringIndex(vn);

    147. 

  147. 	try {

    148. 

  148. 		if (a != -1)

    149. 

  149. 			return vn->toString(a);

    150. 

  150. 	} catch (std::bad_alloc&) {

    151. 

  151. 		throw;

    152. 

  152. 	}

    153. 

  153. 	return createEmptyString();

    154. 

  154. }

    155. 

  155. 

    156. 

  156. void LocationPathExpr::reset(VTDNav *vn){

    157. 

  157. 	Step *temp = s;

    158. 

  158. 	state = XPATH_EVAL_START;

    159. 

  159. 	ih->reset();

    160. 

  160. 	currentStep = NULL;

    161. 

  161. 	while(temp!=NULL){

    162. 

  162. 		temp->reset_s(vn);

    163. 

  163. 		temp = temp->nextS;

    164. 

  164. 	}

    165. 

  165. }

    166. 

  166. void LocationPathExpr::toString(UCSChar *string){

    167. 

  167. 	Step *ts = s;

    168. 

  168. 	if (pathType == ABSOLUTE_PATH){

    169. 

  169. 		wprintf(L"/");

    170. 

  170. 	}

    171. 

  171. 	if (ts == NULL)

    172. 

  172. 		return;

    173. 

  173. 	else

    174. 

  174. 		ts->toString_s(string);

    175. 

  175. }

    176. 

  176. 

    177. 

  177. bool LocationPathExpr::isNumerical(){return false;}

    178. 

  178. bool LocationPathExpr::isNodeSet(){return true;}

    179. 

  179. bool LocationPathExpr::isString(){return false;}

    180. 

  180. bool LocationPathExpr::isBoolean(){return false;}

    181. 

  181. 

    182. 

  182. bool LocationPathExpr::requireContextSize(){return false;}

    183. 

  183. void LocationPathExpr::setContextSize(int size){}

    184. 

  184. 

    185. 

  185. void LocationPathExpr::setPosition(int pos){}

    186. 

  186. int LocationPathExpr::adjust(int n){

    187. 

  187. 	int i;

    188. 

  188. 	if (pathType == RELATIVE_PATH){

    189. 

  189. 		i= min(6,IntHash::determineHashWidth(n));//hashwidth 64

    190. 

  190. 	} else {

    191. 

  191. 		i=IntHash::determineHashWidth(n);

    192. 

  192. 	}

    193. 

  193. 	if (ih!=NULL && i<=ih->e)

    194. 

  194. 	{}else {

    195. 

  195. 		delete (ih);

    196. 

  196. 		ih =  new IntHash(i);

    197. 

  197. 	}

    198. 

  198. 	Step *temp = s;

    199. 

  199. 	while(temp!=NULL){

    200. 

  200. 		temp->adjust(n);

    201. 

  201. 		temp = temp->nextS;

    202. 

  202. 	}	

    203. 

  203. 	return i;

    204. 

  204. }

    205. 

  205. 

    206. 

  206. 

    207. 

  207. int LocationPathExpr::computeContextSize(Predicate *p, VTDNav *vn){

    208. 

  208. 	bool b = false;

    209. 

  209. 	//Predicate *tp = NULL;

    210. 

  210.     int i = 0;

    211. 

  211.     AutoPilot *ap = (AutoPilot *)currentStep->o;

    212. 

  212. 	UCSChar *helper = NULL;

    213. 

  213. 	switch(currentStep->axis_type){

    214. 

  214.     	case AXIS_CHILD:

    215. 

  215. 			if (currentStep->nt->testType < NT_TEXT){

    216. 

  216.     			b = vn->toElement(FIRST_CHILD);

    217. 

  217.     			if (b) {

    218. 

  218.     				do {

    219. 

  219. 						if (currentStep->eval_s2(vn, p)) {

    220. 

  220. 							i++;

    221. 

  221.     					}

    222. 

  222.     				} while (vn->toElement(NEXT_SIBLING));

    223. 

  223.     				vn->toElement(PARENT);

    224. 

  224. 					currentStep->resetP2_s(vn,p);

    225. 

  225.     				return i;

    226. 

  226.    				} else

    227. 

  227.     				return 0;

    228. 

  228. 			}else {

    229. 

  229. 				int result;

    230. 

  230. 				TextIter* ti = new TextIter();

    231. 

  231. 	    	    ti->touch(vn);

    232. 

  232. 	    	    selectNodeType(ti);

    233. 

  233. 	    	    while((result=ti->getNext())!=-1){

    234. 

  234. 					vn->LN = result;

    235. 

  235. 					vn->atTerminal = true;

    236. 

  236. 	    	        if (currentStep->evalPredicates2(vn,p)){

    237. 

  237. 	    	            i++;

    238. 

  238. 	    	        }

    239. 

  239. 	    	    }

    240. 

  240. 				vn->atTerminal = false;

    241. 

  241. 				currentStep->resetP2_s(vn,p);

    242. 

  242. 	    	    return i;

    243. 

  243. 			}

    244. 

  244. 

    245. 

  245. 		case AXIS_DESCENDANT_OR_SELF:

    246. 

  246. 		case AXIS_DESCENDANT:

    247. 

  247. 		case AXIS_PRECEDING:

    248. 

  248. 		case AXIS_FOLLOWING:

    249. 

  249. 

    250. 

  250. 			if (currentStep->nt->testType == NT_NODE){

    251. 

  251. 				helper = (UCSChar *)L"*";

    252. 

  252. 			}else if (currentStep->nt->testType == NT_NAMETEST){

    253. 

  253. 				helper = currentStep->nt->nodeName;

    254. 

  254. 			}else    			

    255. 

  255. 				throw XPathEvalException(

    256. 

  256. 				   "can't run descendant following, or following-sibling axis over comment(), pi(), and text()");

    257. 

  257. 			if (ap==NULL)

    258. 

  258. 					ap =  new AutoPilot(vn);

    259. 

  259. 				else

    260. 

  260. 					ap->bind(vn);

    261. 

  261. 			if (currentStep->axis_type == AXIS_DESCENDANT_OR_SELF ){

    262. 

  262. 				if (currentStep->nt->testType == NT_NODE)

    263. 

  263. 					ap->setSpecial(true);

    264. 

  264. 				else

    265. 

  265. 					ap->setSpecial(false);

    266. 

  266. 			}

    267. 

  267. 			//currentStep.o = ap = new AutoPilot(vn);

    268. 

  268. 			if (currentStep->axis_type == AXIS_DESCENDANT_OR_SELF)

    269. 

  269. 				if (currentStep->nt->localName!=NULL)

    270. 

  270. 					ap->selectElementNS(currentStep->nt->URL,currentStep->nt->localName);

    271. 

  271. 				else

    272. 

  272. 					ap->selectElement(helper);

    273. 

  273. 			else if (currentStep->axis_type == AXIS_DESCENDANT)

    274. 

  274. 				if (currentStep->nt->localName!=NULL)

    275. 

  275. 					ap->selectElementNS_D(currentStep->nt->URL,currentStep->nt->localName);

    276. 

  276. 				else

    277. 

  277. 					ap->selectElement_D(helper);

    278. 

  278. 			else if (currentStep->axis_type == AXIS_PRECEDING)

    279. 

  279. 				if (currentStep->nt->localName!=NULL)

    280. 

  280. 					ap->selectElementNS_P(currentStep->nt->URL,currentStep->nt->localName);

    281. 

  281. 				else

    282. 

  282. 					ap->selectElement_P(helper);

    283. 

  283. 			else

    284. 

  284. 				if (currentStep->nt->localName!=NULL)

    285. 

  285. 					ap->selectElementNS_F(currentStep->nt->URL,currentStep->nt->localName);

    286. 

  286. 				else

    287. 

  287. 					ap->selectElement_F(helper);

    288. 

  288. 			vn->push2();

    289. 

  289. 			while(ap->iterate()){

    290. 

  290. 				if (currentStep->evalPredicates2(vn,p)){

    291. 

  291. 					i++;

    292. 

  292. 				}

    293. 

  293. 			}

    294. 

  294. 			vn->pop2();

    295. 

  295. 			currentStep->resetP2_s(vn,p);

    296. 

  296. 			currentStep->o= ap;

    297. 

  297. 			//freeAutoPilot(ap);

    298. 

  298. 			return i;

    299. 

  299. 

    300. 

  300. 		case AXIS_PARENT:

    301. 

  301. 			vn->push2();

    302. 

  302. 			i = 0;

    303. 

  303. 			if (vn->toElement( PARENT)){

    304. 

  304. 				if (currentStep->eval_s2(vn,p)){

    305. 

  305. 					i++;

    306. 

  306. 				}

    307. 

  307. 			}

    308. 

  308. 			vn->pop2();

    309. 

  309. 			currentStep->resetP2_s(vn,p);

    310. 

  310. 			return i;

    311. 

  311. 

    312. 

  312. 		case AXIS_ANCESTOR:

    313. 

  313. 			vn->push2();

    314. 

  314. 			i = 0;

    315. 

  315. 			while (vn->toElement(PARENT)) {

    316. 

  316. 				if (currentStep->eval_s2(vn, p)) {

    317. 

  317. 					i++;

    318. 

  318. 				}

    319. 

  319. 			}

    320. 

  320. 			vn->pop2();

    321. 

  321. 			currentStep->resetP2_s(vn,p);

    322. 

  322. 			return i;

    323. 

  323. 

    324. 

  324. 		case AXIS_ANCESTOR_OR_SELF:

    325. 

  325. 			vn->push2();

    326. 

  326. 			i = 0;

    327. 

  327. 			do {

    328. 

  328. 				if (currentStep->eval_s2(vn, p)) {

    329. 

  329. 					i++;

    330. 

  330. 				}

    331. 

  331. 			}while(vn->toElement(PARENT));

    332. 

  332. 			vn->pop2();

    333. 

  333. 			currentStep->resetP2_s(vn,p);

    334. 

  334. 			return i;

    335. 

  335. 

    336. 

  336. 		case AXIS_SELF:

    337. 

  337. 			i = 0;

    338. 

  338. 			if (vn->toElement(PARENT)){

    339. 

  339. 				if (currentStep->eval_s2(vn,p)){

    340. 

  340. 					i++;

    341. 

  341. 				}

    342. 

  342. 			}

    343. 

  343. 			currentStep->resetP2_s(vn,p);

    344. 

  344. 			return i;

    345. 

  345. 

    346. 

  346. 		case AXIS_FOLLOWING_SIBLING:

    347. 

  347. 			vn->push2();

    348. 

  348. 			while(vn->toElement(NEXT_SIBLING)){

    349. 

  349. 				if (currentStep->eval_s2(vn,p)){

    350. 

  350. 					i++;

    351. 

  351. 				}

    352. 

  352. 			}

    353. 

  353. 			vn->pop2();

    354. 

  354. 			currentStep->resetP2_s(vn,p);

    355. 

  355. 			return i;

    356. 

  356. 

    357. 

  357. 		case AXIS_PRECEDING_SIBLING:

    358. 

  358. 			vn->push2();

    359. 

  359. 			while(vn->toElement(PREV_SIBLING)){

    360. 

  360. 				if (currentStep->eval_s2(vn,p)){

    361. 

  361. 					i++;

    362. 

  362. 				}

    363. 

  363. 			}

    364. 

  364. 			vn->pop2();

    365. 

  365. 			currentStep->resetP2_s(vn,p);

    366. 

  366. 			return i;

    367. 

  367. 

    368. 

  368. 		case AXIS_ATTRIBUTE:

    369. 

  369. 			if (ap==NULL)

    370. 

  370. 					ap =  new AutoPilot(vn);

    371. 

  371. 				else

    372. 

  372. 					ap->bind(vn);

    373. 

  373. 			//ap = createAutoPilot(vn);

    374. 

  374. 			if (currentStep->nt->testType == NT_NODE)

    375. 

  375. 				ap->selectAttr((UCSChar *)L"*");

    376. 

  376. 			else if (currentStep->nt->localName!=NULL)

    377. 

  377. 				ap->selectAttrNS(currentStep->nt->URL,

    378. 

  378. 				currentStep->nt->localName);

    379. 

  379. 			else

    380. 

  380. 				ap->selectAttr(currentStep->nt->nodeName);

    381. 

  381. 			i = 0;

    382. 

  382. 			while(ap->iterateAttr2()!=-1){

    383. 

  383. 				if (currentStep->evalPredicates2( vn, p)){

    384. 

  384. 					i++;

    385. 

  385. 				}

    386. 

  386. 			}

    387. 

  387. 			currentStep->resetP2_s(vn,p);

    388. 

  388. 			currentStep->o= ap;

    389. 

  389. 			//freeAutoPilot(ap);

    390. 

  390. 			return i;

    391. 

  391. 

    392. 

  392. 		case AXIS_NAMESPACE:

    393. 

  393. 			if (ap==NULL)

    394. 

  394. 					ap = new AutoPilot(vn);

    395. 

  395. 				else

    396. 

  396. 					ap->bind(vn);

    397. 

  397. 			if (currentStep->nt->testType == NT_NODE)

    398. 

  398. 				ap->selectNameSpace((UCSChar *)L"*");

    399. 

  399. 			else

    400. 

  400. 				ap->selectNameSpace(currentStep->nt->nodeName);

    401. 

  401. 			i = 0;

    402. 

  402. 			while(ap->iterateNameSpace()!=-1){

    403. 

  403. 				if (currentStep->evalPredicates2( vn, p)){

    404. 

  404. 					i++;

    405. 

  405. 				}

    406. 

  406. 			}

    407. 

  407. 			currentStep->resetP2_s(vn,p);

    408. 

  408. 			currentStep->o= ap;

    409. 

  409. 			//freeAutoPilot(ap);

    410. 

  410. 			return i;

    411. 

  411. 

    412. 

  412. 		default:

    413. 

  413. 			throw XPathEvalException("unknown state");

    414. 

  414. 			return 0;

    415. 

  415. 	}

    416. 

  416. }

    417. 

  417. int LocationPathExpr::process_ancestor_or_self(VTDNav *vn){

    418. 

  418. 	bool b = false, b1= false;

    419. 

  419. 	int result;

    420. 

  420. 	//int contextSize;

    421. 

  421. 	Predicate *t= NULL;

    422. 

  422. 

    423. 

  423. 	switch ( state) {

    424. 

  424. 		case  XPATH_EVAL_START:

    425. 

  425. 			t = currentStep->p;

    426. 

  426. 			while (t != NULL) {

    427. 

  427. 				if (t->requireContextSize_p()) {

    428. 

  428. 					int i = computeContextSize(t, vn);

    429. 

  429. 					if (i == 0) {

    430. 

  430. 						b1 = true;

    431. 

  431. 						break;

    432. 

  432. 					} else

    433. 

  433. 						t->setContextSize_p(i);

    434. 

  434. 				}

    435. 

  435. 				t = t->nextP;

    436. 

  436. 			}

    437. 

  437. 			if (b1) {

    438. 

  438. 				state = XPATH_EVAL_END;

    439. 

  439. 				break;

    440. 

  440. 			}

    441. 

  441. 

    442. 

  442. 			state =  XPATH_EVAL_END;

    443. 

  443. 			vn->push2();

    444. 

  444. 

    445. 

  445. 			if (currentStep->get_ft()== true){

    446. 

  446. 				currentStep->set_ft(false);

    447. 

  447. 				if (currentStep->eval_s(vn)) {

    448. 

  448. 					if (currentStep->getNextStep() != NULL) {

    449. 

  449. 						state =  XPATH_EVAL_FORWARD;

    450. 

  450. 						currentStep = currentStep->nextS;

    451. 

  451. 						break;

    452. 

  452. 					} else {

    453. 

  453. 						//vn.pop();

    454. 

  454. 						state =  XPATH_EVAL_TERMINAL;

    455. 

  455. 						if (vn->atTerminal)

    456. 

  456. 							result = vn->LN;

    457. 

  457. 						else

    458. 

  458. 							result = vn->getCurrentIndex();

    459. 

  459. 						if ( isUnique(result))

    460. 

  460. 							return result;

    461. 

  461. 					}

    462. 

  462. 				}

    463. 

  463. 			}

    464. 

  464. 

    465. 

  465. 			while (vn->toElement(PARENT)) {

    466. 

  466. 				if (currentStep->eval_s(vn)) {

    467. 

  467. 					if (currentStep->nextS != NULL) {

    468. 

  468. 						state =  XPATH_EVAL_FORWARD;

    469. 

  469. 						currentStep = currentStep->nextS;

    470. 

  470. 						break;

    471. 

  471. 					} else {

    472. 

  472. 						//vn.pop();

    473. 

  473. 						state =  XPATH_EVAL_TERMINAL;

    474. 

  474. 						result = vn->getCurrentIndex();

    475. 

  475. 						if ( isUnique(result))

    476. 

  476. 							return result;

    477. 

  477. 					}

    478. 

  478. 				}

    479. 

  479. 			}

    480. 

  480. 

    481. 

  481. 			if ( state ==  XPATH_EVAL_END) {

    482. 

  482. 				currentStep->resetP_s( vn);

    483. 

  483. 				vn->pop2();

    484. 

  484. 			}

    485. 

  485. 

    486. 

  486. 			break;

    487. 

  487. 

    488. 

  488. 		case  XPATH_EVAL_FORWARD:

    489. 

  489. 			t = currentStep->p;

    490. 

  490. 			while (t != NULL) {

    491. 

  491. 				if (t->requireContextSize_p()) {

    492. 

  492. 					int i = computeContextSize(t, vn);

    493. 

  493. 					if (i == 0) {

    494. 

  494. 						b1 = true;

    495. 

  495. 						break;

    496. 

  496. 					} else

    497. 

  497. 						t->setContextSize_p(i);

    498. 

  498. 				}

    499. 

  499. 				t = t->nextP;

    500. 

  500. 			}

    501. 

  501. 			if (b1) {

    502. 

  502. 				currentStep = currentStep->prevS;

    503. 

  503. 				state = XPATH_EVAL_BACKWARD;

    504. 

  504. 				break;

    505. 

  505. 			}

    506. 

  506. 

    507. 

  507. 			state =  XPATH_EVAL_BACKWARD;

    508. 

  508. 			vn->push2();

    509. 

  509. 			if (currentStep->ft == true) {

    510. 

  510. 				currentStep->ft= false;

    511. 

  511. 				if (currentStep->eval_s(vn)) {

    512. 

  512. 					if (currentStep->nextS != NULL) {

    513. 

  513. 						state =  XPATH_EVAL_FORWARD;

    514. 

  514. 						currentStep = currentStep->nextS;

    515. 

  515. 						break;

    516. 

  516. 					} else {

    517. 

  517. 						//vn.pop();

    518. 

  518. 						state =  XPATH_EVAL_TERMINAL;

    519. 

  519. 						if (vn->atTerminal)

    520. 

  520. 							result = vn->LN;

    521. 

  521. 						else

    522. 

  522. 							result = vn->getCurrentIndex();

    523. 

  523. 						if ( isUnique(result))

    524. 

  524. 							return result;

    525. 

  525. 					}

    526. 

  526. 				}

    527. 

  527. 			}

    528. 

  528. 			while (vn->toElement(PARENT)) {

    529. 

  529. 				if (currentStep->eval_s(vn)) {

    530. 

  530. 					if (currentStep->nextS != NULL) {

    531. 

  531. 						state =  XPATH_EVAL_FORWARD;

    532. 

  532. 						currentStep = currentStep->nextS;

    533. 

  533. 						break;

    534. 

  534. 					} else {

    535. 

  535. 						//vn.pop();

    536. 

  536. 						state =  XPATH_EVAL_TERMINAL;

    537. 

  537. 						result = vn->getCurrentIndex();

    538. 

  538. 						if ( isUnique(result))

    539. 

  539. 							return result;

    540. 

  540. 					}

    541. 

  541. 				}

    542. 

  542. 			}

    543. 

  543. 

    544. 

  544. 			if ( state ==  XPATH_EVAL_BACKWARD) {

    545. 

  545. 				currentStep->resetP_s(vn);

    546. 

  546. 				currentStep->ft = true;

    547. 

  547. 				vn->pop2();

    548. 

  548. 				currentStep = currentStep->prevS;

    549. 

  549. 			}

    550. 

  550. 			break;

    551. 

  551. 

    552. 

  552. 		case  XPATH_EVAL_END:

    553. 

  553. 			currentStep = NULL;

    554. 

  554. 			// reset();

    555. 

  555. 	    	return -1;

    556. 

  556. 

    557. 

  557. 

    558. 

  558. 		case  XPATH_EVAL_BACKWARD:

    559. 

  559. 			b = false;

    560. 

  560. 			vn->push2();

    561. 

  561. 

    562. 

  562. 			while (vn->toElement(PARENT)) {

    563. 

  563. 				if (currentStep->eval_s(vn)) {

    564. 

  564. 					if (currentStep->nextS != NULL) {

    565. 

  565. 						state =  XPATH_EVAL_FORWARD;

    566. 

  566. 						currentStep = currentStep->nextS;

    567. 

  567. 						b = true;

    568. 

  568. 						break;

    569. 

  569. 					} else {

    570. 

  570. 						//vn.pop();

    571. 

  571. 						state =  XPATH_EVAL_TERMINAL;

    572. 

  572. 						result = vn->getCurrentIndex();

    573. 

  573. 						if ( isUnique(result))

    574. 

  574. 							return result;

    575. 

  575. 					}

    576. 

  576. 				}

    577. 

  577. 			}

    578. 

  578. 			if (b == false) {

    579. 

  579. 				vn->pop2();

    580. 

  580. 				currentStep->resetP_s(vn);

    581. 

  581. 				if (currentStep->prevS != NULL) {

    582. 

  582. 					currentStep->ft = true;

    583. 

  583. 					state =  XPATH_EVAL_BACKWARD;

    584. 

  584. 					currentStep = currentStep->prevS;

    585. 

  585. 				} else {

    586. 

  586. 					state =  XPATH_EVAL_END;

    587. 

  587. 				}

    588. 

  588. 			}

    589. 

  589. 			break;

    590. 

  590. 

    591. 

  591. 		case  XPATH_EVAL_TERMINAL:

    592. 

  592. 			while (vn->toElement(PARENT)) {

    593. 

  593. 				if (currentStep->eval_s(vn)) {

    594. 

  594. 					result = vn->getCurrentIndex();

    595. 

  595. 					if ( isUnique(result))

    596. 

  596. 						return result;

    597. 

  597. 				}

    598. 

  598. 			}

    599. 

  599. 			vn->pop2();

    600. 

  600. 			currentStep->resetP_s(vn);

    601. 

  601. 			if (currentStep->prevS != NULL) {

    602. 

  602. 				currentStep->ft = true;

    603. 

  603. 				state =  XPATH_EVAL_BACKWARD;

    604. 

  604. 				currentStep = currentStep->prevS;

    605. 

  605. 			}

    606. 

  606. 			else {

    607. 

  607. 				 state =  XPATH_EVAL_END;

    608. 

  608. 			}

    609. 

  609. 			break;

    610. 

  610. 

    611. 

  611. 

    612. 

  612. 		default:

    613. 

  613. 			throw XPathEvalException("unknown state");

    614. 

  614. 		}

    615. 

  615. 		return -2;

    616. 

  616. }

    617. 

  617. int LocationPathExpr::process_ancestor(VTDNav *vn){

    618. 

  618. 	int result;

    619. 

  619. 	bool b = false, b1 = false;

    620. 

  620. 	//int contextSize;

    621. 

  621. 	Predicate *t= NULL;

    622. 

  622. 

    623. 

  623. 	switch(state){

    624. 

  624. 			case XPATH_EVAL_START:

    625. 

  625. 				t = currentStep->p;

    626. 

  626. 				while (t != NULL) {

    627. 

  627. 					if (t->requireContextSize_p()) {

    628. 

  628. 						int i = computeContextSize(t, vn);

    629. 

  629. 						if (i == 0) {

    630. 

  630. 							b1 = true;

    631. 

  631. 							break;

    632. 

  632. 						} else

    633. 

  633. 							t->setContextSize_p(i);

    634. 

  634. 					}

    635. 

  635. 					t = t->nextP;

    636. 

  636. 				}

    637. 

  637. 				if (b1) {

    638. 

  638. 					state = XPATH_EVAL_END;

    639. 

  639. 					break;

    640. 

  640. 				}

    641. 

  641. 

    642. 

  642. 				state = XPATH_EVAL_END;

    643. 

  643. 				if (vn->getCurrentDepth() != -1) {

    644. 

  644. 					vn->push2();

    645. 

  645. 

    646. 

  646. 					while (vn->toElement(PARENT)) {

    647. 

  647. 						if (currentStep->eval_s(vn)) {

    648. 

  648. 							if (currentStep->nextS != NULL) {

    649. 

  649. 								state = XPATH_EVAL_FORWARD;

    650. 

  650. 								currentStep = currentStep->nextS;

    651. 

  651. 								break;

    652. 

  652. 							} else {

    653. 

  653. 								//vn.pop();

    654. 

  654. 								state = XPATH_EVAL_TERMINAL;

    655. 

  655. 								result = vn->getCurrentIndex();

    656. 

  656. 								if (isUnique(result))

    657. 

  657. 									return result;

    658. 

  658. 							}

    659. 

  659. 						}

    660. 

  660. 					}

    661. 

  661. 					if (state == XPATH_EVAL_END) {

    662. 

  662. 						currentStep->resetP_s(vn);

    663. 

  663. 						vn->pop2();

    664. 

  664. 					}

    665. 

  665. 				}

    666. 

  666. 				break;

    667. 

  667. 

    668. 

  668. 			case XPATH_EVAL_END:

    669. 

  669. 				currentStep =NULL;

    670. 

  670. 				// reset();

    671. 

  671. 				return -1;

    672. 

  672. 

    673. 

  673. 			case XPATH_EVAL_FORWARD:

    674. 

  674. 				t = currentStep->p;

    675. 

  675. 				while(t!=NULL){

    676. 

  676. 					if (t->requireContextSize_p()){

    677. 

  677. 						int i = computeContextSize(t,vn);

    678. 

  678. 						if (i==0){

    679. 

  679. 							b1 = true;

    680. 

  680. 							break;

    681. 

  681. 						}else

    682. 

  682. 							t->setContextSize_p(i);

    683. 

  683. 					}

    684. 

  684. 					t = t->nextP;

    685. 

  685. 				}

    686. 

  686. 				if (b1){

    687. 

  687. 					currentStep = currentStep->prevS;

    688. 

  688. 					state = XPATH_EVAL_BACKWARD;

    689. 

  689. 					break;

    690. 

  690. 				}

    691. 

  691. 				state =  XPATH_EVAL_BACKWARD;

    692. 

  692. 				vn->push2();

    693. 

  693. 

    694. 

  694. 				while(vn->toElement(PARENT)){

    695. 

  695. 					if (currentStep->eval_s(vn)){

    696. 

  696. 						if (currentStep->nextS != NULL){

    697. 

  697. 							state =  XPATH_EVAL_FORWARD;

    698. 

  698. 							currentStep = currentStep->nextS;

    699. 

  699. 							break;

    700. 

  700. 						}

    701. 

  701. 						else {

    702. 

  702. 							//vn.pop();

    703. 

  703. 							state =  XPATH_EVAL_TERMINAL;

    704. 

  704. 							result = vn->getCurrentIndex();

    705. 

  705. 							if ( isUnique(result))

    706. 

  706. 								return result;

    707. 

  707. 						}

    708. 

  708. 					}

    709. 

  709. 				}

    710. 

  710. 				if ( state== XPATH_EVAL_BACKWARD){

    711. 

  711. 					currentStep->resetP_s(vn);

    712. 

  712. 					vn->pop2();

    713. 

  713. 					currentStep=currentStep->prevS;

    714. 

  714. 				}

    715. 

  715. 				break;

    716. 

  716. 

    717. 

  717. 			case XPATH_EVAL_BACKWARD:

    718. 

  718. 				b = false;

    719. 

  719. 				vn->push2();

    720. 

  720. 

    721. 

  721. 				while (vn->toElement(PARENT)) {

    722. 

  722. 					if (currentStep->eval_s(vn)) {

    723. 

  723. 						if (currentStep->nextS!= NULL) {

    724. 

  724. 							state =  XPATH_EVAL_FORWARD;

    725. 

  725. 							currentStep = currentStep->nextS;

    726. 

  726. 							b = true;

    727. 

  727. 							break;

    728. 

  728. 						} else {

    729. 

  729. 							//vn.pop();

    730. 

  730. 							state =  XPATH_EVAL_TERMINAL;

    731. 

  731. 							result = vn->getCurrentIndex();

    732. 

  732. 							if ( isUnique(result))

    733. 

  733. 								return result;

    734. 

  734. 						}

    735. 

  735. 					}

    736. 

  736. 				}

    737. 

  737. 				if (b==false){

    738. 

  738. 					vn->pop2();

    739. 

  739. 					if (currentStep->prevS!=NULL) {

    740. 

  740. 						currentStep->resetP_s(vn);

    741. 

  741. 						state =  XPATH_EVAL_BACKWARD;

    742. 

  742. 						currentStep = currentStep->prevS;

    743. 

  743. 					}

    744. 

  744. 					else {

    745. 

  745. 						state =  XPATH_EVAL_END;

    746. 

  746. 					}

    747. 

  747. 				}

    748. 

  748. 				break;

    749. 

  749. 

    750. 

  750. 			case XPATH_EVAL_TERMINAL:

    751. 

  751. 				while (vn->toElement(PARENT)) {

    752. 

  752. 					if (currentStep->eval_s(vn)) {

    753. 

  753. 						result = vn->getCurrentIndex();

    754. 

  754. 						if ( isUnique(result))

    755. 

  755. 							return result;

    756. 

  756. 					}

    757. 

  757. 				}

    758. 

  758. 				vn->pop2();

    759. 

  759. 

    760. 

  760. 				if (currentStep->prevS!=NULL) {

    761. 

  761. 					currentStep->resetP_s(vn);

    762. 

  762. 					state =  XPATH_EVAL_BACKWARD;

    763. 

  763. 					currentStep = currentStep->prevS;

    764. 

  764. 				}

    765. 

  765. 				else {

    766. 

  766. 					state =  XPATH_EVAL_END;

    767. 

  767. 				}

    768. 

  768. 				break;

    769. 

  769. 

    770. 

  770. 			default:

    771. 

  771. 				throw XPathEvalException("unknown state");

    772. 

  772. 	}

    773. 

  773. 	return -2;

    774. 

  774. }

    775. 

  775. int LocationPathExpr::process_attribute(VTDNav *vn){

    776. 

  776. 	AutoPilot *ap = NULL;

    777. 

  777. 	bool b1 = false;

    778. 

  778. 	Predicate *t= NULL;

    779. 

  779. 	int temp;

    780. 

  780. 	switch(state){

    781. 

  781. 		case  XPATH_EVAL_START:

    782. 

  782. 		case  XPATH_EVAL_FORWARD:

    783. 

  783. 

    784. 

  784. 			t = currentStep->p;

    785. 

  785. 			while(t!=NULL){

    786. 

  786. 				if (t->requireContextSize_p()){

    787. 

  787. 					int i = computeContextSize(t,vn);

    788. 

  788. 					if (i==0){

    789. 

  789. 						b1 = true;

    790. 

  790. 						break;

    791. 

  791. 					}else

    792. 

  792. 						t->setContextSize_p(i);

    793. 

  793. 				}

    794. 

  794. 				t = t->nextP;

    795. 

  795. 			}

    796. 

  796. 			if (b1){

    797. 

  797. 				if (state == XPATH_EVAL_FORWARD){

    798. 

  798. 					state= XPATH_EVAL_BACKWARD;

    799. 

  799. 					currentStep = currentStep->prevS;

    800. 

  800. 				}else

    801. 

  801. 					state= XPATH_EVAL_END;

    802. 

  802. 				break;

    803. 

  803. 			}

    804. 

  804. 

    805. 

  805. 			if (vn->getAtTerminal()==true){

    806. 

  806. 				if (state ==XPATH_EVAL_START)

    807. 

  807. 					state = XPATH_EVAL_END;

    808. 

  808. 				else {

    809. 

  809. 					state = XPATH_EVAL_BACKWARD;

    810. 

  810. 					currentStep  = currentStep->prevS;

    811. 

  811. 				}

    812. 

  812. 			} else {

    813. 

  813. 				if (currentStep->ft == true) {

    814. 

  814. 					if (currentStep->o == NULL)

    815. 

  815. 						currentStep->o = ap = new AutoPilot(vn);

    816. 

  816. 					else {

    817. 

  817. 						ap = currentStep->o;

    818. 

  818. 						ap->bind(vn);

    819. 

  819. 					}

    820. 

  820. 					if (currentStep->nt->testType== NT_NODE)

    821. 

  821. 						ap->selectAttr((UCSChar *)L"*");

    822. 

  822. 					else if (currentStep->nt->localName != NULL)

    823. 

  823. 						ap->selectAttrNS(currentStep->nt->URL,

    824. 

  824.                                 currentStep->nt->localName);

    825. 

  825. 					else 

    826. 

  826. 						ap->selectAttr(currentStep->nt->nodeName);

    827. 

  827. 					currentStep->ft = false;

    828. 

  828. 				}

    829. 

  829. 				if ( state==  XPATH_EVAL_START)

    830. 

  830. 					state=  XPATH_EVAL_END;

    831. 

  831. 				vn->setAtTerminal(true);

    832. 

  832. 				while( (temp = ap->iterateAttr2()) != -1){

    833. 

  833. 					if (currentStep->evalPredicates(vn)){

    834. 

  834. 						break;

    835. 

  835. 					}

    836. 

  836. 				}

    837. 

  837. 				if (temp == -1){

    838. 

  838. 					currentStep->ft = true;

    839. 

  839. 					currentStep->resetP_s(vn);

    840. 

  840. 					vn->setAtTerminal(false);

    841. 

  841. 					if ( state==  XPATH_EVAL_FORWARD){

    842. 

  842. 						state =  XPATH_EVAL_BACKWARD;

    843. 

  843. 						currentStep = currentStep->prevS;

    844. 

  844. 					}

    845. 

  845. 				}else {

    846. 

  846. 

    847. 

  847. 					if (currentStep->nextS != NULL){

    848. 

  848. 						vn->LN = temp;

    849. 

  849. 						state=  XPATH_EVAL_FORWARD;

    850. 

  850. 						currentStep = currentStep->nextS;

    851. 

  851. 					}

    852. 

  852. 					else {

    853. 

  853. 						//vn.pop();

    854. 

  854. 						state=  XPATH_EVAL_TERMINAL;

    855. 

  855. 						if ( isUnique(temp)){

    856. 

  856. 							vn->LN = temp;

    857. 

  857. 							return temp;

    858. 

  858. 						}

    859. 

  859. 					}

    860. 

  860. 

    861. 

  861. 				}

    862. 

  862. 			}

    863. 

  863. 			break;

    864. 

  864. 

    865. 

  865. 		case  XPATH_EVAL_END:

    866. 

  866. 			currentStep = NULL;

    867. 

  867. 			// reset();

    868. 

  868. 			return -1;

    869. 

  869. 

    870. 

  870. 		case  XPATH_EVAL_BACKWARD:

    871. 

  871. 			ap = currentStep->o;

    872. 

  872. 			//vn.push();

    873. 

  873. 			while( (temp = ap->iterateAttr2()) != -1){

    874. 

  874. 				if (currentStep->evalPredicates(vn)){

    875. 

  875. 					break;

    876. 

  876. 				}

    877. 

  877. 			}

    878. 

  878. 			if (temp == -1) {

    879. 

  879. 				currentStep->ft = true;

    880. 

  880. 				//freeAutoPilot(currentStep->o);

    881. 

  881. 				//currentStep->o = NULL;

    882. 

  882. 				currentStep->resetP_s(vn);

    883. 

  883. 				vn->setAtTerminal(false);

    884. 

  884. 				if (currentStep->prevS != NULL) {

    885. 

  885. 					state =  XPATH_EVAL_BACKWARD;

    886. 

  886. 					currentStep = currentStep->prevS;

    887. 

  887. 				} else

    888. 

  888. 					state =  XPATH_EVAL_END;

    889. 

  889. 			} else {

    890. 

  890. 				if (currentStep->nextS != NULL) {

    891. 

  891. 					state =  XPATH_EVAL_FORWARD;

    892. 

  892. 					currentStep = currentStep->nextS;

    893. 

  893. 				} else {

    894. 

  894. 					state =  XPATH_EVAL_TERMINAL;

    895. 

  895. 					if ( isUnique(temp)){

    896. 

  896. 						vn->LN = temp;

    897. 

  897. 						return temp;

    898. 

  898. 					}

    899. 

  899. 				}

    900. 

  900. 			}

    901. 

  901. 			break;

    902. 

  902. 

    903. 

  903. 		case  XPATH_EVAL_TERMINAL:

    904. 

  904. 			ap = currentStep->o;

    905. 

  905. 			while( (temp = ap->iterateAttr2()) != -1){

    906. 

  906. 				if (currentStep->evalPredicates(vn)){

    907. 

  907. 					break;

    908. 

  908. 				}

    909. 

  909. 			}

    910. 

  910. 			if (temp != -1)

    911. 

  911. 				if (isUnique(temp)){

    912. 

  912. 					vn->LN = temp;

    913. 

  913. 					return temp;

    914. 

  914. 				}

    915. 

  915. 				vn->setAtTerminal(false);

    916. 

  916. 				currentStep->resetP_s(vn);

    917. 

  917. 				if (currentStep->prevS == NULL) {

    918. 

  918. 					currentStep->ft = true;

    919. 

  919. 					//freeAutoPilot(currentStep->o);

    920. 

  920. 					//currentStep->o = NULL;

    921. 

  921. 					state=  XPATH_EVAL_END;

    922. 

  922. 				} else {

    923. 

  923. 					state=  XPATH_EVAL_BACKWARD;

    924. 

  924. 					currentStep->ft = true;

    925. 

  925. 					//freeAutoPilot(currentStep->o);

    926. 

  926. 					//currentStep->o = NULL;

    927. 

  927. 					currentStep = currentStep->prevS;

    928. 

  928. 				}

    929. 

  929. 

    930. 

  930. 				break;

    931. 

  931. 

    932. 

  932. 		default:

    933. 

  933. 			throw XPathEvalException("unknown state");

    934. 

  934. 	}

    935. 

  935. 	return -2;

    936. 

  936. }

    937. 

  937. int LocationPathExpr::process_child(VTDNav *vn){

    938. 

  938. 	int result;

    939. 

  939. 	bool b = false, b1 = false;

    940. 

  940. 	Predicate *t= NULL;

    941. 

  941. 

    942. 

  942. 	switch(state){

    943. 

  943. 				case XPATH_EVAL_START:

    944. 

  944. 					if (currentStep->nt->testType < NT_TEXT){

    945. 

  945. 						/* first search for any predicate that

    946. 

  946. 						// requires contextSize

    947. 

  947. 						// if so, compute its context size

    948. 

  948. 						// if size > 0

    949. 

  949. 						// set context

    950. 

  950. 						// if size ==0

    951. 

  951. 						// immediately set the state to backward or end*/

    952. 

  952. 						t = currentStep->p;

    953. 

  953. 						while(t!=NULL){

    954. 

  954. 							if (t->requireContextSize_p()){

    955. 

  955. 								int i = computeContextSize(t,vn);

    956. 

  956. 								if (i==0){

    957. 

  957. 									b1 = true;

    958. 

  958. 									break;

    959. 

  959. 								}else

    960. 

  960. 									t->setContextSize_p(i);

    961. 

  961. 							}

    962. 

  962. 							t = t->nextP;

    963. 

  963. 						}

    964. 

  964. 						if (b1){

    965. 

  965. 							state= XPATH_EVAL_END;

    966. 

  966. 							break;

    967. 

  967. 						}

    968. 

  968. 

    969. 

  969. 						b=vn->toElement(FIRST_CHILD);

    970. 

  970. 						state=  XPATH_EVAL_END;

    971. 

  971. 						if (b == true){

    972. 

  972. 						 do {

    973. 

  973. 							 if (currentStep->eval_s(vn)) {

    974. 

  974. 								 if (currentStep->nextS != NULL){

    975. 

  975. 									 //currentStep.position++;

    976. 

  976. 									 state=  XPATH_EVAL_FORWARD;

    977. 

  977. 									 currentStep = currentStep->nextS;

    978. 

  978. 								 }

    979. 

  979. 								 else {

    980. 

  980. 									 state=  XPATH_EVAL_TERMINAL;

    981. 

  981. 									 result = vn->getCurrentIndex();

    982. 

  982. 									 if ( isUnique(result)){

    983. 

  983. 										 return result;

    984. 

  984. 									 }

    985. 

  985. 								 }

    986. 

  986. 								 break;

    987. 

  987. 							 }

    988. 

  988. 						 } while (vn->toElement(NEXT_SIBLING));

    989. 

  989. 						 if (state == XPATH_EVAL_END)

    990. 

  990. 							 vn->toElement(PARENT);

    991. 

  991. 					 }

    992. 

  992. 					}else {

    993. 

  993. 						TextIter *ti = NULL;

    994. 

  994. 						if (vn->getAtTerminal()==true){

    995. 

  995. 							state = XPATH_EVAL_END;

    996. 

  996. 						}else {

    997. 

  997. 						    // compute context size;

    998. 

  998. 						    t = currentStep->p;

    999. 

  999. 			    	        while(t!=NULL){

    1000. 

  1000. 			    	            if (t->requireContextSize_p()){

    1001. 

  1001. 			    	                int i = computeContextSize(t,vn);

    1002. 

  1002. 			    	                if (i==0){

    1003. 

  1003. 			    	                    b1 = true;

    1004. 

  1004. 			    	                    break;

    1005. 

  1005. 			    	                }else

    1006. 

  1006. 			    	                    t->setContextSize_p(i);

    1007. 

  1007. 			    	            }

    1008. 

  1008. 			    	            t = t->nextP;

    1009. 

  1009. 			    	        }

    1010. 

  1010. 			    	        // b1 false indicate context size is zero. no need to go any further...

    1011. 

  1011. 			    	        if (b1){

    1012. 

  1012. 			    	            state = XPATH_EVAL_END;

    1013. 

  1013. 			    	            break;

    1014. 

  1014. 			    	        }

    1015. 

  1015. 			    	        // get textIter

    1016. 

  1016. 						    if (currentStep->o != NULL){

    1017. 

  1017. 						        ti = (TextIter*) currentStep->o;

    1018. 

  1018. 						    } else {

    1019. 

  1019. 						        ti = new TextIter();

    1020. 

  1020. 						        currentStep->o = (AutoPilot *)ti;

    1021. 

  1021. 						    }

    1022. 

  1022. 							selectNodeType(ti);

    1023. 

  1023. 						    ti->touch(vn);

    1024. 

  1024. 						    state = XPATH_EVAL_END;

    1025. 

  1025. 						    while((result = ti->getNext())!=-1){

    1026. 

  1026. 								vn->LN = result;

    1027. 

  1027. 								vn->atTerminal = true;

    1028. 

  1028. 								if (currentStep->evalPredicates(vn)){

    1029. 

  1029. 									break;

    1030. 

  1030. 								}

    1031. 

  1031. 						    }

    1032. 

  1032. 						    // old code

    1033. 

  1033. 							//result = vn.getText();

    1034. 

  1034. 							if (result != -1){

    1035. 

  1035. 								vn->setAtTerminal(true);

    1036. 

  1036. 								//currentStep.resetP(vn);

    1037. 

  1037. 								vn->LN = result;

    1038. 

  1038. 								if (currentStep->getNextStep() != NULL){

    1039. 

  1039. 								    vn->LN = result;

    1040. 

  1040. 				   				    state =  XPATH_EVAL_FORWARD;

    1041. 

  1041. 									currentStep = currentStep->getNextStep();

    1042. 

  1042. 								}

    1043. 

  1043. 								else {

    1044. 

  1044. 									//vn.pop();

    1045. 

  1045. 									state =  XPATH_EVAL_TERMINAL;

    1046. 

  1046. 									if (isUnique(result)){

    1047. 

  1047. 									    vn->LN = result;

    1048. 

  1048. 										return result;

    1049. 

  1049. 									}

    1050. 

  1050. 								}

    1051. 

  1051. 							} else{

    1052. 

  1052. 								//currentStep.set_ft(true);

    1053. 

  1053. 								currentStep->resetP_s(vn);

    1054. 

  1054. 								vn->setAtTerminal( false);

    1055. 

  1055. 							}

    1056. 

  1056. 						}

    1057. 

  1057. 					}

    1058. 

  1058. 					break;

    1059. 

  1059. 				case XPATH_EVAL_END:

    1060. 

  1060. 					currentStep =NULL;

    1061. 

  1061. 					// reset();

    1062. 

  1062. 					return -1;

    1063. 

  1063. 

    1064. 

  1064. 				case XPATH_EVAL_FORWARD:

    1065. 

  1065. 					if (currentStep->nt->testType < NT_TEXT){

    1066. 

  1066. 						t = currentStep->p;

    1067. 

  1067. 						while(t!=NULL){

    1068. 

  1068. 							if (t->requireContextSize_p()){

    1069. 

  1069. 								int i = computeContextSize( t,vn);

    1070. 

  1070. 								if (i==0){

    1071. 

  1071. 									b1 = true;

    1072. 

  1072. 									break;

    1073. 

  1073. 								}else

    1074. 

  1074. 									t->setContextSize_p(i);

    1075. 

  1075. 							}

    1076. 

  1076. 							t = t->nextP;

    1077. 

  1077. 						}

    1078. 

  1078. 						if (b1){

    1079. 

  1079. 							currentStep = currentStep->prevS;

    1080. 

  1080. 							state= XPATH_EVAL_BACKWARD;

    1081. 

  1081. 							break;

    1082. 

  1082. 						}

    1083. 

  1083. 

    1084. 

  1084. 						state =  XPATH_EVAL_BACKWARD;

    1085. 

  1085. 						if (vn->toElement(FIRST_CHILD)) {

    1086. 

  1086. 							do {

    1087. 

  1087. 								if (currentStep->eval_s(vn)) {

    1088. 

  1088. 									if (currentStep->nextS != NULL) {

    1089. 

  1089. 										state=  XPATH_EVAL_FORWARD;

    1090. 

  1090. 										currentStep = currentStep->nextS;

    1091. 

  1091. 									} else {

    1092. 

  1092. 										state=  XPATH_EVAL_TERMINAL;

    1093. 

  1093. 										result = vn->getCurrentIndex();

    1094. 

  1094. 										if ( isUnique(result))

    1095. 

  1095. 											return result;

    1096. 

  1096. 									}

    1097. 

  1097. 									goto forward;

    1098. 

  1098. 								}

    1099. 

  1099. 							} while (vn->toElement(NEXT_SIBLING));

    1100. 

  1100. 							vn->toElement(PARENT);

    1101. 

  1101. 							currentStep->resetP_s(vn);

    1102. 

  1102. 							currentStep = currentStep->prevS;

    1103. 

  1103. 						} else {

    1104. 

  1104. 							//vn.toElement(VTDNav.P);

    1105. 

  1105. 							currentStep = currentStep->prevS;

    1106. 

  1106. 						}

    1107. 

  1107. forward:;

    1108. 

  1108. 					}else {

    1109. 

  1109. 						TextIter *ti = NULL;

    1110. 

  1110. 

    1111. 

  1111.  // predicate at an attribute is not evaled

    1112. 

  1112. 						if (vn->getAtTerminal() == true){

    1113. 

  1113. 							state =  XPATH_EVAL_BACKWARD;

    1114. 

  1114. 							currentStep = currentStep->getPrevStep();

    1115. 

  1115. 						}else {

    1116. 

  1116. 						    // compute context size;

    1117. 

  1117. 						    t = currentStep->p;

    1118. 

  1118. 			    	        while(t!=NULL){

    1119. 

  1119. 			    	            if (t->requireContextSize_p()){

    1120. 

  1120. 			    	                int i = computeContextSize(t,vn);

    1121. 

  1121. 			    	                if (i==0){

    1122. 

  1122. 			    	                    b1 = true;

    1123. 

  1123. 			    	                    break;

    1124. 

  1124. 			    	                }else

    1125. 

  1125. 			    	                    t->setContextSize_p(i);

    1126. 

  1126. 			    	            }

    1127. 

  1127. 			    	            t = t->nextP;

    1128. 

  1128. 			    	        }

    1129. 

  1129. 			    	        // b1 false indicate context size is zero. no need to go any further...

    1130. 

  1130. 			    	        if (b1){

    1131. 

  1131. 			    	            state =  XPATH_EVAL_BACKWARD;

    1132. 

  1132. 			    	            break;

    1133. 

  1133. 			    	        }

    1134. 

  1134. 			    	        // get textIter

    1135. 

  1135. 						    if (currentStep->o != NULL){

    1136. 

  1136. 						        ti = (TextIter*) currentStep->o;

    1137. 

  1137. 						    } else {

    1138. 

  1138. 						        ti = new TextIter();

    1139. 

  1139. 						        currentStep->o = (AutoPilot *)ti;

    1140. 

  1140. 						    }

    1141. 

  1141. 						    ti->touch(vn);

    1142. 

  1142. 							selectNodeType(ti);

    1143. 

  1143. 						    //result = ti.getNext();

    1144. 

  1144. 

    1145. 

  1145. 						    while((result = ti->getNext())!=-1){

    1146. 

  1146. 								vn->LN = result;

    1147. 

  1147. 								vn->atTerminal = true;

    1148. 

  1148. 								if (currentStep->evalPredicates(vn)){

    1149. 

  1149. 									break;

    1150. 

  1150. 								}

    1151. 

  1151. 						    }

    1152. 

  1152. 

    1153. 

  1153. 			                if (result == -1) {

    1154. 

  1154. 			                    //currentStep.set_ft(true);

    1155. 

  1155. 			                    //currentStep.resetP(vn);

    1156. 

  1156. 			                    vn->setAtTerminal( false);

    1157. 

  1157. 			                    if (state ==  XPATH_EVAL_FORWARD) {

    1158. 

  1158. 			                        state =  XPATH_EVAL_BACKWARD;

    1159. 

  1159. 									currentStep = currentStep->getPrevStep();

    1160. 

  1160. 			                    }

    1161. 

  1161. 			                } else {

    1162. 

  1162. 								vn->setAtTerminal( true);

    1163. 

  1163. 			                    if (currentStep->getNextStep() != NULL) {

    1164. 

  1164. 			                        vn->LN = result;

    1165. 

  1165. 			                        state =  XPATH_EVAL_FORWARD;

    1166. 

  1166. 			                        currentStep = currentStep->getNextStep();

    1167. 

  1167. 			                    } else {

    1168. 

  1168. 			                        //vn.pop();

    1169. 

  1169. 			                        state =  XPATH_EVAL_TERMINAL;

    1170. 

  1170. 			                        if (isUnique(result)) {

    1171. 

  1171. 			                            vn->LN = result;

    1172. 

  1172. 			                            return result;

    1173. 

  1173. 			                        }

    1174. 

  1174. 			                    }

    1175. 

  1175. 			                }

    1176. 

  1176. 						}

    1177. 

  1177. 

    1178. 

  1178. 					}

    1179. 

  1179. 

    1180. 

  1180. 					break;

    1181. 

  1181. 

    1182. 

  1182. 				case XPATH_EVAL_BACKWARD:

    1183. 

  1183. 					if (currentStep->nt->testType < NT_TEXT) {

    1184. 

  1184. 						b = false;

    1185. 

  1185. 						while (vn->toElement(NEXT_SIBLING)) {

    1186. 

  1186. 							if (currentStep->eval_s(vn)) {

    1187. 

  1187. 								b = true;

    1188. 

  1188. 								break;

    1189. 

  1189. 							}

    1190. 

  1190. 						}

    1191. 

  1191. 						if (b == true) {

    1192. 

  1192. 							state=  XPATH_EVAL_FORWARD;

    1193. 

  1193. 							currentStep = currentStep->nextS;

    1194. 

  1194. 						} else if (currentStep->prevS == NULL){

    1195. 

  1195. 							currentStep->resetP_s(vn);

    1196. 

  1196. 							vn->toElement(PARENT);

    1197. 

  1197. 							state=  XPATH_EVAL_END;

    1198. 

  1198. 						}

    1199. 

  1199. 						else {

    1200. 

  1200. 							currentStep->resetP_s(vn);

    1201. 

  1201. 							state=  XPATH_EVAL_BACKWARD;

    1202. 

  1202. 							vn->toElement(PARENT);

    1203. 

  1203. 							currentStep = currentStep->prevS;

    1204. 

  1204. 						}

    1205. 

  1205. 					}else {

    1206. 

  1206. 						vn->setAtTerminal(false);

    1207. 

  1207. 						if (currentStep->prevS == NULL)

    1208. 

  1208. 							state=  XPATH_EVAL_END;

    1209. 

  1209. 						else {

    1210. 

  1210. 							state=  XPATH_EVAL_BACKWARD;

    1211. 

  1211. 							currentStep = currentStep->prevS;

    1212. 

  1212. 						}

    1213. 

  1213. 					}

    1214. 

  1214. 					break;

    1215. 

  1215. 

    1216. 

  1216. 				case XPATH_EVAL_TERMINAL:

    1217. 

  1217. 					if (currentStep->nt->testType < NT_TEXT) {

    1218. 

  1218. 						while (vn->toElement(NEXT_SIBLING)) {

    1219. 

  1219. 							if (currentStep->eval_s(vn)) {

    1220. 

  1220. 								result = vn->getCurrentIndex();

    1221. 

  1221. 								if ( isUnique(result))

    1222. 

  1222. 									return result;

    1223. 

  1223. 							}

    1224. 

  1224. 						}

    1225. 

  1225. 						currentStep->resetP_s(vn);

    1226. 

  1226. 						if (currentStep->prevS == NULL){

    1227. 

  1227. 							state=  XPATH_EVAL_END;

    1228. 

  1228. 							vn->toElement(PARENT);

    1229. 

  1229. 						}

    1230. 

  1230. 						else {

    1231. 

  1231. 							vn->toElement(PARENT);

    1232. 

  1232. 

    1233. 

  1233. 							state=  XPATH_EVAL_BACKWARD;

    1234. 

  1234. 							currentStep = currentStep->prevS;

    1235. 

  1235. 						}

    1236. 

  1236. 					}else {

    1237. 

  1237. 						TextIter* ti = (TextIter*) currentStep->o;

    1238. 

  1238. 					    while ((result= ti->getNext())!=-1) {

    1239. 

  1239. 							vn->LN = result;

    1240. 

  1240. 							vn->atTerminal = true;

    1241. 

  1241. 							if (currentStep->evalPredicates(vn)) {

    1242. 

  1242. 					            if ( isUnique(result))

    1243. 

  1243. 									return result;

    1244. 

  1244. 					        }

    1245. 

  1245. 					    }

    1246. 

  1246. 						currentStep->resetP_s( vn);

    1247. 

  1247. 						vn->setAtTerminal( false);

    1248. 

  1248. 						if (currentStep->getPrevStep() == NULL)

    1249. 

  1249. 							 state=  XPATH_EVAL_END;

    1250. 

  1250. 						else {

    1251. 

  1251. 							 state=  XPATH_EVAL_BACKWARD;

    1252. 

  1252. 							 currentStep = currentStep->getPrevStep();

    1253. 

  1253. 						}

    1254. 

  1254. 						///////////////////////////////

    1255. 

  1255. 					}

    1256. 

  1256. 					break;

    1257. 

  1257. 

    1258. 

  1258. 				default:

    1259. 

  1259. 					throw XPathEvalException("unknown state");

    1260. 

  1260. 	}

    1261. 

  1261. 	return -2;

    1262. 

  1262. }

    1263. 

  1263. int LocationPathExpr::process_DDFP(VTDNav *vn){

    1264. 

  1264. 	AutoPilot *ap;

    1265. 

  1265. 	bool b = false, b1 = false;

    1266. 

  1266. 	Predicate *t= NULL;

    1267. 

  1267. 	int result;

    1268. 

  1268. 	UCSChar *helper;

    1269. 

  1269. 	switch(state){

    1270. 

  1270. 			case XPATH_EVAL_START:

    1271. 

  1271. 			case XPATH_EVAL_FORWARD:

    1272. 

  1272. 				if (vn->atTerminal){

    1273. 

  1273. 					if (state == XPATH_EVAL_START)

    1274. 

  1274. 						state= XPATH_EVAL_END;

    1275. 

  1275. 					else {

    1276. 

  1276. 						// no need to set_ft to true

    1277. 

  1277. 						// no need to resetP

    1278. 

  1278. 						state= XPATH_EVAL_BACKWARD;

    1279. 

  1279. 						currentStep = currentStep->prevS;

    1280. 

  1280. 					}

    1281. 

  1281. 					break;

    1282. 

  1282. 				}

    1283. 

  1283. 

    1284. 

  1284. 				t = currentStep->p;

    1285. 

  1285. 				while(t!=NULL){

    1286. 

  1286. 					if (t->requireContextSize_p()){

    1287. 

  1287. 						int i = computeContextSize( t,vn);

    1288. 

  1288. 						if (i==0){

    1289. 

  1289. 							b1 = true;

    1290. 

  1290. 							break;

    1291. 

  1291. 						}else

    1292. 

  1292. 							t->setContextSize_p(i);

    1293. 

  1293. 					}

    1294. 

  1294. 					t = t->nextP;

    1295. 

  1295. 				}

    1296. 

  1296. 				if (b1){

    1297. 

  1297. 					if (state ==XPATH_EVAL_START)

    1298. 

  1298. 						state= XPATH_EVAL_END;

    1299. 

  1299. 					else {

    1300. 

  1300. 						currentStep = currentStep->prevS;

    1301. 

  1301. 						state= XPATH_EVAL_BACKWARD;

    1302. 

  1302. 					}

    1303. 

  1303. 					break;

    1304. 

  1304. 				}

    1305. 

  1305. 

    1306. 

  1306. 

    1307. 

  1307. 				helper = NULL;

    1308. 

  1308. 				if (currentStep->nt->testType == NT_NAMETEST){

    1309. 

  1309. 					helper = currentStep->nt->nodeName;

    1310. 

  1310. 				}else if (currentStep->nt->testType == NT_NODE){

    1311. 

  1311. 					helper = (UCSChar *) L"*";

    1312. 

  1312. 				}else

    1313. 

  1313.     				throw XPathEvalException(

    1314. 

  1314. 					"can't run descendant following, or following-sibling axis over comment(), pi(), and text()"); 

    1315. 

  1315. 				if (currentStep->o == NULL)

    1316. 

  1316. 					currentStep->o = ap = new AutoPilot(vn);

    1317. 

  1317. 				else{

    1318. 

  1318. 					ap = currentStep->o;

    1319. 

  1319. 					ap->bind(vn);

    1320. 

  1320. 				}

    1321. 

  1321. 				if (currentStep->ft == true) {

    1322. 

  1322. 

    1323. 

  1323. 					if (currentStep->axis_type == AXIS_DESCENDANT_OR_SELF ){

    1324. 

  1324. 						if (currentStep->nt->testType == NT_NODE)

    1325. 

  1325. 							ap->setSpecial(true);

    1326. 

  1326. 						else

    1327. 

  1327. 							ap->setSpecial(false);

    1328. 

  1328. 					}

    1329. 

  1329. 					//currentStep.o = ap = createAutoPilot(vn);

    1330. 

  1330. 					if (currentStep->axis_type == AXIS_DESCENDANT_OR_SELF)

    1331. 

  1331. 						ap->selectElement(helper);

    1332. 

  1332. 					else if (currentStep->axis_type == AXIS_DESCENDANT)

    1333. 

  1333. 						ap->selectElement_D(helper);

    1334. 

  1334. 					else if (currentStep->axis_type == AXIS_PRECEDING)

    1335. 

  1335. 						ap->selectElement_P(helper);

    1336. 

  1336. 					else

    1337. 

  1337. 						ap->selectElement_F(helper);

    1338. 

  1338. 					currentStep->ft = false;

    1339. 

  1339. 				}

    1340. 

  1340. 				if ( state==  XPATH_EVAL_START)

    1341. 

  1341. 					state=  XPATH_EVAL_END;

    1342. 

  1342. 

    1343. 

  1343. 				vn->push2(); // not the most efficient. good for now

    1344. 

  1344. 				//System.out.println("  --++ push in //");

    1345. 

  1345. 				b = false;

    1346. 

  1346. 				while(ap->iterate()){

    1347. 

  1347. 					if (currentStep->evalPredicates(vn)){

    1348. 

  1348. 						b = true;

    1349. 

  1349. 						break;

    1350. 

  1350. 					}

    1351. 

  1351. 				}

    1352. 

  1352. 				if (b == false) {

    1353. 

  1353. 					vn->pop2();

    1354. 

  1354. 					//System.out.println("  --++ pop in //");

    1355. 

  1355. 					currentStep->ft = true;

    1356. 

  1356. 					currentStep->resetP_s(vn);

    1357. 

  1357. 					if ( state==  XPATH_EVAL_FORWARD){

    1358. 

  1358. 						state =  XPATH_EVAL_BACKWARD;

    1359. 

  1359. 						currentStep = currentStep->prevS;

    1360. 

  1360. 					}

    1361. 

  1361. 				} else {

    1362. 

  1362. 					if (currentStep->nextS != NULL){

    1363. 

  1363. 						state =  XPATH_EVAL_FORWARD;

    1364. 

  1364. 						currentStep = currentStep->nextS;

    1365. 

  1365. 					}

    1366. 

  1366. 					else {

    1367. 

  1367. 						//vn.pop();

    1368. 

  1368. 						state =  XPATH_EVAL_TERMINAL;

    1369. 

  1369. 						result = vn->getCurrentIndex();

    1370. 

  1370. 						if ( isUnique(result))

    1371. 

  1371. 							return result;

    1372. 

  1372. 					}

    1373. 

  1373. 				}

    1374. 

  1374. 				break;

    1375. 

  1375. 

    1376. 

  1376. 			case XPATH_EVAL_END:

    1377. 

  1377. 				currentStep = NULL;

    1378. 

  1378. 				// reset();

    1379. 

  1379. 				return -1;

    1380. 

  1380. 

    1381. 

  1381. 			case XPATH_EVAL_BACKWARD:

    1382. 

  1382. 				//currentStep = currentStep->prevS;

    1383. 

  1383. 				ap = currentStep->o;

    1384. 

  1384. 				//vn.push();

    1385. 

  1385. 				b = false;

    1386. 

  1386. 				while(ap->iterate()){

    1387. 

  1387. 					if (currentStep->evalPredicates(vn)){

    1388. 

  1388. 						b = true;

    1389. 

  1389. 						break;

    1390. 

  1390. 					}

    1391. 

  1391. 				}

    1392. 

  1392. 				if (b == false) {

    1393. 

  1393. 					vn->pop2();

    1394. 

  1394. 					currentStep->ft = true;

    1395. 

  1395. 					currentStep->resetP_s(vn);

    1396. 

  1396. 					//System.out.println("  --++ pop in //");

    1397. 

  1397. 					if (currentStep->prevS != NULL) {

    1398. 

  1398. 						state=  XPATH_EVAL_BACKWARD;

    1399. 

  1399. 						currentStep = currentStep->prevS;

    1400. 

  1400. 					} else

    1401. 

  1401. 						state=  XPATH_EVAL_END;

    1402. 

  1402. 				} else {

    1403. 

  1403. 					if (currentStep->nextS != NULL) {

    1404. 

  1404. 						//vn.push();

    1405. 

  1405. 						//System.out.println("  --++ push in //");

    1406. 

  1406. 						state=  XPATH_EVAL_FORWARD;

    1407. 

  1407. 						currentStep = currentStep->nextS;

    1408. 

  1408. 					} else {

    1409. 

  1409. 						state=  XPATH_EVAL_TERMINAL;

    1410. 

  1410. 						result = vn->getCurrentIndex();

    1411. 

  1411. 						if ( isUnique(result))

    1412. 

  1412. 							return result;

    1413. 

  1413. 					}

    1414. 

  1414. 				}

    1415. 

  1415. 				break;

    1416. 

  1416. 

    1417. 

  1417. 			case XPATH_EVAL_TERMINAL:

    1418. 

  1418. 				ap = currentStep->o;

    1419. 

  1419. 				b = false;

    1420. 

  1420. 				while (ap->iterate()) {

    1421. 

  1421. 					if (currentStep->evalPredicates(vn)) {

    1422. 

  1422. 						b = true;

    1423. 

  1423. 						break;

    1424. 

  1424. 					}

    1425. 

  1425. 				}

    1426. 

  1426. 				if (b == true) {

    1427. 

  1427. 					if (currentStep->evalPredicates(vn)) {

    1428. 

  1428. 						result = vn->getCurrentIndex();

    1429. 

  1429. 						if (isUnique(result))

    1430. 

  1430. 							return result;

    1431. 

  1431. 					}

    1432. 

  1432. 				} else if (currentStep->prevS == NULL) {

    1433. 

  1433. 					currentStep->resetP_s(vn);

    1434. 

  1434. 					vn->pop2();

    1435. 

  1435. 					state= XPATH_EVAL_END;

    1436. 

  1436. 				} else {

    1437. 

  1437. 					vn->pop2();

    1438. 

  1438. 					currentStep->ft = true;

    1439. 

  1439. 					currentStep->resetP_s(vn);

    1440. 

  1440. 					//System.out.println(" --++ pop in //");

    1441. 

  1441. 					state= XPATH_EVAL_BACKWARD;

    1442. 

  1442. 					//currentStep.ft = true;

    1443. 

  1443. 					currentStep = currentStep->prevS;

    1444. 

  1444. 				}

    1445. 

  1445. 				break;

    1446. 

  1446. 

    1447. 

  1447. 			default:

    1448. 

  1448. 				throw XPathEvalException(

    1449. 

  1449. 					"unknown state");

    1450. 

  1450. 	}

    1451. 

  1451. 	return -2;

    1452. 

  1452. }

    1453. 

  1453. int LocationPathExpr::process_following_sibling(VTDNav *vn){

    1454. 

  1454. 

    1455. 

  1455. 	bool b = false, b1 = false;

    1456. 

  1456. 	//int contextSize;

    1457. 

  1457. 	Predicate *t= NULL;

    1458. 

  1458. 	int result;

    1459. 

  1459. 	switch( state){

    1460. 

  1460. 		  case  XPATH_EVAL_START:

    1461. 

  1461. 		  case  XPATH_EVAL_FORWARD:

    1462. 

  1462. 

    1463. 

  1463. 			  t = currentStep->p;

    1464. 

  1464. 			  while(t!=NULL){

    1465. 

  1465. 				  if (t->requireContextSize_p()){

    1466. 

  1466. 					  int i = computeContextSize( t,vn);

    1467. 

  1467. 					  if (i==0){

    1468. 

  1468. 						  b1 = true;

    1469. 

  1469. 						  break;

    1470. 

  1470. 					  }else

    1471. 

  1471. 						  t->setContextSize_p(i);

    1472. 

  1472. 				  }

    1473. 

  1473. 				  t = t->nextP;

    1474. 

  1474. 			  }

    1475. 

  1475. 			  if (b1){

    1476. 

  1476. 				  if (state == XPATH_EVAL_FORWARD){

    1477. 

  1477. 					  state= XPATH_EVAL_BACKWARD;

    1478. 

  1478. 					  currentStep = currentStep->prevS;

    1479. 

  1479. 				  }else

    1480. 

  1480. 					  state= XPATH_EVAL_END;

    1481. 

  1481. 				  break;

    1482. 

  1482. 			  }

    1483. 

  1483. 			  if ( state==  XPATH_EVAL_START)

    1484. 

  1484. 				  state=  XPATH_EVAL_END;

    1485. 

  1485. 			  else

    1486. 

  1486. 				  state=  XPATH_EVAL_BACKWARD;

    1487. 

  1487. 			  vn->push2();

    1488. 

  1488. 			  while (vn->toElement(NEXT_SIBLING)){

    1489. 

  1489. 				  if (currentStep->eval_s(vn)){

    1490. 

  1490. 					  if (currentStep->nextS!=NULL){

    1491. 

  1491. 						  state=  XPATH_EVAL_FORWARD;

    1492. 

  1492. 						  currentStep = currentStep->nextS;

    1493. 

  1493. 						  break;

    1494. 

  1494. 					  } else {

    1495. 

  1495. 						  state=  XPATH_EVAL_TERMINAL;

    1496. 

  1496. 						  result = vn->getCurrentIndex();

    1497. 

  1497. 						  if ( isUnique(result))

    1498. 

  1498. 							  return result;

    1499. 

  1499. 					  }

    1500. 

  1500. 				  }

    1501. 

  1501. 			  }

    1502. 

  1502. 

    1503. 

  1503. 			  if ( state==  XPATH_EVAL_END){

    1504. 

  1504. 				  currentStep->resetP_s(vn);

    1505. 

  1505. 				  vn->pop2();

    1506. 

  1506. 			  }else if ( state==  XPATH_EVAL_BACKWARD){

    1507. 

  1507. 				  currentStep->resetP_s(vn);

    1508. 

  1508. 				  vn->pop2();

    1509. 

  1509. 				  currentStep = currentStep->prevS;

    1510. 

  1510. 			  }

    1511. 

  1511. 			  break;

    1512. 

  1512. 

    1513. 

  1513. 		  case  XPATH_EVAL_END:

    1514. 

  1514. 			  currentStep = NULL;

    1515. 

  1515. 			  // reset();

    1516. 

  1516. 			  return -1;

    1517. 

  1517. 

    1518. 

  1518. 		  case  XPATH_EVAL_BACKWARD:

    1519. 

  1519. 			  while (vn->toElement(NEXT_SIBLING)){

    1520. 

  1520. 				  if (currentStep->eval_s(vn)){

    1521. 

  1521. 					  if (currentStep->nextS!=NULL){

    1522. 

  1522. 						  state=  XPATH_EVAL_FORWARD;

    1523. 

  1523. 						  currentStep = currentStep->nextS;

    1524. 

  1524. 						  b = true;

    1525. 

  1525. 						  break;

    1526. 

  1526. 					  } else {

    1527. 

  1527. 						  state=  XPATH_EVAL_TERMINAL;

    1528. 

  1528. 						  result = vn->getCurrentIndex();

    1529. 

  1529. 						  if ( isUnique(result))

    1530. 

  1530. 							  return result;

    1531. 

  1531. 					  }

    1532. 

  1532. 				  }

    1533. 

  1533. 			  }

    1534. 

  1534. 			  if (b==false){

    1535. 

  1535. 				  vn->pop2();

    1536. 

  1536. 				  currentStep->resetP_s(vn);

    1537. 

  1537. 				  if (currentStep->prevS==NULL){

    1538. 

  1538. 					  state=  XPATH_EVAL_END;

    1539. 

  1539. 				  }else{

    1540. 

  1540. 					  state=  XPATH_EVAL_BACKWARD;

    1541. 

  1541. 					  currentStep = currentStep->prevS;

    1542. 

  1542. 				  }

    1543. 

  1543. 			  }

    1544. 

  1544. 			  break;

    1545. 

  1545. 

    1546. 

  1546. 		  case  XPATH_EVAL_TERMINAL:

    1547. 

  1547. 			  while (vn->toElement(NEXT_SIBLING)){

    1548. 

  1548. 				  if (currentStep->eval_s(vn)){

    1549. 

  1549. 					  // state=  XPATH_EVAL_TERMINAL;

    1550. 

  1550. 					  result = vn->getCurrentIndex();

    1551. 

  1551. 					  if ( isUnique(result))

    1552. 

  1552. 						  return result;

    1553. 

  1553. 				  }

    1554. 

  1554. 			  }

    1555. 

  1555. 			  vn->pop2();

    1556. 

  1556. 			  currentStep->resetP_s(vn);

    1557. 

  1557. 			  if(currentStep->prevS!=NULL){

    1558. 

  1558. 				  currentStep = currentStep->prevS;

    1559. 

  1559. 				  state=  XPATH_EVAL_BACKWARD;

    1560. 

  1560. 			  }else{

    1561. 

  1561. 				  state=  XPATH_EVAL_END;

    1562. 

  1562. 			  }

    1563. 

  1563. 			  break;

    1564. 

  1564. 

    1565. 

  1565. 		  default:

    1566. 

  1566. 			  throw XPathEvalException("unknown state");

    1567. 

  1567. 	}

    1568. 

  1568. 	return -2;

    1569. 

  1569. }

    1570. 

  1570. int LocationPathExpr::process_parent(VTDNav *vn){

    1571. 

  1571. 	bool /*b = false,*/ b1 = false;

    1572. 

  1572. 	Predicate *t= NULL;

    1573. 

  1573. 	int result;

    1574. 

  1574. 	switch ( state) {

    1575. 

  1575. 			case  XPATH_EVAL_START:

    1576. 

  1576. 			case  XPATH_EVAL_FORWARD:

    1577. 

  1577. 				t = currentStep->p;

    1578. 

  1578. 				while(t!=NULL){

    1579. 

  1579. 					if (t->requireContextSize_p()){

    1580. 

  1580. 						int i = computeContextSize(t,vn);

    1581. 

  1581. 						if (i==0){

    1582. 

  1582. 							b1 = true;

    1583. 

  1583. 							break;

    1584. 

  1584. 						}else

    1585. 

  1585. 							t->setContextSize_p(i);

    1586. 

  1586. 					}

    1587. 

  1587. 					t = t->nextP;

    1588. 

  1588. 				}

    1589. 

  1589. 				if (b1){

    1590. 

  1590. 					if (state == XPATH_EVAL_FORWARD){

    1591. 

  1591. 						state= XPATH_EVAL_BACKWARD;

    1592. 

  1592. 						currentStep = currentStep->prevS;

    1593. 

  1593. 					}else

    1594. 

  1594. 						state= XPATH_EVAL_END;

    1595. 

  1595. 					break;

    1596. 

  1596. 				}

    1597. 

  1597. 

    1598. 

  1598. 				if (vn->getCurrentDepth() == -1) {

    1599. 

  1599. 					if ( state==  XPATH_EVAL_START)

    1600. 

  1600. 						state=  XPATH_EVAL_END;

    1601. 

  1601. 					else {

    1602. 

  1602. 						//vn.pop();

    1603. 

  1603. 						state=  XPATH_EVAL_BACKWARD;

    1604. 

  1604. 						currentStep = currentStep->prevS;

    1605. 

  1605. 					}

    1606. 

  1606. 				} else {

    1607. 

  1607. 					vn->push2();

    1608. 

  1608. 					vn->toElement(PARENT); // must return true

    1609. 

  1609. 					if (currentStep->eval_s(vn)){

    1610. 

  1610. 						if (currentStep->nextS != NULL) {

    1611. 

  1611. 							state=  XPATH_EVAL_FORWARD;

    1612. 

  1612. 							currentStep = currentStep->nextS;

    1613. 

  1613. 						} else {

    1614. 

  1614. 							state=  XPATH_EVAL_TERMINAL;

    1615. 

  1615. 							result = vn->getCurrentIndex();

    1616. 

  1616. 							if ( isUnique(result))

    1617. 

  1617. 								return result;

    1618. 

  1618. 						}

    1619. 

  1619. 					}else{

    1620. 

  1620. 						vn->pop2();

    1621. 

  1621. 						currentStep->resetP_s(vn);

    1622. 

  1622. 						if ( state==  XPATH_EVAL_START)

    1623. 

  1623. 							state=  XPATH_EVAL_END;

    1624. 

  1624. 						else {

    1625. 

  1625. 							state=  XPATH_EVAL_BACKWARD;

    1626. 

  1626. 							currentStep = currentStep->prevS;

    1627. 

  1627. 						}

    1628. 

  1628. 					}

    1629. 

  1629. 				}

    1630. 

  1630. 

    1631. 

  1631. 				break;

    1632. 

  1632. 

    1633. 

  1633. 			case  XPATH_EVAL_END:

    1634. 

  1634. 				currentStep = NULL;

    1635. 

  1635. 				// reset();

    1636. 

  1636. 				return -1;

    1637. 

  1637. 

    1638. 

  1638. 			case  XPATH_EVAL_BACKWARD:

    1639. 

  1639. 			case  XPATH_EVAL_TERMINAL:

    1640. 

  1640. 				if (currentStep->prevS == NULL) {

    1641. 

  1641. 					vn->pop2();

    1642. 

  1642. 					state=  XPATH_EVAL_END;

    1643. 

  1643. 					break;

    1644. 

  1644. 				}else {

    1645. 

  1645. 					vn->pop2();

    1646. 

  1646. 					state=  XPATH_EVAL_BACKWARD;

    1647. 

  1647. 					currentStep = currentStep->prevS;

    1648. 

  1648. 					break;

    1649. 

  1649. 				}

    1650. 

  1650. 

    1651. 

  1651. 			default:

    1652. 

  1652. 				throw XPathEvalException("unknown state");

    1653. 

  1653. 

    1654. 

  1654. 	}

    1655. 

  1655. 	return -2;

    1656. 

  1656. }

    1657. 

  1657. int LocationPathExpr::process_preceding_sibling(VTDNav *vn){

    1658. 

  1658. 

    1659. 

  1659. 	bool b = false, b1 = false;

    1660. 

  1660. 	Predicate *t= NULL;

    1661. 

  1661. 	int result;

    1662. 

  1662. 	switch(state){

    1663. 

  1663. 		  case  XPATH_EVAL_START:

    1664. 

  1664. 		  case  XPATH_EVAL_FORWARD:

    1665. 

  1665. 			  t = currentStep->p;

    1666. 

  1666. 			  while(t!=NULL){

    1667. 

  1667. 				  if (t->requireContextSize_p()){

    1668. 

  1668. 					  int i = computeContextSize(t,vn);

    1669. 

  1669. 					  if (i==0){

    1670. 

  1670. 						  b1 = true;

    1671. 

  1671. 						  break;

    1672. 

  1672. 					  }else

    1673. 

  1673. 						  t->setContextSize_p(i);

    1674. 

  1674. 				  }

    1675. 

  1675. 				  t = t->nextP;

    1676. 

  1676. 			  }

    1677. 

  1677. 			  if (b1){

    1678. 

  1678. 				  if (state == XPATH_EVAL_FORWARD){

    1679. 

  1679. 					  state= XPATH_EVAL_BACKWARD;

    1680. 

  1680. 					  currentStep = currentStep->prevS;

    1681. 

  1681. 				  }else

    1682. 

  1682. 					  state= XPATH_EVAL_END;

    1683. 

  1683. 				  break;

    1684. 

  1684. 			  }

    1685. 

  1685. 			  if ( state==  XPATH_EVAL_START)

    1686. 

  1686. 				  state=  XPATH_EVAL_END;

    1687. 

  1687. 			  else

    1688. 

  1688. 				  state=  XPATH_EVAL_BACKWARD;

    1689. 

  1689. 			  vn->push2();

    1690. 

  1690. 			  while (vn->toElement(PREV_SIBLING)){

    1691. 

  1691. 				  if (currentStep->eval_s(vn)){

    1692. 

  1692. 					  if (currentStep->nextS!=NULL){

    1693. 

  1693. 						  state=  XPATH_EVAL_FORWARD;

    1694. 

  1694. 						  currentStep = currentStep->nextS;

    1695. 

  1695. 						  break;

    1696. 

  1696. 					  } else {

    1697. 

  1697. 						  state=  XPATH_EVAL_TERMINAL;

    1698. 

  1698. 						  result = vn->getCurrentIndex();

    1699. 

  1699. 						  if ( isUnique(result))

    1700. 

  1700. 							  return result;

    1701. 

  1701. 					  }

    1702. 

  1702. 				  }

    1703. 

  1703. 			  }

    1704. 

  1704. 

    1705. 

  1705. 			  if ( state==  XPATH_EVAL_END){

    1706. 

  1706. 				  currentStep->resetP_s(vn);

    1707. 

  1707. 				  vn->pop2();

    1708. 

  1708. 			  }else if ( state==  XPATH_EVAL_BACKWARD){

    1709. 

  1709. 				  currentStep->resetP_s(vn);

    1710. 

  1710. 				  vn->pop2();

    1711. 

  1711. 				  currentStep = currentStep->prevS;

    1712. 

  1712. 			  }

    1713. 

  1713. 			  break;

    1714. 

  1714. 

    1715. 

  1715. 		  case  XPATH_EVAL_END:

    1716. 

  1716. 			  currentStep = NULL;

    1717. 

  1717. 			  // reset();

    1718. 

  1718. 			  return -1;

    1719. 

  1719. 

    1720. 

  1720. 		  case  XPATH_EVAL_BACKWARD:

    1721. 

  1721. 			  while (vn->toElement(PREV_SIBLING)){

    1722. 

  1722. 				  if (currentStep->eval_s(vn)){

    1723. 

  1723. 					  if (currentStep->nextS!=NULL){

    1724. 

  1724. 						  state=  XPATH_EVAL_FORWARD;

    1725. 

  1725. 						  currentStep = currentStep->nextS;

    1726. 

  1726. 						  b = true;

    1727. 

  1727. 						  break;

    1728. 

  1728. 					  } else {

    1729. 

  1729. 						  state=  XPATH_EVAL_TERMINAL;

    1730. 

  1730. 						  result = vn->getCurrentIndex();

    1731. 

  1731. 						  if ( isUnique(result))

    1732. 

  1732. 							  return result;

    1733. 

  1733. 					  }

    1734. 

  1734. 				  }

    1735. 

  1735. 			  }

    1736. 

  1736. 			  if (b==false){

    1737. 

  1737. 				  vn->pop2();

    1738. 

  1738. 				  currentStep->resetP_s(vn);

    1739. 

  1739. 				  if (currentStep->prevS==NULL){

    1740. 

  1740. 					  state=  XPATH_EVAL_END;

    1741. 

  1741. 				  }else{

    1742. 

  1742. 					  state=  XPATH_EVAL_BACKWARD;

    1743. 

  1743. 					  currentStep = currentStep->prevS;

    1744. 

  1744. 				  }

    1745. 

  1745. 			  }

    1746. 

  1746. 			  break;

    1747. 

  1747. 

    1748. 

  1748. 		  case  XPATH_EVAL_TERMINAL:

    1749. 

  1749. 			  while (vn->toElement(PREV_SIBLING)){

    1750. 

  1750. 				  if (currentStep->eval_s(vn)){

    1751. 

  1751. 					  // state =  XPATH_EVAL_TERMINAL;

    1752. 

  1752. 					  result = vn->getCurrentIndex();

    1753. 

  1753. 					  if ( isUnique(result))

    1754. 

  1754. 						  return result;

    1755. 

  1755. 				  }

    1756. 

  1756. 			  }

    1757. 

  1757. 			  vn->pop2();

    1758. 

  1758. 			  if(currentStep->prevS!=NULL){

    1759. 

  1759. 				  currentStep = currentStep->prevS;

    1760. 

  1760. 				  state=  XPATH_EVAL_BACKWARD;

    1761. 

  1761. 			  }else{

    1762. 

  1762. 				  state=  XPATH_EVAL_END;

    1763. 

  1763. 			  }

    1764. 

  1764. 			  break;

    1765. 

  1765. 

    1766. 

  1766. 		  default:

    1767. 

  1767. 			  throw XPathEvalException("unknown state");

    1768. 

  1768. 	}

    1769. 

  1769. 	return -2;

    1770. 

  1770. }

    1771. 

  1771. int LocationPathExpr::process_self(VTDNav *vn){		

    1772. 

  1772. 	

    1773. 

  1773. 	bool /*b = false,*/ b1 = false;

    1774. 

  1774. 	    //int contextSize;

    1775. 

  1775. 	    Predicate *t= NULL;

    1776. 

  1776. 	    int result;

    1777. 

  1777. 		switch( state){

    1778. 

  1778. 		  case  XPATH_EVAL_START:

    1779. 

  1779. 		  case  XPATH_EVAL_FORWARD:

    1780. 

  1780.   	        t = currentStep->p;

    1781. 

  1781. 	        while(t!=NULL){

    1782. 

  1782. 	            if (t->requireContextSize_p()){

    1783. 

  1783. 	                int i = computeContextSize(t,vn);

    1784. 

  1784. 	                if (i==0){

    1785. 

  1785. 	                    b1 = true;

    1786. 

  1786. 	                    break;

    1787. 

  1787. 	                }else

    1788. 

  1788. 	                    t->setContextSize_p(i);

    1789. 

  1789. 	            }

    1790. 

  1790. 	            t = t->nextP;

    1791. 

  1791. 	        }

    1792. 

  1792. 	        if (b1){

    1793. 

  1793. 	            if (state == XPATH_EVAL_FORWARD){

    1794. 

  1794. 	                state= XPATH_EVAL_BACKWARD;

    1795. 

  1795. 	                currentStep = currentStep->prevS;

    1796. 

  1796. 	            }else

    1797. 

  1797. 	                state= XPATH_EVAL_END;

    1798. 

  1798. 	            break;

    1799. 

  1799. 	        }

    1800. 

  1800. 		  	if (currentStep->eval_s(vn)){

    1801. 

  1801. 		  		if (currentStep->nextS!=NULL){

    1802. 

  1802. 		  			 state=  XPATH_EVAL_FORWARD;

    1803. 

  1803. 		  			currentStep = currentStep->nextS;

    1804. 

  1804. 		  		}

    1805. 

  1805. 		  		else{

    1806. 

  1806. 		  			 state=  XPATH_EVAL_TERMINAL;

    1807. 

  1807. 		  			 if (vn->atTerminal == true)

    1808. 

  1808. 		  			     result = vn->LN;

    1809. 

  1809. 		  			 else

    1810. 

  1810. 		  			     result = vn->getCurrentIndex();

    1811. 

  1811. 					if ( isUnique(result))

    1812. 

  1812. 						return result;

    1813. 

  1813. 		  		}

    1814. 

  1814. 		  	}else {

    1815. 

  1815. 		  		currentStep->resetP_s(vn);

    1816. 

  1816. 		  		if ( state==  XPATH_EVAL_START)

    1817. 

  1817. 		  			 state=  XPATH_EVAL_END;

    1818. 

  1818. 		  		else

    1819. 

  1819. 		  			 state=  XPATH_EVAL_BACKWARD;

    1820. 

  1820. 		  	}

    1821. 

  1821. 		    break;

    1822. 

  1822. 

    1823. 

  1823. 		  case  XPATH_EVAL_END:

    1824. 

  1824. 		  	currentStep = NULL;

    1825. 

  1825. 		  	// reset();

    1826. 

  1826. 		  	return -1;

    1827. 

  1827. 

    1828. 

  1828. 		  case  XPATH_EVAL_BACKWARD:

    1829. 

  1829. 		  case  XPATH_EVAL_TERMINAL:

    1830. 

  1830. 		  	if (currentStep->prevS!=NULL){

    1831. 

  1831. 	  			 state=  XPATH_EVAL_BACKWARD;

    1832. 

  1832. 	  			currentStep= currentStep->prevS;

    1833. 

  1833. 	  		}else{

    1834. 

  1834. 	  			 state=  XPATH_EVAL_END;

    1835. 

  1835. 	  		}

    1836. 

  1836. 		  	break;

    1837. 

  1837. 

    1838. 

  1838. 		  default:

    1839. 

  1839. 			throw XPathEvalException("unknown state");

    1840. 

  1840. 		}

    1841. 

  1841. 	    return -2;

    1842. 

  1842. }

    1843. 

  1843. int LocationPathExpr::process_namespace(VTDNav *vn){

    1844. 

  1844. 	AutoPilot *ap = NULL;

    1845. 

  1845. 	bool b1 = false;

    1846. 

  1846. 	Predicate *t= NULL;

    1847. 

  1847. 	int temp;

    1848. 

  1848. 	switch(state){

    1849. 

  1849. 		case  XPATH_EVAL_START:

    1850. 

  1850. 		case  XPATH_EVAL_FORWARD:

    1851. 

  1851. 

    1852. 

  1852. 			t = currentStep->p;

    1853. 

  1853. 			while(t!=NULL){

    1854. 

  1854. 				if (t->requireContextSize_p()){

    1855. 

  1855. 					int i = computeContextSize(t,vn);

    1856. 

  1856. 					if (i==0){

    1857. 

  1857. 						b1 = true;

    1858. 

  1858. 						break;

    1859. 

  1859. 					}else

    1860. 

  1860. 						t->setContextSize_p(i);

    1861. 

  1861. 				}

    1862. 

  1862. 				t = t->nextP;

    1863. 

  1863. 			}

    1864. 

  1864. 			if (b1){

    1865. 

  1865. 				if (state == XPATH_EVAL_FORWARD){

    1866. 

  1866. 					state= XPATH_EVAL_BACKWARD;

    1867. 

  1867. 					currentStep = currentStep->prevS;

    1868. 

  1868. 				}else

    1869. 

  1869. 					state= XPATH_EVAL_END;

    1870. 

  1870. 				break;

    1871. 

  1871. 			}

    1872. 

  1872. 

    1873. 

  1873. 			if (vn->getAtTerminal()==true){

    1874. 

  1874. 				if (state ==XPATH_EVAL_START)

    1875. 

  1875. 					state = XPATH_EVAL_END;

    1876. 

  1876. 				else {

    1877. 

  1877. 					state = XPATH_EVAL_BACKWARD;

    1878. 

  1878. 					currentStep  = currentStep->prevS;

    1879. 

  1879. 				}

    1880. 

  1880. 			} else {

    1881. 

  1881. 				if (currentStep->ft == true) {

    1882. 

  1882. 					if (currentStep->o == NULL)

    1883. 

  1883. 						currentStep->o = ap = new AutoPilot(vn);

    1884. 

  1884. 					else {

    1885. 

  1885. 						ap = currentStep->o;

    1886. 

  1886. 						ap->bind(vn);

    1887. 

  1887. 					}

    1888. 

  1888. 					if (currentStep->nt->testType== NT_NODE)

    1889. 

  1889. 						ap->selectNameSpace((UCSChar *)L"*");

    1890. 

  1890. 					else 

    1891. 

  1891. 						ap->selectNameSpace(currentStep->nt->nodeName);

    1892. 

  1892. 					currentStep->ft = false;

    1893. 

  1893. 				}

    1894. 

  1894. 				if ( state==  XPATH_EVAL_START)

    1895. 

  1895. 					state=  XPATH_EVAL_END;

    1896. 

  1896. 				vn->push2();

    1897. 

  1897. 				//vn->setAtTerminal(true);

    1898. 

  1898. 				while( (temp = ap->iterateNameSpace()) != -1){

    1899. 

  1899. 					if (currentStep->evalPredicates(vn)){

    1900. 

  1900. 						break;

    1901. 

  1901. 					}

    1902. 

  1902. 				}

    1903. 

  1903. 				if (temp == -1){

    1904. 

  1904. 					currentStep->ft = true;

    1905. 

  1905. 					currentStep->resetP_s(vn);

    1906. 

  1906. 					vn->setAtTerminal(false);

    1907. 

  1907. 					if ( state==  XPATH_EVAL_FORWARD){

    1908. 

  1908. 						state =  XPATH_EVAL_BACKWARD;

    1909. 

  1909. 						currentStep = currentStep->prevS;

    1910. 

  1910. 					}

    1911. 

  1911. 				}else {

    1912. 

  1912. 

    1913. 

  1913. 					if (currentStep->nextS != NULL){

    1914. 

  1914. 						vn->LN = temp;

    1915. 

  1915. 						state=  XPATH_EVAL_FORWARD;

    1916. 

  1916. 						currentStep = currentStep->nextS;

    1917. 

  1917. 					}

    1918. 

  1918. 					else {

    1919. 

  1919. 						//vn.pop();

    1920. 

  1920. 						state=  XPATH_EVAL_TERMINAL;

    1921. 

  1921. 						if ( isUnique(temp)){

    1922. 

  1922. 							vn->LN = temp;

    1923. 

  1923. 							return temp;

    1924. 

  1924. 						}

    1925. 

  1925. 					}

    1926. 

  1926. 

    1927. 

  1927. 				}

    1928. 

  1928. 			}

    1929. 

  1929. 			break;

    1930. 

  1930. 

    1931. 

  1931. 		case  XPATH_EVAL_END:

    1932. 

  1932. 			currentStep = NULL;

    1933. 

  1933. 			// reset();

    1934. 

  1934. 			return -1;

    1935. 

  1935. 

    1936. 

  1936. 		case  XPATH_EVAL_BACKWARD:

    1937. 

  1937. 			ap = currentStep->o;

    1938. 

  1938. 			//vn.push();

    1939. 

  1939. 			while( (temp = ap->iterateNameSpace()) != -1){

    1940. 

  1940. 				if (currentStep->evalPredicates(vn)){

    1941. 

  1941. 					break;

    1942. 

  1942. 				}

    1943. 

  1943. 			}

    1944. 

  1944. 			if (temp == -1) {

    1945. 

  1945. 				vn->pop2();

    1946. 

  1946. 				currentStep->ft = true;

    1947. 

  1947. 				//freeAutoPilot(currentStep->o);

    1948. 

  1948. 				//currentStep->o = NULL;

    1949. 

  1949. 				currentStep->resetP_s(vn);

    1950. 

  1950. 				vn->setAtTerminal(false);

    1951. 

  1951. 				if (currentStep->prevS != NULL) {

    1952. 

  1952. 					state =  XPATH_EVAL_BACKWARD;

    1953. 

  1953. 					currentStep = currentStep->prevS;

    1954. 

  1954. 				} else

    1955. 

  1955. 					state =  XPATH_EVAL_END;

    1956. 

  1956. 			} else {

    1957. 

  1957. 				if (currentStep->nextS != NULL) {

    1958. 

  1958. 					state =  XPATH_EVAL_FORWARD;

    1959. 

  1959. 					currentStep = currentStep->nextS;

    1960. 

  1960. 				} else {

    1961. 

  1961. 					state =  XPATH_EVAL_TERMINAL;

    1962. 

  1962. 					if ( isUnique(temp)){

    1963. 

  1963. 						vn->LN = temp;

    1964. 

  1964. 						return temp;

    1965. 

  1965. 					}

    1966. 

  1966. 				}

    1967. 

  1967. 			}

    1968. 

  1968. 			break;

    1969. 

  1969. 

    1970. 

  1970. 		case  XPATH_EVAL_TERMINAL:

    1971. 

  1971. 			ap = currentStep->o;

    1972. 

  1972. 			while( (temp = ap->iterateNameSpace()) != -1){

    1973. 

  1973. 				if (currentStep->evalPredicates(vn)){

    1974. 

  1974. 					break;

    1975. 

  1975. 				}

    1976. 

  1976. 			}

    1977. 

  1977. 			if (temp != -1)

    1978. 

  1978. 				if (isUnique(temp)){

    1979. 

  1979. 					vn->LN = temp;

    1980. 

  1980. 					return temp;

    1981. 

  1981. 				}

    1982. 

  1982. 				vn->setAtTerminal(false);

    1983. 

  1983. 				currentStep->resetP_s(vn);

    1984. 

  1984. 				if (currentStep->prevS == NULL) {

    1985. 

  1985. 					currentStep->ft = true;

    1986. 

  1986. 					//freeAutoPilot(currentStep->o);

    1987. 

  1987. 					//currentStep->o = NULL;

    1988. 

  1988. 					vn->pop2();

    1989. 

  1989. 					state=  XPATH_EVAL_END;

    1990. 

  1990. 				} else {

    1991. 

  1991. 					state=  XPATH_EVAL_BACKWARD;

    1992. 

  1992. 					vn->pop2();

    1993. 

  1993. 					currentStep->ft = true;

    1994. 

  1994. 					//freeAutoPilot(currentStep->o);

    1995. 

  1995. 					//currentStep->o = NULL;

    1996. 

  1996. 					currentStep = currentStep->prevS;

    1997. 

  1997. 				}

    1998. 

  1998. 

    1999. 

  1999. 				break;

    2000. 

  2000. 

    2001. 

  2001. 		default:

    2002. 

  2002. 			throw XPathEvalException(

    2003. 

  2003. 				"unknown state");

    2004. 

  2004. 	}

    2005. 

  2005. 	return -2;

    2006. 

  2006. }

    2007. 

  2007. void LocationPathExpr::selectNodeType(TextIter *ti){

    2008. 

  2008. 		if (currentStep->nt->testType == NT_TEXT )

    2009. 

  2009. 			ti->selectText();

    2010. 

  2010. 		else if (currentStep->nt->testType == NT_COMMENT )

    2011. 

  2011. 			ti->selectComment();

    2012. 

  2012. 		else if (currentStep->nt->testType == NT_PI0 )

    2013. 

  2013. 			ti->selectPI0();

    2014. 

  2014. 		else {

    2015. 

  2015. 			ti->selectPI1(currentStep->nt->nodeName);

    2016. 

  2016. 		}

    2017. 

  2017. }

    2018. 

  2018. 

    2019. 

  2019. 

    2020. 

  2020. 

    2021. 

  2021. // predicate 

    2022. 

  2022. Predicate::Predicate():

    2023. 

  2023. d(0),

    2024. 

  2024. count(0),

    2025. 

  2025. nextP(NULL),

    2026. 

  2026. e(NULL)

    2027. 

  2027. {}

    2028. 

  2028. 

    2029. 

  2029. Predicate::~Predicate(){

    2030. 

  2030. 	if (e!=NULL)

    2031. 

  2031. 		delete e;

    2032. 

  2032. }

    2033. 

  2033. bool Predicate::eval_p(VTDNav *vn){

    2034. 

  2034. 	bool b;

    2035. 

  2035. 	count++; // increment the position

    2036. 

  2036. 	e->setPosition(count);

    2037. 

  2037. 	if (e->isNumerical()){

    2038. 

  2038. 		b = (e->evalNumber(vn)== count);

    2039. 

  2039. 	}

    2040. 

  2040. 	else{

    2041. 

  2041. 		b = e->evalBoolean(vn);

    2042. 

  2042. 	}

    2043. 

  2043. 	return b;

    2044. 

  2044. }

    2045. 

  2045. void Predicate::setIndex_p(int i){

    2046. 

  2046. 	if (i<=0){

    2047. 

  2047. 		throw XPathEvalException("Invalid index number");

    2048. 

  2048. 	}

    2049. 

  2049. 	d = (double) i;

    2050. 

  2050. }

    2051. 

  2051. void Predicate::setContextSize_p(int size){

    2052. 

  2052. 	e->setContextSize(size);

    2053. 

  2053. }

    2054. 

  2054. bool Predicate::requireContextSize_p(){

    2055. 

  2055. 	return e->requireContextSize();

    2056. 

  2056. }

    2057. 

  2057. void Predicate::reset_p(VTDNav *vn){

    2058. 

  2058. 	count = 0;

    2059. 

  2059. 	e->reset(vn); // is this really needed?

    2060. 

  2060. }

    2061. 

  2061. void Predicate::toString_p( UCSChar *string){

    2062. 

  2062. 	//String s = "["+expr+"]";

    2063. 

  2063. 		if (nextP==NULL){

    2064. 

  2064. 			wprintf(L"[");

    2065. 

  2065. 			e->toString(string);

    2066. 

  2066. 			wprintf(L"]");

    2067. 

  2067. 		} else {

    2068. 

  2068. 			wprintf(L"[");

    2069. 

  2069. 			e->toString(string);

    2070. 

  2070. 			wprintf(L"]");

    2071. 

  2071. 			nextP->toString_p(string);

    2072. 

  2072. 		}

    2073. 

  2073. }

    2074. 

  2074. 

    2075. 

  2075. void Predicate::adjust(int n){e->adjust(n);};

    2076. 

  2076. 

    2077. 

  2077. 

    2078. 

  2078. 

    2079. 

  2079. 

    2080. 

  2080. 

    2081. 

  2081. 

    2082. 

  2082. 

    2083. 

  2083. Step::Step():

    2084. 

  2084. nt(NULL),

    2085. 

  2085. p(NULL),

    2086. 

  2086. pt(NULL),

    2087. 

  2087. nextS(NULL),

    2088. 

  2088. position(1),

    2089. 

  2089. prevS(NULL),

    2090. 

  2090. o(NULL),

    2091. 

  2091. ft(true)

    2092. 

  2092. {}

    2093. 

  2093. 

    2094. 

  2094. 

    2095. 

  2095. Step::~Step(){

    2096. 

  2096. 	Predicate *tmp, *tmp2;

    2097. 

  2097. 	

    2098. 

  2098. 	if (p != NULL){

    2099. 

  2099. 		tmp = p;

    2100. 

  2100. 		tmp2 = tmp->nextP;

    2101. 

  2101. 		while(tmp2!=NULL){

    2102. 

  2102. 			delete(tmp);

    2103. 

  2103. 			tmp= tmp2;

    2104. 

  2104. 			tmp2 = tmp2->nextP;

    2105. 

  2105. 		}

    2106. 

  2106. 		delete(tmp);

    2107. 

  2107. 	}

    2108. 

  2108. 	if (nt->testType == NT_TEXT){

    2109. 

  2109. 		if (o!=NULL)

    2110. 

  2110. 			delete((TextIter *)o);

    2111. 

  2111. 	}else

    2112. 

  2112. 		delete((AutoPilot *)o);

    2113. 

  2113. 	delete(nt);

    2114. 

  2114. }

    2115. 

  2115. 

    2116. 

  2116. void Step::reset_s(VTDNav *vn){

    2117. 

  2117. 	ft = true;

    2118. 

  2118. 	resetP_s(vn);

    2119. 

  2119. 	position =1;

    2120. 

  2120. }

    2121. 

  2121. 

    2122. 

  2122. void Step::resetP_s(VTDNav *vn){

    2123. 

  2123. 	Predicate *temp = p;

    2124. 

  2124. 	while(temp!=NULL){

    2125. 

  2125. 		temp->reset_p(vn);

    2126. 

  2126. 		temp = temp->nextP;

    2127. 

  2127. 	}

    2128. 

  2128. }

    2129. 

  2129. void Step::resetP2_s(VTDNav *vn, Predicate *p1){

    2130. 

  2130. 		Predicate *temp = p;

    2131. 

  2131. 		while(temp!=p1){

    2132. 

  2132. 			temp->reset_p(vn);

    2133. 

  2133. 			temp = temp->nextP;

    2134. 

  2134. 		}

    2135. 

  2135. }

    2136. 

  2136. 

    2137. 

  2137. NodeTest *Step::getNodeTest(){

    2138. 

  2138. 	return nt;

    2139. 

  2139. }

    2140. 

  2140. 

    2141. 

  2141. Step *Step::getNextStep(){

    2142. 

  2142. 	return nextS;

    2143. 

  2143. }

    2144. 

  2144. 

    2145. 

  2145. bool Step::get_ft(){

    2146. 

  2146. 	return ft;

    2147. 

  2147. }

    2148. 

  2148. 

    2149. 

  2149. void Step::set_ft(bool b){

    2150. 

  2150. 	ft = b;

    2151. 

  2151. }

    2152. 

  2152. 

    2153. 

  2153. Step *Step::getPrevStep(){

    2154. 

  2154. 	return prevS;

    2155. 

  2155. }

    2156. 

  2156. 

    2157. 

  2157. void Step::setNodeTest(NodeTest *n){

    2158. 

  2158. 	nt = n;

    2159. 

  2159. }

    2160. 

  2160. 

    2161. 

  2161. void Step::setPredicate(Predicate *p1){

    2162. 

  2162. 	p = p1;

    2163. 

  2163. }

    2164. 

  2164. 

    2165. 

  2165. bool Step::eval_s(VTDNav *vn){

    2166. 

  2166. 	return nt->eval_nt(vn) && evalPredicates(vn);

    2167. 

  2167. }

    2168. 

  2168. 

    2169. 

  2169. bool Step::eval_s2(VTDNav *vn, Predicate *p){

    2170. 

  2170. 	return nt->eval_nt(vn) && evalPredicates2(vn,p);

    2171. 

  2171. }

    2172. 

  2172. 

    2173. 

  2173. bool Step::evalPredicates(VTDNav *vn){

    2174. 

  2174. 	Predicate *temp = p;

    2175. 

  2175. 	while(temp!=NULL) {

    2176. 

  2176. 		if (temp->eval_p(vn)== false)

    2177. 

  2177. 			return false;

    2178. 

  2178. 		temp = temp->nextP;

    2179. 

  2179. 	}

    2180. 

  2180. 	return true;

    2181. 

  2181. }

    2182. 

  2182. 

    2183. 

  2183. bool Step::evalPredicates2(VTDNav *vn, Predicate *p){

    2184. 

  2184. 	Predicate *temp = p;

    2185. 

  2185. 	while(temp!=p) {

    2186. 

  2186. 		if (temp->eval_p(vn)== false)

    2187. 

  2187. 			return false;

    2188. 

  2188. 		temp = temp->nextP;

    2189. 

  2189. 	}

    2190. 

  2190. 	return true;

    2191. 

  2191. }

    2192. 

  2192. 

    2193. 

  2193. void Step::setAxisType(axisType st){

    2194. 

  2194. 	axis_type = st;

    2195. 

  2195. }

    2196. 

  2196. 

    2197. 

  2197. void Step::toString_s(UCSChar *string){

    2198. 

  2198. 	//String s;

    2199. 

  2199. 	if (p == NULL){

    2200. 

  2200. 		wprintf(axisName(axis_type));

    2201. 

  2201. 	    nt->toString_nt(string);

    2202. 

  2202. 	}

    2203. 

  2203. 	else {

    2204. 

  2204. 		wprintf(axisName(axis_type));

    2205. 

  2205. 		nt->toString_nt(string);

    2206. 

  2206. 		wprintf(L" ");

    2207. 

  2207. 		p->toString_p(string);

    2208. 

  2208. 	}

    2209. 

  2209. 	if (nextS == NULL)

    2210. 

  2210. 		return;

    2211. 

  2211. 	else {

    2212. 

  2212. 		wprintf(L"/");

    2213. 

  2213. 		nextS->toString_s(string);

    2214. 

  2214. 	}

    2215. 

  2215. }

    2216. 

  2216. 

    2217. 

  2217. void Step::adjust(int n){

    2218. 

  2218. 			Predicate* temp = p;

    2219. 

  2219. 			while(temp!=NULL){

    2220. 

  2220. 				temp->adjust(n);

    2221. 

  2221. 				temp = temp->nextP;

    2222. 

  2222. 			}

    2223. 

  2223. 		};

    2224. 

  2224. 

    2225. 

  2225. 

    2226. 

  2226. NodeTest::NodeTest():

    2227. 

  2227. nodeName(NULL),

    2228. 

  2228. prefix(NULL),

    2229. 

  2229. localName(NULL),

    2230. 

  2230. URL(NULL),

    2231. 

  2231. nsEnabled(false)

    2232. 

  2232. {

    2233. 

  2233. }

    2234. 

  2234. 

    2235. 

  2235. NodeTest::~NodeTest(){

    2236. 

  2236. 	delete localName;

    2237. 

  2237. 	delete nodeName;

    2238. 

  2238. 	delete prefix;

    2239. 

  2239. }

    2240. 

  2240. bool NodeTest::eval_nt(VTDNav *vn){

    2241. 

  2241. 	if (testType == NT_NODE)

    2242. 

  2242. 		return true;

    2243. 

  2243. 	else if(testType == NT_NAMETEST){

    2244. 

  2244. 		if (vn->atTerminal == true)

    2245. 

  2245. 			return false;

    2246. 

  2246. 		if (localName!=NULL)

    2247. 

  2247. 			return vn->matchElementNS(URL,localName);

    2248. 

  2248. 		else

    2249. 

  2249. 			return vn->matchElement(nodeName);

    2250. 

  2250. 	}

    2251. 

  2251. 	return true;

    2252. 

  2252. }

    2253. 

  2253. void NodeTest::setNodeName(UCSChar *name){

    2254. 

  2254. 	nodeName = name;

    2255. 

  2255. }

    2256. 

  2256. void NodeTest::setNodeNameNS(UCSChar *p, UCSChar *ln){

    2257. 

  2257. 	localName = ln;

    2258. 

  2258. 	prefix = p;

    2259. 

  2259. }

    2260. 

  2260. void NodeTest::setTestType(nodeTestType ntt){

    2261. 

  2261. 	testType = ntt;

    2262. 

  2262. }

    2263. 

  2263. void NodeTest::toString_nt(UCSChar *string){

    2264. 

  2264. 	switch (testType){

    2265. 

  2265. 		case NT_NAMETEST :

    2266. 

  2266. 			if (localName == NULL)

    2267. 

  2267. 				wprintf(L"%ls",nodeName);

    2268. 

  2268. 			else

    2269. 

  2269. 				wprintf(L"%ls:%ls", prefix,localName);

    2270. 

  2270. 			break;

    2271. 

  2271. 		case NT_NODE: wprintf(L"node()");break;

    2272. 

  2272. 		case NT_TEXT: wprintf(L"text()");break;

    2273. 

  2273. 		case NT_PI0:  wprintf(L"processing-instruction()");break;

    2274. 

  2274. 		case NT_PI1: wprintf(L"processing-instruction(");

    2275. 

  2275. 			if (wcschr(nodeName,'"')!=NULL){

    2276. 

  2276. 				wprintf(L"'");

    2277. 

  2277. 				wprintf(nodeName);

    2278. 

  2278. 				wprintf(L"'");

    2279. 

  2279. 			}else{

    2280. 

  2280. 				wprintf(L"\"");

    2281. 

  2281. 				wprintf(nodeName);

    2282. 

  2282. 				wprintf(L"\"");

    2283. 

  2283. 			}

    2284. 

  2284. 			wprintf(L")");

    2285. 

  2285. 			break;

    2286. 

  2286. 		default:  wprintf(L"comment()");

    2287. 

  2287. 	}

    2288. 

  2288. }

    2289. 

  2289. 

    2290. 

  2290. 

    2291. 

  2291. 

    2292. 

  2292. 

    2293. 

  2293. 

    2294. 

  2294. 

    2295. 

  2295. 

    2296. 

  2296. 

    2297. 

  2297. 

    2298. 

  2298. UCSChar *com_ximpleware::axisName(axisType i){

    2299. 

  2299. 	switch(i){

    2300. 

  2300. 			case AXIS_CHILD: return (UCSChar *)L"child::";

    2301. 

  2301. 			case AXIS_DESCENDANT: return (UCSChar *)L"descendant::";

    2302. 

  2302. 			case AXIS_PARENT: return (UCSChar *)L"parent::";

    2303. 

  2303. 			case AXIS_FOLLOWING_SIBLING: return (UCSChar *)L"following-sibling::";

    2304. 

  2304. 			case AXIS_PRECEDING_SIBLING: return (UCSChar *)L"preceding-sibling::";

    2305. 

  2305. 			case AXIS_FOLLOWING: return (UCSChar *)L"following::";

    2306. 

  2306. 			case AXIS_PRECEDING: return (UCSChar *)L"preceding::";

    2307. 

  2307. 			case AXIS_ATTRIBUTE: return (UCSChar *)L"attribute::";

    2308. 

  2308. 			case AXIS_NAMESPACE: return (UCSChar *)L"namespace::";

    2309. 

  2309. 			case AXIS_SELF: return (UCSChar *)L"self::";

    2310. 

  2310. 			case AXIS_DESCENDANT_OR_SELF: return (UCSChar *)L"descendant-or-self::";

    2311. 

  2311. 			case AXIS_ANCESTOR: return (UCSChar *)L"ancestor::";

    2312. 

  2312. 			default: return (UCSChar *)L"ancestor-or-self::";

    2313. 

  2313. 	}

    2314. 

  2314. }

    2315. 

  2315.