HomeSort by relevance Sort by last modified time
    Searched refs:nodes (Results 251 - 275 of 653) sorted by null

<<11121314151617181920>>

  /external/llvm/examples/OCaml-Kaleidoscope/Chapter7/
ast.ml 5 (* expr - Base type for all expression nodes. *)
  /external/openssl/apps/
CA.sh 58 echo "usage: $0 -newcert|-newreq|-newreq-nodes|-newca|-sign|-verify" >&2
96 -newreq-nodes)
98 $REQ -new -nodes -keyout newreq.pem -out newreq.pem $DAYS
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
cgraph.h 211 /* For normal nodes pointer to the list of alias and thunk nodes,
212 in alias/thunk nodes pointer to the normal node. */
214 /* Circular list of nodes in the same comdat group if non-NULL. */
245 /* Ordering of all cgraph nodes. */
267 nodes when they are needed for virtual clone instantiation. */
277 During WPA output it is used to mark nodes that are present in
284 /* Set for nodes that was constructed and finalized by frontend. */
288 /* Set for alias and thunk nodes, same_body points to the node they are alias
306 /* A cgraph node set is a collection of cgraph nodes. A cgraph nod
    [all...]
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
cgraph.h 211 /* For normal nodes pointer to the list of alias and thunk nodes,
212 in alias/thunk nodes pointer to the normal node. */
214 /* Circular list of nodes in the same comdat group if non-NULL. */
245 /* Ordering of all cgraph nodes. */
267 nodes when they are needed for virtual clone instantiation. */
277 During WPA output it is used to mark nodes that are present in
284 /* Set for nodes that was constructed and finalized by frontend. */
288 /* Set for alias and thunk nodes, same_body points to the node they are alias
306 /* A cgraph node set is a collection of cgraph nodes. A cgraph nod
    [all...]
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
cgraph.h 211 /* For normal nodes pointer to the list of alias and thunk nodes,
212 in alias/thunk nodes pointer to the normal node. */
214 /* Circular list of nodes in the same comdat group if non-NULL. */
245 /* Ordering of all cgraph nodes. */
267 nodes when they are needed for virtual clone instantiation. */
277 During WPA output it is used to mark nodes that are present in
284 /* Set for nodes that was constructed and finalized by frontend. */
288 /* Set for alias and thunk nodes, same_body points to the node they are alias
306 /* A cgraph node set is a collection of cgraph nodes. A cgraph nod
    [all...]
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
cgraph.h 211 /* For normal nodes pointer to the list of alias and thunk nodes,
212 in alias/thunk nodes pointer to the normal node. */
214 /* Circular list of nodes in the same comdat group if non-NULL. */
245 /* Ordering of all cgraph nodes. */
267 nodes when they are needed for virtual clone instantiation. */
277 During WPA output it is used to mark nodes that are present in
284 /* Set for nodes that was constructed and finalized by frontend. */
288 /* Set for alias and thunk nodes, same_body points to the node they are alias
306 /* A cgraph node set is a collection of cgraph nodes. A cgraph nod
    [all...]
  /system/core/sh/
mknodes.sh 39 exec >$objdir/nodes.h.tmp
120 mv $objdir/nodes.h.tmp $objdir/nodes.h || exit 1
123 exec >$objdir/nodes.c.tmp
217 mv $objdir/nodes.c.tmp $objdir/nodes.c || exit 1
  /external/apache-xml/src/main/java/org/apache/xalan/transformer/
NodeSorter.java 35 * This class can sort vectors of DOM nodes according to a select pattern.
65 * Given a vector of nodes, sort each node according to
67 * @param v an vector of Nodes.
87 // based on the input vector of nodes
88 Vector nodes = new Vector(); local
94 nodes.addElement(elem);
99 mergesort(nodes, scratchVector, 0, n - 1, support);
101 // return sorted vector of nodes
104 v.setItem(((NodeCompareElem) nodes.elementAt(i)).m_node, i);
114 * Return the results of a compare of two nodes
    [all...]
  /external/chromium/chrome/browser/bookmarks/
bookmark_node_data_unittest.cc 193 // Tests reading/writing of multiple nodes.
208 // Write the nodes to the clipboard.
209 std::vector<const BookmarkNode*> nodes; local
210 nodes.push_back(folder);
211 nodes.push_back(url_node);
212 BookmarkNodeData drag_data(nodes);
  /external/chromium/chrome/browser/history/
starred_url_database.h 50 // . Makes sure there is a bookmark bar and other nodes. If no bookmark bar
54 // . Makes sure the visual order of all nodes is correct.
124 // bookmark and folder. On success all the root nodes (bookmark bar node,
134 // It's up to the caller to delete the nodes returned in roots and
149 // Returns the first node in nodes with the specified type, or null if there
152 const std::set<StarredNode*>& nodes,
159 // moved to be children of the bookmark bar node. Similarly all nodes
  /external/chromium_org/chrome/browser/ui/gtk/bookmarks/
bookmark_utils_gtk.h 77 // Pickle a vector of nodes into a GtkSelection.
78 void WriteBookmarksToSelection(const std::vector<const BookmarkNode*>& nodes,
  /external/chromium_org/third_party/WebKit/Source/web/tests/
TouchActionTest.cpp 182 RefPtr<WebCore::NodeList> nodes = root->querySelectorAll("[expected-action]", es); local
185 for (unsigned index = 0; index < nodes->length(); index++) {
186 WebCore::Element* element = toElement(nodes->item(index));
188 ASSERT_TRUE(nodes->item(index)->isElementNode());
  /external/chromium_org/third_party/jinja2/
visitor.py 6 This module implements a visitor for the nodes.
11 from jinja2.nodes import Node
19 Per default the visitor functions for the nodes are ``'visit_'`` +
48 """Walks the abstract syntax tree and allows modifications of nodes.
  /external/chromium_org/third_party/openssl/openssl/crypto/x509v3/
pcy_int.h 132 /* This structure represents the relationship between nodes */
140 /* Number of child nodes */
148 /* nodes at this level */
149 STACK_OF(X509_POLICY_NODE) *nodes; member in struct:X509_POLICY_LEVEL_st
162 /* Extra policy data when additional nodes (not from the certificate)
  /external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/pyxelator/
ir.py 136 for node in self.nodes():
275 for node in self.nodes():
646 nodes = decl.deepfilter( TypeSpecifiers )
647 for node in nodes:
655 nodes = decl.deepfilter( TypeSpecifiers )
656 for node in nodes:
810 for node in self.nodes():
857 nodes = tuple( [ repr(node) for node in self ] )
859 return nodes, typedefs
862 nodes, typedefs = stat
    [all...]
  /external/chromium_org/tools/checkdeps/
graphdeps.py 33 Also can highlight fanins and/or fanouts of certain nodes matching the
68 incl: Include only nodes matching this regexp; such nodes' fanin/fanout
70 excl: Exclude nodes matching this regexp; such nodes' fanin/fanout is
72 hilite_fanins: Highlight fanins of nodes matching this regexp with a
74 hilite_fanouts: Highlight fanouts of nodes matching this regexp with a
146 """Computes nodes' and edges' properties for the dependency graph |deps| and
193 # Edges and nodes are emphasized with color and line/border weight depending
241 nodes = [
    [all...]
  /external/chromium_org/tools/grit/grit/gather/
policy_json.py 86 all the <message> nodes.
  /external/chromium_org/v8/src/
ast.cc 818 return ListCaptureRegisters(nodes());
854 ZoneList<RegExpTree*>* nodes = this->nodes(); local
855 for (int i = 0; i < nodes->length(); i++) {
856 RegExpTree* node = nodes->at(i);
865 ZoneList<RegExpTree*>* nodes = this->nodes(); local
866 for (int i = nodes->length() - 1; i >= 0; i--) {
867 RegExpTree* node = nodes->at(i);
949 for (int i = 0; i < that->nodes()->length(); i++)
    [all...]
  /external/guava/guava-tests/test/com/google/common/collect/
BstInOrderPathTest.java 180 BstInOrderPath<SimpleNode> path, SimpleNode... nodes) {
183 ASSERT.that(pathToList(path)).hasContentsInOrder(nodes);
188 BstInOrderPath<SimpleNode> path, SimpleNode... nodes) {
191 ASSERT.that(pathToList(path)).hasContentsInOrder(nodes);
  /external/openssl/crypto/x509v3/
pcy_int.h 132 /* This structure represents the relationship between nodes */
140 /* Number of child nodes */
148 /* nodes at this level */
149 STACK_OF(X509_POLICY_NODE) *nodes; member in struct:X509_POLICY_LEVEL_st
162 /* Extra policy data when additional nodes (not from the certificate)
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/
DependencyGraph.java 42 * <li> Quickly determine not just the dependencies on other nodes, but which nodes
63 INode[] nodes = layout.getChildren(); local
80 for (INode child : nodes) {
153 * @param nodes the set of nodes that we want to compute the transitive dependencies
157 * @return the set of nodes that directly or indirectly depend on the given nodes in
160 public Set<INode> dependsOn(Collection<? extends INode> nodes, boolean vertical) {
163 // Traverse the graph of constraints and determine all nodes affected b
    [all...]
ResizeHandler.java 73 Set<INode> nodes = Collections.singleton(resized); local
74 mDraggedNodes = nodes;
76 mHorizontalDeps = mDependencyGraph.dependsOn(nodes, false /* vertical */);
77 mVerticalDeps = mDependencyGraph.dependsOn(nodes, true /* vertical */);
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/
ExplodedRenderingHelper.java 127 if (type == Node.ELEMENT_NODE) { // ignore TEXT/CDATA nodes.
350 * Nodes with no id are ignored and not put in the map.
351 * @param nodes the nodes to fill the map with.
354 private Map<String, Node> computeIdNodeMap(Set<Node> nodes) {
356 for (Node node : nodes) {
377 * Returns a list of nodes for which a given attribute contains a reference to a given ID.
379 * @param nodes the list of nodes to search through
382 * @return a newly allocated, non-null, list of nodes. Could be empty
    [all...]
  /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
ANTLRBufferedTreeNodeStream.h 48 NSMutableArray *nodes; variable
67 NSMutableArray *nodes; variable
87 @property (retain, getter=getNodes, setter=setNodes:) NSMutableArray *nodes; variable
  /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
ANTLRBufferedTreeNodeStream.h 48 NSMutableArray *nodes; variable
67 NSMutableArray *nodes; variable
87 @property (retain, getter=getNodes, setter=setNodes:) NSMutableArray *nodes; variable

Completed in 1022 milliseconds

<<11121314151617181920>>