ui-tree.c (view raw)
1/* ui-tree.c: functions for tree output
2 *
3 * Copyright (C) 2006 Lars Hjemli
4 *
5 * Licensed under GNU General Public License v2
6 * (see COPYING for full license text)
7 */
8
9#include <ctype.h>
10#include "cgit.h"
11#include "html.h"
12#include "ui-shared.h"
13
14char *curr_rev;
15char *match_path;
16int header = 0;
17
18static void print_text_buffer(const char *name, char *buf, unsigned long size)
19{
20 unsigned long lineno, idx;
21 const char *numberfmt =
22 "<a class='no' id='n%1$d' name='n%1$d' href='#n%1$d'>%1$d</a>\n";
23
24 html("<table summary='blob content' class='blob'>\n");
25
26 if (ctx.cfg.enable_tree_linenumbers) {
27 html("<tr><td class='linenumbers'><pre>");
28 idx = 0;
29 lineno = 0;
30
31 if (size) {
32 htmlf(numberfmt, ++lineno);
33 while(idx < size - 1) { // skip absolute last newline
34 if (buf[idx] == '\n')
35 htmlf(numberfmt, ++lineno);
36 idx++;
37 }
38 }
39 html("</pre></td>\n");
40 }
41 else {
42 html("<tr>\n");
43 }
44
45 if (ctx.repo->source_filter) {
46 html("<td class='lines'><pre><code>");
47 ctx.repo->source_filter->argv[1] = xstrdup(name);
48 cgit_open_filter(ctx.repo->source_filter);
49 html_raw(buf, size);
50 cgit_close_filter(ctx.repo->source_filter);
51 free(ctx.repo->source_filter->argv[1]);
52 ctx.repo->source_filter->argv[1] = NULL;
53 html("</code></pre></td></tr></table>\n");
54 return;
55 }
56
57 html("<td class='lines'><pre><code>");
58 html_txt(buf);
59 html("</code></pre></td></tr></table>\n");
60}
61
62#define ROWLEN 32
63
64static void print_binary_buffer(char *buf, unsigned long size)
65{
66 unsigned long ofs, idx;
67 static char ascii[ROWLEN + 1];
68
69 html("<table summary='blob content' class='bin-blob'>\n");
70 html("<tr><th>ofs</th><th>hex dump</th><th>ascii</th></tr>");
71 for (ofs = 0; ofs < size; ofs += ROWLEN, buf += ROWLEN) {
72 htmlf("<tr><td class='right'>%04lx</td><td class='hex'>", ofs);
73 for (idx = 0; idx < ROWLEN && ofs + idx < size; idx++)
74 htmlf("%*s%02x",
75 idx == 16 ? 4 : 1, "",
76 buf[idx] & 0xff);
77 html(" </td><td class='hex'>");
78 for (idx = 0; idx < ROWLEN && ofs + idx < size; idx++)
79 ascii[idx] = isgraph(buf[idx]) ? buf[idx] : '.';
80 ascii[idx] = '\0';
81 html_txt(ascii);
82 html("</td></tr>\n");
83 }
84 html("</table>\n");
85}
86
87static void print_object(const unsigned char *sha1, char *path, const char *basename)
88{
89 enum object_type type;
90 char *buf;
91 unsigned long size;
92
93 type = sha1_object_info(sha1, &size);
94 if (type == OBJ_BAD) {
95 cgit_print_error(fmt("Bad object name: %s",
96 sha1_to_hex(sha1)));
97 return;
98 }
99
100 buf = read_sha1_file(sha1, &type, &size);
101 if (!buf) {
102 cgit_print_error(fmt("Error reading object %s",
103 sha1_to_hex(sha1)));
104 return;
105 }
106
107 htmlf("blob: %s (", sha1_to_hex(sha1));
108 cgit_plain_link("plain", NULL, NULL, ctx.qry.head,
109 curr_rev, path);
110 html(")\n");
111
112 if (ctx.cfg.max_blob_size && size / 1024 > ctx.cfg.max_blob_size) {
113 htmlf("<div class='error'>blob size (%ldKB) exceeds display size limit (%dKB).</div>",
114 size / 1024, ctx.cfg.max_blob_size);
115 return;
116 }
117
118 if (buffer_is_binary(buf, size))
119 print_binary_buffer(buf, size);
120 else
121 print_text_buffer(basename, buf, size);
122}
123
124
125static int ls_item(const unsigned char *sha1, const char *base, int baselen,
126 const char *pathname, unsigned int mode, int stage,
127 void *cbdata)
128{
129 char *name;
130 char *fullpath;
131 char *class;
132 enum object_type type;
133 unsigned long size = 0;
134
135 name = xstrdup(pathname);
136 fullpath = fmt("%s%s%s", ctx.qry.path ? ctx.qry.path : "",
137 ctx.qry.path ? "/" : "", name);
138
139 if (!S_ISGITLINK(mode)) {
140 type = sha1_object_info(sha1, &size);
141 if (type == OBJ_BAD) {
142 htmlf("<tr><td colspan='3'>Bad object: %s %s</td></tr>",
143 name,
144 sha1_to_hex(sha1));
145 return 0;
146 }
147 }
148
149 html("<tr><td class='ls-mode'>");
150 cgit_print_filemode(mode);
151 html("</td><td>");
152 if (S_ISGITLINK(mode)) {
153 htmlf("<a class='ls-mod' href='");
154 html_attr(fmt(ctx.repo->module_link,
155 name,
156 sha1_to_hex(sha1)));
157 html("'>");
158 html_txt(name);
159 html("</a>");
160 } else if (S_ISDIR(mode)) {
161 cgit_tree_link(name, NULL, "ls-dir", ctx.qry.head,
162 curr_rev, fullpath);
163 } else {
164 class = strrchr(name, '.');
165 if (class != NULL) {
166 class = fmt("ls-blob %s", class + 1);
167 } else
168 class = "ls-blob";
169 cgit_tree_link(name, NULL, class, ctx.qry.head,
170 curr_rev, fullpath);
171 }
172 htmlf("</td><td class='ls-size'>%li</td>", size);
173
174 html("<td>");
175 cgit_log_link("log", NULL, "button", ctx.qry.head, curr_rev,
176 fullpath, 0, NULL, NULL, ctx.qry.showmsg);
177 if (ctx.repo->max_stats)
178 cgit_stats_link("stats", NULL, "button", ctx.qry.head,
179 fullpath);
180 cgit_plain_link("plain", NULL, "button", ctx.qry.head, curr_rev,
181 fullpath);
182 html("</td></tr>\n");
183 free(name);
184 return 0;
185}
186
187static void ls_head()
188{
189 html("<table summary='tree listing' class='list'>\n");
190 html("<tr class='nohover'>");
191 html("<th class='left'>Mode</th>");
192 html("<th class='left'>Name</th>");
193 html("<th class='right'>Size</th>");
194 html("<th/>");
195 html("</tr>\n");
196 header = 1;
197}
198
199static void ls_tail()
200{
201 if (!header)
202 return;
203 html("</table>\n");
204 header = 0;
205}
206
207static void ls_tree(const unsigned char *sha1, char *path)
208{
209 struct tree *tree;
210
211 tree = parse_tree_indirect(sha1);
212 if (!tree) {
213 cgit_print_error(fmt("Not a tree object: %s",
214 sha1_to_hex(sha1)));
215 return;
216 }
217
218 ls_head();
219 read_tree_recursive(tree, "", 0, 1, NULL, ls_item, NULL);
220 ls_tail();
221}
222
223
224static int walk_tree(const unsigned char *sha1, const char *base, int baselen,
225 const char *pathname, unsigned mode, int stage,
226 void *cbdata)
227{
228 static int state;
229 static char buffer[PATH_MAX];
230
231 if (state == 0) {
232 memcpy(buffer, base, baselen);
233 strcpy(buffer+baselen, pathname);
234 if (strcmp(match_path, buffer))
235 return READ_TREE_RECURSIVE;
236
237 if (S_ISDIR(mode)) {
238 state = 1;
239 ls_head();
240 return READ_TREE_RECURSIVE;
241 } else {
242 print_object(sha1, buffer, pathname);
243 return 0;
244 }
245 }
246 ls_item(sha1, base, baselen, pathname, mode, stage, NULL);
247 return 0;
248}
249
250
251/*
252 * Show a tree or a blob
253 * rev: the commit pointing at the root tree object
254 * path: path to tree or blob
255 */
256void cgit_print_tree(const char *rev, char *path)
257{
258 unsigned char sha1[20];
259 struct commit *commit;
260 const char *paths[] = {path, NULL};
261
262 if (!rev)
263 rev = ctx.qry.head;
264
265 curr_rev = xstrdup(rev);
266 if (get_sha1(rev, sha1)) {
267 cgit_print_error(fmt("Invalid revision name: %s", rev));
268 return;
269 }
270 commit = lookup_commit_reference(sha1);
271 if (!commit || parse_commit(commit)) {
272 cgit_print_error(fmt("Invalid commit reference: %s", rev));
273 return;
274 }
275
276 if (path == NULL) {
277 ls_tree(commit->tree->object.sha1, NULL);
278 return;
279 }
280
281 match_path = path;
282 read_tree_recursive(commit->tree, "", 0, 0, paths, walk_tree, NULL);
283 ls_tail();
284}