Home
last modified time | relevance | path

Searched refs:TEntry (Results 1 – 2 of 2) sorted by relevance

/system/core/logd/
DLogStatistics.h63 template <typename TKey, typename TEntry>
65 std::unordered_map<TKey, TEntry> map;
90 (size() * (sizeof(TEntry) + unordered_map_per_entry_overhead)) + in sizeOf()
94 typedef typename std::unordered_map<TKey, TEntry>::iterator iterator;
96 typename std::unordered_map<TKey, TEntry>::const_iterator const_iterator;
102 std::array<const TEntry*, len>& out_entries) const { in MaxEntries() argument
107 if constexpr (std::is_same_v<TEntry, UidEntry>) { in MaxEntries()
116 if constexpr (std::is_same_v<TEntry, PidEntry>) { in MaxEntries()
134 num * sizeof(const TEntry*)); in MaxEntries()
145 it = map.insert(std::make_pair(key, TEntry(element))).first; in Add()
[all …]
DLogStatistics.cpp390 template <typename TKey, typename TEntry>
391 void LogStatistics::WorstTwoWithThreshold(const LogHashtable<TKey, TEntry>& table, size_t threshold, in WorstTwoWithThreshold()
395 std::array<const TEntry*, 2> max_entries; in WorstTwoWithThreshold()
767 template <typename TKey, typename TEntry>
768 std::string LogStatistics::FormatTable(const LogHashtable<TKey, TEntry>& table, uid_t uid, in FormatTable()
774 std::array<const TEntry*, maximum_sorted_entries> sorted_entries; in FormatTable()
778 const TEntry* entry = sorted_entries[index]; in FormatTable()