Cross Reference: /src/external/gpl3/gcc.old/dist/gcc/omp-expand.cc

Lines Matching refs:last_nonrect
1762    in the sub-nest with COUNT.  Also, as counts[fd->last_nonrect]
1764    to fd->last_nonrect inclusive, i.e. the above COUNT multiplied
1829 	  && fd->last_nonrect == fd->first_nonrect + 1
1830 	  && !TYPE_UNSIGNED (TREE_TYPE (fd->loops[fd->last_nonrect].v)))
1965 	  if (fd->non_rect && i >= fd->first_nonrect && i <= fd->last_nonrect)
1979       gcc_assert (fd->last_nonrect != -1);
1981       counts[fd->last_nonrect] = create_tmp_reg (type, ".count");
1982       expand_omp_build_assign (gsi, counts[fd->last_nonrect],
1984       for (i = fd->first_nonrect + 1; i < fd->last_nonrect; i++)
1989       if (i == fd->last_nonrect
1990 	  && fd->loops[i].outer == fd->last_nonrect - fd->first_nonrect
2141 	  expand_omp_build_assign (&gsi2, counts[fd->last_nonrect],
2226 	  if (fd->first_nonrect + 1 == fd->last_nonrect)
2248 	  tree *vs = XALLOCAVEC (tree, fd->last_nonrect);
2249 	  memset (vs, 0, fd->last_nonrect * sizeof (tree));
2251 	  for (i = 0; i <= fd->last_nonrect; i++)
2281 	      if (i < fd->last_nonrect)
2307 	      if (i == fd->last_nonrect)
2337 				   counts[fd->last_nonrect], t);
2340 		  expand_omp_build_assign (&gsi2, counts[fd->last_nonrect], t);
2389       for (i = fd->first_nonrect; i < fd->last_nonrect; i++)
2401 	  t = fold_build2 (MULT_EXPR, type, counts[fd->last_nonrect], t);
2402 	  expand_omp_build_assign (gsi, counts[fd->last_nonrect], t);
2405 	t = counts[fd->last_nonrect];
2408 			 counts[fd->last_nonrect]);
2418 	  if ((i < fd->first_nonrect || i > fd->last_nonrect)
2427       counts[fd->last_nonrect] = t;
2442    For non-rectangular loops (between fd->first_nonrect and fd->last_nonrect
2497 	  && fd->last_nonrect == fd->first_nonrect + 1
2498 	  && !TYPE_UNSIGNED (TREE_TYPE (fd->loops[fd->last_nonrect].v)))
2541       if (i != 0 && (i != fd->last_nonrect || fd->first_nonrect))
2545       if (i == fd->last_nonrect)
2554 	  if (fd->first_nonrect + 1 == fd->last_nonrect
2765 	     (inclusive) fd->first_nonrect and fd->last_nonrect at
2779 	  tree *vs = XALLOCAVEC (tree, fd->last_nonrect);
2781 	  memset (vs, 0, fd->last_nonrect * sizeof (tree));
2783 	  for (int j = fd->first_nonrect; j <= fd->last_nonrect; j++)
2809 	      if (j < fd->last_nonrect)
2835 	      if (j == fd->last_nonrect)
2944 	  for (int j = fd->last_nonrect; j >= fd->first_nonrect; j--)
2953 	      if (j == fd->last_nonrect)
3016       if (i != 0 && (i != fd->last_nonrect || fd->first_nonrect))
3024       if (i == fd->last_nonrect)
3028     for (i = 0; i <= fd->last_nonrect; i++)
3170 	  for (int j = i + 1; j <= fd->last_nonrect; j++)
4799       && fd->last_nonrect == fd->first_nonrect + 1
4800       && !TYPE_UNSIGNED (TREE_TYPE (fd->loops[fd->last_nonrect].v)))
5357 	  nonrect_bounds = XALLOCAVEC (tree, fd->last_nonrect + 1);
5358 	  memset (nonrect_bounds, 0, sizeof (tree) * (fd->last_nonrect + 1));
6488 	      nonrect_bounds = XALLOCAVEC (tree, fd->last_nonrect + 1);
6490 		      sizeof (tree) * (fd->last_nonrect + 1));
7380 	  nonrect_bounds = XALLOCAVEC (tree, fd->last_nonrect + 1);
7381 	  memset (nonrect_bounds, 0, sizeof (tree) * (fd->last_nonrect + 1));
8065       for (int i = fd.first_nonrect; i <= fd.last_nonrect; i++)
OpenGrok
