Home
last modified time | relevance | path

Searched refs:element (Results 1 – 25 of 42) sorted by relevance

12

/system/core/logd/
DLogStatistics.h120 inline iterator add(const TKey& key, const LogBufferElement* element) { in add() argument
123 it = map.insert(std::make_pair(key, TEntry(element))).first; in add()
125 it->second.add(element); in add()
140 void subtract(TKey&& key, const LogBufferElement* element) { in subtract() argument
142 if ((it != map.end()) && it->second.subtract(element)) { in subtract()
147 void subtract(const TKey& key, const LogBufferElement* element) { in subtract() argument
149 if ((it != map.end()) && it->second.subtract(element)) { in subtract()
154 inline void drop(TKey key, const LogBufferElement* element) { in drop() argument
157 it->second.drop(element); in drop()
214 explicit EntryBase(const LogBufferElement* element) in EntryBase()
[all …]
DLogBuffer.cpp474 LogBufferElement* element = *it; in erase() local
475 log_id_t id = element->getLogId(); in erase()
482 ? element->getTag() in erase()
483 : element->getUid(); in erase()
495 mLastWorstPidOfSystem[id].find(element->getPid()); in erase()
510 ? element->getTag() in erase()
511 : element->getUid(); in erase()
548 stats.erase(element); in erase()
550 stats.subtract(element); in erase()
552 delete element; in erase()
[all …]
DLogStatistics.cpp82 void LogStatistics::addTotal(LogBufferElement* element) { in addTotal() argument
83 if (element->getDropped()) return; in addTotal()
85 log_id_t log_id = element->getLogId(); in addTotal()
86 unsigned short size = element->getMsgLen(); in addTotal()
92 void LogStatistics::add(LogBufferElement* element) { in add() argument
93 log_id_t log_id = element->getLogId(); in add()
94 unsigned short size = element->getMsgLen(); in add()
103 if (element->getDropped()) { in add()
111 log_time stamp(element->getRealTime()); in add()
136 uidTable[log_id].add(element->getUid(), element); in add()
[all …]
DLogTimes.cpp190 int LogTimeEntry::FilterFirstPass(const LogBufferElement* element, void* obj) { in FilterFirstPass() argument
196 if (element->getDropped()) { in FilterFirstPass()
204 me->mStart = element->getRealTime(); in FilterFirstPass()
207 if ((!me->mPid || (me->mPid == element->getPid())) && in FilterFirstPass()
208 (me->isWatching(element->getLogId()))) { in FilterFirstPass()
218 int LogTimeEntry::FilterSecondPass(const LogBufferElement* element, void* obj) { in FilterSecondPass() argument
223 me->mStart = element->getRealTime(); in FilterSecondPass()
225 if (me->skipAhead[element->getLogId()]) { in FilterSecondPass()
226 me->skipAhead[element->getLogId()]--; in FilterSecondPass()
231 if (element->getDropped()) { in FilterSecondPass()
[all …]
DLogWhiteBlackList.h70 bool naughty(LogBufferElement* element);
74 bool nice(LogBufferElement* element);
DLogReader.cpp156 static int callback(const LogBufferElement* element, void* obj) { in onDataAvailable() argument
158 if ((!me->mPid || (me->mPid == element->getPid())) && in onDataAvailable()
159 (me->mLogMask & (1 << element->getLogId()))) { in onDataAvailable()
160 log_time real = element->getRealTime(); in onDataAvailable()
DLogWhiteBlackList.cpp253 bool PruneList::naughty(LogBufferElement* element) { in naughty() argument
256 if (!(*it).cmp(element)) { in naughty()
263 bool PruneList::nice(LogBufferElement* element) { in nice() argument
266 if (!(*it).cmp(element)) { in nice()
DLogTimes.h145 static int FilterFirstPass(const LogBufferElement* element, void* me);
146 static int FilterSecondPass(const LogBufferElement* element, void* me);
/system/core/liblog/
Dlocal_logger.c168 struct LogBufferElement* element; in LogBufferClear() local
170 element = node_to_item(node, struct LogBufferElement, node); in LogBufferClear()
172 free(element); in LogBufferClear()
186 struct LogBufferElement* element) { in LogBufferLog() argument
187 log_id_t logId = element->logId; in LogBufferLog()
191 log->size[logId] += element->len; in LogBufferLog()
192 log->totalSize[logId] += element->len; in LogBufferLog()
229 list_add_head(&log->head, &element->node); in LogBufferLog()
233 return element->len; in LogBufferLog()
293 struct LogBufferElement* element; in writeToLocalWrite() local
[all …]
/system/chre/util/include/chre/util/
Dfixed_size_blocking_queue_impl.h27 const ElementType& element) { in push() argument
31 success = mQueue.push(element); in push()
40 bool FixedSizeBlockingQueue<ElementType, kSize>::push(ElementType&& element) { in push() argument
44 success = mQueue.push(std::move(element)); in push()
59 ElementType element(std::move(mQueue.front())); in pop()
61 return element; in pop()
Ddynamic_vector.h127 bool push_back(const ElementType& element);
128 bool push_back(ElementType&& element);
213 bool insert(size_type index, const ElementType& element);
214 bool insert(size_type index, ElementType&& element);
261 size_type find(const ElementType& element) const;
Ddynamic_vector_impl.h114 bool DynamicVector<ElementType>::push_back(const ElementType& element) { in push_back() argument
117 new (&mData[mSize++]) ElementType(element); in push_back()
124 bool DynamicVector<ElementType>::push_back(ElementType&& element) { in push_back() argument
127 new (&mData[mSize++]) ElementType(std::move(element)); in push_back()
213 const ElementType& element) { in insert() argument
216 new (&mData[index]) ElementType(element); in insert()
222 bool DynamicVector<ElementType>::insert(size_type index, ElementType&& element) { in insert() argument
225 new (&mData[index]) ElementType(std::move(element)); in insert()
287 DynamicVector<ElementType>::find(const ElementType& element) const { in find() argument
291 if (mData[i] == element) { in find()
Dfixed_size_blocking_queue.h44 bool push(const ElementType& element);
45 bool push(ElementType&& element);
Dsynchronized_memory_pool_impl.h35 ElementType *element) { in deallocate() argument
37 mMemoryPool.deallocate(element); in deallocate()
Dmemory_pool_impl.h52 void MemoryPool<ElementType, kSize>::deallocate(ElementType *element) { in deallocate() argument
53 uintptr_t elementAddress = reinterpret_cast<uintptr_t>(element); in deallocate()
Darray_queue_impl.h88 bool ArrayQueue<ElementType, kCapacity>::push(const ElementType& element) { in push() argument
91 new (&data()[mTail]) ElementType(element); in push()
97 bool ArrayQueue<ElementType, kCapacity>::push(ElementType&& element) { in push() argument
100 new (&data()[mTail]) ElementType(std::move(element)); in push()
Dsynchronized_memory_pool.h52 void deallocate(ElementType *element);
Darray_queue.h109 bool push(const ElementType& element);
110 bool push(ElementType&& element);
Dmemory_pool.h76 void deallocate(ElementType *element);
/system/media/camera/docs/
Dmetadata_validate.py77 def find_parent_by_name(element, names): argument
98 matching_parents = [i.name for i in element.parents if i.name in names]
105 def find_all_child_tags(element, tag): argument
130 matching_tags = [i for i in element.children if isinstance(i, Tag) and i.name == tag]
133 def find_child_tag(element, tag): argument
155 matching_tags = find_all_child_tags(element, tag)
161 def find_kind(element): argument
176 parent_kind = find_parent_by_name(element, kinds)
Dmetadata_parser_xml.py110 def _find_direct_strings(element): argument
111 if element.string is not None:
112 return [element.string]
114 return [i for i in element.contents if isinstance(i, NavigableString)]
117 def _strings_no_nl(element): argument
118 return "".join([i.strip() for i in MetadataParserXml._find_direct_strings(element)])
/system/sepolicy/prebuilts/api/28.0/private/
Dsecure_element.te1 # secure element subsystem
12 # the secure element process, from a file in
/system/sepolicy/private/
Dsecure_element.te1 # secure element subsystem
12 # the secure element process, from a file in
/system/nvram/messages/include/nvram/messages/
Dvector.h144 bool Append(const ElementType& element) NVRAM_WARN_UNUSED_RESULT { in Append() argument
148 data_[size_ - 1] = element; in Append()
153 bool Append(ElementType&& element) NVRAM_WARN_UNUSED_RESULT { in Append() argument
157 data_[size_ - 1] = element; in Append()
/system/core/init/test_service/
DREADME.md17 It will attempt to find the first element of each pair of arguments in
18 `/proc/self/status`, and attempt to exactly match the second element of the pair

12