Searched defs:nd (Results 1 - 25 of 51) sorted by relevance

123

/external/linux-tools-perf/util/
H A Dthread.c131 struct rb_node *nd; local
133 for (nd = rb_first(&self->threads); nd; nd = rb_next(nd)) {
134 struct thread *pos = rb_entry(nd, struct thread, rb_node);
H A Dstrlist.c190 struct rb_node *nd; local
192 for (nd = rb_first(&self->entries); nd; nd = rb_next(nd)) {
193 struct str_node *pos = rb_entry(nd, struct str_node, rb_node);
H A Dtop.c216 struct rb_node *nd; local
221 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
222 struct sym_entry *syme = rb_entry(nd, struct sym_entry, rb_node);
H A Devent.c228 struct rb_node *nd; local
249 for (nd = rb_first(&kmaps->maps[MAP__FUNCTION]);
250 nd; nd = rb_next(nd)) {
252 struct map *pos = rb_entry(nd, struct map, rb_node);
H A Dmap.c82 struct rb_node *nd = rb_first(symbols); local
83 if (nd != NULL) {
84 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
92 struct rb_node *nd = rb_last(symbols); local
93 if (nd != NULL) {
94 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
310 struct rb_node *nd; local
312 for (nd = rb_first(&self->maps[type]); nd; nd
330 struct rb_node *nd; local
461 struct rb_node *nd; local
665 struct rb_node *nd; local
[all...]
/external/clang/test/SemaCXX/
H A Dcopy-assignment.cpp64 D d, nd; local
91 nd = d;
92 nd += d;
93 nd += constD;
H A Dcxx0x-deleted-default-ctor.cpp69 no_default nd; // expected-note {{field 'nd' has a deleted default constructor}} member in struct:bad_field_default
77 no_dtor nd; // expected-note {{field 'nd' has a deleted destructor}} member in struct:bad_field_dtor
111 no_default nd; // expected-note {{because field 'nd' has a deleted default constructor}} member in struct:defaulted_delete
117 no_default nd; member in struct:late_delete
/external/linux-tools-perf/
H A Dbuiltin-annotate.c119 struct rb_node *nd = rb_first(&self->entries), *next; local
122 while (nd) {
123 struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node);
133 nd = rb_prev(nd);
135 nd = rb_next(nd);
143 next = rb_next(nd);
146 next = rb_prev(nd);
153 nd
[all...]
H A Dbuiltin-diff.c135 struct rb_node *nd; local
137 for (nd = rb_first(&newer->entries); nd; nd = rb_next(nd)) {
138 struct hist_entry *pos = rb_entry(nd, struct hist_entry, rb_node);
H A Dbuiltin-test.c28 struct rb_node *nd; local
122 for (nd = rb_first(&vmlinux_map->dso->symbols[type]); nd; nd = rb_next(nd)) {
126 sym = rb_entry(nd, struct symbol, rb_node);
186 for (nd = rb_first(&vmlinux.kmaps.maps[type]); nd; nd = rb_next(nd)) {
[all...]
H A Dbuiltin-top.c281 struct rb_node *nd; local
333 for (nd = rb_first(&tmp); nd; nd = rb_next(nd)) {
337 syme = rb_entry(nd, struct sym_entry, rb_node);
/external/linux-tools-perf/util/ui/browsers/
H A Dmap.c53 static void map_browser__write(struct ui_browser *self, void *nd, int row) argument
55 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
138 struct rb_node *nd; local
142 for (nd = rb_first(mb.b.entries); nd; nd = rb_next(nd)) {
143 struct symbol *pos = rb_entry(nd, struct symbol, rb_node);
H A Dannotate.c118 struct rb_node *nd)
126 rbpos = rb_entry(nd, struct objdump_line_rb_node, rb_node);
138 self->curr_hot = nd;
169 struct rb_node *nd = NULL; local
190 nd = self->curr_hot;
205 if (nd != NULL && RB_EMPTY_NODE(nd))
206 nd = NULL;
219 if (nd != NULL) {
220 nd
117 annotate_browser__set_top(struct annotate_browser *self, struct rb_node *nd) argument
[all...]
/external/qemu/hw/
H A Dqdev.h24 NICInfo *nd; member in struct:DeviceState
54 void qdev_set_netdev(DeviceState *dev, NICInfo *nd);
H A Dqdev.c273 void qdev_set_netdev(DeviceState *dev, NICInfo *nd) argument
275 assert(!dev->nd);
276 dev->nd = nd;
377 NICInfo *nd = dev->nd; local
378 assert(nd);
379 return qemu_new_vlan_client(nd->vlan, nd->model, nd
[all...]
/external/linux-tools-perf/util/ui/
H A Dbrowser.c75 struct rb_node *nd; local
79 nd = rb_first(root);
82 nd = self->top;
85 nd = rb_last(root);
93 nd = rb_next(nd);
96 nd = rb_prev(nd);
99 self->top = nd;
104 struct rb_node *nd; local
[all...]
/external/openfst/src/include/fst/
H A Dshortest-distance.h198 Weight &nd = (*distance_)[arc.nextstate]; local
201 if (!ApproxEqual(nd, Plus(nd, w), delta_)) {
202 nd = Plus(nd, w);
204 if (!nd.Member() || !nr.Member()) {
H A Dshortest-path.h166 Weight &nd = (*distance)[arc.nextstate]; local
168 if (nd != Plus(nd, w)) {
169 nd = Plus(nd, w);
170 if (!nd.Member()) {
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dshortest-distance.h162 Weight &nd = (*distance_)[arc.nextstate]; local
165 if (!ApproxEqual(nd, Plus(nd, w), delta_)) {
166 nd = Plus(nd, w);
H A Dshortest-path.h123 Weight &nd = (*distance)[arc.nextstate]; local
125 if (nd != Plus(nd, w)) {
126 nd = Plus(nd, w);
/external/ipsec-tools/src/racoon/
H A Disakmp_inf.c137 struct isakmp_gen *nd;
196 if (msg->l < sizeof(*isakmp) + ntohs(gen->len) + sizeof(*nd)) {
204 nd = (struct isakmp_gen *) ((caddr_t) gen + ntohs(gen->len));
206 /* nd length check */
207 if (ntohs(nd->len) > msg->l - (sizeof(struct isakmp) +
214 if (ntohs(nd->len) < sizeof(*nd)) {
220 payload = vmalloc(ntohs(nd->len));
227 memcpy(payload->v, (caddr_t) nd, ntohs(nd
136 struct isakmp_gen *nd; local
[all...]
/external/kernel-headers/original/linux/
H A Dmempolicy.h125 struct rb_node nd; member in struct:sp_node
/external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
H A DBriggs.h138 NodeData &nd = getHeuristicNodeData(nItr); local
140 nd.isHeuristic = true;
141 if (nd.isAllocable) {
142 nd.rnaItr = rnAllocableList.insert(rnAllocableList.end(), nItr);
144 nd.rnuItr = rnUnallocableList.insert(rnUnallocableList.end(), nItr);
261 NodeData &nd = getHeuristicNodeData(nItr); local
265 if (!nd.isHeuristic)
273 bool ndWasAllocable = nd.isAllocable;
279 nd.isHeuristic = false;
282 rnAllocableList.erase(nd
361 NodeData &nd = getHeuristicNodeData(nItr); local
388 NodeData &nd = getHeuristicNodeData(nItr); local
407 NodeData &nd = getHeuristicNodeData(nItr); local
413 NodeData &nd = getHeuristicNodeData(nItr); local
[all...]
/external/dhcpcd/
H A Dipv6rs.c169 struct nd_opt_hdr *nd; local
181 nd = (struct nd_opt_hdr *)(ifp->rs + sizeof(*rs));
182 nd->nd_opt_type = ND_OPT_SOURCE_LINKADDR;
183 nd->nd_opt_len = (ROUNDUP8(ifp->hwlen + 2)) >> 3;
184 memcpy(nd + 1, ifp->hwaddr, ifp->hwlen);
/external/fsck_msdos/
H A Ddir.c280 struct dosDirEntry *d, *nd; local
287 for (d = rootDir; d; d = nd) {
288 if ((nd = d->child) != NULL) {
292 if (!(nd = d->next))
293 nd = d->parent;

Completed in 462 milliseconds

123