OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:cache_entry
(Results
1 - 11
of
11
) sorted by null
/external/selinux/libsemanage/src/
database_llist.h
10
typedef struct
cache_entry
{
struct
12
struct
cache_entry
*prev;
13
struct
cache_entry
*next;
/external/mesa3d/src/gallium/auxiliary/pipebuffer/
pb_bufmgr_cache.c
57
struct pb_cache_entry
cache_entry
;
member in struct:pb_cache_buffer
120
pb_cache_add_buffer(&buf->
cache_entry
);
246
pb_cache_init_entry(&mgr->cache, &buf->
cache_entry
, &buf->base, 0);
/external/mesa3d/src/gallium/winsys/amdgpu/drm/
amdgpu_bo.h
44
struct pb_cache_entry
cache_entry
;
member in struct:amdgpu_winsys_bo::__anon28407::__anon28408
/external/mesa3d/src/gallium/winsys/radeon/drm/
radeon_drm_bo.h
43
struct pb_cache_entry
cache_entry
;
member in struct:radeon_bo::__anon28413::__anon28414
/external/mesa3d/src/amd/vulkan/
radv_pipeline_cache.c
30
struct
cache_entry
{
struct
81
entry_size(struct
cache_entry
*entry)
111
static struct
cache_entry
*
120
struct
cache_entry
*entry = cache->hash_table[index];
133
static struct
cache_entry
*
137
struct
cache_entry
*entry;
153
struct
cache_entry
*entry = radv_pipeline_cache_search(cache, sha1);
188
struct
cache_entry
*entry)
215
struct
cache_entry
**table;
216
struct
cache_entry
**old_table = cache->hash_table
[
all
...]
/frameworks/base/core/java/com/android/internal/database/
SortCursor.java
117
int
cache_entry
= newPosition % ROWCACHESIZE;
local
119
if (mRowNumCache[
cache_entry
] == newPosition) {
120
int which = mCursorCache[
cache_entry
];
126
mCursor.moveToPosition(mCurRowNumCache[
cache_entry
][which]);
127
mLastCacheHit =
cache_entry
;
173
mRowNumCache[
cache_entry
] = newPosition;
174
mCursorCache[
cache_entry
] = smallestIdx;
177
mCurRowNumCache[
cache_entry
][i] = mCursors[i].getPosition();
/packages/apps/Music/src/com/android/music/
SortCursor.java
111
int
cache_entry
= newPosition % ROWCACHESIZE;
local
113
if (mRowNumCache[
cache_entry
] == newPosition) {
114
int which = mCursorCache[
cache_entry
];
120
mCursor.moveToPosition(mCurRowNumCache[
cache_entry
][which]);
121
mLastCacheHit =
cache_entry
;
167
mRowNumCache[
cache_entry
] = newPosition;
168
mCursorCache[
cache_entry
] = smallestIdx;
171
mCurRowNumCache[
cache_entry
][i] = mCursors[i].getPosition();
/external/ppp/pppd/
chap_ms.c
388
const struct chapms2_response_cache_entry *
cache_entry
;
local
393
cache_entry
= chapms2_find_in_response_cache(id, challenge, NULL);
394
if (
cache_entry
) {
395
memcpy(response,
cache_entry
->response, MS_CHAP2_RESPONSE_LEN);
/external/strace/
socketutils.c
52
}
cache_entry
;
typedef in typeref:struct:__anon31898
55
static
cache_entry
cache[CACHE_SIZE];
61
cache_entry
*e = &cache[inode & CACHE_MASK];
72
const
cache_entry
*const e = &cache[inode & CACHE_MASK];
/external/squashfs-tools/squashfs-tools/
unsquashfs.h
137
struct
cache_entry
*free_list;
138
struct
cache_entry
*hash_table[65536];
142
struct
cache_entry
{
struct
149
struct
cache_entry
*hash_next;
150
struct
cache_entry
*hash_prev;
151
struct
cache_entry
*free_next;
152
struct
cache_entry
*free_prev;
195
struct
cache_entry
*buffer;
/external/v8/src/profiler/
heap-snapshot-generator.cc
705
base::HashMap::Entry*
cache_entry
= entries_.Lookup(thing, Hash(thing));
local
706
if (
cache_entry
== NULL) return HeapEntry::kNoEntry;
707
return static_cast<int>(reinterpret_cast<intptr_t>(
cache_entry
->value));
712
base::HashMap::Entry*
cache_entry
=
local
714
DCHECK(
cache_entry
->value == NULL);
715
cache_entry
->value = reinterpret_cast<void*>(static_cast<intptr_t>(entry));
741
base::HashMap::Entry*
cache_entry
=
local
743
return
cache_entry
!= NULL
744
? reinterpret_cast<const char*>(
cache_entry
->value)
752
base::HashMap::Entry*
cache_entry
local
2736
base::HashMap::Entry*
cache_entry
=
local
[
all
...]
Completed in 320 milliseconds