| /external/jemalloc/include/jemalloc/internal/ |
| ctl.h | 19 struct ctl_node_s node; member in struct:ctl_named_node_s
21 /* If (nchildren == 0), this is a terminal node. */
29 struct ctl_node_s node; member in struct:ctl_indexed_node_s
|
| /external/jemalloc/src/ |
| chunk.c | 14 * Trees of chunks that were previously allocated (trees differ only in node
48 extent_node_t *node; local
70 node = extent_tree_szad_nsearch(chunks_szad, &key);
71 if (node == NULL) {
75 leadsize = ALIGNMENT_CEILING((uintptr_t)node->addr, alignment) -
76 (uintptr_t)node->addr;
77 assert(node->size >= leadsize + size);
78 trailsize = node->size - leadsize - size;
79 ret = (void *)((uintptr_t)node->addr + leadsize);
80 zeroed = node->zeroed
262 extent_node_t *xnode, *node, *prev, *xprev, key; local
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/data/ |
| DefaultDataContext.java | 25 * This is the basic implementation of the DataContext. It stores the root Data node and a stack of
33 * Root node of the Data structure used by the current context.
142 head.node = null;
193 // The local variable references another Data node, dereference it.
194 if (curr.node == null) {
198 curr.node = findVariable(curr.value, create, curr.nextScope);
199 if (curr.node == null) {
200 // Node does not exist. Any children won't either.
204 // We have a reference to the Data node directly. Use it.
206 // This is the node we're interested in
258 Data node = null; field in class:DefaultDataContext.LocalVariable
[all...] |
| /external/ksoap2/ksoap2-base/src/main/java/org/ksoap2/ |
| SoapEnvelope.java | 75 * The body object received with this envelope. Will be an KDom Node for
81 * The body object to be sent with this envelope. Must be a KDom Node
163 Node headers = new Node();
198 Node node = (bodyIn instanceof Node) ? (Node) bodyIn : new Node(); local
199 node.parse(parser)
[all...] |
| /external/libcap-ng/libcap-ng-0.7/utils/ |
| netcap.c | 164 lnode node; local
194 node.ppid = ppid;
195 node.pid = pid;
196 node.uid = euid;
197 node.cmd = strdup(cmd);
198 node.inode = inode;
199 node.capabilities = strdup(text);
200 node.bounds = strdup(bounds);
202 list_append(&l, &node);
|
| /external/libpcap/ |
| nametoaddr.c | 388 u_int node, area; local
390 if (sscanf(s, "%d.%d", &area, &node) != 2)
394 *addr |= (node & NODEMASK);
|
| /external/libxml2/ |
| error.c | 251 xmlNodePtr node; local
268 node = err->node;
273 if ((node != NULL) && (node->type == XML_ELEMENT_NODE))
274 name = node->name;
461 xmlNodePtr node = (xmlNodePtr) nod; local
519 } else if ((node != NULL) && (file == NULL)) {
522 if ((node->doc != NULL) && (node->doc->URL != NULL))
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/ |
| builtin-inject.c | 35 struct list_head node; member in struct:event_entry
257 list_for_each_entry(ent, &inject->samples, node) {
259 list_del_init(&ent->node);
288 list_add(&ent->node, &inject->samples);
304 list_for_each_entry(ent, &inject->samples, node) {
369 list_for_each_entry(evsel, &session->evlist->entries, node) {
|
| /external/linux-tools-perf/perf-3.12.0/tools/perf/tests/ |
| hists_link.c | 211 list_for_each_entry(evsel, &evlist->entries, node) {
281 struct rb_node *node; local
291 node = rb_first(root);
292 while (node) {
295 he = rb_entry(node, struct hist_entry, rb_node_in);
308 node = rb_next(node);
331 struct rb_node *node; local
343 node = rb_first(root);
344 while (node) {
407 struct rb_node *node; local
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/ui/gtk/ |
| hists.c | 49 list_for_each_entry(pair, &he->pairs.head, pairs.node) {
142 struct callchain_node *node; local
149 node = rb_entry(nd, struct callchain_node, rb_node);
151 hits = callchain_cumul_hits(node);
155 need_new_parent = !has_single_node && (node->val_nr > 1);
157 list_for_each_entry(chain, &node->val, list) {
179 child_total = node->children_hit;
184 perf_gtk__add_callchain(&node->rb_root, store, &iter, col,
378 list_for_each_entry(pos, &evlist->entries, node) {
|
| /external/linux-tools-perf/perf-3.12.0/tools/perf/ui/stdio/ |
| hist.c | 86 struct rb_node *node, *next; local
97 node = rb_first(root);
98 while (node) {
102 child = rb_entry(node, struct callchain_node, rb_node);
113 next = rb_next(node);
141 node = next;
168 struct rb_node *node; local
177 node = rb_first(root);
178 if (node && !rb_next(node)) {
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
| annotate.h | 56 struct list_head node; member in struct:disasm_line
87 struct rb_node node; member in struct:source_line
|
| callchain.c | 75 __sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node,
80 chain_for_each_child(child, node)
83 if (node->hit && node->hit >= min_hit)
84 rb_insert_callchain(rb_root, node, CHAIN_FLAT);
95 __sort_chain_flat(rb_root, &root->node, min_hit);
98 static void __sort_chain_graph_abs(struct callchain_node *node,
103 node->rb_root = RB_ROOT;
105 chain_for_each_child(child, node) {
108 rb_insert_callchain(&node->rb_root, child
331 struct callchain_cursor_node *node; local
443 struct callchain_cursor_node *node = *cursor->last; local
[all...] |
| callchain.h | 36 struct callchain_node node; member in struct:callchain_root
93 INIT_LIST_HEAD(&root->node.siblings);
94 INIT_LIST_HEAD(&root->node.children);
95 INIT_LIST_HEAD(&root->node.val);
97 root->node.parent = NULL;
98 root->node.hit = 0;
99 root->node.children_hit = 0;
103 static inline u64 callchain_cumul_hits(struct callchain_node *node)
105 return node->hit + node->children_hit
[all...] |
| dso.h | 74 struct list_head node; member in struct:dso
|
| evsel.h | 38 struct hlist_node node; member in struct:perf_sample_id
59 struct list_head node; member in struct:perf_evsel
265 return list_entry(evsel->node.next, struct perf_evsel, node);
317 for ((_evsel) = list_entry((_leader)->node.next, struct perf_evsel, node); \
319 (_evsel) = list_entry((_evsel)->node.next, struct perf_evsel, node))
|
| map.h | 30 struct list_head node; member in union:map::__anon28963
|
| /external/llvm/include/llvm/Support/ |
| Registry.h | 66 class node;
78 friend class node;
79 static node *Head, *Tail;
85 /// Node in linked list of entries.
87 class node { class in class:llvm::Registry
90 node *Next;
94 node(const entry& V) : Next(nullptr), Val(V) { function in class:llvm::Registry::node
109 const node *Cur;
112 explicit iterator(const node *N) : Cur(N) {}
199 node Node
[all...] |
| /external/ltrace/ |
| printf.c | 151 struct expr_node *node = NULL; local
156 struct expr_node node; member in struct:tmp
177 expr_init_const_word(&len->node, l, &len->type, 0);
179 node = build_zero_w_arg(&len->node, 1);
180 if (node == NULL)
185 node = expr_node_zero();
188 assert(node != NULL);
190 type_init_array(array, elt_info, 0, node, own_node);
|
| /external/lzma/CPP/Common/ |
| Wildcard.cpp | 358 const CCensorNode &node = fromNodes.SubNodes[i];
local
359 int subNodeIndex = FindSubNode(node.Name);
361 subNodeIndex = SubNodes.Add(CCensorNode(node.Name, this));
362 SubNodes[subNodeIndex].ExtendExclude(node);
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 41 reinterpret_cast<Node *>(it->get())->cut();
44 void Graph::insert(Node *node)
47 root = node;
49 node->graph = this;
87 Graph::Node::Node(void *priv) : data(priv),
95 void Graph::Node::attach(Node *node, Edge::Type kind
344 Node *node = reinterpret_cast<Node *>(it->get()); local
357 Graph::Node *node; local
[all...] |
| /external/mesa3d/src/glsl/ |
| list.h | 28 * Each doubly-linked list has a sentinel head and tail node. These nodes
37 * Instead of tracking two separate \c node structures and a \c list structure
39 * that each sentinel node always has one \c NULL pointer, the \c NULL
44 * head sentinel node.
46 * sentinel node and the \c next pointer of the tail sentinel node. This
49 * tail sentinel node.
83 void *node; local
85 node = ralloc_size(ctx, size);
86 assert(node != NULL)
273 exec_node *node; member in class:exec_list_iterator
292 void *node; local
[all...] |
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_fs_schedule_instructions.cpp | 45 * What we do is track a "current clock". When we schedule a node, we
163 * The @after node will be scheduled after @before. We will try to
211 * Sometimes we really want this node to execute after everything that
273 foreach_list(node, &instructions) {
274 schedule_node *n = (schedule_node *)node;
353 exec_node *node; local
355 for (node = instructions.get_tail(), prev = node->prev;
356 !node->is_head_sentinel();
357 node = prev, prev = node->prev)
[all...] |
| /external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/spdy/ |
| Huffman.java | 37 private final Node root = new Node();
95 Node node = root; local
104 node = node.children[c];
105 if (node.children == null) {
106 // terminal node
107 baos.write(node.symbol);
108 nbits -= node.terminalBits
[all...] |
| /external/opencv/cv/src/ |
| _cvkdtree.hpp | 68 struct node { struct in class:CvKDTree
71 int left, right; // node indices of left and right branches
74 typedef std::vector < node > node_array;
78 node_array nodes; // node storage
80 int root_node; // index of root node, -1 if empty tree
156 // insert given points into the tree; return created node
174 node & n = *nodes.insert(nodes.end(), node());
183 } else { // node
186 node & n = *nodes.insert(nodes.end(), node())
314 int node; \/\/ corresponding node member in struct:CvKDTree::bbf_node
[all...] |
