2020-10-25 09:22:34 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2020, Andreas Kling <kling@serenityos.org>
|
|
|
|
*
|
2021-04-22 08:24:48 +00:00
|
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
2020-10-25 09:22:34 +00:00
|
|
|
*/
|
|
|
|
|
2021-10-31 18:22:53 +00:00
|
|
|
#include <AK/Array.h>
|
2020-10-24 18:14:52 +00:00
|
|
|
#include <LibCore/ArgsParser.h>
|
|
|
|
#include <LibCore/File.h>
|
2022-10-18 06:29:43 +00:00
|
|
|
#include <LibCore/System.h>
|
2022-01-13 20:37:31 +00:00
|
|
|
#include <LibMain/Main.h>
|
2020-10-24 18:14:52 +00:00
|
|
|
#include <ctype.h>
|
2021-11-07 01:15:10 +00:00
|
|
|
#include <string.h>
|
2020-10-24 18:14:52 +00:00
|
|
|
|
2021-10-31 18:22:53 +00:00
|
|
|
static constexpr size_t LINE_LENGTH_BYTES = 16;
|
|
|
|
|
2021-11-19 05:47:40 +00:00
|
|
|
enum class State {
|
|
|
|
Print,
|
|
|
|
PrintFiller,
|
|
|
|
SkipPrint
|
|
|
|
};
|
|
|
|
|
2022-01-13 20:37:31 +00:00
|
|
|
ErrorOr<int> serenity_main(Main::Arguments args)
|
2020-10-24 18:14:52 +00:00
|
|
|
{
|
2022-10-18 06:29:43 +00:00
|
|
|
TRY(Core::System::pledge("stdio rpath"));
|
|
|
|
|
2020-10-24 18:14:52 +00:00
|
|
|
Core::ArgsParser args_parser;
|
2022-04-01 17:58:27 +00:00
|
|
|
char const* path = nullptr;
|
2021-11-19 05:54:46 +00:00
|
|
|
bool verbose = false;
|
2022-10-22 03:54:15 +00:00
|
|
|
Optional<size_t> max_bytes;
|
|
|
|
|
2020-10-24 18:14:52 +00:00
|
|
|
args_parser.add_positional_argument(path, "Input", "input", Core::ArgsParser::Required::No);
|
2021-11-19 05:54:46 +00:00
|
|
|
args_parser.add_option(verbose, "Display all input data", "verbose", 'v');
|
2022-10-22 03:54:15 +00:00
|
|
|
args_parser.add_option(max_bytes, "Truncate to a fixed number of bytes", nullptr, 'n', "bytes");
|
2020-10-24 18:14:52 +00:00
|
|
|
|
2022-01-13 20:37:31 +00:00
|
|
|
args_parser.parse(args);
|
2020-10-24 18:14:52 +00:00
|
|
|
|
|
|
|
RefPtr<Core::File> file;
|
|
|
|
|
2022-01-13 20:37:31 +00:00
|
|
|
if (!path)
|
2020-12-22 22:37:11 +00:00
|
|
|
file = Core::File::standard_input();
|
2022-01-13 20:37:31 +00:00
|
|
|
else
|
|
|
|
file = TRY(Core::File::open(path, Core::OpenMode::ReadOnly));
|
2020-10-24 18:14:52 +00:00
|
|
|
|
2021-10-31 18:22:53 +00:00
|
|
|
auto print_line = [](u8* buf, size_t size) {
|
|
|
|
VERIFY(size <= LINE_LENGTH_BYTES);
|
|
|
|
for (size_t i = 0; i < LINE_LENGTH_BYTES; ++i) {
|
|
|
|
if (i < size)
|
|
|
|
out("{:02x} ", buf[i]);
|
2020-10-24 18:14:52 +00:00
|
|
|
else
|
2021-05-31 14:43:25 +00:00
|
|
|
out(" ");
|
2020-10-24 18:14:52 +00:00
|
|
|
|
|
|
|
if (i == 7)
|
2021-05-31 14:43:25 +00:00
|
|
|
out(" ");
|
2020-10-24 18:14:52 +00:00
|
|
|
}
|
|
|
|
|
2021-10-31 00:05:45 +00:00
|
|
|
out(" |");
|
2020-10-24 18:14:52 +00:00
|
|
|
|
2021-10-31 18:22:53 +00:00
|
|
|
for (size_t i = 0; i < size; ++i) {
|
|
|
|
if (isprint(buf[i]))
|
|
|
|
putchar(buf[i]);
|
2020-10-24 18:14:52 +00:00
|
|
|
else
|
2021-10-31 00:05:45 +00:00
|
|
|
putchar('.');
|
2020-10-24 18:14:52 +00:00
|
|
|
}
|
|
|
|
|
2021-10-31 00:05:45 +00:00
|
|
|
putchar('|');
|
2020-10-24 18:14:52 +00:00
|
|
|
putchar('\n');
|
|
|
|
};
|
|
|
|
|
2021-10-31 18:22:53 +00:00
|
|
|
Array<u8, BUFSIZ> contents;
|
2021-11-19 05:47:40 +00:00
|
|
|
Span<u8> previous_line;
|
2021-10-31 18:22:53 +00:00
|
|
|
static_assert(LINE_LENGTH_BYTES * 2 <= contents.size(), "Buffer is too small?!");
|
2022-10-22 03:54:15 +00:00
|
|
|
size_t bytes_in_buffer = 0;
|
|
|
|
size_t total_bytes_read = 0;
|
|
|
|
size_t bytes_remaining = 0;
|
|
|
|
size_t bytes_to_read = 0;
|
2021-10-31 18:22:53 +00:00
|
|
|
|
|
|
|
int nread;
|
2021-11-19 05:47:40 +00:00
|
|
|
auto state = State::Print;
|
2022-10-22 03:54:15 +00:00
|
|
|
bool is_input_remaining = true;
|
|
|
|
while (is_input_remaining) {
|
|
|
|
bytes_to_read = BUFSIZ - bytes_in_buffer;
|
|
|
|
|
|
|
|
if (max_bytes.has_value()) {
|
|
|
|
bytes_remaining = max_bytes.value() - total_bytes_read;
|
|
|
|
if (bytes_remaining < bytes_to_read) {
|
|
|
|
bytes_to_read = bytes_remaining;
|
|
|
|
is_input_remaining = false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
nread = file->read(&contents[bytes_in_buffer], (int)bytes_to_read);
|
2021-11-06 22:24:18 +00:00
|
|
|
if (nread <= 0)
|
|
|
|
break;
|
2022-10-22 03:54:15 +00:00
|
|
|
|
|
|
|
total_bytes_read += nread;
|
|
|
|
bytes_in_buffer += nread;
|
2021-11-19 05:47:40 +00:00
|
|
|
|
2021-10-31 18:22:53 +00:00
|
|
|
size_t offset;
|
2022-10-22 03:54:15 +00:00
|
|
|
for (offset = 0; offset + LINE_LENGTH_BYTES - 1 < bytes_in_buffer; offset += LINE_LENGTH_BYTES) {
|
2021-11-19 05:54:46 +00:00
|
|
|
if (verbose) {
|
|
|
|
print_line(&contents[offset], LINE_LENGTH_BYTES);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2021-11-19 05:47:40 +00:00
|
|
|
auto current_line = contents.span().slice(offset, LINE_LENGTH_BYTES);
|
|
|
|
bool is_same_contents = (current_line == previous_line);
|
|
|
|
if (!is_same_contents)
|
|
|
|
state = State::Print;
|
|
|
|
else if (is_same_contents && (state != State::SkipPrint))
|
|
|
|
state = State::PrintFiller;
|
|
|
|
|
|
|
|
// Coalesce repeating lines
|
|
|
|
switch (state) {
|
|
|
|
case State::Print:
|
|
|
|
print_line(&contents[offset], LINE_LENGTH_BYTES);
|
|
|
|
break;
|
|
|
|
case State::PrintFiller:
|
|
|
|
outln("*");
|
|
|
|
state = State::SkipPrint;
|
|
|
|
break;
|
|
|
|
case State::SkipPrint:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
previous_line = current_line;
|
2020-10-24 18:14:52 +00:00
|
|
|
}
|
2021-11-19 05:47:40 +00:00
|
|
|
|
2022-10-22 03:54:15 +00:00
|
|
|
bytes_in_buffer -= offset;
|
|
|
|
VERIFY(bytes_in_buffer < LINE_LENGTH_BYTES);
|
2021-11-06 22:24:18 +00:00
|
|
|
// If we managed to make the buffer exactly full, &contents[BUFSIZ] would blow up.
|
2022-10-22 03:54:15 +00:00
|
|
|
if (bytes_in_buffer > 0) {
|
2021-11-06 22:24:18 +00:00
|
|
|
// Regions cannot overlap due to above static_assert.
|
2022-10-22 03:54:15 +00:00
|
|
|
memcpy(&contents[0], &contents[offset], bytes_in_buffer);
|
2021-11-06 22:24:18 +00:00
|
|
|
}
|
|
|
|
}
|
2022-10-22 03:54:15 +00:00
|
|
|
VERIFY(bytes_in_buffer <= LINE_LENGTH_BYTES - 1);
|
|
|
|
if (bytes_in_buffer > 0)
|
|
|
|
print_line(&contents[0], bytes_in_buffer);
|
2020-10-24 18:14:52 +00:00
|
|
|
|
|
|
|
return 0;
|
2020-10-25 09:22:34 +00:00
|
|
|
}
|