OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:totalSize
(Results
1 - 25
of
484
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/external/pdfium/core/fxcrt/
fx_basic_array.cpp
30
pdfium::base::CheckedNumeric<int>
totalSize
= nNewSize;
31
totalSize
*= m_nUnitSize;
32
if (!
totalSize
.IsValid()) {
37
FX_Alloc(uint8_t, pdfium::base::ValueOrDieForType<size_t>(
totalSize
));
47
pdfium::base::CheckedNumeric<int>
totalSize
= nNewMax;
48
totalSize
*= m_nUnitSize;
49
if (!
totalSize
.IsValid() || nNewMax < m_nSize) {
53
uint8_t, m_pData, pdfium::base::ValueOrDieForType<size_t>(
totalSize
));
cfx_string_data_template.h
34
int
totalSize
= nSize.ValueOrDie();
35
int usableLen = (
totalSize
- overhead) / sizeof(CharType);
38
void* pData = FX_Alloc(uint8_t,
totalSize
);
/external/icu/icu4c/source/tools/toolutil/
collationinfo.cpp
31
int32_t
totalSize
= indexes[CollationDataReader::IX_TOTAL_SIZE];
32
if(sizeWithHeader >
totalSize
) {
33
printf(" header size: %6ld\n", (long)(sizeWithHeader -
totalSize
));
swapimpl.cpp
118
int32_t
totalSize
=udata_readInt32(ds, inIndexes[PropNameData::IX_TOTAL_SIZE]);
120
if(length<
totalSize
) {
123
(int)length, (int)
totalSize
);
138
totalSize
-numBytesIndexesAndValueMaps);
154
return headerSize+
totalSize
;
/external/freetype/src/cff/
cf2arrst.h
60
size_t
totalSize
; /* total bytes allocated */
/external/pdfium/third_party/freetype/src/cff/
cf2arrst.h
60
size_t
totalSize
; /* total bytes allocated */
/frameworks/base/cmds/incidentd/src/
report_directory.cpp
134
off_t
totalSize
= 0;
152
totalSize
+= st.st_size;
159
if (
totalSize
< maxSize && totalCount < maxCount) {
168
it != files.end() &&
totalSize
>= maxSize && totalCount >= maxCount; it++) {
170
totalSize
-= it->second.st_size;
/packages/services/Car/tests/obd2_test/src/com/android/car/obd2/test/
Utils.java
39
int
totalSize
= Arrays.stream(arrays).mapToInt((int[] array) -> array.length).sum();
40
int[] newArray = Arrays.copyOf(arrays[0],
totalSize
);
/external/icu/icu4c/source/common/
rbbirb.cpp
167
int32_t
totalSize
= headerSize + forwardTableSize + reverseTableSize
171
RBBIDataHeader *data = (RBBIDataHeader *)uprv_malloc(
totalSize
);
176
uprv_memset(data, 0,
totalSize
);
184
data->fLength =
totalSize
;
rbbidata.cpp
367
int32_t
totalSize
= headerSize + breakDataLength;
369
return
totalSize
;
375
if (length <
totalSize
) {
472
return
totalSize
;
/frameworks/av/media/libstagefright/rtsp/
ARTPAssembler.cpp
77
size_t
totalSize
= 0;
81
totalSize
+= (*it)->size() + 7;
84
sp<ABuffer> accessUnit = new ABuffer(
totalSize
);
124
size_t
totalSize
= 0;
127
totalSize
+= (*it)->size();
130
sp<ABuffer> accessUnit = new ABuffer(
totalSize
);
AH263Assembler.cpp
159
size_t
totalSize
= 0;
164
totalSize
+= unit->size();
168
sp<ABuffer> accessUnit = new ABuffer(
totalSize
);
/external/caliper/caliper/src/main/java/com/google/caliper/worker/
Allocation.java
43
long
totalSize
= 0;
45
totalSize
+= allocation.size;
47
return
totalSize
;
/external/icu/icu4c/source/i18n/
collationdatawriter.cpp
224
int32_t
totalSize
= indexesLength * 4;
232
indexes[CollationDataReader::IX_REORDER_CODES_OFFSET] =
totalSize
;
233
totalSize
+= reorderCodesLength * 4;
235
indexes[CollationDataReader::IX_REORDER_TABLE_OFFSET] =
totalSize
;
237
totalSize
+= 256;
240
indexes[CollationDataReader::IX_TRIE_OFFSET] =
totalSize
;
244
if(
totalSize
< capacity) {
245
length = utrie2_serialize(data.trie, dest +
totalSize
,
246
capacity -
totalSize
, &errorCode2);
257
totalSize
+= length
[
all
...]
/external/skia/src/core/
SkArenaAlloc.cpp
143
uint32_t
totalSize
= sizeIncludingFooter + skipOverhead;
145
if ((ptrdiff_t)
totalSize
> fEnd - objStart) {
146
this->ensureSpace(
totalSize
, alignment);
150
SkASSERT((ptrdiff_t)
totalSize
<= fEnd - objStart);
SkArenaAlloc.h
167
uint32_t
totalSize
= arraySize + sizeof(Footer) + sizeof(uint32_t);
168
objStart = this->allocObjectWithFooter(
totalSize
, alignment);
/external/skia/src/gpu/
GrMemoryPool.cpp
159
size_t
totalSize
= ptrOffset + block->fFreeSize;
163
SkASSERT(!(
totalSize
% kAlignment));
167
SkASSERT(
totalSize
>= fMinAllocSize);
169
SkASSERT(
totalSize
== block->fSize);
/packages/apps/StorageManager/src/com/android/storagemanager/deletionhelper/
FetchDownloadsLoader.java
86
result.
totalSize
+= currentFile.length();
107
public long
totalSize
;
117
long
totalSize
,
121
this.
totalSize
=
totalSize
;
/dalvik/dexgen/src/com/android/dexgen/dex/file/
Statistics.java
119
private int
totalSize
;
138
this.
totalSize
= size;
152
totalSize
+= size;
182
totalSize
+ " bytes total\n");
187
int average =
totalSize
/ count;
/dalvik/dx/src/com/android/dx/dex/file/
Statistics.java
118
private int
totalSize
;
137
this.
totalSize
= size;
151
totalSize
+= size;
181
totalSize
+ " bytes total\n");
186
int average =
totalSize
/ count;
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/
MultidimensionalCounter.java
61
private final int
totalSize
;
186
totalSize
= tS;
217
index >=
totalSize
) {
218
throw new OutOfRangeException(index, 0,
totalSize
);
280
return
totalSize
;
/external/icu/android_icu4j/src/main/java/android/icu/text/
DictionaryData.java
65
int
totalSize
= indexes[IX_TOTAL_SIZE] - offset;
69
byte[] data = new byte[
totalSize
];
73
Assert.assrt(
totalSize
% 2 == 0);
74
String data = ICUBinary.getString(bytes,
totalSize
/ 2,
totalSize
& 1);
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
DictionaryData.java
64
int
totalSize
= indexes[IX_TOTAL_SIZE] - offset;
68
byte[] data = new byte[
totalSize
];
72
Assert.assrt(
totalSize
% 2 == 0);
73
String data = ICUBinary.getString(bytes,
totalSize
/ 2,
totalSize
& 1);
/external/lzma/C/
XzIn.c
62
ADD_SIZE_CHECH(size, (p->blocks[i].
totalSize
+ 3) & ~(UInt64)3);
105
READ_VARINT_AND_CHECK(buf, pos, size, &block->
totalSize
);
107
if (block->
totalSize
== 0)
206
UInt64
totalSize
= Xz_GetPackSize(p);
207
UInt64 sum = XZ_STREAM_HEADER_SIZE +
totalSize
+ indexSize;
208
if (
totalSize
== XZ_SIZE_OVERFLOW ||
210
totalSize
>= ((UInt64)1 << 63))
/external/swiftshader/src/OpenGL/compiler/
parseConst.cpp
185
size_t
totalSize
= index + size;
189
for(size_t i = index; i <
totalSize
; i++) {
203
for(size_t i = index; i <
totalSize
; i++) {
Completed in 458 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>