1// Protocol Buffers - Google's data interchange format
2// Copyright 2008 Google Inc.  All rights reserved.
3// http://code.google.com/p/protobuf/
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#include <google/protobuf/stubs/common.h>
37
38namespace google {
39namespace protobuf {
40namespace internal {
41
42void RepeatedPtrFieldBase::Reserve(int new_size) {
43  if (total_size_ >= new_size) return;
44
45  void** old_elements = elements_;
46  total_size_ = max(total_size_ * 2, new_size);
47  elements_ = new void*[total_size_];
48  memcpy(elements_, old_elements, allocated_size_ * sizeof(elements_[0]));
49  if (old_elements != initial_space_) {
50    delete [] old_elements;
51  }
52}
53
54void RepeatedPtrFieldBase::Swap(RepeatedPtrFieldBase* other) {
55  void** swap_elements       = elements_;
56  int    swap_current_size   = current_size_;
57  int    swap_allocated_size = allocated_size_;
58  int    swap_total_size     = total_size_;
59  // We may not be using initial_space_ but it's not worth checking.  Just
60  // copy it anyway.
61  void* swap_initial_space[kInitialSize];
62  memcpy(swap_initial_space, initial_space_, sizeof(initial_space_));
63
64  elements_       = other->elements_;
65  current_size_   = other->current_size_;
66  allocated_size_ = other->allocated_size_;
67  total_size_     = other->total_size_;
68  memcpy(initial_space_, other->initial_space_, sizeof(initial_space_));
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  memcpy(other->initial_space_, swap_initial_space, sizeof(swap_initial_space));
75
76  if (elements_ == other->initial_space_) {
77    elements_ = initial_space_;
78  }
79  if (other->elements_ == initial_space_) {
80    other->elements_ = other->initial_space_;
81  }
82}
83
84string* StringTypeHandlerBase::New() {
85  return new string;
86}
87void StringTypeHandlerBase::Delete(string* value) {
88  delete value;
89}
90
91
92} // namespace internal
93
94}  // namespace protobuf
95}  // namespace google
96