HomeSort by: relevance | last modified time | path
    Searched refs:rep1 (Results 1 - 13 of 13) sorted by relevancy

  /src/external/gpl3/gdb.old/dist/gdb/
m2-lang.c 178 unsigned int rep1;
190 rep1 = i + 1;
192 while (rep1 < length && string[rep1] == string[i])
194 ++rep1;
207 i = rep1 - 1;
177 unsigned int rep1; local
ada-valprint.c 466 unsigned int rep1;
478 rep1 = i + 1;
480 while (rep1 < length
481 && char_at (string, rep1, type_len, byte_order)
484 rep1 += 1;
501 i = rep1 - 1;
465 unsigned int rep1; local
valprint.c 2021 unsigned int rep1;
2083 rep1 = i + 1;
2092 while (rep1 < len)
2100 rep1 * bit_stride,
2110 ++rep1;
2124 i = rep1 - 1;
2020 unsigned int rep1; local
  /src/external/gpl3/gdb/dist/gdb/
m2-lang.c 178 unsigned int rep1;
190 rep1 = i + 1;
192 while (rep1 < length && string[rep1] == string[i])
194 ++rep1;
207 i = rep1 - 1;
177 unsigned int rep1; local
ada-valprint.c 466 unsigned int rep1;
478 rep1 = i + 1;
480 while (rep1 < length
481 && char_at (string, rep1, type_len, byte_order)
484 rep1 += 1;
501 i = rep1 - 1;
465 unsigned int rep1; local
valprint.c 2021 unsigned int rep1;
2083 rep1 = i + 1;
2092 while (rep1 < len)
2100 rep1 * bit_stride,
2110 ++rep1;
2124 i = rep1 - 1;
2020 unsigned int rep1; local
  /src/external/public-domain/xz/dist/src/liblzma/lzma/
lzma_decoder.c 124 /// If 0, distance of a repeated match is rep1.
165 uint32_t rep1; ///< Distance of second latest match member in struct:__anon398
269 uint32_t rep1 = coder->rep1; local
417 rep2 = rep1;
418 rep1 = rep0;
544 // available as rep0, rep1, rep2 and rep3. We will
583 // The distance is rep1, rep2 or rep3. Once
585 // is stored to rep0 and rep1, rep2 and rep3
590 // The distance is rep1
    [all...]
  /src/external/gpl3/gcc/dist/contrib/
bench-stringop 86 test "$2" "$3" "-mstringop-strategy=rep_byte -malign-stringops" rep1
114 echo " block size libcall rep1 noalg rep4 noalg rep8 noalg loop noalg unrl noalg sse noalg byte PGO dynamic BEST"
116 echo " block size libcall rep1 noalg rep4 noalg loop noalg unrl noalg sse noalg byte PGO dynamic BEST"
  /src/external/gpl3/gcc.old/dist/contrib/
bench-stringop 86 test "$2" "$3" "-mstringop-strategy=rep_byte -malign-stringops" rep1
114 echo " block size libcall rep1 noalg rep4 noalg rep8 noalg loop noalg unrl noalg sse noalg byte PGO dynamic BEST"
116 echo " block size libcall rep1 noalg rep4 noalg loop noalg unrl noalg sse noalg byte PGO dynamic BEST"
  /src/external/gpl3/gcc/dist/gcc/config/aarch64/
aarch64-early-ra.cc 2422 // REP1 and REP2 are color representatives. Change REP1's color representative
2423 // to REP2, with REP1 starting at allocno offset REP2_OFFSET into REP2.
2425 early_ra::set_color_rep (allocno_group_info *rep1, allocno_group_info *rep2,
2428 gcc_checking_assert (rep1 != rep2
2430 && multiple_p (rep1->stride, rep2->stride));
2432 auto heads1 = rep1->chain_heads ();
2437 unsigned int i2 = rep2_offset + i1 * rep1->stride / rep2->stride;
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/regex/
package.d 1485 auto rep1 = replaceFirst!(cap => cap[0][0]~"o".to!S()~cap[0][1..$])(s1, re1);
1486 assert(rep1 == t1F);
  /src/external/gpl3/gcc/dist/gcc/analyzer/
constraint-manager.cc 2992 const svalue *rep1 = ec1->get_representative (); local
2995 gcc_assert (rep1);
2998 return svalue::cmp_ptr (rep1, rep2);
  /src/external/gpl3/gcc.old/dist/gcc/analyzer/
constraint-manager.cc 2781 const svalue *rep1 = ec1->get_representative (); local
2784 gcc_assert (rep1);
2787 return svalue::cmp_ptr (rep1, rep2);

Completed in 42 milliseconds