Searched refs:nd (Results 1 - 25 of 86) sorted by relevance

1234

/external/fio/engines/
H A Dnull.c28 struct null_data *nd = (struct null_data *) td->io_ops->data; local
30 return nd->io_us[event];
37 struct null_data *nd = (struct null_data *) td->io_ops->data; local
41 ret = nd->events;
42 nd->events = 0;
50 struct null_data *nd = (struct null_data *) td->io_ops->data; local
52 if (!nd->events) {
54 io_u_mark_submit(td, nd->queued);
56 nd->events = nd
65 struct null_data *nd = (struct null_data *) td->io_ops->data; local
86 struct null_data *nd = (struct null_data *) td->io_ops->data; local
97 struct null_data *nd = (struct null_data *) malloc(sizeof(*nd)); local
[all...]
H A Dnet.c376 struct netio_data *nd = td->io_ops->data; local
378 return splice_io_u(io_u->file->fd, nd->pipes[1], io_u->xfer_buflen);
387 struct netio_data *nd = td->io_ops->data; local
389 return splice_io_u(nd->pipes[0], io_u->file->fd, len);
425 struct netio_data *nd = td->io_ops->data; local
427 return vmsplice_io_u(io_u, nd->pipes[0], len);
435 struct netio_data *nd = td->io_ops->data; local
437 return vmsplice_io_u(io_u, nd->pipes[1], io_u->xfer_buflen);
483 static void store_udp_seq(struct netio_data *nd, struct io_u *io_u) argument
493 us->seq = cpu_to_le64(nd
496 verify_udp_seq(struct thread_data *td, struct netio_data *nd, struct io_u *io_u) argument
526 struct netio_data *nd = td->io_ops->data; local
589 struct netio_data *nd = td->io_ops->data; local
647 struct netio_data *nd = td->io_ops->data; local
713 struct netio_data *nd = td->io_ops->data; local
828 struct netio_data *nd = td->io_ops->data; local
880 struct netio_data *nd = td->io_ops->data; local
915 struct netio_data *nd = td->io_ops->data; local
949 struct netio_data *nd = td->io_ops->data; local
1051 struct netio_data *nd = td->io_ops->data; local
1101 struct netio_data *nd = td->io_ops->data; local
1122 struct netio_data *nd = td->io_ops->data; local
1155 struct netio_data *nd = td->io_ops->data; local
1271 struct netio_data *nd = td->io_ops->data; local
1346 struct netio_data *nd = td->io_ops->data; local
1362 struct netio_data *nd; local
1390 struct netio_data *nd; local
[all...]
/external/linux-tools-perf/src/tools/perf/tests/
H A Dvmlinux-kallsyms.c24 struct rb_node *nd; local
120 for (nd = rb_first(&vmlinux_map->dso->symbols[type]); nd; nd = rb_next(nd)) {
124 sym = rb_entry(nd, struct symbol, rb_node);
197 for (nd = rb_first(&vmlinux.kmaps.maps[type]); nd; nd = rb_next(nd)) {
[all...]
/external/linux-tools-perf/src/tools/perf/ui/browsers/
H A Dmap.c21 static void map_browser__write(struct ui_browser *self, void *nd, int row) argument
23 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
112 struct rb_node *nd; local
116 for (nd = rb_first(mb.b.entries); nd; nd = rb_next(nd)) {
117 struct symbol *pos = rb_entry(nd, struct symbol, rb_node);
H A Dhists.c79 struct rb_node *nd; local
81 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
82 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
120 struct rb_node *nd; local
123 for (nd = rb_first(chain); nd; nd
145 struct rb_node *nd = rb_first(&node->rb_root); local
178 struct rb_node *nd; local
220 struct rb_node *nd; local
260 struct rb_node *nd; local
285 struct rb_node *nd; local
568 struct rb_node *nd; local
807 struct rb_node *nd; local
831 hists__filter_entries(struct rb_node *nd, struct hists *hists, float min_pcnt) argument
852 hists__filter_prev_entries(struct rb_node *nd, struct hists *hists, float min_pcnt) argument
874 struct rb_node *nd; local
1095 struct rb_node *nd; local
1142 struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries), local
1374 struct rb_node *nd = rb_first(&hb->hists->entries); local
[all...]
H A Dannotate.c322 struct rb_node *nd)
328 bpos = rb_entry(nd, struct browser_disasm_line, rb_node);
334 browser->curr_hot = nd;
660 struct rb_node *nd = NULL; local
679 nd = browser->curr_hot;
691 if (nd != NULL && RB_EMPTY_NODE(nd))
692 nd = NULL;
704 if (nd != NULL) {
705 nd
321 annotate_browser__set_rb_top(struct annotate_browser *browser, struct rb_node *nd) argument
[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; // expected-note {{because field 'nd' has a deleted default constructor}} member in struct:late_delete
/external/linux-tools-perf/src/tools/perf/
H A Dbuiltin-annotate.c123 struct rb_node *nd = rb_first(&self->entries), *next; local
126 while (nd) {
127 struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node);
137 nd = rb_prev(nd);
139 nd = rb_next(nd);
151 nd = rb_next(nd);
160 next = rb_next(nd);
[all...]
/external/valgrind/coregrind/
H A Dm_wordfm.c139 static UWord size_avl_nonNull ( const AvlNode* nd )
141 return 1 + (nd->child[0] ? size_avl_nonNull(nd->child[0]) : 0)
142 + (nd->child[1] ? size_avl_nonNull(nd->child[1]) : 0);
502 AvlNode* avl_dopy ( const AvlNode* nd, argument
510 vg_assert(nd != NULL);
514 nyu->child[0] = nd->child[0];
515 nyu->child[1] = nd->child[1];
516 nyu->balance = nd
581 avl_free( AvlNode* nd, void(*kFin)(UWord), void(*vFin)(UWord), void(*dealloc)(void*) ) argument
927 AvlNode* nd; local
941 AvlNode* nd = bag->fm->root; local
[all...]
H A Dm_sparsewa.c252 static void swa_deleteSWA_wrk ( void(*dealloc)(void*), void* nd )
255 vg_assert(nd);
256 if (*(UWord*)nd == LevelN_MAGIC) {
257 LevelN* levelN = (LevelN*)nd;
264 vg_assert(*(UWord*)nd == Level0_MAGIC);
266 dealloc(nd);
433 static UWord swa_sizeSWA_wrk ( const void* nd )
436 if (*(const UWord*)nd == LevelN_MAGIC) {
438 const LevelN* levelN = nd;
447 vg_assert(*(const UWord*)nd
[all...]
/external/linux-tools-perf/src/tools/perf/util/
H A Dmap.c132 struct rb_node *nd = rb_first(symbols); local
133 if (nd != NULL) {
134 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
142 struct rb_node *nd = rb_last(symbols); local
143 if (nd != NULL) {
144 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
358 struct rb_node *nd; local
360 for (nd = rb_first(&mg->maps[type]); nd; nd
378 struct rb_node *nd; local
509 struct rb_node *nd; local
[all...]
H A Dhist.c779 struct rb_node *nd; local
785 for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
786 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
812 struct rb_node *nd; local
818 for (nd = rb_first(&hists->entries); nd; nd
843 struct rb_node *nd; local
955 struct rb_node *nd; local
980 struct rb_node *nd; local
[all...]
H A Dsymbol.c143 struct rb_node *nd; local
146 nd = rb_first(symbols);
148 while (nd) {
149 curr = rb_entry(nd, struct symbol, rb_node);
151 nd = rb_next(&curr->rb_node);
152 next = rb_entry(nd, struct symbol, rb_node);
154 if (!nd)
164 nd = rb_next(&curr->rb_node);
172 struct rb_node *nd, *prevnd = rb_first(symbols); local
180 for (nd
196 struct rb_node *nd, *prevnd = rb_first(&mg->maps[type]); local
371 struct rb_node *nd; local
435 struct rb_node *nd; local
1110 struct rb_node *nd; local
[all...]
H A Dmachine.c71 struct rb_node *nd = rb_first(&machine->threads); local
73 while (nd) {
74 struct thread *t = rb_entry(nd, struct thread, rb_node);
77 nd = rb_next(nd);
145 struct rb_node *nd; local
150 for (nd = rb_first(&machines->guests); nd; nd = rb_next(nd)) {
220 struct rb_node *nd; local
365 struct rb_node *nd; local
388 struct rb_node *nd; local
420 struct rb_node *nd; local
[all...]
/external/valgrind/exp-sgcheck/
H A Dsg_main.c485 StackTreeNode* nd = (StackTreeNode*)keyW; local
486 VG_(printf)(" [%#lx,+%lu) descr=%p %s %lu\n", nd->addr, nd->szB,
487 nd->descr, nd->descr->name, nd->descr->szB);
578 StackTreeNode* nd = find_StackTreeNode(sitree, addr); local
581 tl_assert(nd);
582 b = VG_(delFromFM)( sitree, &oldK, &oldV, (UWord)nd );
586 tl_assert(nd
593 StackTreeNode* nd = (StackTreeNode*)keyW; local
642 GlobalTreeNode* nd; local
689 GlobalTreeNode *nyu, *nd; local
766 GlobalTreeNode key, *nd; local
829 StackTreeNode* nd; member in struct:__anon16288::__anon16289::__anon16293
834 GlobalTreeNode* nd; member in struct:__anon16288::__anon16289::__anon16294
1144 GlobalTreeNode* nd = (GlobalTreeNode*)keyW; local
1570 { StackTreeNode* nd = find_StackTreeNode( siTrees[tid], ea ); local
1586 { GlobalTreeNode* nd = find_GlobalTreeNode(giTree, ea); local
[all...]
/external/linux-tools-perf/src/tools/perf/ui/gtk/
H A Dhists.c138 struct rb_node *nd; local
141 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
149 node = rb_entry(nd, struct callchain_node, rb_node);
209 struct rb_node *nd; local
280 for (nd = rb_first(&hists->entries); nd; nd
[all...]
/external/linux-tools-perf/src/tools/perf/ui/
H A Dbrowser.c113 struct rb_node *nd; local
117 nd = rb_first(root);
120 nd = browser->top;
123 nd = rb_last(root);
131 nd = rb_next(nd);
134 nd = rb_prev(nd);
137 browser->top = nd;
142 struct rb_node *nd; local
[all...]
/external/valgrind/cachegrind/
H A Dcg_merge.c1052 static Word size_avl_nonNull ( AvlNode* nd )
1054 return 1 + (nd->left ? size_avl_nonNull(nd->left) : 0)
1055 + (nd->right ? size_avl_nonNull(nd->right) : 0);
1344 AvlNode* avl_dopy ( AvlNode* nd, argument
1350 if (! nd)
1355 nyu->left = nd->left;
1356 nyu->right = nd->right;
1357 nyu->balance = nd
1420 avl_free( AvlNode* nd, void(*kFin)(Word), void(*vFin)(Word), void(*dealloc)(void*) ) argument
[all...]
/external/openfst/src/include/fst/
H A Dshortest-distance.h199 Weight &nd = (*distance_)[arc.nextstate]; local
202 if (!ApproxEqual(nd, Plus(nd, w), delta_)) {
203 nd = Plus(nd, w);
205 if (!nd.Member() || !nr.Member()) {
/external/linux-tools-perf/src/tools/perf/ui/stdio/
H A Dhist.c380 struct rb_node *nd; local
490 for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
491 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
/external/llvm/test/MC/Mips/
H A Dsort-relocation-table.s36 # Match HI with 2nd LO because it has higher offset (than the 1st LO).
55 # Match 2nd HI with 2nd LO, since it's the one with highest offset among the
/external/sonivox/arm-hybrid-22k/lib_src/
H A DARM-E_mastergain_gnu.s75 LDR r5, [pnInputBuffer], #4 @fetch 2nd output sample
92 STRH r5, [pnOutputBuffer], #NEXT_OUTPUT_PCM @save 2nd output sample
/external/sonivox/arm-wt-22k/lib_src/
H A DARM-E_mastergain_gnu.s75 LDR r5, [pnInputBuffer], #4 @fetch 2nd output sample
92 STRH r5, [pnOutputBuffer], #NEXT_OUTPUT_PCM @save 2nd output sample
/external/libcxx/src/
H A Ddebug.cpp548 for (__i_node* nd = __ibeg_[h]; nd != nullptr; nd = nd->__next_)
550 if (nd->__i_ == __i)
552 r = nd;

Completed in 687 milliseconds

1234