forked from aristanetworks/quicktrace-public
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathqtclear.cpp
92 lines (85 loc) · 3.48 KB
/
qtclear.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
// Copyright (c) 2011, Arista Networks, Inc.
// All rights reserved.
// Redistribution and use in source and binary forms, with or without modification,
// are permitted provided that the following conditions are met:
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
// * Neither the name of Arista Networks nor the names of its contributors may
// be used to endorse or promote products derived from this software without
// specific prior written permission.
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
// ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
// IN NO EVENT SHALL ARISTA NETWORKS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
// BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
// ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
// SUCH DAMAGE.
#include <iostream>
#include <QuickTrace/QuickTrace.h>
#include <stdlib.h>
#include <sys/mman.h>
#include <errno.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
// This program clears all of the QuickTrace message counters in one
// or more quicktrace output files. It simply opens the file, mmaps
// enough of it to include all of the counters, and then clears them.
using namespace QuickTrace;
int main( int argc, char const ** argv ) {
if( argc < 2 ) {
std::cerr << "usage: qtclear <file> ..." << std::endl;
exit(1);
}
for( int i = 1 ; i < argc; ++i ) {
char const * filename = argv[i];
int fd = open( filename, O_RDWR, 0777 );
if( fd < 0 ) {
std::cerr << "open " << filename << ": "
<< errno << " " << strerror( errno ) << std::endl;
return 1;
}
struct stat buf;
if ( fstat( fd, &buf ) < 0 ) {
close( fd );
std::cerr << "fstat " << filename << ": "
<< errno << " " << strerror( errno ) << std::endl;
return 1;
}
int size = 16384;
retry:
if ( size > buf.st_size ) {
close( fd );
std::cerr << filename << ": likely not a qt file "
<< std::endl;
return 1;
}
void * m = mmap( 0, size, PROT_WRITE, MAP_SHARED, fd, 0 );
if( m == MAP_FAILED ) {
std::cerr << "mmap " << filename << ": "
<< errno << " " << strerror( errno ) << std::endl;
close( fd );
return 1;
}
TraceFileHeader * tf = (TraceFileHeader*) m;
int fhs = tf->fileHeaderSize;
if( fhs > size ) {
munmap( m, size );
size = fhs;
goto retry;
}
memset( (char*)m + (tf->firstMsgOffset), 0,
tf->fileHeaderSize - tf->firstMsgOffset );
// Call msync to update the file modification time.
msync( m, size, MS_ASYNC );
munmap( m, size );
close( fd );
}
}