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

  /external/chromium_org/net/spdy/
hpack_header_table.cc 54 if (index < dynamic_entries_.size()) {
55 return &dynamic_entries_[index];
131 *begin_out = dynamic_entries_.end() - eviction_count;
132 *end_out = dynamic_entries_.end();
149 for (EntryTable::const_reverse_iterator it = dynamic_entries_.rbegin();
150 it != dynamic_entries_.rend() && reclaim_size != 0; ++it, ++count) {
158 CHECK(!dynamic_entries_.empty());
159 HpackEntry* entry = &dynamic_entries_.back();
163 dynamic_entries_.pop_back();
174 DCHECK(dynamic_entries_.empty())
    [all...]
hpack_header_table.h 111 EntryTable dynamic_entries_; member in class:net::HpackHeaderTable
hpack_header_table_test.cc 32 return table_->dynamic_entries_;
53 return table_->dynamic_entries_.size();
66 table_->dynamic_entries_.push_back(
hpack_encoder_test.cc 27 return &table_->dynamic_entries_;
  /external/chromium_org/components/crash/app/
crash_keys_win.h 69 DynamicEntriesMap dynamic_entries_; // Under lock_. member in class:breakpad::CrashKeysWin
crash_keys_win.cc 168 DynamicEntriesMap::iterator it = dynamic_entries_.find(safe_key);
170 if (it == dynamic_entries_.end()) {
171 if (dynamic_entries_.size() >= kMaxDynamicEntries)
174 dynamic_entries_.insert(std::make_pair(safe_key, entry));
186 DynamicEntriesMap::iterator it = dynamic_entries_.find(key_string);
187 if (it == dynamic_entries_.end())

Completed in 905 milliseconds