1 // Protocol Buffers - Google's data interchange format
2 // Copyright 2008 Google Inc. All rights reserved.
3 // https://developers.google.com/protocol-buffers/
4 //
5 // Redistribution and use in source and binary forms, with or without
6 // modification, are permitted provided that the following conditions are
7 // met:
8 //
9 // * Redistributions of source code must retain the above copyright
10 // notice, this list of conditions and the following disclaimer.
11 // * Redistributions in binary form must reproduce the above
12 // copyright notice, this list of conditions and the following disclaimer
13 // in the documentation and/or other materials provided with the
14 // distribution.
15 // * Neither the name of Google Inc. nor the names of its
16 // contributors may be used to endorse or promote products derived from
17 // this software without specific prior written permission.
18 //
19 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
23 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
29 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30
31 // Author: kenton@google.com (Kenton Varda)
32 // Based on original Protocol Buffers design by
33 // Sanjay Ghemawat, Jeff Dean, and others.
34
35 #include <google/protobuf/repeated_field.h>
36
37 #include <algorithm>
38
39 #include <google/protobuf/stubs/logging.h>
40 #include <google/protobuf/stubs/common.h>
41 #include <google/protobuf/implicit_weak_message.h>
42
43 #include <google/protobuf/port_def.inc>
44
45 namespace google {
46 namespace protobuf {
47
48 namespace internal {
49
InternalExtend(int extend_amount)50 void** RepeatedPtrFieldBase::InternalExtend(int extend_amount) {
51 int new_size = current_size_ + extend_amount;
52 if (total_size_ >= new_size) {
53 // N.B.: rep_ is non-NULL because extend_amount is always > 0, hence
54 // total_size must be non-zero since it is lower-bounded by new_size.
55 return &rep_->elements[current_size_];
56 }
57 Rep* old_rep = rep_;
58 Arena* arena = GetArena();
59 new_size = std::max(internal::kRepeatedFieldLowerClampLimit,
60 std::max(total_size_ * 2, new_size));
61 GOOGLE_CHECK_LE(new_size, (std::numeric_limits<size_t>::max() - kRepHeaderSize) /
62 sizeof(old_rep->elements[0]))
63 << "Requested size is too large to fit into size_t.";
64 size_t bytes = kRepHeaderSize + sizeof(old_rep->elements[0]) * new_size;
65 if (arena == NULL) {
66 rep_ = reinterpret_cast<Rep*>(::operator new(bytes));
67 } else {
68 rep_ = reinterpret_cast<Rep*>(Arena::CreateArray<char>(arena, bytes));
69 }
70 #if defined(__GXX_DELETE_WITH_SIZE__) || defined(__cpp_sized_deallocation)
71 const int old_total_size = total_size_;
72 #endif
73 total_size_ = new_size;
74 if (old_rep && old_rep->allocated_size > 0) {
75 memcpy(rep_->elements, old_rep->elements,
76 old_rep->allocated_size * sizeof(rep_->elements[0]));
77 rep_->allocated_size = old_rep->allocated_size;
78 } else {
79 rep_->allocated_size = 0;
80 }
81 if (arena == NULL) {
82 #if defined(__GXX_DELETE_WITH_SIZE__) || defined(__cpp_sized_deallocation)
83 const size_t old_size =
84 old_total_size * sizeof(rep_->elements[0]) + kRepHeaderSize;
85 ::operator delete(static_cast<void*>(old_rep), old_size);
86 #else
87 ::operator delete(static_cast<void*>(old_rep));
88 #endif
89 }
90 return &rep_->elements[current_size_];
91 }
92
Reserve(int new_size)93 void RepeatedPtrFieldBase::Reserve(int new_size) {
94 if (new_size > current_size_) {
95 InternalExtend(new_size - current_size_);
96 }
97 }
98
CloseGap(int start,int num)99 void RepeatedPtrFieldBase::CloseGap(int start, int num) {
100 if (rep_ == NULL) return;
101 // Close up a gap of "num" elements starting at offset "start".
102 for (int i = start + num; i < rep_->allocated_size; ++i)
103 rep_->elements[i - num] = rep_->elements[i];
104 current_size_ -= num;
105 rep_->allocated_size -= num;
106 }
107
AddWeak(const MessageLite * prototype)108 MessageLite* RepeatedPtrFieldBase::AddWeak(const MessageLite* prototype) {
109 if (rep_ != NULL && current_size_ < rep_->allocated_size) {
110 return reinterpret_cast<MessageLite*>(rep_->elements[current_size_++]);
111 }
112 if (!rep_ || rep_->allocated_size == total_size_) {
113 Reserve(total_size_ + 1);
114 }
115 ++rep_->allocated_size;
116 MessageLite* result = prototype
117 ? prototype->New(arena_)
118 : Arena::CreateMessage<ImplicitWeakMessage>(arena_);
119 rep_->elements[current_size_++] = result;
120 return result;
121 }
122
123 } // namespace internal
124
125
126 template class PROTOBUF_EXPORT_TEMPLATE_DEFINE RepeatedField<bool>;
127 template class PROTOBUF_EXPORT_TEMPLATE_DEFINE RepeatedField<int32>;
128 template class PROTOBUF_EXPORT_TEMPLATE_DEFINE RepeatedField<uint32>;
129 template class PROTOBUF_EXPORT_TEMPLATE_DEFINE RepeatedField<int64>;
130 template class PROTOBUF_EXPORT_TEMPLATE_DEFINE RepeatedField<uint64>;
131 template class PROTOBUF_EXPORT_TEMPLATE_DEFINE RepeatedField<float>;
132 template class PROTOBUF_EXPORT_TEMPLATE_DEFINE RepeatedField<double>;
133 template class PROTOBUF_EXPORT_TEMPLATE_DEFINE RepeatedPtrField<std::string>;
134
135 } // namespace protobuf
136 } // namespace google
137