Searched refs:dfs (Results 1 - 7 of 7) sorted by relevance

/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.robertl/
H A Deb4.C48 b->func(dfs); // { dg-error "'dfs' was not declared" }
/haiku-buildtools/gcc/libgcc/soft-fp/
H A Dop-common.h1612 #define FP_EXTEND(dfs, sfs, dwc, swc, D, S) \
1615 if (_FP_FRACBITS_##dfs < _FP_FRACBITS_##sfs \
1616 || (_FP_EXPMAX_##dfs - _FP_EXPBIAS_##dfs \
1618 || (_FP_EXPBIAS_##dfs < _FP_EXPBIAS_##sfs + _FP_FRACBITS_##sfs - 1 \
1619 && _FP_EXPBIAS_##dfs != _FP_EXPBIAS_##sfs)) \
1625 D##_e = S##_e + _FP_EXPBIAS_##dfs - _FP_EXPBIAS_##sfs; \
1626 _FP_FRAC_SLL_##dwc (D, (_FP_FRACBITS_##dfs - _FP_FRACBITS_##sfs)); \
1635 else if (_FP_EXPBIAS_##dfs \
1639 _FP_FRAC_SLL_##dwc (D, (_FP_FRACBITS_##dfs \
[all...]
/haiku-buildtools/gcc/gcc/
H A Dtree-into-ssa.c750 in the dfs numbering of the dominance tree. */
757 /* The dfs number of this node. */
836 To quickly locate the nearest def that dominates use, we use dfs numbering
838 queries). For each def, we have the interval given by the dfs number on
841 that contains entry and exit dfs numbers for the basic block with the use.
865 dfs number corresponds. Change them to the number of basic block that
866 corresponds to the interval following the dfs number. Also, for the
867 dfs_out numbers, increase the dfs number by one (so that it corresponds
1113 insert_phi_nodes (bitmap_head *dfs) argument
1132 bitmap idf = compute_idf (info->info.def_blocks.def_blocks, dfs);
2386 bitmap_head *dfs; local
3032 insert_updated_phi_nodes_for(tree var, bitmap_head *dfs, bitmap blocks, unsigned update_flags) argument
3350 bitmap_head *dfs; local
3371 insert_updated_phi_nodes_for (ssa_name (i), dfs, blocks_to_update, local
[all...]
H A Dtree-ssa-structalias.c1414 unsigned int *dfs; member in struct:scc_info
1440 si->dfs[n] = si->current_index ++;
1441 my_dfs = si->dfs[n];
1460 if (si->dfs[t] < si->dfs[n])
1461 si->dfs[n] = si->dfs[t];
1465 if (si->dfs[n] == my_dfs)
1468 && si->dfs[si->scc_stack.last ()] >= my_dfs)
1477 && si->dfs[s
[all...]
H A Dcfganal.c1088 /* Add the specified basic block to the top of the dfs data
1140 /* Performs dfs search from BB over vertices satisfying PREDICATE;
1300 compute_idf (bitmap def_blocks, bitmap_head *dfs)
1334 EXECUTE_IF_AND_COMPL_IN_BITMAP (&dfs[bb_index], phi_insertion_points,
1296 compute_idf(bitmap def_blocks, bitmap_head *dfs) argument
H A Dipa-cp.c206 int dfs, low_link; variable
2605 if (cur_val->dfs)
2609 cur_val->dfs = dfs_counter;
2619 if (src->val->dfs == 0)
2626 && src->val->dfs < cur_val->low_link)
2627 cur_val->low_link = src->val->dfs;
2630 if (cur_val->dfs == cur_val->low_link)
H A Dipa-inline.c1790 struct ipa_dfs_info *dfs = (struct ipa_dfs_info *) node->aux; local
1803 if (dfs && dfs->next_cycle)
1806 int id = dfs->scc_no + 1;

Completed in 218 milliseconds