/third_party/icu/icu4c/source/common/ |
H A D | rbbi_cache.h | 181 static inline int32_t modChunkSize(int index) { return index & (CACHE_SIZE - 1); } in modChunkSize() 183 static constexpr int32_t CACHE_SIZE = 128; member in RuleBasedBreakIterator::BreakCache 184 static_assert((CACHE_SIZE & (CACHE_SIZE-1)) == 0, "CACHE_SIZE must be power of two."); 193 int32_t fBoundaries[CACHE_SIZE]; 194 uint16_t fStatuses[CACHE_SIZE];
|
H A D | rbbi_cache.cpp | 322 int32_t probe = (min + max + (min>max ? CACHE_SIZE : 0)) / 2; in seek()
|
/third_party/node/deps/icu-small/source/common/ |
H A D | rbbi_cache.h | 181 static inline int32_t modChunkSize(int index) { return index & (CACHE_SIZE - 1); } in modChunkSize() 183 static constexpr int32_t CACHE_SIZE = 128; member in RuleBasedBreakIterator::BreakCache 184 static_assert((CACHE_SIZE & (CACHE_SIZE-1)) == 0, "CACHE_SIZE must be power of two."); 193 int32_t fBoundaries[CACHE_SIZE]; 194 uint16_t fStatuses[CACHE_SIZE];
|
H A D | rbbi_cache.cpp | 323 int32_t probe = (min + max + (min>max ? CACHE_SIZE : 0)) / 2; in seek()
|
/third_party/skia/third_party/externals/icu/source/common/ |
H A D | rbbi_cache.h | 181 static inline int32_t modChunkSize(int index) { return index & (CACHE_SIZE - 1); } in modChunkSize() 183 static constexpr int32_t CACHE_SIZE = 128; member in RuleBasedBreakIterator::BreakCache 184 static_assert((CACHE_SIZE & (CACHE_SIZE-1)) == 0, "CACHE_SIZE must be power of two."); 193 int32_t fBoundaries[CACHE_SIZE]; 194 uint16_t fStatuses[CACHE_SIZE];
|
H A D | rbbi_cache.cpp | 322 int32_t probe = (min + max + (min>max ? CACHE_SIZE : 0)) / 2; in seek()
|
/third_party/littlefs/runners/ |
H A D | bench_runner.h | 110 #define CACHE_SIZE bench_define(CACHE_SIZE_i) macro 125 BENCH_DEF(CACHE_SIZE, lfs_max(64,lfs_max(READ_SIZE,PROG_SIZE))) \
|
H A D | test_runner.h | 104 #define CACHE_SIZE TEST_DEFINE(CACHE_SIZE_i) macro 120 TEST_DEF(CACHE_SIZE, lfs_max(64,lfs_max(READ_SIZE,PROG_SIZE))) \
|
H A D | test_runner.c | 1347 .cache_size = CACHE_SIZE, in run_powerloss_none() 1423 .cache_size = CACHE_SIZE, in run_powerloss_linear() 1516 .cache_size = CACHE_SIZE, in run_powerloss_log() 1607 .cache_size = CACHE_SIZE, in run_powerloss_cycles() 1796 .cache_size = CACHE_SIZE, in run_powerloss_exhaustive()
|
H A D | bench_runner.c | 1322 .cache_size = CACHE_SIZE, in perm_run()
|
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
H A D | RuleBasedBreakIterator.java | 1828 int probe = (min + max + (min>max ? CACHE_SIZE : 0)) / 2; in seek() 1870 private final int modChunkSize(int index) { return index & (CACHE_SIZE - 1); }; in modChunkSize() 1872 static final int CACHE_SIZE = 128; field in RuleBasedBreakIterator.BreakCache 1873 // static_assert((CACHE_SIZE & (CACHE_SIZE-1)) == 0, "CACHE_SIZE must be power of two."); 1881 int[] fBoundaries = new int[CACHE_SIZE]; 1882 short[] fStatuses = new short[CACHE_SIZE];
|
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/ |
H A D | RuleBasedBreakIterator.java | 1758 int probe = (min + max + (min>max ? CACHE_SIZE : 0)) / 2; in seek() 1800 private final int modChunkSize(int index) { return index & (CACHE_SIZE - 1); }; in modChunkSize() 1802 static final int CACHE_SIZE = 128; field in RuleBasedBreakIterator.BreakCache 1803 // static_assert((CACHE_SIZE & (CACHE_SIZE-1)) == 0, "CACHE_SIZE must be power of two."); 1811 int[] fBoundaries = new int[CACHE_SIZE]; 1812 short[] fStatuses = new short[CACHE_SIZE];
|
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/rbbi/ |
H A D | RBBITest.java | 956 final int CACHE_SIZE = 128; in TestRandomAccess() 958 for (int i=0; i<CACHE_SIZE*2; ++i) { in TestRandomAccess()
|
/third_party/ffmpeg/libavfilter/ |
H A D | vf_paletteuse.c | 65 #define CACHE_SIZE (1<<(4*NBITS)) macro 85 struct cache_node cache[CACHE_SIZE]; /* lookup cache */ 1017 for (i = 0; i < CACHE_SIZE; i++) in load_palette() 1142 for (i = 0; i < CACHE_SIZE; i++) in uninit()
|