/external/linux-tools-perf/util/ui/browsers/ |
hists.c | 71 struct rb_node *nd; local 73 for (nd = rb_first(&self->rb_root); nd; nd = rb_next(nd)) { 74 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); 112 struct rb_node *nd; local 115 for (nd = rb_first(chain); nd; nd = rb_next(nd)) 134 struct rb_node *nd = rb_first(&self->rb_root); local 167 struct rb_node *nd; local 209 struct rb_node *nd; local 249 struct rb_node *nd; local 274 struct rb_node *nd; local 512 struct rb_node *nd; local 591 struct rb_node *nd; local 641 struct rb_node *nd; local [all...] |
annotate.c | 118 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 = rb_prev(nd) [all...] |
map.c | 53 static void map_browser__write(struct ui_browser *self, void *nd, int row) 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);
|
/external/llvm/include/llvm/CodeGen/PBQP/Heuristics/ |
Briggs.h | 137 NodeData &nd = getHeuristicNodeData(nItr); local 139 nd.isHeuristic = true; 140 if (nd.isAllocable) { 141 nd.rnaItr = rnAllocableList.insert(rnAllocableList.end(), nItr); 143 nd.rnuItr = rnUnallocableList.insert(rnUnallocableList.end(), nItr); 260 NodeData &nd = getHeuristicNodeData(nItr); local 264 if (!nd.isHeuristic) 272 bool ndWasAllocable = nd.isAllocable; 278 nd.isHeuristic = false; 281 rnAllocableList.erase(nd.rnaItr) 360 NodeData &nd = getHeuristicNodeData(nItr); local 387 NodeData &nd = getHeuristicNodeData(nItr); local 406 NodeData &nd = getHeuristicNodeData(nItr); local 412 NodeData &nd = getHeuristicNodeData(nItr); local [all...] |
/external/clang/test/SemaCXX/ |
copy-assignment.cpp | 64 D d, nd; local 91 nd = d; 92 nd += d; 93 nd += constD;
|
cxx0x-deleted-default-ctor.cpp | 69 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/qemu/hw/ |
mips.h | 18 void mipsnet_init(int base, qemu_irq irq, NICInfo *nd); 39 void dp83932_init(NICInfo *nd, target_phys_addr_t base, int it_shift,
|
qdev.c | 273 void qdev_set_netdev(DeviceState *dev, NICInfo *nd) 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->name, can_receive [all...] |
/external/linux-tools-perf/ |
builtin-annotate.c | 119 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 = next [all...] |
builtin-test.c | 28 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...] |
builtin-diff.c | 135 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);
|
/external/linux-tools-perf/util/ |
map.c | 82 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 = rb_next(nd)) 330 struct rb_node *nd; local 461 struct rb_node *nd; local 665 struct rb_node *nd; local [all...] |
strlist.c | 190 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);
|
thread.c | 131 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);
|
top.c | 216 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);
|
symbol.c | 95 struct rb_node *nd, *prevnd = rb_first(symbols); local 103 for (nd = rb_next(prevnd); nd; nd = rb_next(nd)) { 105 curr = rb_entry(nd, struct symbol, rb_node); 119 struct rb_node *nd, *prevnd = rb_first(&mg->maps[type]); local 126 for (nd = rb_next(prevnd); nd; nd = rb_next(nd)) 328 struct rb_node *nd; local 410 struct rb_node *nd; local 423 struct rb_node *nd; local 1623 struct rb_node *nd; local 2134 struct rb_node *nd; local 2171 struct rb_node *nd; local [all...] |
/external/linux-tools-perf/util/ui/ |
browser.c | 75 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/valgrind/main/coregrind/ |
m_wordfm.c | 139 static UWord size_avl_nonNull ( 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 ( AvlNode* nd, 509 if (! nd) 514 nyu->child[0] = nd->child[0]; 515 nyu->child[1] = nd->child[1]; 516 nyu->balance = nd->balance 942 AvlNode* nd; local 956 AvlNode* nd = bag->fm->root; local [all...] |
m_sparsewa.c | 252 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); 435 static UWord swa_sizeSWA_wrk ( void* nd ) 438 if (*(UWord*)nd == LevelN_MAGIC) { 440 LevelN* levelN = (LevelN*)nd; 449 vg_assert(*(UWord*)nd == Level0_MAGIC) [all...] |
/external/valgrind/main/exp-sgcheck/ |
sg_main.c | 486 StackTreeNode* nd = (StackTreeNode*)keyW; local 487 VG_(printf)(" [%#lx,+%lu) descr=%p %s %lu\n", nd->addr, nd->szB, 488 nd->descr, nd->descr->name, nd->descr->szB); 579 StackTreeNode* nd = find_StackTreeNode(sitree, addr); local 582 tl_assert(nd); 583 b = VG_(delFromFM)( sitree, &oldK, &oldV, (UWord)nd ); 587 tl_assert(nd == (StackTreeNode*)oldK) 594 StackTreeNode* nd = (StackTreeNode*)keyW; local 643 GlobalTreeNode* nd; local 690 GlobalTreeNode *nyu, *nd; local 767 GlobalTreeNode key, *nd; local 830 StackTreeNode* nd; member in struct:__anon28083::__anon28084::__anon28088 835 GlobalTreeNode* nd; member in struct:__anon28083::__anon28084::__anon28089 1138 GlobalTreeNode* nd = (GlobalTreeNode*)keyW; local 1562 { StackTreeNode* nd = find_StackTreeNode( siTrees[tid], ea ); local 1578 { GlobalTreeNode* nd = find_GlobalTreeNode(giTree, ea); local [all...] |
/external/chromium_org/third_party/npapi/npspy/extern/nspr/private/ |
pprio.h | 170 NSPR_API(PRInt32) PR_EmulateAcceptRead(PRFileDesc *sd, PRFileDesc **nd, 190 NSPR_API(PRInt32) PR_NTFast_AcceptRead(PRFileDesc *sd, PRFileDesc **nd, 211 PRFileDesc **nd,
|
/external/chromium_org/v8/test/webkit/ |
avl-crash.js | 41 "242nd St", 47 "2nd Ave-Houston St", 62 "42nd St-5th Ave-6th Ave", 63 "42nd St-5th Ave-6th Ave", 92 "Bay Pkwy-22nd Ave",
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
shortest-distance.h | 162 Weight &nd = (*distance_)[arc.nextstate]; local 165 if (!ApproxEqual(nd, Plus(nd, w), delta_)) { 166 nd = Plus(nd, w);
|
/external/valgrind/main/cachegrind/ |
cg_merge.c | 1041 static Word size_avl_nonNull ( AvlNode* nd ) 1043 return 1 + (nd->left ? size_avl_nonNull(nd->left) : 0) 1044 + (nd->right ? size_avl_nonNull(nd->right) : 0); [all...] |
/external/qemu/ |
net.h | 74 void qemu_check_nic_model(NICInfo *nd, const char *model); 75 void qemu_check_nic_model_list(NICInfo *nd, const char * const *models, 121 void net_client_uninit(NICInfo *nd);
|