| /external/chromium_org/third_party/libaddressinput/src/cpp/src/ |
| address_input_helper.cc | 37 struct Node {
38 const Node* parent;
69 const std::vector<Node>* hierarchy,
80 for (const Node* node = &hierarchy[depth].front();
81 node != NULL; node = node->parent, --depth) {
82 const Rule* rule = node->rule;
139 std::vector<Node> hierarchy[kHierarchyDepth]
164 Node* node = &hierarchy[lookup_key.GetDepth()].back(); local
[all...] |
| /external/chromium_org/third_party/libjingle/source/talk/examples/call/ |
| presencepushtask.cc | 185 std::string node = caps->Attr(QN_NODE); local
190 s->set_caps_node(node);
|
| /external/chromium_org/third_party/libjingle/source/talk/xmpp/ |
| presencereceivetask.cc | 133 std::string node = caps->Attr(QN_NODE); local
138 presence_status->set_caps_node(node);
|
| pubsubclient_unittest.cc | 79 node("topic"),
83 client.reset(new buzz::PubSubClient(xmpp_client, pubsubjid, node));
105 std::string node; member in class:PubSubClientTest
116 "<pub:items node=\"topic\"/>"
126 " <items node='topic'>"
149 " <items node='topic'>"
196 "<publish node=\"topic\">"
241 "<retract node=\"topic\" notify=\"true\">"
|
| pubsubtasks_unittest.cc | 69 node("topic"),
81 std::string node; member in class:PubSubTasksTest
87 new buzz::PubSubRequestTask(client, pubsubjid, node);
96 "<pub:items node=\"topic\"/>"
106 " <items node='topic'>"
137 new buzz::PubSubRequestTask(client, pubsubjid, node);
153 " <items node='topic'>"
165 new buzz::PubSubReceiveTask(client, pubsubjid, node);
189 "<publish node=\"topic\">"
200 new buzz::PubSubPublishTask(client, pubsubjid, node, itemid, children)
[all...] |
| /external/chromium_org/third_party/libxslt/libxslt/ |
| numbersInternals.h | 39 xmlNodePtr node; member in struct:_xsltNumberData
|
| /external/chromium_org/third_party/mesa/src/src/mesa/vbo/ |
| vbo_save_draw.c | 51 const struct vbo_save_vertex_list *node)
58 if (node->current_size == 0)
61 if (node->current_data) {
62 data = node->current_data;
67 if (node->count)
68 offset = (node->buffer_offset +
69 (node->count-1) * node->vertex_size * sizeof(GLfloat));
71 offset = node->buffer_offset;
74 node->vertex_size * sizeof(GLfloat),
259 const struct vbo_save_vertex_list *node = local
[all...] |
| /external/chromium_org/third_party/skia/samplecode/ |
| SampleAnimator.cpp | 66 const SkDOMNode* node, const char name[]) {
67 if (NULL == node) {
68 node = dom.getRootNode();
71 const char* idval = dom.findAttr(node, "id");
73 return node;
75 const SkDOMNode* child = dom.getFirstChild(node);
82 } while ((node = dom.getNextSibling(node)) != NULL);
101 const SkDOM::Node* root = dom.build(text, len);
113 const SkDOM::Node* node = find_nodeID(dom, NULL, name.c_str()) local
[all...] |
| /external/chromium_org/third_party/skia/src/views/ |
| SkViewInflate.cpp | 20 void SkViewInflate::rInflate(const SkDOM& dom, const SkDOM::Node* node, SkView* parent)
22 const char* str = dom.findAttr(node, "id");
26 const SkDOM::Node* child = dom.getFirstChild(node);
50 this->inflateView(parent, dom, node);
53 void SkViewInflate::inflateView(SkView* view, const SkDOM& dom, const SkDOM::Node* node)
58 view->inflate(dom, node);
61 SkView* SkViewInflate::inflate(const SkDOM& dom, const SkDOM::Node* node, SkView* root
104 const SkDOM::Node* node = dom.build(xml, len); local
[all...] |
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/pyxelator/ |
| node.py | 14 class Node(list):
15 " A node in a parse tree "
28 if isinstance(item,Node):
39 if isinstance(item,Node):
45 if isinstance(val,Node):
60 if not isinstance(other,Node):
89 if isinstance(x,Node):
92 node = x.deepfind(cls)
93 if node is not None:
94 return node
294 node = Node( 'a', Node(1,2), Node(Node(Node(),1)) ) variable in class:Node
[all...] |
| /external/chromium_org/tools/gn/ |
| operators_unittest.cc | 45 BinaryOpNode node; local
48 node.set_op(op);
52 node.set_left(scoped_ptr<ParseNode>(new IdentifierNode(identifier_token)));
62 node.set_right(ListWithLiteral(integer).PassAs<ParseNode>());
63 node.Execute(setup.scope(), &err);
69 node.set_right(ListWithLiteral(string_1).PassAs<ParseNode>());
70 node.Execute(setup.scope(), &err);
76 node.set_right(ListWithLiteral(string_2).PassAs<ParseNode>());
77 node.Execute(setup.scope(), &err);
84 ExecuteBinaryOperator(setup.scope(), &node, node.left(), &list, &err)
108 BinaryOpNode node; local
160 BinaryOpNode node; local
185 BinaryOpNode node; local
[all...] |
| /external/chromium_org/ui/views/examples/ |
| tree_view_example.cc | 112 ui::TreeModelNode* node = tree_view_->GetSelectedNode(); local
113 if (node) {
115 remove_->SetEnabled(node != model_.GetRoot());
123 ui::TreeModelNode* node) {
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_bvgraph.h | 55 uptr node = t1.getAndClearFirstOne(); local
56 if (v[node].setBit(to))
58 added_edges[res++] = node;
109 // Returns true if there is a path from the node 'from'
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| DomFront.java | 84 SsaBasicBlock node = nodes.get(i); local
86 + node.getPredecessors());
127 SsaBasicBlock node = nodes.get(i); local
132 for (SsaBasicBlock child : node.getDomChildren()) {
141 System.out.println("domChildren[" + node + "]: "
148 * is for each node. This sweeps the node list and builds the proper
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| BstPathTest.java | 47 SimpleNode node = new SimpleNode('a', null, null); local
48 SimpleNode root = new SimpleNode('b', node, null);
50 SimplePath nodePath = new SimplePath(node, rootPath);
|
| /external/icu/icu4c/source/common/ |
| ucharstrie.cpp | 35 int32_t node; local
36 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
37 valueResult(node) : USTRINGTRIE_NO_VALUE;
83 int32_t node=*pos; local
84 if(node&kValueIsFinal) {
90 // int32_t delta=readValue(pos, node);
92 if(node<kMinTwoUnitValueLead) {
93 delta=node;
94 } else if(node<kThreeUnitValueLead) {
95 delta=((node-kMinTwoUnitValueLead)<<16)|*pos++
113 int32_t node=*pos; local
123 int32_t node=*pos++; local
164 int32_t node; local
195 int32_t node; local
215 int32_t node; local
233 int32_t node=*pos++; local
296 int32_t node=*pos++; local
322 int32_t node=*pos++; local
373 int32_t node=*pos++; local
[all...] |
| /external/icu/icu4c/source/tools/genrb/ |
| rle.c | 300 int32_t node = 0; local
344 * if we could look ahead, but we can't, so we use 'node' to
347 switch (node) {
349 /* Normal idle node */
351 node = 1;
363 node = 0;
367 node = 2;
384 node = 0;
390 if (node != 0){
|
| /external/jemalloc/include/jemalloc/internal/ |
| rtree.h | 14 * Size of each radix tree node (must be a power of 2). This impacts tree
66 void **node, **child; \
69 for (i = lshift = 0, height = rtree->height, node = rtree->root;\
71 i++, lshift += bits, node = child) { \
75 child = (void**)node[subkey]; \
83 * node is a leaf, so it contains values rather than node \
90 uint8_t *leaf = (uint8_t *)node; \
135 void **node, **child; local
138 for (i = lshift = 0, height = rtree->height, node = rtree->root
[all...] |
| /external/jemalloc/src/ |
| huge.c | 27 extent_node_t *node; local
38 /* Allocate an extent node with which to track the chunk. */
39 node = base_node_alloc();
40 if (node == NULL)
51 base_node_dalloc(node);
55 /* Insert node into huge. */
56 node->addr = ret;
57 node->size = csize;
58 node->arena = arena;
61 extent_tree_ad_insert(&huge, node);
162 extent_node_t *node, key; local
184 extent_node_t *node, key; local
204 extent_node_t *node, key; local
223 extent_node_t *node, key; local
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| AMultipleCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
66 void removeChild(@SuppressWarnings("unused") Node child)
78 void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild)
|
| ASequenceExpression.java | 3 package com.google.clearsilver.jsilver.syntax.node;
66 void removeChild(@SuppressWarnings("unused") Node child)
78 void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild)
|
| Node.java | 3 package com.google.clearsilver.jsilver.syntax.node;
8 public abstract class Node implements Switchable, Cloneable
10 private Node parent;
15 public Node parent()
20 void parent(@SuppressWarnings("hiding") Node parent)
25 abstract void removeChild(Node child);
26 abstract void replaceChild(Node oldChild, Node newChild);
28 public void replaceBy(Node node)
[all...] |
| /external/libsepol/include/sepol/policydb/ |
| ebitmap.h | 13 * list of bitmap nodes, where each bitmap node has
24 #define MAPTYPE uint64_t /* portion of bitmap in each node */
25 #define MAPSIZE (sizeof(MAPTYPE) * 8) /* number of bits in node bitmap */
26 #define MAPBIT 1ULL /* a bit in the node bitmap */
30 MAPTYPE map; /* this node's portion of the bitmap */
35 ebitmap_node_t *node; /* first node in the bitmap */ member in struct:ebitmap
40 #define ebitmap_startbit(e) ((e)->node ? (e)->node->startbit : 0)
41 #define ebitmap_startnode(e) ((e)->node)
[all...] |
| /external/libsepol/src/ |
| nodes.c | 12 /* Create a low level node structure from
16 ocontext_t ** node, const sepol_node_t * data)
39 memcpy(&tmp_node->u.node.addr, addr_buf, addr_bsize);
40 memcpy(&tmp_node->u.node.mask, mask_buf, mask_bsize);
64 *node = tmp_node;
79 ERR(handle, "could not create node structure");
85 ocontext_t * node, int proto, sepol_node_t ** record)
88 context_struct_t *con = &node->context[0];
102 (const char *)&node->u.node.addr
302 ocontext_t *node = NULL; local
353 sepol_node_t *node = NULL; local
[all...] |
| /external/ltrace/ |
| expr.h | 54 } node; member in union:expr_node::__anon30390
79 void expr_init_self(struct expr_node *node);
83 void expr_init_named(struct expr_node *node,
87 void expr_init_argno(struct expr_node *node, size_t num);
90 * copied into NODE and owned by it. */
91 void expr_init_const(struct expr_node *node, struct value *val);
92 void expr_init_const_word(struct expr_node *node, long l,
97 void expr_init_index(struct expr_node *node,
103 void expr_init_up(struct expr_node *node, struct expr_node *lhs, int own_lhs);
107 void expr_init_cb1(struct expr_node *node,
[all...] |
