mirror of
https://github.com/SerenityOS/serenity.git
synced 2025-01-26 19:32:06 -05:00
94ca55cefd
As suggested by Joshua, this commit adds the 2-clause BSD license as a comment block to the top of every source file. For the first pass, I've just added myself for simplicity. I encourage everyone to add themselves as copyright holders of any file they've added or modified in some significant way. If I've added myself in error somewhere, feel free to replace it with the appropriate copyright holder instead. Going forward, all new source files should include a license header.
265 lines
7.3 KiB
C++
265 lines
7.3 KiB
C++
/*
|
|
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
*
|
|
* 2. 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.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS 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 COPYRIGHT HOLDER 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 "CArgsParser.h"
|
|
#include <AK/StringBuilder.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
bool CArgsParserResult::is_present(const String& arg_name) const
|
|
{
|
|
return m_args.contains(arg_name);
|
|
}
|
|
|
|
String CArgsParserResult::get(const String& arg_name) const
|
|
{
|
|
return m_args.get(arg_name).value_or({});
|
|
}
|
|
|
|
const Vector<String>& CArgsParserResult::get_single_values() const
|
|
{
|
|
return m_single_values;
|
|
}
|
|
|
|
CArgsParser::Arg::Arg(const String& name, const String& description, bool required)
|
|
: name(name)
|
|
, description(description)
|
|
, required(required)
|
|
{
|
|
}
|
|
|
|
CArgsParser::Arg::Arg(const String& name, const String& value_name, const String& description, bool required)
|
|
: name(name)
|
|
, description(description)
|
|
, value_name(value_name)
|
|
, required(required)
|
|
{
|
|
}
|
|
|
|
CArgsParser::CArgsParser(const String& program_name)
|
|
: m_program_name(program_name)
|
|
, m_prefix("-")
|
|
{
|
|
}
|
|
|
|
CArgsParserResult CArgsParser::parse(int argc, char** argv)
|
|
{
|
|
CArgsParserResult res;
|
|
|
|
// We should have at least one parameter
|
|
if (argc < 2)
|
|
return {};
|
|
|
|
// We parse the first parameter at the index 1
|
|
if (parse_next_param(1, argv, argc - 1, res) != 0)
|
|
return {};
|
|
|
|
if (!check_required_args(res))
|
|
return {};
|
|
|
|
return res;
|
|
}
|
|
|
|
int CArgsParser::parse_next_param(int index, char** argv, const int params_left, CArgsParserResult& res)
|
|
{
|
|
ASSERT(params_left >= 0);
|
|
if (params_left == 0)
|
|
return 0;
|
|
|
|
String param = argv[index];
|
|
|
|
// We check if the prefix is found at the beginning of the param name
|
|
if (is_param_valid(param)) {
|
|
auto prefix_length = m_prefix.length();
|
|
String param_name = param.substring(prefix_length, param.length() - prefix_length);
|
|
|
|
auto arg = m_args.find(param_name);
|
|
if (arg == m_args.end()) {
|
|
printf("Unknown arg \"");
|
|
if (!param_name.is_null())
|
|
printf("%s", param_name.characters());
|
|
printf("\"\n");
|
|
return -1;
|
|
}
|
|
|
|
// If this parameter must be followed by a value, we look for it
|
|
if (!arg->value.value_name.is_null()) {
|
|
if (params_left < 2) {
|
|
printf("Missing value for argument %s\n", arg->value.name.characters());
|
|
return -1;
|
|
}
|
|
|
|
String next = String(argv[index + 1]);
|
|
|
|
if (is_param_valid(next)) {
|
|
printf("Missing value for argument %s\n", arg->value.name.characters());
|
|
return -1;
|
|
}
|
|
|
|
res.m_args.set(arg->value.name, next);
|
|
return parse_next_param(index + 2, argv, params_left - 2, res);
|
|
}
|
|
|
|
// Single argument, not followed by a value
|
|
res.m_args.set(arg->value.name, "");
|
|
return parse_next_param(index + 1, argv, params_left - 1, res);
|
|
}
|
|
|
|
// Else, it's a value alone, a file name parameter for example
|
|
res.m_single_values.append(param);
|
|
return parse_next_param(index + 1, argv, params_left - 1, res);
|
|
}
|
|
|
|
bool CArgsParser::is_param_valid(const String& param_name)
|
|
{
|
|
return param_name.length() >= m_prefix.length() &&
|
|
param_name.substring(0, m_prefix.length()) == m_prefix;
|
|
}
|
|
|
|
bool CArgsParser::check_required_args(const CArgsParserResult& res)
|
|
{
|
|
for (auto& it : m_args) {
|
|
if (it.value.required) {
|
|
if (!res.is_present(it.value.name))
|
|
return false;
|
|
}
|
|
}
|
|
|
|
int required_arguments = 0;
|
|
for (const auto& a : m_single_args) {
|
|
if (a.required) {
|
|
required_arguments++;
|
|
}
|
|
}
|
|
|
|
if (required_arguments != 0) {
|
|
if (res.m_single_values.size() < required_arguments)
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
void CArgsParser::add_required_arg(const String& name, const String& description)
|
|
{
|
|
m_args.set(name, Arg(name, description, true));
|
|
}
|
|
|
|
void CArgsParser::add_required_arg(const String& name, const String& value_name, const String& description)
|
|
{
|
|
m_args.set(name, Arg(name, value_name, description, true));
|
|
}
|
|
|
|
void CArgsParser::add_arg(const String& name, const String& description)
|
|
{
|
|
m_args.set(name, Arg(name, description, false));
|
|
}
|
|
|
|
void CArgsParser::add_arg(const String& name, const String& value_name, const String& description)
|
|
{
|
|
m_args.set(name, Arg(name, value_name, description, false));
|
|
}
|
|
|
|
void CArgsParser::add_single_value(const String& name)
|
|
{
|
|
m_single_args.append(SingleArg { name, false });
|
|
}
|
|
|
|
void CArgsParser::add_required_single_value(const String& name)
|
|
{
|
|
if (m_single_args.size() != 0) {
|
|
// adding required arguments after non-required arguments would be nonsensical
|
|
ASSERT(m_single_args.last().required);
|
|
}
|
|
m_single_args.append(SingleArg { name, true });
|
|
}
|
|
|
|
String CArgsParser::get_usage() const
|
|
{
|
|
StringBuilder sb;
|
|
|
|
sb.append("usage : ");
|
|
sb.append(m_program_name);
|
|
sb.append(" ");
|
|
|
|
for (auto& it : m_args) {
|
|
if (it.value.required)
|
|
sb.append("<");
|
|
else
|
|
sb.append("[");
|
|
|
|
sb.append(m_prefix);
|
|
sb.append(it.value.name);
|
|
|
|
if (!it.value.value_name.is_null()) {
|
|
sb.append(" ");
|
|
sb.append(it.value.value_name);
|
|
}
|
|
|
|
if (it.value.required)
|
|
sb.append("> ");
|
|
else
|
|
sb.append("] ");
|
|
}
|
|
|
|
for (auto& arg : m_single_args) {
|
|
if (arg.required)
|
|
sb.append("<");
|
|
else
|
|
sb.append("[");
|
|
|
|
sb.append(arg.name);
|
|
|
|
if (arg.required)
|
|
sb.append("> ");
|
|
else
|
|
sb.append("] ");
|
|
}
|
|
|
|
sb.append("\n");
|
|
|
|
for (auto& it : m_args) {
|
|
sb.append(" ");
|
|
sb.append(m_prefix);
|
|
sb.append(it.value.name);
|
|
|
|
if (!it.value.value_name.is_null()) {
|
|
sb.append(" ");
|
|
sb.append(it.value.value_name);
|
|
}
|
|
|
|
sb.append(" : ");
|
|
sb.append(it.value.description);
|
|
sb.append("\n");
|
|
}
|
|
|
|
return sb.to_string();
|
|
}
|
|
|
|
void CArgsParser::print_usage() const
|
|
{
|
|
printf("%s\n", get_usage().characters());
|
|
}
|