Searched refs:num_ssa_names (Results 1 - 22 of 22) sorted by relevance
/freebsd-12-stable/contrib/gcc/ |
H A D | tree-ssa-copy.c | 513 visited = sbitmap_alloc (num_ssa_names); 885 copy_of = XNEWVEC (prop_value_t, num_ssa_names); 886 memset (copy_of, 0, num_ssa_names * sizeof (*copy_of)); 888 cached_last_copy_of = XNEWVEC (tree, num_ssa_names); 889 memset (cached_last_copy_of, 0, num_ssa_names * sizeof (*cached_last_copy_of)); 957 tmp = XNEWVEC (prop_value_t, num_ssa_names); 958 memset (tmp, 0, num_ssa_names * sizeof (*tmp)); 959 for (i = 1; i < num_ssa_names; i++)
|
H A D | tree-ssa-copyrename.c | 310 map = init_var_map (num_ssa_names + 1); 356 for (x = 1; x <= num_ssa_names; x++)
|
H A D | tree-ssanames.c | 148 SSA_NAME_VERSION (t) = num_ssa_names;
|
H A D | tree-ssa.c | 432 for (i = 1; i < num_ssa_names; i++) 516 for (i = 0; i < num_ssa_names; i++) 588 for (i = 0; i < num_ssa_names; i++) 676 basic_block *definition_block = XCNEWVEC (basic_block, num_ssa_names); 689 for (i = 1; i < num_ssa_names; i++) 858 for (i = 0; i < num_ssa_names; i++)
|
H A D | tree-ssa-alias-warnings.c | 446 for (i = 1; i < num_ssa_names; i++) 990 for (i = 1; i < num_ssa_names; i++)
|
H A D | tree-into-ssa.c | 142 #define NAME_SETS_GROWTH_FACTOR (MAX (3, num_ssa_names / 3)) 276 unsigned new_len = num_ssa_names; 654 if (new_ssa_names->n_bits <= num_ssa_names - 1) 656 unsigned int new_sz = num_ssa_names + NAME_SETS_GROWTH_FACTOR; 2513 old_ssa_names = sbitmap_alloc (num_ssa_names + NAME_SETS_GROWTH_FACTOR); 2516 new_ssa_names = sbitmap_alloc (num_ssa_names + NAME_SETS_GROWTH_FACTOR); 2997 def_blocks = htab_create (num_ssa_names, def_blocks_hash,
|
H A D | tree-complex.c | 1496 complex_lattice_values = VEC_alloc (complex_lattice_t, heap, num_ssa_names); 1498 complex_lattice_values, num_ssa_names); 1500 num_ssa_names * sizeof(complex_lattice_t)); 1508 complex_ssa_name_components = VEC_alloc (tree, heap, 2*num_ssa_names); 1509 VEC_safe_grow (tree, heap, complex_ssa_name_components, 2*num_ssa_names); 1511 2 * num_ssa_names * sizeof(tree));
|
H A D | tree-stdarg.c | 128 si->offsets = XNEWVEC (int, num_ssa_names); 129 for (i = 0; i < num_ssa_names; ++i)
|
H A D | tree-object-size.c | 389 osi.depths = XCNEWVEC (unsigned int, num_ssa_names); 390 osi.stack = XNEWVEC (unsigned int, num_ssa_names); 959 object_sizes[object_size_type] = XNEWVEC (unsigned HOST_WIDE_INT, num_ssa_names);
|
H A D | tree-vrp.c | 3029 for (i = 0; i < num_ssa_names; i++) 3848 found_in_subgraph = sbitmap_alloc (num_ssa_names); 3855 asserts_for = XNEWVEC (assert_locus_t, num_ssa_names); 3856 memset (asserts_for, 0, num_ssa_names * sizeof (assert_locus_t)); 3994 vr_value = XNEWVEC (value_range_t *, num_ssa_names); 3995 memset (vr_value, 0, num_ssa_names * sizeof (value_range_t *)); 5386 single_val_range = XNEWVEC (prop_value_t, num_ssa_names); 5387 memset (single_val_range, 0, num_ssa_names * sizeof (*single_val_range)); 5390 for (i = 0; i < num_ssa_names; i++) 5414 for (i = 0; i < num_ssa_names; [all...] |
H A D | tree-outof-ssa.c | 1345 t->version_info = XCNEWVEC (void *, num_ssa_names + 1); 1346 t->expr_vars = XCNEWVEC (bitmap, num_ssa_names + 1); 1387 for (i = 0; i <= num_ssa_names; i++) 1839 for (x = 0; x < (int)num_ssa_names + 1; x++)
|
H A D | tree-ssa-live.c | 418 map = init_var_map (num_ssa_names + 1); 428 = (int *)xmalloc (((num_ssa_names + 1) * sizeof (int))); 429 memset (map->ref_count, 0, (num_ssa_names + 1) * sizeof (int)); 1830 for (y = 1; y < num_ssa_names; y++)
|
H A D | tree-flow.h | 435 #define num_ssa_names (VEC_length (tree, ssa_names)) macro
|
H A D | tree-ssa-alias.c | 882 ai->ssa_names_visited = sbitmap_alloc (num_ssa_names); 925 for (i = 1; i < num_ssa_names; i++) 1029 for (i = 1; i < num_ssa_names; i++) 2423 for (i = 1; i < num_ssa_names; i++)
|
H A D | tree-ssa-dce.c | 846 processed = sbitmap_alloc (num_ssa_names + 1);
|
H A D | tree-ssa-propagate.c | 501 for (i = 1; i < num_ssa_names; i++)
|
H A D | tree-ssa-ccp.c | 540 const_val = XNEWVEC (prop_value_t, num_ssa_names); 541 memset (const_val, 0, num_ssa_names * sizeof (*const_val));
|
H A D | tree-ssa-loop-manip.c | 366 old_num_ssa_names = num_ssa_names;
|
H A D | tree-ssa-pre.c | 1973 for (i = 0; i < num_ssa_names; i++) 3868 for (i = 0; i < num_ssa_names; i++) 3921 vuse_names = XCNEWVEC (bitmap, num_ssa_names);
|
H A D | tree-ssa-loop-ivopts.c | 818 data->version_info_size = 2 * num_ssa_names; 5768 if (data->version_info_size < num_ssa_names) 5770 data->version_info_size = 2 * num_ssa_names;
|
H A D | tree-ssa-dom.c | 332 for (i = 0; i < num_ssa_names; i++)
|
H A D | tree-ssa-operands.c | 2561 for (x = 1; x < num_ssa_names; x++)
|
Completed in 365 milliseconds