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

  ViewVC Help
Powered by ViewVC 1.1.0 with CvsGraph 1.7.0