Home
last modified time | relevance | path

Searched refs:true_node (Results 1 – 25 of 85) sorted by relevance

1234

/dports/security/py-angr/angr-9.0.5405/angr/analyses/decompiler/
H A Dregion_simplifier.py59 if node.true_node is not None:
60 self._handle(node.true_node, successor=successor)
144 if node.true_node is not None:
145 self._handle(node.true_node, successor=successor)
181 if cond_stmt.true_target is not None and successor.true_node is not None:
184 and cond_stmt.true_target.value == successor.true_node.addr:
201 and cond_stmt.false_target.value == successor.true_node.addr:
239 if node.true_node is not None and node.false_node is not None:
241 last_stmts = ConditionProcessor.get_last_statements(node.true_node)
252 if node.true_node is not None:
[all …]
H A Dempty_node_remover.py69 true_node = self._walker._handle(node.true_node)
72 if true_node is None and false_node is None:
75 if true_node is None and false_node is not None:
82 …return ConditionNode(node.addr, node.reaching_condition, node.condition, true_node, false_node=fal…
H A Dstructurer_nodes.py66 for node in [ cond_node.true_node, cond_node.false_node ]:
156 def __init__(self, addr, reaching_condition, condition, true_node, false_node=None): argument
160 self.true_node = true_node
170 self.condition, self.true_node.dbg_repr(indent+2),
185 return "<ConditionNode (%r|%r)>" % (self.true_node, self.false_node)
H A Dutils.py74 if node.true_node is not None:
75 replace_last_statement(node.true_node, old_stmt, new_stmt)
173 parent.true_node = SequenceNode(nodes=[parent.true_node])
174 insert_node(parent.true_node, insert_idx - node_idx, node, 0)
H A Dstructurer.py429 if node.true_node is not None:
430 node.true_node = walker._handle(node.true_node)
721 if n.true_node is not None and n.false_node is None:
722 the_node = CodeNode(n.true_node, n.condition)
725 elif n.false_node is not None and n.true_node is None:
1189 node.true_node is not None and \
1213 r, cond_node_inner = _condnode_truenode_only(node.true_node)
1222 cond_node_inner.true_node,
1230 r, condbreak_node = _condbreaknode(node.true_node)
H A Dstructured_codegen.py363 def __init__(self, condition, true_node=None, false_node=None): argument
368 self.true_node = true_node
371 if self.true_node is None and self.false_node is None:
384 yield from self.true_node.c_repr_chunks(indent=indent + INDENT_DELTA)
1357 true_node=self._handle(condition_node.true_node, is_expr=False)
1358 if condition_node.true_node else None,
H A Dcondition_processor.py228 self.remove_claripy_bool_asts(node.true_node, memo=memo),
286 if block.true_node:
288 s = cls.get_last_statement(block.true_node)
344 if block.true_node:
346 last_stmts = cls.get_last_statements(block.true_node)
H A Dsequence_walker.py77 self._handle(node.true_node, parent=node, index=0)
/dports/mail/mailutils/mailutils-3.13/mimeview/
H A Dgrammar.y61 true_node, enumerator
193 $$ = make_node (true_node, &yylloc);
818 case true_node: in eval_rule()
881 if (arule->node->type == true_node in rule_cmp()
882 && brule->node->type != true_node) in rule_cmp()
884 else if (brule->node->type == true_node in rule_cmp()
885 && arule->node->type != true_node) in rule_cmp()
H A Dgrammar.c126 true_node, enumerator
1521 (mimetypes_yyval.node) = make_node (true_node, &mimetypes_yylloc); in mimetypes_yyparse()
2417 case true_node: in eval_rule()
2480 if (arule->node->type == true_node in rule_cmp()
2481 && brule->node->type != true_node) in rule_cmp()
2483 else if (brule->node->type == true_node in rule_cmp()
2484 && arule->node->type != true_node) in rule_cmp()
/dports/cad/yosys/yosys-yosys-0.12/passes/proc/
H A Dproc_dlatch.cc140 true_node = 1, enumerator
180 return true_node; in find_mux_feedback()
228 if (n == true_node) in make_hold()
/dports/www/node10/node-v10.24.1/deps/v8/src/compiler/
H A Dwasm-compiler.h220 Node* BranchNoHint(Node* cond, Node** true_node, Node** false_node);
221 Node* BranchExpectTrue(Node* cond, Node** true_node, Node** false_node);
222 Node* BranchExpectFalse(Node* cond, Node** true_node, Node** false_node);
H A Descape-analysis.cc521 Node* true_node = jsgraph->TrueConstant(); in LowerCompareMapsWithoutLoad() local
536 comparison, true_node, replacement); in LowerCompareMapsWithoutLoad()
/dports/lang/v8/v8-9.6.180.12/src/compiler/
H A Dwasm-compiler.h287 Node* BranchNoHint(Node* cond, Node** true_node, Node** false_node);
288 Node* BranchExpectFalse(Node* cond, Node** true_node, Node** false_node);
289 Node* BranchExpectTrue(Node* cond, Node** true_node, Node** false_node);
295 Node* Select(Node *cond, Node* true_node, Node* false_node,
H A Descape-analysis.cc539 Node* true_node = jsgraph->TrueConstant(); in LowerCompareMapsWithoutLoad() local
554 comparison, true_node, replacement); in LowerCompareMapsWithoutLoad()
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/v8/src/compiler/
H A Dwasm-compiler.h232 Node* BranchNoHint(Node* cond, Node** true_node, Node** false_node);
233 Node* BranchExpectTrue(Node* cond, Node** true_node, Node** false_node);
234 Node* BranchExpectFalse(Node* cond, Node** true_node, Node** false_node);
H A Descape-analysis.cc535 Node* true_node = jsgraph->TrueConstant(); in LowerCompareMapsWithoutLoad() local
550 comparison, true_node, replacement); in LowerCompareMapsWithoutLoad()
/dports/www/chromium-legacy/chromium-88.0.4324.182/v8/src/compiler/
H A Dwasm-compiler.h242 Node* BranchNoHint(Node* cond, Node** true_node, Node** false_node);
243 Node* BranchExpectTrue(Node* cond, Node** true_node, Node** false_node);
244 Node* BranchExpectFalse(Node* cond, Node** true_node, Node** false_node);
H A Descape-analysis.cc536 Node* true_node = jsgraph->TrueConstant(); in LowerCompareMapsWithoutLoad() local
551 comparison, true_node, replacement); in LowerCompareMapsWithoutLoad()
/dports/lang/v8/v8-9.6.180.12/test/cctest/compiler/
H A Dtest-representation-change.cc135 Node* true_node = r.jsgraph()->TrueConstant(); in TEST() local
136 Node* true_use = r.Return(true_node); in TEST()
138 true_node, MachineRepresentation::kTagged, Type::None(), true_use, in TEST()
/dports/math/cvc4/CVC4-1.7/src/proof/
H A Dproof_manager.cpp160 Node true_node = NodeManager::currentNM()->mkConst<bool>(true); in initCnfProof() local
163 pm->d_cnfProof->pushCurrentAssertion(true_node); in initCnfProof()
164 pm->d_cnfProof->pushCurrentDefinition(true_node); in initCnfProof()
/dports/devel/smv/smv/
H A Dsymbols.c1819 node_ptr true_node = find_node(TRUEEXP,NIL,NIL); local
1877 if(F2==true_node) tmp3=cons(g2,NIL);
1880 if(F1==true_node) tmp3=cons(g1,NIL);
1883 else if(F1==true_node) tmp3=cons(c2,NIL);
1884 else if(F2==true_node) tmp3=cons(c1,NIL);
1905 else if(F==true_node) new=true_node;
1909 if(new==true_node) {
1972 node_ptr true_node = find_node(TRUEEXP,NIL,NIL); local
1977 node_ptr formula = true_node; /* will accumulate the result */
1981 if(d==ONE) return(true_node);
/dports/editors/poke/poke-1.0/libpoke/
H A Dpkl-typify.c345 pkl_ast_node true_node = pkl_ast_make_integer (PKL_PASS_AST, 1); in PKL_PHASE_BEGIN_HANDLER() local
347 PKL_AST_TYPE (true_node) = ASTREF (bool_type); in PKL_PHASE_BEGIN_HANDLER()
348 PKL_AST_LOC (true_node) = PKL_AST_LOC (isa); in PKL_PHASE_BEGIN_HANDLER()
351 PKL_PASS_NODE = true_node; in PKL_PHASE_BEGIN_HANDLER()
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dgenmatch.c1717 dt_operand *true_node = NULL; in find_node() local
1725 if (! true_node in find_node()
1726 || as_a <dt_operand *> (ops[i])->for_id > true_node->for_id) in find_node()
1727 true_node = as_a <dt_operand *> (ops[i]); in find_node()
1733 if (true_node in find_node()
1734 && true_node->for_id != current_id in find_node()
1735 && true_node->for_id > as_a <dt_operand *> (ops[i])->for_id) in find_node()
1746 true_loc = true_node->op->location; in find_node()
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/
H A Dgenmatch.c1788 dt_operand *true_node = NULL; in find_node() local
1796 if (! true_node in find_node()
1797 || as_a <dt_operand *> (ops[i])->for_id > true_node->for_id) in find_node()
1798 true_node = as_a <dt_operand *> (ops[i]); in find_node()
1804 if (true_node in find_node()
1805 && true_node->for_id != current_id in find_node()
1806 && true_node->for_id > as_a <dt_operand *> (ops[i])->for_id) in find_node()
1817 true_loc = true_node->op->location; in find_node()

1234