/external/v8/src/compiler/ |
H A D | js-builtin-reducer.h | 45 Reduction Reduce(Node* node) final; 48 Reduction ReduceArrayIterator(Node* node, IterationKind kind); 49 Reduction ReduceTypedArrayIterator(Node* node, IterationKind kind); 50 Reduction ReduceArrayIterator(Handle<Map> receiver_map, Node* node, 53 Reduction ReduceArrayIteratorNext(Node* node); 54 Reduction ReduceFastArrayIteratorNext(Handle<Map> iterator_map, Node* node, 56 Reduction ReduceTypedArrayIteratorNext(Handle<Map> iterator_map, Node* node, 58 Reduction ReduceArrayPop(Node* node); 59 Reduction ReduceArrayPush(Node* node); 60 Reduction ReduceDateNow(Node* nod [all...] |
H A D | ast-graph-builder.h | 28 class Node; 48 Node* NewIfTrue() { return NewNode(common()->IfTrue()); } 49 Node* NewIfFalse() { return NewNode(common()->IfFalse()); } 50 Node* NewMerge() { return NewNode(common()->Merge(1), true); } 51 Node* NewLoop() { return NewNode(common()->Loop(1), true); } 52 Node* NewBranch(Node* condition, BranchHint hint = BranchHint::kNone) { 95 SetOncePointer<Node> function_closure_; 96 SetOncePointer<Node> function_context_; 100 Node** input_buffer [all...] |
H A D | js-typed-lowering.h | 45 Reduction Reduce(Node* node) final; 50 Reduction ReduceJSAdd(Node* node); 51 Reduction ReduceJSComparison(Node* node); 52 Reduction ReduceJSLoadNamed(Node* node); 53 Reduction ReduceJSLoadProperty(Node* node); 54 Reduction ReduceJSStoreProperty(Node* node); 55 Reduction ReduceJSOrdinaryHasInstance(Node* node); 56 Reduction ReduceJSLoadContext(Node* node); 57 Reduction ReduceJSStoreContext(Node* node); 58 Reduction ReduceJSLoadModule(Node* nod [all...] |
H A D | common-operator-reducer.h | 32 Reduction Reduce(Node* node) final; 35 Reduction ReduceBranch(Node* node); 36 Reduction ReduceDeoptimizeConditional(Node* node); 37 Reduction ReduceMerge(Node* node); 38 Reduction ReduceEffectPhi(Node* node); 39 Reduction ReducePhi(Node* node); 40 Reduction ReduceReturn(Node* node); 41 Reduction ReduceSelect(Node* node); 43 Reduction Change(Node* node, Operator const* op, Node* [all...] |
H A D | escape-analysis-reducer.h | 27 Reduction Reduce(Node* node) final; 36 Reduction ReduceNode(Node* node); 37 Reduction ReduceLoad(Node* node); 38 Reduction ReduceStore(Node* node); 39 Reduction ReduceAllocate(Node* node); 40 Reduction ReduceFinishRegion(Node* node); 41 Reduction ReduceReferenceEqual(Node* node); 42 Reduction ReduceObjectIsSmi(Node* node); 43 Reduction ReduceFrameStateUses(Node* node); 44 Node* ReduceDeoptStat [all...] |
H A D | js-create-lowering.h | 47 Reduction Reduce(Node* node) final; 50 Reduction ReduceJSCreate(Node* node); 51 Reduction ReduceJSCreateArguments(Node* node); 52 Reduction ReduceJSCreateArray(Node* node); 53 Reduction ReduceJSCreateIterResultObject(Node* node); 54 Reduction ReduceJSCreateKeyValueArray(Node* node); 55 Reduction ReduceJSCreateLiteral(Node* node); 56 Reduction ReduceJSCreateFunctionContext(Node* node); 57 Reduction ReduceJSCreateWithContext(Node* node); 58 Reduction ReduceJSCreateCatchContext(Node* nod [all...] |
H A D | code-assembler.h | 37 class Node; 212 Node* Int32Constant(int32_t value); 213 Node* Int64Constant(int64_t value); 214 Node* IntPtrConstant(intptr_t value); 215 Node* NumberConstant(double value); 216 Node* SmiConstant(Smi* value); 217 Node* SmiConstant(int value); 218 Node* HeapConstant(Handle<HeapObject> object); 219 Node* CStringConstant(const char* str); 220 Node* BooleanConstan [all...] |
H A D | dead-code-elimination.h | 31 Reduction Reduce(Node* node) final; 34 Reduction ReduceEnd(Node* node); 35 Reduction ReduceLoopOrMerge(Node* node); 36 Reduction ReduceLoopExit(Node* node); 37 Reduction ReduceNode(Node* node); 39 Reduction RemoveLoopExit(Node* node); 41 void TrimMergeOrPhi(Node* node, int size); 45 Node* dead() const { return dead_; } 49 Node* const dead_;
|
H A D | bytecode-graph-builder.h | 43 Node* GetFunctionClosure(); 46 Node* GetFunctionContext(); 49 Node* GetNewTarget(); 52 Node* BuildLoadNativeContextField(int index); 62 // Node creation helpers 63 Node* NewNode(const Operator* op, bool incomplete = false) { 64 return MakeNode(op, 0, static_cast<Node**>(nullptr), incomplete); 67 Node* NewNode(const Operator* op, Node* n1) { 68 Node* buffe [all...] |
H A D | redundancy-elimination.h | 19 Reduction Reduce(Node* node) final; 23 Check(Node* node, Check* next) : node(node), next(next) {} 24 Node* node; 35 EffectPathChecks const* AddCheck(Zone* zone, Node* node) const; 36 Node* LookupCheck(Node* node) const; 37 Node* LookupBoundsCheckFor(Node* node) const; 51 EffectPathChecks const* Get(Node* node) const; 52 void Set(Node* nod [all...] |
/external/tensorflow/tensorflow/core/graph/ |
H A D | testlib.cc | 58 Node* Send(Graph* g, Node* input, const string& tensor, const string& sender, 60 Node* ret; 72 Node* Recv(Graph* g, const string& tensor, const string& type, 75 Node* ret; 89 Node* Constant(Graph* g, const Tensor& tensor) { 90 Node* ret; 98 Node* Constant(Graph* g, const Tensor& tensor, const string& name) { 99 Node* ret; 107 Node* HostConstan [all...] |
/external/perfetto/src/traced/probes/filesystem/ |
H A D | prefix_finder.h | 48 class Node { class in class:perfetto::PrefixFinder 51 Node(std::string name, Node* parent) : name_(name), parent_(parent) {} function in class:perfetto::PrefixFinder::Node 53 Node(const Node& that) = delete; 54 Node& operator=(const Node&) = delete; 65 bool operator()(const Node& one, const Node& other) const { 71 Node* AddChil [all...] |
/external/v8/src/builtins/ |
H A D | builtins-async-iterator.cc | 28 void ThrowIfNotAsyncFromSyncIterator(Node* const context, Node* const object, 33 typedef std::function<void(Node* const context, Node* const promise, 37 Node* const context, Node* const iterator, Node* const sent_value, 41 Node* const initial_exception_value = nullptr); 43 Node* AllocateAsyncIteratorValueUnwrapContext(Node* native_contex [all...] |
H A D | builtins-async-function.cc | 14 typedef compiler::Node Node; typedef in namespace:v8::internal 24 void AsyncFunctionAwait(Node* const context, Node* const generator, 25 Node* const awaited, Node* const outer_promise, 29 Node* const context, Node* const sent_value, 46 Node* context, Node* sent_valu [all...] |
/external/llvm/lib/CodeGen/ |
H A D | MachinePassRegistry.cpp | 36 void MachinePassRegistry::Add(MachinePassRegistryNode *Node) { argument 37 Node->setNext(List); 38 List = Node; 39 if (Listener) Listener->NotifyAdd(Node->getName(), 40 Node->getCtor(), 41 Node->getDescription()); 47 void MachinePassRegistry::Remove(MachinePassRegistryNode *Node) { argument 49 if (*I == Node) { 50 if (Listener) Listener->NotifyRemove(Node->getName());
|
/external/valgrind/memcheck/tests/ |
H A D | leak-cases.c | 46 } Node; typedef in typeref:struct:_Node 48 Node* mk(Node* next) 52 Node* x = malloc(2 * sizeof(Node)); 58 Node* p1; 59 Node* p2; 60 Node* p3; 61 Node* p4; 62 Node* p [all...] |
/external/v8/src/interpreter/ |
H A D | interpreter-intrinsics.cc | 14 using compiler::Node; 65 Node* IntrinsicsHelper::InvokeIntrinsic(Node* function_id, Node* context, 66 Node* first_arg_reg, Node* arg_count) { 107 Node* IntrinsicsHelper::CompareInstanceType(Node* object, int type, 109 Node* instance_type = __ LoadInstanceType(object); 119 Node* IntrinsicsHelpe [all...] |
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
H A D | SDNodeOrdering.h | 36 void add(const SDNode *Node, unsigned O) { argument 37 OrderMap[Node] = O; 39 void remove(const SDNode *Node) { argument 40 DenseMap<const SDNode*, unsigned>::iterator Itr = OrderMap.find(Node); 47 unsigned getOrder(const SDNode *Node) { argument 48 return OrderMap[Node];
|
H A D | ScheduleDAGSDNodes.h | 52 static bool isPassiveNode(SDNode *Node) { argument 53 if (isa<ConstantSDNode>(Node)) return true; 54 if (isa<ConstantFPSDNode>(Node)) return true; 55 if (isa<RegisterSDNode>(Node)) return true; 56 if (isa<GlobalAddressSDNode>(Node)) return true; 57 if (isa<BasicBlockSDNode>(Node)) return true; 58 if (isa<FrameIndexSDNode>(Node)) return true; 59 if (isa<ConstantPoolSDNode>(Node)) return true; 60 if (isa<JumpTableSDNode>(Node)) return true; 61 if (isa<ExternalSymbolSDNode>(Node)) retur 124 const SDNode *Node; member in class:llvm::ScheduleDAGSDNodes::RegDefIter [all...] |
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
H A D | DTMNodeListBase.java | 22 import org.w3c.dom.Node; 70 public Node item(int index) {
|
/external/apache-xml/src/main/java/org/apache/xml/serializer/ |
H A D | DOMSerializer.java | 25 import org.w3c.dom.Node; 73 public void serialize(Node node) throws IOException;
|
H A D | TransformStateSetter.java | 25 import org.w3c.dom.Node; 47 void setCurrentNode(Node n);
|
/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/nodeTypes/modifiers/ |
H A D | NodeWithAccessModifiers.java | 3 import com.github.javaparser.ast.Node; 8 public interface NodeWithAccessModifiers<N extends Node> extends NodeWithPublicModifier<N>, NodeWithPrivateModifier<N>, NodeWithProtectedModifier<N> {
|
/external/oj-libjdwp/make/src/classes/build/tools/jdwpgen/ |
H A D | AbstractSimpleNode.java | 31 abstract class AbstractSimpleNode extends Node { 35 components = new ArrayList<Node>();
|
/external/swiftshader/third_party/LLVM/unittests/ADT/ |
H A D | ilistTest.cpp | 19 struct Node : ilist_node<Node> { struct in namespace:__anon23175 22 Node() {} function in struct:__anon23175::Node 23 Node(int _Value) : Value(_Value) {} function in struct:__anon23175::Node 27 ilist<Node> List; 28 List.push_back(Node(1)); 33 List.push_back(Node(2)); 38 const ilist<Node> &ConstList = List;
|