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 <string.h>
|
|
|
|
|
2022-03-31 15:59:19 +00:00
|
|
|
#include "base/auto_fd.hh"
|
2022-03-16 22:38:08 +00:00
|
|
|
#include "config.h"
|
2009-09-14 01:07:32 +00:00
|
|
|
#include "line_buffer.hh"
|
|
|
|
|
2019-06-27 17:19:54 +00:00
|
|
|
using namespace std;
|
|
|
|
|
2022-03-16 22:38:08 +00:00
|
|
|
static const char* TEST_DATA
|
|
|
|
= "Hello, World!\n"
|
|
|
|
"Goodbye, World!\n";
|
2019-06-15 13:32:02 +00:00
|
|
|
|
2022-03-16 22:38:08 +00:00
|
|
|
static void
|
|
|
|
single_line(const char* data)
|
2009-09-14 01:07:32 +00:00
|
|
|
{
|
|
|
|
line_buffer lb;
|
|
|
|
auto_fd pi[2];
|
|
|
|
off_t off = 0;
|
2019-06-15 13:32:02 +00:00
|
|
|
|
2009-09-14 01:07:32 +00:00
|
|
|
assert(auto_fd::pipe(pi) == 0);
|
2015-04-02 20:44:27 +00:00
|
|
|
log_perror(write(pi[1], data, strlen(data)));
|
2009-09-14 01:07:32 +00:00
|
|
|
pi[1].reset();
|
2022-03-16 22:38:08 +00:00
|
|
|
|
2009-09-14 01:07:32 +00:00
|
|
|
lb.set_fd(pi[0]);
|
2019-06-15 13:32:02 +00:00
|
|
|
auto load_result = lb.load_next_line({off});
|
|
|
|
auto li = load_result.unwrap();
|
|
|
|
assert(data[strlen(data) - 1] == '\n' || li.li_partial);
|
2022-03-16 22:38:08 +00:00
|
|
|
assert(li.li_file_range.next_offset() == (off_t) strlen(data));
|
2019-06-15 13:32:02 +00:00
|
|
|
assert(li.li_file_range.fr_size == strlen(data));
|
2022-03-16 22:38:08 +00:00
|
|
|
|
2019-06-15 13:32:02 +00:00
|
|
|
auto next_load_result = lb.load_next_line(li.li_file_range);
|
|
|
|
assert(next_load_result.isOk());
|
|
|
|
assert(next_load_result.unwrap().li_file_range.empty());
|
|
|
|
assert(lb.get_file_size() != -1);
|
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 retval = EXIT_SUCCESS;
|
|
|
|
|
2019-06-15 13:32:02 +00:00
|
|
|
single_line("Dexter Morgan");
|
|
|
|
single_line("Rudy Morgan\n");
|
|
|
|
|
|
|
|
{
|
|
|
|
char fn_template[] = "test_line_buffer.XXXXXX";
|
|
|
|
|
|
|
|
auto fd = auto_fd(mkstemp(fn_template));
|
2019-06-15 13:48:33 +00:00
|
|
|
remove(fn_template);
|
2022-07-07 17:05:06 +00:00
|
|
|
line_buffer lb;
|
2019-06-15 13:32:02 +00:00
|
|
|
|
|
|
|
write(fd, TEST_DATA, strlen(TEST_DATA));
|
|
|
|
lseek(fd, SEEK_SET, 0);
|
|
|
|
|
|
|
|
lb.set_fd(fd);
|
|
|
|
|
|
|
|
shared_buffer_ref sbr;
|
|
|
|
|
|
|
|
auto result = lb.read_range({0, 1024});
|
|
|
|
|
|
|
|
assert(result.isErr());
|
|
|
|
}
|
|
|
|
|
2019-06-27 17:19:54 +00:00
|
|
|
{
|
|
|
|
static string first = "Hello";
|
|
|
|
static string second = ", World!";
|
|
|
|
static string third = "Goodbye, World!";
|
|
|
|
static string last = "\n";
|
|
|
|
|
|
|
|
line_buffer lb;
|
|
|
|
auto_fd pi[2];
|
|
|
|
off_t off = 0;
|
|
|
|
|
|
|
|
assert(auto_fd::pipe(pi) == 0);
|
|
|
|
log_perror(write(pi[1], first.c_str(), first.size()));
|
|
|
|
fcntl(pi[0], F_SETFL, O_NONBLOCK);
|
|
|
|
|
|
|
|
lb.set_fd(pi[0]);
|
|
|
|
auto load_result = lb.load_next_line({off});
|
|
|
|
auto li = load_result.unwrap();
|
|
|
|
assert(li.li_partial);
|
|
|
|
assert(li.li_file_range.fr_size == 5);
|
|
|
|
log_perror(write(pi[1], second.c_str(), second.size()));
|
|
|
|
auto load_result2 = lb.load_next_line({off});
|
|
|
|
li = load_result2.unwrap();
|
|
|
|
assert(li.li_partial);
|
|
|
|
assert(li.li_file_range.fr_size == 13);
|
|
|
|
log_perror(write(pi[1], last.c_str(), last.size()));
|
|
|
|
auto load_result3 = lb.load_next_line({off});
|
|
|
|
li = load_result3.unwrap();
|
|
|
|
assert(!li.li_partial);
|
|
|
|
assert(li.li_file_range.fr_size == 14);
|
|
|
|
auto load_result4 = lb.load_next_line(li.li_file_range);
|
|
|
|
li = load_result4.unwrap();
|
|
|
|
auto last_range = li.li_file_range;
|
|
|
|
assert(li.li_partial);
|
|
|
|
assert(li.li_file_range.empty());
|
|
|
|
log_perror(write(pi[1], third.c_str(), third.size()));
|
|
|
|
auto load_result5 = lb.load_next_line(last_range);
|
|
|
|
li = load_result5.unwrap();
|
|
|
|
assert(li.li_partial);
|
|
|
|
assert(li.li_file_range.fr_size == 15);
|
|
|
|
log_perror(write(pi[1], last.c_str(), last.size()));
|
|
|
|
auto load_result6 = lb.load_next_line(last_range);
|
|
|
|
li = load_result6.unwrap();
|
|
|
|
assert(!li.li_partial);
|
|
|
|
assert(li.li_file_range.fr_size == 16);
|
|
|
|
|
|
|
|
auto load_result7 = lb.load_next_line(li.li_file_range);
|
|
|
|
li = load_result7.unwrap();
|
|
|
|
assert(li.li_partial);
|
|
|
|
assert(li.li_file_range.empty());
|
|
|
|
assert(!lb.is_pipe_closed());
|
|
|
|
|
|
|
|
pi[1].reset();
|
|
|
|
|
|
|
|
auto load_result8 = lb.load_next_line(li.li_file_range);
|
|
|
|
li = load_result8.unwrap();
|
|
|
|
assert(!li.li_partial);
|
|
|
|
assert(li.li_file_range.empty());
|
|
|
|
assert(lb.is_pipe_closed());
|
|
|
|
}
|
|
|
|
|
2009-09-14 01:07:32 +00:00
|
|
|
return retval;
|
|
|
|
}
|