/external/linux-tools-perf/util/ui/browsers/ |
D | hists.c | 71 struct rb_node *nd; in callchain_node__count_rows_rb_tree() local 73 for (nd = rb_first(&self->rb_root); nd; nd = rb_next(nd)) { in callchain_node__count_rows_rb_tree() 74 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); in callchain_node__count_rows_rb_tree() 112 struct rb_node *nd; in callchain__count_rows() local 115 for (nd = rb_first(chain); nd; nd = rb_next(nd)) { in callchain__count_rows() 116 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__count_rows() 134 struct rb_node *nd = rb_first(&self->rb_root); in callchain_node__init_have_children_rb_tree() local 136 for (nd = rb_first(&self->rb_root); nd; nd = rb_next(nd)) { in callchain_node__init_have_children_rb_tree() 137 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); in callchain_node__init_have_children_rb_tree() 167 struct rb_node *nd; in callchain__init_have_children() local [all …]
|
D | annotate.c | 118 struct rb_node *nd) in annotate_browser__set_top() argument 126 rbpos = rb_entry(nd, struct objdump_line_rb_node, rb_node); in annotate_browser__set_top() 138 self->curr_hot = nd; in annotate_browser__set_top() 169 struct rb_node *nd = NULL; in annotate_browser__run() local 190 nd = self->curr_hot; in annotate_browser__run() 205 if (nd != NULL && RB_EMPTY_NODE(nd)) in annotate_browser__run() 206 nd = NULL; in annotate_browser__run() 219 if (nd != NULL) { in annotate_browser__run() 220 nd = rb_prev(nd); in annotate_browser__run() 221 if (nd == NULL) in annotate_browser__run() [all …]
|
D | map.c | 53 static void map_browser__write(struct ui_browser *self, void *nd, int row) in map_browser__write() argument 55 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map_browser__write() 138 struct rb_node *nd; in map__browse() local 142 for (nd = rb_first(mb.b.entries); nd; nd = rb_next(nd)) { in map__browse() 143 struct symbol *pos = rb_entry(nd, struct symbol, rb_node); in map__browse()
|
/external/bluetooth/glib/build/win32/dirent/ |
D | dirent.c | 63 _TDIR *nd; in _topendir() local 101 nd = (_TDIR *) malloc (sizeof (_TDIR) + (_tcslen(szFullPath) + _tcslen (SLASH) + in _topendir() 104 if (!nd) in _topendir() 112 _tcscpy (nd->dd_name, szFullPath); in _topendir() 115 if (nd->dd_name[0] != _T('\0') && in _topendir() 116 nd->dd_name[_tcslen (nd->dd_name) - 1] != _T('/') && in _topendir() 117 nd->dd_name[_tcslen (nd->dd_name) - 1] != _T('\\')) in _topendir() 119 _tcscat (nd->dd_name, SLASH); in _topendir() 123 _tcscat (nd->dd_name, SUFFIX); in _topendir() 127 nd->dd_handle = -1; in _topendir() [all …]
|
/external/llvm/include/llvm/CodeGen/PBQP/Heuristics/ |
D | Briggs.h | 138 NodeData &nd = getHeuristicNodeData(nItr); in addToHeuristicReduceList() local 140 nd.isHeuristic = true; in addToHeuristicReduceList() 141 if (nd.isAllocable) { in addToHeuristicReduceList() 142 nd.rnaItr = rnAllocableList.insert(rnAllocableList.end(), nItr); in addToHeuristicReduceList() 144 nd.rnuItr = rnUnallocableList.insert(rnUnallocableList.end(), nItr); in addToHeuristicReduceList() 261 NodeData &nd = getHeuristicNodeData(nItr); in handleRemoveEdge() local 265 if (!nd.isHeuristic) in handleRemoveEdge() 273 bool ndWasAllocable = nd.isAllocable; in handleRemoveEdge() 279 nd.isHeuristic = false; in handleRemoveEdge() 282 rnAllocableList.erase(nd.rnaItr); in handleRemoveEdge() [all …]
|
/external/valgrind/main/coregrind/ |
D | m_wordfm.c | 139 static UWord size_avl_nonNull ( AvlNode* nd ) in size_avl_nonNull() argument 141 return 1 + (nd->child[0] ? size_avl_nonNull(nd->child[0]) : 0) in size_avl_nonNull() 142 + (nd->child[1] ? size_avl_nonNull(nd->child[1]) : 0); in size_avl_nonNull() 502 AvlNode* avl_dopy ( AvlNode* nd, in avl_dopy() argument 509 if (! nd) in avl_dopy() 514 nyu->child[0] = nd->child[0]; in avl_dopy() 515 nyu->child[1] = nd->child[1]; in avl_dopy() 516 nyu->balance = nd->balance; in avl_dopy() 520 nyu->key = dopyK( nd->key ); in avl_dopy() 521 if (nd->key != 0 && nyu->key == 0) in avl_dopy() [all …]
|
D | m_sparsewa.c | 252 static void swa_deleteSWA_wrk ( void(*dealloc)(void*), void* nd ) in swa_deleteSWA_wrk() argument 255 vg_assert(nd); in swa_deleteSWA_wrk() 256 if (*(UWord*)nd == LevelN_MAGIC) { in swa_deleteSWA_wrk() 257 LevelN* levelN = (LevelN*)nd; in swa_deleteSWA_wrk() 264 vg_assert(*(UWord*)nd == Level0_MAGIC); in swa_deleteSWA_wrk() 266 dealloc(nd); in swa_deleteSWA_wrk() 435 static UWord swa_sizeSWA_wrk ( void* nd ) in swa_sizeSWA_wrk() argument 439 if (*(UWord*)nd == LevelN_MAGIC) { in swa_sizeSWA_wrk() 440 LevelN* levelN = (LevelN*)nd; in swa_sizeSWA_wrk() 448 vg_assert(*(UWord*)nd == Level0_MAGIC); in swa_sizeSWA_wrk() [all …]
|
/external/linux-tools-perf/util/ |
D | map.c | 82 struct rb_node *nd = rb_first(symbols); in map__fixup_start() local 83 if (nd != NULL) { in map__fixup_start() 84 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_start() 92 struct rb_node *nd = rb_last(symbols); in map__fixup_end() local 93 if (nd != NULL) { in map__fixup_end() 94 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_end() 310 struct rb_node *nd; in map_groups__find_symbol_by_name() local 312 for (nd = rb_first(&self->maps[type]); nd; nd = rb_next(nd)) { in map_groups__find_symbol_by_name() 313 struct map *pos = rb_entry(nd, struct map, rb_node); in map_groups__find_symbol_by_name() 330 struct rb_node *nd; in __map_groups__fprintf_maps() local [all …]
|
D | thread.c | 131 struct rb_node *nd; in perf_session__fprintf() local 133 for (nd = rb_first(&self->threads); nd; nd = rb_next(nd)) { in perf_session__fprintf() 134 struct thread *pos = rb_entry(nd, struct thread, rb_node); in perf_session__fprintf()
|
D | strlist.c | 190 struct rb_node *nd; in strlist__entry() local 192 for (nd = rb_first(&self->entries); nd; nd = rb_next(nd)) { in strlist__entry() 193 struct str_node *pos = rb_entry(nd, struct str_node, rb_node); in strlist__entry()
|
D | symbol.c | 95 struct rb_node *nd, *prevnd = rb_first(symbols); in symbols__fixup_end() local 103 for (nd = rb_next(prevnd); nd; nd = rb_next(nd)) { in symbols__fixup_end() 105 curr = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_end() 119 struct rb_node *nd, *prevnd = rb_first(&mg->maps[type]); in __map_groups__fixup_end() local 126 for (nd = rb_next(prevnd); nd; nd = rb_next(nd)) { in __map_groups__fixup_end() 128 curr = rb_entry(nd, struct map, rb_node); in __map_groups__fixup_end() 328 struct rb_node *nd; in symbols__sort_by_name() local 330 for (nd = rb_first(source); nd; nd = rb_next(nd)) { in symbols__sort_by_name() 331 struct symbol *pos = rb_entry(nd, struct symbol, rb_node); in symbols__sort_by_name() 410 struct rb_node *nd; in dso__fprintf_symbols_by_name() local [all …]
|
/external/linux-tools-perf/ |
D | builtin-annotate.c | 119 struct rb_node *nd = rb_first(&self->entries), *next; in hists__find_annotations() local 122 while (nd) { in hists__find_annotations() 123 struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node); in hists__find_annotations() 133 nd = rb_prev(nd); in hists__find_annotations() 135 nd = rb_next(nd); in hists__find_annotations() 143 next = rb_next(nd); in hists__find_annotations() 146 next = rb_prev(nd); in hists__find_annotations() 153 nd = next; in hists__find_annotations() 156 nd = rb_next(nd); in hists__find_annotations()
|
D | builtin-test.c | 28 struct rb_node *nd; in test__vmlinux_matches_kallsyms() local 122 for (nd = rb_first(&vmlinux_map->dso->symbols[type]); nd; nd = rb_next(nd)) { in test__vmlinux_matches_kallsyms() 126 sym = rb_entry(nd, struct symbol, rb_node); in test__vmlinux_matches_kallsyms() 186 for (nd = rb_first(&vmlinux.kmaps.maps[type]); nd; nd = rb_next(nd)) { in test__vmlinux_matches_kallsyms() 187 struct map *pos = rb_entry(nd, struct map, rb_node), *pair; in test__vmlinux_matches_kallsyms() 206 for (nd = rb_first(&vmlinux.kmaps.maps[type]); nd; nd = rb_next(nd)) { in test__vmlinux_matches_kallsyms() 207 struct map *pos = rb_entry(nd, struct map, rb_node), *pair; in test__vmlinux_matches_kallsyms() 227 for (nd = rb_first(&kallsyms.kmaps.maps[type]); in test__vmlinux_matches_kallsyms() 228 nd; nd = rb_next(nd)) { in test__vmlinux_matches_kallsyms() 229 struct map *pos = rb_entry(nd, struct map, rb_node); in test__vmlinux_matches_kallsyms()
|
D | builtin-diff.c | 135 struct rb_node *nd; in hists__match() local 137 for (nd = rb_first(&newer->entries); nd; nd = rb_next(nd)) { in hists__match() 138 struct hist_entry *pos = rb_entry(nd, struct hist_entry, rb_node); in hists__match()
|
/external/valgrind/main/exp-sgcheck/ |
D | sg_main.c | 486 StackTreeNode* nd = (StackTreeNode*)keyW; in pp_StackTree() local 487 VG_(printf)(" [%#lx,+%lu) descr=%p %s %lu\n", nd->addr, nd->szB, in pp_StackTree() 488 nd->descr, nd->descr->name, nd->descr->szB); in pp_StackTree() 579 StackTreeNode* nd = find_StackTreeNode(sitree, addr); in del_blocks_from_StackTree() local 582 tl_assert(nd); in del_blocks_from_StackTree() 583 b = VG_(delFromFM)( sitree, &oldK, &oldV, (UWord)nd ); in del_blocks_from_StackTree() 587 tl_assert(nd == (StackTreeNode*)oldK); in del_blocks_from_StackTree() 588 sg_free(nd); in del_blocks_from_StackTree() 594 StackTreeNode* nd = (StackTreeNode*)keyW; in delete_StackTree__kFin() local 595 tl_assert(nd); in delete_StackTree__kFin() [all …]
|
/external/linux-tools-perf/util/ui/ |
D | browser.c | 75 struct rb_node *nd; in ui_browser__rb_tree_seek() local 79 nd = rb_first(root); in ui_browser__rb_tree_seek() 82 nd = self->top; in ui_browser__rb_tree_seek() 85 nd = rb_last(root); in ui_browser__rb_tree_seek() 93 nd = rb_next(nd); in ui_browser__rb_tree_seek() 96 nd = rb_prev(nd); in ui_browser__rb_tree_seek() 99 self->top = nd; in ui_browser__rb_tree_seek() 104 struct rb_node *nd; in ui_browser__rb_tree_refresh() local 110 nd = self->top; in ui_browser__rb_tree_refresh() 112 while (nd != NULL) { in ui_browser__rb_tree_refresh() [all …]
|
/external/icu4c/data/locales/ |
D | dua.txt | 137 dn{"póndá"} 143 dn{"ndɔkɔ"} 149 dn{"píndí"} 182 "ŋgɔndɛ", 221 "ndúmbū nyá ɓosó", 222 "ndúmbū ní lóndɛ́ íɓaá", 223 "ndúmbū ní lóndɛ́ ílálo", 224 "ndúmbū ní lóndɛ́ ínɛ́y",
|
D | yav.txt | 40 "kisɛ́ndɛ", 134 dn{"kiɛmɛ́ɛm,kisɛ́ndɛ"} 182 "siɛyɛ́, oóli ú kándíɛ", 192 "pilɔndɔ́", 205 "ndátúɛ 1", 206 "ndátúɛ 2", 207 "ndátúɛ 3", 208 "ndátúɛ 4",
|
/external/dhcpcd/dhcpcd-hooks/ |
D | 50-ypbind | 24 local nd="$(best_domain)" 39 if [ $? = 0 -o "$nd" != "$(domainname)" ]; then 40 domainname "$nd" 50 local nd="$(best_domain)" 54 if [ -z "$nd" ]; then 58 elif [ "$nd" != "$(domainname)" ]; then 59 domainname "$nd"
|
/external/webkit/Source/WebCore/platform/graphics/gpu/ |
D | LoopBlinnClassifier.cpp | 69 FloatPoint3D nd(d1, d2, d3); in classify() local 70 nd.normalize(); in classify() 71 d1 = nd.x(); in classify() 72 d2 = nd.y(); in classify() 73 d3 = nd.z(); in classify()
|
/external/clang/test/SemaCXX/ |
D | cxx0x-deleted-default-ctor.cpp | 69 no_default nd; // expected-note {{field 'nd' has a deleted default constructor}} member 77 no_dtor nd; // expected-note {{field 'nd' has a deleted destructor}} member 111 no_default nd; // expected-note {{because field 'nd' has a deleted default constructor}} member 117 no_default nd; member
|
D | copy-assignment.cpp | 64 D d, nd; in test() local 91 nd = d; in test() 92 nd += d; in test() 93 nd += constD; in test()
|
/external/icu4c/data/zone/ |
D | nd.txt | 6 // * Source File:<path>/common/main/nd.xml 10 * ICU <specials> source: <path>/xml/main/nd.xml 12 nd{
|
/external/qemu/hw/ |
D | qdev.c | 273 void qdev_set_netdev(DeviceState *dev, NICInfo *nd) in qdev_set_netdev() argument 275 assert(!dev->nd); in qdev_set_netdev() 276 dev->nd = nd; in qdev_set_netdev() 377 NICInfo *nd = dev->nd; in qdev_get_vlan_client() local 378 assert(nd); in qdev_get_vlan_client() 379 return qemu_new_vlan_client(nd->vlan, nd->model, nd->name, can_receive, in qdev_get_vlan_client() 386 memcpy(macaddr, dev->nd->macaddr, 6); in qdev_get_macaddr()
|
/external/jmonkeyengine/engine/src/core-effects/Common/MatDefs/Post/ |
D | CartoonEdge.frag | 21 vec4 nd; 22 nd.xyz = texture2D(m_NormalsTexture, tc).rgb; 23 nd.w = texture2D(m_DepthTexture, tc).r; 24 return nd;
|