| /external/libchrome/base/metrics/ |
| D | histogram_macros_unittest.cc | 32 MAX_ENTRIES, in TEST() enumerator
35 MAX_ENTRIES); in TEST()
51 MAX_ENTRIES, in TEST() enumerator
54 TestEnum2::MAX_ENTRIES); in TEST()
|
| /external/jackson-core/src/main/java/com/fasterxml/jackson/core/util/ |
| D | InternCache.java | 27 private final static int MAX_ENTRIES = 180; field in InternCache
38 private InternCache() { super(MAX_ENTRIES, 0.8f, 4); } in InternCache()
49 if (size() >= MAX_ENTRIES) { in intern()
55 if (size() >= MAX_ENTRIES) { in intern()
|
| /external/aac/libFDK/include/ |
| D | nlc_dec.h | 162 #define MAX_ENTRIES 168 macro
163 #define HANDLE_HUFF_NODE const SHORT(*)[MAX_ENTRIES][2]
|
| /external/linux-kselftest/tools/testing/selftests/bpf/verifier/ |
| D | array_access.c | 49 BPF_JMP_IMM(BPF_JGE, BPF_REG_1, MAX_ENTRIES, 3),
73 BPF_MOV32_IMM(BPF_REG_2, MAX_ENTRIES),
96 BPF_ST_MEM(BPF_DW, BPF_REG_0, (MAX_ENTRIES + 1) << 2,
113 BPF_MOV64_IMM(BPF_REG_1, MAX_ENTRIES + 1),
154 BPF_MOV32_IMM(BPF_REG_2, MAX_ENTRIES),
179 BPF_MOV32_IMM(BPF_REG_2, MAX_ENTRIES + 1),
|
| D | value.c | 63 BPF_JMP_IMM(BPF_JGE, BPF_REG_1, MAX_ENTRIES, 9),
|
| D | search_pruning.c | 68 BPF_MOV32_IMM(BPF_REG_2, MAX_ENTRIES),
|
| D | value_or_null.c | 139 BPF_JMP_IMM(BPF_JGE, BPF_REG_1, MAX_ENTRIES-1, 1),
|
| /external/iproute2/lib/ |
| D | names.c | 19 #define MAX_ENTRIES 256 macro
61 db->size = MAX_ENTRIES; in db_names_alloc()
|
| /external/aac/libFDK/src/ |
| D | nlc_dec.cpp | 230 const SHORT (*nodeTab)[MAX_ENTRIES][2], in huff_read()
248 const SHORT (*nodeTab)[MAX_ENTRIES][2], in huff_read_2D()
319 const SHORT(*partTab)[MAX_ENTRIES][2] = NULL; in huff_dec_1D()
320 const SHORT(*nodeTab)[MAX_ENTRIES][2] = NULL; in huff_dec_1D()
399 const SHORT(*nodeTab)[MAX_ENTRIES][2] = NULL; in huff_dec_2D()
|
| /external/skqp/src/utils/ |
| D | SkShadowUtils.cpp | 207 template <typename FACTORY, int MAX_ENTRIES>
214 for (int i = 0; i < MAX_ENTRIES; ++i) { in find()
240 if (fCount < MAX_ENTRIES) { in add()
243 i = fRandom.nextULessThan(MAX_ENTRIES); in add()
259 Entry fEntries[MAX_ENTRIES];
|
| /external/skia/src/utils/ |
| D | SkShadowUtils.cpp | 241 template <typename FACTORY, int MAX_ENTRIES>
248 for (int i = 0; i < MAX_ENTRIES; ++i) { in find()
274 if (fCount < MAX_ENTRIES) { in add()
277 i = fRandom.nextULessThan(MAX_ENTRIES); in add()
293 Entry fEntries[MAX_ENTRIES];
|
| /external/jackson-databind/src/main/java/com/fasterxml/jackson/databind/ser/impl/ |
| D | PropertySerializerMap.java | 332 private final static int MAX_ENTRIES = 8; field in PropertySerializerMap.Multi
380 if (len == MAX_ENTRIES) { in newWith()
|
| /external/grpc-grpc-java/core/src/main/java/io/grpc/util/ |
| D | RoundRobinLoadBalancerFactory.java | 331 static final int MAX_ENTRIES = 1000; field in RoundRobinLoadBalancerFactory.RoundRobinLoadBalancer.StickinessState
376 while (stickinessMap.size() >= MAX_ENTRIES && (oldValue = evictionQueue.poll()) != null) { in addToEvictionQueue()
|
| /external/antlr/runtime/ObjC/Framework/ |
| D | LinkedHashMap.m | 479 * private static final NSInteger MAX_ENTRIES = 100;
482 * return count() > MAX_ENTRIES;
|
| /external/linux-kselftest/tools/testing/selftests/bpf/ |
| D | test_verifier.c | 121 #define MAX_ENTRIES 11 macro
125 int foo[MAX_ENTRIES];
|