Home
last modified time | relevance | path

Searched defs:Nodes (Results 1 – 25 of 53) sorted by relevance

123

/third_party/flutter/skia/third_party/externals/wuffs/doc/spec/
Drac-spec.md214 ### Magic
225 ### Arity
239 ### Checksum
252 ### Reserved (0)
257 ### COffs and DOffs, STags and TTags
303 ### COffMax
323 ### Version
328 ### Codec
346 ### Branch Node Validation
/third_party/mesa3d/src/gallium/drivers/r600/sb/
Dnotes.markdown91 ### Nodes subsection
96 #### Control flow nodes
254 #### Instruction nodes
262 #### SSA-specific nodes
/third_party/typescript/tests/cases/compiler/
DsubstitutionTypeNoMergeOfAssignableType.ts13 type Nodes<T = any> = { alias
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DInterval.h54 std::vector<BasicBlock*> Nodes; variable
DCallGraphSCCPass.h90 std::vector<CallGraphNode *> Nodes; variable
DLazyCallGraph.h436 SmallVector<Node *, 1> Nodes; variable
439 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) in SCC()
DBlockFrequencyInfoImpl.h223 NodeList Nodes; ///< Header and the members of the loop. member
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/
DIceTimerTree.h90 std::vector<TimerTreeNode> Nodes; /// indexed by TTindex variable
DIceLiveness.h142 LivenessVector<LivenessNode> Nodes; variable
DIceLoopAnalyzer.cpp145 const NodeList &Nodes = Func->getNodes(); in LoopAnalyzer() local
DIceCfg.h310 NodeList Nodes; /// linearized node list; Entry should be first variable
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Instrumentation/
DCGProfile.cpp87 std::vector<Metadata *> Nodes; in addModuleFlags() local
/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()
DItaniumManglingCanonicalizer.cpp91 llvm::FoldingSet<NodeHeader> Nodes; member in __anon7f15896c0111::FoldingNodeAllocator
/third_party/jsoncpp/include/json/
Dreader.h230 typedef std::stack<Value*> Nodes; typedef
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DScopedNoAliasAA.cpp134 SmallPtrSetImpl<const MDNode *> &Nodes) { in collectMDInDomain()
DDDG.cpp85 auto &Nodes = cast<const PiBlockDDGNode>(&N)->getNodes(); in operator <<() local
DCallGraph.cpp93 SmallVector<CallGraphNode *, 16> Nodes; in print() local
DLazyCallGraph.cpp1666 void LazyCallGraph::buildSCCs(RefSCC &RC, node_stack_range Nodes) { in buildSCCs()
1687 [this, &RC](node_stack_range Nodes) { in buildSCCs()
1724 [this](node_stack_range Nodes) { in buildRefSCCs()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
DRDFDeadCode.cpp179 bool DeadCodeElimination::erase(const SetVector<NodeId> &Nodes) { in erase()
DHexagonConstExtenders.cpp145 SmallVector<Node*,8> Nodes; in nodesWith() local
151 SmallVector<Node*,8> Nodes; in ~RangeTree() local
1335 SmallVector<RangeTree::Node*,8> Nodes; in assignInits() local
1339 uint8_t Align, uint8_t Offset) { in assignInits()
DHexagonCommonGEP.cpp151 NodeVect Nodes; member in __anon6c4d7f180111::HexagonCommonGEP
433 static void invert_find_roots(const NodeVect &Nodes, NodeChildrenMap &NCM, in invert_find_roots()
449 NodeSet &Nodes) { in nodes_for_root()
DHexagonISelDAGToDAG.cpp977 void HexagonDAGToDAGISel::ppSimplifyOrSelect0(std::vector<SDNode*> &&Nodes) { in ppSimplifyOrSelect0()
1025 void HexagonDAGToDAGISel::ppAddrReorderAddShl(std::vector<SDNode*> &&Nodes) { in ppAddrReorderAddShl()
1089 void HexagonDAGToDAGISel::ppAddrRewriteAndSrl(std::vector<SDNode*> &&Nodes) { in ppAddrRewriteAndSrl()
1154 void HexagonDAGToDAGISel::ppHoistZextI1(std::vector<SDNode*> &&Nodes) { in ppHoistZextI1()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DIntervalMap.h337 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, in adjustSiblingSizes()
1171 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot() local
1212 const unsigned Nodes = RootBranch::Capacity / Branch::Capacity + 1; in splitRoot() local
1970 unsigned Nodes = 0; in overflow() local
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DScheduleDAG.cpp606 std::vector<int> Nodes; in GetSubGraph() local

123