-
Notifications
You must be signed in to change notification settings - Fork 0
/
glp.cpp
606 lines (533 loc) · 12.3 KB
/
glp.cpp
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
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
//---------------------------------------------------------------------------
// Purpose: Parse Gitolite Log files hierarchically to provide statistics
// Author: Roman Dremov
// Date: November 2015
// Usage: glp [-acdhruvw] gitolite.log
//---------------------------------------------------------------------------
// suppress Microsoft deprecated warnings
#define _CRT_SECURE_NO_WARNINGS
#define _CRT_NONSTDC_NO_WARNINGS
#include <stdlib.h>
#include <stdio.h>
#include <time.h>
#include <vector>
using namespace std;
//#define GLPYEAR 2015
#define GLPYEAR 2017
//#define GLPVERSION 1 // original code
//#define GLPVERSION 2 // added version option
//#define GLPVERSION 3 // added Option class
//#define GLPVERSION 4 // added count, minutes, month, year options
#define GLPVERSION 5 // fix null str crash
#define MAX_BACK 10 // when searching packet by ID how many to go back
#define INDENT_SPACES 2 // indent spaces per hierarchical level
#define MAX_BUF_SIZE 512 // per line
// reserve vetor size to prevent small allocations
#define INIT_DATA_SIZE 1024
#define INIT_USER_SIZE 32
#define INIT_ADDR_SIZE INIT_USER_SIZE
#define INIT_CMD_SIZE 2
#define INIT_REPO_SIZE 8
static const char* l_empty = "(null)";
static const char* l_wdays[] = {"Sun", "Mon", "Tus", "Wed", "Thu", "Fri", "Sat"};
static const char* l_months[] = {"Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"};
enum ERROR
{
ERROR_OK = 0,
ERROR_ARG,
ERROR_FILE,
};
enum TYPE
{
TYPE_NONE = 0,
TYPE_SSH,
TYPE_HTTP,
};
inline int cmp_val(const char* v1, const char* v2)
{
if( v1 == v2 )
return 0;
return strcmp(v1, v2);
}
inline int cmp_val(int v1, int v2)
{
if( v1 < v2 )
return -1;
else if( v1 > v2 )
return 1;
return 0;
}
static bool str_match(const char* s1, const char* s2)
{
return 0 == cmp_val(s1, s2);
}
static char* get_term(char*& str, char delim = '\t')
{
if( !str )
return NULL;
char* term = str;
while( *str != delim )
{
switch( *str )
{
case '\n':
*str = 0;
case 0:
str = NULL;
return term;
}
str++;
}
while( *str == delim )
{
*str = 0;
str++;
}
return term;
}
static char* get_val(char*& str, const char* arg)
{
char* strVal = get_term(str);
char* strName = get_term(strVal, '=');
if( strName && strVal && *strVal && str_match(strName, arg) )
return strVal;
return NULL;
}
inline tm LTime(time_t t)
{
return *localtime(&t);
}
inline void out_val(const char* val)
{
if( val )
printf("%s", val);
else
printf("%s", l_empty);
}
class Packet;
typedef int (Packet::*PFNCmp)(const Packet*) const;
typedef void (Packet::*PFNOut)() const;
class Option
{
public:
Option(PFNCmp pfnCmp, PFNOut pfnOut, Option* pNext)
{
m_pfnCmp = pfnCmp;
m_pfnOut = pfnOut;
m_pNext = pNext;
}
~Option()
{
if( m_pNext )
delete m_pNext;
}
int Compare(const Packet* p1, const Packet* p2) const {return (p1->*m_pfnCmp)(p2);}
void Out(const Packet* p) const {return (p->*m_pfnOut)();}
Option* GetNext() const {return m_pNext;}
private:
Option* m_pNext;
PFNCmp m_pfnCmp;
PFNOut m_pfnOut;
};
static Option* g_opts = NULL;
class Packet
{
public:
Packet()
{
memset(this, 0, sizeof(Packet));
}
bool Parse(char* str)
{
ParseTime(str);
ParseTid(str);
if( !ParseType(str) )
return false;
if( m_type > TYPE_NONE )
{
ParseUser(str);
ParseCmdRepo(str);
ParseAddr(str);
}
return true;
}
int CmpAddr(const Packet* p) const {return cmp_val(m_addr, p->m_addr);}
void OutAddr() const {out_val(m_addr);}
int CmpRepo(const Packet* p) const {return cmp_val(m_repo, p->m_repo);}
void OutRepo() const {out_val(m_repo);}
int CmpCmd(const Packet* p) const {return cmp_val(m_cmd, p->m_cmd);}
void OutCmd() const {out_val(m_cmd);}
int CmpUser(const Packet* p) const {return cmp_val(m_user, p->m_user);}
void OutUser() const {out_val(m_user);}
int CmpDelta(const Packet* p) const {return cmp_val(m_delta, p->m_delta);}
void OutDelta() const {printf("%d", m_delta);}
int CmpDay(const Packet* p) const {return cmp_val(LTime(m_time).tm_mday, LTime(p->m_time).tm_mday);}
void OutDay() const {printf("%d", LTime(m_time).tm_mday);}
int CmpWday(const Packet* p) const {return cmp_val(LTime(m_time).tm_wday, LTime(p->m_time).tm_wday);}
void OutWday() const {printf("%s", l_wdays[LTime(m_time).tm_wday]);}
int CmpHour(const Packet* p) const {return cmp_val(LTime(m_time).tm_hour, LTime(p->m_time).tm_hour);}
void OutHour() const {printf("%02d", LTime(m_time).tm_hour);}
int CmpMin(const Packet* p) const {return cmp_val(LTime(m_time).tm_min, LTime(p->m_time).tm_min);}
void OutMin() const {printf("%02d", LTime(m_time).tm_min);}
int CmpMonth(const Packet* p) const {return cmp_val(LTime(m_time).tm_mon, LTime(p->m_time).tm_mon);}
void OutMonth() const {printf("%s", l_months[LTime(m_time).tm_mon]);}
int CmpYear(const Packet* p) const {return cmp_val(LTime(m_time).tm_year, LTime(p->m_time).tm_year);}
void OutYear() const {printf("%4d", LTime(m_time).tm_year + 1900);}
protected:
static int Compare(const void* p1, const void* p2)
{
Option* pOption = g_opts;
while( pOption )
{
int iCmd = pOption->Compare((const Packet*) p1, (const Packet*) p2);
if( iCmd )
return iCmd;
pOption = pOption->GetNext();
}
return 0;
}
void ParseTime(char*& str)
{
const char* strTime = get_term(str);
if( !strTime )
return;
struct tm tm = {0};
sscanf(strTime, "%d-%d-%d.%d:%d:%d", &tm.tm_year, &tm.tm_mon, &tm.tm_mday, &tm.tm_hour, &tm.tm_min, &tm.tm_sec);
tm.tm_year -= 1900;
tm.tm_mon -= 1;
tm.tm_isdst = -1;
m_time = mktime(&tm);
}
void ParseTid(char*& str)
{
const char* strTid = get_term(str);
if( strTid )
m_tid = atoi(strTid);
}
bool ParseType(char*& str)
{
const char* strType = get_term(str);
if( !strType )
return false;
if( str_match(strType, "ssh") )
m_type = TYPE_SSH;
else if( str_match(strType, "http") )
m_type = TYPE_HTTP;
else if( str_match(strType, "END") )
m_bEnd = true;
else if( str_match(strType, "update") )
m_bUpdate = true;
else if( str_match(strType, "pre_git") )
m_bPreGit = true;
else
return false;
return true;
}
void ParseUser(char*& str)
{
m_user = get_val(str, "ARGV");
}
void ParseCmdRepo(char*& str)
{
char* temp = get_val(str, "SOC");
if( temp )
{
m_cmd = get_term(temp, ' ');
if( temp && *temp == '\'' )
{
temp++;
m_repo = get_term(temp, '\'');
}
}
}
void ParseAddr(char*& str)
{
m_addr = get_val(str, "FROM");
}
private:
const char* m_user;
const char* m_repo;
int m_tid;
int m_delta; // packet duration
char m_type; // TYPE
bool m_bEnd; // packet should have it
bool m_bUpdate; // packet has update field
bool m_bPreGit; // packet has pre_git field
const char* m_cmd;
const char* m_addr;
time_t m_time;
friend class Data;
};
class StrMap
{
public:
StrMap(int nReserve)
{
m_v.reserve(nReserve);
}
~StrMap()
{
for(size_t ii=0; ii<m_v.size(); ii++)
free(m_v[ii]);
}
const char* Find(const char* str)
{
if( !str )
str = l_empty;
for(size_t ii=0; ii<m_v.size(); ii++)
{
if( str_match(str, m_v[ii]) )
return m_v[ii];
}
m_v.push_back(strdup(str));
return m_v.back();
}
private:
vector<char*> m_v;
};
class Data
{
public:
Data() : m_users(INIT_USER_SIZE),
m_addrs(INIT_ADDR_SIZE),
m_cmds(INIT_CMD_SIZE),
m_repos(INIT_REPO_SIZE)
{
m_packets.reserve(INIT_DATA_SIZE);
}
void Add(const Packet& packet)
{
if( packet.m_type > TYPE_NONE )
{
m_packets.push_back(packet);
Packet& packet0 = m_packets.back();
packet0.m_user = m_users.Find(packet.m_user);
packet0.m_cmd = m_cmds.Find(packet.m_cmd);
packet0.m_repo = m_repos.Find(packet.m_repo);
packet0.m_addr = m_addrs.Find(packet.m_addr);
}
else
{
int i2 = m_packets.size() - 1;
int i1 = (i2 > MAX_BACK) ? i2 - MAX_BACK : 0;
for(int ii=i2; ii>=i1; ii--)
{
Packet& packet0 = m_packets[ii];
if( packet0.m_tid == packet.m_tid )
{
int delta = (int)(packet.m_time - packet0.m_time);
if( packet0.m_delta < delta )
packet0.m_delta = delta;
if( packet.m_bEnd )
packet0.m_bEnd = packet.m_bEnd;
if( packet.m_bUpdate )
packet0.m_bUpdate = packet.m_bUpdate;
if( packet.m_bPreGit )
packet0.m_bPreGit = packet.m_bPreGit;
return;
}
}
}
}
void Out(bool bCount)
{
if( g_opts )
{
qsort(m_packets.data(), m_packets.size(), sizeof(Packet), &Packet::Compare);
Out(g_opts, 0, m_packets.size(), 0);
}
else if( bCount )
{
printf("%d\n", m_packets.size());
}
else
{
for(size_t ii=0; ii<m_packets.size(); ii++)
{
const Packet& pa = m_packets[ii];
printf("%d", ii + 1);
printf("\t");
struct tm tm = LTime(pa.m_time);
printf("%4d-%s-%02d.%02d:%02d:%02d", tm.tm_year + 1900, l_months[tm.tm_mon], tm.tm_mday, tm.tm_hour, tm.tm_min, tm.tm_sec);
printf("\t"); printf("%d", pa.m_tid);
printf("\t"); out_val(pa.m_user);
printf("\t"); out_val(pa.m_addr);
printf("\t"); out_val(pa.m_repo);
printf("\t"); out_val(pa.m_cmd);
printf("\n");
}
}
}
protected:
void Out(Option* pOption, size_t i0, size_t ic, int spaces)
{
for(size_t ii=i0; ii<ic; )
{
size_t jj = ii + 1;
for( ; jj<ic; jj++)
{
int iCmd = pOption->Compare(&m_packets[ii], &m_packets[jj]);
if( iCmd )
break;
}
printf("%6d %*s", jj-ii, spaces, "");
pOption->Out(&m_packets[ii]);
printf("\n");
Option* pNext = pOption->GetNext();
if( pNext )
Out(pNext, ii, jj, spaces + INDENT_SPACES);
ii = jj;
}
}
private:
vector<Packet> m_packets;
StrMap m_users;
StrMap m_addrs;
StrMap m_cmds;
StrMap m_repos;
};
class Options
{
public:
Options()
{
g_opts = NULL;
}
~Options()
{
if( g_opts )
delete g_opts;
}
int Parse(char opt, char* str)
{
#define OPT_CASE(_o, _n, _s) case _o: return Do(str, _s, &Packet::Cmp##_n, &Packet::Out##_n)
switch( opt )
{
OPT_CASE('a', Addr, "IP address");
OPT_CASE('d', Day, "month day");
OPT_CASE('e', Delta, "time delta per packet");
OPT_CASE('h', Hour, "hour");
OPT_CASE('m', Month, "month");
OPT_CASE('n', Min, "minute");
OPT_CASE('r', Repo, "repository name");
OPT_CASE('u', User, "user name");
OPT_CASE('w', Wday, "week day");
OPT_CASE('x', Cmd, "command");
OPT_CASE('y', Year, "year");
}
return 0;
}
protected:
int Do(char* str, const char* desc, PFNCmp pfnCmp, PFNOut pfnOut)
{
if( str )
{
if( 0 == *str )
{
strcpy(str, desc);
return strlen(str);
}
}
else
g_opts = new Option(pfnCmp, pfnOut, g_opts);
return 1;
}
};
int main(int argc, char* argv[])
{
char buf[MAX_BUF_SIZE];
const char* name = NULL;
const char* opts = NULL;
bool bCount = false;
switch( argc )
{
case 2:
if( str_match(argv[1], "-v") )
{
printf("Version 1.%d by Roman Dremov %d\n", GLPVERSION, GLPYEAR);
return 0;
}
name = argv[1];
break;
case 3:
if( *argv[1] == '-' )
{
if( str_match(argv[1] + 1, "c") )
bCount = true;
else
opts = argv[1] + 1;
name = argv[2];
}
break;
}
bool bValid = true;
if( !name )
bValid = false;
Options options;
if( bValid && opts )
{
for(int ii=strlen(opts)-1; ii>=0; ii--)
{
if( !options.Parse(opts[ii], NULL) )
{
bValid = false;
break;
}
}
}
if( !bValid )
{
char cc;
char* str = buf;
char space[] = " ";
for(cc='a'; cc<='z'; cc++)
{
if( options.Parse(cc, space) )
*str++ = cc;
}
*str = 0;
printf("USE:\n"
"\tglp -v\t\t\t\tto get version info\n"
"\tglp -c gitolite.log\t\tto count entries\n"
"\tglp gitolite.log\t\tto output all entries\n"
"\tglp [-%s] gitolite.log\tto output entries hierarchically\n", buf);
printf("OPTIONS (order defines report sorting hierarchy):\n");
str = buf;
*str = 0;
for(cc='a'; cc<='z'; cc++)
{
if( options.Parse(cc, space) )
{
sprintf(str, "\t%c - ", cc);
str += strlen(str);
str += options.Parse(cc, str);
strcat(str, "\n");
str += strlen(str);
}
}
*str = 0;
printf("%s", buf);
return ERROR_ARG;
}
FILE* pf = fopen(name, "r");
if( !pf )
{
printf("File does not exist: %s\n", name);
return ERROR_FILE;
}
Data data;
do
{
char* str = fgets(buf, sizeof(buf), pf);
if( str )
{
Packet packet;
if( packet.Parse(str) )
data.Add(packet);
}
} while( !feof(pf) );
fclose(pf);
data.Out(bCount);
//getchar();
return ERROR_OK;
}