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
|
/**
* 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.
*/
#ifndef textfile_sub_source_hh
#define textfile_sub_source_hh
#include <deque>
#include <unordered_map>
#include "filter_observer.hh"
#include "logfile.hh"
#include "plain_text_source.hh"
#include "textview_curses.hh"
class textfile_sub_source
: public text_sub_source
, public vis_location_history
, public text_anchors {
public:
using file_iterator = std::deque<std::shared_ptr<logfile>>::iterator;
textfile_sub_source() { this->tss_supports_filtering = true; }
~textfile_sub_source() override = default;
bool empty() const { return this->tss_files.empty(); }
size_t size() const { return this->tss_files.size(); }
size_t text_line_count() override;
size_t text_line_width(textview_curses& curses) override
{
return this->tss_files.empty()
? 0
: this->current_file()->get_longest_line_length();
}
void text_value_for_line(textview_curses& tc,
int line,
std::string& value_out,
line_flags_t flags) override;
void text_attrs_for_line(textview_curses& tc,
int row,
string_attrs_t& value_out) override;
size_t text_size_for_line(textview_curses& tc,
int line,
line_flags_t flags) override;
std::shared_ptr<logfile> current_file() const
{
if (this->tss_files.empty()) {
return nullptr;
}
return this->tss_files.front();
}
std::string text_source_name(const textview_curses& tv) override
{
if (this->tss_files.empty()) {
return "";
}
return this->tss_files.front()->get_filename();
}
void to_front(const std::shared_ptr<logfile>& lf);
bool to_front(const std::string& filename);
void set_top_from_off(file_off_t off);
void rotate_left();
void rotate_right();
void remove(const std::shared_ptr<logfile>& lf);
void push_back(const std::shared_ptr<logfile>& lf);
class scan_callback {
public:
virtual void closed_files(
const std::vector<std::shared_ptr<logfile>>& files)
= 0;
virtual void promote_file(const std::shared_ptr<logfile>& lf) = 0;
virtual void scanned_file(const std::shared_ptr<logfile>& lf) = 0;
};
bool rescan_files(scan_callback& callback,
nonstd::optional<ui_clock::time_point> deadline
= nonstd::nullopt);
void text_filters_changed() override;
int get_filtered_count() const override;
int get_filtered_count_for(size_t filter_index) const override;
text_format_t get_text_format() const override;
nonstd::optional<location_history*> get_location_history() override
{
return this;
}
void text_crumbs_for_line(int line,
std::vector<breadcrumb::crumb>& crumbs) override;
nonstd::optional<vis_line_t> row_for_anchor(const std::string& id) override;
nonstd::optional<std::string> anchor_for_row(vis_line_t vl) override;
std::unordered_set<std::string> get_anchors() override;
void quiesce() override;
private:
void detach_observer(std::shared_ptr<logfile> lf)
{
auto* lfo = (line_filter_observer*) lf->get_logline_observer();
lf->set_logline_observer(nullptr);
delete lfo;
}
struct rendered_file {
time_t rf_mtime;
file_ssize_t rf_file_size;
std::unique_ptr<plain_text_source> rf_text_source;
};
struct metadata_state {
time_t ms_mtime;
file_ssize_t ms_file_size;
lnav::document::metadata ms_metadata;
};
std::deque<std::shared_ptr<logfile>> tss_files;
std::deque<std::shared_ptr<logfile>> tss_hidden_files;
std::unordered_map<std::string, rendered_file> tss_rendered_files;
std::unordered_map<std::string, metadata_state> tss_doc_metadata;
};
#endif
|
