Home
last modified time | relevance | path

Searched refs:Nodes (Results 1 – 25 of 145) sorted by relevance

123456

/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/
DIceTimerTree.cpp38 Nodes.resize(1); // Reserve Nodes[0] for the root node (sentinel). in TimerStack()
84 for (const TimerTreeNode &SrcNode : Src.Nodes) { in mergeFrom()
93 Nodes[MyIndex].Time += SrcNode.Time; in mergeFrom()
94 Nodes[MyIndex].UpdateCount += SrcNode.UpdateCount; in mergeFrom()
112 Path.push_back(Mapping[Nodes[Index].Interior]); in getPath()
113 assert(Nodes[Index].Parent < Index); in getPath()
114 Index = Nodes[Index].Parent; in getPath()
123 if (Nodes[Parent].Children.size() <= ID) in getChildIndex()
124 Nodes[Parent].Children.resize(ID + 1); in getChildIndex()
125 if (Nodes[Parent].Children[ID] == 0) { in getChildIndex()
[all …]
DIceLiveness.h80 return NumGlobals + Nodes[Node->getIndex()].NumLocals; in getNumVarsInNode()
83 return Nodes[Node->getIndex()].NumNonDeadPhis; in getNumNonDeadPhis()
88 return Nodes[Index].LiveIn; in getLiveIn()
93 return Nodes[Index].LiveOut; in getLiveOut()
99 return &Nodes[Index].LiveBegin; in getLiveBegin()
104 return &Nodes[Index].LiveEnd; in getLiveEnd()
131 if (Index >= Nodes.size()) { in resize()
133 Nodes.resize(Index + 1); in resize()
142 LivenessVector<LivenessNode> Nodes; variable
DIceCfg.cpp98 SizeT LabelIndex = Nodes.size(); in makeNode()
100 Nodes.push_back(Node); in makeNode()
105 assert(Nodes.size() == NewNodes.size()); in swapNodes()
106 Nodes.swap(NewNodes); in swapNodes()
108 Nodes[I]->resetIndex(I); in swapNodes()
226 for (auto *Node : Nodes) { in fixPhiNodes()
243 for (CfgNode *Node : Nodes) { in computeInOutEdges()
258 CfgNode *Node = Nodes[Index]; in computeInOutEdges()
269 Nodes[Dest] = Nodes[Source]; in computeInOutEdges()
270 Nodes[Dest]->resetIndex(Dest); in computeInOutEdges()
[all …]
DIceLiveness.cpp44 Nodes.resize(NumNodes); in initInternal()
55 ++Nodes[Index].NumLocals; in initInternal()
66 LivenessNode &N = Nodes[(*I)->getIndex()]; in initInternal()
90 LiveIndex = Nodes[NodeIndex].NumLocals++; in initInternal()
91 Nodes[NodeIndex].LiveToVarMap[LiveIndex] = Var; in initInternal()
112 LivenessNode &Node = Nodes[(*I)->getIndex()]; in initInternal()
139 return Nodes[NodeIndex].LiveToVarMap[LiveIndex - NumGlobals]; in getVariable()
DIceLoopAnalyzer.cpp145 const NodeList &Nodes = Func->getNodes(); in LoopAnalyzer() local
149 AllNodes.reserve(Nodes.size()); in LoopAnalyzer()
150 WorkStack.reserve(Nodes.size()); in LoopAnalyzer()
151 LoopStack.reserve(Nodes.size()); in LoopAnalyzer()
154 for (CfgNode *Node : Nodes) in LoopAnalyzer()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DDirectedGraph.h176 explicit DirectedGraph(NodeType &N) : Nodes() { addNode(N); } in DirectedGraph()
177 DirectedGraph(const DGraphType &G) : Nodes(G.Nodes) {} in DirectedGraph()
178 DirectedGraph(DGraphType &&RHS) : Nodes(std::move(RHS.Nodes)) {} in DirectedGraph()
180 Nodes = G.Nodes;
184 Nodes = std::move(G.Nodes);
188 const_iterator begin() const { return Nodes.begin(); } in begin()
189 const_iterator end() const { return Nodes.end(); } in end()
190 iterator begin() { return Nodes.begin(); } in begin()
191 iterator end() { return Nodes.end(); } in end()
192 const NodeType &front() const { return *Nodes.front(); } in front()
[all …]
DIntervalMap.h337 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, in adjustSiblingSizes() argument
340 for (int n = Nodes - 1; n; --n) { in adjustSiblingSizes()
354 if (Nodes == 0) in adjustSiblingSizes()
358 for (unsigned n = 0; n != Nodes - 1; ++n) { in adjustSiblingSizes()
361 for (unsigned m = n + 1; m != Nodes; ++m) { in adjustSiblingSizes()
373 for (unsigned n = 0; n != Nodes; n++) in adjustSiblingSizes()
411 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
1171 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot() local
1174 unsigned size[Nodes]; in branchRoot()
1178 if (Nodes == 1) in branchRoot()
[all …]
/third_party/typescript/tests/baselines/reference/
DsubstitutionTypeNoMergeOfAssignableType.types19 type Nodes<T = any> = {
20 >Nodes : Nodes<T>
27 function makeEntityStore<T extends Record<string, Entity>>(config: T): Nodes<T> {
28 >makeEntityStore : <T extends Record<string, Entity>>(config: T) => Nodes<T>
31 return {} as Nodes<T>
32 >{} as Nodes<T> : Nodes<T>
37 >myTest : Nodes<{ test: { fields: { id: {}; }; }; }>
38 >makeEntityStore({ test: { fields: { id: {} } } }) : Nodes<{ test: { fields: { id: {}; }; }; }>
39 >makeEntityStore : <T extends Record<string, Entity>>(config: T) => Nodes<T>
50 >myTest : Nodes<{ test: { fields: { id: {}; }; }; }>
DsubstitutionTypeNoMergeOfAssignableType.symbols31 type Nodes<T = any> = {
32 >Nodes : Symbol(Nodes, Decl(substitutionTypeNoMergeOfAssignableType.ts, 10, 3))
53 function makeEntityStore<T extends Record<string, Entity>>(config: T): Nodes<T> {
60 >Nodes : Symbol(Nodes, Decl(substitutionTypeNoMergeOfAssignableType.ts, 10, 3))
63 return {} as Nodes<T>
64 >Nodes : Symbol(Nodes, Decl(substitutionTypeNoMergeOfAssignableType.ts, 10, 3))
DsubstitutionTypeNoMergeOfAssignableType.js14 type Nodes<T = any> = {
20 function makeEntityStore<T extends Record<string, Entity>>(config: T): Nodes<T> {
21 return {} as Nodes<T>
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
DIntervalMap.cpp119 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, in distribute() argument
122 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements"); in distribute()
124 if (!Nodes) in distribute()
128 const unsigned PerNode = (Elements + Grow) / Nodes; in distribute()
129 const unsigned Extra = (Elements + Grow) % Nodes; in distribute()
130 IdxPair PosPair = IdxPair(Nodes, 0); in distribute()
132 for (unsigned n = 0; n != Nodes; ++n) { in distribute()
134 if (PosPair.first == Nodes && Sum > Position) in distribute()
141 assert(PosPair.first < Nodes && "Bad algebra"); in distribute()
148 for (unsigned n = 0; n != Nodes; ++n) { in distribute()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
DMachinePipeliner.h318 SetVector<SUnit *> Nodes; variable
331 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) { in NodeSet()
333 for (unsigned i = 0, e = Nodes.size(); i < e; ++i) in NodeSet()
334 for (const SDep &Succ : Nodes[i]->Succs) in NodeSet()
335 if (Nodes.count(Succ.getSUnit())) in NodeSet()
339 bool insert(SUnit *SU) { return Nodes.insert(SU); } in insert()
341 void insert(iterator S, iterator E) { Nodes.insert(S, E); } in insert()
344 return Nodes.remove_if(P); in remove_if()
347 unsigned count(SUnit *SU) const { return Nodes.count(SU); } in count()
351 unsigned size() const { return Nodes.size(); } in size()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DCallGraphSCCPass.h90 std::vector<CallGraphNode *> Nodes; variable
96 Nodes.assign(NewNodes.begin(), NewNodes.end()); in initialize()
99 bool isSingular() const { return Nodes.size() == 1; } in isSingular()
100 unsigned size() const { return Nodes.size(); } in size()
108 iterator begin() const { return Nodes.begin(); } in begin()
109 iterator end() const { return Nodes.end(); } in end()
DBlockFrequencyInfoImpl.h223 NodeList Nodes; ///< Header and the members of the loop. member
229 : Parent(Parent), Nodes(1, Header), BackedgeMass(1) {} in LoopData()
234 : Parent(Parent), Nodes(FirstHeader, LastHeader) { in LoopData()
235 NumHeaders = Nodes.size(); in LoopData()
236 Nodes.insert(Nodes.end(), FirstOther, LastOther); in LoopData()
242 return std::binary_search(Nodes.begin(), Nodes.begin() + NumHeaders, in isHeader()
244 return Node == Nodes[0]; in isHeader()
247 BlockNode getHeader() const { return Nodes[0]; } in getHeader()
253 return std::lower_bound(Nodes.begin(), Nodes.begin() + NumHeaders, B) - in getHeaderIndex()
254 Nodes.begin(); in getHeaderIndex()
[all …]
DIntervalIterator.h73 Int->Nodes.push_back(BB); in addNodeToInterval()
84 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end()); in addNodeToInterval()
DLazyCallGraph.h436 SmallVector<Node *, 1> Nodes; variable
439 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) in SCC() argument
440 : OuterRefSCC(&OuterRefSCC), Nodes(std::forward<NodeRangeT>(Nodes)) {} in SCC()
444 Nodes.clear(); in clear()
462 OS << "..., " << *C.Nodes.back();
488 iterator begin() const { return Nodes.begin(); } in begin()
489 iterator end() const { return Nodes.end(); } in end()
491 int size() const { return Nodes.size(); } in size()
1196 void buildSCCs(RefSCC &RC, node_stack_range Nodes);
DInterval.h48 Nodes.push_back(Header); in Interval()
54 std::vector<BasicBlock*> Nodes; variable
67 for (BasicBlock *Node : Nodes) in contains()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/
DGraph.h168 NodeVector Nodes; variable
181 assert(NId < Nodes.size() && "Out of bound NodeId"); in getNode()
182 return Nodes[NId]; in getNode()
185 assert(NId < Nodes.size() && "Out of bound NodeId"); in getNode()
186 return Nodes[NId]; in getNode()
197 Nodes[NId] = std::move(N); in addConstructedNode()
199 NId = Nodes.size(); in addConstructedNode()
200 Nodes.push_back(std::move(N)); in addConstructedNode()
239 : CurNId(CurNId), EndNId(G.Nodes.size()), FreeNodeIds(G.FreeNodeIds) { in NodeItr()
289 NodeItr end() const { return NodeItr(G.Nodes.size(), G); } in end()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
DHexagonCommonGEP.cpp151 NodeVect Nodes; member in __anon9f1273570111::HexagonCommonGEP
377 Nodes.push_back(N); in processGepInst()
392 Nodes.push_back(Nx); in processGepInst()
430 LLVM_DEBUG(dbgs() << "Gep nodes after initial collection:\n" << Nodes); in collect()
433 static void invert_find_roots(const NodeVect &Nodes, NodeChildrenMap &NCM, in invert_find_roots() argument
437 for (const_iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in invert_find_roots()
449 NodeSet &Nodes) { in nodes_for_root() argument
452 Nodes.insert(Root); in nodes_for_root()
461 Nodes.insert(CF->second.begin(), CF->second.end()); in nodes_for_root()
542 for (NodeVect::iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in common()
[all …]
DHexagonISelDAGToDAG.h143 void ppSimplifyOrSelect0(std::vector<SDNode*> &&Nodes);
144 void ppAddrReorderAddShl(std::vector<SDNode*> &&Nodes);
145 void ppAddrRewriteAndSrl(std::vector<SDNode*> &&Nodes);
146 void ppHoistZextI1(std::vector<SDNode*> &&Nodes);
/third_party/typescript/tests/cases/compiler/
DsubstitutionTypeNoMergeOfAssignableType.ts13 type Nodes<T = any> = { alias
19 function makeEntityStore<T extends Record<string, Entity>>(config: T): Nodes<T> {
20 return {} as Nodes<T>
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DBlockFrequencyInfoImpl.cpp404 for (const BlockNode &M : Loop.Nodes) { in packageLoop()
510 for (const BlockNode &N : Loop.Nodes) { in unwrapLoop()
632 Nodes.reserve(OuterLoop.Nodes.size()); in addNodesInLoop()
633 for (auto N : OuterLoop.Nodes) in addNodesInLoop()
647 for (auto &I : Nodes) in indexNodes()
766 for (const auto &N : Loop->Nodes) in createIrreducibleLoop()
798 auto O = OuterLoop.Nodes.begin() + 1; in updateLoopWithIrreducible()
799 for (auto I = O, E = OuterLoop.Nodes.end(); I != E; ++I) in updateLoopWithIrreducible()
802 OuterLoop.Nodes.erase(O, OuterLoop.Nodes.end()); in updateLoopWithIrreducible()
819 auto &HeaderNode = Loop.Nodes[H]; in adjustLoopHeaderMass()
DLazyCallGraph.cpp234 assert(!Nodes.empty() && "Can't have an empty SCC!"); in verify()
236 for (Node *N : Nodes) { in verify()
657 TargetSCC.Nodes.append(C->Nodes.begin(), C->Nodes.end()); in switchInternalEdgeToCall()
658 for (Node *N : C->Nodes) in switchInternalEdgeToCall()
743 Worklist.swap(OldSCC.Nodes); in switchInternalEdgeToRef()
758 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
808 OldSCC.Nodes.push_back(N); in switchInternalEdgeToRef()
809 OldSCC.Nodes.append(PendingSCCStack.begin(), PendingSCCStack.end()); in switchInternalEdgeToRef()
812 OldSCC.Nodes.push_back(DFSStack.pop_back_val().first); in switchInternalEdgeToRef()
1184 Worklist.append(C->Nodes.begin(), C->Nodes.end()); in removeInternalRefEdge()
[all …]
DCallGraph.cpp93 SmallVector<CallGraphNode *, 16> Nodes; in print() local
94 Nodes.reserve(FunctionMap.size()); in print()
97 Nodes.push_back(I.second.get()); in print()
99 llvm::sort(Nodes, [](CallGraphNode *LHS, CallGraphNode *RHS) { in print()
107 for (CallGraphNode *CN : Nodes) in print()
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc34 using Nodes = std::vector<int>; typedef
77 static void PrintGCEdges(Nodes *nodes, const IdMap &id, GraphCycles *gc) { in PrintGCEdges()
89 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure()
102 static void PrintGCTransitiveClosure(Nodes *nodes, const IdMap &id, in PrintGCTransitiveClosure()
115 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, const IdMap &id, in CheckTransitiveClosure()
136 static void CheckEdges(Nodes *nodes, Edges *edges, const IdMap &id, in CheckEdges()
169 static int RandomNode(RandomEngine* rng, Nodes *nodes) { in RandomNode()
193 Nodes nodes; in TEST()

123456