HomeSort by: relevance | last modified time | path
    Searched defs:insertions (Results 1 - 7 of 7) sorted by relevancy

  /src/external/bsd/iscsi/dist/include/
iscsiutil.h 232 int insertions; member in struct:hash_t
  /src/external/gpl3/gcc/dist/gcc/
tree-ssa-pre.cc 120 Third, we perform insertions to make partially redundant
195 perform code hoisting insertions after each round of PRE insertions,
509 int insertions; member in struct:__anon13969
630 AVAIL_OUT set of blocks with the new insertions performed during
2537 for performing quick dead code elimination of insertions we made
2832 STMTS is a statement list to append the necessary insertions into.
3103 pre_stats.insertions++;
3129 bool insertions = false;
3158 /* Make the necessary insertions. *
    [all...]
gcse.cc 226 The deletion is done first so that when we do insertions we
1810 routine examines the set of insertions and deletions and if the ratio
1811 of insertions to deletions is too high for a particular expression, then
1827 int *insertions = GCNEWVEC (int, n_elems);
1830 /* Set of expressions which require too many insertions relative to
1841 insertions[j]++;
1853 hash table and see if any need too many insertions relative to the
1858 && (insertions[j] / deletions[j]) > param_max_gcse_insertion_ratio)
1871 free (insertions);
1816 int *insertions = GCNEWVEC (int, n_elems); local
tree-ssa-sccvn.cc 2653 unsigned int insertions; member in class:eliminate_dom_walker
6723 el_todo (0), eliminations (0), insertions (0),
6868 insertions++;
7531 statistics_counter_event (cfun, "Insertions", insertions);
  /src/external/gpl3/gcc.old/dist/gcc/
gcse.cc 226 The deletion is done first so that when we do insertions we
1809 routine examines the set of insertions and deletions and if the ratio
1810 of insertions to deletions is too high for a particular expression, then
1826 int *insertions = GCNEWVEC (int, n_elems);
1829 /* Set of expressions which require too many insertions relative to
1840 insertions[j]++;
1852 hash table and see if any need too many insertions relative to the
1857 && (insertions[j] / deletions[j]) > param_max_gcse_insertion_ratio)
1870 free (insertions);
1815 int *insertions = GCNEWVEC (int, n_elems); local
tree-ssa-pre.cc 120 Third, we perform insertions to make partially redundant
195 perform code hoisting insertions after each round of PRE insertions,
521 int insertions; member in struct:__anon16389
642 AVAIL_OUT set of blocks with the new insertions performed during
2533 for performing quick dead code elimination of insertions we made
2824 STMTS is a statement list to append the necessary insertions into.
3095 pre_stats.insertions++;
3121 bool insertions = false; local
3150 /* Make the necessary insertions. *
    [all...]
tree-ssa-sccvn.cc 2557 unsigned int insertions; member in class:eliminate_dom_walker
6222 el_todo (0), eliminations (0), insertions (0),
6350 insertions++;
7024 statistics_counter_event (cfun, "Insertions", insertions);

Completed in 58 milliseconds