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

  /external/chromium/chrome/browser/safe_browsing/
safe_browsing_util.h 78 bool empty() const { return chunks_.empty(); }
79 size_t size() { return chunks_.size(); }
81 void push_back(const SBChunk& chunk) { chunks_.push_back(chunk); }
82 SBChunk& back() { return chunks_.back(); }
83 SBChunk& front() { return chunks_.front(); }
84 const SBChunk& front() const { return chunks_.front(); }
87 const_iterator begin() const { return chunks_.begin(); }
88 const_iterator end() const { return chunks_.end(); }
91 iterator begin() { return chunks_.begin(); }
92 iterator end() { return chunks_.end();
101 std::vector<SBChunk> chunks_; member in class:SBChunkList
    [all...]
safe_browsing_util.cc 49 for (std::vector<SBChunk>::iterator citer = chunks_.begin();
50 citer != chunks_.end(); ++citer) {
59 chunks_.clear();
  /external/chromium/chrome/common/net/
test_url_fetcher_factory.h 72 const std::list<std::string>& upload_chunks() const { return chunks_; }
80 std::list<std::string> chunks_; member in class:TestURLFetcher
test_url_fetcher_factory.cc 30 chunks_.push_back(data);
  /external/v8/src/
spaces-inl.h 322 ChunkInfo& c = chunks_[chunk_id];
338 ChunkInfo& c = chunks_[chunk_id];
369 return chunks_[chunk_id].owner();
397 OS::Protect(chunks_[id].address(), chunks_[id].size());
403 OS::Unprotect(chunks_[id].address(), chunks_[id].size(),
404 chunks_[id].owner()->executable() == EXECUTABLE);
utils.h 499 for (int i = chunks_.length() - 1; i >= 0; i--) {
500 chunks_.at(i).Dispose();
555 for (int i = 0; i < chunks_.length(); i++) {
556 Vector<T> chunk = chunks_.at(i);
580 for (int i = chunks_.length() - 1; i >= 0; i--) {
581 chunks_.at(i).Dispose();
583 chunks_.Rewind(0);
593 List<Vector<T> > chunks_;
598 // Creates a new current chunk, and stores the old chunk in the chunks_ list.
612 chunks_.Add(current_chunk_.SubVector(0, index_))
    [all...]
spaces.cc 289 chunks_(kEstimatedNumberOfChunks),
314 // Over-estimate the size of chunks_ array. It assumes the expansion of old
331 chunks_.Add(info);
341 if (chunks_[i].address() != NULL) DeleteChunk(i);
343 chunks_.Clear();
516 chunks_[chunk_id].init(static_cast<Address>(chunk), chunk_size, owner);
546 chunks_[chunk_id].init(start, size, owner);
594 Address chunk_start = chunks_[chunk_id].address();
599 size_t chunk_size = chunks_[chunk_id].size();
658 for (int i = 0, length = chunks_.length(); i < length; i++)
    [all...]
spaces.h 736 // Chunks_, free_chunk_ids_ and top_ act as a stack of free chunk ids.
737 List<ChunkInfo> chunks_; member in class:v8::internal::MemoryAllocator
    [all...]

Completed in 1308 milliseconds