HomeSort by: relevance | last modified time | path
    Searched refs:n_defs (Results 1 - 8 of 8) sorted by relevancy

  /src/external/gpl3/gcc/dist/libcpp/
pch.cc 113 size_t n_defs; member in struct:cpp_savedstate
248 ss->n_defs += 1;
285 ss->defs[ss->n_defs] = hn;
286 ss->n_defs += 1;
320 ss->n_defs = 0;
323 ss->defs = XNEWVEC (cpp_hashnode *, ss->n_defs);
324 ss->n_defs = 0;
328 qsort (ss->defs, ss->n_defs, sizeof (cpp_hashnode *), &comp_hashnodes);
330 for (i = 0; i < ss->n_defs; ++i)
524 size_t n_defs; member in struct:ht_node_list
    [all...]
  /src/external/gpl3/gcc.old/dist/libcpp/
pch.cc 113 size_t n_defs; member in struct:cpp_savedstate
248 ss->n_defs += 1;
285 ss->defs[ss->n_defs] = hn;
286 ss->n_defs += 1;
320 ss->n_defs = 0;
323 ss->defs = XNEWVEC (cpp_hashnode *, ss->n_defs);
324 ss->n_defs = 0;
328 qsort (ss->defs, ss->n_defs, sizeof (cpp_hashnode *), &comp_hashnodes);
330 for (i = 0; i < ss->n_defs; ++i)
524 size_t n_defs; member in struct:ht_node_list
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
tree-into-ssa.cc 769 unsigned n_defs, adef; local
807 n_defs = bitmap_count_bits (to_remove);
808 defs = XNEWVEC (struct dom_dfsnum, 2 * n_defs + 1);
822 gcc_assert (adef == 2 * n_defs + 1);
832 auto_vec<int> worklist (n_defs + 1);
835 n_defs = 1;
845 defs[n_defs].bb_index = top;
846 defs[n_defs].dfs_num = defs[i].dfs_num + 1;
852 defs[n_defs].bb_index = defs[i].bb_index;
853 defs[n_defs].dfs_num = defs[i].dfs_num
    [all...]
df-problems.cc 298 unsigned int n_defs = DF_DEFS_COUNT (regno);
315 if (n_defs > DF_SPARSE_THRESHOLD)
318 bitmap_clear_range (&bb_info->gen, begin, n_defs);
322 bitmap_set_range (&bb_info->kill, begin, n_defs);
323 bitmap_clear_range (&bb_info->gen, begin, n_defs);
297 unsigned int n_defs = DF_DEFS_COUNT (regno); local
loop-iv.cc 249 unsigned i, n_defs = DF_DEFS_TABLE_SIZE (); local
253 for (i = 0; i < n_defs; i++)
  /src/external/gpl3/gcc.old/dist/gcc/
tree-into-ssa.cc 758 unsigned n_defs, adef; local
796 n_defs = bitmap_count_bits (to_remove);
797 defs = XNEWVEC (struct dom_dfsnum, 2 * n_defs + 1);
811 gcc_assert (adef == 2 * n_defs + 1);
821 auto_vec<int> worklist (n_defs + 1);
824 n_defs = 1;
834 defs[n_defs].bb_index = top;
835 defs[n_defs].dfs_num = defs[i].dfs_num + 1;
841 defs[n_defs].bb_index = defs[i].bb_index;
842 defs[n_defs].dfs_num = defs[i].dfs_num
    [all...]
df-problems.cc 298 unsigned int n_defs = DF_DEFS_COUNT (regno);
315 if (n_defs > DF_SPARSE_THRESHOLD)
318 bitmap_clear_range (&bb_info->gen, begin, n_defs);
322 bitmap_set_range (&bb_info->kill, begin, n_defs);
323 bitmap_clear_range (&bb_info->gen, begin, n_defs);
297 unsigned int n_defs = DF_DEFS_COUNT (regno); local
loop-iv.cc 249 unsigned i, n_defs = DF_DEFS_TABLE_SIZE (); local
253 for (i = 0; i < n_defs; i++)

Completed in 113 milliseconds