lnav/test/test_grep_proc2.cc

157 lines
3.9 KiB
C++
Raw Normal View History

2013-05-03 06:02:03 +00:00
/**
* Copyright (c) 2007-2012, Timothy Stack
*
* All rights reserved.
2022-03-16 22:38:08 +00:00
*
2013-05-03 06:02:03 +00:00
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
2022-03-16 22:38:08 +00:00
*
2013-05-03 06:02:03 +00:00
* * 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.
2022-03-16 22:38:08 +00:00
*
2013-05-03 06:02:03 +00:00
* 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;
2022-03-16 22:38:08 +00:00
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2013-05-03 06:02:03 +00:00
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
2009-09-14 01:07:32 +00:00
#include <assert.h>
2022-03-16 22:38:08 +00:00
#include <stdio.h>
2009-09-14 01:07:32 +00:00
#include <stdlib.h>
#include <sys/types.h>
#include <sys/wait.h>
2022-03-16 22:38:08 +00:00
#include "config.h"
2009-09-14 01:07:32 +00:00
#include "grep_proc.hh"
2022-03-16 22:38:08 +00:00
#include "vis_line.hh"
2009-09-14 01:07:32 +00:00
using namespace std;
static struct {
int l_number;
2022-03-16 22:38:08 +00:00
const char* l_value;
2009-09-14 01:07:32 +00:00
} MS_LINES[] = {
2022-03-16 22:38:08 +00:00
{10, ""},
{11, ""},
{12, ""},
{13, ""},
{0, ""},
{1, ""},
{2, ""},
2009-09-14 01:07:32 +00:00
};
class my_source : public grep_proc_source<vis_line_t> {
2009-09-14 01:07:32 +00:00
public:
2022-03-16 22:38:08 +00:00
my_source() : ms_current_line(0){};
2009-09-14 01:07:32 +00:00
2022-03-16 22:38:08 +00:00
bool grep_value_for_line(vis_line_t line_number, string& value_out)
{
bool retval = true;
2009-09-14 01:07:32 +00:00
2022-03-16 22:38:08 +00:00
assert(line_number == MS_LINES[this->ms_current_line].l_number);
value_out = MS_LINES[this->ms_current_line].l_value;
2009-09-14 01:07:32 +00:00
2022-03-16 22:38:08 +00:00
this->ms_current_line += 1;
return retval;
2009-09-14 01:07:32 +00:00
};
int ms_current_line;
};
class my_sleeper_source : public grep_proc_source<vis_line_t> {
2022-03-16 22:38:08 +00:00
bool grep_value_for_line(vis_line_t line_number, string& value_out)
{
sleep(1000);
return true;
2009-09-14 01:07:32 +00:00
};
};
class my_sink : public grep_proc_sink<vis_line_t> {
2009-09-14 01:07:32 +00:00
public:
2022-03-16 22:38:08 +00:00
my_sink() : ms_finished(false){};
void grep_match(grep_proc<vis_line_t>& gp,
vis_line_t line,
int start,
int end){};
2009-09-14 01:07:32 +00:00
2022-03-16 22:38:08 +00:00
void grep_end(grep_proc<vis_line_t>& gp)
{
this->ms_finished = true;
2009-09-14 01:07:32 +00:00
};
bool ms_finished;
};
2022-03-16 22:38:08 +00:00
static void
looper(grep_proc<vis_line_t>& gp)
2009-09-14 01:07:32 +00:00
{
my_sink msink;
2022-03-16 22:38:08 +00:00
2009-09-14 01:07:32 +00:00
gp.set_sink(&msink);
2022-03-16 22:38:08 +00:00
2009-09-14 01:07:32 +00:00
while (!msink.ms_finished) {
vector<struct pollfd> pollfds;
gp.update_poll_set(pollfds);
poll(&pollfds[0], pollfds.size(), -1);
gp.check_poll_set(pollfds);
2009-09-14 01:07:32 +00:00
}
}
2022-03-16 22:38:08 +00:00
int
main(int argc, char* argv[])
2009-09-14 01:07:32 +00:00
{
int eoff, retval = EXIT_SUCCESS;
2022-03-16 22:38:08 +00:00
const char* errptr;
pcre* code;
code = pcre_compile("foobar", PCRE_CASELESS, &errptr, &eoff, NULL);
2012-04-19 18:33:37 +00:00
pcre_refcount(code, 1);
2009-09-14 01:07:32 +00:00
assert(code != NULL);
{
2022-03-16 22:38:08 +00:00
my_source ms;
grep_proc<vis_line_t> gp(code, ms);
gp.queue_request(10_vl, 14_vl);
gp.queue_request(0_vl, 3_vl);
gp.start();
looper(gp);
2009-09-14 01:07:32 +00:00
}
{
2022-03-16 22:38:08 +00:00
my_sleeper_source mss;
grep_proc<vis_line_t>* gp = new grep_proc<vis_line_t>(code, mss);
int status;
2009-09-14 01:07:32 +00:00
2022-03-16 22:38:08 +00:00
gp->queue_request();
gp->start();
2014-03-12 14:11:55 +00:00
2022-03-16 22:38:08 +00:00
assert(wait3(&status, WNOHANG, NULL) == 0);
2009-09-14 01:07:32 +00:00
2022-03-16 22:38:08 +00:00
delete gp;
2014-03-12 14:11:55 +00:00
2022-03-16 22:38:08 +00:00
assert(wait(&status) == -1);
assert(errno == ECHILD);
2009-09-14 01:07:32 +00:00
}
2012-04-24 21:25:38 +00:00
free(code);
2014-03-12 14:11:55 +00:00
2009-09-14 01:07:32 +00:00
return retval;
}