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

  /src/external/gpl3/gcc/dist/gcc/
tree-data-ref.cc 1848 /* Deal with two ddrs (dr_a1, dr_b1) and (dr_a2, dr_b2). */
1852 dr_with_seg_len *dr_a1 = &alias_pair1->first;
1858 if (*dr_a1 == *dr_a2 && *dr_b1 == *dr_b2)
1862 DR_REF (dr_a1->dr), DR_REF (dr_b1->dr),
1874 if (*dr_a1 == *dr_a2 || *dr_b1 == *dr_b2)
1877 and DR_A1 and DR_A2 are two consecutive memrefs. */
1878 if (*dr_a1 == *dr_a2)
1880 std::swap (dr_a1, dr_b1);
1886 DR_A1 and the initial DR_A2 is known at compile time. */
1887 if (!operand_equal_p (DR_BASE_ADDRESS (dr_a1->dr)
1851 dr_with_seg_len *dr_a1 = &alias_pair1->first; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-data-ref.cc 1835 /* Deal with two ddrs (dr_a1, dr_b1) and (dr_a2, dr_b2). */
1839 dr_with_seg_len *dr_a1 = &alias_pair1->first;
1845 if (*dr_a1 == *dr_a2 && *dr_b1 == *dr_b2)
1849 DR_REF (dr_a1->dr), DR_REF (dr_b1->dr),
1861 if (*dr_a1 == *dr_a2 || *dr_b1 == *dr_b2)
1864 and DR_A1 and DR_A2 are two consecutive memrefs. */
1865 if (*dr_a1 == *dr_a2)
1867 std::swap (dr_a1, dr_b1);
1873 DR_A1 and the initial DR_A2 is known at compile time. */
1874 if (!operand_equal_p (DR_BASE_ADDRESS (dr_a1->dr)
1838 dr_with_seg_len *dr_a1 = &alias_pair1->first; local
    [all...]

Completed in 20 milliseconds