HomeSort by relevance Sort by last modified time
    Searched refs:NNN (Results 1 - 7 of 7) sorted by null

  /external/valgrind/main/VEX/test/
rounderr.c 37 #define NNN 1000
71 const size_t nacc2 = NNN+1;
72 double numacc2[NNN+1] ;
76 for (i = 1 ; i < NNN; i += 2)
79 for (i = 1 ; i < NNN; i += 2)
  /external/valgrind/main/memcheck/tests/
sh-mem.c 125 // (NNN = 1, 2, 4 or 8), with varying alignments, of values with
134 #define DO(NNN, Ty, ITy, isF4) \
135 fprintf(stderr, "-- NNN: %d %s %s ------------------------\n", \
136 NNN, #Ty, #ITy); \
137 /* For all of the alignments from (0..NNN-1), eg. if NNN==4, we do */ \
139 for (h = 0; h < NNN; h++) { \
148 fprintf(stderr, "h = %d (checking %d..%d) ", h, h, (int)(n-NNN+h)); \
153 U8 tmp = build(NNN, j); \
161 (void)VALGRIND_MAKE_MEM_DEFINED(&undefN_ITyDef, NNN); \
    [all...]
atomic_incs.c 21 #define NNN 3456987
708 for (i = 0; i < NNN; i++) {
723 for (i = 0; i < NNN; i++) {
  /external/llvm/utils/TableGen/
X86ModRMFilters.h 88 /// mod field [bits 7-6] and the value of the nnn field [bits 5-3].
92 uint8_t NNN;
98 /// \param nnn The required value of the nnn field.
99 ExtendedFilter(bool r, uint8_t nnn) :
102 NNN(nnn) {
108 (((modRM & 0x38) >> 3) == NNN));
  /external/valgrind/main/helgrind/tests/
annotate_hbefore.c 302 #define NNN 1000000
308 for (i = 0; i < NNN; i++)
  /frameworks/base/services/core/java/com/android/server/
AlarmManagerService.java     [all...]
  /cts/suite/cts/deviceTests/browserbench/assets/octane/
pdfjs.js     [all...]

Completed in 1266 milliseconds