Searched refs:element (Results 1 - 25 of 32) sorted by relevance

12

/system/core/logd/
H A DLogStatistics.h120 inline iterator add(const TKey& key, const LogBufferElement* element) { argument
123 it = map.insert(std::make_pair(key, TEntry(element))).first;
125 it->second.add(element);
140 void subtract(TKey&& key, const LogBufferElement* element) { argument
142 if ((it != map.end()) && it->second.subtract(element)) {
147 void subtract(const TKey& key, const LogBufferElement* element) { argument
149 if ((it != map.end()) && it->second.subtract(element)) {
154 inline void drop(TKey key, const LogBufferElement* element) { argument
157 it->second.drop(element);
214 explicit EntryBase(const LogBufferElement* element) argument
222 add(const LogBufferElement* element) argument
225 subtract(const LogBufferElement* element) argument
256 EntryBaseDropped(const LogBufferElement* element) argument
264 add(const LogBufferElement* element) argument
268 subtract(const LogBufferElement* element) argument
272 drop(const LogBufferElement* element) argument
282 UidEntry(const LogBufferElement* element) argument
298 add(const LogBufferElement* element) argument
320 PidEntry(const LogBufferElement* element) argument
326 PidEntry(const PidEntry& element) argument
359 add(const LogBufferElement* element) argument
395 TidEntry(const LogBufferElement* element) argument
402 TidEntry(const TidEntry& element) argument
439 add(const LogBufferElement* element) argument
462 TagEntry(const LogBufferElement* element) argument
482 add(const LogBufferElement* element) argument
500 TagNameKey(const LogBufferElement* element) argument
590 TagNameEntry(const LogBufferElement* element) argument
617 add(const LogBufferElement* element) argument
749 erase(LogBufferElement* element) argument
[all...]
H A DLogBuffer.cpp63 // In-place element fixup so no need to check reader-lock. Entries
384 // NB: if end is region locked, place element at end of list
466 LogBufferElement* element = *it; local
467 log_id_t id = element->getLogId();
470 // after the element is erased from the main logging list.
474 ? element->getTag()
475 : element->getUid();
483 // element->getUid() may not be AID_SYSTEM for next-best-watermark.
487 mLastWorstPidOfSystem[id].find(element->getPid());
502 ? element
579 coalesce(LogBufferElement* element, unsigned short dropped) argument
596 add(LogBufferElement* element) argument
606 clear(LogBufferElement* element) argument
724 LogBufferElement* element = *it; local
823 LogBufferElement* element = *it; local
965 LogBufferElement* element = *it; local
998 LogBufferElement* element = *it; local
1096 flushTo(SocketClient* reader, const log_time& start, pid_t* lastTid, bool privileged, bool security, int (*filter)(const LogBufferElement* element, void* arg), void* arg) argument
1122 LogBufferElement* element = *it; local
1141 LogBufferElement* element = *it; local
[all...]
H A DLogStatistics.cpp82 void LogStatistics::addTotal(LogBufferElement* element) { argument
83 if (element->getDropped()) return;
85 log_id_t log_id = element->getLogId();
86 unsigned short size = element->getMsgLen();
92 void LogStatistics::add(LogBufferElement* element) { argument
93 log_id_t log_id = element->getLogId();
94 unsigned short size = element->getMsgLen();
103 if (element->getDropped()) {
111 log_time stamp(element->getRealTime());
136 uidTable[log_id].add(element
158 tagNameTable.add(TagNameKey(element), element); local
162 subtract(LogBufferElement* element) argument
201 tagNameTable.subtract(TagNameKey(element), element); local
207 drop(LogBufferElement* element) argument
238 tagNameTable.subtract(TagNameKey(element), element); local
[all...]
H A DLogTimes.cpp191 int LogTimeEntry::FilterFirstPass(const LogBufferElement* element, void* obj) { argument
197 if (element->getDropped()) {
205 me->mStart = element->getRealTime();
208 if ((!me->mPid || (me->mPid == element->getPid())) &&
209 (me->isWatching(element->getLogId()))) {
219 int LogTimeEntry::FilterSecondPass(const LogBufferElement* element, void* obj) { argument
224 me->mStart = element->getRealTime();
226 if (me->skipAhead[element->getLogId()]) {
227 me->skipAhead[element->getLogId()]--;
232 if (element
[all...]
H A DLogWhiteBlackList.h70 bool naughty(LogBufferElement* element);
74 bool nice(LogBufferElement* element);
H A DLogTimes.h140 static int FilterFirstPass(const LogBufferElement* element, void* me);
141 static int FilterSecondPass(const LogBufferElement* element, void* me);
H A DLogReader.cpp156 static int callback(const LogBufferElement* element, void* obj) { argument
158 if ((!me->mPid || (me->mPid == element->getPid())) &&
159 (me->mLogMask & (1 << element->getLogId()))) {
160 log_time real = element->getRealTime();
H A DLogWhiteBlackList.cpp253 bool PruneList::naughty(LogBufferElement* element) { argument
256 if (!(*it).cmp(element)) {
263 bool PruneList::nice(LogBufferElement* element) { argument
266 if (!(*it).cmp(element)) {
/system/chre/util/include/chre/util/
H A Dsynchronized_memory_pool_impl.h35 ElementType *element) {
37 mMemoryPool.deallocate(element);
34 deallocate( ElementType *element) argument
H A Dfixed_size_blocking_queue.h30 * Implements a thread-safe blocking queue that blocks when popping an element
37 * Pushes an element into the queue and notifies any waiting threads that an
38 * element is available.
40 * @param The element to be pushed.
42 * @return true if the element is pushed successfully.
44 bool push(const ElementType& element);
47 * Pops one element from the queue. If the queue is empty, the thread will
48 * block until an element has been pushed.
50 * @return The element that was popped.
H A Dfixed_size_blocking_queue_impl.h27 const ElementType& element) {
31 success = mQueue.push(element);
46 ElementType element(std::move(mQueue.front()));
48 return element;
26 push( const ElementType& element) argument
H A Dsynchronized_memory_pool.h44 * Releases the memory of a previously allocated element. The pointer provided
49 * @param A pointer to an element that was previously allocated by the
52 void deallocate(ElementType *element);
H A Ddynamic_vector.h34 * Random-access iterator that points to some element in the container.
106 * Erases the last element in the vector. Invalid to call on an empty vector.
113 * Copy- or move-constructs an element onto the back of the vector. If the
118 * @param The element to push onto the vector.
119 * @return true if the element was pushed successfully.
121 bool push_back(const ElementType& element);
122 bool push_back(ElementType&& element);
125 * Constructs an element onto the back of the vector. All iterators and
130 * @return true if the element is constructed successfully.
136 * Obtains an element o
[all...]
H A Dmemory_pool.h40 * this data structure has a minimum element size of sizeof(size_t) and means
69 * Releases the memory of a previously allocated element. The pointer provided
73 * @param A pointer to an element that was previously allocated by the
76 void deallocate(ElementType *element);
89 //! The element stored in the slot.
H A Dmemory_pool_impl.h52 void MemoryPool<ElementType, kSize>::deallocate(ElementType *element) { argument
53 uintptr_t elementAddress = reinterpret_cast<uintptr_t>(element);
H A Ddynamic_vector_impl.h94 bool DynamicVector<ElementType>::push_back(const ElementType& element) { argument
97 new (&mData[mSize++]) ElementType(element);
104 bool DynamicVector<ElementType>::push_back(ElementType&& element) { argument
107 new (&mData[mSize++]) ElementType(std::move(element));
186 const ElementType& element) {
189 new (&mData[index]) ElementType(element);
195 bool DynamicVector<ElementType>::insert(size_type index, ElementType&& element) { argument
198 new (&mData[index]) ElementType(std::move(element));
262 DynamicVector<ElementType>::find(const ElementType& element) const {
266 if (mData[i] == element) {
185 insert(size_type index, const ElementType& element) argument
[all...]
H A Darray_queue.h28 * element will not be able to be pushed in.
58 * Obtains the front element of the array queue. It is illegal to access the
59 * front element when the array queue is empty. The user of the API must check
60 * the size() or empty() function prior to accessing the front element to
63 * @return The front element.
68 * Obtains the front element of the array queue. It is illegal to access the
69 * front element when the array queue is empty. The user of the API must check
70 * the size() or empty() function prior to accessing the front element to
73 * @return The front element.
78 * Obtains an element o
[all...]
H A Darray_queue_impl.h76 bool ArrayQueue<ElementType, kCapacity>::push(const ElementType& element) {
79 new (&data()[mTail]) ElementType(element);
85 bool ArrayQueue<ElementType, kCapacity>::push(ElementType&& element) {
88 new (&data()[mTail]) ElementType(std::move(element));
105 // If we used memmove to shift the array down when removing an element in the
H A Dfixed_size_vector.h35 * @return A reference to the last element in the vector
41 * @return A reference to the first element in the vector
91 * Pushes an element onto the back of the vector. It is illegal to push an
93 * full() function prior to pushing another element. All iterators and
96 * @param The element to push onto the vector.
98 void push_back(const ElementType& element);
101 * Constructs an element onto the back of the vector. It is illegal to
103 * return of the full() function prior to constructing another element. All
112 * Obtains an element of the vector given an index. It is illegal to index
117 * @param The index of the element
[all...]
H A Dpriority_queue.h30 * the highest priority element as defined by the CompareFunction.
71 * Pushes an element onto the queue. If the queue requires a resize and that
75 * @param element The element to push onto the queue.
76 * @return true if the element was pushed successfully.
78 bool push(const ElementType& element);
81 * Constructs an element onto the the queue. All iterators and references are
90 * Obtains a const element of the queue given an index. It is illegal to
93 * read out of bounds. It returns the top element with index equal to 0 when
96 * @param index The index of the element
[all...]
H A Dpriority_queue_impl.h53 const ElementType& element) {
54 bool success = mData.push_back(element);
52 push( const ElementType& element) argument
/system/core/liblog/
H A Dlocal_logger.c168 struct LogBufferElement* element; local
170 element = node_to_item(node, struct LogBufferElement, node);
172 free(element);
186 struct LogBufferElement* element) {
187 log_id_t logId = element->logId;
191 log->size[logId] += element->len;
192 log->totalSize[logId] += element->len;
228 list_add_head(&log->head, &element->node);
232 return element->len;
292 struct LogBufferElement* element; local
185 LogBufferLog(struct LogBuffer* log, struct LogBufferElement* element) argument
365 struct LogBufferElement* element; local
399 struct LogBufferElement* element; local
476 struct LogBufferElement* element; local
[all...]
/system/media/camera/docs/
H A Dmetadata_validate.py27 A set of helpful functions for dealing with BeautifulSoup element trees.
67 raise ValueError("Unsupported tag type '%s' for element '%s'" \
77 def find_parent_by_name(element, names):
79 Find the ancestor for an element whose name matches one of those
83 element: A BeautifulSoup Tag corresponding to an XML node
86 A BeautifulSoup element corresponding to the matched parent, or None.
96 # el is now a value pointing to the '<static>' element
98 matching_parents = [i.name for i in element.parents if i.name in names]
105 def find_all_child_tags(element, tag):
112 element
[all...]
H A Dmetadata_parser_xml.py110 def _find_direct_strings(element):
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):
118 return "".join([i.strip() for i in MetadataParserXml._find_direct_strings(element)])
/system/nvram/messages/include/nvram/messages/
H A Dvector.h143 // Appends an element.
144 bool Append(const ElementType& element) NVRAM_WARN_UNUSED_RESULT {
148 data_[size_ - 1] = element;
153 bool Append(ElementType&& element) NVRAM_WARN_UNUSED_RESULT {
157 data_[size_ - 1] = element;

Completed in 597 milliseconds

12