Searched refs:orNode (Results 1 – 7 of 7) sorted by relevance
362 RBBINode *orNode = new RBBINode(RBBINode::opOr); in addValToSet() local363 if (orNode == NULL) { in addValToSet()367 orNode->fLeftChild = usetNode->fLeftChild; in addValToSet()368 orNode->fRightChild = leafNode; in addValToSet()369 orNode->fLeftChild->fParent = orNode; in addValToSet()370 orNode->fRightChild->fParent = orNode; in addValToSet()371 usetNode->fLeftChild = orNode; in addValToSet()372 orNode->fParent = usetNode; in addValToSet()
224 RBBINode *orNode = pushNewNode(RBBINode::opOr); in doParseActions() local228 orNode->fLeftChild = operandNode; in doParseActions()229 operandNode->fParent = orNode; in doParseActions()385 RBBINode *orNode = pushNewNode(RBBINode::opOr); in doParseActions() local389 orNode->fLeftChild = prevRules; in doParseActions()390 prevRules->fParent = orNode; in doParseActions()391 orNode->fRightChild = thisRule; in doParseActions()392 thisRule->fParent = orNode; in doParseActions()393 *destRules = orNode; in doParseActions()
387 RBBINode orNode = new RBBINode(RBBINode.opOr); in addValToSet() local388 orNode.fLeftChild = usetNode.fLeftChild; in addValToSet()389 orNode.fRightChild = leafNode; in addValToSet()390 orNode.fLeftChild.fParent = orNode; in addValToSet()391 orNode.fRightChild.fParent = orNode; in addValToSet()392 usetNode.fLeftChild = orNode; in addValToSet()393 orNode.fParent = usetNode; in addValToSet()
156 RBBINode orNode = pushNewNode(RBBINode.opOr); in doParseActions() local157 orNode.fLeftChild = operandNode; in doParseActions()158 operandNode.fParent = orNode; in doParseActions()306 RBBINode orNode = pushNewNode(RBBINode.opOr); in doParseActions() local307 orNode.fLeftChild = prevRules; in doParseActions()308 prevRules.fParent = orNode; in doParseActions()309 orNode.fRightChild = thisRule; in doParseActions()310 thisRule.fParent = orNode; in doParseActions()311 fRB.fTreeRoots[destRules] = orNode; in doParseActions()
386 RBBINode orNode = new RBBINode(RBBINode.opOr); in addValToSet() local387 orNode.fLeftChild = usetNode.fLeftChild; in addValToSet()388 orNode.fRightChild = leafNode; in addValToSet()389 orNode.fLeftChild.fParent = orNode; in addValToSet()390 orNode.fRightChild.fParent = orNode; in addValToSet()391 usetNode.fLeftChild = orNode; in addValToSet()392 orNode.fParent = usetNode; in addValToSet()
155 RBBINode orNode = pushNewNode(RBBINode.opOr); in doParseActions() local156 orNode.fLeftChild = operandNode; in doParseActions()157 operandNode.fParent = orNode; in doParseActions()305 RBBINode orNode = pushNewNode(RBBINode.opOr); in doParseActions() local306 orNode.fLeftChild = prevRules; in doParseActions()307 prevRules.fParent = orNode; in doParseActions()308 orNode.fRightChild = thisRule; in doParseActions()309 thisRule.fParent = orNode; in doParseActions()310 fRB.fTreeRoots[destRules] = orNode; in doParseActions()
496 OrConstraint *orNode=currentChain->ruleHeader; in parse() local497 while (orNode->next != nullptr) { in parse()498 orNode = orNode->next; in parse()500 orNode->next= new OrConstraint(); in parse()501 if (orNode->next == nullptr) { in parse()505 orNode=orNode->next; in parse()506 orNode->next=nullptr; in parse()507 curAndConstraint = orNode->add(status); in parse()617 OrConstraint *orNode = new OrConstraint(); in parse() local618 if (orNode == nullptr) { in parse()[all …]