1 /* libs/opengles/Tokenizer.cpp
3 ** Copyright 2006, The Android Open Source Project
5 ** Licensed under the Apache License, Version 2.0 (the "License");
6 ** you may not use this file except in compliance with the License.
7 ** You may obtain a copy of the License at
9 ** http://www.apache.org/licenses/LICENSE-2.0
11 ** Unless required by applicable law or agreed to in writing, software
12 ** distributed under the License is distributed on an "AS IS" BASIS,
13 ** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14 ** See the License for the specific language governing permissions and
15 ** limitations under the License.
20 #include "Tokenizer.h"
22 // ----------------------------------------------------------------------------
26 ANDROID_BASIC_TYPES_TRAITS(Tokenizer::run_t)
28 Tokenizer::Tokenizer()
32 Tokenizer::Tokenizer(const Tokenizer& other)
33 : mRanges(other.mRanges)
37 Tokenizer::~Tokenizer()
41 uint32_t Tokenizer::acquire()
43 if (!mRanges.size() || mRanges[0].first) {
48 // just extend the first run
49 const run_t& run = mRanges[0];
50 uint32_t token = run.first + run.length;
51 _insertTokenAt(token, 1);
55 bool Tokenizer::isAcquired(uint32_t token) const
57 return (_indexOrderOf(token) >= 0);
60 status_t Tokenizer::reserve(uint32_t token)
63 const ssize_t i = _indexOrderOf(token, &o);
65 return BAD_VALUE; // this token is already taken
67 ssize_t err = _insertTokenAt(token, o);
68 return (err<0) ? err : status_t(NO_ERROR);
71 status_t Tokenizer::release(uint32_t token)
73 const ssize_t i = _indexOrderOf(token);
75 const run_t& run = mRanges[i];
76 if ((token >= run.first) && (token < run.first+run.length)) {
77 // token in this range, we need to split
78 run_t& run = mRanges.editItemAt(i);
79 if ((token == run.first) || (token == run.first+run.length-1)) {
80 if (token == run.first) {
84 if (run.length == 0) {
85 // XXX: should we systematically remove a run that's empty?
86 mRanges.removeItemsAt(i);
91 new_run.first = token+1;
92 new_run.length = run.first+run.length - new_run.first;
93 run.length = token - run.first;
94 mRanges.insertAt(new_run, i+1);
99 return NAME_NOT_FOUND;
102 ssize_t Tokenizer::_indexOrderOf(uint32_t token, size_t* order) const
105 ssize_t err = NAME_NOT_FOUND;
107 ssize_t h = mRanges.size()-1;
109 const run_t* a = mRanges.array();
112 const run_t* const curr = a + mid;
114 if (token < curr->first) c = 1;
115 else if (token >= curr->first+curr->length) c = -1;
125 if (order) *order = l;
129 ssize_t Tokenizer::_insertTokenAt(uint32_t token, size_t index)
131 const size_t c = mRanges.size();
134 // do we need to merge with the previous run?
135 run_t& p = mRanges.editItemAt(index-1);
136 if (p.first+p.length == token) {
139 const run_t& n = mRanges[index];
140 if (token+1 == n.first) {
141 p.length += n.length;
142 mRanges.removeItemsAt(index);
150 // do we need to merge with the next run?
151 run_t& n = mRanges.editItemAt(index);
152 if (token+1 == n.first) {
159 return mRanges.insertAt(run_t(token,1), index);
162 void Tokenizer::dump() const
164 const run_t* ranges = mRanges.array();
165 const size_t c = mRanges.size();
166 ALOGD("Tokenizer (%p, size = %zu)\n", this, c);
167 for (size_t i=0 ; i<c ; i++) {
168 ALOGD("%zu: (%u, %u)\n", i, ranges[i].first, ranges[i].length);
172 }; // namespace android