Lines Matching defs:loops

227   /* For OpenACC loops, a mask of gang, worker and vector used at
230 /* For OpenACC loops, a mask of gang, worker and vector used at
256 struct omp_for_data_loop *loops;
415 struct omp_for_data_loop *loops)
431 fd->loops = loops;
433 fd->loops = &fd->loop;
488 static loops and dynamic loops. */
499 else if (loops != NULL)
500 loop = loops + i;
707 /* For OpenACC loops, force a chunk size of one, as this avoids the default
902 static loops and any kind of ordered loop. In the first
3629 /* Set max_vf=1 (which will later enforce safelen=1) in simd loops
5584 loop tree arrange for the child function to fixup loops. */
5712 /* Collapsed loops need work for expansion into SSA form. */
5739 tree itype = TREE_TYPE (fd->loops[i].v);
5742 && ((t = fold_binary (fd->loops[i].cond_code, boolean_type_node,
5743 fold_convert (itype, fd->loops[i].n1),
5744 fold_convert (itype, fd->loops[i].n2)))
5749 n1 = fold_convert (itype, unshare_expr (fd->loops[i].n1));
5752 n2 = fold_convert (itype, unshare_expr (fd->loops[i].n2));
5755 cond_stmt = gimple_build_cond (fd->loops[i].cond_code, n1, n2,
5792 t = build_int_cst (itype, (fd->loops[i].cond_code == LT_EXPR
5795 fold_convert (itype, fd->loops[i].step), t);
5797 fold_convert (itype, fd->loops[i].n2));
5799 fold_convert (itype, fd->loops[i].n1));
5805 if (TYPE_UNSIGNED (itype) && fd->loops[i].cond_code == GT_EXPR)
5810 fd->loops[i].step)));
5813 fold_convert (itype, fd->loops[i].step));
5891 tree vtype = TREE_TYPE (fd->loops[i].v), itype, t;
5901 fold_convert (itype, fd->loops[i].step));
5903 t = fold_build_pointer_plus (fd->loops[i].n1, t);
5905 t = fold_build2 (PLUS_EXPR, itype, fd->loops[i].n1, t);
5907 DECL_P (fd->loops[i].v)
5908 && TREE_ADDRESSABLE (fd->loops[i].v),
5911 stmt = gimple_build_assign (fd->loops[i].v, t);
5952 tree vtype = TREE_TYPE (fd->loops[i].v);
5963 t = fd->loops[i + 1].n1;
5965 DECL_P (fd->loops[i + 1].v)
5966 && TREE_ADDRESSABLE (fd->loops[i
5970 stmt = gimple_build_assign (fd->loops[i + 1].v, t);
5979 t = fold_build_pointer_plus (fd->loops[i].v, fd->loops[i].step);
5981 t = fold_build2 (PLUS_EXPR, vtype, fd->loops[i].v, fd->loops[i].step);
5983 DECL_P (fd->loops[i].v)
5984 && TREE_ADDRESSABLE (fd->loops[i].v),
5986 stmt = gimple_build_assign (fd->loops[i].v, t);
5991 t = fd->loops[i].n2;
5994 tree v = fd->loops[i].v;
5998 t = fold_build2 (fd->loops[i].cond_code, boolean_type_node, v, t);
6040 For collapsed loops, given parameters:
6273 argument, true for < loops and false for > loops.
7561 For collapsed loops, given parameters:
7692 tree itype = TREE_TYPE (fd->loops[i].v);
7695 t = fold_convert (TREE_TYPE (fd->loops[i].v), fd->loops[i].n1);
7696 expand_omp_build_assign (&gsi, fd->loops[i].v, t);
7719 if (POINTER_TYPE_P (TREE_TYPE (fd->loops[i].v)))
7721 t = fold_convert (sizetype, fd->loops[i].step);
7722 t = fold_build_pointer_plus (fd->loops[i].v, t);
7726 t = fold_convert (TREE_TYPE (fd->loops[i].v),
7727 fd->loops[i].step);
7728 t = fold_build2 (PLUS_EXPR, TREE_TYPE (fd->loops[i].v),
7729 fd->loops[i].v, t);
7731 expand_omp_build_assign (&gsi, fd->loops[i].v, t);
7735 tree itype = TREE_TYPE (fd->loops[i].v);
7736 tree itype2 = TREE_TYPE (fd->loops[i - 1].v);
7740 build2 (fd->loops[i].cond_code, boolean_type_node,
7741 fd->loops[i].v,
7742 fold_convert (itype, fd->loops[i].n2)),
7744 fold_convert (itype2, fd->loops[i - 1].step));
7745 if (POINTER_TYPE_P (TREE_TYPE (fd->loops[i - 1].v)))
7746 t = fold_build_pointer_plus (fd->loops[i - 1].v, t);
7748 t = fold_build2 (PLUS_EXPR, itype2, fd->loops[i - 1].v, t);
7749 expand_omp_build_assign (&gsi, fd->loops[i - 1].v, t);
7752 build2 (fd->loops[i].cond_code, boolean_type_node,
7753 fd->loops[i].v,
7754 fold_convert (itype, fd->loops[i].n2)),
7755 fd->loops[i].v,
7756 fold_convert (itype, fd->loops[i].n1));
7757 expand_omp_build_assign (&gsi, fd->loops[i].v, t);
7864 struct omp_for_data_loop *loops;
7866 loops
7871 &fd, loops);
7886 original loops from being detected. Fix that up. */
8956 loop tree arrange for the child function to fixup loops. */