| /external/chromium/net/base/ |
| host_cache.cc | 28 : max_entries_(max_entries),
72 if (entries_.size() > max_entries_)
96 return max_entries_;
131 if (entries_.size() <= max_entries_)
139 it != entries_.end() && entries_.size() > max_entries_; ) {
148 if (entries_.size() > max_entries_)
|
| host_cache.h | 126 return max_entries_ == 0;
130 size_t max_entries_; member in class:net::HostCache
|
| host_cache_unittest.cc | 215 cache.max_entries_ = 5;
232 cache.max_entries_ = 3;
|
| /external/chromium_org/net/base/ |
| expiring_cache.h | 117 explicit ExpiringCache(size_t max_entries) : max_entries_(max_entries) {}
147 if (entries_.size() == max_entries_ )
168 size_t max_entries() const { return max_entries_; }
188 if (entries_.size() < max_entries_)
193 it != entries_.end() && entries_.size() >= max_entries_;) {
207 size_t max_entries_; member in class:net::ExpiringCache
|
| expiring_cache_unittest.cc | 135 cache.max_entries_ = 6;
152 cache.max_entries_ = 4;
292 cache.max_entries_ = 2;
|
| /dalvik/vm/ |
| IndirectRefTable.cpp | 45 max_entries_ = maxCount;
58 alloc_entries_ = max_entries_ = -1;
70 assert(alloc_entries_ <= max_entries_);
95 if (topIndex == max_entries_) {
97 indirectRefKindToString(kind_), max_entries_);
102 if (newSize > max_entries_) {
103 newSize = max_entries_;
113 alloc_entries_, newSize, max_entries_);
221 assert(alloc_entries_ <= max_entries_);
|
| IndirectRefTable.h | 135 * If "alloc_entries_" is not equal to "max_entries_", the table may expand
261 size_t max_entries_; member in struct:IndirectRefTable
|
| /art/runtime/ |
| indirect_reference_table.cc | 52 max_entries_ = maxCount;
61 alloc_entries_ = max_entries_ = -1;
87 DCHECK_LE(alloc_entries_, max_entries_);
92 if (topIndex == max_entries_) {
94 << "(max=" << max_entries_ << ")\n"
99 if (newSize > max_entries_) {
100 newSize = max_entries_;
111 << ", max=" << max_entries_ << ")\n"
225 DCHECK_LE(alloc_entries_, max_entries_);
|
| indirect_reference_table.h | 147 * If "alloc_entries_" is not equal to "max_entries_", the table may expand
374 size_t max_entries_; member in class:art::IndirectReferenceTable
|
| /external/chromium_org/net/quic/crypto/ |
| strike_register.cc | 68 : max_entries_(max_entries),
101 for (unsigned i = 0; i < max_entries_ - 1; i++)
103 internal_nodes_[max_entries_ - 1].SetNextPtr(kNil);
107 for (unsigned i = 0; i < max_entries_ - 1; i++)
109 external_node_next_ptr(max_entries_ - 1) = kNil;
168 // max_entries_ >= 2. Also, we know that it doesn't match because, if it
255 CHECK_LT(i, max_entries_);
263 CHECK_LT(i, max_entries_);
397 CHECK_LT(internal_node, max_entries_);
|
| strike_register.h | 165 const uint32 max_entries_; member in class:net::StrikeRegister
|
| strike_register_test.cc | 147 : max_entries_(max_entries),
189 if (nonces_.size() == max_entries_) {
234 const unsigned max_entries_; member in class:__anon11317::SlowStrikeRegister
|
