Home
last modified time | relevance | path

Searched refs:dfs (Results 1 – 25 of 32) sorted by relevance

12

/netbsd-src/external/gpl3/gcc/dist/libgcc/soft-fp/
H A Dop-common.h1880 #define _FP_EXTEND_CNAN(dfs, sfs, dwc, swc, D, S, check_nan) \ argument
1883 _FP_STATIC_ASSERT (_FP_FRACBITS_##dfs >= _FP_FRACBITS_##sfs, \
1885 _FP_STATIC_ASSERT ((_FP_EXPMAX_##dfs - _FP_EXPBIAS_##dfs \
1889 _FP_STATIC_ASSERT (((_FP_EXPBIAS_##dfs \
1892 || (_FP_EXPBIAS_##dfs == _FP_EXPBIAS_##sfs)), \
1899 D##_e = S##_e + _FP_EXPBIAS_##dfs - _FP_EXPBIAS_##sfs; \
1900 _FP_FRAC_SLL_##dwc (D, (_FP_FRACBITS_##dfs - _FP_FRACBITS_##sfs)); \
1909 else if (_FP_EXPBIAS_##dfs \
1913 _FP_FRAC_SLL_##dwc (D, (_FP_FRACBITS_##dfs \
1925 FP_EXTEND_lz + _FP_FRACBITS_##dfs \
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libgcc/soft-fp/
H A Dop-common.h1880 #define _FP_EXTEND_CNAN(dfs, sfs, dwc, swc, D, S, check_nan) \ argument
1883 _FP_STATIC_ASSERT (_FP_FRACBITS_##dfs >= _FP_FRACBITS_##sfs, \
1885 _FP_STATIC_ASSERT ((_FP_EXPMAX_##dfs - _FP_EXPBIAS_##dfs \
1889 _FP_STATIC_ASSERT (((_FP_EXPBIAS_##dfs \
1892 || (_FP_EXPBIAS_##dfs == _FP_EXPBIAS_##sfs)), \
1899 D##_e = S##_e + _FP_EXPBIAS_##dfs - _FP_EXPBIAS_##sfs; \
1900 _FP_FRAC_SLL_##dwc (D, (_FP_FRACBITS_##dfs - _FP_FRACBITS_##sfs)); \
1909 else if (_FP_EXPBIAS_##dfs \
1913 _FP_FRAC_SLL_##dwc (D, (_FP_FRACBITS_##dfs \
1925 FP_EXTEND_lz + _FP_FRACBITS_##dfs \
[all …]
/netbsd-src/sys/external/bsd/drm2/dist/drm/i915/
H A Di915_buddy.c356 struct list_head dfs = LIST_HEAD_INIT(dfs); in i915_buddy_alloc_range() local
371 list_add_tail(&mm->roots[i]->tmp_link, &dfs); in i915_buddy_alloc_range()
379 block = list_first_entry_or_null(&dfs, in i915_buddy_alloc_range()
415 list_add(&block->right->tmp_link, &dfs); in i915_buddy_alloc_range()
416 list_add(&block->left->tmp_link, &dfs); in i915_buddy_alloc_range()
H A Di915_scheduler.c314 LIST_HEAD(dfs); in __i915_schedule()
327 list_add(&stack.dfs_link, &dfs); in __i915_schedule()
347 list_for_each_entry(dep, &dfs, dfs_link) { in __i915_schedule()
367 list_move_tail(&p->dfs_link, &dfs); in __i915_schedule()
393 list_for_each_entry_safe_reverse(dep, p, &dfs, dfs_link) { in __i915_schedule()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DImportedFunctionsInliningStatistics.cpp183 dfs(Node); in calculateRealInlines()
187 void ImportedFunctionsInliningStatistics::dfs(InlineGraphNode &GraphNode) { in dfs() function in ImportedFunctionsInliningStatistics
193 dfs(*InlinedFunctionNode); in dfs()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dtree-into-ssa.cc1068 insert_phi_nodes (bitmap_head *dfs) in insert_phi_nodes() argument
1138 bitmap idf = compute_idf (info->info.def_blocks.def_blocks, dfs); in insert_phi_nodes()
2434 bitmap_head *dfs; in execute() local
2455 dfs = XNEWVEC (bitmap_head, last_basic_block_for_fn (fun)); in execute()
2457 bitmap_initialize (&dfs[bb->index], &bitmap_default_obstack); in execute()
2461 compute_dominance_frontiers (dfs); in execute()
2467 insert_phi_nodes (dfs); in execute()
2474 bitmap_clear (&dfs[bb->index]); in execute()
2475 free (dfs); in execute()
3150 insert_updated_phi_nodes_for (tree var, bitmap_head *dfs, bitmap blocks, in insert_updated_phi_nodes_for() argument
[all …]
H A Dcfganal.cc630 depth_first_search dfs; in connect_infinite_loops_to_exit() local
631 dfs.add_bb (EXIT_BLOCK_PTR_FOR_FN (cfun)); in connect_infinite_loops_to_exit()
637 unvisited_block = dfs.execute (unvisited_block); in connect_infinite_loops_to_exit()
645 dfs.add_bb (deadend_block); in connect_infinite_loops_to_exit()
1677 compute_idf (bitmap def_blocks, bitmap_head *dfs) in compute_idf() argument
1712 EXECUTE_IF_AND_COMPL_IN_BITMAP (&dfs[bb_index], phi_insertion_points, in compute_idf()
H A Dtree-ssa-structalias.cc1433 unsigned int *dfs; member in scc_info
1459 si->dfs[n] = si->current_index ++; in scc_visit()
1460 my_dfs = si->dfs[n]; in scc_visit()
1479 if (si->dfs[t] < si->dfs[n]) in scc_visit()
1480 si->dfs[n] = si->dfs[t]; in scc_visit()
1484 if (si->dfs[n] == my_dfs) in scc_visit()
1487 && si->dfs[si->scc_stack.last ()] >= my_dfs) in scc_visit()
1496 && si->dfs[si->scc_stack.last ()] >= my_dfs) in scc_visit()
1824 dfs = XCNEWVEC (unsigned int, size); in scc_info()
1835 free (dfs); in ~scc_info()
[all …]
H A Dipa-inline.cc1980 struct ipa_dfs_info *dfs = (struct ipa_dfs_info *) node->aux; in inline_small_functions() local
1993 if (dfs && dfs->next_cycle) in inline_small_functions()
1996 int id = dfs->scc_no + 1; in inline_small_functions()
H A Dipa-cp.cc201 int dfs = 0; member in ipcp_value
3737 if (cur_val->dfs) in add_val()
3741 cur_val->dfs = dfs_counter; in add_val()
3751 if (src->val->dfs == 0) in add_val()
3758 && src->val->dfs < cur_val->low_link) in add_val()
3759 cur_val->low_link = src->val->dfs; in add_val()
3762 if (cur_val->dfs == cur_val->low_link) in add_val()
3771 v->scc_no = cur_val->dfs; in add_val()
H A Dtree-vect-slp.cc7591 int dfs; member
7605 info->dfs = maxdfs; in vect_schedule_scc()
7637 info->lowlink = MIN (info->lowlink, child_info->dfs); in vect_schedule_scc()
7639 if (info->lowlink != info->dfs) in vect_schedule_scc()
H A Dconfig.gcc5092 abi_pattern="lp64[dfs]"
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dtree-into-ssa.c1067 insert_phi_nodes (bitmap_head *dfs) in insert_phi_nodes() argument
1139 bitmap idf = compute_idf (info->info.def_blocks.def_blocks, dfs); in insert_phi_nodes()
2429 bitmap_head *dfs; in execute() local
2451 dfs = XNEWVEC (bitmap_head, last_basic_block_for_fn (fun)); in execute()
2453 bitmap_initialize (&dfs[bb->index], &bitmap_default_obstack); in execute()
2457 compute_dominance_frontiers (dfs); in execute()
2463 insert_phi_nodes (dfs); in execute()
2470 bitmap_clear (&dfs[bb->index]); in execute()
2471 free (dfs); in execute()
3146 insert_updated_phi_nodes_for (tree var, bitmap_head *dfs, bitmap blocks, in insert_updated_phi_nodes_for() argument
[all …]
H A Dtree-ssa-structalias.c1403 unsigned int *dfs; variable
1429 si->dfs[n] = si->current_index ++; in scc_visit()
1430 my_dfs = si->dfs[n]; in scc_visit()
1449 if (si->dfs[t] < si->dfs[n]) in scc_visit()
1450 si->dfs[n] = si->dfs[t]; in scc_visit()
1454 if (si->dfs[n] == my_dfs) in scc_visit()
1457 && si->dfs[si->scc_stack.last ()] >= my_dfs) in scc_visit()
1466 && si->dfs[si->scc_stack.last ()] >= my_dfs) in scc_visit()
1852 dfs = XCNEWVEC (unsigned int, size); in scc_info()
1863 free (dfs); in ~scc_info()
[all …]
H A Dcfganal.c601 depth_first_search dfs; in connect_infinite_loops_to_exit() local
602 dfs.add_bb (EXIT_BLOCK_PTR_FOR_FN (cfun)); in connect_infinite_loops_to_exit()
608 unvisited_block = dfs.execute (unvisited_block); in connect_infinite_loops_to_exit()
616 dfs.add_bb (deadend_block); in connect_infinite_loops_to_exit()
1650 compute_idf (bitmap def_blocks, bitmap_head *dfs) in compute_idf() argument
1685 EXECUTE_IF_AND_COMPL_IN_BITMAP (&dfs[bb_index], phi_insertion_points, in compute_idf()
H A Dipa-cp.c192 int dfs, low_link; variable
198 spec_node (0), dfs (0), low_link (0), on_stack (false) {} in ipcp_value()
3688 if (cur_val->dfs)
3692 cur_val->dfs = dfs_counter;
3702 if (src->val->dfs == 0)
3709 && src->val->dfs < cur_val->low_link)
3710 cur_val->low_link = src->val->dfs;
3713 if (cur_val->dfs == cur_val->low_link)
H A Dipa-inline.c1920 struct ipa_dfs_info *dfs = (struct ipa_dfs_info *) node->aux; in inline_small_functions() local
1933 if (dfs && dfs->next_cycle) in inline_small_functions()
1936 int id = dfs->scc_no + 1; in inline_small_functions()
/netbsd-src/external/gpl3/gcc/dist/gcc/config/aarch64/
H A Dcortex-a57-fma-steering.cc217 void dfs (void (*) (fma_forest *), void (*) (fma_forest *, fma_root_node *),
856 func_fma_steering::dfs (void (*process_forest) (fma_forest *), in dfs() function in func_fma_steering
1006 this->dfs (dump_forest_info, dump_tree_root_info, dump_tree_node_info, in analyze()
1018 this->dfs (dispatch_forest, NULL, rename_fma_node, true); in rename_fma_trees()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/config/aarch64/
H A Dcortex-a57-fma-steering.c217 void dfs (void (*) (fma_forest *), void (*) (fma_forest *, fma_root_node *),
856 func_fma_steering::dfs (void (*process_forest) (fma_forest *), in dfs() function
1006 this->dfs (dump_forest_info, dump_tree_root_info, dump_tree_node_info, in analyze()
1018 this->dfs (dispatch_forest, NULL, rename_fma_node, true); in rename_fma_trees()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/Utils/
H A DImportedFunctionsInliningStatistics.h81 void dfs(InlineGraphNode &GraphNode);
/netbsd-src/external/apache2/llvm/dist/clang/docs/
H A DDataFlowSanitizerDesign.rst216 "dfs$" to the name of each instrumented-ABI function.
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/
H A DAnalyzerOptions.def421 "Value: \"dfs\", \"bfs\", \"unexplored_first\", "
/netbsd-src/external/bsd/am-utils/dist/
H A DNEWS984 such that it matches the type:=ARG as well. Free names afs/dfs for Andrew
/netbsd-src/external/gpl3/gcc.old/dist/gcc/config/spu/
H A Dspu.md1259 "dfs\t%0,%1,%2"
/netbsd-src/external/gpl3/gcc/dist/gcc/cp/
H A DChangeLog-20041406 (find_final_overrider): Adjust dfs searching.

12