/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAGPrinter.cpp | 45 static unsigned numEdgeDestLabels(const void *Node) { argument 46 return ((const SDNode *) Node)->getNumValues(); 49 static std::string getEdgeDestLabel(const void *Node, unsigned i) { argument 50 return ((const SDNode *) Node)->getValueType(i).getEVTString(); 54 static std::string getEdgeSourceLabel(const void *Node, EdgeIter I) { argument 55 return itostr(I - SDNodeIterator::begin((SDNode *) Node)); 62 static bool edgeTargetsEdgeSource(const void *Node, EdgeIter I) { argument 67 /// called to determine which outgoing edge of Node is the target of this 70 static EdgeIter getEdgeTarget(const void *Node, EdgeIter I) { argument 85 static bool hasNodeAddressLabel(const SDNode *Node, argument 93 getEdgeAttributes(const void *Node, EdgeIter EI, const SelectionDAG *Graph) argument 105 getSimpleNodeLabel(const SDNode *Node, const SelectionDAG *G) argument 139 getNodeLabel(const SDNode *Node, const SelectionDAG *G) argument [all...] |
H A D | LegalizeDAG.cpp | 116 SDValue ExpandLibCall(RTLIB::Libcall LC, SDNode *Node, bool isSigned); 121 SDNode *Node, bool isSigned); 122 SDValue ExpandFPLibCall(SDNode *Node, RTLIB::Libcall Call_F32, 125 SDValue ExpandIntLibCall(SDNode *Node, bool isSigned, 131 void ExpandDivRemLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results); 134 SDValue ExpandBUILD_VECTOR(SDNode *Node); 135 SDValue ExpandSCALAR_TO_VECTOR(SDNode *Node); 136 void ExpandDYNAMIC_STACKALLOC(SDNode *Node, 138 SDValue ExpandFCOPYSIGN(SDNode *Node); 151 SDValue ExpandVectorBuildThroughStack(SDNode* Node); 226 FindCallEndFromCallStart(SDNode *Node, int depth = 0) argument 273 FindCallStartFromCallEnd(SDNode *Node) argument [all...] |
/external/tensorflow/tensorflow/compiler/jit/ |
H A D | mark_for_compilation_pass.h | 48 const std::function<bool(const Node*, const DeviceType&)>&
|
/external/tensorflow/tensorflow/core/common_runtime/ |
H A D | constant_folding_test.cc | 47 void ExpectNodeClose(const Node* n, gtl::ArraySlice<T> values, 60 void ExpectNodeEqual(const Node* n, gtl::ArraySlice<T> values, 72 // Builds a map from node name to Node* for `graph`. 73 std::unordered_map<string, Node*> NodeNameIndex(const Graph& graph) { 74 std::unordered_map<string, Node*> index; 75 for (Node* node : graph.nodes()) { 112 std::unordered_map<string, Node*> index = NodeNameIndex(g); 113 Node* s1 = index.at("s1"); 114 Node* s2 = index.at("s2"); 171 Node* n [all...] |
H A D | memory_types.h | 44 const Node* n, int index, MemoryType* memory_type);
|
/external/tensorflow/tensorflow/core/graph/ |
H A D | gradients.h | 27 Node* node;
|
H A D | algorithm_test.cc | 43 const std::vector<Node*>& inputs, string* error) { 49 for (const Node* node : inputs) { 75 Node* w1 = SourceOp("TestParams", b.opts().WithName("W1")); 76 Node* w2 = SourceOp("TestParams", b.opts().WithName("W2")); 77 Node* input = 79 Node* t1 = BinaryOp("TestMul", w1, {input, 1}, b.opts().WithName("t1")); 86 std::vector<Node*> order; 122 // pointer type, for example the order of FlatSet<Node*> depends on the 123 // raw pointer value of Node. Stable post order suppose to remove this 127 Node* w [all...] |
/external/v8/src/compiler/ |
H A D | all-nodes.cc | 20 AllNodes::AllNodes(Zone* local_zone, Node* end, const Graph* graph, 28 void AllNodes::Mark(Zone* local_zone, Node* end, const Graph* graph) { 34 for (Node* const input : reachable[i]->inputs()) { 45 for (Node* use : reachable[i]->uses()) {
|
H A D | node-marker.h | 23 V8_INLINE Mark Get(const Node* node) { 31 V8_INLINE void Set(Node* node, Mark mark) { 47 // were created earlier. Internally, the local state is stored in the Node 66 V8_INLINE State Get(const Node* node) { 70 V8_INLINE void Set(Node* node, State state) {
|
H A D | simplified-operator-reducer.h | 32 Reduction Reduce(Node* node) final; 35 Reduction ReduceReferenceEqual(Node* node); 37 Reduction Change(Node* node, const Operator* op, Node* a);
|
H A D | escape-analysis.cc | 62 bool IsVirtual(Node* node); 63 bool IsEscaped(Node* node); 64 bool IsAllocation(Node* node); 73 void EnqueueForStatusAnalysis(Node* node); 74 bool SetEscaped(Node* node); 75 bool IsEffectBranchPoint(Node* node); 76 bool IsDanglingEffectNode(Node* node); 89 bool IsNotReachable(Node* node); 92 void Process(Node* node); 93 void ProcessAllocate(Node* nod [all...] |
H A D | basic-block-instrumentor.cc | 72 Node* zero = graph->NewNode(common.Int32Constant(0)); 73 Node* one = graph->NewNode(common.Int32Constant(1)); 83 Node* base = graph->NewNode( 85 Node* load = graph->NewNode(machine.Load(MachineType::Uint32()), base, zero, 87 Node* inc = graph->NewNode(machine.Int32Add(), load, one); 88 Node* store = 94 Node* to_insert[kArraySize] = {zero, one, base, load, inc, store};
|
H A D | js-context-specialization.cc | 19 Reduction JSContextSpecialization::Reduce(Node* node) { 31 Reduction JSContextSpecialization::SimplifyJSLoadContext(Node* node, 32 Node* new_context, 50 Reduction JSContextSpecialization::SimplifyJSStoreContext(Node* node, 51 Node* new_context, 69 Reduction JSContextSpecialization::ReduceJSLoadContext(Node* node) { 76 Node* outer = NodeProperties::GetOuterContext(node, &depth); 111 Node* constant = jsgraph_->Constant(value); 117 Reduction JSContextSpecialization::ReduceJSStoreContext(Node* node) { 125 Node* oute [all...] |
H A D | liveness-analyzer.h | 18 class Node; 23 void ClearNonLiveFrameStateSlots(Node* frame_state, BitVector* liveness); 25 Node* replacement, size_t local_count, 40 Node* ClearNonLiveStateValues(Node* frame_state, BitVector* liveness); 45 // Node that replaces dead values. 46 Node* replacement_node_; 105 void Checkpoint(Node* node) { entries_.push_back(Entry(node)); } 118 Node* node() const { 127 explicit Entry(Node* nod [all...] |
H A D | typer.cc | 30 void Decorate(Node* node) final; 76 Reduction Reduce(Node* node) override { 145 Type* TypeNode(Node* node) { 218 #define DECLARE_METHOD(x) inline Type* Type##x(Node* node); 227 Type* TypeOrNone(Node* node) { 232 Type* Operand(Node* node, int i) { 233 Node* operand_node = NodeProperties::GetValueInput(node, i); 237 Type* Weaken(Node* node, Type* current_type, Type* previous_type); 251 Type* TypeUnaryOp(Node* node, UnaryTyperFun); 252 Type* TypeBinaryOp(Node* nod [all...] |
H A D | js-inlining.cc | 37 explicit JSCallAccessor(Node* call) : call_(call) { 42 Node* target() { 47 Node* receiver() { 52 Node* new_target() { 57 Node* frame_state() { 76 Node* call_; 79 Reduction JSInliner::InlineCall(Node* call, Node* new_target, Node* context, 80 Node* frame_stat [all...] |
/external/llvm/lib/Analysis/ |
H A D | LazyCallGraph.cpp | 61 LazyCallGraph::Node::Node(LazyCallGraph &G, Function &F) function in class:LazyCallGraph::Node 96 void LazyCallGraph::Node::insertEdgeInternal(Function &Target, Edge::Kind EK) { 97 if (Node *N = G->lookup(Target)) 104 void LazyCallGraph::Node::insertEdgeInternal(Node &TargetN, Edge::Kind EK) { 109 void LazyCallGraph::Node::setEdgeKind(Function &TargetF, Edge::Kind EK) { 113 void LazyCallGraph::Node::removeEdgeInternal(Function &Target) { 122 void LazyCallGraph::Node::dump() const { 188 for (Node * [all...] |
/external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/nodeTypes/ |
H A D | NodeWithAnnotations.java | 27 import com.github.javaparser.ast.Node; 57 normalAnnotationExpr.setParentNode((Node) this); 68 ((Node) this).tryAddImportToParentCompilationUnit(clazz); 83 markerAnnotationExpr.setParentNode((Node) this); 94 ((Node) this).tryAddImportToParentCompilationUnit(clazz); 110 singleMemberAnnotationExpr.setParentNode((Node) this); 123 ((Node) this).tryAddImportToParentCompilationUnit(clazz);
|
/external/oj-libjdwp/make/src/classes/build/tools/jdwpgen/ |
H A D | AbstractTypeListNode.java | 33 void constrainComponent(Context ctx, Node node) { 52 for (Node node : components) { 60 for (Node node : components) { 68 for (Node node : components) { 91 for (Iterator<Node> it = components.iterator(); it.hasNext();) { 102 for (Node node : components) { 114 for (Node node : components) {
|
/external/skia/src/sksl/ |
H A D | SkSLCFGGenerator.h | 23 struct Node { struct in struct:SkSL::BasicBlock 29 Node(Kind kind, bool constantPropagation, std::unique_ptr<Expression>* expression, function in struct:SkSL::BasicBlock::Node 88 bool tryRemoveExpression(std::vector<BasicBlock::Node>::iterator* iter); 96 bool tryRemoveExpressionBefore(std::vector<BasicBlock::Node>::iterator* iter, Expression* e); 103 bool tryRemoveLValueBefore(std::vector<BasicBlock::Node>::iterator* iter, Expression* lvalue); 110 bool tryInsertExpression(std::vector<BasicBlock::Node>::iterator* iter, 113 std::vector<Node> fNodes;
|
/external/skqp/src/sksl/ |
H A D | SkSLCFGGenerator.h | 23 struct Node { struct in struct:SkSL::BasicBlock 29 Node(Kind kind, bool constantPropagation, std::unique_ptr<Expression>* expression, function in struct:SkSL::BasicBlock::Node 88 bool tryRemoveExpression(std::vector<BasicBlock::Node>::iterator* iter); 96 bool tryRemoveExpressionBefore(std::vector<BasicBlock::Node>::iterator* iter, Expression* e); 103 bool tryRemoveLValueBefore(std::vector<BasicBlock::Node>::iterator* iter, Expression* lvalue); 110 bool tryInsertExpression(std::vector<BasicBlock::Node>::iterator* iter, 113 std::vector<Node> fNodes;
|
/external/javaparser/javaparser-testing/src/test/java/com/github/javaparser/ast/visitor/ |
H A D | TreeVisitorTest.java | 26 import com.github.javaparser.ast.Node; 45 public void process(Node node) { 61 public void process(Node node) { 78 public void process(Node node) { 90 public void process(Node node) { 101 public void process(Node node) { 114 public void process(Node node) { 128 Node.ParentsVisitor visitor = new Node.ParentsVisitor(x); 150 public void process(Node nod [all...] |
/external/v8/src/compiler/s390/ |
H A D | instruction-selector-s390.cc | 80 InstructionOperand UseOperand(Node* node, OperandModes mode) { 87 InstructionOperand UseAnyExceptImmediate(Node* node) { 94 int64_t GetImmediate(Node* node) { 104 bool CanBeImmediate(Node* node, OperandModes mode) { 134 bool CanBeMemoryOperand(InstructionCode opcode, Node* user, Node* input, 160 AddressingMode GenerateMemoryOperandInputs(Node* index, Node* base, 161 Node* displacement, 204 Node* operan [all...] |
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
H A D | DOMBuilder.java | 32 import org.w3c.dom.Node; 54 protected Node m_currentNode = null; 57 protected Node m_root = null; 60 protected Node m_nextSibling = null; 78 public DOMBuilder(Document doc, Node node) 116 public Node getRootDocument() 118 return (null != m_docFrag) ? (Node) m_docFrag : (Node) m_doc; 124 public Node getRootNode() 134 public Node getCurrentNod [all...] |
/external/clang/lib/Tooling/ |
H A D | RefactoringCallbacks.cpp | 68 if (const IfStmt *Node = Result.Nodes.getStmtAs<IfStmt>(Id)) { 69 const Stmt *Body = PickTrueBranch ? Node->getThen() : Node->getElse(); 71 Replace.insert(replaceStmtWithStmt(*Result.SourceManager, *Node, *Body)); 75 Replace.insert(replaceStmtWithText(*Result.SourceManager, *Node, ""));
|