X-Git-Url: https://git.saurik.com/cycript.git/blobdiff_plain/c5fa2867a4a09bcc2b3933da72e820fb9f5ad8d1..972562bf68a236b4580b6074415cbf4e07b0a0c6:/Replace.hpp diff --git a/Replace.hpp b/Replace.hpp index a032902..82eed60 100644 --- a/Replace.hpp +++ b/Replace.hpp @@ -1,28 +1,28 @@ /* Cycript - Optimizing JavaScript Compiler/Runtime - * Copyright (C) 2009-2010 Jay Freeman (saurik) + * Copyright (C) 2009-2015 Jay Freeman (saurik) */ -/* GNU Lesser General Public License, Version 3 {{{ */ +/* GNU Affero General Public License, Version 3 {{{ */ /* - * Cycript is free software: you can redistribute it and/or modify it under - * the terms of the GNU Lesser General Public License as published by the - * Free Software Foundation, either version 3 of the License, or (at your - * option) any later version. - * - * Cycript is distributed in the hope that it will be useful, but WITHOUT - * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or - * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public - * License for more details. - * - * You should have received a copy of the GNU Lesser General Public License - * along with Cycript. If not, see . + * This program is free software: you can redistribute it and/or modify + * it under the terms of the GNU Affero General Public License as published by + * the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU Affero General Public License for more details. + + * You should have received a copy of the GNU Affero General Public License + * along with this program. If not, see . **/ /* }}} */ #ifndef CYCRIPT_REPLACE_HPP #define CYCRIPT_REPLACE_HPP -#include "Parser.hpp" +#include "Syntax.hpp" #define $ new($pool) @@ -52,17 +52,17 @@ CYStatements() #define $P1(arg0, args...) \ - $P($I(arg0), ##args) + $P(arg0, ##args) #define $P2(arg0, arg1, args...) \ - $P($I(arg0), $P1(arg1, ##args)) + $P(arg0, $P1(arg1, ##args)) #define $P3(arg0, arg1, arg2, args...) \ - $P($I(arg0), $P2(arg1, arg2, ##args)) + $P(arg0, $P2(arg1, arg2, ##args)) #define $P4(arg0, arg1, arg2, arg3, args...) \ - $P($I(arg0), $P3(arg1, arg2, arg3, ##args)) + $P(arg0, $P3(arg1, arg2, arg3, ##args)) #define $P5(arg0, arg1, arg2, arg3, arg4, args...) \ - $P($I(arg0), $P4(arg1, arg2, arg3, arg4, ##args)) + $P(arg0, $P4(arg1, arg2, arg3, arg4, ##args)) #define $P6(arg0, arg1, arg2, arg3, arg4, arg5, args...) \ - $P($I(arg0), $P5(arg1, arg2, arg3, arg4, arg5, ##args)) + $P(arg0, $P5(arg1, arg2, arg3, arg4, arg5, ##args)) #define $C(args...) \ ($ CYCall(args))