| /src/external/bsd/byacc/dist/ |
| defs.h | 263 /* the structure used to store reductions */
265 typedef struct reductions reductions; typedef in typeref:struct:reductions
266 struct reductions struct
268 struct reductions *next;
400 extern reductions *first_reduction;
404 extern reductions **reduction_table;
|
| defs.h | 263 /* the structure used to store reductions */
265 typedef struct reductions reductions; typedef in typeref:struct:reductions
266 struct reductions struct
268 struct reductions *next;
400 extern reductions *first_reduction;
404 extern reductions **reduction_table;
|
| /src/external/gpl3/gcc/dist/libgomp/ |
| libgomp.h | 387 /* Task reductions for this work-sharing construct. */
733 uintptr_t *reductions; member in struct:gomp_taskgroup
|
| libgomp.h | 387 /* Task reductions for this work-sharing construct. */
733 uintptr_t *reductions; member in struct:gomp_taskgroup
|
| /src/external/gpl3/gcc.old/dist/libgomp/ |
| libgomp.h | 389 /* Task reductions for this work-sharing construct. */
624 uintptr_t *reductions; member in struct:gomp_taskgroup
|
| libgomp.h | 389 /* Task reductions for this work-sharing construct. */
624 uintptr_t *reductions; member in struct:gomp_taskgroup
|
| /src/external/gpl3/gcc/dist/gcc/ |
| omp-expand.cc | 319 /* Give up for task reductions on the parallel, while it is implementable,
3964 tree reductions = NULL_TREE; local
3982 reductions = OMP_CLAUSE_DECL (c);
3983 gcc_assert (TREE_CODE (reductions) == SSA_NAME);
3984 gimple *g = SSA_NAME_DEF_STMT (reductions);
3985 reductions = gimple_assign_rhs1 (g);
3986 OMP_CLAUSE_DECL (c) = reductions;
3994 reductions = null_pointer_node;
4204 reductions, mem);
4208 reductions, mem)
4964 tree reductions = NULL_TREE; local
5751 tree reductions = NULL_TREE; local
8417 tree reductions = null_pointer_node, mem = null_pointer_node; local
[all...] |
| tree-vectorizer.h | 731 about the reductions that generated them. */
825 auto_vec<stmt_vec_info> reductions; member in class:_loop_vec_info
1014 #define LOOP_VINFO_REDUCTIONS(L) (L)->reductions
1403 N scalar reductions in parallel, this variable gives the initial
1404 scalar values of those N reductions. */
1408 N scalar reductions in parallel, this variable gives the vectorized code's
1409 final (scalar) result for each of those N reductions. In other words,
|
| omp-expand.cc | 319 /* Give up for task reductions on the parallel, while it is implementable,
3964 tree reductions = NULL_TREE; local
3982 reductions = OMP_CLAUSE_DECL (c);
3983 gcc_assert (TREE_CODE (reductions) == SSA_NAME);
3984 gimple *g = SSA_NAME_DEF_STMT (reductions);
3985 reductions = gimple_assign_rhs1 (g);
3986 OMP_CLAUSE_DECL (c) = reductions;
3994 reductions = null_pointer_node;
4204 reductions, mem);
4208 reductions, mem)
4964 tree reductions = NULL_TREE; local
5751 tree reductions = NULL_TREE; local
8417 tree reductions = null_pointer_node, mem = null_pointer_node; local
[all...] |
| tree-vectorizer.h | 731 about the reductions that generated them. */
825 auto_vec<stmt_vec_info> reductions; member in class:_loop_vec_info
1014 #define LOOP_VINFO_REDUCTIONS(L) (L)->reductions
1403 N scalar reductions in parallel, this variable gives the initial
1404 scalar values of those N reductions. */
1408 N scalar reductions in parallel, this variable gives the vectorized code's
1409 final (scalar) result for each of those N reductions. In other words,
|
| tree-vect-slp.cc | 2513 /* Swapping operands for reductions breaks assumptions later on. */
3610 const vec<stmt_vec_info> &reductions local
3611 = as_a <loop_vec_info> (vinfo)->reductions;
3612 scalar_stmts.create (reductions.length ());
3613 for (i = 0; reductions.iterate (i, &next_info); i++)
3712 loop_vinfo->reductions.safe_push (last);
3715 /* Find SLP sequences starting from groups of reductions. */
3716 if (loop_vinfo->reductions.length () > 1)
3717 vect_analyze_slp_instance (vinfo, bst_map, loop_vinfo->reductions[0],
4255 the entry explicitely (but with a NULL SLP node), like some reductions
[all...] |
| tree-vect-slp.cc | 2513 /* Swapping operands for reductions breaks assumptions later on. */
3610 const vec<stmt_vec_info> &reductions local
3611 = as_a <loop_vec_info> (vinfo)->reductions;
3612 scalar_stmts.create (reductions.length ());
3613 for (i = 0; reductions.iterate (i, &next_info); i++)
3712 loop_vinfo->reductions.safe_push (last);
3715 /* Find SLP sequences starting from groups of reductions. */
3716 if (loop_vinfo->reductions.length () > 1)
3717 vect_analyze_slp_instance (vinfo, bst_map, loop_vinfo->reductions[0],
4255 the entry explicitely (but with a NULL SLP node), like some reductions
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| omp-expand.cc | 319 /* Give up for task reductions on the parallel, while it is implementable,
3876 tree reductions = NULL_TREE; local
3894 reductions = OMP_CLAUSE_DECL (c);
3895 gcc_assert (TREE_CODE (reductions) == SSA_NAME);
3896 gimple *g = SSA_NAME_DEF_STMT (reductions);
3897 reductions = gimple_assign_rhs1 (g);
3898 OMP_CLAUSE_DECL (c) = reductions;
3906 reductions = null_pointer_node;
4113 reductions, mem);
4117 reductions, mem)
4865 tree reductions = NULL_TREE; local
5656 tree reductions = NULL_TREE; local
8330 tree reductions = null_pointer_node, mem = null_pointer_node; local
[all...] |
| tree-vect-slp.cc | 2265 /* Swapping operands for reductions breaks assumptions later on. */
3367 const vec<stmt_vec_info> &reductions local
3368 = as_a <loop_vec_info> (vinfo)->reductions;
3369 scalar_stmts.create (reductions.length ());
3370 for (i = 0; reductions.iterate (i, &next_info); i++)
3475 loop_vinfo->reductions.safe_push (last);
3478 /* Find SLP sequences starting from groups of reductions. */
3479 if (loop_vinfo->reductions.length () > 1)
3480 vect_analyze_slp_instance (vinfo, bst_map, loop_vinfo->reductions[0],
3575 the entry explicitely (but with a NULL SLP node), like some reductions
[all...] |
| tree-vectorizer.h | 678 about the reductions that generated them. */
768 auto_vec<stmt_vec_info> reductions; member in class:_loop_vec_info
904 #define LOOP_VINFO_REDUCTIONS(L) (L)->reductions
1282 N scalar reductions in parallel, this variable gives the initial
1283 scalar values of those N reductions. */
1287 N scalar reductions in parallel, this variable gives the vectorized code's
1288 final (scalar) result for each of those N reductions. In other words,
|
| omp-expand.cc | 319 /* Give up for task reductions on the parallel, while it is implementable,
3876 tree reductions = NULL_TREE; local
3894 reductions = OMP_CLAUSE_DECL (c);
3895 gcc_assert (TREE_CODE (reductions) == SSA_NAME);
3896 gimple *g = SSA_NAME_DEF_STMT (reductions);
3897 reductions = gimple_assign_rhs1 (g);
3898 OMP_CLAUSE_DECL (c) = reductions;
3906 reductions = null_pointer_node;
4113 reductions, mem);
4117 reductions, mem)
4865 tree reductions = NULL_TREE; local
5656 tree reductions = NULL_TREE; local
8330 tree reductions = null_pointer_node, mem = null_pointer_node; local
[all...] |
| tree-vect-slp.cc | 2265 /* Swapping operands for reductions breaks assumptions later on. */
3367 const vec<stmt_vec_info> &reductions local
3368 = as_a <loop_vec_info> (vinfo)->reductions;
3369 scalar_stmts.create (reductions.length ());
3370 for (i = 0; reductions.iterate (i, &next_info); i++)
3475 loop_vinfo->reductions.safe_push (last);
3478 /* Find SLP sequences starting from groups of reductions. */
3479 if (loop_vinfo->reductions.length () > 1)
3480 vect_analyze_slp_instance (vinfo, bst_map, loop_vinfo->reductions[0],
3575 the entry explicitely (but with a NULL SLP node), like some reductions
[all...] |
| tree-vectorizer.h | 678 about the reductions that generated them. */
768 auto_vec<stmt_vec_info> reductions; member in class:_loop_vec_info
904 #define LOOP_VINFO_REDUCTIONS(L) (L)->reductions
1282 N scalar reductions in parallel, this variable gives the initial
1283 scalar values of those N reductions. */
1287 N scalar reductions in parallel, this variable gives the vectorized code's
1288 final (scalar) result for each of those N reductions. In other words,
|
