author | Mark Lodato <lodatom@gmail.com> | 2010-09-04 15:30:18 (UTC) |
---|---|---|
committer | Mark Lodato <lodatom@gmail.com> | 2010-09-04 15:35:38 (UTC) |
commit | e4ddc8f72b5a7d8c55a6c2042c7b7f945ba4b1a2 (patch) (unidiff) | |
tree | 2ade0bb45e15ad5466ca4d3433201477f0c9214e /ui-tree.c | |
parent | a4c58d92bfee0cf2e35ab1c5e828a6d790108a69 (diff) | |
download | cgit-e4ddc8f72b5a7d8c55a6c2042c7b7f945ba4b1a2.zip cgit-e4ddc8f72b5a7d8c55a6c2042c7b7f945ba4b1a2.tar.gz cgit-e4ddc8f72b5a7d8c55a6c2042c7b7f945ba4b1a2.tar.bz2 |
fix errors in printf-style format strings
There were many places where the arguments to a printf-like function did
not match the format string. Mostly, these were a missing 'l' flag, but
there were three exceptions:
- In ui-stats.c, a size_t argument must be printed. C99 has the "%zu"
flag for this purpose, but not all compilers support this. Therefore,
we mimic what git does - use a NO_C99_FORMAT Makefile variable.
- In ui-stats.c, cgit_print_error() was called with a pointer instead of
a character.
- In ui-log.c, the "columns" argument was never used.
Signed-off-by: Mark Lodato <lodatom@gmail.com>
-rw-r--r-- | ui-tree.c | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -1,239 +1,239 @@ | |||
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 | write(STDOUT_FILENO, 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'>%04x</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 (%dKB) 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 { |