1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
|
// Copyright 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "mojo/public/bindings/lib/buffer.h"
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include "mojo/public/bindings/lib/bindings_serialization.h"
#include "mojo/public/environment/buffer_tls.h"
// Scrub memory in debug builds to help catch use-after-free bugs.
#ifdef NDEBUG
#define DEBUG_SCRUB(address, size) (void) (address), (void) (size)
#else
#define DEBUG_SCRUB(address, size) memset(address, 0xCD, size)
#endif
namespace mojo {
//-----------------------------------------------------------------------------
Buffer::Buffer() {
previous_ = internal::SetCurrentBuffer(this);
}
Buffer::~Buffer() {
Buffer* buf MOJO_ALLOW_UNUSED = internal::SetCurrentBuffer(previous_);
assert(buf == this);
}
Buffer* Buffer::current() {
return internal::GetCurrentBuffer();
}
//-----------------------------------------------------------------------------
namespace internal {
ScratchBuffer::ScratchBuffer()
: overflow_(NULL) {
fixed_.next = NULL;
fixed_.cursor = fixed_data_;
fixed_.end = fixed_data_ + kMinSegmentSize;
}
ScratchBuffer::~ScratchBuffer() {
// Invoke destructors in reverse order to mirror allocation order.
std::deque<PendingDestructor>::reverse_iterator it;
for (it = pending_dtors_.rbegin(); it != pending_dtors_.rend(); ++it)
it->func(it->address);
while (overflow_) {
Segment* doomed = overflow_;
overflow_ = overflow_->next;
DEBUG_SCRUB(doomed, doomed->end - reinterpret_cast<char*>(doomed));
free(doomed);
}
DEBUG_SCRUB(fixed_data_, sizeof(fixed_data_));
}
void* ScratchBuffer::Allocate(size_t delta, Destructor func) {
delta = internal::Align(delta);
void* result = AllocateInSegment(&fixed_, delta);
if (!result) {
if (overflow_)
result = AllocateInSegment(overflow_, delta);
if (!result) {
AddOverflowSegment(delta);
result = AllocateInSegment(overflow_, delta);
}
}
if (func) {
PendingDestructor dtor;
dtor.func = func;
dtor.address = result;
pending_dtors_.push_back(dtor);
}
return result;
}
void* ScratchBuffer::AllocateInSegment(Segment* segment, size_t delta) {
void* result;
if (static_cast<size_t>(segment->end - segment->cursor) >= delta) {
result = segment->cursor;
memset(result, 0, delta);
segment->cursor += delta;
} else {
result = NULL;
}
return result;
}
void ScratchBuffer::AddOverflowSegment(size_t delta) {
if (delta < kMinSegmentSize)
delta = kMinSegmentSize;
// Ensure segment buffer is aligned.
size_t segment_size = internal::Align(sizeof(Segment)) + delta;
Segment* segment = static_cast<Segment*>(malloc(segment_size));
segment->next = overflow_;
segment->cursor = reinterpret_cast<char*>(segment + 1);
segment->end = segment->cursor + delta;
overflow_ = segment;
}
//-----------------------------------------------------------------------------
FixedBuffer::FixedBuffer(size_t size)
: ptr_(NULL),
cursor_(0),
size_(internal::Align(size)) {
ptr_ = static_cast<char*>(calloc(size_, 1));
}
FixedBuffer::~FixedBuffer() {
free(ptr_);
}
void* FixedBuffer::Allocate(size_t delta, Destructor dtor) {
assert(!dtor);
delta = internal::Align(delta);
// TODO(darin): Using <assert.h> is probably not going to cut it.
assert(delta > 0);
assert(cursor_ + delta <= size_);
if (cursor_ + delta > size_)
return NULL;
char* result = ptr_ + cursor_;
cursor_ += delta;
return result;
}
void* FixedBuffer::Leak() {
char* ptr = ptr_;
ptr_ = NULL;
cursor_ = 0;
size_ = 0;
return ptr;
}
} // namespace internal
} // namespace mojo
|
