/dports/security/py-angr/angr-9.0.5405/angr/analyses/decompiler/ |
H A D | empty_node_remover.py | 70 false_node = self._walker._handle(node.false_node) 72 if true_node is None and false_node is None: 75 if true_node is None and false_node is not None: 80 false_node, 81 false_node=None) 82 …ConditionNode(node.addr, node.reaching_condition, node.condition, true_node, false_node=false_node)
|
H A D | region_simplifier.py | 61 if node.false_node is not None: 62 self._handle(node.false_node, successor=successor) 146 if node.false_node is not None: 147 self._handle(node.false_node, successor=successor) 186 if cond_stmt.true_target is not None and successor.false_node is not None: 189 and cond_stmt.true_target.value == successor.false_node.addr: 239 if node.true_node is not None and node.false_node is not None: 248 else_node = node.false_node 249 node.false_node = None 254 if node.false_node is not None: [all …]
|
H A D | structurer_nodes.py | 66 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 161 self.false_node = false_node 172 if self.false_node is not None: 177 self.false_node.dbg_repr(indent+2) 185 return "<ConditionNode (%r|%r)>" % (self.true_node, self.false_node)
|
H A D | utils.py | 76 if node.false_node is not None: 77 replace_last_statement(node.false_node, old_stmt, new_stmt) 177 parent.false_node = SequenceNode(nodes=[parent.false_node]) 178 insert_node(parent.false_node, insert_idx - node_idx, node, 0)
|
H A D | structured_codegen.py | 363 def __init__(self, condition, true_node=None, false_node=None): argument 369 self.false_node = false_node 371 if self.true_node is None and self.false_node is None: 389 if self.false_node is not None: 395 yield from self.false_node.c_repr_chunks(indent=indent + INDENT_DELTA) 1359 false_node=self._handle(condition_node.false_node, is_expr=False) 1360 if condition_node.false_node else None,
|
H A D | structurer.py | 431 if node.false_node is not None: 432 node.false_node = walker._handle(node.false_node) 721 if n.true_node is not None and n.false_node is None: 725 elif n.false_node is not None and n.true_node is None: 726 the_node = CodeNode(n.false_node, n.condition) 1190 node.false_node is None:
|
H A D | condition_processor.py | 229 self.remove_claripy_bool_asts(node.false_node, memo=memo), 291 if s is None and block.false_node: 292 s = cls.get_last_statement(block.false_node) 350 if block.false_node: 351 last_stmts = cls.get_last_statements(block.false_node)
|
H A D | sequence_walker.py | 78 self._handle(node.false_node, parent=node, index=1)
|
H A D | region_identifier.py | 318 false_node=None, 325 false_node=cond,
|
/dports/devel/tree-sitter/tree-sitter-0.20.1/cli/src/tests/ |
H A D | node_test.rs | 72 let false_node = array_node.child(3).unwrap(); in test_node_child() localVariable 80 assert_eq!(false_node.kind(), "false"); in test_node_child() 88 assert_eq!(false_node.is_named(), true); in test_node_child() 103 false_node.end_byte(), in test_node_child() 106 assert_eq!(false_node.start_position(), Point::new(4, 2)); in test_node_child() 107 assert_eq!(false_node.end_position(), Point::new(4, 7)); in test_node_child() 164 assert_eq!(false_node.parent().unwrap(), array_node); in test_node_child() 300 let false_node = array_node.named_child(1).unwrap(); in test_node_named_child() localVariable 312 assert_eq!(false_node.kind(), "false"); in test_node_named_child() 315 false_node.end_byte(), in test_node_named_child() [all …]
|
/dports/cad/yosys/yosys-yosys-0.12/passes/proc/ |
H A D | proc_dlatch.cc | 141 false_node = 2 enumerator 184 return false_node; in find_mux_feedback() 197 if (n != false_node) { in find_mux_feedback() 210 if (n != false_node) { in find_mux_feedback() 221 return false_node; in find_mux_feedback() 231 if (n == false_node) in make_hold() 380 if (n == db.false_node) { in proc_dlatch()
|
/dports/www/node10/node-v10.24.1/deps/v8/src/compiler/ |
H A D | wasm-compiler.h | 220 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 D | escape-analysis.cc | 522 Node* false_node = jsgraph->FalseConstant(); in LowerCompareMapsWithoutLoad() local 523 Node* replacement = false_node; in LowerCompareMapsWithoutLoad() 531 if (replacement == false_node) { in LowerCompareMapsWithoutLoad()
|
H A D | simd-scalar-lowering.cc | 1351 Node* false_node = mcgraph_->Int32Constant(0); in LowerNode() local 1352 Node* tmp_result = false_node; in LowerNode() 1361 graph()->NewNode(machine()->Word32Equal(), rep[i], false_node)); in LowerNode() 1365 tmp_result = is_false.Phi(MachineRepresentation::kWord32, false_node, in LowerNode()
|
/dports/lang/v8/v8-9.6.180.12/src/compiler/ |
H A D | wasm-compiler.h | 287 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 D | escape-analysis.cc | 540 Node* false_node = jsgraph->FalseConstant(); in LowerCompareMapsWithoutLoad() local 541 Node* replacement = false_node; in LowerCompareMapsWithoutLoad() 549 if (replacement == false_node) { in LowerCompareMapsWithoutLoad()
|
H A D | wasm-compiler.cc | 222 Node* Branch(Node* cond, Node** true_node, Node** false_node, in Branch() argument 1311 Node** false_node) { in BranchNoHint() argument 1312 return gasm_->Branch(cond, true_node, false_node, BranchHint::kNone); in BranchNoHint() 1316 Node** false_node) { in BranchExpectFalse() argument 1321 Node** false_node) { in BranchExpectTrue() argument 1322 return gasm_->Branch(cond, true_node, false_node, BranchHint::kTrue); in BranchExpectTrue() 1332 true_node, false_node); in Select() 1336 true_node, false_node); in Select() 1340 false_node); in Select() 1344 false_node); in Select() [all …]
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/v8/src/compiler/ |
H A D | wasm-compiler.h | 232 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 D | escape-analysis.cc | 536 Node* false_node = jsgraph->FalseConstant(); in LowerCompareMapsWithoutLoad() local 537 Node* replacement = false_node; in LowerCompareMapsWithoutLoad() 545 if (replacement == false_node) { in LowerCompareMapsWithoutLoad()
|
H A D | simd-scalar-lowering.cc | 1619 Node* false_node = mcgraph_->Int32Constant(0); in LowerNode() local 1620 Node* tmp_result = false_node; in LowerNode() 1629 graph()->NewNode(machine()->Word32Equal(), rep[i], false_node)); in LowerNode() 1633 tmp_result = is_false.Phi(MachineRepresentation::kWord32, false_node, in LowerNode()
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/v8/src/compiler/ |
H A D | escape-analysis.cc | 537 Node* false_node = jsgraph->FalseConstant(); in LowerCompareMapsWithoutLoad() local 538 Node* replacement = false_node; in LowerCompareMapsWithoutLoad() 546 if (replacement == false_node) { in LowerCompareMapsWithoutLoad()
|
H A D | wasm-compiler.h | 242 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);
|
/dports/lang/v8/v8-9.6.180.12/test/cctest/compiler/ |
H A D | test-representation-change.cc | 142 Node* false_node = r.jsgraph()->FalseConstant(); in TEST() local 143 Node* false_use = r.Return(false_node); in TEST() 145 false_node, MachineRepresentation::kTagged, Type::None(), false_use, in TEST()
|
H A D | test-run-machops.cc | 1057 Node* false_node) { in BuildDiamondPhi() argument 1066 Node* phi = m->Phi(rep, true_node, false_node); in BuildDiamondPhi() 1076 Node* false_node = m.Int32Constant(false_val); in TEST() local 1078 false_node); in TEST() 1091 false_node); in TEST() 1104 false_node); in TEST() 1131 Node* false_node = m.Int32Constant(false_val); in TEST() local 1186 Node* false_node = m.Int32Constant(false_val); in TEST() local 1191 Node* phi = m.Phi(MachineRepresentation::kWord32, false_node, false_node); in TEST() 5021 Node* phi = m.Phi(MachineRepresentation::kWord32, false_node, false_node); in TEST() [all …]
|
/dports/math/cvc4/CVC4-1.7/src/proof/ |
H A D | proof_manager.cpp | 161 Node false_node = NodeManager::currentNM()->mkConst<bool>(false).notNode(); in initCnfProof() local 169 pm->d_cnfProof->pushCurrentAssertion(false_node); in initCnfProof() 170 pm->d_cnfProof->pushCurrentDefinition(false_node); in initCnfProof()
|