Searched refs:orNode (Results 1 – 7 of 7) sorted by relevance
373 RBBINode *orNode = new RBBINode(RBBINode::opOr); in addValToSet() local374 if (orNode == NULL) { in addValToSet()378 orNode->fLeftChild = usetNode->fLeftChild; in addValToSet()379 orNode->fRightChild = leafNode; in addValToSet()380 orNode->fLeftChild->fParent = orNode; in addValToSet()381 orNode->fRightChild->fParent = orNode; in addValToSet()382 usetNode->fLeftChild = orNode; in addValToSet()383 orNode->fParent = usetNode; in addValToSet()
212 RBBINode *orNode = pushNewNode(RBBINode::opOr); in doParseActions() local216 orNode->fLeftChild = operandNode; in doParseActions()217 operandNode->fParent = orNode; in doParseActions()357 RBBINode *orNode = pushNewNode(RBBINode::opOr); in doParseActions() local361 orNode->fLeftChild = prevRules; in doParseActions()362 prevRules->fParent = orNode; in doParseActions()363 orNode->fRightChild = thisRule; in doParseActions()364 thisRule->fParent = orNode; in doParseActions()365 *destRules = orNode; in doParseActions()
383 RBBINode orNode = new RBBINode(RBBINode.opOr); in addValToSet() local384 orNode.fLeftChild = usetNode.fLeftChild; in addValToSet()385 orNode.fRightChild = leafNode; in addValToSet()386 orNode.fLeftChild.fParent = orNode; in addValToSet()387 orNode.fRightChild.fParent = orNode; in addValToSet()388 usetNode.fLeftChild = orNode; in addValToSet()389 orNode.fParent = usetNode; in addValToSet()
145 RBBINode orNode = pushNewNode(RBBINode.opOr); in doParseActions() local146 orNode.fLeftChild = operandNode; in doParseActions()147 operandNode.fParent = orNode; in doParseActions()279 RBBINode orNode = pushNewNode(RBBINode.opOr); in doParseActions() local280 orNode.fLeftChild = prevRules; in doParseActions()281 prevRules.fParent = orNode; in doParseActions()282 orNode.fRightChild = thisRule; in doParseActions()283 thisRule.fParent = orNode; in doParseActions()284 fRB.fTreeRoots[destRules] = orNode; in doParseActions()
384 RBBINode orNode = new RBBINode(RBBINode.opOr); in addValToSet() local385 orNode.fLeftChild = usetNode.fLeftChild; in addValToSet()386 orNode.fRightChild = leafNode; in addValToSet()387 orNode.fLeftChild.fParent = orNode; in addValToSet()388 orNode.fRightChild.fParent = orNode; in addValToSet()389 usetNode.fLeftChild = orNode; in addValToSet()390 orNode.fParent = usetNode; in addValToSet()
146 RBBINode orNode = pushNewNode(RBBINode.opOr); in doParseActions() local147 orNode.fLeftChild = operandNode; in doParseActions()148 operandNode.fParent = orNode; in doParseActions()280 RBBINode orNode = pushNewNode(RBBINode.opOr); in doParseActions() local281 orNode.fLeftChild = prevRules; in doParseActions()282 prevRules.fParent = orNode; in doParseActions()283 orNode.fRightChild = thisRule; in doParseActions()284 thisRule.fParent = orNode; in doParseActions()285 fRB.fTreeRoots[destRules] = orNode; in doParseActions()
475 OrConstraint *orNode=currentChain->ruleHeader; in parse() local476 while (orNode->next != NULL) { in parse()477 orNode = orNode->next; in parse()479 orNode->next= new OrConstraint(); in parse()480 orNode=orNode->next; in parse()481 orNode->next=NULL; in parse()482 curAndConstraint = orNode->add(); in parse()585 OrConstraint *orNode = new OrConstraint(); in parse() local586 newChain->ruleHeader = orNode; in parse()587 curAndConstraint = orNode->add(); in parse()