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
|
/**
* Copyright (c) 2007-2012, Timothy Stack
*
* 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 Timothy Stack 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 REGENTS 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 THE REGENTS OR CONTRIBUTORS 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.
*
* @file lnav_util.hh
*
* Dumping ground for useful functions with no other home.
*/
#ifndef lnav_util_hh
#define lnav_util_hh
#include <future>
#include <iterator>
#include <numeric>
#include <string>
#include <type_traits>
#include <vector>
#include <fcntl.h>
#include <poll.h>
#include <sys/resource.h>
#include <sys/time.h>
#include <sys/types.h>
#include <time.h>
#include "base/auto_mem.hh"
#include "base/intern_string.hh"
#include "base/lnav.console.hh"
#include "base/result.h"
#include "config.h"
#include "fmt/format.h"
#include "optional.hpp"
#if SIZEOF_OFF_T == 8
# define FORMAT_OFF_T "%lld"
#elif SIZEOF_OFF_T == 4
# define FORMAT_OFF_T "%ld"
#else
# error "off_t has unhandled size..."
#endif
bool change_to_parent_dir();
bool next_format(const char* const fmt[], int& index, int& locked_index);
namespace std {
inline string
to_string(const string& s)
{
return s;
}
inline string
to_string(const char* s)
{
return s;
}
} // namespace std
inline void
rusagesub(const struct rusage& left,
const struct rusage& right,
struct rusage& diff_out)
{
timersub(&left.ru_utime, &right.ru_utime, &diff_out.ru_utime);
timersub(&left.ru_stime, &right.ru_stime, &diff_out.ru_stime);
diff_out.ru_maxrss = left.ru_maxrss - right.ru_maxrss;
diff_out.ru_ixrss = left.ru_ixrss - right.ru_ixrss;
diff_out.ru_idrss = left.ru_idrss - right.ru_idrss;
diff_out.ru_isrss = left.ru_isrss - right.ru_isrss;
diff_out.ru_minflt = left.ru_minflt - right.ru_minflt;
diff_out.ru_majflt = left.ru_majflt - right.ru_majflt;
diff_out.ru_nswap = left.ru_nswap - right.ru_nswap;
diff_out.ru_inblock = left.ru_inblock - right.ru_inblock;
diff_out.ru_oublock = left.ru_oublock - right.ru_oublock;
diff_out.ru_msgsnd = left.ru_msgsnd - right.ru_msgsnd;
diff_out.ru_msgrcv = left.ru_msgrcv - right.ru_msgrcv;
diff_out.ru_nvcsw = left.ru_nvcsw - right.ru_nvcsw;
diff_out.ru_nivcsw = left.ru_nivcsw - right.ru_nivcsw;
}
inline void
rusageadd(const struct rusage& left,
const struct rusage& right,
struct rusage& diff_out)
{
timeradd(&left.ru_utime, &right.ru_utime, &diff_out.ru_utime);
timeradd(&left.ru_stime, &right.ru_stime, &diff_out.ru_stime);
diff_out.ru_maxrss = left.ru_maxrss + right.ru_maxrss;
diff_out.ru_ixrss = left.ru_ixrss + right.ru_ixrss;
diff_out.ru_idrss = left.ru_idrss + right.ru_idrss;
diff_out.ru_isrss = left.ru_isrss + right.ru_isrss;
diff_out.ru_minflt = left.ru_minflt + right.ru_minflt;
diff_out.ru_majflt = left.ru_majflt + right.ru_majflt;
diff_out.ru_nswap = left.ru_nswap + right.ru_nswap;
diff_out.ru_inblock = left.ru_inblock + right.ru_inblock;
diff_out.ru_oublock = left.ru_oublock + right.ru_oublock;
diff_out.ru_msgsnd = left.ru_msgsnd + right.ru_msgsnd;
diff_out.ru_msgrcv = left.ru_msgrcv + right.ru_msgrcv;
diff_out.ru_nvcsw = left.ru_nvcsw + right.ru_nvcsw;
diff_out.ru_nivcsw = left.ru_nivcsw + right.ru_nivcsw;
}
bool is_dev_null(const struct stat& st);
bool is_dev_null(int fd);
template<typename A>
struct final_action { // slightly simplified
A act;
final_action(A a) : act{a} {}
~final_action() { act(); }
};
template<typename A>
final_action<A>
finally(A act) // deduce action type
{
return final_action<A>{act};
}
void write_line_to(FILE* outfile, const attr_line_t& al);
namespace lnav {
std::string to_json(const std::string& str);
std::string to_json(const lnav::console::user_message& um);
std::string to_json(const attr_line_t& al);
template<typename T>
Result<T, std::vector<lnav::console::user_message>> from_json(
const std::string& json);
} // namespace lnav
#endif
|
