/external/v8/src/compiler/ |
H A D | osr.cc | 55 Zone* tmp_zone, Node* dead, LoopTree* loop_tree, 56 LoopTree::Loop* osr_loop, Node* osr_normal_entry, 57 Node* osr_loop_entry) { 61 Node* sentinel = graph->NewNode(dead->op()); 81 for (Node* node : loop_tree->HeaderNodes(outer)) { 90 Node* orig = all.reachable[i]; 91 Node* copy = mapping->at(orig->id()); 106 for (Node* input : orig->inputs()) { 119 for (Node* orig : all.reachable) { 120 Node* cop [all...] |
H A D | js-type-hint-lowering.cc | 20 Node* left, Node* right, Node* effect, 21 Node* control, FeedbackSlot slot) 86 Node* BuildSpeculativeOperator(const Operator* op) { 109 Node* left_; 110 Node* right_; 111 Node* effect_; 112 Node* control_; 121 Node* lef [all...] |
H A D | js-generic-lowering.cc | 25 CallDescriptor::Flags FrameStateFlagForCall(Node* node) { 38 Reduction JSGenericLowering::Reduce(Node* node) { 54 void JSGenericLowering::LowerJS##Name(Node* node) { \ 85 void JSGenericLowering::ReplaceWithStubCall(Node* node, Callable callable, 90 void JSGenericLowering::ReplaceWithStubCall(Node* node, Callable callable, 98 Node* stub_code = jsgraph()->HeapConstant(callable.code()); 104 void JSGenericLowering::ReplaceWithRuntimeCall(Node* node, 113 Node* ref = jsgraph()->ExternalConstant(ExternalReference(f, isolate())); 114 Node* arity = jsgraph()->Int32Constant(nargs); 121 void JSGenericLowering::LowerJSStrictEqual(Node* nod [all...] |
H A D | load-elimination.cc | 22 Aliasing QueryAlias(Node* a, Node* b) { 63 bool MayAlias(Node* a, Node* b) { return QueryAlias(a, b) != kNoAlias; } 65 bool MustAlias(Node* a, Node* b) { return QueryAlias(a, b) == kMustAlias; } 69 Reduction LoadElimination::Reduce(Node* node) { 77 Node* const value = NodeProperties::GetValueInput(node, i); 84 Node* const effect = NodeProperties::GetEffectInput(node, i); 131 bool IsCompatibleCheck(Node cons [all...] |
H A D | common-operator-reducer.cc | 22 Decision DecideCondition(Node* const cond) { 50 Reduction CommonOperatorReducer::Reduce(Node* node) { 74 Reduction CommonOperatorReducer::ReduceBranch(Node* node) { 76 Node* const cond = node->InputAt(0); 86 for (Node* const use : node->uses()) { 109 Node* const control = node->InputAt(1); 110 for (Node* const use : node->uses()) { 125 Reduction CommonOperatorReducer::ReduceDeoptimizeConditional(Node* node) { 130 Node* condition = NodeProperties::GetValueInput(node, 0); 131 Node* frame_stat [all...] |
H A D | redundancy-elimination.cc | 18 Reduction RedundancyElimination::Reduce(Node* node) { 116 Node* node) const { 124 bool IsCompatibleCheck(Node const* a, Node const* b) { 141 Node* RedundancyElimination::EffectPathChecks::LookupCheck(Node* node) const { 151 Node* RedundancyElimination::EffectPathChecks::LookupBoundsCheckFor( 152 Node* node) const { 163 RedundancyElimination::PathChecksForEffectNodes::Get(Node* node) const { 170 Node* nod [all...] |
H A D | ast-graph-builder.cc | 46 virtual void ProduceValue(Expression* expr, Node* value) = 0; 50 virtual Node* ConsumeValue() = 0; 81 void ProduceValue(Expression* expr, Node* value) final; 82 Node* ConsumeValue() final; 92 void ProduceValue(Expression* expr, Node* value) final; 93 Node* ConsumeValue() final; 103 void ProduceValue(Expression* expr, Node* value) final; 104 Node* ConsumeValue() final; 116 ContextScope(AstGraphBuilder* builder, Scope* scope, Node* context) 168 void ReturnValue(Node* return_valu [all...] |
H A D | simd-scalar-lowering.cc | 54 Node* input = top.node->InputAt(top.input_index++); 86 void SimdScalarLowering::SetLoweredType(Node* node, Node* output) { 140 void SimdScalarLowering::GetIndexNodes(Node* index, Node** new_indices) { 149 void SimdScalarLowering::LowerLoadOp(MachineRepresentation rep, Node* node, 152 Node* base = node->InputAt(0); 153 Node* index = node->InputAt(1); 154 Node* indices[kMaxLanes]; 156 Node* rep_node [all...] |
H A D | js-generic-lowering.h | 30 Reduction Reduce(Node* node) final; 33 #define DECLARE_LOWER(x) void Lower##x(Node* node); 39 void ReplaceWithStubCall(Node* node, Callable c, CallDescriptor::Flags flags); 40 void ReplaceWithStubCall(Node* node, Callable c, CallDescriptor::Flags flags, 43 void ReplaceWithRuntimeCall(Node* node, Runtime::FunctionId f, int args = -1);
|
H A D | memory-optimizer.cc | 37 MemoryOptimizer::AllocationGroup::AllocationGroup(Node* node, 44 MemoryOptimizer::AllocationGroup::AllocationGroup(Node* node, 46 Node* size, Zone* zone) 51 void MemoryOptimizer::AllocationGroup::Add(Node* node) { 55 bool MemoryOptimizer::AllocationGroup::Contains(Node* node) const { 66 int size, Node* top) 73 void MemoryOptimizer::VisitNode(Node* node, AllocationState const* state) { 109 void MemoryOptimizer::VisitAllocate(Node* node, AllocationState const* state) { 111 Node* value; 112 Node* siz [all...] |
/external/tensorflow/tensorflow/core/common_runtime/ |
H A D | constant_folding.cc | 48 bool IsShapeOp(const Node* n) { 57 const Node* n, 80 const Node* n, const std::vector<PartialTensorShape>& input_shapes, 81 std::unordered_map<const Node*, std::vector<Tensor>>* 101 VLOG(1) << "Node " << n->name() << " has input shape dimension " << i 120 bool MaybeReplaceRankOp(const Node* n, argument 122 std::unordered_map<const Node*, std::vector<Tensor>>* 136 bool MaybeReplaceSizeOp(const Node* n, argument 138 std::unordered_map<const Node*, std::vector<Tensor>>* 152 VLOG(1) << "Node " << 79 MaybeReplaceShapeOrShapeNOp( const Node* n, const std::vector<PartialTensorShape>& input_shapes, std::unordered_map<const Node*, std::vector<Tensor>>* shape_replacement_map) argument 171 MaybeReplaceShapeOp( const Node* n, const std::unordered_map<string, std::vector<PartialTensorShape>>* shape_map, std::unordered_map<const Node*, std::vector<Tensor>>* shape_replacement_map) argument 210 IsConstantFoldable( const Node* n, const std::unordered_map<string, std::vector<PartialTensorShape>>* shape_map, const std::function<bool(const Node*)>& consider, std::unordered_map<const Node*, std::vector<Tensor>>* shape_replacement_map) argument 261 ConsiderConstantFoldableNode( Node* n, const ConstantFoldingOptions& opts, std::vector<Node*>* nodes, std::unordered_map<const Node*, gtl::FlatSet<Node*>>* constant_control_deps, std::unordered_map<const Node*, std::vector<Tensor>>* shape_replacement_map, bool* internal_node_inserted) argument 317 FindConstantFoldableNodes( const Graph* graph, const ConstantFoldingOptions& opts, std::vector<Node*>* nodes, std::unordered_map<const Node*, gtl::FlatSet<Node*>>* constant_control_deps, std::unordered_map<const Node*, std::vector<Tensor>>* shape_replacement_map) argument 385 AddShapeNodeToConstantGraph( Node* n, const std::unordered_map<const Node*, std::vector<Tensor>>& shape_replacement_map, std::unordered_map<Node*, std::vector<Node*>>* node_map, const ConstantFoldNameGenerator& generate_new_name, Graph* constant_graph) argument 412 GetConstantGraph( const Graph* orig_graph, const std::vector<Node*>& nodes, const std::unordered_map<const Node*, std::vector<Tensor>>& shape_replacement_map, std::map<NodeAndOutput, Node*>* tensors_to_fetch, const ConstantFoldNameGenerator& generate_new_name) argument [all...] |
/external/llvm/lib/Analysis/ |
H A D | IteratedDominanceFrontier.cpp | 39 if (DomTreeNode *Node = DT.getNode(BB)) 40 PQ.push(std::make_pair(Node, DomLevels.lookup(Node))); 63 DomTreeNode *Node = Worklist.pop_back_val(); local 64 BasicBlock *BB = Node->getBlock(); 75 if (SuccNode->getIDom() == Node) 94 for (auto DomChild : *Node) {
|
/external/oj-libjdwp/make/src/classes/build/tools/jdwpgen/ |
H A D | Parse.java | 34 final Map<String, Node> kindMap = new HashMap<String, Node>(); 93 List<Node> list = new ArrayList<Node>(); 104 Node item() throws IOException { 134 List<Node> list = new ArrayList<Node>(); 140 Node proto = kindMap.get(kind); 146 Node node = (Node)prot [all...] |
H A D | AbstractNamedNode.java | 31 abstract class AbstractNamedNode extends Node { 41 Iterator<Node> it = components.iterator(); 44 Node nameNode = it.next(); 67 for (Node node : components) { 93 for (Node node : components) {
|
/external/snakeyaml/src/main/java/org/yaml/snakeyaml/representer/ |
H A D | BaseRepresenter.java | 30 import org.yaml.snakeyaml.nodes.Node; 51 protected final Map<Object, Node> representedObjects = new IdentityHashMap<Object, Node>() { 54 public Node put(Object key, Node value) { 63 public Node represent(Object data) { 64 Node node = representData(data); 70 protected final Node representData(Object data) { 74 Node node = representedObjects.get(objectToRepresent); 80 Node nod [all...] |
/external/v8/src/compiler/ppc/ |
H A D | instruction-selector-ppc.cc | 32 InstructionOperand UseOperand(Node* node, ImmediateMode mode) { 39 bool CanBeImmediate(Node* node, ImmediateMode mode) { 75 Node* node) { 82 Node* node) { 89 void VisitRRO(InstructionSelector* selector, InstructionCode opcode, Node* node, 100 InstructionCode opcode, Node* node) { 107 Node* success_output = NodeProperties::FindProjection(node, 1); 119 void VisitBinop(InstructionSelector* selector, Node* node, 169 void VisitBinop(InstructionSelector* selector, Node* node, 178 void InstructionSelector::VisitLoad(Node* nod [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | InstrEmitter.cpp | 45 unsigned InstrEmitter::CountResults(SDNode *Node) { argument 46 unsigned N = Node->getNumValues(); 47 while (N && Node->getValueType(N - 1) == MVT::Glue) 49 if (N && Node->getValueType(N - 1) == MVT::Other) 61 static unsigned countOperands(SDNode *Node, unsigned NumExpUses, argument 63 unsigned N = Node->getNumOperands(); 64 while (N && Node->getOperand(N - 1).getValueType() == MVT::Glue) 66 if (N && Node->getOperand(N - 1).getValueType() == MVT::Other) 72 if (isa<RegisterMaskSDNode>(Node->getOperand(I - 1))) 74 if (RegisterSDNode *RN = dyn_cast<RegisterSDNode>(Node 87 EmitCopyFromReg(SDNode *Node, unsigned ResNo, bool IsClone, bool IsCloned, unsigned SrcReg, DenseMap<SDValue, unsigned> &VRBaseMap) argument 191 getDstOfOnlyCopyToRegUse(SDNode *Node, unsigned ResNo) const argument 207 CreateVirtualRegisters(SDNode *Node, MachineInstrBuilder &MIB, const MCInstrDesc &II, bool IsClone, bool IsCloned, DenseMap<SDValue, unsigned> &VRBaseMap) argument [all...] |
H A D | LegalizeDAG.cpp | 84 void LegalizeOp(SDNode *Node); 89 void LegalizeLoadOps(SDNode *Node); 90 void LegalizeStoreOps(SDNode *Node); 112 SDValue ExpandLibCall(RTLIB::Libcall LC, SDNode *Node, bool isSigned); 117 SDNode *Node, bool isSigned); 118 SDValue ExpandFPLibCall(SDNode *Node, RTLIB::Libcall Call_F32, 122 SDValue ExpandIntLibCall(SDNode *Node, bool isSigned, 128 void ExpandDivRemLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results); 129 void ExpandSinCosLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results); 133 SDValue ExpandBUILD_VECTOR(SDNode *Node); 444 LegalizeStoreOps(SDNode *Node) argument [all...] |
/external/swiftshader/third_party/subzero/src/ |
H A D | IceLiveness.h | 72 Variable *getVariable(SizeT LiveIndex, const CfgNode *Node) const; 79 SizeT getNumVarsInNode(const CfgNode *Node) const { 80 return NumGlobals + Nodes[Node->getIndex()].NumLocals; 82 SizeT &getNumNonDeadPhis(const CfgNode *Node) { argument 83 return Nodes[Node->getIndex()].NumNonDeadPhis; 85 LivenessBV &getLiveIn(const CfgNode *Node) { argument 86 SizeT Index = Node->getIndex(); 90 LivenessBV &getLiveOut(const CfgNode *Node) { argument 91 SizeT Index = Node->getIndex(); 96 LiveBeginEndMap *getLiveBegin(const CfgNode *Node) { argument 101 getLiveEnd(const CfgNode *Node) argument [all...] |
/external/v8/src/ |
H A D | splay-tree.h | 100 class Node { class in class:v8::internal::SplayTree 102 Node(const Key& key, const Value& value) function in class:v8::internal::SplayTree::Node 122 Node* left() { return left_; } 123 Node* right() { return right_; } 130 Node* left_; 131 Node* right_; 138 explicit Locator(Node* node) : node_(node) { } 143 inline void bind(Node* node) { node_ = node; } 146 Node* node_; 162 void InsertInternal(int cmp, Node* nod [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | MachinePassRegistry.h | 107 void Add(MachinePassRegistryNode *Node); 111 void Remove(MachinePassRegistryNode *Node); 133 for (RegistryClass *Node = RegistryClass::getList(); 134 Node; Node = Node->getNext()) { 135 this->addLiteralOption(Node->getName(), 136 (typename RegistryClass::FunctionPassCtor)Node->getCtor(), 137 Node->getDescription());
|
/external/apache-xml/src/main/java/org/apache/xml/serializer/dom3/ |
H A D | DOMLocatorImpl.java | 25 import org.w3c.dom.Node;
58 private final Node fRelatedNode;
113 DOMLocatorImpl (int lineNumber, int columnNumber, int byteoffset, Node relatedData, String uri ){
121 } // DOMLocatorImpl (int lineNumber, int columnNumber, int offset, Node errorNode, String uri )
123 DOMLocatorImpl (int lineNumber, int columnNumber, int byteoffset, Node relatedData, String uri, int utf16Offset ){
130 } // DOMLocatorImpl (int lineNumber, int columnNumber, int offset, Node errorNode, String uri )
158 public Node getRelatedNode(){
|
/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/printer/lexicalpreservation/changes/ |
H A D | ListAdditionChange.java | 3 import com.github.javaparser.ast.Node; 13 private final Node nodeAdded; 15 public ListAdditionChange(ObservableProperty observableProperty, int index, Node nodeAdded) { 22 public Object getValue(ObservableProperty property, Node node) { 24 NodeList<Node> nodeList = new NodeList<>();
|
/external/tensorflow/tensorflow/core/kernels/hexagon/ |
H A D | graph_transferer.h | 104 void CacheNode(const Node& node); 106 bool AreAllInputsCached(const Node& node) const; 116 const ShapeRefiner& shape_refiner, const Node& node, 121 const Node& node); 130 bool HasPaddingAndStrides(const Node& node); 132 bool NeedsToAddRank(const Node& node); 134 bool IsPadNode(const Node& node); 139 bool IsNodeFlattenReshape(const Node& node, 144 const ShapeRefiner& shape_refiner, const Node& node); 148 const ShapeRefiner& shape_refiner, const Node [all...] |
/external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
H A D | nv50_ir_graph.cpp | 41 reinterpret_cast<Node *>(it->get())->cut(); 44 void Graph::insert(Node *node) 87 Graph::Node::Node(void *priv) : data(priv), function in class:nv50_ir::Graph::Node 95 void Graph::Node::attach(Node *node, Edge::Type kind) 129 bool Graph::Node::detach(Graph::Node *node) 144 void Graph::Node::cut() 158 Graph::Edge::Edge(Node *or [all...] |