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 "cgit.h"
10#include "html.h"
11#include "ui-shared.h"
12
13char *curr_rev;
14char *match_path;
15int header = 0;
16
17static void print_object(const unsigned char *sha1, char *path)
18{
19 enum object_type type;
20 char *buf;
21 unsigned long size, lineno, idx;
22 const char *numberfmt = "<a class='no' id='n%1$d' name='n%1$d' href='#n%1$d'>%1$d</a>\n";
23
24 type = sha1_object_info(sha1, &size);
25 if (type == OBJ_BAD) {
26 cgit_print_error(fmt("Bad object name: %s",
27 sha1_to_hex(sha1)));
28 return;
29 }
30
31 buf = read_sha1_file(sha1, &type, &size);
32 if (!buf) {
33 cgit_print_error(fmt("Error reading object %s",
34 sha1_to_hex(sha1)));
35 return;
36 }
37
38 html(" (");
39 cgit_plain_link("plain", NULL, NULL, ctx.qry.head,
40 curr_rev, path);
41 htmlf(")<br/>blob: %s\n", sha1_to_hex(sha1));
42
43 html("<table summary='blob content' class='blob'>\n");
44 html("<tr>\n");
45
46 html("<td class='linenumbers'><pre>");
47 idx = 0;
48 lineno = 0;
49 htmlf(numberfmt, ++lineno);
50 while(idx < size - 1) { // skip absolute last newline
51 if (buf[idx] == '\n') {
52 htmlf(numberfmt, ++lineno);
53 }
54 idx++;
55 }
56 html("</pre></td>\n");
57
58 html("<td class='lines'><pre><code>");
59 html_txt(buf);
60 html("</code></pre></td>\n");
61
62 html("</tr>\n");
63 html("</table>\n");
64}
65
66
67static int ls_item(const unsigned char *sha1, const char *base, int baselen,
68 const char *pathname, unsigned int mode, int stage,
69 void *cbdata)
70{
71 char *name;
72 char *fullpath;
73 enum object_type type;
74 unsigned long size = 0;
75
76 name = xstrdup(pathname);
77 fullpath = fmt("%s%s%s", ctx.qry.path ? ctx.qry.path : "",
78 ctx.qry.path ? "/" : "", name);
79
80 if (!S_ISGITLINK(mode)) {
81 type = sha1_object_info(sha1, &size);
82 if (type == OBJ_BAD) {
83 htmlf("<tr><td colspan='3'>Bad object: %s %s</td></tr>",
84 name,
85 sha1_to_hex(sha1));
86 return 0;
87 }
88 }
89
90 html("<tr><td class='ls-mode'>");
91 cgit_print_filemode(mode);
92 html("</td><td>");
93 if (S_ISGITLINK(mode)) {
94 htmlf("<a class='ls-mod' href='");
95 html_attr(fmt(ctx.repo->module_link,
96 name,
97 sha1_to_hex(sha1)));
98 html("'>");
99 html_txt(name);
100 html("</a>");
101 } else if (S_ISDIR(mode)) {
102 cgit_tree_link(name, NULL, "ls-dir", ctx.qry.head,
103 curr_rev, fullpath);
104 } else {
105 cgit_tree_link(name, NULL, "ls-blob", ctx.qry.head,
106 curr_rev, fullpath);
107 }
108 htmlf("</td><td class='ls-size'>%li</td>", size);
109
110 html("<td>");
111 cgit_log_link("log", NULL, "button", ctx.qry.head, curr_rev,
112 fullpath, 0, NULL, NULL, ctx.qry.showmsg);
113 html("</td></tr>\n");
114 free(name);
115 return 0;
116}
117
118static void ls_head()
119{
120 html("<table summary='tree listing' class='list'>\n");
121 html("<tr class='nohover'>");
122 html("<th class='left'>Mode</th>");
123 html("<th class='left'>Name</th>");
124 html("<th class='right'>Size</th>");
125 html("<th/>");
126 html("</tr>\n");
127 header = 1;
128}
129
130static void ls_tail()
131{
132 if (!header)
133 return;
134 html("</table>\n");
135 header = 0;
136}
137
138static void ls_tree(const unsigned char *sha1, char *path)
139{
140 struct tree *tree;
141
142 tree = parse_tree_indirect(sha1);
143 if (!tree) {
144 cgit_print_error(fmt("Not a tree object: %s",
145 sha1_to_hex(sha1)));
146 return;
147 }
148
149 ls_head();
150 read_tree_recursive(tree, "", 0, 1, NULL, ls_item, NULL);
151 ls_tail();
152}
153
154
155static int walk_tree(const unsigned char *sha1, const char *base, int baselen,
156 const char *pathname, unsigned mode, int stage,
157 void *cbdata)
158{
159 static int state;
160 static char buffer[PATH_MAX];
161 char *url;
162
163 if (state == 0) {
164 memcpy(buffer, base, baselen);
165 strcpy(buffer+baselen, pathname);
166 url = cgit_pageurl(ctx.qry.repo, "tree",
167 fmt("h=%s&path=%s", curr_rev, buffer));
168 html("/");
169 cgit_tree_link(xstrdup(pathname), NULL, NULL, ctx.qry.head,
170 curr_rev, buffer);
171
172 if (strcmp(match_path, buffer))
173 return READ_TREE_RECURSIVE;
174
175 if (S_ISDIR(mode)) {
176 state = 1;
177 ls_head();
178 return READ_TREE_RECURSIVE;
179 } else {
180 print_object(sha1, buffer);
181 return 0;
182 }
183 }
184 ls_item(sha1, base, baselen, pathname, mode, stage, NULL);
185 return 0;
186}
187
188
189/*
190 * Show a tree or a blob
191 * rev: the commit pointing at the root tree object
192 * path: path to tree or blob
193 */
194void cgit_print_tree(const char *rev, char *path)
195{
196 unsigned char sha1[20];
197 struct commit *commit;
198 const char *paths[] = {path, NULL};
199
200 if (!rev)
201 rev = ctx.qry.head;
202
203 curr_rev = xstrdup(rev);
204 if (get_sha1(rev, sha1)) {
205 cgit_print_error(fmt("Invalid revision name: %s", rev));
206 return;
207 }
208 commit = lookup_commit_reference(sha1);
209 if (!commit || parse_commit(commit)) {
210 cgit_print_error(fmt("Invalid commit reference: %s", rev));
211 return;
212 }
213
214 html("path: <a href='");
215 html_attr(cgit_pageurl(ctx.qry.repo, "tree", fmt("h=%s", rev)));
216 html("'>root</a>");
217
218 if (path == NULL) {
219 ls_tree(commit->tree->object.sha1, NULL);
220 return;
221 }
222
223 match_path = path;
224 read_tree_recursive(commit->tree, NULL, 0, 0, paths, walk_tree, NULL);
225 ls_tail();
226}