author | Mark Lodato <lodatom@gmail.com> | 2010-09-04 18:18:16 (UTC) |
---|---|---|
committer | Mark Lodato <lodatom@gmail.com> | 2010-09-04 18:30:10 (UTC) |
commit | d187b98557d91b874836f286b955ba76ab26fb02 (patch) (unidiff) | |
tree | b8cf6224768c70c69450a7f6643393e342786594 | |
parent | 25e8ba1996a7b5ea291c924b0990d706176f6fe6 (diff) | |
download | cgit-d187b98557d91b874836f286b955ba76ab26fb02.zip cgit-d187b98557d91b874836f286b955ba76ab26fb02.tar.gz cgit-d187b98557d91b874836f286b955ba76ab26fb02.tar.bz2 |
prefer html_raw() to write()
To make the code more consistent, and to not rely on the implementation
of html(), always use html_raw(...) instead of write(htmlfd, ...).
Signed-off-by: Mark Lodato <lodatom@gmail.com>
-rw-r--r-- | html.c | 18 | ||||
-rw-r--r-- | ui-blob.c | 4 | ||||
-rw-r--r-- | ui-tree.c | 2 |
3 files changed, 12 insertions, 12 deletions
@@ -1,320 +1,320 @@ | |||
1 | /* html.c: helper functions for html output | 1 | /* html.c: helper functions for html output |
2 | * | 2 | * |
3 | * Copyright (C) 2006 Lars Hjemli | 3 | * Copyright (C) 2006 Lars Hjemli |
4 | * | 4 | * |
5 | * Licensed under GNU General Public License v2 | 5 | * Licensed under GNU General Public License v2 |
6 | * (see COPYING for full license text) | 6 | * (see COPYING for full license text) |
7 | */ | 7 | */ |
8 | 8 | ||
9 | #include <unistd.h> | 9 | #include <unistd.h> |
10 | #include <stdio.h> | 10 | #include <stdio.h> |
11 | #include <stdlib.h> | 11 | #include <stdlib.h> |
12 | #include <stdarg.h> | 12 | #include <stdarg.h> |
13 | #include <string.h> | 13 | #include <string.h> |
14 | #include <errno.h> | 14 | #include <errno.h> |
15 | 15 | ||
16 | /* Percent-encoding of each character, except: a-zA-Z0-9!$()*,./:;@- */ | 16 | /* Percent-encoding of each character, except: a-zA-Z0-9!$()*,./:;@- */ |
17 | static const char* url_escape_table[256] = { | 17 | static const char* url_escape_table[256] = { |
18 | "%00", "%01", "%02", "%03", "%04", "%05", "%06", "%07", "%08", "%09", | 18 | "%00", "%01", "%02", "%03", "%04", "%05", "%06", "%07", "%08", "%09", |
19 | "%0a", "%0b", "%0c", "%0d", "%0e", "%0f", "%10", "%11", "%12", "%13", | 19 | "%0a", "%0b", "%0c", "%0d", "%0e", "%0f", "%10", "%11", "%12", "%13", |
20 | "%14", "%15", "%16", "%17", "%18", "%19", "%1a", "%1b", "%1c", "%1d", | 20 | "%14", "%15", "%16", "%17", "%18", "%19", "%1a", "%1b", "%1c", "%1d", |
21 | "%1e", "%1f", "%20", 0, "%22", "%23", 0, "%25", "%26", "%27", 0, 0, 0, | 21 | "%1e", "%1f", "%20", 0, "%22", "%23", 0, "%25", "%26", "%27", 0, 0, 0, |
22 | "%2b", 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, "%3c", "%3d", | 22 | "%2b", 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, "%3c", "%3d", |
23 | "%3e", "%3f", 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, | 23 | "%3e", "%3f", 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
24 | 0, 0, 0, 0, 0, 0, 0, 0, 0, "%5c", 0, "%5e", 0, "%60", 0, 0, 0, 0, 0, | 24 | 0, 0, 0, 0, 0, 0, 0, 0, 0, "%5c", 0, "%5e", 0, "%60", 0, 0, 0, 0, 0, |
25 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, "%7b", | 25 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, "%7b", |
26 | "%7c", "%7d", 0, "%7f", "%80", "%81", "%82", "%83", "%84", "%85", | 26 | "%7c", "%7d", 0, "%7f", "%80", "%81", "%82", "%83", "%84", "%85", |
27 | "%86", "%87", "%88", "%89", "%8a", "%8b", "%8c", "%8d", "%8e", "%8f", | 27 | "%86", "%87", "%88", "%89", "%8a", "%8b", "%8c", "%8d", "%8e", "%8f", |
28 | "%90", "%91", "%92", "%93", "%94", "%95", "%96", "%97", "%98", "%99", | 28 | "%90", "%91", "%92", "%93", "%94", "%95", "%96", "%97", "%98", "%99", |
29 | "%9a", "%9b", "%9c", "%9d", "%9e", "%9f", "%a0", "%a1", "%a2", "%a3", | 29 | "%9a", "%9b", "%9c", "%9d", "%9e", "%9f", "%a0", "%a1", "%a2", "%a3", |
30 | "%a4", "%a5", "%a6", "%a7", "%a8", "%a9", "%aa", "%ab", "%ac", "%ad", | 30 | "%a4", "%a5", "%a6", "%a7", "%a8", "%a9", "%aa", "%ab", "%ac", "%ad", |
31 | "%ae", "%af", "%b0", "%b1", "%b2", "%b3", "%b4", "%b5", "%b6", "%b7", | 31 | "%ae", "%af", "%b0", "%b1", "%b2", "%b3", "%b4", "%b5", "%b6", "%b7", |
32 | "%b8", "%b9", "%ba", "%bb", "%bc", "%bd", "%be", "%bf", "%c0", "%c1", | 32 | "%b8", "%b9", "%ba", "%bb", "%bc", "%bd", "%be", "%bf", "%c0", "%c1", |
33 | "%c2", "%c3", "%c4", "%c5", "%c6", "%c7", "%c8", "%c9", "%ca", "%cb", | 33 | "%c2", "%c3", "%c4", "%c5", "%c6", "%c7", "%c8", "%c9", "%ca", "%cb", |
34 | "%cc", "%cd", "%ce", "%cf", "%d0", "%d1", "%d2", "%d3", "%d4", "%d5", | 34 | "%cc", "%cd", "%ce", "%cf", "%d0", "%d1", "%d2", "%d3", "%d4", "%d5", |
35 | "%d6", "%d7", "%d8", "%d9", "%da", "%db", "%dc", "%dd", "%de", "%df", | 35 | "%d6", "%d7", "%d8", "%d9", "%da", "%db", "%dc", "%dd", "%de", "%df", |
36 | "%e0", "%e1", "%e2", "%e3", "%e4", "%e5", "%e6", "%e7", "%e8", "%e9", | 36 | "%e0", "%e1", "%e2", "%e3", "%e4", "%e5", "%e6", "%e7", "%e8", "%e9", |
37 | "%ea", "%eb", "%ec", "%ed", "%ee", "%ef", "%f0", "%f1", "%f2", "%f3", | 37 | "%ea", "%eb", "%ec", "%ed", "%ee", "%ef", "%f0", "%f1", "%f2", "%f3", |
38 | "%f4", "%f5", "%f6", "%f7", "%f8", "%f9", "%fa", "%fb", "%fc", "%fd", | 38 | "%f4", "%f5", "%f6", "%f7", "%f8", "%f9", "%fa", "%fb", "%fc", "%fd", |
39 | "%fe", "%ff" | 39 | "%fe", "%ff" |
40 | }; | 40 | }; |
41 | 41 | ||
42 | int htmlfd = STDOUT_FILENO; | 42 | int htmlfd = STDOUT_FILENO; |
43 | 43 | ||
44 | char *fmt(const char *format, ...) | 44 | char *fmt(const char *format, ...) |
45 | { | 45 | { |
46 | static char buf[8][1024]; | 46 | static char buf[8][1024]; |
47 | static int bufidx; | 47 | static int bufidx; |
48 | int len; | 48 | int len; |
49 | va_list args; | 49 | va_list args; |
50 | 50 | ||
51 | bufidx++; | 51 | bufidx++; |
52 | bufidx &= 7; | 52 | bufidx &= 7; |
53 | 53 | ||
54 | va_start(args, format); | 54 | va_start(args, format); |
55 | len = vsnprintf(buf[bufidx], sizeof(buf[bufidx]), format, args); | 55 | len = vsnprintf(buf[bufidx], sizeof(buf[bufidx]), format, args); |
56 | va_end(args); | 56 | va_end(args); |
57 | if (len>sizeof(buf[bufidx])) { | 57 | if (len>sizeof(buf[bufidx])) { |
58 | fprintf(stderr, "[html.c] string truncated: %s\n", format); | 58 | fprintf(stderr, "[html.c] string truncated: %s\n", format); |
59 | exit(1); | 59 | exit(1); |
60 | } | 60 | } |
61 | return buf[bufidx]; | 61 | return buf[bufidx]; |
62 | } | 62 | } |
63 | 63 | ||
64 | void html_raw(const char *data, size_t size) | 64 | void html_raw(const char *data, size_t size) |
65 | { | 65 | { |
66 | write(htmlfd, data, size); | 66 | write(htmlfd, data, size); |
67 | } | 67 | } |
68 | 68 | ||
69 | void html(const char *txt) | 69 | void html(const char *txt) |
70 | { | 70 | { |
71 | write(htmlfd, txt, strlen(txt)); | 71 | write(htmlfd, txt, strlen(txt)); |
72 | } | 72 | } |
73 | 73 | ||
74 | void htmlf(const char *format, ...) | 74 | void htmlf(const char *format, ...) |
75 | { | 75 | { |
76 | static char buf[65536]; | 76 | static char buf[65536]; |
77 | va_list args; | 77 | va_list args; |
78 | 78 | ||
79 | va_start(args, format); | 79 | va_start(args, format); |
80 | vsnprintf(buf, sizeof(buf), format, args); | 80 | vsnprintf(buf, sizeof(buf), format, args); |
81 | va_end(args); | 81 | va_end(args); |
82 | html(buf); | 82 | html(buf); |
83 | } | 83 | } |
84 | 84 | ||
85 | void html_status(int code, const char *msg, int more_headers) | 85 | void html_status(int code, const char *msg, int more_headers) |
86 | { | 86 | { |
87 | htmlf("Status: %d %s\n", code, msg); | 87 | htmlf("Status: %d %s\n", code, msg); |
88 | if (!more_headers) | 88 | if (!more_headers) |
89 | html("\n"); | 89 | html("\n"); |
90 | } | 90 | } |
91 | 91 | ||
92 | void html_txt(const char *txt) | 92 | void html_txt(const char *txt) |
93 | { | 93 | { |
94 | const char *t = txt; | 94 | const char *t = txt; |
95 | while(t && *t){ | 95 | while(t && *t){ |
96 | int c = *t; | 96 | int c = *t; |
97 | if (c=='<' || c=='>' || c=='&') { | 97 | if (c=='<' || c=='>' || c=='&') { |
98 | write(htmlfd, txt, t - txt); | 98 | html_raw(txt, t - txt); |
99 | if (c=='>') | 99 | if (c=='>') |
100 | html(">"); | 100 | html(">"); |
101 | else if (c=='<') | 101 | else if (c=='<') |
102 | html("<"); | 102 | html("<"); |
103 | else if (c=='&') | 103 | else if (c=='&') |
104 | html("&"); | 104 | html("&"); |
105 | txt = t+1; | 105 | txt = t+1; |
106 | } | 106 | } |
107 | t++; | 107 | t++; |
108 | } | 108 | } |
109 | if (t!=txt) | 109 | if (t!=txt) |
110 | html(txt); | 110 | html(txt); |
111 | } | 111 | } |
112 | 112 | ||
113 | void html_ntxt(int len, const char *txt) | 113 | void html_ntxt(int len, const char *txt) |
114 | { | 114 | { |
115 | const char *t = txt; | 115 | const char *t = txt; |
116 | while(t && *t && len--){ | 116 | while(t && *t && len--){ |
117 | int c = *t; | 117 | int c = *t; |
118 | if (c=='<' || c=='>' || c=='&') { | 118 | if (c=='<' || c=='>' || c=='&') { |
119 | write(htmlfd, txt, t - txt); | 119 | html_raw(txt, t - txt); |
120 | if (c=='>') | 120 | if (c=='>') |
121 | html(">"); | 121 | html(">"); |
122 | else if (c=='<') | 122 | else if (c=='<') |
123 | html("<"); | 123 | html("<"); |
124 | else if (c=='&') | 124 | else if (c=='&') |
125 | html("&"); | 125 | html("&"); |
126 | txt = t+1; | 126 | txt = t+1; |
127 | } | 127 | } |
128 | t++; | 128 | t++; |
129 | } | 129 | } |
130 | if (t!=txt) | 130 | if (t!=txt) |
131 | write(htmlfd, txt, t - txt); | 131 | html_raw(txt, t - txt); |
132 | if (len<0) | 132 | if (len<0) |
133 | html("..."); | 133 | html("..."); |
134 | } | 134 | } |
135 | 135 | ||
136 | void html_attr(const char *txt) | 136 | void html_attr(const char *txt) |
137 | { | 137 | { |
138 | const char *t = txt; | 138 | const char *t = txt; |
139 | while(t && *t){ | 139 | while(t && *t){ |
140 | int c = *t; | 140 | int c = *t; |
141 | if (c=='<' || c=='>' || c=='\'' || c=='\"') { | 141 | if (c=='<' || c=='>' || c=='\'' || c=='\"') { |
142 | write(htmlfd, txt, t - txt); | 142 | html_raw(txt, t - txt); |
143 | if (c=='>') | 143 | if (c=='>') |
144 | html(">"); | 144 | html(">"); |
145 | else if (c=='<') | 145 | else if (c=='<') |
146 | html("<"); | 146 | html("<"); |
147 | else if (c=='\'') | 147 | else if (c=='\'') |
148 | html("'"); | 148 | html("'"); |
149 | else if (c=='"') | 149 | else if (c=='"') |
150 | html("""); | 150 | html("""); |
151 | txt = t+1; | 151 | txt = t+1; |
152 | } | 152 | } |
153 | t++; | 153 | t++; |
154 | } | 154 | } |
155 | if (t!=txt) | 155 | if (t!=txt) |
156 | html(txt); | 156 | html(txt); |
157 | } | 157 | } |
158 | 158 | ||
159 | void html_url_path(const char *txt) | 159 | void html_url_path(const char *txt) |
160 | { | 160 | { |
161 | const char *t = txt; | 161 | const char *t = txt; |
162 | while(t && *t){ | 162 | while(t && *t){ |
163 | int c = *t; | 163 | int c = *t; |
164 | const char *e = url_escape_table[c]; | 164 | const char *e = url_escape_table[c]; |
165 | if (e && c!='+' && c!='&' && c!='+') { | 165 | if (e && c!='+' && c!='&' && c!='+') { |
166 | write(htmlfd, txt, t - txt); | 166 | html_raw(txt, t - txt); |
167 | write(htmlfd, e, 3); | 167 | html_raw(e, 3); |
168 | txt = t+1; | 168 | txt = t+1; |
169 | } | 169 | } |
170 | t++; | 170 | t++; |
171 | } | 171 | } |
172 | if (t!=txt) | 172 | if (t!=txt) |
173 | html(txt); | 173 | html(txt); |
174 | } | 174 | } |
175 | 175 | ||
176 | void html_url_arg(const char *txt) | 176 | void html_url_arg(const char *txt) |
177 | { | 177 | { |
178 | const char *t = txt; | 178 | const char *t = txt; |
179 | while(t && *t){ | 179 | while(t && *t){ |
180 | int c = *t; | 180 | int c = *t; |
181 | const char *e = url_escape_table[c]; | 181 | const char *e = url_escape_table[c]; |
182 | if (e) { | 182 | if (e) { |
183 | write(htmlfd, txt, t - txt); | 183 | html_raw(txt, t - txt); |
184 | write(htmlfd, e, 3); | 184 | html_raw(e, 3); |
185 | txt = t+1; | 185 | txt = t+1; |
186 | } | 186 | } |
187 | t++; | 187 | t++; |
188 | } | 188 | } |
189 | if (t!=txt) | 189 | if (t!=txt) |
190 | html(txt); | 190 | html(txt); |
191 | } | 191 | } |
192 | 192 | ||
193 | void html_hidden(const char *name, const char *value) | 193 | void html_hidden(const char *name, const char *value) |
194 | { | 194 | { |
195 | html("<input type='hidden' name='"); | 195 | html("<input type='hidden' name='"); |
196 | html_attr(name); | 196 | html_attr(name); |
197 | html("' value='"); | 197 | html("' value='"); |
198 | html_attr(value); | 198 | html_attr(value); |
199 | html("'/>"); | 199 | html("'/>"); |
200 | } | 200 | } |
201 | 201 | ||
202 | void html_option(const char *value, const char *text, const char *selected_value) | 202 | void html_option(const char *value, const char *text, const char *selected_value) |
203 | { | 203 | { |
204 | html("<option value='"); | 204 | html("<option value='"); |
205 | html_attr(value); | 205 | html_attr(value); |
206 | html("'"); | 206 | html("'"); |
207 | if (selected_value && !strcmp(selected_value, value)) | 207 | if (selected_value && !strcmp(selected_value, value)) |
208 | html(" selected='selected'"); | 208 | html(" selected='selected'"); |
209 | html(">"); | 209 | html(">"); |
210 | html_txt(text); | 210 | html_txt(text); |
211 | html("</option>\n"); | 211 | html("</option>\n"); |
212 | } | 212 | } |
213 | 213 | ||
214 | void html_link_open(const char *url, const char *title, const char *class) | 214 | void html_link_open(const char *url, const char *title, const char *class) |
215 | { | 215 | { |
216 | html("<a href='"); | 216 | html("<a href='"); |
217 | html_attr(url); | 217 | html_attr(url); |
218 | if (title) { | 218 | if (title) { |
219 | html("' title='"); | 219 | html("' title='"); |
220 | html_attr(title); | 220 | html_attr(title); |
221 | } | 221 | } |
222 | if (class) { | 222 | if (class) { |
223 | html("' class='"); | 223 | html("' class='"); |
224 | html_attr(class); | 224 | html_attr(class); |
225 | } | 225 | } |
226 | html("'>"); | 226 | html("'>"); |
227 | } | 227 | } |
228 | 228 | ||
229 | void html_link_close(void) | 229 | void html_link_close(void) |
230 | { | 230 | { |
231 | html("</a>"); | 231 | html("</a>"); |
232 | } | 232 | } |
233 | 233 | ||
234 | void html_fileperm(unsigned short mode) | 234 | void html_fileperm(unsigned short mode) |
235 | { | 235 | { |
236 | htmlf("%c%c%c", (mode & 4 ? 'r' : '-'), | 236 | htmlf("%c%c%c", (mode & 4 ? 'r' : '-'), |
237 | (mode & 2 ? 'w' : '-'), (mode & 1 ? 'x' : '-')); | 237 | (mode & 2 ? 'w' : '-'), (mode & 1 ? 'x' : '-')); |
238 | } | 238 | } |
239 | 239 | ||
240 | int html_include(const char *filename) | 240 | int html_include(const char *filename) |
241 | { | 241 | { |
242 | FILE *f; | 242 | FILE *f; |
243 | char buf[4096]; | 243 | char buf[4096]; |
244 | size_t len; | 244 | size_t len; |
245 | 245 | ||
246 | if (!(f = fopen(filename, "r"))) { | 246 | if (!(f = fopen(filename, "r"))) { |
247 | fprintf(stderr, "[cgit] Failed to include file %s: %s (%d).\n", | 247 | fprintf(stderr, "[cgit] Failed to include file %s: %s (%d).\n", |
248 | filename, strerror(errno), errno); | 248 | filename, strerror(errno), errno); |
249 | return -1; | 249 | return -1; |
250 | } | 250 | } |
251 | while((len = fread(buf, 1, 4096, f)) > 0) | 251 | while((len = fread(buf, 1, 4096, f)) > 0) |
252 | write(htmlfd, buf, len); | 252 | html_raw(buf, len); |
253 | fclose(f); | 253 | fclose(f); |
254 | return 0; | 254 | return 0; |
255 | } | 255 | } |
256 | 256 | ||
257 | int hextoint(char c) | 257 | int hextoint(char c) |
258 | { | 258 | { |
259 | if (c >= 'a' && c <= 'f') | 259 | if (c >= 'a' && c <= 'f') |
260 | return 10 + c - 'a'; | 260 | return 10 + c - 'a'; |
261 | else if (c >= 'A' && c <= 'F') | 261 | else if (c >= 'A' && c <= 'F') |
262 | return 10 + c - 'A'; | 262 | return 10 + c - 'A'; |
263 | else if (c >= '0' && c <= '9') | 263 | else if (c >= '0' && c <= '9') |
264 | return c - '0'; | 264 | return c - '0'; |
265 | else | 265 | else |
266 | return -1; | 266 | return -1; |
267 | } | 267 | } |
268 | 268 | ||
269 | char *convert_query_hexchar(char *txt) | 269 | char *convert_query_hexchar(char *txt) |
270 | { | 270 | { |
271 | int d1, d2, n; | 271 | int d1, d2, n; |
272 | n = strlen(txt); | 272 | n = strlen(txt); |
273 | if (n < 3) { | 273 | if (n < 3) { |
274 | *txt = '\0'; | 274 | *txt = '\0'; |
275 | return txt-1; | 275 | return txt-1; |
276 | } | 276 | } |
277 | d1 = hextoint(*(txt+1)); | 277 | d1 = hextoint(*(txt+1)); |
278 | d2 = hextoint(*(txt+2)); | 278 | d2 = hextoint(*(txt+2)); |
279 | if (d1<0 || d2<0) { | 279 | if (d1<0 || d2<0) { |
280 | memmove(txt, txt+3, n-3); | 280 | memmove(txt, txt+3, n-3); |
281 | return txt-1; | 281 | return txt-1; |
282 | } else { | 282 | } else { |
283 | *txt = d1 * 16 + d2; | 283 | *txt = d1 * 16 + d2; |
284 | memmove(txt+1, txt+3, n-2); | 284 | memmove(txt+1, txt+3, n-2); |
285 | return txt; | 285 | return txt; |
286 | } | 286 | } |
287 | } | 287 | } |
288 | 288 | ||
289 | int http_parse_querystring(const char *txt_, void (*fn)(const char *name, const char *value)) | 289 | int http_parse_querystring(const char *txt_, void (*fn)(const char *name, const char *value)) |
290 | { | 290 | { |
291 | char *t, *txt, *value = NULL, c; | 291 | char *t, *txt, *value = NULL, c; |
292 | 292 | ||
293 | if (!txt_) | 293 | if (!txt_) |
294 | return 0; | 294 | return 0; |
295 | 295 | ||
296 | t = txt = strdup(txt_); | 296 | t = txt = strdup(txt_); |
297 | if (t == NULL) { | 297 | if (t == NULL) { |
298 | printf("Out of memory\n"); | 298 | printf("Out of memory\n"); |
299 | exit(1); | 299 | exit(1); |
300 | } | 300 | } |
301 | while((c=*t) != '\0') { | 301 | while((c=*t) != '\0') { |
302 | if (c=='=') { | 302 | if (c=='=') { |
303 | *t = '\0'; | 303 | *t = '\0'; |
304 | value = t+1; | 304 | value = t+1; |
305 | } else if (c=='+') { | 305 | } else if (c=='+') { |
306 | *t = ' '; | 306 | *t = ' '; |
307 | } else if (c=='%') { | 307 | } else if (c=='%') { |
308 | t = convert_query_hexchar(t); | 308 | t = convert_query_hexchar(t); |
309 | } else if (c=='&') { | 309 | } else if (c=='&') { |
310 | *t = '\0'; | 310 | *t = '\0'; |
311 | (*fn)(txt, value); | 311 | (*fn)(txt, value); |
312 | txt = t+1; | 312 | txt = t+1; |
313 | value = NULL; | 313 | value = NULL; |
314 | } | 314 | } |
315 | t++; | 315 | t++; |
316 | } | 316 | } |
317 | if (t!=txt) | 317 | if (t!=txt) |
318 | (*fn)(txt, value); | 318 | (*fn)(txt, value); |
319 | return 0; | 319 | return 0; |
320 | } | 320 | } |
@@ -1,112 +1,112 @@ | |||
1 | /* ui-blob.c: show blob content | 1 | /* ui-blob.c: show blob content |
2 | * | 2 | * |
3 | * Copyright (C) 2008 Lars Hjemli | 3 | * Copyright (C) 2008 Lars Hjemli |
4 | * Copyright (C) 2010 Jason A. Donenfeld <Jason@zx2c4.com> | 4 | * Copyright (C) 2010 Jason A. Donenfeld <Jason@zx2c4.com> |
5 | * | 5 | * |
6 | * Licensed under GNU General Public License v2 | 6 | * Licensed under GNU General Public License v2 |
7 | * (see COPYING for full license text) | 7 | * (see COPYING for full license text) |
8 | */ | 8 | */ |
9 | 9 | ||
10 | #include "cgit.h" | 10 | #include "cgit.h" |
11 | #include "html.h" | 11 | #include "html.h" |
12 | #include "ui-shared.h" | 12 | #include "ui-shared.h" |
13 | 13 | ||
14 | static char *match_path; | 14 | static char *match_path; |
15 | static unsigned char *matched_sha1; | 15 | static unsigned char *matched_sha1; |
16 | static int found_path; | 16 | static int found_path; |
17 | 17 | ||
18 | static int walk_tree(const unsigned char *sha1, const char *base,int baselen, | 18 | static int walk_tree(const unsigned char *sha1, const char *base,int baselen, |
19 | const char *pathname, unsigned mode, int stage, void *cbdata) { | 19 | const char *pathname, unsigned mode, int stage, void *cbdata) { |
20 | if(strncmp(base,match_path,baselen) | 20 | if(strncmp(base,match_path,baselen) |
21 | || strcmp(match_path+baselen,pathname) ) | 21 | || strcmp(match_path+baselen,pathname) ) |
22 | return READ_TREE_RECURSIVE; | 22 | return READ_TREE_RECURSIVE; |
23 | memmove(matched_sha1,sha1,20); | 23 | memmove(matched_sha1,sha1,20); |
24 | found_path = 1; | 24 | found_path = 1; |
25 | return 0; | 25 | return 0; |
26 | } | 26 | } |
27 | 27 | ||
28 | int cgit_print_file(char *path, const char *head) | 28 | int cgit_print_file(char *path, const char *head) |
29 | { | 29 | { |
30 | unsigned char sha1[20]; | 30 | unsigned char sha1[20]; |
31 | enum object_type type; | 31 | enum object_type type; |
32 | char *buf; | 32 | char *buf; |
33 | unsigned long size; | 33 | unsigned long size; |
34 | struct commit *commit; | 34 | struct commit *commit; |
35 | const char *paths[] = {path, NULL}; | 35 | const char *paths[] = {path, NULL}; |
36 | if (get_sha1(head, sha1)) | 36 | if (get_sha1(head, sha1)) |
37 | return -1; | 37 | return -1; |
38 | type = sha1_object_info(sha1, &size); | 38 | type = sha1_object_info(sha1, &size); |
39 | if(type == OBJ_COMMIT && path) { | 39 | if(type == OBJ_COMMIT && path) { |
40 | commit = lookup_commit_reference(sha1); | 40 | commit = lookup_commit_reference(sha1); |
41 | match_path = path; | 41 | match_path = path; |
42 | matched_sha1 = sha1; | 42 | matched_sha1 = sha1; |
43 | found_path = 0; | 43 | found_path = 0; |
44 | read_tree_recursive(commit->tree, "", 0, 0, paths, walk_tree, NULL); | 44 | read_tree_recursive(commit->tree, "", 0, 0, paths, walk_tree, NULL); |
45 | if (!found_path) | 45 | if (!found_path) |
46 | return -1; | 46 | return -1; |
47 | type = sha1_object_info(sha1, &size); | 47 | type = sha1_object_info(sha1, &size); |
48 | } | 48 | } |
49 | if (type == OBJ_BAD) | 49 | if (type == OBJ_BAD) |
50 | return -1; | 50 | return -1; |
51 | buf = read_sha1_file(sha1, &type, &size); | 51 | buf = read_sha1_file(sha1, &type, &size); |
52 | if (!buf) | 52 | if (!buf) |
53 | return -1; | 53 | return -1; |
54 | buf[size] = '\0'; | 54 | buf[size] = '\0'; |
55 | write(htmlfd, buf, size); | 55 | html_raw(buf, size); |
56 | return 0; | 56 | return 0; |
57 | } | 57 | } |
58 | 58 | ||
59 | void cgit_print_blob(const char *hex, char *path, const char *head) | 59 | void cgit_print_blob(const char *hex, char *path, const char *head) |
60 | { | 60 | { |
61 | unsigned char sha1[20]; | 61 | unsigned char sha1[20]; |
62 | enum object_type type; | 62 | enum object_type type; |
63 | char *buf; | 63 | char *buf; |
64 | unsigned long size; | 64 | unsigned long size; |
65 | struct commit *commit; | 65 | struct commit *commit; |
66 | const char *paths[] = {path, NULL}; | 66 | const char *paths[] = {path, NULL}; |
67 | 67 | ||
68 | if (hex) { | 68 | if (hex) { |
69 | if (get_sha1_hex(hex, sha1)){ | 69 | if (get_sha1_hex(hex, sha1)){ |
70 | cgit_print_error(fmt("Bad hex value: %s", hex)); | 70 | cgit_print_error(fmt("Bad hex value: %s", hex)); |
71 | return; | 71 | return; |
72 | } | 72 | } |
73 | } else { | 73 | } else { |
74 | if (get_sha1(head,sha1)) { | 74 | if (get_sha1(head,sha1)) { |
75 | cgit_print_error(fmt("Bad ref: %s", head)); | 75 | cgit_print_error(fmt("Bad ref: %s", head)); |
76 | return; | 76 | return; |
77 | } | 77 | } |
78 | } | 78 | } |
79 | 79 | ||
80 | type = sha1_object_info(sha1, &size); | 80 | type = sha1_object_info(sha1, &size); |
81 | 81 | ||
82 | if((!hex) && type == OBJ_COMMIT && path) { | 82 | if((!hex) && type == OBJ_COMMIT && path) { |
83 | commit = lookup_commit_reference(sha1); | 83 | commit = lookup_commit_reference(sha1); |
84 | match_path = path; | 84 | match_path = path; |
85 | matched_sha1 = sha1; | 85 | matched_sha1 = sha1; |
86 | read_tree_recursive(commit->tree, "", 0, 0, paths, walk_tree, NULL); | 86 | read_tree_recursive(commit->tree, "", 0, 0, paths, walk_tree, NULL); |
87 | type = sha1_object_info(sha1,&size); | 87 | type = sha1_object_info(sha1,&size); |
88 | } | 88 | } |
89 | 89 | ||
90 | if (type == OBJ_BAD) { | 90 | if (type == OBJ_BAD) { |
91 | cgit_print_error(fmt("Bad object name: %s", hex)); | 91 | cgit_print_error(fmt("Bad object name: %s", hex)); |
92 | return; | 92 | return; |
93 | } | 93 | } |
94 | 94 | ||
95 | buf = read_sha1_file(sha1, &type, &size); | 95 | buf = read_sha1_file(sha1, &type, &size); |
96 | if (!buf) { | 96 | if (!buf) { |
97 | cgit_print_error(fmt("Error reading object %s", hex)); | 97 | cgit_print_error(fmt("Error reading object %s", hex)); |
98 | return; | 98 | return; |
99 | } | 99 | } |
100 | 100 | ||
101 | buf[size] = '\0'; | 101 | buf[size] = '\0'; |
102 | ctx.page.mimetype = ctx.qry.mimetype; | 102 | ctx.page.mimetype = ctx.qry.mimetype; |
103 | if (!ctx.page.mimetype) { | 103 | if (!ctx.page.mimetype) { |
104 | if (buffer_is_binary(buf, size)) | 104 | if (buffer_is_binary(buf, size)) |
105 | ctx.page.mimetype = "application/octet-stream"; | 105 | ctx.page.mimetype = "application/octet-stream"; |
106 | else | 106 | else |
107 | ctx.page.mimetype = "text/plain"; | 107 | ctx.page.mimetype = "text/plain"; |
108 | } | 108 | } |
109 | ctx.page.filename = path; | 109 | ctx.page.filename = path; |
110 | cgit_print_http_headers(&ctx); | 110 | cgit_print_http_headers(&ctx); |
111 | write(htmlfd, buf, size); | 111 | html_raw(buf, size); |
112 | } | 112 | } |
@@ -1,282 +1,282 @@ | |||
1 | /* ui-tree.c: functions for tree output | 1 | /* ui-tree.c: functions for tree output |
2 | * | 2 | * |
3 | * Copyright (C) 2006 Lars Hjemli | 3 | * Copyright (C) 2006 Lars Hjemli |
4 | * | 4 | * |
5 | * Licensed under GNU General Public License v2 | 5 | * Licensed under GNU General Public License v2 |
6 | * (see COPYING for full license text) | 6 | * (see COPYING for full license text) |
7 | */ | 7 | */ |
8 | 8 | ||
9 | #include <ctype.h> | 9 | #include <ctype.h> |
10 | #include "cgit.h" | 10 | #include "cgit.h" |
11 | #include "html.h" | 11 | #include "html.h" |
12 | #include "ui-shared.h" | 12 | #include "ui-shared.h" |
13 | 13 | ||
14 | char *curr_rev; | 14 | char *curr_rev; |
15 | char *match_path; | 15 | char *match_path; |
16 | int header = 0; | 16 | int header = 0; |
17 | 17 | ||
18 | static void print_text_buffer(const char *name, char *buf, unsigned long size) | 18 | static void print_text_buffer(const char *name, char *buf, unsigned long size) |
19 | { | 19 | { |
20 | unsigned long lineno, idx; | 20 | unsigned long lineno, idx; |
21 | const char *numberfmt = | 21 | const char *numberfmt = |
22 | "<a class='no' id='n%1$d' name='n%1$d' href='#n%1$d'>%1$d</a>\n"; | 22 | "<a class='no' id='n%1$d' name='n%1$d' href='#n%1$d'>%1$d</a>\n"; |
23 | 23 | ||
24 | html("<table summary='blob content' class='blob'>\n"); | 24 | html("<table summary='blob content' class='blob'>\n"); |
25 | 25 | ||
26 | if (ctx.cfg.enable_tree_linenumbers) { | 26 | if (ctx.cfg.enable_tree_linenumbers) { |
27 | html("<tr><td class='linenumbers'><pre>"); | 27 | html("<tr><td class='linenumbers'><pre>"); |
28 | idx = 0; | 28 | idx = 0; |
29 | lineno = 0; | 29 | lineno = 0; |
30 | 30 | ||
31 | if (size) { | 31 | if (size) { |
32 | htmlf(numberfmt, ++lineno); | 32 | htmlf(numberfmt, ++lineno); |
33 | while(idx < size - 1) { // skip absolute last newline | 33 | while(idx < size - 1) { // skip absolute last newline |
34 | if (buf[idx] == '\n') | 34 | if (buf[idx] == '\n') |
35 | htmlf(numberfmt, ++lineno); | 35 | htmlf(numberfmt, ++lineno); |
36 | idx++; | 36 | idx++; |
37 | } | 37 | } |
38 | } | 38 | } |
39 | html("</pre></td>\n"); | 39 | html("</pre></td>\n"); |
40 | } | 40 | } |
41 | else { | 41 | else { |
42 | html("<tr>\n"); | 42 | html("<tr>\n"); |
43 | } | 43 | } |
44 | 44 | ||
45 | if (ctx.repo->source_filter) { | 45 | if (ctx.repo->source_filter) { |
46 | html("<td class='lines'><pre><code>"); | 46 | html("<td class='lines'><pre><code>"); |
47 | ctx.repo->source_filter->argv[1] = xstrdup(name); | 47 | ctx.repo->source_filter->argv[1] = xstrdup(name); |
48 | cgit_open_filter(ctx.repo->source_filter); | 48 | cgit_open_filter(ctx.repo->source_filter); |
49 | write(STDOUT_FILENO, buf, size); | 49 | html_raw(buf, size); |
50 | cgit_close_filter(ctx.repo->source_filter); | 50 | cgit_close_filter(ctx.repo->source_filter); |
51 | html("</code></pre></td></tr></table>\n"); | 51 | html("</code></pre></td></tr></table>\n"); |
52 | return; | 52 | return; |
53 | } | 53 | } |
54 | 54 | ||
55 | html("<td class='lines'><pre><code>"); | 55 | html("<td class='lines'><pre><code>"); |
56 | html_txt(buf); | 56 | html_txt(buf); |
57 | html("</code></pre></td></tr></table>\n"); | 57 | html("</code></pre></td></tr></table>\n"); |
58 | } | 58 | } |
59 | 59 | ||
60 | #define ROWLEN 32 | 60 | #define ROWLEN 32 |
61 | 61 | ||
62 | static void print_binary_buffer(char *buf, unsigned long size) | 62 | static void print_binary_buffer(char *buf, unsigned long size) |
63 | { | 63 | { |
64 | unsigned long ofs, idx; | 64 | unsigned long ofs, idx; |
65 | static char ascii[ROWLEN + 1]; | 65 | static char ascii[ROWLEN + 1]; |
66 | 66 | ||
67 | html("<table summary='blob content' class='bin-blob'>\n"); | 67 | html("<table summary='blob content' class='bin-blob'>\n"); |
68 | html("<tr><th>ofs</th><th>hex dump</th><th>ascii</th></tr>"); | 68 | html("<tr><th>ofs</th><th>hex dump</th><th>ascii</th></tr>"); |
69 | for (ofs = 0; ofs < size; ofs += ROWLEN, buf += ROWLEN) { | 69 | for (ofs = 0; ofs < size; ofs += ROWLEN, buf += ROWLEN) { |
70 | htmlf("<tr><td class='right'>%04lx</td><td class='hex'>", ofs); | 70 | htmlf("<tr><td class='right'>%04lx</td><td class='hex'>", ofs); |
71 | for (idx = 0; idx < ROWLEN && ofs + idx < size; idx++) | 71 | for (idx = 0; idx < ROWLEN && ofs + idx < size; idx++) |
72 | htmlf("%*s%02x", | 72 | htmlf("%*s%02x", |
73 | idx == 16 ? 4 : 1, "", | 73 | idx == 16 ? 4 : 1, "", |
74 | buf[idx] & 0xff); | 74 | buf[idx] & 0xff); |
75 | html(" </td><td class='hex'>"); | 75 | html(" </td><td class='hex'>"); |
76 | for (idx = 0; idx < ROWLEN && ofs + idx < size; idx++) | 76 | for (idx = 0; idx < ROWLEN && ofs + idx < size; idx++) |
77 | ascii[idx] = isgraph(buf[idx]) ? buf[idx] : '.'; | 77 | ascii[idx] = isgraph(buf[idx]) ? buf[idx] : '.'; |
78 | ascii[idx] = '\0'; | 78 | ascii[idx] = '\0'; |
79 | html_txt(ascii); | 79 | html_txt(ascii); |
80 | html("</td></tr>\n"); | 80 | html("</td></tr>\n"); |
81 | } | 81 | } |
82 | html("</table>\n"); | 82 | html("</table>\n"); |
83 | } | 83 | } |
84 | 84 | ||
85 | static void print_object(const unsigned char *sha1, char *path, const char *basename) | 85 | static void print_object(const unsigned char *sha1, char *path, const char *basename) |
86 | { | 86 | { |
87 | enum object_type type; | 87 | enum object_type type; |
88 | char *buf; | 88 | char *buf; |
89 | unsigned long size; | 89 | unsigned long size; |
90 | 90 | ||
91 | type = sha1_object_info(sha1, &size); | 91 | type = sha1_object_info(sha1, &size); |
92 | if (type == OBJ_BAD) { | 92 | if (type == OBJ_BAD) { |
93 | cgit_print_error(fmt("Bad object name: %s", | 93 | cgit_print_error(fmt("Bad object name: %s", |
94 | sha1_to_hex(sha1))); | 94 | sha1_to_hex(sha1))); |
95 | return; | 95 | return; |
96 | } | 96 | } |
97 | 97 | ||
98 | buf = read_sha1_file(sha1, &type, &size); | 98 | buf = read_sha1_file(sha1, &type, &size); |
99 | if (!buf) { | 99 | if (!buf) { |
100 | cgit_print_error(fmt("Error reading object %s", | 100 | cgit_print_error(fmt("Error reading object %s", |
101 | sha1_to_hex(sha1))); | 101 | sha1_to_hex(sha1))); |
102 | return; | 102 | return; |
103 | } | 103 | } |
104 | 104 | ||
105 | htmlf("blob: %s (", sha1_to_hex(sha1)); | 105 | htmlf("blob: %s (", sha1_to_hex(sha1)); |
106 | cgit_plain_link("plain", NULL, NULL, ctx.qry.head, | 106 | cgit_plain_link("plain", NULL, NULL, ctx.qry.head, |
107 | curr_rev, path); | 107 | curr_rev, path); |
108 | html(")\n"); | 108 | html(")\n"); |
109 | 109 | ||
110 | if (ctx.cfg.max_blob_size && size / 1024 > ctx.cfg.max_blob_size) { | 110 | if (ctx.cfg.max_blob_size && size / 1024 > ctx.cfg.max_blob_size) { |
111 | htmlf("<div class='error'>blob size (%ldKB) exceeds display size limit (%dKB).</div>", | 111 | htmlf("<div class='error'>blob size (%ldKB) exceeds display size limit (%dKB).</div>", |
112 | size / 1024, ctx.cfg.max_blob_size); | 112 | size / 1024, ctx.cfg.max_blob_size); |
113 | return; | 113 | return; |
114 | } | 114 | } |
115 | 115 | ||
116 | if (buffer_is_binary(buf, size)) | 116 | if (buffer_is_binary(buf, size)) |
117 | print_binary_buffer(buf, size); | 117 | print_binary_buffer(buf, size); |
118 | else | 118 | else |
119 | print_text_buffer(basename, buf, size); | 119 | print_text_buffer(basename, buf, size); |
120 | } | 120 | } |
121 | 121 | ||
122 | 122 | ||
123 | static int ls_item(const unsigned char *sha1, const char *base, int baselen, | 123 | static int ls_item(const unsigned char *sha1, const char *base, int baselen, |
124 | const char *pathname, unsigned int mode, int stage, | 124 | const char *pathname, unsigned int mode, int stage, |
125 | void *cbdata) | 125 | void *cbdata) |
126 | { | 126 | { |
127 | char *name; | 127 | char *name; |
128 | char *fullpath; | 128 | char *fullpath; |
129 | char *class; | 129 | char *class; |
130 | enum object_type type; | 130 | enum object_type type; |
131 | unsigned long size = 0; | 131 | unsigned long size = 0; |
132 | 132 | ||
133 | name = xstrdup(pathname); | 133 | name = xstrdup(pathname); |
134 | fullpath = fmt("%s%s%s", ctx.qry.path ? ctx.qry.path : "", | 134 | fullpath = fmt("%s%s%s", ctx.qry.path ? ctx.qry.path : "", |
135 | ctx.qry.path ? "/" : "", name); | 135 | ctx.qry.path ? "/" : "", name); |
136 | 136 | ||
137 | if (!S_ISGITLINK(mode)) { | 137 | if (!S_ISGITLINK(mode)) { |
138 | type = sha1_object_info(sha1, &size); | 138 | type = sha1_object_info(sha1, &size); |
139 | if (type == OBJ_BAD) { | 139 | if (type == OBJ_BAD) { |
140 | htmlf("<tr><td colspan='3'>Bad object: %s %s</td></tr>", | 140 | htmlf("<tr><td colspan='3'>Bad object: %s %s</td></tr>", |
141 | name, | 141 | name, |
142 | sha1_to_hex(sha1)); | 142 | sha1_to_hex(sha1)); |
143 | return 0; | 143 | return 0; |
144 | } | 144 | } |
145 | } | 145 | } |
146 | 146 | ||
147 | html("<tr><td class='ls-mode'>"); | 147 | html("<tr><td class='ls-mode'>"); |
148 | cgit_print_filemode(mode); | 148 | cgit_print_filemode(mode); |
149 | html("</td><td>"); | 149 | html("</td><td>"); |
150 | if (S_ISGITLINK(mode)) { | 150 | if (S_ISGITLINK(mode)) { |
151 | htmlf("<a class='ls-mod' href='"); | 151 | htmlf("<a class='ls-mod' href='"); |
152 | html_attr(fmt(ctx.repo->module_link, | 152 | html_attr(fmt(ctx.repo->module_link, |
153 | name, | 153 | name, |
154 | sha1_to_hex(sha1))); | 154 | sha1_to_hex(sha1))); |
155 | html("'>"); | 155 | html("'>"); |
156 | html_txt(name); | 156 | html_txt(name); |
157 | html("</a>"); | 157 | html("</a>"); |
158 | } else if (S_ISDIR(mode)) { | 158 | } else if (S_ISDIR(mode)) { |
159 | cgit_tree_link(name, NULL, "ls-dir", ctx.qry.head, | 159 | cgit_tree_link(name, NULL, "ls-dir", ctx.qry.head, |
160 | curr_rev, fullpath); | 160 | curr_rev, fullpath); |
161 | } else { | 161 | } else { |
162 | class = strrchr(name, '.'); | 162 | class = strrchr(name, '.'); |
163 | if (class != NULL) { | 163 | if (class != NULL) { |
164 | class = fmt("ls-blob %s", class + 1); | 164 | class = fmt("ls-blob %s", class + 1); |
165 | } else | 165 | } else |
166 | class = "ls-blob"; | 166 | class = "ls-blob"; |
167 | cgit_tree_link(name, NULL, class, ctx.qry.head, | 167 | cgit_tree_link(name, NULL, class, ctx.qry.head, |
168 | curr_rev, fullpath); | 168 | curr_rev, fullpath); |
169 | } | 169 | } |
170 | htmlf("</td><td class='ls-size'>%li</td>", size); | 170 | htmlf("</td><td class='ls-size'>%li</td>", size); |
171 | 171 | ||
172 | html("<td>"); | 172 | html("<td>"); |
173 | cgit_log_link("log", NULL, "button", ctx.qry.head, curr_rev, | 173 | cgit_log_link("log", NULL, "button", ctx.qry.head, curr_rev, |
174 | fullpath, 0, NULL, NULL, ctx.qry.showmsg); | 174 | fullpath, 0, NULL, NULL, ctx.qry.showmsg); |
175 | if (ctx.repo->max_stats) | 175 | if (ctx.repo->max_stats) |
176 | cgit_stats_link("stats", NULL, "button", ctx.qry.head, | 176 | cgit_stats_link("stats", NULL, "button", ctx.qry.head, |
177 | fullpath); | 177 | fullpath); |
178 | cgit_plain_link("plain", NULL, "button", ctx.qry.head, curr_rev, | 178 | cgit_plain_link("plain", NULL, "button", ctx.qry.head, curr_rev, |
179 | fullpath); | 179 | fullpath); |
180 | html("</td></tr>\n"); | 180 | html("</td></tr>\n"); |
181 | free(name); | 181 | free(name); |
182 | return 0; | 182 | return 0; |
183 | } | 183 | } |
184 | 184 | ||
185 | static void ls_head() | 185 | static void ls_head() |
186 | { | 186 | { |
187 | html("<table summary='tree listing' class='list'>\n"); | 187 | html("<table summary='tree listing' class='list'>\n"); |
188 | html("<tr class='nohover'>"); | 188 | html("<tr class='nohover'>"); |
189 | html("<th class='left'>Mode</th>"); | 189 | html("<th class='left'>Mode</th>"); |
190 | html("<th class='left'>Name</th>"); | 190 | html("<th class='left'>Name</th>"); |
191 | html("<th class='right'>Size</th>"); | 191 | html("<th class='right'>Size</th>"); |
192 | html("<th/>"); | 192 | html("<th/>"); |
193 | html("</tr>\n"); | 193 | html("</tr>\n"); |
194 | header = 1; | 194 | header = 1; |
195 | } | 195 | } |
196 | 196 | ||
197 | static void ls_tail() | 197 | static void ls_tail() |
198 | { | 198 | { |
199 | if (!header) | 199 | if (!header) |
200 | return; | 200 | return; |
201 | html("</table>\n"); | 201 | html("</table>\n"); |
202 | header = 0; | 202 | header = 0; |
203 | } | 203 | } |
204 | 204 | ||
205 | static void ls_tree(const unsigned char *sha1, char *path) | 205 | static void ls_tree(const unsigned char *sha1, char *path) |
206 | { | 206 | { |
207 | struct tree *tree; | 207 | struct tree *tree; |
208 | 208 | ||
209 | tree = parse_tree_indirect(sha1); | 209 | tree = parse_tree_indirect(sha1); |
210 | if (!tree) { | 210 | if (!tree) { |
211 | cgit_print_error(fmt("Not a tree object: %s", | 211 | cgit_print_error(fmt("Not a tree object: %s", |
212 | sha1_to_hex(sha1))); | 212 | sha1_to_hex(sha1))); |
213 | return; | 213 | return; |
214 | } | 214 | } |
215 | 215 | ||
216 | ls_head(); | 216 | ls_head(); |
217 | read_tree_recursive(tree, "", 0, 1, NULL, ls_item, NULL); | 217 | read_tree_recursive(tree, "", 0, 1, NULL, ls_item, NULL); |
218 | ls_tail(); | 218 | ls_tail(); |
219 | } | 219 | } |
220 | 220 | ||
221 | 221 | ||
222 | static int walk_tree(const unsigned char *sha1, const char *base, int baselen, | 222 | static int walk_tree(const unsigned char *sha1, const char *base, int baselen, |
223 | const char *pathname, unsigned mode, int stage, | 223 | const char *pathname, unsigned mode, int stage, |
224 | void *cbdata) | 224 | void *cbdata) |
225 | { | 225 | { |
226 | static int state; | 226 | static int state; |
227 | static char buffer[PATH_MAX]; | 227 | static char buffer[PATH_MAX]; |
228 | 228 | ||
229 | if (state == 0) { | 229 | if (state == 0) { |
230 | memcpy(buffer, base, baselen); | 230 | memcpy(buffer, base, baselen); |
231 | strcpy(buffer+baselen, pathname); | 231 | strcpy(buffer+baselen, pathname); |
232 | if (strcmp(match_path, buffer)) | 232 | if (strcmp(match_path, buffer)) |
233 | return READ_TREE_RECURSIVE; | 233 | return READ_TREE_RECURSIVE; |
234 | 234 | ||
235 | if (S_ISDIR(mode)) { | 235 | if (S_ISDIR(mode)) { |
236 | state = 1; | 236 | state = 1; |
237 | ls_head(); | 237 | ls_head(); |
238 | return READ_TREE_RECURSIVE; | 238 | return READ_TREE_RECURSIVE; |
239 | } else { | 239 | } else { |
240 | print_object(sha1, buffer, pathname); | 240 | print_object(sha1, buffer, pathname); |
241 | return 0; | 241 | return 0; |
242 | } | 242 | } |
243 | } | 243 | } |
244 | ls_item(sha1, base, baselen, pathname, mode, stage, NULL); | 244 | ls_item(sha1, base, baselen, pathname, mode, stage, NULL); |
245 | return 0; | 245 | return 0; |
246 | } | 246 | } |
247 | 247 | ||
248 | 248 | ||
249 | /* | 249 | /* |
250 | * Show a tree or a blob | 250 | * Show a tree or a blob |
251 | * rev: the commit pointing at the root tree object | 251 | * rev: the commit pointing at the root tree object |
252 | * path: path to tree or blob | 252 | * path: path to tree or blob |
253 | */ | 253 | */ |
254 | void cgit_print_tree(const char *rev, char *path) | 254 | void cgit_print_tree(const char *rev, char *path) |
255 | { | 255 | { |
256 | unsigned char sha1[20]; | 256 | unsigned char sha1[20]; |
257 | struct commit *commit; | 257 | struct commit *commit; |
258 | const char *paths[] = {path, NULL}; | 258 | const char *paths[] = {path, NULL}; |
259 | 259 | ||
260 | if (!rev) | 260 | if (!rev) |
261 | rev = ctx.qry.head; | 261 | rev = ctx.qry.head; |
262 | 262 | ||
263 | curr_rev = xstrdup(rev); | 263 | curr_rev = xstrdup(rev); |
264 | if (get_sha1(rev, sha1)) { | 264 | if (get_sha1(rev, sha1)) { |
265 | cgit_print_error(fmt("Invalid revision name: %s", rev)); | 265 | cgit_print_error(fmt("Invalid revision name: %s", rev)); |
266 | return; | 266 | return; |
267 | } | 267 | } |
268 | commit = lookup_commit_reference(sha1); | 268 | commit = lookup_commit_reference(sha1); |
269 | if (!commit || parse_commit(commit)) { | 269 | if (!commit || parse_commit(commit)) { |
270 | cgit_print_error(fmt("Invalid commit reference: %s", rev)); | 270 | cgit_print_error(fmt("Invalid commit reference: %s", rev)); |
271 | return; | 271 | return; |
272 | } | 272 | } |
273 | 273 | ||
274 | if (path == NULL) { | 274 | if (path == NULL) { |
275 | ls_tree(commit->tree->object.sha1, NULL); | 275 | ls_tree(commit->tree->object.sha1, NULL); |
276 | return; | 276 | return; |
277 | } | 277 | } |
278 | 278 | ||
279 | match_path = path; | 279 | match_path = path; |
280 | read_tree_recursive(commit->tree, "", 0, 0, paths, walk_tree, NULL); | 280 | read_tree_recursive(commit->tree, "", 0, 0, paths, walk_tree, NULL); |
281 | ls_tail(); | 281 | ls_tail(); |
282 | } | 282 | } |