HomeSort by: relevance | last modified time | path
    Searched defs:access2 (Results 1 - 4 of 4) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/rtl-ssa/
accesses.cc 1479 // Return true if ACCESS1 can represent ACCESS2 and if ACCESS2 can
1482 can_merge_accesses (access_info *access1, access_info *access2)
1484 if (access1 == access2)
1488 auto *use2 = dyn_cast<use_info *> (access2);
1514 access_info *access2 = *i2; local
1517 unsigned int regno2 = access2->regno ();
1520 if (!can_merge_accesses (access1, access2))
1534 builder.quick_push (access2);
1559 access_info *access2 = *i2 local
1634 access_info *access2 = *i2; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/rtl-ssa/
accesses.cc 1393 // Return true if ACCESS1 can represent ACCESS2 and if ACCESS2 can
1396 can_merge_accesses (access_info *access1, access_info *access2)
1398 if (access1 == access2)
1402 auto *use2 = dyn_cast<use_info *> (access2);
1428 access_info *access2 = *i2; local
1431 unsigned int regno2 = access2->regno ();
1434 if (!can_merge_accesses (access1, access2))
1448 builder.quick_push (access2);
1473 access_info *access2 = *i2 local
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
tree-data-ref.cc 2172 tree access2 = DR_ACCESS_FN (dr_b.dr, i);
2176 || TREE_CODE (access2) != POLYNOMIAL_CHREC
2178 || CHREC_VARIABLE (access2) != (unsigned)loop->num)
2180 if (operand_equal_p (access1, access2, 0))
2197 tree access2 = DR_ACCESS_FN (dr_b.dr, found);
2198 if (!operand_equal_p (CHREC_RIGHT (access1), CHREC_RIGHT (access2), 0))
2208 tree min2 = CHREC_LEFT (access2);
2196 tree access2 = DR_ACCESS_FN (dr_b.dr, found); variable
  /src/external/gpl3/gcc.old/dist/gcc/
tree-data-ref.cc 2159 tree access2 = DR_ACCESS_FN (dr_b.dr, i);
2163 || TREE_CODE (access2) != POLYNOMIAL_CHREC
2165 || CHREC_VARIABLE (access2) != (unsigned)loop->num)
2167 if (operand_equal_p (access1, access2, 0))
2184 tree access2 = DR_ACCESS_FN (dr_b.dr, found);
2185 if (!operand_equal_p (CHREC_RIGHT (access1), CHREC_RIGHT (access2), 0))
2195 tree min2 = CHREC_LEFT (access2);
2183 tree access2 = DR_ACCESS_FN (dr_b.dr, found); variable

Completed in 81 milliseconds