* commit '2e6d4ae02a955d33a75c0642b8ffead20e11fd9a': Keep pointers to extension values.pull/91/head
Max Cai
10 years ago
committed by
Android Git Automerger
commit
e57ee765da
7 changed files with 917 additions and 253 deletions
@ -0,0 +1,273 @@ |
||||
// Protocol Buffers - Google's data interchange format
|
||||
// Copyright 2014 Google Inc. All rights reserved.
|
||||
// http://code.google.com/p/protobuf/
|
||||
//
|
||||
// Redistribution and use in source and binary forms, with or without
|
||||
// modification, are permitted provided that the following conditions are
|
||||
// met:
|
||||
//
|
||||
// * Redistributions of source code must retain the above copyright
|
||||
// notice, this list of conditions and the following disclaimer.
|
||||
// * Redistributions in binary form must reproduce the above
|
||||
// copyright notice, this list of conditions and the following disclaimer
|
||||
// in the documentation and/or other materials provided with the
|
||||
// distribution.
|
||||
// * Neither the name of Google Inc. nor the names of its
|
||||
// contributors may be used to endorse or promote products derived from
|
||||
// this software without specific prior written permission.
|
||||
//
|
||||
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
package com.google.protobuf.nano; |
||||
|
||||
|
||||
/** |
||||
* A custom version of {@link android.util.SparseArray} with the minimal API |
||||
* for storing {@link FieldData} objects. |
||||
* |
||||
* Based on {@link android.support.v4.util.SpareArrayCompat}. |
||||
*/ |
||||
class FieldArray { |
||||
private static final FieldData DELETED = new FieldData(); |
||||
private boolean mGarbage = false; |
||||
|
||||
private int[] mFieldNumbers; |
||||
private FieldData[] mData; |
||||
private int mSize; |
||||
|
||||
/** |
||||
* Creates a new FieldArray containing no fields. |
||||
*/ |
||||
public FieldArray() { |
||||
this(10); |
||||
} |
||||
|
||||
/** |
||||
* Creates a new FieldArray containing no mappings that will not |
||||
* require any additional memory allocation to store the specified |
||||
* number of mappings. |
||||
*/ |
||||
public FieldArray(int initialCapacity) { |
||||
initialCapacity = idealIntArraySize(initialCapacity); |
||||
mFieldNumbers = new int[initialCapacity]; |
||||
mData = new FieldData[initialCapacity]; |
||||
mSize = 0; |
||||
} |
||||
|
||||
/** |
||||
* Gets the FieldData mapped from the specified fieldNumber, or <code>null</code> |
||||
* if no such mapping has been made. |
||||
*/ |
||||
public FieldData get(int fieldNumber) { |
||||
int i = binarySearch(fieldNumber); |
||||
|
||||
if (i < 0 || mData[i] == DELETED) { |
||||
return null; |
||||
} else { |
||||
return mData[i]; |
||||
} |
||||
} |
||||
|
||||
/** |
||||
* Removes the data from the specified fieldNumber, if there was any. |
||||
*/ |
||||
public void remove(int fieldNumber) { |
||||
int i = binarySearch(fieldNumber); |
||||
|
||||
if (i >= 0 && mData[i] != DELETED) { |
||||
mData[i] = DELETED; |
||||
mGarbage = true; |
||||
} |
||||
} |
||||
|
||||
private void gc() { |
||||
int n = mSize; |
||||
int o = 0; |
||||
int[] keys = mFieldNumbers; |
||||
FieldData[] values = mData; |
||||
|
||||
for (int i = 0; i < n; i++) { |
||||
FieldData val = values[i]; |
||||
|
||||
if (val != DELETED) { |
||||
if (i != o) { |
||||
keys[o] = keys[i]; |
||||
values[o] = val; |
||||
values[i] = null; |
||||
} |
||||
|
||||
o++; |
||||
} |
||||
} |
||||
|
||||
mGarbage = false; |
||||
mSize = o; |
||||
} |
||||
|
||||
/** |
||||
* Adds a mapping from the specified fieldNumber to the specified data, |
||||
* replacing the previous mapping if there was one. |
||||
*/ |
||||
public void put(int fieldNumber, FieldData data) { |
||||
int i = binarySearch(fieldNumber); |
||||
|
||||
if (i >= 0) { |
||||
mData[i] = data; |
||||
} else { |
||||
i = ~i; |
||||
|
||||
if (i < mSize && mData[i] == DELETED) { |
||||
mFieldNumbers[i] = fieldNumber; |
||||
mData[i] = data; |
||||
return; |
||||
} |
||||
|
||||
if (mGarbage && mSize >= mFieldNumbers.length) { |
||||
gc(); |
||||
|
||||
// Search again because indices may have changed.
|
||||
i = ~ binarySearch(fieldNumber); |
||||
} |
||||
|
||||
if (mSize >= mFieldNumbers.length) { |
||||
int n = idealIntArraySize(mSize + 1); |
||||
|
||||
int[] nkeys = new int[n]; |
||||
FieldData[] nvalues = new FieldData[n]; |
||||
|
||||
System.arraycopy(mFieldNumbers, 0, nkeys, 0, mFieldNumbers.length); |
||||
System.arraycopy(mData, 0, nvalues, 0, mData.length); |
||||
|
||||
mFieldNumbers = nkeys; |
||||
mData = nvalues; |
||||
} |
||||
|
||||
if (mSize - i != 0) { |
||||
System.arraycopy(mFieldNumbers, i, mFieldNumbers, i + 1, mSize - i); |
||||
System.arraycopy(mData, i, mData, i + 1, mSize - i); |
||||
} |
||||
|
||||
mFieldNumbers[i] = fieldNumber; |
||||
mData[i] = data; |
||||
mSize++; |
||||
} |
||||
} |
||||
|
||||
/** |
||||
* Returns the number of key-value mappings that this FieldArray |
||||
* currently stores. |
||||
*/ |
||||
public int size() { |
||||
if (mGarbage) { |
||||
gc(); |
||||
} |
||||
|
||||
return mSize; |
||||
} |
||||
|
||||
public boolean isEmpty() { |
||||
return size() == 0; |
||||
} |
||||
|
||||
/** |
||||
* Given an index in the range <code>0...size()-1</code>, returns |
||||
* the value from the <code>index</code>th key-value mapping that this |
||||
* FieldArray stores. |
||||
*/ |
||||
public FieldData dataAt(int index) { |
||||
if (mGarbage) { |
||||
gc(); |
||||
} |
||||
|
||||
return mData[index]; |
||||
} |
||||
|
||||
@Override |
||||
public boolean equals(Object o) { |
||||
if (o == this) { |
||||
return true; |
||||
} |
||||
if (!(o instanceof FieldArray)) { |
||||
return false; |
||||
} |
||||
|
||||
FieldArray other = (FieldArray) o; |
||||
if (size() != other.size()) { // size() will call gc() if necessary.
|
||||
return false; |
||||
} |
||||
return arrayEquals(mFieldNumbers, other.mFieldNumbers, mSize) && |
||||
arrayEquals(mData, other.mData, mSize); |
||||
} |
||||
|
||||
@Override |
||||
public int hashCode() { |
||||
if (mGarbage) { |
||||
gc(); |
||||
} |
||||
int result = 17; |
||||
for (int i = 0; i < mSize; i++) { |
||||
result = 31 * result + mFieldNumbers[i]; |
||||
result = 31 * result + mData[i].hashCode(); |
||||
} |
||||
return result; |
||||
} |
||||
|
||||
private int idealIntArraySize(int need) { |
||||
return idealByteArraySize(need * 4) / 4; |
||||
} |
||||
|
||||
private int idealByteArraySize(int need) { |
||||
for (int i = 4; i < 32; i++) |
||||
if (need <= (1 << i) - 12) |
||||
return (1 << i) - 12; |
||||
|
||||
return need; |
||||
} |
||||
|
||||
private int binarySearch(int value) { |
||||
int lo = 0; |
||||
int hi = mSize - 1; |
||||
|
||||
while (lo <= hi) { |
||||
int mid = (lo + hi) >>> 1; |
||||
int midVal = mFieldNumbers[mid]; |
||||
|
||||
if (midVal < value) { |
||||
lo = mid + 1; |
||||
} else if (midVal > value) { |
||||
hi = mid - 1; |
||||
} else { |
||||
return mid; // value found
|
||||
} |
||||
} |
||||
return ~lo; // value not present
|
||||
} |
||||
|
||||
private boolean arrayEquals(int[] a, int[] b, int size) { |
||||
for (int i = 0; i < size; i++) { |
||||
if (a[i] != b[i]) { |
||||
return false; |
||||
} |
||||
} |
||||
return true; |
||||
} |
||||
|
||||
private boolean arrayEquals(FieldData[] a, FieldData[] b, int size) { |
||||
for (int i = 0; i < size; i++) { |
||||
if (!a[i].equals(b[i])) { |
||||
return false; |
||||
} |
||||
} |
||||
return true; |
||||
} |
||||
} |
||||
@ -0,0 +1,173 @@ |
||||
// Protocol Buffers - Google's data interchange format
|
||||
// Copyright 2014 Google Inc. All rights reserved.
|
||||
// http://code.google.com/p/protobuf/
|
||||
//
|
||||
// Redistribution and use in source and binary forms, with or without
|
||||
// modification, are permitted provided that the following conditions are
|
||||
// met:
|
||||
//
|
||||
// * Redistributions of source code must retain the above copyright
|
||||
// notice, this list of conditions and the following disclaimer.
|
||||
// * Redistributions in binary form must reproduce the above
|
||||
// copyright notice, this list of conditions and the following disclaimer
|
||||
// in the documentation and/or other materials provided with the
|
||||
// distribution.
|
||||
// * Neither the name of Google Inc. nor the names of its
|
||||
// contributors may be used to endorse or promote products derived from
|
||||
// this software without specific prior written permission.
|
||||
//
|
||||
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
package com.google.protobuf.nano; |
||||
|
||||
import java.io.IOException; |
||||
import java.util.ArrayList; |
||||
import java.util.Arrays; |
||||
import java.util.List; |
||||
|
||||
/** |
||||
* Stores unknown fields. These might be extensions or fields that the generated API doesn't |
||||
* know about yet. |
||||
*/ |
||||
class FieldData { |
||||
private Extension<?, ?> cachedExtension; |
||||
private Object value; |
||||
/** The serialised values for this object. Will be cleared if getValue is called */ |
||||
private List<UnknownFieldData> unknownFieldData; |
||||
|
||||
<T> FieldData(Extension<?, T> extension, T newValue) { |
||||
cachedExtension = extension; |
||||
value = newValue; |
||||
} |
||||
|
||||
FieldData() { |
||||
unknownFieldData = new ArrayList<UnknownFieldData>(); |
||||
} |
||||
|
||||
void addUnknownField(UnknownFieldData unknownField) { |
||||
unknownFieldData.add(unknownField); |
||||
} |
||||
|
||||
<T> T getValue(Extension<?, T> extension) { |
||||
if (value != null){ |
||||
if (cachedExtension != extension) { // Extension objects are singletons.
|
||||
throw new IllegalStateException( |
||||
"Tried to getExtension with a differernt Extension."); |
||||
} |
||||
} else { |
||||
cachedExtension = extension; |
||||
value = extension.getValueFrom(unknownFieldData); |
||||
unknownFieldData = null; |
||||
} |
||||
return (T) value; |
||||
} |
||||
|
||||
<T> void setValue(Extension<?, T> extension, T newValue) { |
||||
cachedExtension = extension; |
||||
value = newValue; |
||||
unknownFieldData = null; |
||||
} |
||||
|
||||
int computeSerializedSize() { |
||||
int size = 0; |
||||
if (value != null) { |
||||
size = cachedExtension.computeSerializedSize(value); |
||||
} else { |
||||
for (UnknownFieldData unknownField : unknownFieldData) { |
||||
size += unknownField.computeSerializedSize(); |
||||
} |
||||
} |
||||
return size; |
||||
} |
||||
|
||||
void writeTo(CodedOutputByteBufferNano output) throws IOException { |
||||
if (value != null) { |
||||
cachedExtension.writeTo(value, output); |
||||
} else { |
||||
for (UnknownFieldData unknownField : unknownFieldData) { |
||||
unknownField.writeTo(output); |
||||
} |
||||
} |
||||
} |
||||
|
||||
@Override |
||||
public boolean equals(Object o) { |
||||
if (o == this) { |
||||
return true; |
||||
} |
||||
if (!(o instanceof FieldData)) { |
||||
return false; |
||||
} |
||||
|
||||
FieldData other = (FieldData) o; |
||||
if (value != null && other.value != null) { |
||||
// If both objects have deserialized values, compare those.
|
||||
// Since unknown fields are only compared if messages have generated equals methods
|
||||
// we know this will be a meaningful comparison (not identity) for all values.
|
||||
if (cachedExtension != other.cachedExtension) { // Extension objects are singletons.
|
||||
return false; |
||||
} |
||||
if (!cachedExtension.clazz.isArray()) { |
||||
// Can't test (!cachedExtension.repeated) due to 'bytes' -> 'byte[]'
|
||||
return value.equals(other.value); |
||||
} |
||||
if (value instanceof byte[]) { |
||||
return Arrays.equals((byte[]) value, (byte[]) other.value); |
||||
} else if (value instanceof int[]) { |
||||
return Arrays.equals((int[]) value, (int[]) other.value); |
||||
} else if (value instanceof long[]) { |
||||
return Arrays.equals((long[]) value, (long[]) other.value); |
||||
} else if (value instanceof float[]) { |
||||
return Arrays.equals((float[]) value, (float[]) other.value); |
||||
} else if (value instanceof double[]) { |
||||
return Arrays.equals((double[]) value, (double[]) other.value); |
||||
} else if (value instanceof boolean[]) { |
||||
return Arrays.equals((boolean[]) value, (boolean[]) other.value); |
||||
} else { |
||||
return Arrays.deepEquals((Object[]) value, (Object[]) other.value); |
||||
} |
||||
} |
||||
if (unknownFieldData != null && other.unknownFieldData != null) { |
||||
// If both objects have byte arrays compare those directly.
|
||||
return unknownFieldData.equals(other.unknownFieldData); |
||||
} |
||||
try { |
||||
// As a last resort, serialize and compare the resulting byte arrays.
|
||||
return Arrays.equals(toByteArray(), other.toByteArray()); |
||||
} catch (IOException e) { |
||||
// Should not happen.
|
||||
throw new IllegalStateException(e); |
||||
} |
||||
} |
||||
|
||||
@Override |
||||
public int hashCode() { |
||||
int result = 17; |
||||
try { |
||||
// The only way to generate a consistent hash is to use the serialized form.
|
||||
result = 31 * result + Arrays.hashCode(toByteArray()); |
||||
} catch (IOException e) { |
||||
// Should not happen.
|
||||
throw new IllegalStateException(e); |
||||
} |
||||
return result; |
||||
} |
||||
|
||||
private byte[] toByteArray() throws IOException { |
||||
byte[] result = new byte[computeSerializedSize()]; |
||||
CodedOutputByteBufferNano output = CodedOutputByteBufferNano.newInstance(result); |
||||
writeTo(output); |
||||
return result; |
||||
} |
||||
|
||||
} |
||||
Loading…
Reference in new issue