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

  /src/external/gpl3/gcc/dist/gcc/
tree-data-ref.cc 2222 poly_offset_int idx_len1 = abs_idx_step * niter_len1;
2227 gcc_assert (known_ge (idx_len1, 0)
2277 i.e. limit = idx_len1 + idx_access1 - 1 + idx_len2 + idx_access2 - 1
2313 low_offset1' = +ve step ? 0 : -(idx_len1 - |idx_step|)
2314 high_offset1' = +ve_step ? idx_len1 - |idx_step| : 0. */
2316 idx_len1 -= abs_idx_step;
2318 poly_offset_int limit = idx_len1 + idx_access1 - 1 + idx_access2 - 1;
2326 poly_offset_int low_offset1 = neg_step ? -idx_len1 : 0;
2221 poly_offset_int idx_len1 = abs_idx_step * niter_len1; variable
  /src/external/gpl3/gcc.old/dist/gcc/
tree-data-ref.cc 2209 poly_offset_int idx_len1 = abs_idx_step * niter_len1;
2214 gcc_assert (known_ge (idx_len1, 0)
2264 i.e. limit = idx_len1 + idx_access1 - 1 + idx_len2 + idx_access2 - 1
2300 low_offset1' = +ve step ? 0 : -(idx_len1 - |idx_step|)
2301 high_offset1' = +ve_step ? idx_len1 - |idx_step| : 0. */
2303 idx_len1 -= abs_idx_step;
2305 poly_offset_int limit = idx_len1 + idx_access1 - 1 + idx_access2 - 1;
2313 poly_offset_int low_offset1 = neg_step ? -idx_len1 : 0;
2208 poly_offset_int idx_len1 = abs_idx_step * niter_len1; variable

Completed in 551 milliseconds