| /dports/devel/avr-gdb/gdb-7.3.1/gdb/ |
| H A D | valarith.c | 1403 LONGEST low_bound1, high_bound1, low_bound2, high_bound2; in vector_binop() local
1416 if (!get_array_bounds (type1, &low_bound1, &high_bound1) in vector_binop()
1427 || low_bound1 != low_bound2 || high_bound1 != high_bound2) in vector_binop()
1432 for (i = 0; i < high_bound1 - low_bound1 + 1; i++) in vector_binop()
|
| /dports/devel/gdb761/gdb-7.6.1/gdb/ |
| H A D | valarith.c | 1400 LONGEST low_bound1, high_bound1, low_bound2, high_bound2; in vector_binop() local
1413 if (!get_array_bounds (type1, &low_bound1, &high_bound1) in vector_binop()
1424 || low_bound1 != low_bound2 || high_bound1 != high_bound2) in vector_binop()
1429 for (i = 0; i < high_bound1 - low_bound1 + 1; i++) in vector_binop()
|
| /dports/devel/gdb/gdb-11.1/gdb/ |
| H A D | valarith.c | 1577 LONGEST low_bound1, high_bound1, low_bound2, high_bound2; in vector_binop() local
1590 if (!get_array_bounds (type1, &low_bound1, &high_bound1) in vector_binop()
1601 || low_bound1 != low_bound2 || high_bound1 != high_bound2) in vector_binop()
1606 for (i = 0; i < high_bound1 - low_bound1 + 1; i++) in vector_binop()
|
| /dports/lang/gcc10/gcc-10.3.0/gcc/ |
| H A D | tree-ssa-alias.c | 1344 tree low_bound1 = cheap_array_ref_low_bound(ref1); in nonoverlapping_array_refs_p() local
1349 if (operand_equal_p (index1, low_bound1, 0) in nonoverlapping_array_refs_p()
1384 if (!operand_equal_p (low_bound1, low_bound2, 0)) in nonoverlapping_array_refs_p()
|
| /dports/devel/avr-gcc/gcc-10.2.0/gcc/ |
| H A D | tree-ssa-alias.c | 1344 tree low_bound1 = cheap_array_ref_low_bound(ref1); in nonoverlapping_array_refs_p() local
1349 if (operand_equal_p (index1, low_bound1, 0) in nonoverlapping_array_refs_p()
1384 if (!operand_equal_p (low_bound1, low_bound2, 0)) in nonoverlapping_array_refs_p()
|
| /dports/lang/gcc10-devel/gcc-10-20211008/gcc/ |
| H A D | tree-ssa-alias.c | 1344 tree low_bound1 = cheap_array_ref_low_bound(ref1); in nonoverlapping_array_refs_p() local
1349 if (operand_equal_p (index1, low_bound1, 0) in nonoverlapping_array_refs_p()
1384 if (!operand_equal_p (low_bound1, low_bound2, 0)) in nonoverlapping_array_refs_p()
|
| /dports/lang/gcc12-devel/gcc-12-20211205/gcc/ |
| H A D | tree-ssa-alias.c | 1460 tree low_bound1 = cheap_array_ref_low_bound (ref1); in nonoverlapping_array_refs_p() local
1465 if (operand_equal_p (index1, low_bound1, 0) in nonoverlapping_array_refs_p()
1500 if (!operand_equal_p (low_bound1, low_bound2, 0)) in nonoverlapping_array_refs_p()
|
| /dports/lang/gcc11-devel/gcc-11-20211009/gcc/ |
| H A D | tree-ssa-alias.c | 1440 tree low_bound1 = cheap_array_ref_low_bound (ref1); in nonoverlapping_array_refs_p() local
1445 if (operand_equal_p (index1, low_bound1, 0) in nonoverlapping_array_refs_p()
1480 if (!operand_equal_p (low_bound1, low_bound2, 0)) in nonoverlapping_array_refs_p()
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/ |
| H A D | tree-ssa-alias.c | 1440 tree low_bound1 = cheap_array_ref_low_bound (ref1); in nonoverlapping_array_refs_p() local
1445 if (operand_equal_p (index1, low_bound1, 0) in nonoverlapping_array_refs_p()
1480 if (!operand_equal_p (low_bound1, low_bound2, 0)) in nonoverlapping_array_refs_p()
|
| /dports/lang/gcc11/gcc-11.2.0/gcc/ |
| H A D | tree-ssa-alias.c | 1440 tree low_bound1 = cheap_array_ref_low_bound (ref1); in nonoverlapping_array_refs_p() local
1445 if (operand_equal_p (index1, low_bound1, 0) in nonoverlapping_array_refs_p()
1480 if (!operand_equal_p (low_bound1, low_bound2, 0)) in nonoverlapping_array_refs_p()
|