Searched defs:entry (Results 1 - 25 of 49) sorted by relevance

12

/system/extras/kexec_tools/
H A Dkexec.h19 static inline long kexec_load(unsigned int entry, unsigned long nr_segments, argument
21 return syscall(__NR_kexec_load, entry, nr_segments, segment, flags);
/system/core/logd/
H A DFlushCommand.cpp49 LogTimeEntry *entry = NULL; local
55 entry = (*it);
56 if (entry->mClient == client) {
57 entry->triggerReader_Locked();
58 if (entry->runningReader_Locked()) {
62 entry->incRef_Locked();
74 entry = new LogTimeEntry(mReader, client, mNonBlock, mTail, mLogMask, mPid, mStart);
75 times.push_front(entry);
80 // release client and entry reference counts once done
81 entry
[all...]
H A DLogBufferElement.cpp194 struct logger_entry_v3 entry; local
196 memset(&entry, 0, sizeof(struct logger_entry_v3));
198 entry.hdr_size = sizeof(struct logger_entry_v3);
199 entry.lid = mLogId;
200 entry.pid = mPid;
201 entry.tid = mTid;
202 entry.sec = mRealTime.tv_sec;
203 entry.nsec = mRealTime.tv_nsec;
206 iovec[0].iov_base = &entry;
212 entry
[all...]
H A DLogReader.cpp32 // When we are notified a new log entry is available, inform
173 LogTimeEntry *entry = (*it); local
174 if (entry->mClient == cli) {
176 entry->release_Locked();
H A DLogStatistics.cpp119 // Atomically set an entry to drop
120 // entry->setDropped(1) must follow this call, caller should do this explicitly.
165 const PidEntry &entry = it->second; local
167 if (entry.getUid() == uid) {
168 const char *n = entry.getName();
280 const UidEntry *entry = sorted[index]; local
281 uid_t u = entry->getKey();
325 size.appendFormat("%zu", entry->getSizes());
328 size_t dropped = entry->getDropped();
343 const PidEntry *entry local
402 const TidEntry *entry = sorted[index]; local
458 const TagEntry *entry = sorted[index]; local
[all...]
/system/extras/simpleperf/
H A Dutils.cpp62 dirent* entry; local
63 while ((entry = readdir(dir)) != nullptr) {
64 if (strcmp(entry->d_name, ".") == 0 || strcmp(entry->d_name, "..") == 0) {
67 if (entry->d_type == DT_DIR) {
69 subdirs->push_back(entry->d_name);
73 files->push_back(entry->d_name);
/system/core/libbacktrace/
H A DBacktraceCurrent.cpp101 ThreadEntry* entry = ThreadEntry::Get(getpid(), gettid(), false); local
102 if (!entry) {
103 BACK_LOGE("pid %d, tid %d entry not found", getpid(), gettid());
107 entry->CopyUcontextFromSigcontext(sigcontext);
110 entry->Wake();
116 if (entry->Wait(2)) {
117 // Do not remove the entry here because that can result in a deadlock
119 entry->Wake();
121 // At this point, it is possible that entry has been freed, so just exit.
131 ThreadEntry* entry local
[all...]
H A DThreadEntry.cpp51 ThreadEntry* entry = list_; local
52 while (entry != nullptr) {
53 if (entry->Match(pid, tid)) {
56 entry = entry->next_;
59 if (!entry) {
61 entry = new ThreadEntry(pid, tid);
64 entry->ref_count_++;
68 return entry;
71 void ThreadEntry::Remove(ThreadEntry* entry) { argument
[all...]
/system/bt/osi/src/
H A Dallocation_tracker.c51 static bool allocation_entry_freed_checker(hash_map_entry_t *entry, void *context);
179 static bool allocation_entry_freed_checker(hash_map_entry_t *entry, void *context) { argument
180 allocation_t *allocation = (allocation_t *)entry->data;
H A Dconfig.c127 entry_t *entry = entry_find(config, section, key); local
128 if (!entry)
132 int ret = strtol(entry->value, &endptr, 0);
141 entry_t *entry = entry_find(config, section, key); local
142 if (!entry)
145 if (!strcmp(entry->value, "true"))
147 if (!strcmp(entry->value, "false"))
158 entry_t *entry = entry_find(config, section, key); local
159 if (!entry)
162 return entry
191 entry_t *entry = list_node(node); local
199 entry_t *entry = entry_new(key, value); local
220 entry_t *entry = entry_find(config, section, key); local
274 const entry_t *entry = (const entry_t *)list_node(enode); local
390 entry_t *entry = osi_calloc(sizeof(entry_t)); local
415 entry_t *entry = list_node(node); local
[all...]
/system/core/include/log/
H A Dlogger.h33 char msg[0]; /* the entry's payload */
49 char msg[0]; /* the entry's payload */
60 char msg[0]; /* the entry's payload */
64 * The maximum size of the log entry payload that can be
66 * this amount will result in a truncated log entry.
71 * The maximum size of a log entry which can be read from the
82 struct logger_entry_v3 entry; member in union:log_msg::__anon1330
91 return (entry.sec == T.entry.sec) && (entry
[all...]
/system/core/libpixelflinger/codeflinger/
H A DArm64Disassembler.cpp280 disasm_table_entry_t *entry = NULL; local
283 entry = &disasm_table[i];
284 if((code & entry->mask) == entry->value)
298 uint32_t length = strlen(entry->instr_template);
302 get_token(entry->instr_template, index, token);
H A DCodeCache.h96 : entry(a), when(w) { }
97 sp<Assembly> entry; member in struct:android::CodeCache::cache_entry_t
/system/security/keystore/
H A Dauth_token_table.h108 Entry(Entry&& entry) { *this = std::move(entry); } argument
121 bool Supersedes(const Entry& entry) const;
124 bool is_newer_than(const Entry* entry) { argument
125 if (!entry)
127 return timestamp_host_order() > entry->timestamp_host_order();
153 void RemoveEntriesSupersededBy(const Entry& entry);
154 bool IsSupersededBySomeEntry(const Entry& entry);
/system/bt/stack/smp/
H A Dsmp_br_main.c323 ** Description Handle events to the state machine. It looks up the entry
325 ** If it is a valid entry, it gets the state table.Set the next state,
337 UINT8 action, entry; local
353 /* lookup entry / w event & curr_state */
354 /* If entry is ignore, return.
356 if ((event <= SMP_BR_MAX_EVT) && ( (entry = entry_table[event - 1][curr_state])
359 if (entry & SMP_BR_ALL_TABLE_MASK)
361 entry &= ~SMP_BR_ALL_TABLE_MASK;
379 smp_set_br_state(state_table[entry - 1][SMP_BR_SME_NEXT_STATE]);
387 if ((action = state_table[entry
[all...]
/system/core/healthd/
H A DBatteryMonitor.cpp428 struct dirent* entry; local
430 while ((entry = readdir(dir))) {
431 const char* name = entry->d_name;
/system/core/include/utils/
H A DBasicHashtable.h33 // may need to seek further along the chain to find the entry.
36 // The present flag indicates that the bucket contains an initialized entry value.
41 // hash code of the entry's key.
48 // Storage for the entry begins here.
49 char entry[0]; member in struct:android::BasicHashtableImpl::Bucket
70 size_t add(hash_t hash, const void* __restrict__ entry);
74 const size_t mBucketSize; // number of bytes per bucket including the entry
75 const bool mHasTrivialDestructor; // true if the entry type does not require destruction
93 virtual void initializeBucketEntry(Bucket& bucket, const void* __restrict__ entry) const = 0;
157 * TEntry: The entry typ
293 add(hash_t hash, const TEntry& entry) argument
389 memcpy(&entryFor(bucket), entry, sizeof(TEntry)); local
[all...]
H A DLruCache.h93 void attachToCache(Entry& entry);
94 void detachFromCache(Entry& entry);
133 Entry& entry = mTable->editEntryAt(index); local
134 detachFromCache(entry);
135 attachToCache(entry);
136 return entry.value;
154 // Would it be better to initialize a blank entry and assign key, value?
157 Entry& entry = mTable->editEntryAt(index); local
158 attachToCache(entry);
169 Entry& entry local
208 attachToCache(Entry& entry) argument
219 detachFromCache(Entry& entry) argument
[all...]
/system/core/init/
H A Dbootchart.cpp119 struct dirent* entry; local
120 while ((entry = readdir(dir.get())) != NULL) {
123 int pid = strtol(entry->d_name, &end, 10);
124 if (end != NULL && end > entry->d_name && *end == 0) {
/system/core/libcutils/
H A Dhashmap.c115 Entry* entry = map->buckets[i]; local
116 while (entry != NULL) {
117 Entry* next = entry->next;
118 size_t index = calculateIndex(newBucketCount, entry->hash);
119 entry->next = newBuckets[index];
120 newBuckets[index] = entry;
121 entry = next;
143 Entry* entry = map->buckets[i]; local
144 while (entry != NULL) {
145 Entry* next = entry
167 Entry* entry = malloc(sizeof(Entry)); local
225 Entry* entry = map->buckets[index]; local
240 Entry* entry = map->buckets[index]; local
311 Entry* entry = map->buckets[i]; local
331 Entry* entry = map->buckets[i]; local
[all...]
/system/core/libutils/
H A DBasicHashtable.cpp152 size_t BasicHashtableImpl::add(hash_t hash, const void* entry) { argument
183 initializeBucketEntry(*bucket, entry);
229 initializeBucketEntry(*toBucket, fromBucket.entry);
284 initializeBucketEntry(toBucket, fromBucket.entry);
H A DProcessCallStack.cpp134 struct dirent entry; local
162 while ((code = readdir_r(dp, &entry, &ep)) == 0 && ep != NULL) {
/system/core/libutils/tests/
H A DBasicHashtable_test.cpp150 static void getKeyValue(const TEntry& entry, int* key, int* value);
152 template <> void getKeyValue(const SimpleEntry& entry, int* key, int* value) { argument
153 *key = entry.key;
154 *value = entry.value;
157 template <> void getKeyValue(const ComplexEntry& entry, int* key, int* value) { argument
158 *key = entry.key.k;
159 *value = entry.value.v;
402 const SimpleEntry& entry = h.entryAt(index); local
403 ASSERT_GE(entry.key, 0);
404 ASSERT_LT(entry
[all...]
/system/core/libziparchive/
H A Dzip_archive_test.cc276 // An entry that doesn't exist. Should be a negative return code.
305 // An entry that's deflated.
318 // An entry that's stored.
342 // This is a zip file containing a single entry (ab.txt) that contains
405 ZipEntry entry; local
409 ASSERT_EQ(0, FindEntry(handle, empty_name, &entry));
410 ASSERT_EQ(static_cast<uint32_t>(0), entry.uncompressed_length);
412 ASSERT_EQ(0, ExtractToMemory(handle, &entry, buffer, 1));
417 ASSERT_EQ(0, ExtractEntryToFile(handle, &entry, output_fd));
436 ZipEntry entry; local
504 ZipEntry entry; local
[all...]
/system/core/toolbox/upstream-netbsd/usr.bin/du/
H A Ddu.c285 static struct entry { struct
310 struct entry *ohtable;
350 /* Insert the current entry into hashtable */

Completed in 557 milliseconds

12