Lines Matching full:child
26 // Convert global offset to child index.
31 // Convert global offset to offset in child entry.
36 // Returns a name for a child entry given the base_name of the parent and the
38 // If the entry is called entry_name, child entries will be named something
39 // like Range_entry_name:YYY where YYY is the number of the particular child.
83 // If this is a parent entry, we need to doom all the child entries.
97 // If this is a child entry, detach it from the parent.
107 // counting to child entry.
118 // A child entry is always not in use. The consequence is that a child entry
150 // A child entry doesn't have key so this method should not be called.
352 MemEntryImpl* child = OpenChild(offset + io_buf->BytesConsumed(), false);
354 // No child present for that offset.
355 if (!child)
358 // We then need to prepare the child offset and len.
361 // If we are trying to read from a position that the child entry has no data
363 if (child_offset < child->child_first_pos_)
369 child->net_log().source(),
372 int ret = child->ReadData(kSparseData, child_offset, io_buf,
385 // Increment the counter by number of bytes read in the child entry.
407 // This loop walks through child entries continuously starting from |offset|
409 // child entry until all |buf_len| bytes are written. The write operation can
412 MemEntryImpl* child = OpenChild(offset + io_buf->BytesConsumed(), true);
416 // write and remaining capacity of this child entry.
420 // Keep a record of the last byte position (exclusive) in the child.
421 int data_size = child->GetDataSize(kSparseData);
427 child->net_log().source(),
431 // Always writes to the child entry. This operation may overwrite data
435 int ret = child->WriteData(kSparseData, child_offset, io_buf, write_len,
446 // Keep a record of the first byte position in the child if the write was
450 child->child_first_pos_ = child_offset;
473 // Find the first child and record the number of empty bytes.
484 // Number of bytes available in this child.
495 // If the next child is discontinuous, break the loop.
580 MemEntryImpl* child = new MemEntryImpl(backend_);
581 child->InitChildEntry(this, index, net_log_.net_log());
582 (*children_)[index] = child;
583 return child;
588 int MemEntryImpl::FindNextChild(int64 offset, int len, MemEntryImpl** child) {
589 DCHECK(child);
590 *child = NULL;
593 // This loop tries to find the first existing child.
595 // This points to the current offset in the child.
602 // to take care of the filled region and the current offset in the child.
606 // filled region, we have found the first child.
608 *child = current_child;
