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 <algorithm>
36 
37 #include <google/protobuf/repeated_field.h>
38 #include <google/protobuf/stubs/common.h>
39 
40 namespace google {
41 namespace protobuf {
42 
43 namespace internal {
44 
Reserve(int new_size)45 void RepeatedPtrFieldBase::Reserve(int new_size) {
46   if (total_size_ >= new_size) return;
47 
48   void** old_elements = elements_;
49   total_size_ = max(kMinRepeatedFieldAllocationSize,
50                     max(total_size_ * 2, new_size));
51   elements_ = new void*[total_size_];
52   if (old_elements != NULL) {
53     memcpy(elements_, old_elements, allocated_size_ * sizeof(elements_[0]));
54     delete [] old_elements;
55   }
56 }
57 
Swap(RepeatedPtrFieldBase * other)58 void RepeatedPtrFieldBase::Swap(RepeatedPtrFieldBase* other) {
59   if (this == other) return;
60   void** swap_elements       = elements_;
61   int    swap_current_size   = current_size_;
62   int    swap_allocated_size = allocated_size_;
63   int    swap_total_size     = total_size_;
64 
65   elements_       = other->elements_;
66   current_size_   = other->current_size_;
67   allocated_size_ = other->allocated_size_;
68   total_size_     = other->total_size_;
69 
70   other->elements_       = swap_elements;
71   other->current_size_   = swap_current_size;
72   other->allocated_size_ = swap_allocated_size;
73   other->total_size_     = swap_total_size;
74 }
75 
New()76 string* StringTypeHandlerBase::New() {
77   return new string;
78 }
Delete(string * value)79 void StringTypeHandlerBase::Delete(string* value) {
80   delete value;
81 }
82 
83 }  // namespace internal
84 
85 
86 }  // namespace protobuf
87 }  // namespace google
88