Lines Matching refs:InlineRep
444 constexpr unsigned char Cord::InlineRep::kMaxInline;
446 inline void Cord::InlineRep::set_data(const char* data, size_t n, in set_data()
454 inline char* Cord::InlineRep::set_data(size_t n) { in set_data()
461 inline CordRep* Cord::InlineRep::force_tree(size_t extra_hint) { in force_tree()
475 inline void Cord::InlineRep::reduce_size(size_t n) { in reduce_size()
484 inline void Cord::InlineRep::remove_prefix(size_t n) { in remove_prefix()
489 void Cord::InlineRep::AppendTree(CordRep* tree) { in AppendTree()
499 void Cord::InlineRep::PrependTree(CordRep* tree) { in PrependTree()
548 void Cord::InlineRep::GetAppendRegion(char** region, size_t* size, in GetAppendRegion()
581 void Cord::InlineRep::GetAppendRegion(char** region, size_t* size) { in GetAppendRegion()
621 void Cord::InlineRep::AssignSlow(const Cord::InlineRep& src) { in AssignSlow()
630 void Cord::InlineRep::ClearSlow() { in ClearSlow()
646 if (n <= InlineRep::kMaxInline) { in Cord()
661 if (src.size() <= InlineRep::kMaxInline) { in Cord()
702 if (length <= InlineRep::kMaxInline) { in operator =()
735 void Cord::InlineRep::AppendArray(const char* src_data, size_t src_size) { in AppendArray()
871 if (!contents_.is_tree() && cur_size + src.size() <= InlineRep::kMaxInline) { in Prepend()
873 char data[InlineRep::kMaxInline + 1] = {0}; in Prepend()
874 data[InlineRep::kMaxInline] = cur_size + src.size(); // set size in Prepend()
878 InlineRep::kMaxInline + 1); in Prepend()
1071 } else if (new_size <= InlineRep::kMaxInline) { in Subcord()
1083 sub_cord.contents_.data_[InlineRep::kMaxInline] = new_size; in Subcord()
1271 inline absl::string_view Cord::InlineRep::FindFlatStartPiece() const { in FindFlatStartPiece()
1530 if (n <= InlineRep::kMaxInline) { in AdvanceAndReadBytes()