OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:num_entries_
(Results
1 - 6
of
6
) sorted by null
/art/compiler/optimizing/
nodes_mips.h
51
num_entries_
(num_entries) {
60
int32_t GetNumEntries() const { return
num_entries_
; }
64
return GetBlock()->GetSuccessors()[
num_entries_
];
74
const int32_t
num_entries_
;
member in class:art::final
nodes_x86.h
101
num_entries_
(num_entries) {
110
int32_t GetNumEntries() const { return
num_entries_
; }
118
return GetBlock()->GetSuccessors()[
num_entries_
];
128
const int32_t
num_entries_
;
member in class:art::final
gvn.cc
45
num_entries_
(0u) {
58
num_entries_
(0u) {
93
++
num_entries_
;
134
num_entries_
= 0;
156
bool IsEmpty() const { return
num_entries_
== 0; }
157
size_t GetNumberOfEntries() const { return
num_entries_
; }
183
num_entries_
= other.
num_entries_
;
285
// This is estimated as (
num_entries_
* 1.5) and rounded up to nearest pow2.
287
size_t bucket_count = RoundUpToPowerOfTwo(
num_entries_
+ (num_entries_ >> 1))
329
size_t
num_entries_
;
member in class:art::ValueSet
[
all
...]
nodes.h
3465
const uint32_t
num_entries_
;
member in class:art::final::final::final
[
all
...]
/bionic/libc/malloc_debug/
RecordData.h
168
size_t
num_entries_
= 0;
member in class:RecordData
/art/libdexfile/dex/
bytecode_utils.h
37
num_entries_
= table[1];
42
return
num_entries_
;
47
// In a sparse table, we have
num_entries_
keys and
num_entries_
values, in that order.
48
DCHECK_LT(index, 2 * static_cast<size_t>(
num_entries_
));
50
// In a packed table, we have the starting key and
num_entries_
values.
51
DCHECK_LT(index, 1 + static_cast<size_t>(
num_entries_
));
70
// In a sparse table, we have
num_entries_
keys and
num_entries_
values, in that order.
71
return
num_entries_
;
93
uint16_t
num_entries_
;
member in class:art::DexSwitchTable
132
const size_t
num_entries_
;
member in class:art::DexSwitchTableIterator
[
all
...]
Completed in 2980 milliseconds