/external/swiftshader/third_party/SPIRV-Tools/test/util/ |
D | ilist_test.cpp | 49 TestNode nodes[10]; in TEST() local 64 TestList BuildList(TestNode nodes[], int n) { in BuildList() 75 TestNode nodes[10]; in TEST() local 82 TestNode nodes[10]; in TEST() local 89 TestNode nodes[10]; in TEST() local 96 TestNode nodes[10]; in TEST() local 103 TestNode nodes[10]; in TEST() local 113 TestNode nodes[10]; in TEST() local 123 TestNode nodes[10]; in TEST() local 135 TestNode nodes[10]; in TEST() local [all …]
|
/external/deqp-deps/SPIRV-Tools/test/util/ |
D | ilist_test.cpp | 49 TestNode nodes[10]; in TEST() local 64 TestList BuildList(TestNode nodes[], int n) { in BuildList() 75 TestNode nodes[10]; in TEST() local 82 TestNode nodes[10]; in TEST() local 89 TestNode nodes[10]; in TEST() local 96 TestNode nodes[10]; in TEST() local 103 TestNode nodes[10]; in TEST() local 113 TestNode nodes[10]; in TEST() local 123 TestNode nodes[10]; in TEST() local 135 TestNode nodes[10]; in TEST() local [all …]
|
/external/antlr/tool/src/test/java/org/antlr/test/ |
D | TestTopologicalSort.java | 55 List<String> nodes = g.sort(); in testFairlyLargeGraph() local 69 List<String> nodes = g.sort(); in testCyclicGraph() local 83 List<String> nodes = g.sort(); in testRepeatedEdges() local 97 List<String> nodes = g.sort(); in testSimpleTokenDependence() local 111 List<String> nodes = g.sort(); in testParserLexerCombo() local
|
/external/ltp/testcases/kernel/syscalls/move_pages/ |
D | move_pages_support.c | 63 int alloc_pages_on_nodes(void **pages, unsigned int num, int *nodes) in alloc_pages_on_nodes() 112 int nodes[num]; in alloc_pages_linear() local 153 int nodes[num]; in alloc_pages_on_node() local 169 verify_pages_on_nodes(void **pages, int *status, unsigned int num, int *nodes) in verify_pages_on_nodes() 220 int nodes[num]; in verify_pages_linear() local 252 int nodes[num]; in verify_pages_on_node() local 275 int nodes[num]; in alloc_shared_pages_on_node() local
|
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/parser/ |
D | State.java | 10 ArrayList nodes; field in State 12 State(@SuppressWarnings("hiding") int state, @SuppressWarnings("hiding") ArrayList nodes) in State()
|
/external/doclava/src/com/google/doclava/ |
D | Hierarchy.java | 27 HashMap<String, TreeSet<String>> nodes = new HashMap<String, TreeSet<String>>(); in makeHierarchy() local 76 private static int depth(HashMap<String, TreeSet<String>> nodes, String name) { in depth() 94 private static void recurse(HashMap<String, TreeSet<String>> nodes, String name, Data hdf, in recurse()
|
/external/epid-sdk/ext/ipp/sources/ippcp/ |
D | pcpbnresourceca.c | 71 int cpBigNumListGetSize(int feBitSize, int nodes) in cpBigNumListGetSize() 95 void cpBigNumListInit(int feBitSize, int nodes, BigNumNode* pList) in cpBigNumListInit()
|
/external/antlr/runtime/ObjC/Framework/ |
D | BufferedTreeNodeStream.h | 49 __strong AMutableArray *nodes; variable 68 AMutableArray *nodes; variable
|
D | StreamEnumerator.h | 39 AMutableArray *nodes; variable
|
D | TreeIterator.h | 45 __strong FastQueue *nodes; variable
|
/external/tensorflow/tensorflow/compiler/jit/graphcycles/ |
D | graphcycles_test.cc | 61 static void PrintNodes(Nodes *nodes) { in PrintNodes() 78 static void PrintGCEdges(Nodes *nodes, tensorflow::GraphCycles *gc) { in PrintGCEdges() 92 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges, in PrintTransitiveClosure() 108 static void PrintGCTransitiveClosure(Nodes *nodes, in PrintGCTransitiveClosure() 123 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, in CheckTransitiveClosure() 146 static void CheckEdges(Nodes *nodes, Edges *edges, in CheckEdges() 176 static int RandomNode(std::mt19937 *rnd, Nodes *nodes) { in RandomNode() 199 Nodes nodes; in TEST() local 514 int32 *nodes = new int32[num_nodes]; in BM_StressTest() local
|
/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/utils/ |
D | PositionUtils.java | 46 public static <T extends Node> void sortByBeginPosition(List<T> nodes) { in sortByBeginPosition() 50 public static <T extends Node> void sortByBeginPosition(NodeList<T> nodes) { in sortByBeginPosition() 54 …public static <T extends Node> void sortByBeginPosition(List<T> nodes, final boolean ignoringAnnot… in sortByBeginPosition()
|
/external/clang/test/CodeGenCXX/ |
D | constructor-template.cpp | 17 A nodes; member 39 List<BinomialNode<T>*> nodes; member in BinomialNode
|
/external/v8/src/asmjs/ |
D | switch-logic.cc | 14 CaseNode* CreateBst(ZoneVector<CaseNode*>* nodes, size_t begin, size_t end) { in CreateBst() 45 ZoneVector<CaseNode*> nodes(zone); in OrderCases() local
|
/external/javaparser/javaparser-symbol-solver-core/src/main/java/com/github/javaparser/symbolsolver/ |
D | SourceFileInfoExtractor.java | 170 List<Node> nodes = new LinkedList<>(); in collectAllNodes() local 176 private void collectAllNodes(Node node, List<Node> nodes) { in collectAllNodes() 192 List<Node> nodes = collectAllNodes(cu); in solve() local
|
/external/python/cpython3/Lib/lib2to3/ |
D | pytree.py | 479 def match_seq(self, nodes, results=None): argument 489 def generate_matches(self, nodes): argument 677 def match_seq(self, nodes, results=None): argument 688 def generate_matches(self, nodes): argument 733 def _iterative_matches(self, nodes): argument 762 def _bare_name_matches(self, nodes): argument 778 def _recursive_matches(self, nodes, count): argument 812 def match_seq(self, nodes): argument 816 def generate_matches(self, nodes): argument 828 def generate_matches(patterns, nodes): argument
|
/external/python/cpython2/Lib/lib2to3/ |
D | pytree.py | 513 def match_seq(self, nodes, results=None): argument 523 def generate_matches(self, nodes): argument 711 def match_seq(self, nodes, results=None): argument 722 def generate_matches(self, nodes): argument 767 def _iterative_matches(self, nodes): argument 796 def _bare_name_matches(self, nodes): argument 812 def _recursive_matches(self, nodes, count): argument 846 def match_seq(self, nodes): argument 850 def generate_matches(self, nodes): argument 862 def generate_matches(patterns, nodes): argument
|
/external/antlr/runtime/Java/src/main/java/org/antlr/runtime/ |
D | RecognitionException.java | 124 TreeNodeStream nodes = (TreeNodeStream)input; in extractInformationFromTreeNodeStream() local 188 TreeNodeStream nodes = (TreeNodeStream)input; in getUnexpectedType() local
|
/external/testng/src/main/java/org/testng/internal/ |
D | DynamicGraph.java | 88 private Collection<? extends T> getUnfinishedNodes(List<T> nodes) { in getUnfinishedNodes() 101 public void setStatus(Collection<T> nodes, Status status) { in setStatus() 200 List<T> nodes = m_dependingOn.get(k); in toDot() local
|
/external/tensorflow/tensorflow/compiler/tf2xla/ |
D | functionalize_control_flow_util.h | 45 string NodesToString(const T& nodes) { in NodesToString()
|
/external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/utils/ |
D | PositionUtils.java | 45 public static <T extends Node> void sortByBeginPosition(List<T> nodes){ in sortByBeginPosition() 49 …public static <T extends Node> void sortByBeginPosition(List<T> nodes, final boolean ignoringAnnot… in sortByBeginPosition()
|
/external/brotli/c/enc/ |
D | backward_references_hq.c | 250 static BROTLI_INLINE void UpdateZopfliNode(ZopfliNode* nodes, size_t pos, in UpdateZopfliNode() 305 const ZopfliNode* nodes, in ComputeMinimumCopyLength() 335 const ZopfliNode* nodes) { in ComputeDistanceShortcut() 364 const ZopfliNode* nodes, in ComputeDistanceCache() 386 const ZopfliCostModel* model, StartPosQueue* queue, ZopfliNode* nodes) { in EvaluateNode() 410 StartPosQueue* queue, ZopfliNode* nodes) { in UpdateNodes() 552 ZopfliNode* nodes) { in ComputeShortestPathFromNodes() 569 const size_t block_start, const ZopfliNode* nodes, int* dist_cache, in BrotliZopfliCreateCommands() 615 const BackwardMatch* matches, ZopfliNode* nodes) { in ZopfliIterate() 654 const int* dist_cache, HasherHandle hasher, ZopfliNode* nodes) { in BrotliZopfliComputeShortestPath() [all …]
|
/external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_src/proper_source/com/github/javaparser/ |
D | PositionUtils.java | 45 public static <T extends Node> void sortByBeginPosition(List<T> nodes){ in sortByBeginPosition() 49 …public static <T extends Node> void sortByBeginPosition(List<T> nodes, final boolean ignoringAnnot… in sortByBeginPosition()
|
/external/strace/tests/ |
D | move_pages.c | 79 print_node_array(const int *const nodes, in print_node_array() 164 int *const nodes, in print_move_pages()
|
/external/strace/tests-mx32/ |
D | move_pages.c | 79 print_node_array(const int *const nodes, in print_node_array() 164 int *const nodes, in print_move_pages()
|