/external/libxml2/test/c14n/without-comments/ |
merlin-c14n-two-07.xpath | 5 <!-- only directly-used namespace nodes -->
|
merlin-c14n-two-08.xpath | 5 <!-- no namespace nodes but the default on alternate elements -->
|
/external/llvm/test/CodeGen/ARM/ |
fast-tail-call.ll | 4 ; which led (via a convoluted route) to DAG nodes after a TC_RETURN that
|
/external/llvm/test/CodeGen/X86/ |
pshufd-combine-crash.ll | 6 ; v4f32 X86ISD::PSHUFD nodes with a single PSHUFD.
|
/external/llvm/test/Linker/Inputs/ |
mdlocation.ll | 7 ; Test distinct nodes.
|
/external/llvm/test/Transforms/LICM/ |
2003-02-27-StoreSinkPHIs.ll | 1 ; LICM is adding stores before phi nodes. bad.
|
/external/llvm/test/Verifier/ |
PhiGrouping.ll | 2 ; CHECK: PHI nodes not grouped at top
|
/external/llvm/test/YAMLParser/ |
construct-seq.test | 3 # Ordered sequence of nodes
|
/external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/res/ |
DrawableResourceLoader.java | 72 NodeList nodes = xmlDoc.getElementsByTagName("selector"); local 73 if (nodes != null && nodes.getLength() > 0) { 77 nodes = xmlDoc.getElementsByTagName("layer-list"); 78 if (nodes != null && nodes.getLength() > 0) { 82 nodes = xmlDoc.getElementsByTagName("animation-list"); 83 if (nodes != null && nodes.getLength() > 0) {
|
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/ |
YamlComposeTest.java | 22 import org.yaml.snakeyaml.nodes.MappingNode; 23 import org.yaml.snakeyaml.nodes.Node; 24 import org.yaml.snakeyaml.nodes.NodeId; 25 import org.yaml.snakeyaml.nodes.ScalarNode;
|
/external/xmp_toolkit/XMPCore/src/com/adobe/xmp/ |
XMPIterator.java | 29 * schema nodes. These are just collectors for top level properties in the same 31 * nodes are the property nodes. The nodes below a property node depend on its 36 * proceeds. By default the iteration starts at the root and visits all nodes 40 * node first then all nodes beneath it in a depth first manner. 50 * the root itself and all nodes below the immediate children. This omits the 51 * qualifiers of the immediate children, the qualifier nodes being below what 53 * <li>UST_LEAFNODES - Visit just the leaf property nodes and their
|
/libcore/luni/src/main/java/org/w3c/dom/traversal/ |
NodeIterator.java | 19 * <code>NodeIterators</code> are used to step through a set of nodes, e.g. 20 * the set of nodes in a <code>NodeList</code>, the document subtree 22 * any other set of nodes. The set of nodes to be iterated is determined by 43 * in the <code>NodeFilter</code> interface. Nodes not accepted by 51 * The <code>NodeFilter</code> used to screen nodes. 57 * reference nodes are visible to the <code>NodeIterator</code>. If 62 * skipping individual nodes. 69 * entity reference nodes but no entity expansion, use the
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/i386-linux-gnu/asm/ |
e820.h | 7 * Legacy E820 BIOS limits us to 128 (E820MAX) nodes due to the 8 * constrained space in the zeropage. If we have more nodes than 10 * passed us from the EFI firmware can list more nodes. Size our 12 * nodes, based on up to three entries per node for which the
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/x86_64-linux-gnu/asm/ |
e820.h | 7 * Legacy E820 BIOS limits us to 128 (E820MAX) nodes due to the 8 * constrained space in the zeropage. If we have more nodes than 10 * passed us from the EFI firmware can list more nodes. Size our 12 * nodes, based on up to three entries per node for which the
|
/prebuilts/go/darwin-x86/test/fixedbugs/ |
issue8017.go | 7 // Issues 8017 and 8058: walk modifies nodes generated
|
/prebuilts/go/linux-x86/test/fixedbugs/ |
issue8017.go | 7 // Issues 8017 and 8058: walk modifies nodes generated
|
/sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/ |
PropertyCallback.java | 41 * @param targetNodes the nodes to apply the property to, or null to use the 42 * nodes pass into the 67 final List<? extends INode> nodes = selectedNodes; local 71 for (INode targetNode : nodes) {
|
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
TestTreeNodeStream.java | 169 // stream has 7 real + 6 nav nodes 200 // stream has 7 real + 6 nav nodes 224 stream.mark(); // keep saving nodes though 245 // stream has 7 real + 6 nav nodes 284 // stream has 7 real + 6 nav nodes 307 // stream has 7 real + 6 nav nodes 328 // stream has 8 real + 10 nav nodes 330 CommonTree[] nodes = new CommonTree[n]; local 332 nodes[i] = new CommonTree(new CommonToken((i+1)*10)); 334 Tree g = nodes[0] [all...] |
/external/autotest/client/cros/audio/ |
cras_utils.py | 121 """Gets a command to query the nodes from Cras. 123 @returns: The command to query nodes information from Cras using dbus-send. 183 """Gets nodes information from Cras. 192 """Gets selected output nodes and input nodes. 196 Note that there may be multiple output/input nodes being selected 202 nodes = get_cras_nodes() 203 for node in nodes: 300 nodes = get_cras_nodes() 301 for node in nodes [all...] |
/sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
DynamicContextMenu.java | 165 List<INode> nodes = new ArrayList<INode>(selections.size()); local 167 nodes.add(item.getNode()); 170 List<IContributionItem> menuItems = getMenuItems(nodes); 182 * collection of nodes 184 * @param nodes the collection of nodes to look up actions for 185 * @return a list of contribution items applicable for all the nodes 187 private List<IContributionItem> getMenuItems(List<INode> nodes) { 189 for (INode node : nodes) { 201 // the set of all selected nodes to that first action. Actions are require [all...] |
/external/llvm/lib/Target/Hexagon/ |
HexagonCommonGEP.cpp | 60 // Numbering map for gep nodes. Used to keep track of ordering for 61 // gep nodes. 133 NodeVect Nodes; 355 Nodes.push_back(N); 370 Nodes.push_back(Nx); 394 // The creation of gep nodes requires DT-traversal. When processing a GEP 409 DEBUG(dbgs() << "Gep nodes after initial collection:\n" << Nodes); 414 void invert_find_roots(const NodeVect &Nodes, NodeChildrenMap &NCM, 417 for (const_iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) [all...] |
/external/libchrome/sandbox/linux/bpf_dsl/ |
codegen_unittest.cc | 353 // Populate with 260 initial instruction nodes. 354 std::vector<CodeGen::Node> nodes; local 355 nodes.push_back(MakeInstruction(BPF_RET + BPF_K, 0)); 357 nodes.push_back( 358 MakeInstruction(BPF_ALU + BPF_ADD + BPF_K, i, nodes.back())); 364 nodes.push_back(MakeInstruction(BPF_JMP + BPF_JEQ + BPF_K, 0, 365 nodes.rbegin()[jt], nodes.rbegin()[jf])); 366 RunTest(nodes.back()); 380 // Populate with 260 initial instruction nodes 381 std::vector<CodeGen::Node> nodes; local [all...] |
/external/libgdx/gdx/src/com/badlogic/gdx/graphics/g3d/model/ |
Node.java | 28 /** A node is part of a hierarchy of Nodes in a {@link Model}. A Node encodes a transform relative to its parents. A Node can have
29 * child nodes. Optionally a node can specify a {@link MeshPart} and a {@link Material} to be applied to the mesh part.
160 /** @return The number of child nodes that this Node current contains.
186 /** Adds the specified nodes as the currently last child of this node. If the node is already a child of another node, then it
188 * @param nodes The Node to add as child of this Node
190 public <T extends Node> int addChildren (final Iterable<T> nodes) {
191 return insertChildren(-1, nodes);
215 /** Insert the specified nodes as children of this node at the specified index. If the node is already a child of another node,
219 * @param nodes The nodes to add as child of this Node [all...] |
/prebuilts/go/darwin-x86/src/cmd/pprof/internal/report/ |
source.go | 36 // Group nodes for each matching function. 37 var functions nodes 38 functionNodes := make(map[string]nodes) 55 // Group nodes for each source file. 56 var sourceFiles nodes 57 fileNodes := make(map[string]nodes) 137 var sourceFiles nodes 138 fileNodes := make(map[string]nodes) 183 func sourceCoordinates(asm map[int]nodes) (start, end int) { 198 func assemblyPerSourceLine(objSyms []*objSymbol, rs nodes, src string, obj plugin.ObjTool) map[int]nodes [all...] |
/prebuilts/go/linux-x86/src/cmd/pprof/internal/report/ |
source.go | 36 // Group nodes for each matching function. 37 var functions nodes 38 functionNodes := make(map[string]nodes) 55 // Group nodes for each source file. 56 var sourceFiles nodes 57 fileNodes := make(map[string]nodes) 137 var sourceFiles nodes 138 fileNodes := make(map[string]nodes) 183 func sourceCoordinates(asm map[int]nodes) (start, end int) { 198 func assemblyPerSourceLine(objSyms []*objSymbol, rs nodes, src string, obj plugin.ObjTool) map[int]nodes [all...] |