/netbsd-current/external/mit/isl/dist/ |
H A D | isl_ast_build.c | 59 isl_vec *strides; local 70 strides = isl_vec_alloc(ctx, dim); 71 strides = isl_vec_set_si(strides, 1); 73 isl_vec_free(build->strides); 74 build->strides = strides; 86 !build->strides || !build->offsets || !build->options) 208 dup->strides = isl_vec_copy(build->strides); 1838 isl_vec *strides; local [all...] |
H A D | isl_ast_build_private.h | 51 * "strides" contains the stride of each loop. The number of elements 160 isl_vec *strides; member in struct:isl_ast_build
|
H A D | isl_map.c | 13700 int strides = 0; local 13704 strides++; 13706 return strides; 13851 int strides; local 13879 strides = rational ? 0 : multi_aff_strides(ma); 13880 res = isl_basic_map_alloc_space(space, n_div_ma + n_div_bmap + strides, 13881 bmap->n_eq + strides, bmap->n_ineq + 2 * n_div_ma); 13924 if (strides)
|
/netbsd-current/external/gpl3/gcc.old/dist/gcc/fortran/ |
H A D | class.c | 1182 offset = offset + mod (idx, sizes(idx2)) / sizes(idx2-1) * strides(idx2) 1188 gfc_symbol *strides, gfc_symbol *sizes, 1213 * strides(idx2). */ 1256 /* ... * strides(idx2). */ 1261 expr->value.op.op2 = gfc_lval_expr_from_sym (strides); 1268 expr->value.op.op2->ref->u.ar.as = strides->as; 1314 offset = obtain_offset(i, strides, sizes, byte_stride) 1333 gfc_symbol *strides, gfc_symbol *sizes, 1394 /* If strides aren't allowed (not assumed shape or CONTIGUOUS), 1510 block2 = finalization_get_offset (idx, idx2, offset, strides, size 1187 finalization_get_offset(gfc_symbol *idx, gfc_symbol *idx2, gfc_symbol *offset, gfc_symbol *strides, gfc_symbol *sizes, gfc_symbol *byte_stride, gfc_expr *rank, gfc_code *block, gfc_namespace *sub_ns) argument 1329 finalizer_insert_packed_call(gfc_code *block, gfc_finalizer *fini, gfc_symbol *array, gfc_symbol *byte_stride, gfc_symbol *idx, gfc_symbol *ptr, gfc_symbol *nelem, gfc_symbol *strides, gfc_symbol *sizes, gfc_symbol *idx2, gfc_symbol *offset, gfc_symbol *is_contiguous, gfc_expr *rank, gfc_namespace *sub_ns) argument 1596 gfc_symbol *final, *array, *fini_coarray, *byte_stride, *sizes, *strides; local [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/fortran/ |
H A D | class.cc | 1197 offset = offset + mod (idx, sizes(idx2)) / sizes(idx2-1) * strides(idx2) 1203 gfc_symbol *strides, gfc_symbol *sizes, 1228 * strides(idx2). */ 1271 /* ... * strides(idx2). */ 1276 expr->value.op.op2 = gfc_lval_expr_from_sym (strides); 1283 expr->value.op.op2->ref->u.ar.as = strides->as; 1329 offset = obtain_offset(i, strides, sizes, byte_stride) 1348 gfc_symbol *strides, gfc_symbol *sizes, 1409 /* If strides aren't allowed (not assumed shape or CONTIGUOUS), 1525 block2 = finalization_get_offset (idx, idx2, offset, strides, size 1202 finalization_get_offset(gfc_symbol *idx, gfc_symbol *idx2, gfc_symbol *offset, gfc_symbol *strides, gfc_symbol *sizes, gfc_symbol *byte_stride, gfc_expr *rank, gfc_code *block, gfc_namespace *sub_ns) argument 1344 finalizer_insert_packed_call(gfc_code *block, gfc_finalizer *fini, gfc_symbol *array, gfc_symbol *byte_stride, gfc_symbol *idx, gfc_symbol *ptr, gfc_symbol *nelem, gfc_symbol *strides, gfc_symbol *sizes, gfc_symbol *idx2, gfc_symbol *offset, gfc_symbol *is_contiguous, gfc_expr *rank, gfc_namespace *sub_ns) argument 1611 gfc_symbol *final, *array, *fini_coarray, *byte_stride, *sizes, *strides; local [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | tree-ssa-loop-prefetch.c | 994 /* Do we want to issue prefetches for non-constant strides? */ 1006 prefetch hints for a range of strides. Make sure we don't issue 1497 HOST_WIDE_INT *strides, unsigned n, class loop *loop) 1518 strides[n - 1 - loop_depth (loop) + loop_depth (aloop)] += astep * stride; 1533 HOST_WIDE_INT *strides, astride; local 1550 strides = XCNEWVEC (HOST_WIDE_INT, n); 1573 add_subscript_strides (access_fn, astride, strides, n, loop); 1580 s = strides[i] < 0 ? -strides[i] : strides[ 1496 add_subscript_strides(tree access_fn, unsigned stride, HOST_WIDE_INT *strides, unsigned n, class loop *loop) argument [all...] |
H A D | gimple-loop-interchange.cc | 96 /* Vector of strides that DR accesses in each level loop of a loop nest. */ 992 /* Update strides of data references. */ 1280 for (i = 0; i < 100; i++) ;(DR->aux)strides[0] = 40000 1281 for (j = 100; j > 0; j--) ;(DR->aux)strides[1] = 400 1282 for (k = 0; k < 100; k++) ;(DR->aux)strides[2] = 4 1289 vec<tree> *strides = new vec<tree> (); local 1294 strides->safe_push (build_int_cst (sizetype, 0)); 1305 struct, for analysis of the strides that shouldn't matter. */ 1320 dr->aux = strides; 1336 strides [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | tree-ssa-loop-prefetch.cc | 994 /* Do we want to issue prefetches for non-constant strides? */ 1006 prefetch hints for a range of strides. Make sure we don't issue 1494 HOST_WIDE_INT *strides, unsigned n, class loop *loop) 1515 strides[n - 1 - loop_depth (loop) + loop_depth (aloop)] += astep * stride; 1530 HOST_WIDE_INT *strides, astride; 1547 strides = XCNEWVEC (HOST_WIDE_INT, n); 1570 add_subscript_strides (access_fn, astride, strides, n, loop); 1577 s = strides[i] < 0 ? -strides[i] : strides[ [all...] |
H A D | gimple-loop-interchange.cc | 96 /* Vector of strides that DR accesses in each level loop of a loop nest. */ 992 /* Update strides of data references. */ 1280 for (i = 0; i < 100; i++) ;(DR->aux)strides[0] = 40000 1281 for (j = 100; j > 0; j--) ;(DR->aux)strides[1] = 400 1282 for (k = 0; k < 100; k++) ;(DR->aux)strides[2] = 4 1289 vec<tree> *strides = new vec<tree> (); local 1290 dr->aux = strides; 1297 strides->safe_push (build_int_cst (sizetype, 0)); 1308 struct, for analysis of the strides that shouldn't matter. */ 1350 strides [all...] |
/netbsd-current/sys/arch/evbppc/wii/dev/ |
H A D | wiifb.c | 232 u_int strides, reads; local 277 strides = (sc->sc_curmode->width * 2) / (interlaced ? 16 : 32); 280 __SHIFTIN(strides, VI_PICCONF_STRIDES) |
|
/netbsd-current/external/gpl3/gcc.old/dist/libgfortran/runtime/ |
H A D | ISO_Fortran_binding.c | 456 const CFI_index_t upper_bounds[], const CFI_index_t strides[]) 529 if (strides[i] == 0) 534 * zeros in strides. */ 539 "rank of source minus the number of zeros in strides " 578 if (strides == NULL) 587 stride[i] = strides[i]; 592 fprintf (stderr, "CFI_section: If strides[%d] = 0, then the " 454 CFI_section(CFI_cdesc_t *result, const CFI_cdesc_t *source, const CFI_index_t lower_bounds[], const CFI_index_t upper_bounds[], const CFI_index_t strides[]) argument
|
/netbsd-current/external/gpl3/gcc/dist/libgfortran/runtime/ |
H A D | ISO_Fortran_binding.c | 495 const CFI_index_t upper_bounds[], const CFI_index_t strides[]) 566 if (strides[i] == 0) 571 * zeros in strides. */ 576 "rank of source minus the number of zeros in strides " 615 if (strides == NULL) 624 stride[i] = strides[i]; 629 fprintf (stderr, "CFI_section: If strides[%d] = 0, then " 493 CFI_section(CFI_cdesc_t *result, const CFI_cdesc_t *source, const CFI_index_t lower_bounds[], const CFI_index_t upper_bounds[], const CFI_index_t strides[]) argument
|
/netbsd-current/external/mit/isl/dist/doc/ |
H A D | implementation.tex | 1992 Such an overapproximation can be obtained by computing strides,
|