| /src/external/gpl3/gcc/dist/libgfortran/runtime/ |
| ISO_Fortran_binding.c | 133 /* Full pointer or allocatable arrays retain their lower_bounds. */
215 CFI_allocate (CFI_cdesc_t *dv, const CFI_index_t lower_bounds[],
252 /* If rank is greater than 0, lower_bounds and upper_bounds are used. They're
257 && (lower_bounds == NULL || upper_bounds == NULL))
259 fprintf (stderr, "CFI_allocate: The lower_bounds and "
267 dv->dim[i].lower_bound = lower_bounds[i];
494 const CFI_index_t lower_bounds[],
583 if (lower_bounds == NULL)
591 lower[i] = lower_bounds[i];
630 "lower_bounds[%d] = %" PRIiPTR " and
[all...] |
| /src/external/gpl3/gcc.old/dist/libgfortran/runtime/ |
| ISO_Fortran_binding.c | 133 /* Full pointer or allocatable arrays retain their lower_bounds. */
215 CFI_allocate (CFI_cdesc_t *dv, const CFI_index_t lower_bounds[],
252 /* If rank is greater than 0, lower_bounds and upper_bounds are used. They're
257 && (lower_bounds == NULL || upper_bounds == NULL))
259 fprintf (stderr, "CFI_allocate: The lower_bounds and "
267 dv->dim[i].lower_bound = lower_bounds[i];
494 const CFI_index_t lower_bounds[],
583 if (lower_bounds == NULL)
591 lower[i] = lower_bounds[i];
630 "lower_bounds[%d] = %" PRIiPTR " and
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-vect-data-refs.cc | 3818 vec<vec_lower_bound> &lower_bounds
3820 for (unsigned int i = 0; i < lower_bounds.length (); ++i)
3821 if (operand_equal_p (lower_bounds[i].expr, expr, 0))
3823 unsigned_p &= lower_bounds[i].unsigned_p;
3824 min_value = upper_bound (lower_bounds[i].min_value, min_value);
3825 if (lower_bounds[i].unsigned_p != unsigned_p
3826 || maybe_lt (lower_bounds[i].min_value, min_value))
3828 lower_bounds[i].unsigned_p = unsigned_p;
3829 lower_bounds[i].min_value = min_value;
3834 dump_lower_bound (MSG_NOTE, lower_bounds[i])
[all...] |
| tree-vectorizer.h | 818 auto_vec<vec_lower_bound> lower_bounds; member in class:_loop_vec_info
1010 #define LOOP_VINFO_LOWER_BOUNDS(L) (L)->lower_bounds
1048 || (L)->lower_bounds.length () > 0)
|
| tree-vect-loop-manip.cc | 3901 const vec<vec_lower_bound> &lower_bounds
3903 for (unsigned int i = 0; i < lower_bounds.length (); ++i)
3905 tree expr = lower_bounds[i].expr;
3908 poly_uint64 bound = lower_bounds[i].min_value;
3909 if (!lower_bounds[i].unsigned_p)
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-vect-data-refs.cc | 3521 vec<vec_lower_bound> &lower_bounds
3523 for (unsigned int i = 0; i < lower_bounds.length (); ++i)
3524 if (operand_equal_p (lower_bounds[i].expr, expr, 0))
3526 unsigned_p &= lower_bounds[i].unsigned_p;
3527 min_value = upper_bound (lower_bounds[i].min_value, min_value);
3528 if (lower_bounds[i].unsigned_p != unsigned_p
3529 || maybe_lt (lower_bounds[i].min_value, min_value))
3531 lower_bounds[i].unsigned_p = unsigned_p;
3532 lower_bounds[i].min_value = min_value;
3537 dump_lower_bound (MSG_NOTE, lower_bounds[i])
[all...] |
| tree-vectorizer.h | 761 auto_vec<vec_lower_bound> lower_bounds; member in class:_loop_vec_info
900 #define LOOP_VINFO_LOWER_BOUNDS(L) (L)->lower_bounds
930 || (L)->lower_bounds.length () > 0)
|
| tree-vect-loop-manip.cc | 3328 const vec<vec_lower_bound> &lower_bounds local
3330 for (unsigned int i = 0; i < lower_bounds.length (); ++i)
3332 tree expr = lower_bounds[i].expr;
3335 poly_uint64 bound = lower_bounds[i].min_value;
3336 if (!lower_bounds[i].unsigned_p)
|
| /src/external/mit/isl/dist/ |
| isl_ast_codegen.c | 598 static __isl_give isl_pw_aff_list *lower_bounds( function
1194 lower = lower_bounds(c_lower, depth, domain, build);
|
