mirror of
https://github.com/tstack/lnav
synced 2024-11-03 23:15:38 +00:00
191 lines
4.9 KiB
C++
191 lines
4.9 KiB
C++
/**
|
|
* 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.
|
|
*/
|
|
|
|
#include "config.h"
|
|
|
|
#include <assert.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <stdlib.h>
|
|
#include <fcntl.h>
|
|
#include <unistd.h>
|
|
|
|
#include <sys/types.h>
|
|
#include <sys/stat.h>
|
|
#include <sys/mman.h>
|
|
|
|
#include <string>
|
|
#include <vector>
|
|
#include <algorithm>
|
|
|
|
#include "lnav_util.hh"
|
|
#include "auto_fd.hh"
|
|
#include "line_buffer.hh"
|
|
|
|
using namespace std;
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
int c, rnd_iters = 5, retval = EXIT_SUCCESS;
|
|
vector<pair<int, int> > index;
|
|
auto_fd fd = STDIN_FILENO;
|
|
int offseti = 0;
|
|
off_t offset = 0;
|
|
int count = 1000;
|
|
struct stat st;
|
|
|
|
while ((c = getopt(argc, argv, "o:i:n:c:")) != -1) {
|
|
switch (c) {
|
|
case 'o':
|
|
if (sscanf(optarg, "%d", &offseti) != 1) {
|
|
fprintf(stderr,
|
|
"error: offset is not an integer -- %s\n",
|
|
optarg);
|
|
retval = EXIT_FAILURE;
|
|
} else {
|
|
offset = offseti;
|
|
}
|
|
break;
|
|
case 'n':
|
|
if (sscanf(optarg, "%d", &rnd_iters) != 1) {
|
|
fprintf(stderr,
|
|
"error: offset is not an integer -- %s\n",
|
|
optarg);
|
|
retval = EXIT_FAILURE;
|
|
}
|
|
break;
|
|
case 'c':
|
|
if (sscanf(optarg, "%d", &count) != 1) {
|
|
fprintf(stderr,
|
|
"error: count is not an integer -- %s\n",
|
|
optarg);
|
|
retval = EXIT_FAILURE;
|
|
}
|
|
break;
|
|
case 'i': {
|
|
FILE *file;
|
|
|
|
if ((file = fopen(optarg, "r")) == NULL) {
|
|
perror("open");
|
|
retval = EXIT_FAILURE;
|
|
} else {
|
|
int line_number = 1, line_offset;
|
|
|
|
while (fscanf(file, "%d", &line_offset) == 1) {
|
|
index.push_back(
|
|
make_pair(line_number, line_offset));
|
|
line_number += 1;
|
|
}
|
|
fclose(file);
|
|
file = NULL;
|
|
}
|
|
}
|
|
break;
|
|
default:
|
|
retval = EXIT_FAILURE;
|
|
break;
|
|
}
|
|
}
|
|
|
|
argc -= optind;
|
|
argv += optind;
|
|
|
|
if (retval != EXIT_SUCCESS) {
|
|
} else if ((argc == 0) && (index.size() > 0)) {
|
|
fprintf(stderr, "error: cannot randomize stdin\n");
|
|
retval = EXIT_FAILURE;
|
|
} else if ((argc > 0) && (fd = open(argv[0], O_RDONLY)) == -1) {
|
|
perror("open");
|
|
retval = EXIT_FAILURE;
|
|
} else if ((argc > 0) && (fstat(fd, &st) == -1)) {
|
|
perror("fstat");
|
|
retval = EXIT_FAILURE;
|
|
} else {
|
|
try {
|
|
off_t last_offset = offset;
|
|
line_buffer lb;
|
|
line_value lv;
|
|
char *maddr;
|
|
|
|
lb.set_fd(fd);
|
|
if (index.size() == 0) {
|
|
shared_buffer_ref sbr;
|
|
|
|
while (count && lb.read_line(offset, sbr, &lv)) {
|
|
printf("%.*s", (int) sbr.length(), sbr.get_data());
|
|
if ((off_t) (last_offset + lv.lv_len) < offset)
|
|
printf("\n");
|
|
last_offset = offset;
|
|
count -= 1;
|
|
}
|
|
} else if ((maddr = (char *) mmap(NULL,
|
|
st.st_size,
|
|
PROT_READ,
|
|
MAP_FILE | MAP_PRIVATE,
|
|
lb.get_fd(),
|
|
0)) == MAP_FAILED) {
|
|
perror("mmap");
|
|
retval = EXIT_FAILURE;
|
|
} else {
|
|
off_t seq_offset = 0;
|
|
|
|
while (lb.read_line(seq_offset, lv)) {}
|
|
do {
|
|
bool ret;
|
|
size_t lpc;
|
|
|
|
random_shuffle(index.begin(), index.end());
|
|
for (lpc = 0; lpc < index.size(); lpc++) {
|
|
|
|
offset = index[lpc].second;
|
|
ret = lb.read_line(offset, lv);
|
|
|
|
assert(ret);
|
|
assert(offset >= 0);
|
|
assert(offset <= st.st_size);
|
|
assert(memcmp(lv.lv_start,
|
|
&maddr[index[lpc].second],
|
|
lv.lv_len) == 0);
|
|
}
|
|
|
|
rnd_iters -= 1;
|
|
} while (rnd_iters);
|
|
|
|
printf("All done\n");
|
|
}
|
|
}
|
|
catch (line_buffer::error &e) {
|
|
fprintf(stderr, "error: %s\n", strerror(e.e_err));
|
|
retval = EXIT_FAILURE;
|
|
}
|
|
}
|
|
|
|
return retval;
|
|
}
|