/[CvsGraph]/cvsgraph/cvsgraph.c
ViewVC logotype

Annotate of /cvsgraph/cvsgraph.c

Parent Directory Parent Directory | Revision Log Revision Log | View Revision Graph Revision Graph


Revision 1.62 - (show annotations)
Sat Jul 8 13:56:54 2006 UTC (11 years, 3 months ago) by bertho
Branch: MAIN
CVS Tags: REL_1_6_1
Changes since 1.61: +3 -3 lines
File MIME type: text/plain
Prepare release 1.6.1
1 /*
2 * CvsGraph graphical representation generator of brances and revisions
3 * of a file in cvs/rcs.
4 *
5 * Copyright (C) 2001,2002,2003,2004,2005,2006 B. Stultiens
6 *
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
11 *
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 */
21
22 #include "config.h"
23
24 #include <stdio.h>
25 #include <stdlib.h>
26 #include <stdarg.h>
27 #include <unistd.h>
28 #include <string.h>
29 #include <assert.h>
30 #include <sys/types.h>
31 #include <sys/stat.h>
32 #ifdef HAVE_SYS_WAIT_H
33 # include <sys/wait.h>
34 #endif
35 #include <fcntl.h>
36 #include <regex.h>
37 #include <errno.h>
38 #include <ctype.h>
39 #include <time.h>
40 #include <limits.h>
41 #include <math.h>
42
43 #ifdef HAVE_GETOPT_H
44 # include <getopt.h>
45 #endif
46
47 #include <gd.h>
48 #include <gdfontt.h>
49
50 #include "cvsgraph.h"
51 #include "utils.h"
52 #include "readconf.h"
53 #include "rcs.h"
54
55 #if !defined(HAVE_IMAGE_GIF) && !defined(HAVE_IMAGE_PNG) && !defined(HAVE_IMAGE_JPEG)
56 # error No image output format available. Check libgd
57 #endif
58
59
60 /*#define DEBUG 1*/
61 /*#define NOGDFILL 1*/
62 /*#define DEBUG_IMAGEMAP 1*/
63
64 #define LOOPSAFEGUARD 10000 /* Max itterations in possible infinite loops */
65
66 #ifndef MAX
67 # define MAX(a,b) ((a) > (b) ? (a) : (b))
68 #endif
69
70 #ifndef MIN
71 # define MIN(a,b) ((a) < (b) ? (a) : (b))
72 #endif
73
74 #define ALIGN_HL 0x00
75 #define ALIGN_HC 0x01
76 #define ALIGN_HR 0x02
77 #define ALIGN_HX 0x0f
78 #define ALIGN_VT 0x00
79 #define ALIGN_VC 0x10
80 #define ALIGN_VB 0x20
81 #define ALIGN_VX 0xf0
82
83 #ifndef M_PI /* math.h should have defined this */
84 # define M_PI 3.14159265358979323846
85 #endif
86 #define ROUND(f) ((f >= 0.0)?((int)(f + 0.5)):((int)(f - 0.5)))
87
88 #define ARROW_LENGTH 12 /* Default arrow dimensions */
89 #define ARROW_WIDTH 3
90
91 /*
92 **************************************************************************
93 * Globals
94 **************************************************************************
95 */
96
97 config_t conf;
98 int debuglevel;
99
100 static color_t white_color = {255, 255, 255, 0, NULL};
101 static color_t black_color = {0, 0, 0, 0, NULL};
102
103 static branch_t *subtree_branch = NULL; /* Set to the (first) subtree branch that we want to show */
104 static revision_t *subtree_rev = NULL; /* Set to the subtree revision which branches we want to show */
105
106 static msg_stack_t *msg_stack = NULL; /* Messages that would otherwise be sent to stderr goto the image */
107 static int nmsg_stack = 0;
108
109 /*
110 **************************************************************************
111 * Forwards
112 **************************************************************************
113 */
114 static void zap_string(void);
115 static char *dup_string(void);
116 static void add_string_str(const char *s);
117 static void add_string_ch(int ch);
118 static void add_string_date(const char *d);
119 static void add_string_str_html(const char *s, int maxlen);
120 static void add_string_str_len(const char *s, int maxlen);
121
122 static void calc_subtree_size(branch_t *b, int *x, int *y, int *w, int *h);
123
124 /*
125 **************************************************************************
126 * Debug routines
127 **************************************************************************
128 */
129 static void dump_rev(char *p, rev_t *r)
130 {
131 printf("%s", p);
132 if(r)
133 printf("'%s', '%s', %d\n", r->rev, r->branch, r->isbranch);
134 else
135 printf("<null>\n");
136 }
137
138 static void dump_id(char *p, char *d)
139 {
140 printf("%s", p);
141 if(d)
142 printf("'%s'\n", d);
143 else
144 printf("<null>\n");
145 }
146
147 static void dump_idrev(char *p, idrev_t *t)
148 {
149 printf("%s", p);
150 if(t)
151 {
152 printf("'%s' -> ", t->id);
153 dump_rev("", t->rev);
154 }
155 else
156 printf("<null>\n");
157 }
158
159 static void dump_tag(char *p, tag_t *t)
160 {
161 printf("%s", p);
162 if(t)
163 {
164 printf("'%s' -> ", t->tag);
165 dump_rev("", t->rev);
166 }
167 else
168 printf("<null>\n");
169 }
170
171 static void dump_delta(char *p, delta_t *d)
172 {
173 int i;
174 printf("%sdelta.rev : ", p);
175 dump_rev("", d->rev);
176 printf("%sdelta.date : %s\n", p, d->date);
177 printf("%sdelta.author: %s\n", p, d->author);
178 printf("%sdelta.state : %s\n", p, d->state);
179 for(i = 0; d->branches && i < d->branches->nrevs; i++)
180 {
181 printf("%sdelta.branch: ", p);
182 dump_rev("", d->branches->revs[i]);
183 }
184 printf("%sdelta.next : ", p);
185 dump_rev("", d->next);
186 printf("\n");
187 }
188
189 static void dump_dtext(char *p, dtext_t *d)
190 {
191 printf("%sdtext.rev : ", p);
192 dump_rev("", d->rev);
193 printf("%sdtext.log : %d bytes\n", p, d->log ? strlen(d->log) : -1);
194 printf("%sdtext.text : %d bytes\n", p, d->text ? strlen(d->text) : -1);
195 printf("\n");
196 }
197
198 static void dump_rcsfile(rcsfile_t *rcs)
199 {
200 int i;
201 printf("root : '%s'\n", rcs->root);
202 printf("module : '%s'\n", rcs->module);
203 printf("file : '%s'\n", rcs->file);
204 dump_rev("head : ", rcs->head);
205 dump_rev("branch : ", rcs->branch);
206 printf("access :\n");
207 for(i = 0; rcs->access && i < rcs->access->nids; i++)
208 dump_id("\t", rcs->access->ids[i]);
209 printf("tags :\n");
210 for(i = 0; rcs->tags && i < rcs->tags->ntags; i++)
211 dump_tag("\t", rcs->tags->tags[i]);
212 printf("locks :%s\n", rcs->strict ? " (strict)" : "");
213 for(i = 0; rcs->locks && i < rcs->locks->nidrevs; i++)
214 dump_idrev("\t", rcs->locks->idrevs[i]);
215 printf("comment: '%s'\n", rcs->comment);
216 printf("expand : '%s'\n", rcs->expand ? rcs->expand : "(default -kv)");
217 printf("deltas :\n");
218 for(i = 0; rcs->deltas && i < rcs->deltas->ndeltas; i++)
219 dump_delta("\t", rcs->deltas->deltas[i]);
220 printf("desc : '%s'\n", rcs->desc);
221 printf("dtexts :\n");
222 for(i = 0; rcs->dtexts && i < rcs->dtexts->ndtexts; i++)
223 dump_dtext("\t", rcs->dtexts->dtexts[i]);
224
225 fflush(stdout);
226 }
227
228 /*
229 **************************************************************************
230 * Error/Warning Message helpers
231 **************************************************************************
232 */
233 #define MSGBUFSIZE 256
234 void stack_msg(int severity, const char *fmt, ...)
235 {
236 va_list va;
237 int i;
238 char *buf = xmalloc(MSGBUFSIZE);
239 switch(severity)
240 {
241 case MSG_WARN: sprintf(buf, "Warning: "); break;
242 case MSG_ERR: sprintf(buf, "Error: "); break;
243 default: sprintf(buf, "Unqualified error: "); break;
244 }
245 i = strlen(buf);
246 assert(i < MSGBUFSIZE);
247 va_start(va, fmt);
248 vsnprintf(buf+i, MSGBUFSIZE-i, fmt, va);
249 va_end(va);
250 if(!msg_stack)
251 msg_stack = xmalloc(sizeof(*msg_stack));
252 else
253 {
254 msg_stack = xrealloc(msg_stack, (nmsg_stack+1)*sizeof(*msg_stack));
255 }
256 msg_stack[nmsg_stack].msg = buf;
257 msg_stack[nmsg_stack].severity = severity;
258 nmsg_stack++;
259 }
260
261 /*
262 **************************************************************************
263 * Read the rcs file
264 **************************************************************************
265 */
266 static rcsfile_t *get_rcsfile(const char *cvsroot, const char *module, const char *file)
267 {
268 char *cmd = NULL;
269 int rv;
270
271 if(file)
272 {
273 cmd = xmalloc(strlen(cvsroot) + strlen(module) + strlen(file) + 1);
274 sprintf(cmd, "%s%s%s", cvsroot, module, file);
275 if(!(rcsin = fopen(cmd, "rb")))
276 {
277 perror(cmd);
278 return NULL;
279 }
280 input_file = cmd;
281 }
282 else
283 {
284 rcsin = stdin;
285 input_file = "<stdin>";
286 }
287 line_number = 1;
288 rv = rcsparse();
289 if(file)
290 {
291 fclose(rcsin);
292 xfree(cmd);
293 }
294 if(rv)
295 return NULL;
296 input_file = NULL;
297 if(file)
298 {
299 rcsfile->root = xstrdup(cvsroot);
300 rcsfile->module = xstrdup(module);
301 rcsfile->file = xstrdup(file);
302 }
303 else
304 {
305 rcsfile->root = xstrdup("");
306 rcsfile->module = xstrdup("");
307 rcsfile->file = xstrdup("<stdin>");
308 }
309 return rcsfile;
310 }
311
312 /*
313 **************************************************************************
314 * Sort and find helpers
315 **************************************************************************
316 */
317 static int count_dots(const char *s)
318 {
319 int i;
320 for(i = 0; *s; s++)
321 {
322 if(*s == '.')
323 i++;
324 }
325 return i;
326 }
327
328 static int compare_rev(int bcmp, const rev_t *r1, const rev_t *r2)
329 {
330 int d1, d2;
331 char *c1, *c2;
332 char *v1, *v2;
333 char *s1, *s2;
334 int retval = 0;
335 assert(r1 != NULL);
336 assert(r2 != NULL);
337 if(bcmp)
338 {
339 assert(r1->branch != NULL);
340 assert(r2->branch != NULL);
341 c1 = r1->branch;
342 c2 = r2->branch;
343 }
344 else
345 {
346 assert(r1->rev != NULL);
347 assert(r2->rev != NULL);
348 c1 = r1->rev;
349 c2 = r2->rev;
350 }
351
352 d1 = count_dots(c1);
353 d2 = count_dots(c2);
354 if(d1 != d2)
355 {
356 return d1 - d2;
357 }
358
359 s1 = v1 = xstrdup(c1);
360 s2 = v2 = xstrdup(c2);
361 while(1)
362 {
363 char *vc1 = strchr(s1, '.');
364 char *vc2 = strchr(s2, '.');
365 if(vc1 && vc2)
366 *vc1 = *vc2 = '\0';
367 if(*s1 && *s2)
368 {
369 d1 = atoi(s1);
370 d2 = atoi(s2);
371 if(d1 != d2)
372 {
373 retval = d1 - d2;
374 break;
375 }
376 }
377 if(!vc1 || !vc2)
378 break;
379 s1 = vc1 + 1;
380 s2 = vc2 + 1;
381 }
382 xfree(v1);
383 xfree(v2);
384 return retval;
385 }
386
387 /*
388 **************************************************************************
389 * Reorganise the rcsfile for the branches
390 *
391 * Basically, we have a list of deltas (i.e. administrative info on
392 * revisions) and a list of delta text (the actual logs and diffs).
393 * The deltas are linked through the 'next' and the 'branches' fields
394 * which describe the tree-structure of revisions.
395 * The reorganisation means that we put each delta and corresponding
396 * delta text in a revision structure and assign it to a specific
397 * branch. This is required because we want to be able to calculate
398 * the bounding boxes of each branch. The revisions expand vertically
399 * and the branches expand horizontally.
400 * The reorganisation is performed in these steps:
401 * 1 - sort deltas and delta text on revision number for quick lookup
402 * 2 - start at the denoted head revision:
403 * * create a branch structure and add this revision
404 * * for each 'branches' in the delta do:
405 * - walk all 'branches' of the delta and recursively goto 2
406 * with the denoted branch delta as new head
407 * - backlink the newly create sub-branch to the head revision
408 * so that we can draw them recursively
409 * * set head to the 'next' field and goto 2 until no next is
410 * available
411 * 3 - update the administration
412 **************************************************************************
413 */
414 static int sort_delta(const void *d1, const void *d2)
415 {
416 return compare_rev(0, (*(delta_t **)d1)->rev, (*(delta_t **)d2)->rev);
417 }
418
419 static int search_delta(const void *r, const void *d)
420 {
421 return compare_rev(0, (rev_t *)r, (*(delta_t **)d)->rev);
422 }
423
424 static delta_t *find_delta(delta_t **dl, int n, rev_t *r)
425 {
426 delta_t **d;
427 if(!n)
428 return NULL;
429 d = bsearch(r, dl, n, sizeof(*dl), search_delta);
430 if(!d)
431 return NULL;
432 return *d;
433 }
434
435 static int sort_dtext(const void *d1, const void *d2)
436 {
437 return compare_rev(0, (*(dtext_t **)d1)->rev, (*(dtext_t **)d2)->rev);
438 }
439
440 static int search_dtext(const void *r, const void *d)
441 {
442 return compare_rev(0, (rev_t *)r, (*(dtext_t **)d)->rev);
443 }
444
445 static dtext_t *find_dtext(dtext_t **dl, int n, rev_t *r)
446 {
447 dtext_t **d;
448 if(!n)
449 return NULL;
450 d = bsearch(r, dl, n, sizeof(*dl), search_dtext);
451 if(!d)
452 return NULL;
453 return *d;
454 }
455
456 static rev_t *dup_rev(const rev_t *r)
457 {
458 rev_t *t = xmalloc(sizeof(*t));
459 t->rev = xstrdup(r->rev);
460 t->branch = xstrdup(r->branch);
461 t->isbranch = r->isbranch;
462 return t;
463 }
464
465 static branch_t *new_branch(delta_t *d, dtext_t *t)
466 {
467 branch_t *b = xmalloc(sizeof(*b));
468 revision_t *r = xmalloc(sizeof(*r));
469 r->delta = d;
470 r->dtext = t;
471 r->rev = d->rev;
472 r->branch = b;
473 b->branch = dup_rev(d->rev);
474 b->branch->isbranch = 1;
475 b->nrevs = 1;
476 b->revs = xmalloc(sizeof(b->revs[0]));
477 b->revs[0] = r;
478 return b;
479 }
480
481 static revision_t *add_to_branch(branch_t *b, delta_t *d, dtext_t *t)
482 {
483 revision_t *r = xmalloc(sizeof(*r));
484 r->delta = d;
485 r->dtext = t;
486 r->rev = d->rev;
487 r->branch = b;
488 b->revs = xrealloc(b->revs, (b->nrevs+1) * sizeof(b->revs[0]));
489 b->revs[b->nrevs] = r;
490 b->nrevs++;
491 return r;
492 }
493
494 static int sort_branch_height(const void *b1, const void *b2)
495 {
496 return (*(branch_t **)b1)->nrevs - (*(branch_t **)b2)->nrevs;
497 }
498
499 static void build_branch(branch_t ***bl, int *nbl, delta_t **sdl, int nsdl, dtext_t **sdt, int nsdt, delta_t *head)
500 {
501 branch_t *b;
502 dtext_t *text;
503 revision_t *currev;
504
505 assert(head != NULL);
506
507 if(head->flag)
508 {
509 stack_msg(MSG_ERR, "Circular reference on '%s' in branchpoint\n", head->rev->rev);
510 return;
511 }
512 head->flag++;
513 text = find_dtext(sdt, nsdt, head->rev);
514
515 /* Create a new branch for this head */
516 b = new_branch(head, text);
517 *bl = xrealloc(*bl, (*nbl+1)*sizeof((*bl)[0]));
518 (*bl)[*nbl] = b;
519 (*nbl)++;
520 currev = b->revs[0];
521 while(1)
522 {
523 /* Process all sub-branches */
524 if(head->branches)
525 {
526 int i;
527 for(i = 0; i < head->branches->nrevs; i++)
528 {
529 delta_t *d = find_delta(sdl, nsdl, head->branches->revs[i]);
530 int btag = *nbl;
531 if(!d)
532 continue;
533 build_branch(bl, nbl, sdl, nsdl, sdt, nsdt, d);
534
535 /* Set the new branch's origin */
536 (*bl)[btag]->branchpoint = currev;
537
538 /* Add branch to this revision */
539 currev->branches = xrealloc(currev->branches, (currev->nbranches+1)*sizeof(currev->branches[0]));
540 currev->branches[currev->nbranches] = (*bl)[btag];
541 currev->nbranches++;
542 }
543 if(conf.branch_resort)
544 qsort(currev->branches, currev->nbranches, sizeof(currev->branches[0]), sort_branch_height);
545 }
546
547 /* Walk through the next list */
548 if(!head->next)
549 return;
550
551 head = find_delta(sdl, nsdl, head->next);
552 if(!head)
553 {
554 stack_msg(MSG_ERR, "Next revision (%s) not found in deltalist\n", head->next->rev);
555 return;
556 }
557 if(head->flag)
558 {
559 stack_msg(MSG_ERR, "Circular reference on '%s'\n", head->rev->rev);
560 return;
561 }
562 head->flag++;
563 text = find_dtext(sdt, nsdt, head->rev);
564 currev = add_to_branch(b, head, text);
565 }
566 }
567
568 int reorganise_branches(rcsfile_t *rcs)
569 {
570 delta_t **sdelta;
571 int nsdelta;
572 dtext_t **sdtext;
573 int nsdtext;
574 delta_t *head;
575 branch_t **bl;
576 int nbl;
577 int i;
578
579 assert(rcs->deltas != NULL);
580 assert(rcs->head != NULL);
581
582 /* Make a new list for quick lookup */
583 nsdelta = rcs->deltas->ndeltas;
584 sdelta = xmalloc(nsdelta * sizeof(sdelta[0]));
585 memcpy(sdelta, rcs->deltas->deltas, nsdelta * sizeof(sdelta[0]));
586 qsort(sdelta, nsdelta, sizeof(sdelta[0]), sort_delta);
587
588 /* Do the same for the delta text */
589 if(rcs->dtexts)
590 {
591 nsdtext = rcs->dtexts->ndtexts;
592 sdtext = xmalloc(nsdtext * sizeof(sdtext[0]));
593 memcpy(sdtext, rcs->dtexts->dtexts, nsdtext * sizeof(sdtext[0]));
594 qsort(sdtext, nsdtext, sizeof(sdtext[0]), sort_dtext);
595 }
596 else
597 {
598 nsdtext = 0;
599 sdtext = NULL;
600 }
601
602 /* Start from the head of the trunk */
603 head = find_delta(sdelta, nsdelta, rcs->head);
604 if(!head)
605 {
606 stack_msg(MSG_ERR, "Head revision (%s) not found in deltalist\n", rcs->head->rev);
607 return 0;
608 }
609 bl = NULL;
610 nbl = 0;
611 build_branch(&bl, &nbl, sdelta, nsdelta, sdtext, nsdtext, head);
612
613 /* Reverse the head branch */
614 for(i = 0; i < bl[0]->nrevs/2; i++)
615 {
616 revision_t *r;
617 r = bl[0]->revs[i];
618 bl[0]->revs[i] = bl[0]->revs[bl[0]->nrevs-i-1];
619 bl[0]->revs[bl[0]->nrevs-i-1] = r;
620 }
621
622 /* Update the branch-number of the head because it was reversed */
623 xfree(bl[0]->branch->branch);
624 bl[0]->branch->branch = xstrdup(bl[0]->revs[0]->rev->branch);
625
626 /* Keep the admin */
627 rcs->branches = bl;
628 rcs->nbranches = nbl;
629 rcs->sdelta = sdelta;
630 rcs->nsdelta = nsdelta;
631 rcs->sdtext = sdtext;
632 rcs->nsdtext = nsdtext;
633 rcs->active = bl[0];
634 return 1;
635 }
636
637 /*
638 **************************************************************************
639 * Assign the symbolic tags to the revisions and branches
640 *
641 * The tags point to revision numbers somewhere in the tree structure
642 * of branches and revisions. First we make a sorted list of all
643 * revisions and then we assign each tag to the proper revision.
644 **************************************************************************
645 */
646 static int sort_revision(const void *r1, const void *r2)
647 {
648 return compare_rev(0, (*(revision_t **)r1)->delta->rev, (*(revision_t **)r2)->delta->rev);
649 }
650
651 static int search_revision(const void *t, const void *r)
652 {
653 return compare_rev(0, (rev_t *)t, (*(revision_t **)r)->delta->rev);
654 }
655
656 static int sort_branch(const void *b1, const void *b2)
657 {
658 return compare_rev(1, (*(branch_t **)b1)->branch, (*(branch_t **)b2)->branch);
659 }
660
661 static int search_branch(const void *t, const void *b)
662 {
663 return compare_rev(1, (rev_t *)t, (*(branch_t **)b)->branch);
664 }
665
666 static char *previous_rev(const char *c)
667 {
668 int dots = count_dots(c);
669 char *cptr;
670 char *r;
671 if(!dots)
672 {
673 stack_msg(MSG_ERR, "FIXME: previous_rev(\"%s\"): Cannot determine parent branch revision\n", c);
674 return xstrdup("1.0"); /* FIXME: don't know what the parent is */
675 }
676 if(dots & 1)
677 {
678 /* Is is a revision we want the parent of */
679 r = xstrdup(c);
680 cptr = strrchr(r, '.');
681 assert(cptr != NULL);
682 if(dots == 1)
683 {
684 stack_msg(MSG_ERR, "FIXME: previous_rev(\"%s\"): Going beyond top-level?\n", c);
685 /* FIXME: What is the parent of 1.1? */
686 cptr[1] = '\0';
687 strcat(r, "0");
688 return r;
689 }
690 /* Here we have a "x.x[.x.x]+" case */
691 *cptr = '\0';
692 cptr = strrchr(r, '.');
693 assert(cptr != NULL);
694 *cptr = '\0';
695 return r;
696 }
697 /* It is a branch we want the parent of */
698 r = xstrdup(c);
699 cptr = strrchr(r, '.');
700 assert(cptr != NULL);
701 *cptr = '\0';
702 return r;
703 }
704
705 static char *build_regex(size_t n, regmatch_t *m, const char *ms, int idx)
706 {
707 char *cptr;
708 int i;
709
710 if(!conf.merge_to.strs[idx])
711 return NULL;
712
713 zap_string();
714 for(cptr = conf.merge_to.strs[idx]; *cptr; cptr++)
715 {
716 if(*cptr == '%')
717 {
718 if(cptr[1] >= '1' && cptr[1] <= '9')
719 {
720 int idx = cptr[1] - '0';
721 regmatch_t *p = &m[idx];
722 if(idx < n && !(p->rm_so == -1 || p->rm_so >= p->rm_eo))
723 {
724 for(i = p->rm_so; i < p->rm_eo; i++)
725 {
726 if(strchr("^$.*+\\[{()", ms[i]))
727 add_string_ch('\\');
728 add_string_ch(ms[i]);
729 }
730 }
731 cptr++;
732 }
733 else
734 add_string_ch('%');
735 }
736 else
737 add_string_ch(*cptr);
738 }
739 return dup_string();
740 }
741
742 static void find_merges_cvsnt(rcsfile_t *rcs)
743 {
744 int i;
745
746 if(!conf.merge_cvsnt)
747 return;
748
749 for(i = 0; i < rcs->nsrev; i++)
750 {
751 revision_t **r;
752
753 if(!rcs->srev[i]->delta->mergepoint)
754 continue;
755
756 r = bsearch(rcs->srev[i]->delta->mergepoint->rev, rcs->srev, rcs->nsrev, sizeof(rcs->srev[0]), search_revision);
757 if(!r)
758 continue;
759 rcs->merges = xrealloc(rcs->merges, sizeof(rcs->merges[0]) * (rcs->nmerges+1));
760 rcs->merges[rcs->nmerges].type = TR_REVISION;
761 rcs->merges[rcs->nmerges].from.rev = *r;
762 rcs->merges[rcs->nmerges].to.rev = rcs->srev[i];
763 rcs->merges[rcs->nmerges].clr = -1;
764 rcs->nmerges++;
765 (*r)->mergetarget = 1;
766 rcs->srev[i]->mergetarget = 1;
767 }
768 }
769
770 static void find_merges(rcsfile_t *rcs)
771 {
772 int i, j;
773 int err;
774 int rcflags = REG_EXTENDED | (conf.merge_nocase ? REG_ICASE : 0);
775 regex_t *refrom = NULL;
776 regex_t *reto = NULL;
777 regmatch_t *matchfrom = NULL;
778
779 if(!conf.merge_from.n || !conf.merge_to.n)
780 return;
781
782 for(j = 0; j < conf.merge_from.n; j++)
783 {
784 if(!conf.merge_from.strs[0] || !conf.merge_to.strs[0])
785 continue;
786
787 refrom = xmalloc(sizeof(*refrom));
788 reto = xmalloc(sizeof(*reto));
789
790 /* Compile the 'from' regex match for merge identification */
791 err = regcomp(refrom, conf.merge_from.strs[j], rcflags);
792 if(err)
793 {
794 char *msg;
795 i = regerror(err, refrom, NULL, 0);
796 msg = xmalloc(i+1);
797 regerror(err, refrom, msg, i+1);
798 stack_msg(MSG_WARN, "%s", msg);
799 xfree(msg);
800 xfree(refrom);
801 xfree(reto);
802 return;
803 }
804 else
805 matchfrom = xmalloc((refrom->re_nsub+1) * sizeof(*matchfrom));
806
807 for(i = 0; i < rcs->tags->ntags; i++)
808 {
809 tag_t *t = rcs->tags->tags[i];
810
811 /* Must be revision tags and not detached */
812 if(t->rev->isbranch || !t->logrev)
813 continue;
814
815 /* Try to find merge tag matches */
816 if(!regexec(refrom, t->tag, refrom->re_nsub+1, matchfrom, 0))
817 {
818 int n;
819 char *to;
820
821 to = build_regex(refrom->re_nsub+1, matchfrom, t->tag, j);
822 if(to)
823 {
824 err = regcomp(reto, to, rcflags);
825 if(err)
826 {
827 char *msg;
828 i = regerror(err, reto, NULL, 0);
829 msg = xmalloc(i+1);
830 regerror(err, reto, msg, i+1);
831 stack_msg(MSG_WARN, "%s", msg);
832 xfree(msg);
833 }
834 else if(!err)
835 {
836 for(n = 0; n < rcs->tags->ntags; n++)
837 {
838 tag_t *nt = rcs->tags->tags[n];
839 /* From and To never should match the same tag or belong to a branch */
840 if(n == i || nt->rev->isbranch || !nt->logrev)
841 continue;
842
843 if(!regexec(reto, nt->tag, 0, NULL, 0))
844 {
845 /* Tag matches */
846 rcs->merges = xrealloc(rcs->merges,
847 sizeof(rcs->merges[0]) * (rcs->nmerges+1));
848 rcs->merges[rcs->nmerges].type = TR_TAG;
849 rcs->merges[rcs->nmerges].to.tag = nt;
850 rcs->merges[rcs->nmerges].from.tag = t;
851 rcs->merges[rcs->nmerges].clr = j;
852 rcs->nmerges++;
853 if(!conf.tag_ignore_merge)
854 {
855 nt->ignore = 0;
856 t->ignore = 0;
857 }
858 /* We cannot (should not) match multiple times */
859 if(!conf.merge_findall)
860 break;
861 }
862 }
863 regfree(reto);
864 }
865 xfree(to);
866 }
867 }
868 }
869 if(matchfrom) xfree(matchfrom);
870 if(refrom) { regfree(refrom); xfree(refrom); }
871 if(reto) xfree(reto);
872 refrom = NULL;
873 reto = NULL;
874 matchfrom = NULL;
875 }
876 }
877
878 static void assign_tags(rcsfile_t *rcs)
879 {
880 int i;
881 int nr;
882 regex_t *regextag = NULL;
883
884 if(conf.tag_ignore && conf.tag_ignore[0])
885 {
886 int err;
887 regextag = xmalloc(sizeof(*regextag));
888 err = regcomp(regextag, conf.tag_ignore, REG_EXTENDED | REG_NOSUB | (conf.tag_nocase ? REG_ICASE : 0));
889 if(err)
890 {
891 char *msg;
892 i = regerror(err, regextag, NULL, 0);
893 msg = xmalloc(i+1);
894 regerror(err, regextag, msg, i+1);
895 stack_msg(MSG_WARN, "%s", msg);
896 xfree(msg);
897 xfree(regextag);
898 regextag = NULL;
899 }
900 }
901
902 for(i = nr = 0; i < rcs->nbranches; i++)
903 nr += rcs->branches[i]->nrevs;
904
905 rcs->srev = xmalloc(nr * sizeof(rcs->srev[0]));
906 rcs->nsrev = nr;
907 for(i = nr = 0; i < rcs->nbranches; i++)
908 {
909 memcpy(&rcs->srev[nr], rcs->branches[i]->revs, rcs->branches[i]->nrevs * sizeof(rcs->branches[i]->revs[0]));
910 nr += rcs->branches[i]->nrevs;
911 }
912
913 qsort(rcs->srev, rcs->nsrev, sizeof(rcs->srev[0]), sort_revision);
914 qsort(rcs->branches, rcs->nbranches, sizeof(rcs->branches[0]), sort_branch);
915
916 if(!rcs->branch)
917 {
918 /* The main trunk is the active trunk */
919 rcs->tags->tags = xrealloc(rcs->tags->tags, (rcs->tags->ntags+1)*sizeof(rcs->tags->tags[0]));
920 rcs->tags->tags[rcs->tags->ntags] = xmalloc(sizeof(tag_t));
921 rcs->tags->tags[rcs->tags->ntags]->tag = xstrdup("MAIN");
922 rcs->tags->tags[rcs->tags->ntags]->rev = xmalloc(sizeof(rev_t));
923 rcs->tags->tags[rcs->tags->ntags]->rev->rev = xstrdup(rcs->active->branch->rev);
924 rcs->tags->tags[rcs->tags->ntags]->rev->branch = xstrdup(rcs->active->branch->branch);
925 rcs->tags->tags[rcs->tags->ntags]->rev->isbranch = 1;
926 rcs->tags->ntags++;
927 }
928
929 /* We should have at least two tags (HEAD and MAIN) */
930 assert(rcs->tags != NULL);
931
932 for(i = 0; i < rcs->tags->ntags; i++)
933 {
934 tag_t *t = rcs->tags->tags[i];
935 if(t->rev->isbranch)
936 {
937 branch_t **b;
938 add_btag:
939 b = bsearch(t->rev, rcs->branches, rcs->nbranches, sizeof(rcs->branches[0]), search_branch);
940 if(!b)
941 {
942 rev_t rev;
943 revision_t **r;
944 /* This happens for the magic branch numbers if there are
945 * no commits within the new branch yet. So, we add the
946 * branch and try to continue.
947 */
948 rev.rev = previous_rev(t->rev->branch);
949 rev.branch = NULL;
950 rev.isbranch = 0;
951 r = bsearch(&rev, rcs->srev, rcs->nsrev, sizeof(rcs->srev[0]), search_revision);
952 xfree(rev.rev);
953 if(!r)
954 {
955 stack_msg(MSG_WARN, "No branch found for tag '%s:%s'", t->tag, t->rev->branch);
956 }
957 else
958 {
959 rcs->branches = xrealloc(rcs->branches, (rcs->nbranches+1)*sizeof(rcs->branches[0]));
960 rcs->branches[rcs->nbranches] = xmalloc(sizeof(branch_t));
961 rcs->branches[rcs->nbranches]->branch = dup_rev(t->rev);
962 rcs->branches[rcs->nbranches]->branchpoint = *r;
963 (*r)->branches = xrealloc((*r)->branches, ((*r)->nbranches+1)*sizeof((*r)->branches[0]));
964 (*r)->branches[(*r)->nbranches] = rcs->branches[rcs->nbranches];
965 (*r)->nbranches++;
966 rcs->nbranches++;
967 /* Resort the branches */
968 qsort(rcs->branches, rcs->nbranches, sizeof(rcs->branches[0]), sort_branch);
969 goto add_btag;
970 }
971 }
972 else
973 {
974 branch_t *bb = *b;
975 bb->tags = xrealloc(bb->tags, (bb->ntags+1)*sizeof(bb->tags[0]));
976 bb->tags[bb->ntags] = t;
977 bb->ntags++;
978 }
979 }
980 else
981 {
982 revision_t **r = bsearch(t->rev, rcs->srev, rcs->nsrev, sizeof(rcs->srev[0]), search_revision);
983 if(!r)
984 {
985 stack_msg(MSG_WARN, "No revision found for tag '%s:%s'\n", t->tag, t->rev->rev);
986 }
987 else
988 {
989 revision_t *rr = *r;
990 t->logrev = rr;
991 if(!conf.rev_maxtags || rr->ntags <= conf.rev_maxtags)
992 {
993 rr->tags = xrealloc(rr->tags, (rr->ntags+1)*sizeof(rr->tags[0]));
994 if(conf.rev_maxtags && rr->ntags == conf.rev_maxtags)
995 {
996 rr->tags[rr->ntags] = xmalloc(sizeof(tag_t));
997 rr->tags[rr->ntags]->tag = xstrdup("...");
998 rr->tags[rr->ntags]->rev = t->rev;
999 }
1000 else
1001 rr->tags[rr->ntags] = t;
1002 rr->ntags++;
1003 }
1004 }
1005
1006 if(conf.tag_negate)
1007 t->ignore++;
1008 /* Mark the tag ignored if it matches the configuration */
1009 if(regextag && !regexec(regextag, t->tag, 0, NULL, 0))
1010 {
1011 if(conf.tag_negate)
1012 t->ignore--;
1013 else
1014 t->ignore++;
1015 }
1016 }
1017 }
1018
1019 /* We need to reset the first in the list of branches to the
1020 * active branch to ensure the drawing of all
1021 */
1022 if(rcs->active != rcs->branches[0])
1023 {
1024 branch_t **b = bsearch(rcs->active->branch, rcs->branches, rcs->nbranches, sizeof(rcs->branches[0]), search_branch);
1025 branch_t *t;
1026 assert(b != NULL);
1027 t = *b;
1028 *b = rcs->branches[0];
1029 rcs->branches[0] = t;
1030 }
1031
1032 if(regextag)
1033 {
1034 regfree(regextag);
1035 xfree(regextag);
1036 }
1037 }
1038
1039 /*
1040 **************************************************************************
1041 * String expansion
1042 **************************************************************************
1043 */
1044 static char *_string;
1045 static int _nstring;
1046 static int _nastring;
1047
1048 static void zap_string(void)
1049 {
1050 _nstring = 0;
1051 if(_string)
1052 _string[0] = '\0';
1053 }
1054
1055 static char *dup_string(void)
1056 {
1057 if(_string)
1058 return xstrdup(_string);
1059 else
1060 return "";
1061 }
1062
1063 static void add_string_str(const char *s)
1064 {
1065 int l = strlen(s) + 1;
1066 if(_nstring + l > _nastring)
1067 {
1068 _nastring += MAX(128, l);
1069 _string = xrealloc(_string, _nastring * sizeof(_string[0]));
1070 }
1071 memcpy(_string+_nstring, s, l);
1072 _nstring += l-1;
1073 }
1074
1075 static void add_string_ch(int ch)
1076 {
1077 char buf[2];
1078 buf[0] = ch;
1079 buf[1] = '\0';
1080 add_string_str(buf);
1081 }
1082
1083 static void add_string_date(const char *d)
1084 {
1085 struct tm tm, *tmp;
1086 int n;
1087 time_t t;
1088 char *buf;
1089 int nbuf;
1090 char *env;
1091
1092 memset(&tm, 0, sizeof(tm));
1093 n = sscanf(d, "%d.%d.%d.%d.%d.%d",
1094 &tm.tm_year, &tm.tm_mon, &tm.tm_mday,
1095 &tm.tm_hour, &tm.tm_min, &tm.tm_sec);
1096 tm.tm_mon--;
1097 if(tm.tm_year > 1900)
1098 tm.tm_year -= 1900;
1099
1100 env = getenv("TZ");
1101 putenv("TZ=UTC0");
1102 t = mktime(&tm);
1103 if(env)
1104 {
1105 char *c = xmalloc(strlen(env) + 3 + 1); /* Extra space for TZ and = */
1106 sprintf(c, "TZ=%s", env);
1107 putenv(c);
1108 xfree(c);
1109 }
1110 else
1111 putenv("TZ");
1112
1113 if(n != 6 || t == (time_t)(-1))
1114 {
1115 add_string_str("<invalid date>");
1116 return;
1117 }
1118
1119 tmp = localtime(&t);
1120 nbuf = (strlen(conf.date_format)+1) * 16; /* Should be enough to hold all types of expansions */
1121 buf = xmalloc(nbuf);
1122 strftime(buf, nbuf, conf.date_format, tmp);
1123 add_string_str(buf);
1124 xfree(buf);
1125 }
1126
1127 static void add_string_str_html(const char *s, int maxlen)
1128 {
1129 int l = 0;
1130 char *str = xmalloc(6 * strlen(s) + 1); /* Should hold all char entity-expand */
1131 char *cptr = str;
1132 for(; *s; s++)
1133 {
1134 if(maxlen && l > abs(maxlen))
1135 {
1136 cptr += sprintf(cptr, "...");
1137 break;
1138 }
1139 if(*s < 0x20)
1140 {
1141 if(*s == '\n')
1142 {
1143 if(maxlen < 0)
1144 *cptr++ = ' ';
1145 else
1146 cptr += sprintf(cptr, "<br%s>", conf.html_level == HTMLLEVEL_X ? " /" : "");
1147 }
1148 }
1149 else if(*s >= 0x7f || *s == '"')
1150 cptr += sprintf(cptr, "&#%d;", (int)(unsigned char)*s);
1151 else if(*s == '<')
1152 cptr += sprintf(cptr, "&lt;");
1153 else if(*s == '>')
1154 cptr += sprintf(cptr, "&gt;");
1155 else if(*s == '&')
1156 cptr += sprintf(cptr, "&amp;");
1157 else if(*s == '"')
1158 cptr += sprintf(cptr, "&quot;");
1159 else
1160 *cptr++ = *s;
1161 l++;
1162 }
1163 *cptr = '\0';
1164 add_string_str(str);
1165 xfree(str);
1166 }
1167
1168 static void add_string_str_len(const char *s, int maxlen)
1169 {
1170 int l = strlen(s);
1171 char *str = xmalloc(l + 1 + 3);
1172 strcpy(str, s);
1173 if(maxlen < l)
1174 sprintf(&str[maxlen], "...");
1175 add_string_str(str);
1176 xfree(str);
1177 }
1178
1179 static char *expand_string(const char *s, rcsfile_t *rcs, revision_t *r, rev_t *rev, rev_t *prev, tag_t *tag)
1180 {
1181 char nb[32];
1182 char nr[32];
1183 char *base;
1184 char *exp;
1185 int l;
1186 char ch;
1187
1188 if(!s)
1189 return xstrdup("");
1190
1191 zap_string();
1192
1193 sprintf(nb, "%d", rcs->nbranches + rcs->nfolds);
1194 sprintf(nr, "%d", rcs->nsrev);
1195 for(; *s; s++)
1196 {
1197 if(*s == '%')
1198 {
1199 switch(*++s)
1200 {
1201 case 'c':
1202 case 'C':
1203 add_string_str(conf.cvsroot);
1204 if(*s == 'C' && conf.cvsroot[0] && conf.cvsroot[strlen(conf.cvsroot)-1] == '/')
1205 {
1206 /* Strip the trailing '/' */
1207 _nstring--;
1208 _string[_nstring] = '\0';
1209 }
1210 break;
1211 case 'f':
1212 case 'F':
1213 base = strrchr(rcs->file, '/');
1214 if(!base)
1215 add_string_str(rcs->file);
1216 else
1217 add_string_str(base+1);
1218 if(*s == 'F' && _string[_nstring-1] == 'v' && _string[_nstring-2] == ',')
1219 {
1220 _nstring -= 2;
1221 _string[_nstring] = '\0';
1222 }
1223 break;
1224 case 'p':
1225 base = strrchr(rcs->file, '/');
1226 if(base)
1227 {
1228 char *c = xstrdup(rcs->file);
1229 base = strrchr(c, '/');
1230 assert(base != NULL);
1231 base[1] = '\0';
1232 add_string_str(c);
1233 xfree(c);
1234 }
1235 /*
1236 * We should not add anything here because we can encounter
1237 * a completely empty path, in which case we do not want
1238 * to add any slash. This prevents an inadvertent root redirect.
1239 *
1240 * else
1241 * add_string_str("/");
1242 */
1243 break;
1244 case 'm':
1245 case 'M':
1246 add_string_str(conf.cvsmodule);
1247 if(*s == 'M' && conf.cvsmodule[0] && conf.cvsmodule[strlen(conf.cvsmodule)-1] == '/')
1248 {
1249 /* Strip the trailing '/' */
1250 _nstring--;
1251 _string[_nstring] = '\0';
1252 }
1253 break;
1254 case 'r': add_string_str(nr); break;
1255 case 'b': add_string_str(nb); break;
1256 case '%': add_string_ch('%'); break;
1257 case '0': if(conf.expand[0]) add_string_str(conf.expand[0]); break;
1258 case '1': if(conf.expand[1]) add_string_str(conf.expand[1]); break;
1259 case '2': if(conf.expand[2]) add_string_str(conf.expand[2]); break;
1260 case '3': if(conf.expand[3]) add_string_str(conf.expand[3]); break;
1261 case '4': if(conf.expand[4]) add_string_str(conf.expand[4]); break;
1262 case '5': if(conf.expand[5]) add_string_str(conf.expand[5]); break;
1263 case '6': if(conf.expand[6]) add_string_str(conf.expand[6]); break;
1264 case '7': if(conf.expand[7]) add_string_str(conf.expand[7]); break;
1265 case '8': if(conf.expand[8]) add_string_str(conf.expand[8]); break;
1266 case '9': if(conf.expand[9]) add_string_str(conf.expand[9]); break;
1267 case 'R': if(rev && rev->rev) add_string_str(rev->rev); break;
1268 case 'P': if(prev && prev->rev) add_string_str(prev->rev); break;
1269 case 'B': if(rev && rev->branch) add_string_str(rev->branch); break;
1270 case 't': if(tag && tag->tag) add_string_str(tag->tag); break;
1271 case 'd': if(r && r->delta && r->delta->date) add_string_date(r->delta->date); break;
1272 case 's': if(r && r->delta && r->delta->state) add_string_str(r->delta->state); break;
1273 case 'a': if(r && r->delta && r->delta->author) add_string_str(r->delta->author); break;
1274 case 'L':
1275 case 'l':
1276 ch = *s;
1277 l = 0;
1278 if(s[1] == '[')
1279 {
1280 char *cptr = strchr(s, ']');
1281 char *eptr;
1282 if(cptr)
1283 {
1284 l = strtol(&s[2], &eptr, 10);
1285 if(eptr != cptr)
1286 l = 0;
1287 else
1288 s = cptr;
1289 }
1290 }
1291 if(!conf.parse_logs)
1292 add_string_str("N/A");
1293 else if(r && r->dtext && r->dtext->log)
1294 {
1295 if(ch == 'l')
1296 add_string_str_html(r->dtext->log, l);
1297 else
1298 add_string_str_len(r->dtext->log, abs(l));
1299 }
1300 break;
1301 case '(':
1302 base = dup_string();
1303 exp = expand_string(s+1, rcs, r, rev, prev, tag);
1304 zap_string();
1305 add_string_str(base);
1306 add_string_str_html(exp, 0);
1307 xfree(base);
1308 xfree(exp);
1309 /* Find the %) in this recursion level */
1310 for(; *s; s++)
1311 {
1312 if(*s == '%' && s[1] == ')')
1313 {
1314 s++;
1315 break;
1316 }
1317 }
1318 if(!*s)
1319 {
1320 s--; /* To end outer loop */
1321 stack_msg(MSG_WARN, "string expand: Missing %%) in expansion");
1322 }
1323 break;
1324 case ')':
1325 return dup_string();
1326 default:
1327 add_string_ch('%');
1328 add_string_ch(*s);
1329 break;
1330 }
1331 }
1332 else
1333 add_string_ch(*s);
1334 }
1335 return dup_string();
1336 }
1337
1338 /*
1339 **************************************************************************
1340 * Drawing routines
1341 **************************************************************************
1342 */
1343 static color_t *clr_id = NULL;
1344 static int nclr_id = 0;
1345
1346 static int rexpr_eval(const char *key, const char *content, int flags)
1347 {
1348 int res;
1349 regex_t re;
1350 if(regcomp(&re, content, flags | REG_EXTENDED | REG_NOSUB))
1351 return 0;
1352 res = regexec(&re, key, 0, NULL, 0);
1353 regfree(&re);
1354 return res == 0;
1355 }
1356
1357 static int expr_eval(const char *key, int op, const char *content)
1358 {
1359 switch(op)
1360 {
1361 case OP_CONTAINED: return rexpr_eval(key, content, 0);
1362 case OP_CONTAINEDI: return rexpr_eval(key, content, REG_ICASE);
1363 case OP_NCONTAINED: return !rexpr_eval(key, content, 0);
1364 case OP_NCONTAINEDI: return !rexpr_eval(key, content, REG_ICASE);
1365 case OP_EQ: return strcmp(key, content) == 0;
1366 case OP_NE: return strcmp(key, content) != 0;
1367 case OP_GE: return strcmp(key, content) >= 0;
1368 case OP_GT: return strcmp(key, content) > 0;
1369 case OP_LE: return strcmp(key, content) <= 0;
1370 case OP_LT: return strcmp(key, content) < 0;
1371 }
1372 return 0;
1373 }
1374
1375 static char *eval_string(node_t *node, revision_t *r)
1376 {
1377 int i;
1378 assert(node != NULL);
1379 switch(node->key)
1380 {
1381 default:
1382 case TYPE_COLOR:
1383 return ""; /* This should not happen */
1384 case TYPE_STRING:
1385 return node->value.str;
1386 case KEY_STATE:
1387 if(r && expr_eval(r->delta->state, node->op, node->content))
1388 return eval_string(node->tcase, r);
1389 else
1390 return eval_string(node->fcase, r);
1391 case KEY_AUTHOR:
1392 if(r && expr_eval(r->delta->author, node->op, node->content))
1393 return eval_string(node->tcase, r);
1394 else
1395 return eval_string(node->fcase, r);
1396 case KEY_TAG:
1397 for(i = 0; r && i < r->ntags; i++)
1398 {
1399 if(expr_eval(r->tags[i]->tag, node->op, node->content))
1400 return eval_string(node->tcase, r);
1401 }
1402 return eval_string(node->fcase, r);
1403 case KEY_DATE:
1404 if(r && expr_eval(r->delta->date, node->op, node->content))
1405 return eval_string(node->tcase, r);
1406 else
1407 return eval_string(node->fcase, r);
1408 case KEY_REV:
1409 if(r && expr_eval(r->rev->rev, node->op, node->content))
1410 return eval_string(node->tcase, r);
1411 else
1412 return eval_string(node->fcase, r);
1413 }
1414 return "";
1415 }
1416 static color_t *eval_color(node_t *node, revision_t *r, branch_t *b)
1417 {
1418 int i;
1419 assert(node != NULL);
1420 switch(node->key)
1421 {
1422 default:
1423 case TYPE_STRING:
1424 return &black_color; /* This should not happen */
1425 case TYPE_COLOR:
1426 return &node->value.clr;
1427 case KEY_STATE:
1428 if(r && expr_eval(r->delta->state, node->op, node->content))
1429 return eval_color(node->tcase, r, b);
1430 else
1431 return eval_color(node->fcase, r, b);
1432 case KEY_AUTHOR:
1433 if(r && expr_eval(r->delta->author, node->op, node->content))
1434 return eval_color(node->tcase, r, b);
1435 else
1436 return eval_color(node->fcase, r, b);
1437 case KEY_TAG:
1438 for(i = 0; r && i < r->ntags; i++)
1439 {
1440 if(expr_eval(r->tags[i]->tag, node->op, node->content))
1441 return eval_color(node->tcase, r, b);
1442 }
1443 return eval_color(node->fcase, r, b);
1444 case KEY_DATE:
1445 if(r && expr_eval(r->delta->date, node->op, node->content))
1446 return eval_color(node->tcase, r, b);
1447 else
1448 return eval_color(node->fcase, r, b);
1449 case KEY_REV:
1450 if(r && expr_eval(r->rev->rev, node->op, node->content))
1451 return eval_color(node->tcase, r, b);
1452 if(b && expr_eval(b->branch->branch, node->op, node->content))
1453 return eval_color(node->tcase, r, b);
1454 return eval_color(node->fcase, r, b);
1455 }
1456 return &black_color;
1457 }
1458
1459 static color_t *clr(gdImagePtr im, const char *s, revision_t *r, branch_t *b, int idx)
1460 {
1461 int i;
1462 color_t *c = get_colorref(s, idx);
1463 if(!c)
1464 c = &black_color;
1465 if(c->node)
1466 c = eval_color(c->node, r, b);
1467 for(i = 0; i < nclr_id; i++)
1468 {
1469 if(c->r == clr_id[i].r && c->g == clr_id[i].g && c->b == clr_id[i].b)
1470 return &clr_id[i];
1471 }
1472 clr_id = xrealloc(clr_id, (nclr_id+1) * sizeof(*clr_id));
1473 clr_id[nclr_id] = *c;
1474 clr_id[nclr_id].id = gdImageColorAllocate(im, c->r, c->g, c->b);
1475 return &clr_id[nclr_id++];
1476 }
1477
1478 static void zap_clr(void)
1479 {
1480 if(clr_id)
1481 xfree(clr_id);
1482 clr_id = NULL;
1483 nclr_id = 0;
1484 }
1485
1486 static int get_swidth(const char *s, font_t *f)
1487 {
1488 int n;
1489 int m;
1490 if(!s || !*s)
1491 return 0;
1492
1493 #if defined(HAVE_GDIMAGESTRINGFT) || defined(HAVE_GDIMAGESTRINGTTF)
1494 if(conf.use_ttf && f->ttfont)
1495 {
1496 int bb[8];
1497 char *e;
1498 #ifdef HAVE_GDIMAGESTRINGFT
1499 e = gdImageStringFT(NULL, bb, 0, f->ttfont, f->ttsize, 0.0, 0, 0, (char *)s);
1500 #else
1501 e = gdImageStringTTF(NULL, bb, 0, f->ttfont, f->ttsize, 0.0, 0, 0, (char *)s);
1502 #endif
1503 if(!e)
1504 return bb[2] - bb[6];
1505 }
1506 #endif
1507 for(n = m = 0; *s; n++, s++)
1508 {
1509 if(*s == '\n')
1510 {
1511 if(n > m)
1512 m = n;
1513 n = 0;
1514 }
1515 }
1516 if(n > m)
1517 m = n;
1518 return f->gdfont ? m * f->gdfont->w : m;
1519 }
1520
1521 static int get_sheight(const char *s, font_t *f)
1522 {
1523 int nl;
1524 if(!s || !*s)
1525 return 0;
1526
1527 #if defined(HAVE_GDIMAGESTRINGFT) || defined(HAVE_GDIMAGESTRINGTTF)
1528 if(conf.use_ttf && f->ttfont)
1529 {
1530 int bb[8];
1531 char *e;
1532 #ifdef HAVE_GDIMAGESTRINGFT
1533 e = gdImageStringFT(NULL, bb, 0, f->ttfont, f->ttsize, 0.0, 0, 0, (char *)s);
1534 #else
1535 e = gdImageStringTTF(NULL, bb, 0, f->ttfont, f->ttsize, 0.0, 0, 0, (char *)s);
1536 #endif
1537 if(!e)
1538 return bb[3] - bb[7] + 4;
1539 }
1540 #endif
1541 for(nl = 1; *s; s++)
1542 {
1543 if(*s == '\n' && s[1])
1544 nl++;
1545 }
1546 return nl * f->gdfont->h;
1547 }
1548
1549 static void draw_rbox(gdImagePtr im, int x1, int y1, int x2, int y2, int r, color_t *color, color_t *bgcolor)
1550 {
1551 int r2 = 2*r;
1552 if(!r)
1553 gdImageFilledRectangle(im, x1, y1, x2, y2, bgcolor->id);
1554 #ifdef HAVE_GDIMAGEFILLEDARC
1555 else
1556 {
1557 gdImageFilledArc(im, x1+r, y1+r, r2, r2, 180, 270, bgcolor->id, gdArc);
1558 gdImageFilledArc(im, x2-r, y1+r, r2, r2, 270, 360, bgcolor->id, gdArc);
1559 gdImageFilledArc(im, x1+r, y2-r, r2, r2, 90, 180, bgcolor->id, gdArc);
1560 gdImageFilledArc(im, x2-r, y2-r, r2, r2, 0, 90, bgcolor->id, gdArc);
1561 gdImageFilledRectangle(im, x1+r, y1, x2-r, y1+r, bgcolor->id);
1562 gdImageFilledRectangle(im, x1, y1+r, x2, y2-r, bgcolor->id);
1563 gdImageFilledRectangle(im, x1+r, y2-r, x2-r, y2, bgcolor->id);
1564 }
1565 #endif
1566 gdImageLine(im, x1+r, y1, x2-r, y1, color->id);
1567 gdImageLine(im, x1+r, y2, x2-r, y2, color->id);
1568 gdImageLine(im, x1, y1+r, x1, y2-r, color->id);
1569 gdImageLine(im, x2, y1+r, x2, y2-r, color->id);
1570 if(conf.box_shadow)
1571 {
1572 gdImageLine(im, x1+r+1, y2+1, x2-r, y2+1, clr(im, NULL, NULL, NULL, 0)->id);
1573 gdImageLine(im, x2+1, y1+r+1, x2+1, y2-r, clr(im, NULL, NULL, NULL, 0)->id);
1574 }
1575 if(r)
1576 {
1577 /* FIXME: Pixelization is not perfect */
1578 gdImageArc(im, x1+r, y1+r, r2, r2, 180, 270, color->id);
1579 gdImageArc(im, x2-r, y1+r, r2, r2, 270, 360, color->id);
1580 gdImageArc(im, x1+r, y2-r, r2, r2, 90, 180, color->id);
1581 if(conf.box_shadow)
1582 {
1583 gdImageArc(im, x2-r+1, y2-r+1, r2, r2, 0, 90, clr(im, NULL, NULL, NULL, 0)->id);
1584 gdImageArc(im, x2-r+1, y2-r, r2, r2, 0, 90, clr(im, NULL, NULL, NULL, 0)->id);
1585 gdImageArc(im, x2-r, y2-r+1, r2, r2, 0, 90, clr(im, NULL, NULL, NULL, 0)->id);
1586 }
1587 gdImageArc(im, x2-r, y2-r, r2, r2, 0, 90, color->id);
1588 #if !defined(NOGDFILL) && !defined(HAVE_GDIMAGEFILLEDARC)
1589 /* BUG: We clip manually because libgd segfaults on out of bound values */
1590 if((x1+x2)/2 >= 0 && (x1+x2)/2 < gdImageSX(im) && (y1+y2)/2 >= 0 && (y1+y2)/2 < gdImageSY(im))
1591 gdImageFillToBorder(im, (x1+x2)/2, (y1+y2)/2, color->id, bgcolor->id);
1592 #endif
1593 }
1594 }
1595
1596 static void draw_string(gdImagePtr im, char *s, font_t *f, int x, int y, int align, color_t *c)
1597 {
1598 int h = get_sheight(s, f);
1599 int xx, yy;
1600 switch(align & ALIGN_HX)
1601 {
1602 default:
1603 case ALIGN_HL: xx = 0; break;
1604 case ALIGN_HC: xx = -get_swidth(s, f)/2; break;
1605 case ALIGN_HR: xx = -get_swidth(s, f); break;
1606 }
1607 switch(align & ALIGN_VX)
1608 {
1609 default:
1610 case ALIGN_VT: yy = 0; break;
1611 case ALIGN_VC: yy = h/2; break;
1612 case ALIGN_VB: yy = h; break;
1613 }
1614 #if defined(HAVE_GDIMAGESTRINGFT) || defined(HAVE_GDIMAGESTRINGTTF)
1615 if(conf.use_ttf && f->ttfont)
1616 {
1617 int bb[8];
1618 char *e;
1619 int cid = conf.anti_alias ? c->id : -c->id;
1620 #ifdef HAVE_GDIMAGESTRINGFT
1621 e = gdImageStringFT(im, bb, cid, f->ttfont, f->ttsize, 0.0, x+xx, y+yy+h-2, (char *)s);
1622 #else
1623 e = gdImageStringTTF(im, bb, cid, f->ttfont, f->ttsize, 0.0, x+xx, y+yy+h-2, (char *)s);
1624 #endif
1625 if(!e)
1626 return;
1627 }
1628 #endif
1629 yy = -yy;
1630 gdImageString(im, f->gdfont, x+xx+1, y+yy, (unsigned char *)s, c->id);
1631 }
1632
1633 static void draw_stringnl(gdImagePtr im, char *s, font_t *f, int x, int y, int align, color_t *c)
1634 {
1635 char *t;
1636 char *d;
1637 d = s = xstrdup(s);
1638 do
1639 {
1640 t = strchr(s, '\n');
1641 if(t)
1642 *t = '\0';
1643 draw_string(im, s, f, x, y, align, c);
1644 y += get_sheight(s, f);
1645 s = t+1;
1646 } while(t);
1647 xfree(d);
1648 }
1649
1650 static void draw_rev(gdImagePtr im, revision_t *r)
1651 {
1652 int lx;
1653 int rx;
1654 int x2;
1655 int i;
1656 int ty;
1657
1658 if(conf.left_right)
1659 {
1660 lx = r->cx;
1661 rx = r->cx + r->w;
1662 ty = r->y - r->h/2;
1663 x2 = r->cx + r->w/2;
1664 }
1665 else
1666 {
1667 lx = r->cx - r->w/2;
1668 rx = lx + r->w;
1669 ty = r->y;
1670 x2 = r->cx;
1671 }
1672 draw_rbox(im, lx, ty, rx, ty+r->h, 0, clr(im, "rev_color", r, NULL, 0), clr(im, "rev_bgcolor", r, NULL, 0));
1673 ty += conf.rev_tspace;
1674 if(!conf.rev_hidenumber)
1675 {
1676 draw_string(im, r->revidtext, &conf.rev_font, x2, ty, ALIGN_HC, clr(im, "rev_color", r, NULL, 0));
1677 ty += get_sheight(r->revidtext, &conf.rev_font);
1678 }
1679 draw_stringnl(im, r->revtext, &conf.rev_text_font, x2, ty, ALIGN_HC, clr(im, "rev_text_color", r, NULL, 0));
1680 ty += get_sheight(r->revtext, &conf.rev_text_font);
1681 for(i = 0; i < r->ntags; i++)
1682 {
1683 draw_string(im, r->tags[i]->tag, &conf.tag_font, x2, ty, ALIGN_HC, clr(im, "tag_color", r, NULL, 0));
1684 ty += get_sheight(r->tags[i]->tag, &conf.tag_font) + conf.rev_separator;
1685 }
1686 }
1687
1688 static void draw_branch_box(gdImagePtr im, branch_t *b, int xp, int yp)
1689 {
1690 int lx;
1691 int rx;
1692 int i;
1693 int yy;
1694 int x2;
1695
1696 if(conf.left_right)
1697 {
1698 lx = b->cx;
1699 rx = lx + b->w;
1700 x2 = b->cx + b->w/2;
1701 }
1702 else
1703 {
1704 lx = b->cx - b->w/2;
1705 rx = lx + b->w;
1706 x2 = b->cx;
1707 }
1708 draw_rbox(im, lx+xp, yp, rx+xp, yp+b->h, 5, clr(im, "branch_color", NULL, b, 0), clr(im, "branch_bgcolor", NULL, b, 0));
1709 yy = conf.branch_tspace;
1710 if(!b->nfolds)
1711 {
1712 if(!conf.rev_hidenumber)
1713 {
1714 draw_string(im, b->branch->branch, &conf.branch_font, x2+xp, yp+yy, ALIGN_HC, clr(im, "branch_color", NULL, b, 0));
1715 yy += get_sheight(b->branch->branch, &conf.branch_font);
1716 }
1717 for(i = 0; i < b->ntags; i++)
1718 {
1719 draw_string(im, b->tags[i]->tag, &conf.branch_tag_font, x2+xp, yp+yy, ALIGN_HC, clr(im, "branch_tag_color", NULL, b, 0));
1720 yy += get_sheight(b->tags[i]->tag, &conf.branch_tag_font);
1721 }
1722 }
1723 else
1724 {
1725 int y1, y2;
1726 int tx = lx + b->fw + conf.branch_lspace;
1727 int nx = tx - get_swidth(" ", &conf.branch_font);
1728 draw_string(im, b->branch->branch, &conf.branch_font, nx+xp, yp+yy, ALIGN_HR, clr(im, "branch_color", NULL, b, 0));
1729 y1 = get_sheight(b->branch->branch, &conf.branch_font);
1730 draw_string(im, b->tags[0]->tag, &conf.branch_tag_font, tx+xp, yp+yy, ALIGN_HL, clr(im, "branch_tag_color", NULL, b, 0));
1731 y2 = get_sheight(b->tags[0]->tag, &conf.branch_font);
1732 yy += MAX(y1, y2);
1733 for(i = 0; i < b->nfolds; i++)
1734 {
1735 draw_string(im, b->folds[i]->branch->branch, &conf.branch_font, nx+xp, yp+yy, ALIGN_HR, clr(im, "branch_color", NULL, b, 0));
1736 y1 = get_sheight(b->folds[i]->branch->branch, &conf.branch_font);
1737 draw_string(im, b->folds[i]->tags[0]->tag, &conf.branch_tag_font, tx+xp, yp+yy, ALIGN_HL, clr(im, "branch_tag_color", NULL, b, 0));
1738 y2 = get_sheight(b->folds[i]->tags[0]->tag, &conf.branch_tag_font);
1739 yy += MAX(y1, y2);
1740 }
1741 }
1742 }
1743
1744 static void draw_branch(gdImagePtr im, branch_t *b)
1745 {
1746 int yy, xx;
1747 int i;
1748 int line[4];
1749 int l;
1750 int sign;
1751
1752 line[1] = line[2] = gdTransparent;
1753
1754 /* Trivial clip the branch */
1755 if(conf.left_right)
1756 {
1757 if(b->cx > gdImageSX(im) || b->cx+b->tw < 0 || b->y-b->th/2 > gdImageSY(im) || b->y+b->th/2 < 0)
1758 return;
1759 }
1760 else
1761 {
1762 if(b->cx-b->tw/2 > gdImageSX(im) || b->cx+b->tw/2 < 0 || b->y > gdImageSY(im) || b->y+b->th < 0)
1763 return;
1764 }
1765
1766 draw_branch_box(im, b, 0, conf.left_right ? b->y - b->h/2 : b->y);
1767
1768 if(conf.left_right)
1769 {
1770 if(conf.upside_down)
1771 {
1772 xx = b->cx;
1773 for(i = 0; i < b->nrevs; i++)
1774 {
1775 revision_t *r = b->revs[i];
1776 line[0] = line[3] = clr(im, "rev_color", r, b, 0)->id;
1777 gdImageSetStyle(im, line, r->stripped > 0 ? 4 : 1);
1778 gdImageLine(im, xx, r->y, r->cx+r->w, r->y, gdStyled);
1779 for(sign = l = 1; l < conf.thick_lines; l++)
1780 {
1781 int pp = (l+1)/2*sign;
1782 gdImageLine(im, xx, r->y+pp, r->cx+r->w, r->y+pp, gdStyled);
1783 sign *= -1;
1784 }
1785 draw_rev(im, r);
1786 xx = r->cx;
1787 }
1788 if(conf.branch_dupbox && b->nrevs)
1789 {
1790 i = b->cx - b->tw + b->w;
1791 gdImageLine(im, xx, b->y, i+b->w, b->y, clr(im, "rev_color", NULL, b, 0)->id);
1792 for(sign = l = 1; l < conf.thick_lines; l++)
1793 {
1794 int pp = (l+1)/2*sign;
1795 gdImageLine(im, xx, b->y+pp, i+b->w, b->y+pp, clr(im, "rev_color", NULL, b, 0)->id);
1796 sign *= -1;
1797 }
1798 draw_branch_box(im, b, i - b->cx, b->y - b->h/2);
1799 }
1800 }
1801 else
1802 {
1803 xx = b->cx + b->w;
1804 for(i = 0; i < b->nrevs; i++)
1805 {
1806 revision_t *r = b->revs[i];
1807 line[0] = line[3] = clr(im, "rev_color", r, b, 0)->id;
1808 gdImageSetStyle(im, line, r->stripped > 0 ? 4 : 1);
1809 gdImageLine(im, xx, r->y, r->cx, r->y, gdStyled);
1810 for(sign = l = 1; l < conf.thick_lines; l++)
1811 {
1812 int pp = (l+1)/2*sign;
1813 gdImageLine(im, xx, r->y+pp, r->cx, r->y+pp, gdStyled);
1814 sign *= -1;
1815 }
1816 draw_rev(im, r);
1817 xx = r->cx + r->w;
1818 }
1819 if(conf.branch_dupbox && b->nrevs)
1820 {
1821 i = b->cx + b->tw - b->w;
1822 gdImageLine(im, xx, b->y, i, b->y, clr(im, "rev_color", NULL, b, 0)->id);
1823 for(sign = l = 1; l < conf.thick_lines; l++)
1824 {
1825 int pp = (l+1)/2*sign;
1826 gdImageLine(im, xx, b->y+pp, i, b->y+pp, clr(im, "rev_color", NULL, b, 0)->id);
1827 sign *= -1;
1828 }
1829 draw_branch_box(im, b, i - b->cx, b->y - b->h/2);
1830 }
1831 }
1832 }
1833 else
1834 {
1835 if(conf.upside_down)
1836 {
1837 yy = b->y;
1838 for(i = 0; i < b->nrevs; i++)
1839 {
1840 revision_t *r = b->revs[i];
1841 line[0] = line[3] = clr(im, "rev_color", r, b, 0)->id;
1842 gdImageSetStyle(im, line, r->stripped > 0 ? 4 : 1);
1843 gdImageLine(im, r->cx, yy, r->cx, r->y+r->h, gdStyled);
1844 for(sign = l = 1; l < conf.thick_lines; l++)
1845 {
1846 int pp = (l+1)/2*sign;
1847 gdImageLine(im, r->cx+pp, yy, r->cx+pp, r->y+r->h, gdStyled);
1848 sign *= -1;
1849 }
1850 draw_rev(im, r);
1851 yy = r->y;
1852 }
1853 if(conf.branch_dupbox && b->nrevs)
1854 {
1855 i = b->y - b->th + b->h;
1856 gdImageLine(im, b->cx, yy, b->cx, i, clr(im, "rev_color", NULL, b, 0)->id);
1857 for(sign = l = 1; l < conf.thick_lines; l++)
1858 {
1859 int pp = (l+1)/2*sign;
1860 gdImageLine(im, b->cx+pp, yy, b->cx+pp, i, clr(im, "rev_color", NULL, b, 0)->id);
1861 sign *= -1;
1862 }
1863 draw_branch_box(im, b, 0, i);
1864 }
1865 }
1866 else
1867 {
1868 yy = b->y + b->h;
1869 for(i = 0; i < b->nrevs; i++)
1870 {
1871 revision_t *r = b->revs[i];
1872 line[0] = line[3] = clr(im, "rev_color", r, b, 0)->id;
1873 gdImageSetStyle(im, line, r->stripped > 0 ? 4 : 1);
1874 gdImageLine(im, r->cx, yy, r->cx, r->y, gdStyled);
1875 for(sign = l = 1; l < conf.thick_lines; l++)
1876 {
1877 int pp = (l+1)/2*sign;
1878 gdImageLine(im, r->cx+pp, yy, r->cx+pp, r->y, gdStyled);
1879 sign *= -1;
1880 }
1881 draw_rev(im, r);
1882 yy = r->y + r->h;
1883 }
1884 if(conf.branch_dupbox && b->nrevs)
1885 {
1886 i = b->y + b->th - b->h;
1887 gdImageLine(im, b->cx, yy, b->cx, i, clr(im, "rev_color", NULL, b, 0)->id);
1888 for(sign = l = 1; l < conf.thick_lines; l++)
1889 {
1890 int pp = (l+1)/2*sign;
1891 gdImageLine(im, b->cx+pp, yy, b->cx+pp, i, clr(im, "rev_color", NULL, b, 0)->id);
1892 sign *= -1;
1893 }
1894 draw_branch_box(im, b, 0, i);
1895 }
1896 }
1897 }
1898 }
1899
1900 static void draw_connector(gdImagePtr im, branch_t *b)
1901 {
1902 int l;
1903 int sign;
1904 revision_t *r = b->branchpoint;
1905 int x1 = r->cx + r->w/2 + 2;
1906 int y1 = r->y + r->h/2;
1907 int x2 = b->cx;
1908 int y2 = b->y;
1909
1910 if(conf.left_right)
1911 {
1912 x2 = r->cx + r->w/2;
1913 y2 = r->y + r->h/2 + 3;
1914 x1 = b->cx;
1915 y1 = b->y;
1916 if(conf.upside_down)
1917 x1 += b->w;
1918 }
1919 else
1920 {
1921 x1 = r->cx + r->w/2 + 2;
1922 y1 = r->y + r->h/2;
1923 x2 = b->cx;
1924 y2 = b->y;
1925 if(conf.upside_down)
1926 y2 += b->h;
1927 }
1928 gdImageLine(im, x1, y1, x2, y1, clr(im, "branch_color", NULL, b, 0)->id);
1929 gdImageLine(im, x2, y1, x2, y2, clr(im, "branch_color", NULL, b, 0)->id);
1930 for(sign = l = 1; l < conf.thick_lines; l++)
1931 {
1932 int pp = (l+1)/2*sign;
1933 gdImageLine(im, x1, y1+pp, x2, y1+pp, clr(im, "branch_color", NULL, b, 0)->id);
1934 gdImageLine(im, x2+pp, y1, x2+pp, y2, clr(im, "branch_color", NULL, b, 0)->id);
1935 sign *= -1;
1936 }
1937 }
1938
1939 static void draw_merges(gdImagePtr im, rcsfile_t *rcs, int dot)
1940 {
1941 int i;
1942 for(i = 0; i < rcs->nmerges; i++)
1943 {
1944 revision_t *fr;
1945 revision_t *tr;
1946 int colorid;
1947 int x1, x2, y1, y2;
1948 switch(rcs->merges[i].type)
1949 {
1950 case TR_TAG:
1951 fr = rcs->merges[i].from.tag->logrev;
1952 tr = rcs->merges[i].to.tag->logrev;
1953 colorid = clr(im, "merge_color", NULL, NULL, rcs->merges[i].clr)->id;
1954 break;
1955 case TR_REVISION:
1956 fr = rcs->merges[i].from.rev;
1957 tr = rcs->merges[i].to.rev;
1958 colorid = clr(im, "merge_cvsnt_color", NULL, NULL, 0)->id;
1959 break;
1960 default:
1961 continue;
1962 }
1963 if(!fr || !tr || fr == tr)
1964 continue; /* This can happen with detached tags and self-references */
1965 if(conf.left_right)
1966 {
1967 if(fr->branch == tr->branch)
1968 {
1969 y1 = fr->y - fr->h/2;
1970 y2 = tr->y - tr->h/2;
1971 }
1972 else
1973 {
1974 if(fr->branch && fr->branch->branchpoint &&
1975 tr->branch && tr->branch->branchpoint &&
1976 fr->branch->branchpoint->branch == tr->branch->branchpoint->branch)
1977 {
1978 y1 = fr->y + fr->h/2;
1979 y2 = tr->y + tr->h/2;
1980 }
1981 else if(fr->y < tr->y)
1982 {
1983 y1 = fr->y + fr->h/2;
1984 y2 = tr->y - tr->h/2;
1985 }
1986 else
1987 {
1988 y1 = fr->y - fr->h/2;
1989 y2 = tr->y + tr->h/2;
1990 }
1991 }
1992 x1 = fr->cx + fr->w/2;
1993 x2 = tr->cx + tr->w/2;
1994 }
1995 else
1996 {
1997 if(fr->branch == tr->branch)
1998 {
1999 x1 = fr->cx - fr->w/2;
2000 x2 = tr->cx - tr->w/2;
2001 }
2002 else
2003 {
2004 if(fr->branch && fr->branch->branchpoint &&
2005 tr->branch && tr->branch->branchpoint &&
2006 fr->branch->branchpoint->branch == tr->branch->branchpoint->branch)
2007 {
2008 x1 = fr->cx + fr->w/2;
2009 x2 = tr->cx + tr->w/2;
2010 }
2011 else if(fr->cx < tr->cx)
2012 {
2013 x1 = fr->cx + fr->w/2;
2014 x2 = tr->cx - tr->w/2;
2015 }
2016 else
2017 {
2018 x1 = fr->cx - fr->w/2;
2019 x2 = tr->cx + tr->w/2;
2020 }
2021 }
2022 if(rcs->merges[i].type == TR_TAG)
2023 {
2024 y1 = fr->y + rcs->merges[i].from.tag->yofs;
2025 y2 = tr->y + rcs->merges[i].to.tag->yofs;
2026 }
2027 else
2028 {
2029 y1 = fr->y + fr->h/2;
2030 y2 = tr->y + tr->h/2;
2031 }
2032 }
2033 if(dot && !conf.merge_arrows)
2034 {
2035 int o = conf.left_right ? 1 : 0;
2036 gdImageArc(im, x2, y2+o, 8, 8, 0, 360, colorid);
2037 /* BUG: We clip manually because libgd segfaults on out of bound values */
2038 if(x2+1 >= 0 && x2+1 < gdImageSX(im) && y2+o+1 >= 0 && y2+o+1 < gdImageSY(im))
2039 gdImageFillToBorder(im, x2+1, y2+o+1, colorid, colorid);
2040 }
2041 else if(dot && conf.merge_arrows)
2042 {
2043 /*
2044 * Arrow patch from Haroon Rafique <haroon.rafique@utoronto.ca>
2045 * Slightly adapted to be more configurable.
2046 */
2047 int sx, sy; /* start point coordinates */
2048 int ex, ey; /* end point coordinates */
2049 double theta;
2050 double u1, v1, u2, v2;
2051 gdPoint p[3];
2052
2053 sx = x1; sy = y1;
2054 ex = x2; ey = y2;
2055 if(conf.left_right)
2056 {
2057 if(fr->branch == tr->branch)
2058 {
2059 int yy = (y1 < y2 ? y1 : y2) - 5;
2060 /* line from (x1,yy) to (x2,yy) */
2061 sy = ey = yy;
2062 }
2063 else
2064 {
2065 if(fr->branch && fr->branch->branchpoint &&
2066 tr->branch && tr->branch->branchpoint &&
2067 fr->branch->branchpoint->branch == tr->branch->branchpoint->branch)
2068 {
2069 /* line from (x1,y1+3+1) to (x2,y2+3+1) */
2070 sy = y1+3+1;
2071 ey = y2+3+1;
2072 }
2073 else if(y1 > y2)
2074 {
2075 /* line from (x1,y1-3) to (x2,y2+3+1) */
2076 sy = y1-3;
2077 ey = y2+3+1;
2078 }
2079 else
2080 {
2081 /* line from (x1,y1+3+1) to (x2,y2-3) */
2082 sy = y1+3+1;
2083 ey = y2-3;
2084 }
2085 }
2086 }
2087 else
2088 {
2089 if(fr->branch == tr->branch)
2090 {
2091 int xx = (x1 < x2 ? x1 : x2) - 5;
2092 /* line from (xx,y1) to (xx,y2) */
2093 sx = ex = xx;
2094 }
2095 else
2096 {
2097 if(fr->branch && fr->branch->branchpoint &&
2098 tr->branch && tr->branch->branchpoint &&
2099 fr->branch->branchpoint->branch == tr->branch->branchpoint->branch)
2100 {
2101 /* line from (x1+3,y1) to (x2+3,y2) */
2102 sx = x1+3;
2103 ex = x2+3;
2104 }
2105 else if(x1 > x2)
2106 {
2107 /* line from (x1-3,y1) to (x2+3,y2) */
2108 sx = x1-3;
2109 ex = x2+3;
2110 }
2111 else
2112 {
2113 /* line from (x1+3,y1) to (x2-3,y2) */
2114 sx = x1+3;
2115 ex = x2-3;
2116 }
2117 }
2118 }
2119 /*
2120 * inspiration for arrow code comes from arrows.c in the
2121 * graphviz package. Thank you, AT&T
2122 */
2123 /* theta in radians */
2124 theta = atan2((double)(sy-ey), (double)(sx-ex));
2125 u1 = (double)conf.arrow_length * cos(theta);
2126 v1 = (double)conf.arrow_length * sin(theta);
2127 u2 = (double)conf.arrow_width * cos(theta + M_PI/2.0);
2128 v2 = (double)conf.arrow_width * sin(theta + M_PI/2.0);
2129 /* points of polygon (triangle) */
2130 p[0].x = ROUND(ex + u1 - u2);
2131 p[0].y = ROUND(ey + v1 - v2);
2132 p[1].x = ex;
2133 p[1].y = ey;
2134 p[2].x = ROUND(ex + u1 + u2);
2135 p[2].y = ROUND(ey + v1 + v2);
2136 /* draw the polygon (triangle) */
2137 gdImageFilledPolygon(im, p, 3, colorid);
2138 }
2139 else
2140 {
2141 if(conf.left_right)
2142 {
2143 if(fr->branch == tr->branch)
2144 {
2145 int yy = (y1 < y2 ? y1 : y2) - 5;
2146 gdImageLine(im, x1, y1, x1, yy, colorid);
2147 gdImageLine(im, x2, y2, x2, yy, colorid);
2148 gdImageLine(im, x1, yy, x2, yy, colorid);
2149 }
2150 else
2151 {
2152 if(fr->branch && fr->branch->branchpoint &&
2153 tr->branch && tr->branch->branchpoint &&
2154 fr->branch->branchpoint->branch == tr->branch->branchpoint->branch)
2155 {
2156 gdImageLine(im, x1, y1, x1, y1+3+1, colorid);
2157 gdImageLine(im, x2, y2+1, x2, y2+3+1, colorid);
2158 gdImageLine(im, x1, y1+3+1, x2, y2+3+1, colorid);
2159 }
2160 else if(y1 > y2)
2161 {
2162 gdImageLine(im, x1, y1, x1, y1-3, colorid);
2163 gdImageLine(im, x2, y2+1, x2, y2+3+1, colorid);
2164 gdImageLine(im, x1, y1-3, x2, y2+3+1, colorid);
2165 }
2166 else
2167 {
2168 gdImageLine(im, x1, y1+1, x1, y1+3+1, colorid);
2169 gdImageLine(im, x2, y2, x2, y2-3, colorid);
2170 gdImageLine(im, x1, y1+3+1, x2, y2-3, colorid);
2171 }
2172 }
2173 }
2174 else
2175 {
2176 if(fr->branch == tr->branch)
2177 {
2178 int xx = (x1 < x2 ? x1 : x2) - 5;
2179 gdImageLine(im, xx, y1, x1, y1, colorid);
2180 gdImageLine(im, xx, y2, x2, y2, colorid);
2181 gdImageLine(im, xx, y1, xx, y2, colorid);
2182 }
2183 else
2184 {
2185 if(fr->branch && fr->branch->branchpoint &&
2186 tr->branch && tr->branch->branchpoint &&
2187 fr->branch->branchpoint->branch == tr->branch->branchpoint->branch)
2188 {
2189 gdImageLine(im, x1, y1, x1+3, y1, colorid);
2190 gdImageLine(im, x2, y2, x2+3, y2, colorid);
2191 gdImageLine(im, x1+3, y1, x2+3, y2, colorid);
2192 }
2193 else if(x1 > x2)
2194 {
2195 gdImageLine(im, x1, y1, x1-3, y1, colorid);
2196 gdImageLine(im, x2, y2, x2+3, y2, colorid);
2197 gdImageLine(im, x1-3, y1, x2+3, y2, colorid);
2198 }
2199 else
2200 {
2201 gdImageLine(im, x1, y1, x1+3, y1, colorid);
2202 gdImageLine(im, x2, y2, x2-3, y2, colorid);
2203 gdImageLine(im, x1+3, y1, x2-3, y2, colorid);
2204 }
2205 }
2206 }
2207 }
2208 }
2209 }
2210
2211 static void draw_messages(gdImagePtr im, int offset)
2212 {
2213 int i;
2214
2215 for(i = 0; i < nmsg_stack; i++)
2216 {
2217 draw_stringnl(im, msg_stack[i].msg, &conf.msg_font, conf.margin_left, offset, ALIGN_HL|ALIGN_VT, clr(im, "msg_color", NULL, NULL, 0));
2218 offset += msg_stack[i].h;
2219 }
2220 }
2221
2222 static gdImagePtr make_image(rcsfile_t *rcs)
2223 {
2224 gdImagePtr im;
2225 int i;
2226 int bgid;
2227 char *cptr;
2228 int w, h;
2229 int subx = 0, suby = 0;
2230 int msgh = 0;
2231
2232 if(subtree_branch)
2233 {
2234 w = 0;
2235 h = 0;
2236 if(subtree_rev)
2237 {
2238 for(i = 0; i < subtree_rev->nbranches; i++)
2239 calc_subtree_size(subtree_rev->branches[i], &subx, &suby, &w, &h);
2240 }
2241 else
2242 calc_subtree_size(subtree_branch, &subx, &suby, &w, &h);
2243 }
2244 else
2245 {
2246 w = rcs->tw;
2247 h = rcs->th;
2248 }
2249
2250 cptr = expand_string(conf.title, rcs, NULL, NULL, NULL, NULL);
2251 i = get_swidth(cptr, &conf.title_font);
2252 if(i > w)
2253 w = i;
2254
2255 if(!quiet && nmsg_stack)
2256 {
2257 int msgw = 0;
2258 for(i = 0; i < nmsg_stack; i++)
2259 {
2260 int ww = msg_stack[i].w = get_swidth(msg_stack[i].msg, &conf.msg_font);
2261 int hh = msg_stack[i].h = get_sheight(msg_stack[i].msg, &conf.msg_font);
2262 msgh += hh;
2263 h += hh;
2264 if(ww > msgw)
2265 msgw = ww;
2266 }
2267 if(msgw > w)
2268 w = msgw;
2269 }
2270
2271 w += conf.margin_left + conf.margin_right;
2272 h += conf.margin_top + conf.margin_bottom;
2273
2274 im = gdImageCreate(w, h);
2275 bgid = clr(im, "color_bg", NULL, NULL, 0)->id; /* The background is always a unique color, */
2276 zap_clr(); /* so clear the color ref table */
2277 clr(im, NULL, NULL, NULL, 0);
2278
2279 if(conf.transparent_bg)
2280 gdImageColorTransparent(im, bgid);
2281
2282 if(!conf.merge_front)
2283 draw_merges(im, rcs, 0);
2284
2285 for(i = 0; i < rcs->nbranches; i++)
2286 {
2287 if(!rcs->branches[i]->folded && !(subtree_branch && !rcs->branches[i]->subtree_draw))
2288 draw_branch(im, rcs->branches[i]);
2289 }
2290
2291 draw_merges(im, rcs, 1); /* The dots of the merge dest */
2292
2293 for(i = 0; i < rcs->nbranches; i++)
2294 {
2295 if(rcs->branches[i]->branchpoint)
2296 draw_connector(im, rcs->branches[i]);
2297 }
2298
2299 /* Clear the margins if we have a partial tree */
2300 if(subtree_branch)
2301 {
2302 gdImageFilledRectangle(im, 0, 0, w-1, conf.margin_top-1, bgid);
2303 gdImageFilledRectangle(im, 0, 0, conf.margin_left-1, h-1, bgid);
2304 gdImageFilledRectangle(im, 0, h-conf.margin_bottom, w-1, h-1, bgid);
2305 gdImageFilledRectangle(im, w-conf.margin_right, 0, w-1, h-1, bgid);
2306 }
2307
2308 draw_stringnl(im, cptr, &conf.title_font, conf.title_x, conf.title_y, conf.title_align, clr(im, "title_color", NULL, NULL, 0));
2309 xfree(cptr);
2310
2311 if(conf.merge_front)
2312 draw_merges(im, rcs, 0);
2313
2314 if(!quiet)
2315 draw_messages(im, h - conf.margin_bottom/2 - msgh);
2316
2317 return im;
2318 }
2319
2320 /*
2321 **************************************************************************
2322 * Layout routines
2323 *
2324 * Branch BBox:
2325 * left = center_x - total_width / 2 (cx-tw)/2
2326 * right = center_x + total_width / 2 (cx+tw)/2
2327 * top = y_pos (y)
2328 * bottom = y_pos + total_height (y+th)
2329 *
2330 * Margins of branches:
2331 *
2332 * . .
2333 * . .
2334 * +--------------+
2335 * ^
2336 * | branch_margin .
2337 * v .
2338 * ----------------+ .
2339 * | ^ |
2340 * | | branch_connect |
2341 * | v |
2342 *..-+ +t-----+------+ +------+------+
2343 * | l | | |
2344 * | <--> | branch bbox | <--> | branch bbox |
2345 * | | | r | | |
2346 *..-+ | +------------b+ | +-------------+
2347 * | ^ branch_margin
2348 * | | branch_margin
2349 * | v
2350 * | +-------------+
2351 * | . .
2352 * | . .
2353 * |
2354 * branch_margin
2355 *
2356 * FIXME: There are probable som +/-1 errors in the code...
2357 * (notably shadows are not calculated in the margins)
2358 **************************************************************************
2359 */
2360 static void move_branch(branch_t *b, int x, int y)
2361 {
2362 int i;
2363 b->cx += x;
2364 b->y += y;
2365 for(i = 0; i < b->nrevs; i++)
2366 {
2367 b->revs[i]->cx += x;
2368 b->revs[i]->y += y;
2369 }
2370 }
2371
2372 static void initial_reposition_branch(revision_t *r, int *x, int *w)
2373 {
2374 int i, j;
2375 for(j = 0; j < r->nbranches; j++)
2376 {
2377 branch_t *b = r->branches[j];
2378 *x += *w + conf.rev_minline + b->tw/2 - b->cx;
2379 *w = b->tw/2;
2380 move_branch(b, *x, r->y + r->h/2 + conf.branch_connect);
2381 *x = b->cx;
2382 /* Recurse to move branches of branched revisions */
2383 for(i = b->nrevs-1; i >= 0; i--)
2384 {
2385 initial_reposition_branch(b->revs[i], x, w);
2386 }
2387 }
2388 }
2389
2390 static void initial_reposition_branch_lr(revision_t *r, int *y, int *h)
2391 {
2392 int i, j;
2393 for(j = 0; j < r->nbranches; j++)
2394 {
2395 branch_t *b = r->branches[j];
2396 *y += *h + conf.rev_minline + b->th/2 - b->y;
2397 *h = b->th/2;
2398 move_branch(b, r->cx + r->w/2 + conf.branch_connect, *y);
2399 *y = b->y;
2400 /* Recurse to move branches of branched revisions */
2401 for(i = b->nrevs-1; i >= 0; i--)
2402 {
2403 initial_reposition_branch_lr(b->revs[i], y, h);
2404 }
2405 }
2406 }
2407
2408 static void rect_union(int *x, int *y, int *w, int *h, branch_t *b)
2409 {
2410 int x1 = *x;
2411 int x2 = x1 + *w;
2412 int y1 = *y;
2413 int y2 = y1 + *h;
2414 int xx1;
2415 int xx2;
2416 int yy1;
2417 int yy2;
2418
2419 if(conf.left_right)
2420 {
2421 xx1 = b->cx;
2422 yy1 = b->y - b->th/2;
2423 }
2424 else
2425 {
2426 xx1 = b->cx - b->tw/2;
2427 yy1 = b->y;
2428 }
2429 xx2 = xx1 + b->tw;
2430 yy2 = yy1 + b->th;
2431
2432 x1 = MIN(x1, xx1);
2433 x2 = MAX(x2, xx2);
2434 y1 = MIN(y1, yy1);
2435 y2 = MAX(y2, yy2);
2436 *x = x1;
2437 *y = y1;
2438 *w = x2 - x1;
2439 *h = y2 - y1;
2440 }
2441
2442 static void calc_subtree_size(branch_t *b, int *x, int *y, int *w, int *h)
2443 {
2444 int i, j;
2445
2446 rect_union(x, y, w, h, b);
2447
2448 for(i = 0; i < b->nrevs; i++)
2449 {
2450 for(j = 0; j < b->revs[i]->nbranches; j++)
2451 calc_subtree_size(b->revs[i]->branches[j], x, y, w, h);
2452 }
2453 }
2454
2455 static int branch_intersects(int top, int bottom, int left, branch_t *b)
2456 {
2457 int br = b->cx + b->tw/2;
2458 int bt = b->y - conf.branch_connect - conf.branch_margin/2;
2459 int bb = b->y + b->th + conf.branch_margin/2;
2460 return !(bt > bottom || bb < top || br >= left);
2461 }
2462
2463 static int branch_intersects_lr(int left, int right, int top, branch_t *b)
2464 {
2465 int bt = b->y + b->th/2;
2466 int bl = b->cx - conf.branch_connect - conf.branch_margin/2;
2467 int br = b->cx + b->tw + conf.branch_margin/2;
2468 return !(bl > right || br < left || bt >= top);
2469 }
2470
2471 static int kern_branch(rcsfile_t *rcs, branch_t *b)
2472 {
2473 int left = b->cx - b->tw/2;
2474 int top = b->y - conf.branch_connect - conf.branch_margin/2;
2475 int bottom = b->y + b->th + conf.branch_margin/2;
2476 int i;
2477 int xpos = 0;
2478
2479 for(i = 0; i < rcs->nbranches; i++)
2480 {
2481 branch_t *bp = rcs->branches[i];
2482 if(bp == b)
2483 continue;
2484 if(branch_intersects(top, bottom, left, bp))
2485 {
2486 int m = bp->cx + bp->tw/2 + conf.branch_margin;
2487 if(m > xpos)
2488 xpos = m;
2489 }
2490 }
2491 if(xpos && (b->cx - b->tw/2) - xpos > 0)
2492 {
2493 move_branch(b, xpos - (b->cx - b->tw/2), 0);
2494 return 1;
2495 }
2496 return 0;
2497 }
2498
2499 static int kern_branch_lr(rcsfile_t *rcs, branch_t *b)
2500 {
2501 int top = b->y - b->th/2;
2502 int left = b->cx - conf.branch_connect - conf.branch_margin/2;
2503 int right = b->cx + b->tw + conf.branch_margin/2;
2504 int i;
2505 int ypos = 0;
2506
2507 for(i = 0; i < rcs->nbranches; i++)
2508 {
2509 branch_t *bp = rcs->branches[i];
2510 if(bp == b)
2511 continue;
2512 if(branch_intersects_lr(left, right, top, bp))
2513 {
2514 int m = bp->y + bp->th/2 + conf.branch_margin;
2515 if(m > ypos)
2516 ypos = m;
2517 }
2518 }
2519 if(ypos && (b->y - b->th/2) - ypos > 0)
2520 {
2521 move_branch(b, 0, ypos - (b->y - b->th/2));
2522 return 1;
2523 }
2524 return 0;
2525 }
2526
2527 static int kern_tree(rcsfile_t *rcs)
2528 {
2529 int i;
2530 int moved;
2531 int safeguard;
2532 int totalmoved = 0;
2533 for(moved = 1, safeguard = LOOPSAFEGUARD; moved && safeguard; safeguard--)
2534 {
2535 moved = 0;
2536 for(i = 1; i < rcs->nbranches; i++)
2537 {
2538 if(conf.left_right)
2539 moved += kern_branch_lr(rcs, rcs->branches[i]);
2540 else
2541 moved += kern_branch(rcs, rcs->branches[i]);
2542 }
2543 totalmoved += moved;
2544 #ifdef DEBUG
2545 fprintf(stderr, "kern_tree: moved=%d\n", moved);
2546 #endif
2547 }
2548 if(!safeguard)
2549 stack_msg(MSG_WARN, "kern_tree: safeguard terminated possible infinite loop; please report.");
2550 return totalmoved;
2551 }
2552
2553 static int index_of_revision(revision_t *r)
2554 {
2555 branch_t *b = r->branch;
2556 int i;
2557 for(i = 0; i < b->nrevs; i++)
2558 {
2559 if(r == b->revs[i])
2560 return i;
2561 }
2562 stack_msg(MSG_ERR, "index_of_revision: Cannot find revision in branch\n");
2563 return 0;
2564 }
2565
2566 static void branch_bbox(branch_t *br, int *l, int *r, int *t, int *b)
2567 {
2568 if(l) *l = br->cx - br->tw/2;
2569 if(r) *r = br->cx + br->tw/2;
2570 if(t) *t = br->y;
2571 if(b) *b = br->y + br->th + ((conf.branch_dupbox && br->nrevs) ? conf.rev_minline + br->h : 0);
2572 }
2573
2574 static void branch_ext_bbox(branch_t *br, int *l, int *r, int *t, int *b)
2575 {
2576 int extra = conf.branch_margin & 1; /* Correct +/-1 error on div 2 */
2577 branch_bbox(br, l, r, t, b);
2578 if(l) *l -= conf.branch_margin/2;
2579 if(r) *r += conf.branch_margin/2 + extra;
2580 if(t) *t -= conf.branch_connect + conf.branch_margin/2;
2581 if(b) *b += conf.branch_margin/2 + extra;
2582 }
2583
2584 static int branch_distance(branch_t *br1, branch_t *br2)
2585 {
2586 int l1, r1, t1, b1;
2587 int l2, r2, t2, b2;
2588 assert(br1 != NULL);
2589 assert(br2 != NULL);
2590 branch_bbox(br1, &l1, &r1, NULL, NULL);
2591 branch_bbox(br2, &l2, &r2, NULL, NULL);
2592 branch_ext_bbox(br1, NULL, NULL, &t1, &b1);
2593 branch_ext_bbox(br2, NULL, NULL, &t2, &b2);
2594 /* Return:
2595 * - 0 if branches have no horizontal overlap
2596 * - positive if b1 is left of b2
2597 * - negative if b2 is left of b1
2598 */
2599 if((t1 > t2 && t1 < b2) || (b1 > t2 && b1 < b2))
2600 return l1 < l2 ? l2 - r1 : -(l1 - r2);
2601 else
2602 return 0;
2603 }
2604
2605 static int space_needed(branch_t *br1, branch_t *br2)
2606 {
2607 int t1, b1;
2608 int t2, b2;
2609 assert(br1 != NULL);
2610 assert(br2 != NULL);
2611 assert(br1->cx < br2->cx); /* br1 must be left of br2 */
2612 branch_ext_bbox(br1, NULL, NULL, &t1, &b1);
2613 branch_ext_bbox(br2, NULL, NULL, &t2, &b2);
2614 /* Return:
2615 * - positive if top br1 is located lower than br2
2616 * - negatve is top br2 is located lower than br1
2617 */
2618 if(t1 > t2)
2619 return -(t1 - b2);
2620 else
2621 return t2 - b1;
2622 }
2623
2624 static void move_yr_branch(branch_t *b, int dy)
2625 {
2626 int i, j;
2627 #ifdef DEBUG
2628 /* fprintf(stderr, "move_yr_branch: b=%s, dy=%d\n", b->branch->branch, dy);*/
2629 #endif
2630 b->y += dy;
2631 for(i = 0; i < b->nrevs; i++)
2632 {
2633 b->revs[i]->y += dy;
2634 for(j = 0; j < b->revs[i]->nbranches; j++)
2635 {
2636 #ifdef DEBUG
2637 /* fprintf(stderr, ".");*/
2638 #endif
2639 move_yr_branch(b->revs[i]->branches[j], dy);
2640 }
2641 }
2642 }
2643
2644 static void move_trunk(revision_t *r, int dy)
2645 {
2646 int i, j;
2647 branch_t *b = r->branch;
2648 b->th += dy;
2649 for(i = index_of_revision(r); i < b->nrevs; i++)
2650 {
2651 #ifdef DEBUG
2652 fprintf(stderr, "move_trunk: start %s, moving %s by %d (b's %d)\n", r->rev->rev, b->revs[i]->rev->rev, dy, b->revs[i]->nbranches);
2653 #endif
2654 b->revs[i]->y += dy;
2655 for(j = 0; j < b->revs[i]->nbranches; j++)
2656 {
2657 move_yr_branch(b->revs[i]->branches[j], dy);
2658 }
2659 }
2660 }
2661
2662 static int space_below(rcsfile_t *rcs, revision_t *r)
2663 {
2664 int i, j;
2665 int bl, br, bb;
2666 int space = INT_MAX;
2667 branch_t *b = r->branch;
2668 branch_t *minb = NULL;
2669
2670 branch_ext_bbox(b, &bl, &br, NULL, &bb);
2671 for(i = 0; i < rcs->nbranches; i++)
2672 {
2673 int tbl, tbr, tbt;
2674 branch_t *tb = rcs->branches[i];
2675 branch_ext_bbox(tb, &tbl, &tbr, &tbt, NULL);
2676 if(tb == b)
2677 continue;
2678 if(tbt > bb) /* Must be below our branch */
2679 {
2680 if(tb->branchpoint) /* Take account for the horiz connector */
2681 tbl = tb->branchpoint->cx + tb->branchpoint->branch->tw/2;
2682 if((bl >= tbl && bl <= tbr) || (br <= tbr && br >= tbl))
2683 {
2684 int s = tbt - bb - conf.branch_connect;
2685 if(s < space)
2686 {
2687 space = s;
2688 minb = tb;
2689 }
2690 }
2691 }
2692 }
2693 if(b->branchpoint)
2694 {
2695 for(i = index_of_revision(r); i < b->nrevs; i++)
2696 {
2697 for(j = 0; j < b->revs[i]->nbranches; j++)
2698 {
2699 int s = space_below(rcs, b->revs[i]->branches[j]->revs[0]);
2700 if(s < space)
2701 space = s;
2702 }
2703 }
2704 }
2705 #ifdef DEBUG
2706 fprintf(stderr, "space_below: from %s have %d to %s\n", b->branch->branch, space, minb ? minb->branch->branch : "<recursed>");
2707 #endif
2708 return space;
2709 }
2710
2711 static int space_available(rcsfile_t *rcs, branch_t *colbr, branch_t *tagbr, int *nl, revision_t **bpcommon)
2712 {
2713 int i;
2714 int space = 0;
2715 int nlinks = 0;
2716 revision_t *r;
2717 branch_t *b;
2718 branch_t *ancestor;
2719 revision_t *branchpoint;
2720
2721 if(!tagbr->branchpoint || !colbr->branchpoint)
2722 {
2723 stack_msg(MSG_WARN, "space_available: Trying to stretch the top?");
2724 return 0;
2725 }
2726
2727 r = colbr->branchpoint;
2728 b = r->branch;
2729 branchpoint = tagbr->branchpoint;
2730 ancestor = branchpoint->branch;
2731 assert(b != NULL);
2732 assert(ancestor != NULL);
2733
2734 while(1)
2735 {
2736 int s;
2737 int rtag = b == ancestor ? index_of_revision(branchpoint)+1 : 0;
2738 for(i = index_of_revision(r); i >= rtag; i--)
2739 {
2740 if(i > 0)
2741 s = b->revs[i]->y - (b->revs[i-1]->y + b->revs[i-1]->h);
2742 else
2743 s = b->revs[i]->y - (b->y + b->h);
2744 if(s < conf.rev_maxline)
2745 {
2746 space += conf.rev_maxline - s;
2747 nlinks++;
2748 }
2749 }
2750 s = space_below(rcs, r);
2751 if(s < space)
2752 space = s;
2753 #ifdef DEBUG
2754 if(space < 0)
2755 return -1;
2756 #endif
2757 if(b == ancestor)
2758 break;
2759 r = b->branchpoint;
2760 if(!r)
2761 {
2762 /* Not a common ancestor */
2763 r = colbr->branchpoint;
2764 b = r->branch;
2765 branchpoint = ancestor->branchpoint;
2766 if(!branchpoint)
2767 {
2768 stack_msg(MSG_WARN, "space_available: No common ancestor?");
2769 return 0;
2770 }
2771 ancestor = branchpoint->branch;
2772 assert(ancestor != NULL);
2773 nlinks = 0;
2774 space = 0;
2775 continue; /* Restart with a new ancestor */
2776 }
2777 b = r->branch;
2778 }
2779 if(nl)
2780 *nl = nlinks; /* Return the number of links that can stretch */
2781 if(bpcommon)
2782 *bpcommon = branchpoint; /* Return the ancestral branchpoint on the common branch */
2783 return space;
2784 }
2785
2786 static int stretch_branches(rcsfile_t *rcs, branch_t *br1, branch_t *br2, int totalstretch)
2787 {
2788 revision_t *r;
2789 revision_t *bpcommon = NULL;
2790 branch_t *ancestor = NULL;
2791 branch_t *b;
2792 int i;
2793 int space;
2794 int nlinks = 0;
2795 int dy;
2796 int rest;
2797
2798 space = space_available(rcs, br1, br2, &nlinks, &bpcommon);
2799 if(bpcommon)
2800 ancestor = bpcommon->branch;
2801
2802 #ifdef DEBUG
2803 if(space == -1)
2804 return 0;
2805 fprintf(stderr, "stretch_branches: space available %d over %d links common %s\n", space, nlinks, ancestor->branch->branch);
2806 #endif
2807 if(space < totalstretch)
2808 return 0;
2809
2810 dy = totalstretch / nlinks;
2811 rest = totalstretch - dy * nlinks;
2812
2813 r = br1->branchpoint;
2814 b = r->branch;
2815 while(1)
2816 {
2817 int rtag = b == ancestor ? index_of_revision(bpcommon)+1 : 0;
2818 for(i = index_of_revision(r); i >= rtag; i--)
2819 {
2820 int s, q;
2821 if(i > 0)
2822 s = b->revs[i]->y - (b->revs[i-1]->y + b->revs[i-1]->h);
2823 else
2824 s = b->revs[i]->y - (b->y + b->h);
2825 q = conf.rev_maxline - s;
2826 if(q > 0)
2827 {
2828 int d = rest ? rest/nlinks+1 : 0;
2829 if(q >= dy+d)
2830 {
2831 move_trunk(b->revs[i], dy+d);
2832 }
2833 else
2834 {
2835 move_trunk(b->revs[i], q);
2836 rest += dy+d - q;
2837 }
2838 rest -= d;
2839 nlinks--;
2840 }
2841 }
2842 if(b == ancestor)
2843 break;
2844 r = b->branchpoint;
2845 assert(r != NULL); /* else 'space_available' wouldn't have returned positively */
2846 b = r->branch;
2847 }
2848 return 1;
2849 }
2850
2851 static branch_t *find_collision_branch(rcsfile_t *rcs, branch_t *b)
2852 {
2853 int i;
2854 int dist = INT_MAX;
2855 branch_t *col = NULL;
2856
2857 for(i = 0; i < rcs->nbranches; i++)
2858 {
2859 int t = branch_distance(rcs->branches[i], b);
2860 if(t > 0 && t < dist)
2861 {
2862 dist = t;
2863 col = rcs->branches[i];
2864 }
2865 }
2866 return col;
2867 }
2868
2869 static void auto_stretch(rcsfile_t *rcs)
2870 {
2871 int i;
2872 int safeguard;
2873
2874 for(i = 0, safeguard = LOOPSAFEGUARD; i < rcs->nbranches && safeguard; i++)
2875 {
2876 int bl, pr;
2877 branch_t *b = rcs->branches[i];
2878 if(!b->branchpoint)
2879 continue;
2880 branch_bbox(b, &bl, NULL, NULL, NULL);
2881 branch_bbox(b->branchpoint->branch, NULL, &pr, NULL, NULL);
2882 if(bl - conf.branch_margin - pr > 0)
2883 {
2884 branch_t *col;
2885 int spaceneeded;
2886 /* There is a potential to move branch b further left.
2887 * All branches obstructing this one from moving further
2888 * left must be originating from revisions below
2889 * b->branchpoint until a common ancester.
2890 * So, we search all branches for a branch that lies left
2891 * of b and is closest to b. This is then the collission
2892 * branch that needs to be moved.
2893 */
2894 col = find_collision_branch(rcs, b);
2895 if(!col)
2896 continue;
2897 spaceneeded = space_needed(col, b);
2898 if(spaceneeded < 0)
2899 continue;
2900 #ifdef DEBUG
2901 fprintf(stderr, "auto_stretch: %s collides %s need %d\n", b->branch->branch, col->branch->branch, spaceneeded);
2902 #endif
2903 /* Trace the collision branch back to find the common ancester
2904 * of both col and b. All revisions encountered while traversing
2905 * backwards must be stretched, including all revisions on the
2906 * common ancester from where the branches sprout.
2907 */
2908 if(stretch_branches(rcs, col, b, spaceneeded))
2909 {
2910 if(kern_tree(rcs))
2911 {
2912 /* Restart the process because movement can
2913 * cause more movement.
2914 */
2915 i = 0 - 1; /* -1 for the i++ of the loop */
2916 safeguard--; /* Prevent infinite loop, just in case */
2917 }
2918 /*return;*/
2919 }
2920 }
2921 }
2922 if(!safeguard)
2923 stack_msg(MSG_ERR, "auto_stretch: safeguard terminated possible infinite loop; please report.");
2924 }
2925
2926 static void fold_branch(rcsfile_t *rcs, revision_t *r)
2927 {
2928 int i, j;
2929 branch_t *btag = NULL;
2930
2931 for(i = 0; i < r->nbranches; i++)
2932 {
2933 branch_t *b = r->branches[i];
2934 if(!b->nrevs && b->ntags < 2)
2935 {
2936 /* No commits in this branch and no duplicate tags */
2937 if(!btag)
2938 btag = b;
2939 else
2940 {
2941 /* We have consecutive empty branches, fold */
2942 b->folded = 1;
2943 b->folded_to = btag;
2944 for(j = 0; j < rcs->nbranches; j++)
2945 {
2946 if(b == rcs->branches[j])
2947 {
2948 /* Zap the branch from the admin */
2949 memmove(&rcs->branches[j],
2950 &rcs->branches[j+1],
2951 (rcs->nbranches - j - 1)*sizeof(rcs->branches[0]));
2952 rcs->nbranches--;
2953 rcs->nfolds++;
2954 break;
2955 }
2956
2957 }
2958 memmove(&r->branches[i], &r->branches[i+1], (r->nbranches - i - 1)*sizeof(r->branches[0]));
2959 r->nbranches--;
2960 i--; /* We have one less now */
2961
2962 /* Add to the fold-list */
2963 btag->folds = xrealloc(btag->folds, (btag->nfolds+1) * sizeof(btag->folds[0]));
2964 btag->folds[btag->nfolds] = b;
2965 btag->nfolds++;
2966 }
2967 }
2968 else
2969 {
2970 if(!conf.branch_foldall)
2971 btag = NULL; /* Start a new box */
2972 /* Recursively fold sub-branches */
2973 for(j = 0; j < b->nrevs; j++)
2974 fold_branch(rcs, b->revs[j]);
2975 }
2976 }
2977 }
2978
2979 static void mark_subtree(branch_t *b)
2980 {
2981 int i, j;
2982 b->subtree_draw = 1;
2983 for(i = 0; i < b->nrevs; i++)
2984 {
2985 for(j = 0; j < b->revs[i]->nbranches; j++)
2986 mark_subtree(b->revs[i]->branches[j]);
2987 }
2988 }
2989
2990 static void make_layout(rcsfile_t *rcs)
2991 {
2992 int i, j;
2993 int x, y;
2994 int w, h;
2995 int w2;
2996
2997 /* Remove all unwanted revisions */
2998 if(conf.strip_untagged)
2999 {
3000 int fr = conf.strip_first_rev ? 0 : 1;
3001 for(i = 0; i < rcs->nbranches; i++)
3002 {
3003 branch_t *bp = rcs->branches[i];
3004 for(j = fr; j < bp->nrevs-1; j++)
3005 {
3006 if(!bp->revs[j]->ntags && bp->revs[j]->stripped >= 0 && !bp->revs[j]->mergetarget && !bp->revs[j]->nbranches)
3007 {
3008 bp->revs[j+1]->stripped = 1;
3009 memmove(&bp->revs[j], &bp->revs[j+1], (bp->nrevs-j-1) * sizeof(bp->revs[0]));
3010 bp->nrevs--;
3011 j--;
3012 }
3013 }
3014 }
3015 }
3016
3017 /* Find the sub-tree(s) we want to see */
3018 if(conf.branch_subtree && conf.branch_subtree[0])
3019 {
3020 branch_t **b;
3021 revision_t **r;
3022 rev_t rev;
3023 int k;
3024 char *tag = conf.branch_subtree;
3025
3026 /* First translate any symbolic tag to a real branch/revision number */
3027 if(rcs->tags)
3028 {
3029 for(k = 0; k < rcs->tags->ntags; k++)
3030 {
3031 if(!strcmp(conf.branch_subtree, rcs->tags->tags[k]->tag))
3032 {
3033 if(rcs->tags->tags[k]->rev->isbranch)
3034 tag = rcs->tags->tags[k]->rev->branch;
3035 else
3036 tag = rcs->tags->tags[k]->rev->rev;
3037 break;
3038 }
3039 }
3040 }
3041
3042 /* Find the corresponding branch */
3043 rev.branch = tag;
3044 rev.rev = NULL;
3045 rev.isbranch = 1;
3046 b = bsearch(&rev, rcs->branches, rcs->nbranches, sizeof(rcs->branches[0]), search_branch);
3047 if(b)
3048 {
3049 if((*b)->branchpoint)
3050 {
3051 subtree_branch = *b;
3052 for(k = 0; k < (*b)->branchpoint->nbranches; k++)
3053 mark_subtree((*b)->branchpoint->branches[k]);
3054 }
3055 /*
3056 * else -> we want everything.
3057 * This happens for the top level branch because it has no
3058 * branchpoint. We do not set the subtree_branch, which then
3059 * results in drawing the whole tree as if we did not select a
3060 * particular branch.
3061 */
3062 }
3063 else
3064 {
3065 /* Maybe it is a revision we want all subtrees from */
3066 rev.rev = tag;
3067 rev.branch = NULL;
3068 rev.isbranch = 0;
3069 r = bsearch(&rev, rcs->srev, rcs->nsrev, sizeof(rcs->srev[0]), search_revision);
3070 if(r)
3071 {
3072 if((*r)->nbranches)
3073 {
3074 subtree_branch = (*r)->branches[0];
3075 subtree_rev = *r;
3076 for(k = 0; k < (*r)->nbranches; k++)
3077 mark_subtree((*r)->branches[k]);
3078 }
3079 /*
3080 * else -> we select everything.
3081 * This happens for the any revision that has no branches.
3082 * We do not set the subtree_branch, which then results in
3083 * drawing the whole tree as if we did not select a
3084 * particular revision's branches.
3085 */
3086 }
3087 }
3088 }
3089
3090 /* Fold all empty branches in one box on the same branchpoint */
3091 if(conf.branch_fold)
3092 {
3093 for(i = 0; i < rcs->branches[0]->nrevs; i++)
3094 {
3095 if(rcs->branches[0]->revs[i]->nbranches > 0)
3096 fold_branch(rcs, rcs->branches[0]->revs[i]);
3097 }
3098 }
3099
3100 /* Remove all unwanted tags */
3101 for(i = 0; i < rcs->nbranches; i++)
3102 {
3103 branch_t *bp = rcs->branches[i];
3104 for(j = 0; j < bp->nrevs; j++)
3105 {
3106 revision_t *r = bp->revs[j];
3107 int k;
3108 for(k = 0; k < r->ntags; k++)
3109 {
3110 if(r->tags[k]->ignore > 0)
3111 {
3112 memmove(&r->tags[k], &r->tags[k+1], (r->ntags-k-1) * sizeof(r->tags[0]));
3113 r->ntags--;
3114 k--;
3115 }
3116 }
3117 }
3118 }
3119
3120 /* Calculate the box-sizes of the revisions */
3121 for(i = 0; i < rcs->nsrev; i++)
3122 {
3123 revision_t *rp;
3124 int w;
3125 int h;
3126 rp = rcs->srev[i];
3127 rp->revtext = expand_string(conf.rev_text.node ? eval_string(conf.rev_text.node, rp) : conf.rev_text.str, rcs, rp, rp->rev, NULL, rp->ntags ? rp->tags[0] : NULL);
3128 rp->revidtext = expand_string(conf.rev_idtext.node ? eval_string(conf.rev_idtext.node, rp) : conf.rev_idtext.str, rcs, rp, rp->rev, NULL, rp->ntags ? rp->tags[0] : NULL);
3129 w = get_swidth(rp->revtext, &conf.rev_text_font);
3130 j = get_swidth(rp->revidtext, &conf.rev_font);
3131 if(j > w)
3132 w = j;
3133 h = get_sheight(rp->revtext, &conf.rev_text_font);
3134 if(!conf.rev_hidenumber)
3135 h += get_sheight(rp->revidtext, &conf.rev_font);
3136 for(j = 0; j < rp->ntags; j++)
3137 {
3138 int ww = get_swidth(rp->tags[j]->tag, &conf.tag_font);
3139 int th;
3140 if(ww > w) w = ww;
3141 th = get_sheight(rp->tags[j]->tag, &conf.tag_font) + conf.rev_separator;
3142 rp->tags[j]->yofs = h + th/2 + conf.rev_tspace;
3143 h += th;
3144 }
3145 rp->w = w + conf.rev_lspace + conf.rev_rspace;
3146 rp->h = h + conf.rev_tspace + conf.rev_bspace;
3147 }
3148
3149 /* Calculate the box-sizes of the branches */
3150 for(i = 0; i < rcs->nbranches; i++)
3151 {
3152 branch_t *bp = rcs->branches[i];
3153 int w;
3154 int h;
3155 if(!bp->nfolds)
3156 {
3157 w = get_swidth(bp->branch->branch, &conf.branch_font);
3158 if(conf.rev_hidenumber)
3159 h = 0;
3160 else
3161 h = get_sheight(bp->branch->branch, &conf.branch_font);
3162 for(j = 0; j < bp->ntags; j++)
3163 {
3164 int ww = get_swidth(bp->tags[j]->tag, &conf.branch_tag_font);
3165 if(ww > w) w = ww;
3166 h += get_sheight(bp->tags[j]->tag, &conf.branch_tag_font);
3167 }
3168 }
3169 else
3170 {
3171 int h1, h2;
3172 int w1, w2;
3173 int fw;
3174 w1 = get_swidth(bp->branch->branch, &conf.branch_font);
3175 w1 += get_swidth(" ", &conf.branch_font);
3176 w2 = get_swidth(bp->tags[0]->tag, &conf.branch_tag_font);
3177 fw = w1;
3178 w = w1 + w2;
3179 h1 = get_sheight(bp->branch->branch, &conf.branch_font);
3180 h2 = get_sheight(bp->tags[0]->tag, &conf.branch_tag_font);
3181 h = MAX(h1, h2);
3182 for(j = 0; j < bp->nfolds; j++)
3183 {
3184 w1 = get_swidth(bp->folds[j]->branch->branch, &conf.branch_font);
3185 w1 += get_swidth(" ", &conf.branch_font);
3186 w2 = get_swidth(bp->folds[j]->tags[0]->tag, &conf.branch_tag_font);
3187 if(w1 > fw)
3188 fw = w1;
3189 if(w1 + w2 > w)
3190 w = w1 + w2;
3191 h1 = get_sheight(bp->folds[j]->branch->branch, &conf.branch_font);
3192 h2 = get_sheight(bp->folds[j]->tags[0]->tag, &conf.branch_tag_font);
3193 h += MAX(h1, h2);
3194 }
3195 bp->fw = fw;
3196 }
3197 w += conf.branch_lspace + conf.branch_rspace;
3198 h += conf.branch_tspace + conf.branch_bspace;
3199 bp->w = w;
3200 bp->h = h;
3201 if(conf.left_right)
3202 {
3203 for(j = 0; j < bp->nrevs; j++)
3204 {
3205 if(bp->revs[j]->h > h)
3206 h = bp->revs[j]->h;
3207 w += bp->revs[j]->w + conf.rev_minline;
3208 }
3209 if(conf.branch_dupbox && bp->nrevs)
3210 w += bp->w + conf.rev_minline;
3211 }
3212 else
3213 {
3214 for(j = 0; j < bp->nrevs; j++)
3215 {
3216 if(bp->revs[j]->w > w)
3217 w = bp->revs[j]->w;
3218 h += bp->revs[j]->h + conf.rev_minline;
3219 }
3220 if(conf.branch_dupbox && bp->nrevs)
3221 h += bp->h + conf.rev_minline;
3222 }
3223 bp->th = h;
3224 bp->tw = w;
3225 }
3226
3227 /* Calculate the relative positions of revs in a branch */
3228 if(conf.left_right)
3229 {
3230 for(i = 0; i < rcs->nbranches; i++)
3231 {
3232 branch_t *b = rcs->branches[i];
3233 y = b->th/2;
3234 x = b->w;
3235 b->y = y;
3236 b->cx = 0;
3237 for(j = 0; j < b->nrevs; j++)
3238 {
3239 x += conf.rev_minline;
3240 b->revs[j]->y = y;
3241 b->revs[j]->cx = x;
3242 x += b->revs[j]->w;
3243 }
3244 }
3245 }
3246 else
3247 {
3248 for(i = 0; i < rcs->nbranches; i++)
3249 {
3250 branch_t *b = rcs->branches[i];
3251 x = b->tw/2;
3252 y = b->h;
3253 b->cx = x;
3254 b->y = 0;
3255 for(j = 0; j < b->nrevs; j++)
3256 {
3257 y += conf.rev_minline;
3258 b->revs[j]->cx = x;
3259 b->revs[j]->y = y;
3260 y += b->revs[j]->h;
3261 }
3262 }
3263 }
3264
3265 /* Initially reposition the branches from bottom to top progressively right */
3266 if(conf.left_right)
3267 {
3268 x = rcs->branches[0]->y;
3269 w2 = rcs->branches[0]->th / 2;
3270 for(i = rcs->branches[0]->nrevs-1; i >= 0; i--)
3271 {
3272 initial_reposition_branch_lr(rcs->branches[0]->revs[i], &x, &w2);
3273 }
3274 }
3275 else
3276 {
3277 x = rcs->branches[0]->cx;
3278 w2 = rcs->branches[0]->tw / 2;
3279 for(i = rcs->branches[0]->nrevs-1; i >= 0; i--)
3280 {
3281 initial_reposition_branch(rcs->branches[0]->revs[i], &x, &w2);
3282 }
3283 }
3284
3285 /* Initially move branches left if there is room */
3286 kern_tree(rcs);
3287
3288 /* Try to kern the branches more by expanding the inter-revision spacing */
3289 if(conf.auto_stretch && !conf.left_right)
3290 auto_stretch(rcs);
3291
3292 /* Calculate overall image size */
3293 if(conf.left_right)
3294 {
3295 x = rcs->branches[0]->cx;
3296 y = rcs->branches[0]->y - rcs->branches[0]->th/2;
3297 }
3298 else
3299 {
3300 x = rcs->branches[0]->cx - rcs->branches[0]->tw/2;
3301 y = rcs->branches[0]->y;
3302 }
3303 w = rcs->branches[0]->tw;
3304 h = rcs->branches[0]->th;
3305 for(i = 1; i < rcs->nbranches; i++)
3306 rect_union(&x, &y, &w, &h, rcs->branches[i]);
3307 rcs->tw = w;
3308 rcs->th = h;
3309
3310 /* Flip the entire tree */
3311 if(conf.upside_down)
3312 {
3313 if(conf.left_right)
3314 {
3315 x += rcs->tw;
3316 for(i = 0; i < rcs->nbranches; i++)
3317 {
3318 branch_t *b = rcs->branches[i];
3319 for(j = 0; j < b->nrevs; j++)
3320 {
3321 revision_t *r = b->revs[j];
3322 r->cx = x - r->cx - r->w;
3323 }
3324 b->cx = x - b->cx - b->w;
3325 }
3326 }
3327 else
3328 {
3329 y += rcs->th;
3330 for(i = 0; i < rcs->nbranches; i++)
3331 {
3332 branch_t *b = rcs->branches[i];
3333 for(j = 0; j < b->nrevs; j++)
3334 {
3335 revision_t *r = b->revs[j];
3336 r->y = y - r->y - r->h;
3337 }
3338 b->y = y - b->y - b->h;
3339 }
3340 }
3341 }
3342
3343 /* Relocate the lot if we only draw a sub-tree */
3344 if(subtree_branch)
3345 {
3346 int xx, yy;
3347
3348 if(subtree_branch->folded) /* Fix the reference if the branch got folded */
3349 subtree_branch = subtree_branch->folded_to;
3350
3351 xx = conf.left_right ? subtree_branch->cx : subtree_branch->cx - subtree_branch->tw/2;
3352 yy = conf.left_right ? subtree_branch->y - subtree_branch->th/2 : subtree_branch->y;
3353 if(subtree_branch != rcs->branches[0])
3354 {
3355 if(conf.left_right)
3356 xx -= conf.branch_connect;
3357 else
3358 yy -= conf.branch_connect;
3359 }
3360 for(i = 0; i < rcs->nbranches; i++)
3361 move_branch(rcs->branches[i], -xx, -yy);
3362 }
3363
3364 /* Move everything w.r.t. the top-left margin */
3365 for(i = 0; i < rcs->nbranches; i++)
3366 move_branch(rcs->branches[i], conf.margin_left, conf.margin_top);
3367 }
3368
3369 /*
3370 **************************************************************************
3371 * Imagemap functions
3372 **************************************************************************
3373 */
3374 static void map_merge_box(rcsfile_t *rcs, FILE *fp, revision_t *fr, revision_t *tr, gdImagePtr im, int x1, int y1, int x2, int y2)
3375 {
3376 char *href = expand_string(conf.map_merge_href, rcs, tr, tr->rev, fr->rev, NULL);
3377 char *alt = expand_string(conf.map_merge_alt, rcs, tr, tr->rev, fr->rev, NULL);
3378 const char *htp = conf.html_level == HTMLLEVEL_X ? " /" : "";
3379
3380 if(x1 > 0 && x2 > 0 && y1 > 0 && y2 > 0)
3381 fprintf(fp, "\t<area shape=\"rect\" %s coords=\"%d,%d,%d,%d\" %s%s>\n",
3382 href, x1, y1, x2, y2, alt, htp);
3383 xfree(alt);
3384 xfree(href);
3385
3386 if(im)
3387 {
3388 gdImageFilledRectangle(im, x1-2, y1-2, x1+2, y1+2, clr(im, "title_color", NULL, NULL, 0)->id);
3389 gdImageFilledRectangle(im, x2-2, y2-2, x2+2, y2+2, clr(im, "tag_color.id", NULL, NULL, 0)->id);
3390 gdImageLine(im, x1, y1, x2, y2, clr(im, "title_color", NULL, NULL, 0)->id);
3391 }
3392 }
3393
3394 static void map_merges(rcsfile_t *rcs, FILE *fp, gdImagePtr im)
3395 {
3396 int i;
3397 int tagh2 = get_sheight("Hg", &conf.tag_font) / 2;
3398 int bm = conf.branch_margin / 2;
3399
3400 for(i = 0; i < rcs->nmerges; i++)
3401 {
3402 revision_t *fr;
3403 revision_t *tr;
3404 int x1, x2, y1, y2;
3405 switch(rcs->merges[i].type)
3406 {
3407 case TR_TAG:
3408 fr = rcs->merges[i].from.tag->logrev;
3409 tr = rcs->merges[i].to.tag->logrev;
3410 break;
3411 case TR_REVISION:
3412 fr = rcs->merges[i].from.rev;
3413 tr = rcs->merges[i].to.rev;
3414 break;
3415 default:
3416 continue;
3417 }
3418 if(!fr || !tr || fr == tr)
3419 continue; /* This can happen with detached tags and self-references */
3420 if(conf.left_right)
3421 {
3422 if(fr->branch == tr->branch)
3423 {
3424 y1 = fr->y - fr->h/2;
3425 y2 = tr->y - tr->h/2;
3426 }
3427 else
3428 {
3429 if(fr->y < tr->y)
3430 {
3431 y1 = fr->y + fr->h/2;
3432 y2 = tr->y - tr->h/2;
3433 }
3434 else
3435 {
3436 y1 = fr->y - fr->h/2;
3437 y2 = tr->y + tr->h/2;
3438 }
3439 }
3440 x1 = fr->cx + fr->w/2;
3441 x2 = tr->cx + tr->w/2;
3442 }
3443 else
3444 {
3445 if(fr->branch == tr->branch)
3446 {
3447 x1 = fr->cx - fr->w/2;
3448 x2 = tr->cx - tr->w/2;
3449 }
3450 else
3451 {
3452 if(fr->cx < tr->cx)
3453 {
3454 x1 = fr->cx + fr->w/2;
3455 x2 = tr->cx - tr->w/2;
3456 }
3457 else
3458 {
3459 x1 = fr->cx - fr->w/2;
3460 x2 = tr->cx + tr->w/2;
3461 }
3462 }
3463 if(rcs->merges[i].type == TR_TAG)
3464 {
3465 y1 = fr->y + rcs->merges[i].from.tag->yofs;
3466 y2 = tr->y + rcs->merges[i].to.tag->yofs;
3467 }
3468 else
3469 {
3470 y1 = fr->y + fr->h/2;
3471 y2 = tr->y + tr->h/2;
3472 }
3473 }
3474
3475 if(conf.left_right)
3476 {
3477 if(fr->branch == tr->branch)
3478 {
3479 map_merge_box(rcs, fp, fr, tr, im, x1-bm, y1-bm, x1+bm, y1);
3480 map_merge_box(rcs, fp, fr, tr, im, x2-bm, y2-bm, x2+bm, y2);
3481 }
3482 else
3483 {
3484 if(y1 > y2)
3485 {
3486 map_merge_box(rcs, fp, fr, tr, im, x1-bm, y1-bm, x1+bm, y1);
3487 map_merge_box(rcs, fp, fr, tr, im, x2-bm, y2, x2+bm, y2+bm);
3488 }
3489 else
3490 {
3491 map_merge_box(rcs, fp, fr, tr, im, x1-bm, y1, x1+bm, y1+bm);
3492 map_merge_box(rcs, fp, fr, tr, im, x2-bm, y2-bm, x2+bm, y2);
3493 }
3494 }
3495 }
3496 else
3497 {
3498 if(fr->branch == tr->branch)
3499 {
3500 map_merge_box(rcs, fp, fr, tr, im, x1-bm, y1-tagh2, x1, y1+tagh2);
3501 map_merge_box(rcs, fp, fr, tr, im, x2-bm, y2-tagh2, x2, y2+tagh2);
3502 }
3503 else
3504 {
3505 if(x1 > x2)
3506 {
3507 map_merge_box(rcs, fp, fr, tr, im, x1-bm, y1-tagh2, x1, y1+tagh2);
3508 map_merge_box(rcs, fp, fr, tr, im, x2, y2-tagh2, x2+bm, y2+tagh2);
3509 }
3510 else
3511 {
3512 map_merge_box(rcs, fp, fr, tr, im, x1, y1-tagh2, x1+bm, y1+tagh2);
3513 map_merge_box(rcs, fp, fr, tr, im, x2-bm, y2-tagh2, x2, y2+tagh2);
3514 }
3515 }
3516 }
3517 }
3518 }
3519
3520 static void make_imagemap(rcsfile_t *rcs, FILE *fp, gdImagePtr im)
3521 {
3522 int i, j;
3523 const char *htp = conf.html_level == HTMLLEVEL_X ? " /" : "";
3524
3525 switch(conf.html_level)
3526 {
3527 case HTMLLEVEL_4:
3528 fprintf(fp, "<map name=\"%s\" id=\"%s\">\n", conf.map_name, conf.map_name);
3529 break;
3530 case HTMLLEVEL_X:
3531 fprintf(fp, "<map id=\"%s\">\n", conf.map_name);
3532 break;
3533 default:
3534 fprintf(fp, "<map name=\"%s\">\n", conf.map_name);
3535 }
3536
3537 for(i = 0; i < rcs->nbranches; i++)
3538 {
3539 branch_t *b = rcs->branches[i];
3540 tag_t *tag = b->ntags ? b->tags[0] : NULL;
3541 char *bhref;
3542 char *balt;
3543 int x1;
3544 int x2;
3545 int y1;
3546 int y2;
3547
3548 if(subtree_branch && !b->subtree_draw)
3549 continue;
3550
3551 bhref = expand_string(conf.map_branch_href, rcs, NULL, b->branch, NULL, tag);
3552 balt = expand_string(conf.map_branch_alt, rcs, NULL, b->branch, NULL, tag);
3553
3554 if(!b->nfolds)
3555 {
3556 if(conf.left_right)
3557 {
3558 x1 = b->cx;
3559 y1 = b->y - b->h/2;
3560 x2 = b->cx + b->w;
3561 y2 = b->y + b->h/2;
3562 }
3563 else
3564 {
3565 x1 = b->cx - b->w/2;
3566 y1 = b->y;
3567 x2 = b->cx + b->w/2;
3568 y2 = b->y + b->h;
3569 }
3570 fprintf(fp, "\t<area shape=\"rect\" %s coords=\"%d,%d,%d,%d\" %s%s>\n",
3571 bhref, x1, y1, x2, y2, balt, htp);
3572 if(im)
3573 {
3574 gdImageFilledRectangle(im, x1-2, y1-2, x1+2, y1+2, clr(im, "title_color", NULL, NULL, 0)->id);
3575 gdImageFilledRectangle(im, x2-2, y2-2, x2+2, y2+2, clr(im, "tag_color", NULL, NULL, 0)->id);
3576 gdImageLine(im, x1, y1, x2, y2, clr(im, "title_color", NULL, NULL, 0)->id);
3577 }
3578 }
3579 else
3580 {
3581 int yy1, yy2, yy;
3582 if(conf.left_right)
3583 {
3584 x1 = b->cx + conf.branch_lspace;
3585 y1 = b->y - b->h/2 + conf.branch_tspace;
3586 }
3587 else
3588 {
3589 x1 = b->cx - b->w/2 + conf.branch_lspace;
3590 y1 = b->y + conf.branch_tspace;
3591 }
3592 x2 = x1 + b->w - conf.branch_rspace;
3593
3594 yy1 = get_sheight(b->branch->branch, &conf.branch_font);
3595 yy2 = get_sheight(b->tags[0]->tag, &conf.branch_tag_font);
3596 yy = MAX(yy1, yy2);
3597 y2 = y1 + yy;
3598 fprintf(fp, "\t<area shape=\"rect\" %s coords=\"%d,%d,%d,%d\" %s%s>\n",
3599 bhref, x1, y1, x2, y2, balt, htp);
3600
3601 y1 += yy;
3602 y2 += yy;
3603 for(j = 0; j < b->nfolds; j++)
3604 {
3605 branch_t *fb = b->folds[j];
3606 tag_t *t = fb->tags[0];
3607 xfree(bhref);
3608 xfree(balt);
3609 bhref = expand_string(conf.map_branch_href, rcs, NULL, fb->branch, NULL, t);
3610 balt = expand_string(conf.map_branch_alt, rcs, NULL, fb->branch, NULL, t);
3611 fprintf(fp, "\t<area shape=\"rect\" %s coords=\"%d,%d,%d,%d\" %s%s>\n",
3612 bhref, x1, y1, x2, y2, balt, htp);
3613 yy1 = get_sheight(fb->branch->branch, &conf.branch_font);
3614 yy2 = get_sheight(fb->tags[0]->tag, &conf.branch_tag_font);
3615 yy = MAX(yy1, yy2);
3616 y1 += yy;
3617 y2 += yy;
3618 }
3619 }
3620
3621 for(j = 0; j < b->nrevs; j++)
3622 {
3623 revision_t *r = b->revs[j];
3624 revision_t* r1;
3625 int xoff = 1;
3626 int yoff = 1;
3627 char *href;
3628 char *alt;
3629
3630 tag = r->ntags ? r->tags[0] : NULL;
3631 href = expand_string(conf.map_rev_href, rcs, r, r->rev, NULL, tag);
3632 alt = expand_string(conf.map_rev_alt, rcs, r, r->rev, NULL, tag);
3633 if(conf.left_right)
3634 {
3635 x1 = r->cx;
3636 y1 = r->y - r->h/2;
3637 x2 = r->cx + r->w;
3638 y2 = r->y + r->h/2;
3639 }
3640 else
3641 {
3642 x1 = r->cx - r->w/2;
3643 y1 = r->y;
3644 x2 = r->cx + r->w/2;
3645 y2 = r->y + r->h;
3646 }
3647 fprintf(fp, "\t<area shape=\"rect\" %s coords=\"%d,%d,%d,%d\" %s%s>\n",
3648 href, x1, y1, x2, y2, alt, htp);
3649 if(im)
3650 {
3651 gdImageFilledRectangle(im, x1-2, y1-2, x1+2, y1+2, clr(im, "title_color", NULL, NULL, 0)->id);
3652 gdImageFilledRectangle(im, x2-2, y2-2, x2+2, y2+2, clr(im, "tag_color", NULL, NULL, 0)->id);
3653 gdImageLine(im, x1, y1, x2, y2, clr(im, "title_color", NULL, NULL, 0)->id);
3654 }
3655 xfree(href);
3656 xfree(alt);
3657 if(j > 0 || b->branchpoint)
3658 {
3659 if(j > 0)
3660 {
3661 r1 = b->revs[j-1];
3662 if(conf.left_right)
3663 {
3664 yoff = MIN(r->h, r1->h)/4;
3665 x1 = conf.upside_down ? r1->cx : r1->cx + r1->w;
3666 }
3667 else
3668 {
3669 xoff = MIN(r->w, r1->w)/4;
3670 y1 = conf.upside_down ? r1->y : r1->y + r1->h;
3671 }
3672 }
3673 else
3674 {
3675 r1 = b->branchpoint;
3676 if(conf.left_right)
3677 {
3678 yoff = MIN(r->h, b->h)/4;
3679 x1 = conf.upside_down ? b->cx : b->cx + b->w;
3680 }
3681 else
3682 {
3683 xoff = MIN(r->w, b->w)/4;
3684 y1 = conf.upside_down ? b->y : b->y + b->h;
3685 }
3686 }
3687 if(conf.left_right)
3688 {
3689 y1 = r->y - yoff;
3690 y2 = r->y + yoff;
3691 x2 = conf.upside_down ? r->cx + r->w : r->cx;
3692 yoff = 0;
3693 }
3694 else
3695 {
3696 x1 = r->cx - xoff;
3697 x2 = r->cx + xoff;
3698 y2 = conf.upside_down ? r->y + r->h : r->y;
3699 xoff = 0;
3700 }
3701 if(x1 > x2)
3702 {
3703 int tt = x1;
3704 x1 = x2;
3705 x2 = tt;
3706 }
3707 if(y1 > y2)
3708 {
3709 int tt = y1;
3710 y1 = y2;
3711 y2 = tt;
3712 }
3713 href = expand_string(conf.map_diff_href, rcs, r, r->rev, r1->rev, tag);
3714 alt = expand_string(conf.map_diff_alt, rcs, r, r->rev, r1->rev, tag);
3715 fprintf(fp, "\t<area shape=\"rect\" %s coords=\"%d,%d,%d,%d\" %s%s>\n",
3716 href,
3717 x1+xoff, y1+yoff, x2-xoff, y2-yoff,
3718 alt, htp);
3719 if(im)
3720 {
3721 gdImageFilledRectangle(im, x1-2, y1-2, x1+2, y1+2, clr(im, "title_color", NULL, NULL, 0)->id);
3722 gdImageFilledRectangle(im, x2-2, y2-2, x2+2, y2+2, clr(im, "tag_color", NULL, NULL, 0)->id);
3723 gdImageLine(im, x1, y1, x2, y2, clr(im, "title_color", NULL, NULL, 0)->id);
3724 }
3725 xfree(href);
3726 xfree(alt);
3727 }
3728 }
3729 if(conf.branch_dupbox && b->nrevs)
3730 {
3731 if(conf.left_right)
3732 {
3733 x1 = conf.upside_down ? b->cx + b->w - b->tw : b->cx - b->w + b->tw;
3734 y1 = b->y - b->h/2;
3735 x2 = x1 + b->w;
3736 y2 = b->y + b->h/2;
3737 }
3738 else
3739 {
3740 x1 = b->cx - b->w/2;
3741 y1 = conf.upside_down ? b->y + b->h - b->th : b->y - b->h + b->th;
3742 x2 = b->cx + b->w/2;
3743 y2 = y1 + b->h;
3744 }
3745 fprintf(fp, "\t<area shape=\"rect\" %s coords=\"%d,%d,%d,%d\" %s%s>\n",
3746 bhref, x1, y1, x2, y2, balt, htp);
3747 if(im)
3748 {
3749 gdImageFilledRectangle(im, x1-2, y1-2, x1+2, y1+2, clr(im, "title_color", NULL, NULL, 0)->id);
3750 gdImageFilledRectangle(im, x2-2, y2-2, x2+2, y2+2, clr(im, "tag_color", NULL, NULL, 0)->id);
3751 gdImageLine(im, x1, y1, x2, y2, clr(im, "title_color", NULL, NULL, 0)->id);
3752 }
3753 }
3754 xfree(bhref);
3755 xfree(balt);
3756 }
3757
3758 map_merges(rcs, fp, im);
3759
3760 fprintf(fp, "</map>\n");
3761 }
3762
3763 /*
3764 **************************************************************************
3765 * Program entry
3766 **************************************************************************
3767 */
3768 static const char usage_str[] =
3769 "Usage: cvsgraph [options] <file>\n"
3770 " -b Add a branch box at both sides of the trunk (config value is negated)\n"
3771 " -c <file> Read alternative config from <file>\n"
3772 " -d <level> Enable debug mode at <level>\n"
3773 " -h This message\n"
3774 " -i Generate an imagemap instead of image\n"
3775 " -I <file> Also write the imagemap to <file>\n"
3776 " -k Auto stretch the tree (config value is negated)\n"
3777 " -M <name> Use <name> as imagemap name\n"
3778 " -m <mod> Use <mod> as cvs module\n"
3779 " -o <file> Output to <file>\n"
3780 " -O <opt=val> Set option opt to value val\n"
3781 " -q Be quiet (i.e. no warnings)\n"
3782 " -r <path> Use <path> as cvsroot path\n"
3783 " -s Strip untagged revisions (config value is negated)\n"
3784 " -S Also strip the first revision (config value is negated)\n"
3785 " -u Upside down image (mirror vertically; config value is negated)\n"
3786 " -V Print version and exit\n"
3787 " -x [34x] Specify level of HTML 3.2 (default), 4.0 or XHTML\n"
3788 " -[0-9] <txt> Use <txt> for expansion\n"
3789 ;
3790
3791 #define VERSION_STR "1.6.1"
3792 #define NOTICE_STR "Copyright (c) 2001-2006 B.Stultiens"
3793
3794 static void append_slash(char **path)
3795 {
3796 int l;
3797 assert(path != NULL);
3798 assert(*path != NULL);
3799 l = strlen(*path);
3800 if(!l || (*path)[l-1] == '/')
3801 return;
3802 *path = xrealloc(*path, l+2);
3803 strcat(*path, "/");
3804 }
3805
3806 int main(int argc, char *argv[])
3807 {
3808 extern int rcs_flex_debug;
3809 extern int rcsdebug;
3810 int optc;
3811 char *confpath = NULL;
3812 char *outfile = NULL;
3813 char *cvsroot = NULL;
3814 char *cvsmodule = NULL;
3815 int imagemap = 0;
3816 int upsidedown = 0;
3817 int bdupbox = 0;
3818 int stripuntag = 0;
3819 int stripfirst = 0;
3820 int autostretch = 0;
3821 int htmllevel = 0;
3822 char *imgmapname = NULL;
3823 char *imgmapfile = NULL;
3824 int lose = 0;
3825 FILE *fp;
3826 char *rcsfilename;
3827 rcsfile_t *rcs;
3828 gdImagePtr im;
3829
3830 while((optc = getopt(argc, argv, "0:1:2:3:4:5:6:7:8:9:bc:d:hI:ikM:m:O:o:qr:SsuVx:")) != EOF)
3831 {
3832 switch(optc)
3833 {
3834 case 'b':
3835 bdupbox = 1;
3836 break;
3837 case 'c':
3838 confpath = xstrdup(optarg);
3839 break;
3840 case 'd':
3841 debuglevel = strtol(optarg, NULL, 0);
3842 break;
3843 case 'I':
3844 imgmapfile = xstrdup(optarg);
3845 break;
3846 case 'i':
3847 imagemap = 1;
3848 break;
3849 case 'k':
3850 autostretch = 1;
3851 break;
3852 case 'M':
3853 imgmapname = xstrdup(optarg);
3854 break;
3855 case 'm':
3856 cvsmodule = xstrdup(optarg);
3857 break;
3858 case 'O':
3859 stack_option(optarg);
3860 break;
3861 case 'o':
3862 outfile = xstrdup(optarg);
3863 break;
3864 case 'q':
3865 quiet = 1;
3866 break;
3867 case 'r':
3868 cvsroot = xstrdup(optarg);
3869 break;
3870 case 'S':
3871 stripfirst = 1;
3872 break;
3873 case 's':
3874 stripuntag = 1;
3875 break;
3876 case 'u':
3877 upsidedown = 1;
3878 break;
3879 case 'V':
3880 fprintf(stdout, "cvsgraph v%s, %s\n", VERSION_STR, NOTICE_STR);
3881 return 0;
3882 case 'x':
3883 switch(optarg[0])
3884 {
3885 case '3':
3886 htmllevel = HTMLLEVEL_3;
3887 break;
3888 case '4':
3889 htmllevel = HTMLLEVEL_4;
3890 break;
3891 case 'x':
3892 htmllevel = HTMLLEVEL_X;
3893 break;
3894 default:
3895 fprintf(stderr, "Invalid HTML level in -x\n");
3896 lose++;
3897 }
3898 break;
3899 case 'h':
3900 fprintf(stdout, "%s", usage_str);
3901 return 0;
3902 default:
3903 if(isdigit(optc))
3904 {
3905 conf.expand[optc-'0'] = xstrdup(optarg);
3906 }
3907 else
3908 lose++;
3909 }
3910 }
3911
3912 if(lose)
3913 {
3914 fprintf(stderr, "%s", usage_str);
3915 return 1;
3916 }
3917
3918 if(debuglevel)
3919 {
3920 setvbuf(stdout, NULL, 0, _IONBF);
3921 setvbuf(stderr, NULL, 0, _IONBF);
3922 }
3923 rcs_flex_debug = (debuglevel & DEBUG_RCS_LEX) != 0;
3924 rcsdebug = (debuglevel & DEBUG_RCS_YACC) != 0;
3925
3926 /* Set defaults */
3927 conf.tag_font.gdfont = gdFontTiny;
3928 conf.rev_font.gdfont = gdFontTiny;
3929 conf.branch_font.gdfont = gdFontTiny;
3930 conf.branch_tag_font.gdfont = gdFontTiny;
3931 conf.title_font.gdfont = gdFontTiny;
3932 conf.rev_text_font.gdfont = gdFontTiny;
3933 conf.msg_font.gdfont = gdFontTiny;
3934
3935 conf.anti_alias = 1;
3936 conf.thick_lines = 1;
3937 conf.branch_fold = 1;
3938
3939 conf.cvsroot = xstrdup("");
3940 conf.cvsmodule = xstrdup("");
3941 conf.date_format = xstrdup("%d-%b-%Y %H:%M:%S");
3942 conf.title = xstrdup("");
3943 conf.map_name = xstrdup("CvsGraphImageMap");
3944 conf.map_branch_href = xstrdup("href=\"unset: conf.map_branch_href\"");
3945 conf.map_branch_alt = xstrdup("alt=\"%B\"");
3946 conf.map_rev_href = xstrdup("href=\"unset: conf.map_rev_href\"");
3947 conf.map_rev_alt = xstrdup("alt=\"%R\"");
3948 conf.map_diff_href = xstrdup("href=\"unset: conf.map_diff_href\"");
3949 conf.map_diff_alt = xstrdup("alt=\"%P &lt;-&gt; %R\"");
3950 conf.map_merge_href = xstrdup("href=\"unset: conf.map_merge_href\"");
3951 conf.map_merge_alt = xstrdup("alt=\"%P &lt;-&gt; %R\"");
3952 conf.rev_text.str = xstrdup("%d");
3953 conf.rev_idtext.str = xstrdup("%R");
3954 conf.branch_subtree = xstrdup("");
3955 conf.tag_ignore = xstrdup("");
3956 conf.merge_from.n = 0;
3957 conf.merge_from.strs = NULL;
3958 conf.merge_to.n = 0;
3959 conf.merge_to.strs = NULL;
3960 conf.merge_arrows = 1;
3961 conf.merge_cvsnt = 1;
3962 conf.arrow_width = ARROW_WIDTH;
3963 conf.arrow_length = ARROW_LENGTH;
3964
3965 conf.color_bg = white_color;
3966 conf.branch_bgcolor = white_color;
3967 conf.branch_color = black_color;
3968 conf.branch_tag_color = black_color;
3969 conf.rev_color = black_color;
3970 conf.rev_bgcolor = white_color;
3971 conf.merge_color.n = 0;
3972 conf.merge_color.clrs = NULL;
3973 conf.merge_cvsnt_color = black_color;
3974 conf.tag_color = black_color;
3975 conf.title_color = black_color;
3976 conf.rev_text_color = black_color;
3977 conf.msg_color = black_color;
3978
3979 conf.image_quality = 100;
3980 conf.image_compress = -1; /* Use default zlib setting */
3981 conf.rev_maxline = -1; /* Checked later to set to default */
3982
3983 read_config(confpath);
3984
3985 if(conf.rev_maxline == -1) conf.rev_maxline = 5 * conf.rev_minline;
3986
3987 /* Set overrides */
3988 if(cvsroot) conf.cvsroot = cvsroot;
3989 if(cvsmodule) conf.cvsmodule = cvsmodule;
3990 if(imgmapname) conf.map_name = imgmapname;
3991 if(upsidedown) conf.upside_down = !conf.upside_down;
3992 if(bdupbox) conf.branch_dupbox = !conf.branch_dupbox;
3993 if(stripuntag) conf.strip_untagged = !conf.strip_untagged;
3994 if(stripfirst) conf.strip_first_rev = !conf.strip_first_rev;
3995 if(autostretch) conf.auto_stretch = !conf.auto_stretch;
3996 if(htmllevel) conf.html_level = htmllevel;
3997
3998 if(conf.rev_minline >= conf.rev_maxline)
3999 {
4000 if(conf.auto_stretch)
4001 stack_msg(MSG_WARN, "Auto stretch is only possible if rev_minline < rev_maxline");
4002 conf.auto_stretch = 0;
4003 }
4004
4005 if(conf.thick_lines < 1)
4006 conf.thick_lines = 1;
4007 if(conf.thick_lines > 11)
4008 conf.thick_lines = 11;
4009
4010 if(conf.image_quality < 0 || conf.image_quality > 100)
4011 {
4012 stack_msg(MSG_WARN, "JPEG quality (image_quality) must be between 0 and 100");
4013 conf.image_quality = 100;
4014 }
4015
4016 if(conf.image_compress < -1 || conf.image_compress > 9)
4017 {
4018 stack_msg(MSG_WARN, "PNG compression (image_compress) must be between -1 and 9");
4019 conf.image_compress = -1;
4020 }
4021
4022 append_slash(&conf.cvsroot);
4023 append_slash(&conf.cvsmodule);
4024
4025 if(optind >= argc)
4026 {
4027 #ifdef __WIN32__
4028 /* Bad hack for DOS/Windows */
4029 if(setmode(fileno(stdin), O_BINARY) == -1)
4030 {
4031 perror("Set binary mode for stdin");
4032 return 1;
4033 }
4034 #endif
4035 rcsfilename = NULL;
4036 }
4037 else
4038 rcsfilename = argv[optind];
4039
4040 rcs = get_rcsfile(conf.cvsroot, conf.cvsmodule, rcsfilename);
4041 if(!rcs)
4042 return 1;
4043
4044 if(debuglevel & DEBUG_RCS_FILE)
4045 dump_rcsfile(rcs);
4046
4047 if(!reorganise_branches(rcs))
4048 return 1;
4049
4050 assign_tags(rcs);
4051 find_merges(rcs);
4052 find_merges_cvsnt(rcs);
4053
4054 if(outfile)
4055 {
4056 if((fp = fopen(outfile, "wb")) == NULL)
4057 {
4058 perror(outfile);
4059 return 1;
4060 }
4061 }
4062 else
4063 {
4064 fp = stdout;
4065 #ifdef __WIN32__
4066 /* Bad hack for DOS/Windows */
4067 if(setmode(fileno(fp), O_BINARY) == -1)
4068 {
4069 perror("Set binary mode for stdout");
4070 return 1;
4071 }
4072 #endif
4073 }
4074
4075 make_layout(rcs);
4076
4077 if(!imagemap)
4078 {
4079 /* Create an image */
4080 im = make_image(rcs);
4081
4082 if(conf.image_interlace)
4083 gdImageInterlace(im, 1);
4084
4085 #ifdef DEBUG_IMAGEMAP
4086 {
4087 FILE *nulfile = fopen("/dev/null", "w");
4088 make_imagemap(rcs, nulfile, im);
4089 fclose(nulfile);
4090 }
4091 #endif
4092 switch(conf.image_type)
4093 {
4094 #ifdef HAVE_IMAGE_GIF
4095 # ifndef HAVE_IMAGE_PNG
4096 default:
4097 # endif
4098 case IMAGE_GIF:
4099 gdImageGif(im, fp);
4100 break;
4101 #endif
4102 #ifdef HAVE_IMAGE_PNG
4103 default:
4104 case IMAGE_PNG:
4105 #ifdef HAVE_GDIMAGEPNGEX
4106 gdImagePngEx(im, fp, conf.image_compress);
4107 #else
4108 gdImagePng(im, fp);
4109 #endif
4110 break;
4111 #endif
4112 #ifdef HAVE_IMAGE_JPEG
4113 # if !defined(HAVE_IMAGE_GIF) && !defined(HAVE_IMAGE_PNG)
4114 default:
4115 # endif
4116 case IMAGE_JPEG:
4117 gdImageJpeg(im, fp, conf.image_quality);
4118 break;
4119 #endif
4120 }
4121
4122 gdImageDestroy(im);
4123 }
4124 else
4125 {
4126 /* Create an imagemap */
4127 make_imagemap(rcs, fp, NULL);
4128 }
4129
4130 /* Also create imagemap to file if requested */
4131 if(imgmapfile)
4132 {
4133 FILE *ifp = fopen(imgmapfile, "wb");
4134 if(!ifp)
4135 {
4136 perror(imgmapfile);
4137 return 1;
4138 }
4139 make_imagemap(rcs, ifp, NULL);
4140 fclose(ifp);
4141 }
4142
4143 if(outfile)
4144 fclose(fp);
4145
4146 return 0;
4147 }

  ViewVC Help
Powered by ViewVC 1.1.0 with CvsGraph 1.7.0