1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
|
#! /usr/bin/perl
#
# Copyright (c) 2005-2006 Motoyuki Kasahara
#
# 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 the project 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 THE PROJECT 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 PROJECT 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.
#
#
# html-include -- tiny file inclusion processoor for HTML.
#
# Usage:
# html-include [-o output-file] [input-file]
#
# `html-include' extracts file inclusion directives in HTML, and output
# the result. The following is file inclusion directive line that
# `html-include' recognizes:
#
# <!-- #include "file-name" -->
#
# Note that "<!--" must located at the beginning of the line.
#
# `html-include' outputs contents of "file-name" instead of the directive
# line itself. If `file-name' also contains the file inclusion directive,
# `html-include' processes the line as well.
#
# If `input-file' is specified, `html-include' reads it. Otherwise,
# it reads HTML from standard input. `html-include' outputs the result
# to standard out by default, but you can specify output file by using
# `-o' option.
#
# Options:
# -o output-file output the result to the file.
# -c add inclusion log lines to the result.
# -I path add file search path.
#
require 5.005;
use FileHandle;
#
# Usage
#
my $usage = "Usage: $0 [-o output-file] [input-file]\n";
#
# Variables
#
my @in_files = ();
my $out_file;
my @search_paths = ();
my $max_nest_level = 5;
my $comment_mode = 0;
$in_files[0] = {'handle' => new FileHandle,
'name' => '-',
'lineno' => 0};
$out_file = {'handle' => new FileHandle,
'name' => '-',
'lineno' => 0};
#
# Parse command line arguments.
#
while (@ARGV > 0 && $ARGV[0] =~ /^-(.)(.*)/) {
my ($first, $rest) = ($1, $2);
if ($ARGV[0] eq '--') {
shift;
last;
}
if ($first eq 'o') {
if ($rest ne '') {
$out_file->{name} = $rest;
shift;
} elsif (@ARGV > 1) {
$out_file->{name} = $ARGV[1];
shift;
shift;
} else {
die "$0: option requires an argument -- $first\n";
}
} elsif ($first eq 'c') {
$comment_mode = 1;
if ($rest ne '') {
$ARGV[0] = "-$rest";
} else {
shift;
}
} elsif ($first eq 'I') {
if ($rest ne '') {
push(@search_paths, $rest);
shift;
} elsif (@ARGV > 1) {
push(@search_paths, $rest);
shift;
shift;
} else {
die "$0: option requires an argument -- $first\n";
}
} else {
die "$0: invalid option -- $first\n";
}
}
die $usage if (@ARGV > 1);
#
# Open input and output files.
#
if (@ARGV == 0 || $ARGV[0] eq '-') {
$in_files[0]->{name} = 'stdin';
$in_files[0]->{handle}->open("<& STDIN");
} else {
$in_files[0]->{name} = $ARGV[0];
if (!$in_files[0]->{handle}->open('<' . $in_files[0]->{name})) {
die "$0: failed to open the file, $!: " . $in_files[0]->{name} . "\n";
}
}
if ($out_file->{name} eq '-') {
$out_file->{name} = 'stdout';
$out_file->{handle}->open(">& STDOUT");
} else {
if (!$out_file->{handle}->open('>' . $out_file->{name})) {
die "$0: failed to open the file, $!: " . $out_file->{name} . "\n";
}
}
#
# Read input files and write the result.
#
my $i = 0;
for (;;) {
for (;;) {
$_ = $in_files[$i]->{handle}->getline();
last if (!defined($_));
$in_files[$i]->{lineno}++;
chomp;
if (m|^<!--[ \t]+\#include[ \t]+\"([^\"]+)\"[ \t]+-->[ \t]*$|) {
#
# This is file inclusion directive line.
#
if (++$i >= $max_nest_level) {
die "$0: too deep inclusion\n";
}
$in_files[$i] = {'handle' => new FileHandle,
'name' => search_file($1),
'lineno' => 0};
if (!$in_files[$i]->{handle}->open('<' . $in_files[$i]->{name})) {
die "$0: failed to open the file, $!: " .
$in_files[$i]->{name} . "\n";
}
if ($comment_mode) {
print $out_file->{handle}->printf("<!-- \"%s\" line %d -->\n",
$in_files[$i]->{name},
$in_files[$i]->{lineno} + 1);
}
} else {
$out_file->{handle}->print($_, "\n");
}
$out_file->{lineno}++;
}
$in_files[$i]->{handle}->close();
last if (--$i < 0);
if ($comment_mode) {
$out_file->{handle}->printf("<!-- \"%s\" line %d -->\n",
$in_files[$i]->{name},
$in_files[$i]->{lineno} + 1);
}
}
sub search_file ($) {
my ($file) = @_;
foreach my $dir (@search_paths) {
return "$dir/$file" if (-r "$dir/$file");
}
return $file;
}
|
