| /art/compiler/optimizing/ |
| dex_cache_array_fixups_arm.h | 20 #include "nodes.h"
|
| gvn.h | 20 #include "nodes.h"
|
| instruction_simplifier_shared.h | 20 #include "nodes.h"
|
| licm.h | 20 #include "nodes.h"
|
| pc_relative_fixups_x86.h | 20 #include "nodes.h"
|
| /build/kati/ |
| ninja.h | 30 void GenerateNinja(const vector<DepNode*>& nodes,
|
| query.go | 67 func handleNodeQuery(w io.Writer, q string, nodes []*DepNode) {
68 for _, n := range nodes {
93 for _, n := range g.nodes {
98 handleNodeQuery(w, q, g.nodes)
|
| /external/antlr/antlr-3.4/antlr3-maven-archetype/src/main/resources/archetype-resources/src/main/antlr3/ |
| TTree.g | 17 // Use ANTLR built-in CommonToken for tree nodes
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| RewriteRuleNodeStream.as | 4 /** Queues up nodes matched on left side of -> in a tree parser. This is
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| CommonTreeAdaptor.cs | 45 * To get your parser to build nodes of a different type, override
47 * dupNode is called to duplicate nodes during rewrite operations.
58 * Tell me how to create a token for use with imaginary token nodes.
75 * Tell me how to create a token for use with imaginary token nodes.
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| RewriteRuleNodeStream.js | 1 /** Queues up nodes matched on left side of -> in a tree parser. This is
|
| RewriteRuleTokenStream.js | 19 * This way we can do hetero tree nodes in rewrite.
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| Counter.java | 32 * This class stores a cache of counted nodes (m_countNodes).
33 * It tries to cache the counted nodes in document order...
55 * A vector of all nodes counted so far.
82 * @param countNodes A vector of all nodes counted so far.
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMNodeListBase.java | 28 * intended to be a general purpose "list of nodes" API and is
37 * <li>If there are several Text nodes in logical succession (ie,
63 * <code>index</code> is greater than or equal to the number of nodes in
75 * The number of nodes in the list. The range of valid child node indices
|
| /external/autotest/client/bin/ |
| cpuset.py | 21 fake_numa_containers = False # container mem via numa=fake mem nodes, else pages
142 # total mbytes of mem nodes available for new containers in parent
220 # all mem nodes now available to a container, both exclusive & shared
229 # Get set of numa memory nodes now used (exclusively or shared)
241 # Get subset of numa memory nodes of parent container which could
243 # This excludes nodes now allocated to existing children.
251 # Get set of numa memory nodes owned by current process's container.
259 # Get subset of numa memory nodes owned by current process's
261 # containers. This excludes any nodes now allocated
270 def nodes_avail_mbytes(nodes)
[all...] |
| /external/autotest/server/site_tests/audio_AudioNodeSwitch/ |
| control.HDMI | 20 This test remotely tests audio nodes selection.
|
| control.JACK | 20 This test remotely tests audio nodes selection.
|
| control.USB | 20 This test remotely tests audio nodes selection.
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| CoreEngine.h | 65 /// WList - A set of queued nodes that need to be processed by the
67 /// the order that nodes are processed.
71 /// These are used to record for key nodes in the ExplodedGraph the
163 /// \brief Enqueue the given set of nodes onto the work list.
166 /// \brief Enqueue nodes that were created as a result of processing
170 /// \brief enqueue the nodes corresponding to the end of function onto the
199 /// \brief This is the simplest builder which generates nodes in the
203 /// frontier nodes (or destination set). This is the set of nodes which should
204 /// be propagated to the next step / builder. They are the nodes which have bee
[all...] |
| /external/clang/lib/Tooling/ |
| RefactoringCallbacks.cpp | 42 if (const Stmt *FromMatch = Result.Nodes.getStmtAs<Stmt>(FromId)) {
55 const Stmt *FromMatch = Result.Nodes.getStmtAs<Stmt>(FromId);
56 const Stmt *ToMatch = Result.Nodes.getStmtAs<Stmt>(ToId);
68 if (const IfStmt *Node = Result.Nodes.getStmtAs<IfStmt>(Id)) {
|
| /external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/table/ |
| TableItemComparator.java | 19 * Adapter to sort table items based on their coverage nodes.
|
| /external/libchrome/sandbox/linux/bpf_dsl/ |
| codegen.h | 29 // to build a DAG of instruction nodes. They'll eventually call
62 // value guaranteed to not equal any actual nodes.
111 // nodes (if any) are semantically-equivalent to N's successor nodes, or
|
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/cache/ |
| ftcmru.h | 36 /* Note that it is possible to pre-allocate the element list nodes. */
122 FTC_MruNode nodes; member in struct:FTC_MruListRec_
164 FTC_MruNode* _pfirst = &(list)->nodes; \
218 FTC_MruNode _first = (list)->nodes; \
|
| /external/libgdx/tests/gdx-tests-android/assets/data/g3d/ |
| cube.g3dj | 56 "nodes": [
|
| /external/libxml2/result/XPath/xptr/ |
| vidbase | 5 Set contains 4 nodes:
|
