Lines Matching refs:child
81 // The new range is entirely within an existing child range.
83 // If the new range's geometry is exactly equal to an existing child
86 // containing child's high address.
94 // Pass the new range on to the child to attempt to store.
105 // If the new range encompasses any existing child ranges, it must do so
125 // Optimization: if the iterators are equal, no child ranges would be
126 // moved. Create the new child range with a NULL map to conserve space
132 // be transferred over to the new range. Create the new child range map
136 // Remove the copied child pointers from this range's map of children.
141 // the new child range contains were formerly children of this range but
143 // to the new child range.
161 // Get an iterator to the child range whose high address is equal to or
164 // contain a child at address, so return false. If the supplied address
165 // is lower than the base address of the child range, then it is not within
166 // the child range, so return false.
171 // The child in iterator->second contains the specified address. Find out
173 // it will set |entry| appropriately. If not, set |entry| to the child.
185 for (MapConstIterator child = map_->begin(); child != end; ++child)
186 delete child->second;
