mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-09-21 18:37:58 +03:00
b2f005125d
When the Heap is going down, it's our last chance to run destructors, so add a separate collector mode where we simply skip over the marking phase and go directly to sweeping. This causes everything to get swept and all live cells get destroyed. This way, valgrind reports 0 leaks on exit. :^)
90 lines
3.4 KiB
C++
90 lines
3.4 KiB
C++
/*
|
|
* Copyright (c) 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 <AK/ByteBuffer.h>
|
|
#include <AK/NonnullOwnPtr.h>
|
|
#include <LibCore/ArgsParser.h>
|
|
#include <LibCore/File.h>
|
|
#include <LibJS/AST.h>
|
|
#include <LibJS/Interpreter.h>
|
|
#include <LibJS/Parser.h>
|
|
#include <LibJS/Runtime/Object.h>
|
|
#include <LibJS/Runtime/PrimitiveString.h>
|
|
#include <LibJS/Runtime/Value.h>
|
|
#include <stdio.h>
|
|
|
|
#define PROGRAM 6
|
|
|
|
int main(int argc, char** argv)
|
|
{
|
|
bool dump_ast = false;
|
|
bool gc_on_every_allocation = false;
|
|
bool print_last_result = false;
|
|
const char* script_path = nullptr;
|
|
|
|
Core::ArgsParser args_parser;
|
|
args_parser.add_option(dump_ast, "Dump the AST", "ast-dump", 'A');
|
|
args_parser.add_option(dump_ast, "Print last result", "print-last-result", 'l');
|
|
args_parser.add_option(gc_on_every_allocation, "GC on every allocation", "gc-on-every-allocation", 'g');
|
|
args_parser.add_positional_argument(script_path, "Path to script file", "script");
|
|
args_parser.parse(argc, argv);
|
|
|
|
auto file = Core::File::construct(script_path);
|
|
if (!file->open(Core::IODevice::ReadOnly)) {
|
|
fprintf(stderr, "Failed to open %s: %s\n", script_path, file->error_string());
|
|
return 1;
|
|
}
|
|
auto file_contents = file->read_all();
|
|
|
|
StringView source;
|
|
if (file_contents.size() >= 2 && file_contents[0] == '#' && file_contents[1] == '!') {
|
|
size_t i = 0;
|
|
for (i = 2; i < file_contents.size(); ++i) {
|
|
if (file_contents[i] == '\n')
|
|
break;
|
|
}
|
|
source = StringView((const char*)file_contents.data() + i, file_contents.size() - i);
|
|
} else {
|
|
source = file_contents;
|
|
}
|
|
|
|
JS::Interpreter interpreter;
|
|
interpreter.heap().set_should_collect_on_every_allocation(gc_on_every_allocation);
|
|
|
|
auto program = JS::Parser(JS::Lexer(source)).parse_program();
|
|
|
|
if (dump_ast)
|
|
program->dump(0);
|
|
|
|
auto result = interpreter.run(*program);
|
|
dbg() << "Interpreter returned " << result;
|
|
|
|
if (print_last_result)
|
|
printf("%s\n", result.to_string().characters());
|
|
|
|
return 0;
|
|
}
|