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
|
// Copyright (c) 2016-2023, The Monero Project
//
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without modification, are
// permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice, this list of
// conditions and the following disclaimer.
//
// 2. 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.
//
// 3. Neither the name of the copyright holder 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
// THE COPYRIGHT HOLDER 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.
//
// Parts of this file are originally copyright (c) 2012-2013 The Cryptonote developers
#include <boost/filesystem.hpp>
#include "gtest/gtest.h"
#include "file_io_utils.h"
#include "misc_log_ex.h"
static std::string log_filename;
static void init()
{
boost::filesystem::path p = boost::filesystem::temp_directory_path() / boost::filesystem::unique_path();
log_filename = p.string();
mlog_configure(log_filename, false, 0);
}
static void cleanup()
{
// windows does not let files be deleted if still in use, so leave droppings there
#ifndef _WIN32
boost::filesystem::remove(log_filename);
#endif
}
static size_t nlines(const std::string &str)
{
size_t n = 0;
for (const char *ptr = str.c_str(); *ptr; ++ptr)
if (*ptr == '\n')
++n;
return n;
}
static bool load_log_to_string(const std::string &filename, std::string &str)
{
if (!epee::file_io_utils::load_file_to_string(filename, str))
return false;
for (const char *ptr = str.c_str(); *ptr; ++ptr)
{
if (*ptr == '\n')
{
std::string prefix = std::string(str.c_str(), ptr - str.c_str());
if (prefix.find("New log categories:") != std::string::npos)
{
str = std::string(ptr + 1, strlen(ptr + 1));
break;
}
}
}
return true;
}
static void log()
{
MFATAL("fatal");
MERROR("error");
MWARNING("warning");
MINFO("info");
MDEBUG("debug");
MTRACE("trace");
MCINFO("a.b.c.d", "a.b.c.d");
MCINFO("a.b.c.e", "a.b.c.e");
MCINFO("global", "global");
MCINFO("x.y.z", "x.y.z");
MCINFO("y.y.z", "y.y.z");
MCINFO("x.y.x", "x.y.x");
}
TEST(logging, no_logs)
{
init();
mlog_set_categories("");
log();
std::string str;
ASSERT_TRUE(load_log_to_string(log_filename, str));
ASSERT_TRUE(str == "");
cleanup();
}
TEST(logging, default)
{
init();
log();
std::string str;
ASSERT_TRUE(load_log_to_string(log_filename, str));
ASSERT_TRUE(str.find("global") != std::string::npos);
ASSERT_TRUE(str.find("fatal") != std::string::npos);
ASSERT_TRUE(str.find("error") != std::string::npos);
ASSERT_TRUE(str.find("debug") == std::string::npos);
ASSERT_TRUE(str.find("trace") == std::string::npos);
cleanup();
}
TEST(logging, all)
{
init();
mlog_set_categories("*:TRACE");
log();
std::string str;
ASSERT_TRUE(load_log_to_string(log_filename, str));
ASSERT_TRUE(str.find("global") != std::string::npos);
ASSERT_TRUE(str.find("fatal") != std::string::npos);
ASSERT_TRUE(str.find("error") != std::string::npos);
ASSERT_TRUE(str.find("debug") != std::string::npos);
ASSERT_TRUE(str.find("trace") != std::string::npos);
cleanup();
}
TEST(logging, glob_suffix)
{
init();
mlog_set_categories("x.y*:TRACE");
log();
std::string str;
ASSERT_TRUE(load_log_to_string(log_filename, str));
ASSERT_TRUE(str.find("global") == std::string::npos);
ASSERT_TRUE(str.find("x.y.z") != std::string::npos);
ASSERT_TRUE(str.find("x.y.x") != std::string::npos);
ASSERT_TRUE(str.find("y.y.z") == std::string::npos);
cleanup();
}
TEST(logging, glob_prefix)
{
init();
mlog_set_categories("*y.z:TRACE");
log();
std::string str;
ASSERT_TRUE(load_log_to_string(log_filename, str));
ASSERT_TRUE(str.find("global") == std::string::npos);
ASSERT_TRUE(str.find("x.y.z") != std::string::npos);
ASSERT_TRUE(str.find("x.y.x") == std::string::npos);
ASSERT_TRUE(str.find("y.y.z") != std::string::npos);
cleanup();
}
TEST(logging, last_precedence)
{
init();
mlog_set_categories("global:FATAL,glo*:DEBUG");
log();
std::string str;
ASSERT_TRUE(load_log_to_string(log_filename, str));
ASSERT_TRUE(nlines(str) == 1);
ASSERT_TRUE(str.find("global") != std::string::npos);
ASSERT_TRUE(str.find("x.y.z") == std::string::npos);
ASSERT_TRUE(str.find("x.y.x") == std::string::npos);
ASSERT_TRUE(str.find("y.y.z") == std::string::npos);
cleanup();
}
TEST(logging, multiline)
{
init();
mlog_set_categories("global:INFO");
MGINFO("first\nsecond\nthird");
std::string str;
ASSERT_TRUE(load_log_to_string(log_filename, str));
ASSERT_TRUE(nlines(str) == 3);
ASSERT_TRUE(str.find("global") != std::string::npos);
ASSERT_TRUE(str.find("first") != std::string::npos);
ASSERT_TRUE(str.find("second") != std::string::npos);
ASSERT_TRUE(str.find("third") != std::string::npos);
ASSERT_TRUE(str.find("first\nsecond") == std::string::npos);
ASSERT_TRUE(str.find("second\nthird") == std::string::npos);
cleanup();
}
// These operations might segfault
TEST(logging, copy_ctor_segfault)
{
const el::Logger log1("id1", nullptr);
const el::Logger log2(log1);
}
TEST(logging, operator_equals_segfault)
{
const el::Logger log1("id1", nullptr);
el::Logger log2("id2", nullptr);
log2 = log1;
}
TEST(logging, empty_configurations_throws)
{
el::Logger log1("id1", nullptr);
const el::Configurations cfg;
EXPECT_ANY_THROW(log1.configure(cfg));
}
|
