1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
|
/*
* Copyright (C) 2014 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef _LOGD_LOG_STATISTICS_H__
#define _LOGD_LOG_STATISTICS_H__
#include <sys/types.h>
#include <log/log.h>
#include <log/log_read.h>
#include <utils/List.h>
#define log_id_for_each(i) \
for (log_id_t i = LOG_ID_MIN; i < LOG_ID_MAX; i = (log_id_t) (i + 1))
class PidStatistics {
const pid_t pid;
// Total
size_t mSizesTotal;
size_t mElementsTotal;
// Current
size_t mSizes;
size_t mElements;
char *name;
public:
static const pid_t gone = (pid_t) -1;
PidStatistics(pid_t pid, char *name = NULL);
PidStatistics(const PidStatistics ©);
~PidStatistics();
pid_t getPid() const { return pid; }
char *getName() const { return name; }
void setName(char *name);
void add(unsigned short size);
bool subtract(unsigned short size); // returns true if stats and PID gone
void addTotal(size_t size, size_t element);
size_t sizes() const { return mSizes; }
size_t elements() const { return mElements; }
size_t sizesTotal() const { return mSizesTotal; }
size_t elementsTotal() const { return mElementsTotal; }
// helper
static char *pidToName(pid_t pid);
};
typedef android::List<PidStatistics *> PidStatisticsCollection;
class UidStatistics {
const uid_t uid;
PidStatisticsCollection Pids;
size_t mSizes;
size_t mElements;
public:
UidStatistics(uid_t uid);
~UidStatistics();
PidStatisticsCollection::iterator begin() { return Pids.begin(); }
PidStatisticsCollection::iterator end() { return Pids.end(); }
uid_t getUid() { return uid; }
void add(unsigned short size, pid_t pid);
void subtract(unsigned short size, pid_t pid);
void sort();
static const pid_t pid_all = (pid_t) -1;
// fast track current value
size_t sizes() const { return mSizes; };
size_t elements() const { return mElements; };
// statistical track
size_t sizes(pid_t pid);
size_t elements(pid_t pid);
size_t sizesTotal(pid_t pid = pid_all);
size_t elementsTotal(pid_t pid = pid_all);
// helper
static char *pidToName(pid_t pid) { return PidStatistics::pidToName(pid); }
};
typedef android::List<UidStatistics *> UidStatisticsCollection;
class LidStatistics {
UidStatisticsCollection Uids;
public:
LidStatistics();
~LidStatistics();
UidStatisticsCollection::iterator begin() { return Uids.begin(); }
UidStatisticsCollection::iterator end() { return Uids.end(); }
void add(unsigned short size, uid_t uid, pid_t pid);
void subtract(unsigned short size, uid_t uid, pid_t pid);
void sort();
static const pid_t pid_all = (pid_t) -1;
static const uid_t uid_all = (uid_t) -1;
size_t sizes(uid_t uid = uid_all, pid_t pid = pid_all);
size_t elements(uid_t uid = uid_all, pid_t pid = pid_all);
size_t sizesTotal(uid_t uid = uid_all, pid_t pid = pid_all);
size_t elementsTotal(uid_t uid = uid_all, pid_t pid = pid_all);
};
// Log Statistics
class LogStatistics {
LidStatistics LogIds[LOG_ID_MAX];
size_t mSizes[LOG_ID_MAX];
size_t mElements[LOG_ID_MAX];
bool dgram_qlen_statistics;
static const unsigned short mBuckets[14];
log_time mMinimum[sizeof(mBuckets) / sizeof(mBuckets[0])];
public:
const log_time start;
LogStatistics();
LidStatistics &id(log_id_t log_id) { return LogIds[log_id]; }
void enableDgramQlenStatistics() { dgram_qlen_statistics = true; }
static unsigned short dgram_qlen(unsigned short bucket);
unsigned long long minimum(unsigned short bucket);
void recordDiff(log_time diff, unsigned short bucket);
void add(unsigned short size, log_id_t log_id, uid_t uid, pid_t pid);
void subtract(unsigned short size, log_id_t log_id, uid_t uid, pid_t pid);
void sort();
// fast track current value by id only
size_t sizes(log_id_t id) const { return mSizes[id]; }
size_t elements(log_id_t id) const { return mElements[id]; }
// statistical track
static const log_id_t log_id_all = (log_id_t) -1;
static const uid_t uid_all = (uid_t) -1;
static const pid_t pid_all = (pid_t) -1;
size_t sizes(log_id_t id, uid_t uid, pid_t pid = pid_all);
size_t elements(log_id_t id, uid_t uid, pid_t pid = pid_all);
size_t sizes() { return sizes(log_id_all, uid_all); }
size_t elements() { return elements(log_id_all, uid_all); }
size_t sizesTotal(log_id_t id = log_id_all,
uid_t uid = uid_all,
pid_t pid = pid_all);
size_t elementsTotal(log_id_t id = log_id_all,
uid_t uid = uid_all,
pid_t pid = pid_all);
// *strp = malloc, balance with free
void format(char **strp, uid_t uid, unsigned int logMask, log_time oldest);
// helper
static char *pidToName(pid_t pid) { return PidStatistics::pidToName(pid); }
uid_t pidToUid(pid_t pid);
};
#endif // _LOGD_LOG_STATISTICS_H__
|
