HomeSort by relevance Sort by last modified time
    Searched full:pentry (Results 1 - 25 of 58) sorted by null

1 2 3

  /bootable/recovery/minzip/
Hash.c 182 HashEntry* pEntry;
191 pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)];
193 while (pEntry->data != NULL) {
194 if (pEntry->data != HASH_TOMBSTONE &&
195 pEntry->hashValue == itemHash &&
196 (*cmpFunc)(pEntry->data, item) == 0)
199 //LOGD("+++ match on entry %d\n", pEntry - pHashTable->pEntries);
203 pEntry++;
204 if (pEntry == pEnd) { /* wrap around to start */
207 pEntry = pHashTable->pEntries
    [all...]
Zip.h 111 mzGetZipEntryIndex(const ZipArchive *pArchive, const ZipEntry *pEntry) {
112 return pEntry - pArchive->pEntries;
118 INLINE UnterminatedString mzGetZipEntryFileName(const ZipEntry* pEntry) {
120 ret.str = pEntry->fileName;
121 ret.len = pEntry->fileNameLen;
124 INLINE long mzGetZipEntryOffset(const ZipEntry* pEntry) {
125 return pEntry->offset;
127 INLINE long mzGetZipEntryUncompLen(const ZipEntry* pEntry) {
128 return pEntry->uncompLen;
130 INLINE long mzGetZipEntryModTime(const ZipEntry* pEntry) {
    [all...]
Zip.c 91 static void dumpEntry(const ZipEntry* pEntry)
93 LOGI(" %p '%.*s'\n", pEntry->fileName,pEntry->fileNameLen,pEntry->fileName);
94 LOGI(" off=%ld comp=%ld uncomp=%ld how=%d\n", pEntry->offset,
95 pEntry->compLen, pEntry->uncompLen, pEntry->compression);
146 static void addEntryToHashTable(HashTable* pHash, ZipEntry* pEntry)
148 unsigned int itemHash = computeHash(pEntry->fileName, pEntry->fileNameLen)
    [all...]
  /dalvik/vm/
Hash.cpp 177 HashEntry* pEntry;
186 pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)];
188 while (pEntry->data != NULL) {
189 if (pEntry->data != HASH_TOMBSTONE &&
190 pEntry->hashValue == itemHash &&
191 (*cmpFunc)(pEntry->data, item) == 0)
194 //ALOGD("+++ match on entry %d", pEntry - pHashTable->pEntries);
198 pEntry++;
199 if (pEntry == pEnd) { /* wrap around to start */
202 pEntry = pHashTable->pEntries
    [all...]
AtomicCache.cpp 88 void dvmUpdateAtomicCache(u4 key1, u4 key2, u4 value, AtomicCacheEntry* pEntry,
113 (volatile s4*) &pEntry->version) != 0)
129 if (pEntry->key1 == 0)
143 pEntry->version = newVersion;
145 android_atomic_release_store(key1, (int32_t*) &pEntry->key1);
146 pEntry->key2 = key2;
147 pEntry->value = value;
150 android_atomic_release_store(newVersion, (int32_t*) &pEntry->version);
154 * pEntry->version, so if this fails the world is broken.
159 (volatile s4*) &pEntry->version) != 0
    [all...]
AtomicCache.h 96 AtomicCacheEntry* pEntry; \
103 pEntry = (_cache)->entries + hash; \
105 firstVersion = android_atomic_acquire_load((int32_t*)&pEntry->version); \
107 if (pEntry->key1 == (u4)(_key1) && pEntry->key2 == (u4)(_key2)) { \
114 value = android_atomic_acquire_load((int32_t*) &pEntry->value); \
115 secondVersion = pEntry->version; \
140 dvmUpdateAtomicCache((u4) (_key1), (u4) (_key2), value, pEntry, \
163 void dvmUpdateAtomicCache(u4 key1, u4 key2, u4 value, AtomicCacheEntry* pEntry,
Native.cpp 264 static bool checkOnLoadResult(SharedLib* pEntry)
267 if (pEntry->onLoadThreadId == self->threadId) {
273 self->threadId, pEntry->pathName);
277 ALOGV("+++ retrieving %s OnLoad status", pEntry->pathName);
280 dvmLockMutex(&pEntry->onLoadLock);
281 while (pEntry->onLoadResult == kOnLoadPending) {
283 self->threadId, pEntry->pathName);
285 pthread_cond_wait(&pEntry->onLoadCond, &pEntry->onLoadLock);
288 if (pEntry->onLoadResult == kOnLoadOkay)
    [all...]
  /external/chromium_org/third_party/sqlite/src/src/
rowset.c 105 struct RowSetEntry *pEntry; /* List of entries using pRight */
106 struct RowSetEntry *pLast; /* Last entry on the pEntry list */
110 u8 isSorted; /* True if pEntry is sorted */
132 p->pEntry = 0;
155 p->pEntry = 0;
168 struct RowSetEntry *pEntry; /* The new entry */
182 pEntry = p->pFresh++;
184 pEntry->v = rowid;
185 pEntry->pRight = 0;
191 pLast->pRight = pEntry;
    [all...]
hash.c 66 /* Link pNew element into the hash table pH. If pEntry!=0 then also
67 ** insert pNew into the pEntry hash bucket.
71 struct _ht *pEntry, /* The entry into which pNew is inserted */
74 HashElem *pHead; /* First element already in pEntry */
75 if( pEntry ){
76 pHead = pEntry->count ? pEntry->chain : 0;
77 pEntry->count++;
78 pEntry->chain = pNew;
149 struct _ht *pEntry = &pH->ht[h]
    [all...]
  /build/tools/zipalign/
ZipAlign.cpp 50 ZipEntry* pEntry;
58 pEntry = pZin->getEntryByIndex(i);
59 if (pEntry == NULL) {
64 if (pEntry->isCompressed()) {
67 // pEntry->getFileName(), (long) pEntry->getFileOffset(),
68 // (long) pEntry->getUncompressedLen());
76 long newOffset = pEntry->getFileOffset() + bias;
80 // pEntry->getFileName(), (long) pEntry->getFileOffset()
    [all...]
ZipFile.cpp 161 ZipEntry* pEntry = mEntries[idx];
162 if (!pEntry->getDeleted() &&
163 strcmp(fileName, pEntry->getFileName()) == 0)
165 return pEntry;
309 ZipEntry* pEntry = new ZipEntry;
311 result = pEntry->initFromCDE(mZipFp);
314 delete pEntry;
318 mEntries.add(pEntry);
362 ZipEntry* pEntry = NULL;
394 pEntry = new ZipEntry
    [all...]
  /frameworks/av/drm/libdrmframework/include/
PlugInManager.h 205 struct dirent* pEntry;
207 while (NULL != pDir && NULL != (pEntry = readdir(pDir))) {
208 if (!isPlugIn(pEntry)) {
214 plugInPath += pEntry->d_name;
229 bool isPlugIn(const struct dirent* pEntry) const {
230 String8 sName(pEntry->d_name);
239 bool isDotOrDDot(const struct dirent* pEntry) const {
240 String8 sName(pEntry->d_name);
247 bool isDirectory(const struct dirent* pEntry) const {
248 return DT_DIR == pEntry->d_type
    [all...]
  /system/core/libdiskconfig/
config_mbr.c 31 cfg_pentry(struct pc_partition *pentry, uint8_t status, uint8_t type,
37 memset(&pentry->start, 0xff, sizeof(struct chs));
38 memset(&pentry->end, 0xff, sizeof(struct chs));
41 memset(&pentry->start, 0, sizeof(struct chs));
42 memset(&pentry->end, 0, sizeof(struct chs));
45 pentry->status = status;
46 pentry->type = type;
47 pentry->start_lba = start;
48 pentry->len_lba = len;
50 ALOGI("Configuring pentry. status=0x%x type=0x%x start_lba=%u len_lba=%u"
75 struct pc_partition *pentry; local
    [all...]
  /frameworks/base/tools/aapt/
ZipFile.cpp 161 ZipEntry* pEntry = mEntries[idx];
162 if (!pEntry->getDeleted() &&
163 strcmp(fileName, pEntry->getFileName()) == 0)
165 return pEntry;
309 ZipEntry* pEntry = new ZipEntry;
311 result = pEntry->initFromCDE(mZipFp);
314 delete pEntry;
318 mEntries.add(pEntry);
362 ZipEntry* pEntry = NULL;
394 pEntry = new ZipEntry
    [all...]
  /frameworks/compile/mclinker/include/mcld/ADT/
HashEntryFactory.h 29 void destroy(entry_type*& pEntry)
30 { HashEntryTy::Destroy(pEntry); }
StringEntry.tcc 64 void StringEntryFactory<DataType>::destroy(StringEntry<DataType>* pEntry)
66 if (NULL != pEntry) {
67 pEntry->~StringEntry<DataType>();
68 free(pEntry);
HashEntry.tcc 42 void EntryFactory<HashEntryTy>::destroy(HashEntryTy* pEntry)
44 delete pEntry;
  /frameworks/compile/mclinker/include/mcld/Target/
SymbolEntryMap.h 46 void record(const ResolveInfo& pSymbol, EntryType& pEntry);
93 SymbolEntryMap<EntryType>::record(const ResolveInfo& pSymbol, EntryType& pEntry)
97 mapping.entry = &pEntry;
  /external/chromium_org/third_party/sqlite/src/ext/fts1/
ft_hash.c 205 struct _ht *pEntry, /* The entry into which pNew is inserted */
208 HashElem *pHead; /* First element already in pEntry */
209 pHead = pEntry->chain;
222 pEntry->count++;
223 pEntry->chain = pNew;
265 struct _ht *pEntry = &pH->ht[h];
266 elem = pEntry->chain;
267 count = pEntry->count;
287 struct _ht *pEntry;
296 pEntry = &pH->ht[h]
    [all...]
fts1_hash.c 163 struct _fts1ht *pEntry, /* The entry into which pNew is inserted */
166 fts1HashElem *pHead; /* First element already in pEntry */
167 pHead = pEntry->chain;
180 pEntry->count++;
181 pEntry->chain = pNew;
223 struct _fts1ht *pEntry = &pH->ht[h];
224 elem = pEntry->chain;
225 count = pEntry->count;
245 struct _fts1ht *pEntry;
254 pEntry = &pH->ht[h]
    [all...]
  /external/chromium_org/third_party/sqlite/src/ext/fts2/
fts2_hash.c 168 struct _fts2ht *pEntry, /* The entry into which pNew is inserted */
171 fts2HashElem *pHead; /* First element already in pEntry */
172 pHead = pEntry->chain;
185 pEntry->count++;
186 pEntry->chain = pNew;
228 struct _fts2ht *pEntry = &pH->ht[h];
229 elem = pEntry->chain;
230 count = pEntry->count;
250 struct _fts2ht *pEntry;
259 pEntry = &pH->ht[h]
    [all...]
  /external/chromium_org/third_party/sqlite/src/ext/fts3/
fts3_hash.c 168 struct _fts3ht *pEntry, /* The entry into which pNew is inserted */
171 Fts3HashElem *pHead; /* First element already in pEntry */
172 pHead = pEntry->chain;
185 pEntry->count++;
186 pEntry->chain = pNew;
231 struct _fts3ht *pEntry = &pH->ht[h];
232 elem = pEntry->chain;
233 count = pEntry->count;
253 struct _fts3ht *pEntry;
262 pEntry = &pH->ht[h]
    [all...]
  /external/svox/pico/lib/
picoklex.c 540 picoos_uint32 pentry; local
549 pentry = 0x000000ff & (ind[0]);
550 pentry |= ((picoos_uint32)(ind[1]) << 8);
551 pentry |= ((picoos_uint32)(ind[2]) << 16);
554 if (pentry >= ((picoos_uint32)klex->nrblocks * PICOKLEX_LEXBLOCK_SIZE)) {
558 pentry += (klex->lexblocks[pentry]);
559 *phonlen = (klex->lexblocks[pentry++]) - 2;
560 *pos = klex->lexblocks[pentry++];
561 *phon = &(klex->lexblocks[pentry]);
    [all...]
  /external/e2fsprogs/lib/ext2fs/
dosio.c 112 static PTABLE_ENTRY *scan_partition_table(PTABLE_ENTRY *pentry,
123 if(pentry[*pno].type == LINUX_EXT2FS)
124 return &pentry[*pno];
127 if(!pentry[*pno].type)
129 else if(pentry[*pno].type == LINUX_SWAP)
136 if(pentry[i].type == LINUX_EXT2FS)
139 return &pentry[i];
  /frameworks/compile/mclinker/lib/Target/X86/
X86RelocationFunctions.h 11 static X86Relocator::Result Name(Relocation& pEntry, X86_32Relocator& pParent);
78 static X86Relocator::Result Name(Relocation& pEntry, X86_64Relocator& pParent);

Completed in 2026 milliseconds

1 2 3