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

  /src/external/lgpl3/gmp/dist/tune/
speed.c 620 int i, fastest, want_data; local
658 fastest = -1;
686 /* Look for the fastest after CMP_DIFFPREV has been applied, but
687 before CMP_RATIO or CMP_DIFFERENCE. There's only a fastest shown
689 if (num_choices > 1 && (fastest == -1 || choice[i].time < fastest_time))
691 fastest = i;
780 i == fastest ? first_open_fastest : first_open_notfastest,
1129 printf ("The fastest routine at each size is marked with a # (free form output only).\n");
  /src/external/lgpl3/gmp/dist/mpn/x86/
copyi.asm 52 C movs in all cases. The fastest MMX found was 0.8 cycles/limb (when
  /src/external/lgpl3/gmp/dist/mpn/powerpc32/
mode1o.asm 58 C the divisor. So the fastest is for instance divisor==1 (inverse==-1), and
  /src/external/bsd/zstd/dist/contrib/largeNbDicts/
largeNbDicts.c 655 fastest = 0, enumerator in enum:__anon8
676 if (metricAggregatePref == fastest)
742 if (metricAggregatePref == fastest)
743 DISPLAY("Fastest Speed : %.1f MB/s \n", speedAggregated);
988 DISPLAY ("-p# : print speed for all rounds 0=fastest 1=median (default: 0) \n");
1029 metricAggregatePref_e metricAggregatePref = fastest;
  /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/
time.d 217 fastest function available will be used, and the resulting $(D SysTime)
  /src/sys/arch/m68k/060sp/dist/
isp.s 480 # now, w/ group1, make mul64's decode the fastest since it will
529 # now, w/ group2, make movep's decode the fastest since it will
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/uni/
package.d 5451 $(P Level 1 is fastest and the most memory hungry (a bit array). )

Completed in 36 milliseconds