Skip to content

Instantly share code, notes, and snippets.

@eseidel
Created April 5, 2013 09:19
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save eseidel/5317911 to your computer and use it in GitHub Desktop.
Save eseidel/5317911 to your computer and use it in GitHub Desktop.
Patch with a script capable of removing ENABLE(), USE(), etc. macros from WebCore.
diff --git a/Source/WebCore/SpacingHeuristics.pm b/Source/WebCore/SpacingHeuristics.pm
new file mode 100644
index 0000000..7de0172
--- /dev/null
+++ b/Source/WebCore/SpacingHeuristics.pm
@@ -0,0 +1,101 @@
+#!/usr/bin/perl -w
+
+# Copyright (C) 2006 Apple Computer, Inc. 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.
+# 3. Neither the name of Apple Computer, Inc. ("Apple") 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 APPLE AND ITS 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 APPLE OR ITS 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.
+
+# Used for helping remove extra blank lines from files when processing.
+# see split-class for an example usage (or other scripts in bugzilla)
+
+BEGIN {
+ use Exporter ();
+ our ($VERSION, @ISA, @EXPORT, @EXPORT_OK, %EXPORT_TAGS);
+ $VERSION = 1.00;
+ @ISA = qw(Exporter);
+ @EXPORT = qw(&resetSpacingHeuristics &isOnlyWhiteSpace &applySpacingHeuristicsAndPrint &setPreviousAllowedLine &setPreviousAllowedLine &printPendingEmptyLines &ignoringLine);
+ %EXPORT_TAGS = ();
+ @EXPORT_OK = ();
+}
+
+our @EXPORT_OK;
+
+my $justFoundEmptyLine = 0;
+my $previousLineWasDisallowed = 0;
+my $previousAllowedLine = "";
+my $pendingEmptyLines = "";
+
+sub resetSpacingHeuristics
+{
+ $justFoundEmptyLine = 0;
+ $previousLineWasDisallowed = 0;
+ $previousAllowedLine = "";
+ $pendingEmptyLines = "";
+}
+
+sub isOnlyWhiteSpace
+{
+ my $line = shift;
+ my $isOnlyWhiteSpace = ($line =~ m/^\s+$/);
+ $pendingEmptyLines .= $line if ($isOnlyWhiteSpace);
+ return $isOnlyWhiteSpace;
+}
+
+sub applySpacingHeuristicsAndPrint
+{
+ my ($out, $line) = @_;
+
+ printPendingEmptyLines($out, $line);
+ $previousLineWasDisallowed = 0;
+ print $out $line;
+}
+
+sub setPreviousAllowedLine
+{
+ my $line = shift;
+ $previousAllowedLine = $line;
+}
+
+sub printPendingEmptyLines
+{
+ my $out = shift;
+ my $line = shift;
+ if ($previousLineWasDisallowed) {
+ if (!($pendingEmptyLines eq "") && !($previousAllowedLine =~ m/{\s*$/) && !($line =~ m/^\s*}/)) {
+ $pendingEmptyLines = "\n";
+ } else {
+ $pendingEmptyLines = "";
+ }
+ }
+ print $out $pendingEmptyLines;
+ $pendingEmptyLines = "";
+}
+
+sub ignoringLine
+{
+ # my $line = shift; # ignoring input argument
+ $previousLineWasDisallowed = 1;
+}
+
+1;
\ No newline at end of file
diff --git a/Source/WebCore/partpp.pl b/Source/WebCore/partpp.pl
new file mode 100755
index 0000000..9235f27
--- /dev/null
+++ b/Source/WebCore/partpp.pl
@@ -0,0 +1,591 @@
+#!/usr/bin/perl -w
+#
+# Partial Preprocessor
+#
+# This program processes C preprocessor conditionals, eliminating
+# conditions known to be true or false. This can be used to simplify
+# #ifdef-ridden code. This program attempts to be smart about complex
+# conditions. For example,
+# #if defined(foo) && defined(bar) || defined(huh)
+# is replaced by
+# #if defined(huh)
+# when we know that foo is defined and bar is not. For another example,
+# partpp -U__WIN32__
+# would eliminate all Win32-specific code from a given source code.
+#
+# Parameters:
+# -Dsym we know that sym is defined
+# -Usym we know that sym is not defined
+# -C assume that user wrote "clean" code, that is, all
+# object-like macros behave as objects
+# -d process #define/#undef directives in order to
+# keep our dictionary up-to-date.
+# -f force simplify expressions even when they don't contain
+# any of our symbols
+# -eexpr evaluate expression and print simplified version
+#
+# The -C option deserves explanation: assume the following:
+# #define X 0) - (1
+# #if (defined(foo) || X)
+# Assuming foo is defined, the #if expression would be equivalent to
+# #if (1 || X)
+# which is at first sight equivalent to
+# #if (X)
+# which is equal to "#if -1" i.e. true. However, the original
+# expression is "#if (1 || 0) - (1)" which is false. To guarantee
+# correctness, we assume that this can happen, and pass through
+# expressions containing "raw" macro names unchanged. With -C, we
+# assume user doesn't write such hacks (that is, all non-function
+# macros are properly parenthesized expressions), and would replace
+# the starting expression with "(X)".
+#
+# With -f, this program simplifies expressions even if they don't
+# contain one of our symbols. For example, with -f,
+# #if 1 || 2
+# is simplified to "#if 1". Because partpp computes in decimal (and
+# thus makes code containing hex/oct computations less readable),
+# this is normally not done on unrelated expressions.
+#
+# Bugs:
+# - when we modify a conditional line, comments get lost
+# - results may be incorrect if an #include file #undef's or
+# #define's a symbol passed in by -D/-U. The -d option may make
+# this even worse.
+# - #elif is not supported
+# - `#if 0' and `#if 1' are eliminated even when -f is not specified
+#
+# (c) 2002 by Stefan Reuther
+#
+
+use strict;
+use vars qw{ %defined @files $opt_optimistic $opt_defines @exprs
+ $opt_force
+ $seen_defined };
+use SpacingHeuristics;
+
+$opt_optimistic = 0;
+$opt_defines = 0;
+$opt_force = 0;
+
+my $allow_cc = 0;
+
+foreach (@ARGV) {
+ if (/^--begin$/) {
+ $allow_cc = 1;
+ } elsif (/^--end$/) {
+ $allow_cc = 0;
+ } elsif (/^-D(.+)/) {
+ $defined{$1} = 1;
+ } elsif (/^-U(.+)/) {
+ $defined{$1} = 0;
+ } elsif (!$allow_cc && /^-C$/) {
+ $opt_optimistic = 1;
+ } elsif (!$allow_cc && /^-d$/) {
+ $opt_defines = 1;
+ } elsif (!$allow_cc && /^-f$/) {
+ $opt_force = 1;
+ } elsif (!$allow_cc && /^-e(.*)/) {
+ push @exprs, $1;
+ } elsif (/^-h$/ || /^--?help$/) {
+ print "$0 - partial preprocessor
+
+usage: $0 [-Dsym...] [-Usym...] [-C] [-d] [-f] [-h|--help] [files...]
+
+-Dsym define a symbol
+-Usym undefine a symbol
+-C assume 'clean' code (detailed info in source code)
+-d process #define/#undef lines
+-f force simplify
+
+C compiler options can be passed in --begin --end, such as
+ $0 --begin -Dsym -Dsym -Idir -Ldir -llib --end file.c
+\(this program will then ignore options it doesn't know).
+
+If no files specified, processes stdin. Output always goes to stdout.
+
+\(c) 2002 Stefan Reuther <Streu\@gmx.de>.\n";
+ exit 0;
+ } else {
+ if ($_ =~ /^-/ && $_ ne '-') {
+ die "bad parameter `$_'\n"
+ unless $allow_cc;
+ } else {
+ push @files, $_;
+
+ }
+ }
+}
+push @files, "-" if !@files && !@exprs;
+
+my $exit = 0;
+foreach (@exprs) {
+ print $_, ":\n- ", eval_expr($_), "\n";
+}
+foreach (@files) {
+ if ($_ eq '-') {
+ process (\*STDIN, \*STDOUT);
+ } else {
+ open IN, "< $_" or do { print STDERR "$_: $!\n"; $exit=1; next; };
+ process (\*IN, \*STDOUT);
+ close IN;
+ }
+}
+exit $exit;
+
+################################# process #################################
+
+# process (infd, outfd)
+# - process one file. This is the engine of the program.
+sub process {
+ my ($in, $out) = @_;
+ my $total;
+ my @ifstack;
+ my $out_enabled = 1;
+ # line loop
+ LINE:
+ while (1) {
+ # read one "virtual" line
+ $total = "";
+ do {
+ my $line = <$in>;
+ if (!defined $line) {
+ last LINE if $total eq '';
+ die "$_:$.: unterminated comment\n";
+ }
+ while ($line =~ /\\\n$/) {
+ my $next = <$in>;
+ die "$_:$.: unexpected end of file\n" if not defined $next;
+ $line .= $next;
+ }
+ $total .= $line;
+ } while (! is_complete($total));
+
+ next if (isOnlyWhiteSpace($total));
+
+ # remove comments to see if it's a pp command
+ my $single_line = $total; $single_line =~ s/\\\n//sg;
+ my $command = "";
+ while (1) {
+ last if $single_line =~ m/\G$/sgc;
+ if ($single_line =~ m{\G([^\"\'/]+)}sgc
+ || $single_line =~ m{\G('([^\'\\]|\\.)*')}sgc
+ || $single_line =~ m{\G("([^\"\\]|\\.)*")}sgc
+ || $single_line =~ m{\G(/[^/*])}sgc)
+ {
+ $command .= $1;
+ next;
+ }
+ if ($single_line =~ m{\G//.*}sgc
+ || $single_line =~ m{\G/\*.*?\*/}sgc)
+ {
+ $command .= " ";
+ next;
+ }
+ die "huh?";
+ }
+ if ($command =~ /^\s*\#\s*([a-z]+)\s*(.*)/) {
+ # pp command
+ my ($cm, $arg) = ($1, trim($2));
+ if ($cm eq 'ifdef') {
+ if ($out_enabled) {
+ if (exists $defined{$arg}) {
+ $out_enabled = $defined{$arg};
+ unshift @ifstack, $out_enabled;
+ } else {
+ unshift @ifstack, 'unknown';
+ applySpacingHeuristicsAndPrint($out, $total);
+ }
+ } else {
+ unshift @ifstack, 1;
+ }
+ } elsif ($cm eq 'ifndef') {
+ if ($out_enabled) {
+ if (defined $defined{$arg}) {
+ $out_enabled = 1 - $defined{$arg};
+ unshift @ifstack, $out_enabled;
+ } else {
+ unshift @ifstack, 'unknown';
+ applySpacingHeuristicsAndPrint($out, $total);
+ }
+ } else {
+ unshift @ifstack, 1;
+ }
+ } elsif ($cm eq 'if') {
+ if ($out_enabled) {
+ my $result = trim(eval_expr($arg));
+ if ($result !~ /\D/) {
+ $out_enabled = ($result ? "1" : "0");
+ unshift @ifstack, $out_enabled;
+ ignoringLine($total);
+ } else {
+ unshift @ifstack, 'unknown';
+ applySpacingHeuristicsAndPrint($out, "#if $result\n");
+ }
+ } else {
+ unshift @ifstack, 1;
+ }
+ } elsif ($cm eq 'elif') {
+ print STDERR "#elif is not yet implemented, ignoring.\n";
+ applySpacingHeuristicsAndPrint($out, $total);
+ } elsif ($cm eq 'else') {
+ die "#else without #if"
+ if ! @ifstack;
+ if ($out_enabled) {
+ # output can be enabled if a) we don't know or b) we
+ # know our condition is true
+ if ($ifstack[0] eq '1') {
+ $ifstack[0] = '0';
+ $out_enabled = 0;
+ } else {
+ applySpacingHeuristicsAndPrint($out, $total);
+ }
+ } else {
+ if ($ifstack[0] eq '0') {
+ $ifstack[0] = '1';
+ $out_enabled = check_out(@ifstack);
+ }
+ }
+ } elsif ($cm eq 'endif') {
+ die "#endif without #if"
+ if ! @ifstack;
+ my $why = shift @ifstack;
+ $out_enabled = check_out (@ifstack);
+ if ($out_enabled && ($why ne '0' && $why ne '1')) {
+ applySpacingHeuristicsAndPrint($out, $total);
+ }
+ } else {
+ if ($cm eq 'define') {
+ if ($out_enabled && $opt_defines && $arg =~ m{^(\w+)}) {
+ $defined{$1} = 1;
+ }
+ } elsif ($cm eq 'undef') {
+ if ($out_enabled && $opt_defines && $arg =~ m{^(\w+)}) {
+ $defined{$1} = 0;
+ }
+ } elsif ($cm ne 'include' && $cm ne 'pragma' && $cm ne 'error' && $cm ne 'import' && $cm ne 'warning') {
+ die "$_:$.: unknown preprocessor command '$cm'\n";
+ }
+ applySpacingHeuristicsAndPrint($out, $total)
+ if $out_enabled;
+ }
+ } else {
+ applySpacingHeuristicsAndPrint($out, $total)
+ if $out_enabled;
+ }
+ if ($out_enabled) {
+ setPreviousAllowedLine($total);
+ } else {
+ ignoringLine($total);
+ }
+ }
+ printf "$_:$.: %d unterminated conditional(s) still open\n", scalar @ifstack
+ if @ifstack;
+ printPendingEmptyLines($out);
+}
+
+# true iff $_[0] is a complete line. Complete lines may not contain
+# partial comments.
+sub is_complete {
+ my $line = shift;
+ $line =~ s/\\\n//sg;
+ while (1) {
+ last if $line =~ /\G$/sgc;
+ next if ($line =~ m{\G[^\"\'/]+}sgc
+ || $line =~ m{\G'([^\'\\]|\\.)*'}sgc
+ || $line =~ m{\G"([^\"\\]|\\.)*"}sgc
+ || $line =~ m{\G/[^/*]}sgc
+ || $line =~ m{\G//.*}sgc
+ || $line =~ m{\G/\*.*?\*/}sgc);
+ die "$_:$.: literal across lines\n"
+ if ($line =~ m{\G[\"\']}sgc);
+ # it is a comment
+ return 0;
+ }
+ return 1;
+}
+
+# Given a list of status tokens ('0', '1', 'anything else'), decide
+# whether we can safely suppress output.
+sub check_out {
+ foreach (@_) {
+ if ($_ eq '0') {
+ return 0;
+ }
+ }
+ return 1;
+}
+
+# Remove leading and trailing whitespace.
+sub trim {
+ my $x = shift;
+ $x =~ s/^\s+//s;
+ $x =~ s/\s+$//s;
+ $x;
+}
+
+# Given an expression, return simplified version thereof (i.e.
+# defined(X) expanded if known).
+sub eval_expr {
+ local $_ = shift;
+ local $seen_defined = $opt_force;
+ my $result = eval_cond();
+ return $_ if !/\G\s*$/sgc || $result =~ m{/\*ERROR\*/} || !$seen_defined;
+ $result;
+}
+
+# Parse conditional-expression production. We process these, so
+# "#if defined(A) ? defined(B) : 0" works.
+sub eval_cond {
+ my $a = eval_or();
+ if (m{\G\s*\?}sgc) {
+ # conditional operator
+ my $lhs = eval_cond();
+ return "/*ERROR*/" if not /\G\s*:/sgc;
+ my $rhs = eval_cond();
+ if ($a =~ /\D/) {
+ return "$a ? $lhs : $rhs";
+ } else {
+ return $a ? $lhs : $rhs;
+ }
+ } else {
+ return $a;
+ }
+}
+
+# Parse logical-or-expression. Evaluates to "1" if one part known to
+# be defined, "0" if all parts known to be undefined, "||" of all
+# unknown terms else.
+sub eval_or {
+ my @terms;
+ my @all;
+ my $true = 0;
+ do {
+ my $a = eval_and();
+ push @all, $a;
+ if ($a =~ /\D/) {
+ push @terms, $a;
+ } else {
+ $true ||= $a+0;
+ }
+ } while (m{\G\s*\|\|}sgc);
+ return (@all == 1
+ ? $all[0]
+ : $true
+ ? "1"
+ : !@terms
+ ? "0"
+ : @terms == 1
+ ? "0 || $terms[0]"
+ : join " || ", @terms);
+}
+
+# Parse logical-and-expression. Evaluates to "0" if one part known to
+# be undefined, "1" if all parts known to be defined, "&&" of all
+# unknown terms else.
+sub eval_and {
+ my @terms;
+ my @all;
+ my $true = 1;
+ do {
+ my $a = eval_bitor();
+ push @all, $a;
+ if ($a =~ /\D/) {
+ push @terms, $a;
+ } else {
+ $true &&= $a+0;
+ }
+ } while (m{\G\s*\&\&}sgc);
+ return (@all == 1
+ ? $all[0]
+ : !$true
+ ? "0"
+ : !@terms
+ ? "1"
+ : @terms == 1
+ ? "1 && $terms[0]"
+ : join " && ", @terms);
+}
+
+# Parse inclusive-or-expression. This combines the known terms to one,
+# that is, `#if 1 + (2 | 3)' yields `#if 1 + 3'.
+sub eval_bitor {
+ my @terms;
+ my $value = 0;
+ do {
+ my $a = eval_bitxor();
+ if ($a =~ /\D/) {
+ push @terms, $a;
+ } else {
+ $value |= $a+0;
+ }
+ } while (m{\G\s*\|(?=$|[^|])}sgc);
+ push @terms, $value if $value;
+ return (@terms ? join " | ", @terms : "0");
+}
+
+# Parse exclusive-or-expression. This combines the known terms to one,
+# that is, `#if 1 + (2 ^ 3)' yields `#if 1 + 1'.
+sub eval_bitxor {
+ my @terms;
+ my $value = 0;
+ do {
+ my $a = eval_bitand();
+ if ($a =~ /\D/) {
+ push @terms, $a;
+ } else {
+ $value ^= $a+0;
+ }
+ } while (m{\G\s*\^}sgc);
+ push @terms, $value if $value;
+ return (@terms ? join " ^ ", @terms : "0");
+}
+
+# Parse and-expression. This combines the known terms to one,
+# that is, `#if 1 + (2 & 3)' yields `#if 1 + 2'.
+sub eval_bitand {
+ my @terms;
+ my $value = ~0;
+ do {
+ my $a = eval_eq();
+ if ($a =~ /\D/) {
+ push @terms, $a;
+ } else {
+ $value &= $a+0;
+ }
+ } while (m{\G\s*\&(?=$|[^&])}sgc);
+ push @terms, $value if $value != ~0;
+ if ($value == 0) {
+ return "0";
+ } else {
+ return (@terms ? join " & ", @terms : "0");
+ }
+}
+
+# Parse equality-expression. Those are too seldom in conditionals
+# concerned with definedness, so we don't evaluate them.
+sub eval_eq {
+ my $a = eval_rela();
+ while (m{\G\s*([=!]=)}sgc) {
+ $a .= " $1 ";
+ $a .= eval_rela();
+ }
+ $a;
+}
+
+# Parse relational-expression. Those are too seldom in conditionals
+# concerned with definedness, so we don't evaluate them.
+sub eval_rela {
+ my $a = eval_shift();
+ while (m{\G\s*([<>]=?)(?=[^<>])}sgc) {
+ $a .= " $1 ";
+ $a .= eval_shift();
+ }
+ $a;
+}
+
+# Parse shift-expression. Those are too seldom in conditionals
+# concerned with definedness, so we don't evaluate them.
+sub eval_shift {
+ my $a = eval_add();
+ while (m{\G\s*(<<|>>)}sgc) {
+ $a .= " $1 ";
+ $a .= eval_add();
+ }
+ $a;
+}
+
+# Parse additive-expression. Those are too seldom in conditionals
+# concerned with definedness, so we don't evaluate them.
+sub eval_add {
+ my $a = eval_mult();
+ while (m{\G\s*(\+|-)}sgc) {
+ $a .= " $1 ";
+ $a .= eval_mult();
+ }
+ $a;
+}
+
+# Parse multiplicative-expression. Those are too seldom in conditionals
+# concerned with definedness, so we don't evaluate them.
+sub eval_mult {
+ my $a = eval_unary();
+ while (m{\G\s*(\*|/|%)}sgc) {
+ $a .= " $1 ";
+ $a .= eval_unary();
+ }
+ $a;
+}
+
+# Parse unary-expression. In preprocessor defines, this are:
+# - "-expr", "+expr", "!expr", "~expr" (handled because they're simple)
+# - "defined(SYM)", "defined SYM" (handled)
+# - numbers are converted to decimal
+# - parenthesized expressions
+sub eval_unary {
+ m{\G\s*}sgc;
+ if (m{\G!}sgc) {
+ my $arg = eval_unary();
+ if ($arg =~ /\D/) {
+ return "!$arg";
+ } else {
+ return $arg ? "0" : "1";
+ }
+ } elsif (m{\G~}sgc) {
+ my $arg = eval_unary();
+ if ($arg =~ /\D/) {
+ return "~$arg";
+ } else {
+ return ~$arg;
+ }
+ } elsif (m{\G\+}sgc) {
+ return eval_unary();
+ } elsif (m{\G\-}sgc) {
+ my $arg = eval_unary();
+ if ($arg =~ /\D/) {
+ return "- $arg";
+ } else {
+ return -$arg;
+ }
+ } elsif (m{\Gdefined\s*\(\s*(\w+)\s*\)}sgc || m{\G\s*defined\s+(\w+)}sgc) {
+ if (exists $defined{$1}) {
+ $seen_defined = 1;
+ return $defined{$1};
+ } else {
+ return "defined($1)";
+ }
+ } elsif (m{\G0[xX]([0-9a-fA-F]+)[uUlL]*}sgc) {
+ return hex $1;
+ } elsif (m{\G0([0-7]+)[uUlL]*}sgc) {
+ return oct $1;
+ } elsif (m{\G([0-9]+)[uUlL]*}sgc) {
+ return $1;
+ } elsif (m{\G(\w+)}sgc) {
+ if (m{\G\s(?=\()}sgc) {
+ # function-like macro
+ return "/*ERROR*/";
+ } elsif (exists $defined{$1}) {
+ # object-like macro which is known to us
+ $seen_defined = 1;
+ return $defined{$1};
+ } elsif ($opt_optimistic) {
+ # object-like macro which is (maybe) defined
+ return $1;
+ } else {
+ return "/*ERROR*/";
+ }
+ } elsif (m{\G\(}sgc) {
+ my $arg = eval_cond();
+ return "/*ERROR*/" if !m{\G\s*\)}sgc;
+ if ($arg =~ /\D/) {
+ return "($arg)";
+ } else {
+ return $arg;
+ }
+ } else {
+ return "/*ERROR*/";
+ }
+}
+
+sub debug {
+ print "| ", shift, ":\n| $_\n| ", " " x pos($_), "^\n";
+}
diff --git a/Source/WebCore/remove_enable.pl b/Source/WebCore/remove_enable.pl
new file mode 100755
index 0000000..75d41e5
--- /dev/null
+++ b/Source/WebCore/remove_enable.pl
@@ -0,0 +1,12 @@
+#!/usr/bin/perl -w
+my $testDirectory = '.';
+my $prefix = "ENABLE";
+my @files;
+push @files, map { chomp; s-^$testDirectory/--; $_; } `find css -name "*.cpp" -or -name "*.h"`;
+for my $file (@files)
+{
+ print "$file\n";
+ (system("perl -p -e 's/$prefix\\((\\w+)\\)/${prefix}_\\1/' $file > $file.pre") == 0) or die "Failed to fix ENABLES on $file";
+ (system("./partpp.pl -C -DENABLE_CSS_SHADERS $file.pre > $file.post") == 0) or die "Failed to run Partial preprocessor on $file.pre";
+ (system("perl -p -e 's/${prefix}_(\\w+)/$prefix\\(\\1\\)/' $file.post > $file") == 0) or die "Failed to fix ENABLES on $file";
+}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment