/[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.31 - (hide annotations)
Mon Mar 10 22:57:21 2003 UTC (14 years, 9 months ago) by bertho
Branch: MAIN
Changes since 1.30: +131 -104 lines
File MIME type: text/plain
*** empty log message ***
1 bertho 1.1 /*
2     * CvsGraph graphical representation generator of brances and revisions
3     * of a file in cvs/rcs.
4     *
5 bertho 1.29 * Copyright (C) 2001,2002,2003 B. Stultiens
6 bertho 1.1 *
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 bertho 1.14 #include "config.h"
23    
24 bertho 1.1 #include <stdio.h>
25     #include <stdlib.h>
26     #include <unistd.h>
27     #include <string.h>
28     #include <assert.h>
29     #include <sys/types.h>
30     #include <sys/stat.h>
31     #include <sys/wait.h>
32     #include <fcntl.h>
33     #include <regex.h>
34     #include <errno.h>
35 bertho 1.8 #include <ctype.h>
36 bertho 1.9 #include <time.h>
37 bertho 1.18 #include <limits.h>
38 bertho 1.30 #include <regex.h>
39 bertho 1.9
40 bertho 1.14 #ifdef HAVE_GETOPT_H
41     # include <getopt.h>
42     #endif
43    
44 bertho 1.1 #include <gd.h>
45     #include <gdfontt.h>
46    
47     #include "cvsgraph.h"
48     #include "utils.h"
49     #include "readconf.h"
50 bertho 1.7 #include "rcs.h"
51 bertho 1.1
52 bertho 1.5 #if !defined(HAVE_IMAGE_GIF) && !defined(HAVE_IMAGE_PNG) && !defined(HAVE_IMAGE_JPEG)
53     # error No image output format available. Check libgd
54     #endif
55    
56    
57 bertho 1.21 /*#define DEBUG 1*/
58 bertho 1.19 /*#define NOGDFILL 1*/
59 bertho 1.26 /*#define DEBUG_IMAGEMAP 1*/
60 bertho 1.19
61     #define LOOPSAFEGUARD 100 /* Max itterations in possible infinite loops */
62 bertho 1.1
63     #ifndef MAX
64     # define MAX(a,b) ((a) > (b) ? (a) : (b))
65     #endif
66    
67     #ifndef MIN
68     # define MIN(a,b) ((a) < (b) ? (a) : (b))
69     #endif
70    
71     #define ALIGN_HL 0x00
72     #define ALIGN_HC 0x01
73     #define ALIGN_HR 0x02
74 bertho 1.9 #define ALIGN_HX 0x0f
75 bertho 1.1 #define ALIGN_VT 0x00
76     #define ALIGN_VC 0x10
77     #define ALIGN_VB 0x20
78     #define ALIGN_VX 0xf0
79 bertho 1.9
80 bertho 1.1 /*
81     **************************************************************************
82     * Globals
83     **************************************************************************
84     */
85    
86     config_t conf;
87 bertho 1.7 int debuglevel;
88 bertho 1.9 color_t white_color = {255, 255, 255, 0};
89     color_t black_color = {0, 0, 0, 0};
90    
91 bertho 1.30 /*
92     **************************************************************************
93     * Forwards
94     **************************************************************************
95     */
96     static void zap_string(void);
97     static char *dup_string(void);
98     static void add_string_str(const char *s);
99     static void add_string_ch(int ch);
100     static void add_string_date(const char *d);
101     static void add_string_str_html(const char *s, int maxlen);
102     static void add_string_str_len(const char *s, int maxlen);
103 bertho 1.1
104     /*
105     **************************************************************************
106 bertho 1.17 * Debug routines
107 bertho 1.1 **************************************************************************
108     */
109 bertho 1.19 static void dump_rev(char *p, rev_t *r)
110 bertho 1.1 {
111 bertho 1.7 printf("%s", p);
112     if(r)
113     printf("'%s', '%s', %d\n", r->rev, r->branch, r->isbranch);
114     else
115     printf("<null>\n");
116 bertho 1.1 }
117    
118 bertho 1.19 static void dump_id(char *p, char *d)
119 bertho 1.1 {
120 bertho 1.7 printf("%s", p);
121     if(d)
122     printf("'%s'\n", d);
123     else
124     printf("<null>\n");
125 bertho 1.1 }
126    
127 bertho 1.19 static void dump_idrev(char *p, idrev_t *t)
128 bertho 1.1 {
129 bertho 1.7 printf("%s", p);
130     if(t)
131 bertho 1.1 {
132 bertho 1.7 printf("'%s' -> ", t->id);
133     dump_rev("", t->rev);
134 bertho 1.1 }
135     else
136 bertho 1.7 printf("<null>\n");
137 bertho 1.1 }
138    
139 bertho 1.19 static void dump_tag(char *p, tag_t *t)
140 bertho 1.1 {
141 bertho 1.7 printf("%s", p);
142     if(t)
143 bertho 1.1 {
144 bertho 1.7 printf("'%s' -> ", t->tag);
145     dump_rev("", t->rev);
146 bertho 1.1 }
147 bertho 1.7 else
148     printf("<null>\n");
149 bertho 1.1 }
150    
151 bertho 1.19 static void dump_delta(char *p, delta_t *d)
152 bertho 1.1 {
153 bertho 1.7 int i;
154     printf("%sdelta.rev : ", p);
155     dump_rev("", d->rev);
156     printf("%sdelta.date : %s\n", p, d->date);
157     printf("%sdelta.author: %s\n", p, d->author);
158     printf("%sdelta.state : %s\n", p, d->state);
159     for(i = 0; d->branches && i < d->branches->nrevs; i++)
160 bertho 1.1 {
161 bertho 1.7 printf("%sdelta.branch: ", p);
162     dump_rev("", d->branches->revs[i]);
163 bertho 1.1 }
164 bertho 1.7 printf("%sdelta.next : ", p);
165     dump_rev("", d->next);
166     printf("\n");
167 bertho 1.1 }
168    
169 bertho 1.19 static void dump_dtext(char *p, dtext_t *d)
170 bertho 1.1 {
171 bertho 1.7 printf("%sdtext.rev : ", p);
172     dump_rev("", d->rev);
173     printf("%sdtext.log : %d bytes\n", p, d->log ? strlen(d->log) : -1);
174     printf("%sdtext.text : %d bytes\n", p, d->text ? strlen(d->text) : -1);
175     printf("\n");
176 bertho 1.1 }
177    
178 bertho 1.19 static void dump_rcsfile(rcsfile_t *rcs)
179 bertho 1.1 {
180 bertho 1.7 int i;
181     printf("root : '%s'\n", rcs->root);
182     printf("module : '%s'\n", rcs->module);
183     printf("file : '%s'\n", rcs->file);
184     dump_rev("head : ", rcs->head);
185     dump_rev("branch : ", rcs->branch);
186     printf("access :\n");
187     for(i = 0; rcs->access && i < rcs->access->nids; i++)
188     dump_id("\t", rcs->access->ids[i]);
189     printf("tags :\n");
190     for(i = 0; rcs->tags && i < rcs->tags->ntags; i++)
191     dump_tag("\t", rcs->tags->tags[i]);
192     printf("locks :%s\n", rcs->strict ? " (strict)" : "");
193     for(i = 0; rcs->locks && i < rcs->locks->nidrevs; i++)
194     dump_idrev("\t", rcs->locks->idrevs[i]);
195     printf("comment: '%s'\n", rcs->comment);
196     printf("expand : '%s'\n", rcs->expand ? rcs->expand : "(default -kv)");
197     printf("deltas :\n");
198     for(i = 0; rcs->deltas && i < rcs->deltas->ndeltas; i++)
199     dump_delta("\t", rcs->deltas->deltas[i]);
200     printf("desc : '%s'\n", rcs->desc);
201     printf("dtexts :\n");
202     for(i = 0; rcs->dtexts && i < rcs->dtexts->ndtexts; i++)
203     dump_dtext("\t", rcs->dtexts->dtexts[i]);
204    
205     fflush(stdout);
206 bertho 1.1 }
207    
208 bertho 1.7 /*
209     **************************************************************************
210     * Read the rcs file
211     **************************************************************************
212     */
213     rcsfile_t *get_rcsfile(const char *cvsroot, const char *module, const char *file)
214 bertho 1.1 {
215 bertho 1.7 char *cmd = NULL;
216     int rv;
217 bertho 1.1
218 bertho 1.18 if(file)
219 bertho 1.9 {
220 bertho 1.18 cmd = xmalloc(strlen(cvsroot) + strlen(module) + strlen(file) + 1);
221     sprintf(cmd, "%s%s%s", cvsroot, module, file);
222     if(!(rcsin = fopen(cmd, "rb")))
223     {
224     perror(cmd);
225     return NULL;
226     }
227     input_file = cmd;
228     }
229     else
230     {
231     rcsin = stdin;
232     input_file = "<stdin>";
233 bertho 1.9 }
234 bertho 1.7 line_number = 1;
235     rv = rcsparse();
236 bertho 1.18 if(file)
237     {
238     fclose(rcsin);
239     xfree(cmd);
240     }
241 bertho 1.7 if(rv)
242 bertho 1.1 return NULL;
243 bertho 1.7 input_file = NULL;
244 bertho 1.18 if(file)
245     {
246     rcsfile->root = xstrdup(cvsroot);
247     rcsfile->module = xstrdup(module);
248     rcsfile->file = xstrdup(file);
249     }
250     else
251     {
252     rcsfile->root = xstrdup("");
253     rcsfile->module = xstrdup("");
254     rcsfile->file = xstrdup("<stdin>");
255     }
256 bertho 1.7 return rcsfile;
257 bertho 1.1 }
258    
259     /*
260     **************************************************************************
261     * Sort and find helpers
262     **************************************************************************
263     */
264 bertho 1.5 int count_dots(const char *s)
265     {
266     int i;
267     for(i = 0; *s; s++)
268     {
269     if(*s == '.')
270     i++;
271     }
272     return i;
273     }
274    
275 bertho 1.7 int compare_rev(int bcmp, const rev_t *r1, const rev_t *r2)
276 bertho 1.5 {
277     int d1, d2;
278 bertho 1.7 char *c1, *c2;
279 bertho 1.5 char *v1, *v2;
280     char *s1, *s2;
281     int retval = 0;
282     assert(r1 != NULL);
283     assert(r2 != NULL);
284 bertho 1.7 if(bcmp)
285     {
286     assert(r1->branch != NULL);
287     assert(r2->branch != NULL);
288     c1 = r1->branch;
289     c2 = r2->branch;
290     }
291     else
292     {
293     assert(r1->rev != NULL);
294     assert(r2->rev != NULL);
295     c1 = r1->rev;
296     c2 = r2->rev;
297     }
298 bertho 1.5
299 bertho 1.7 d1 = count_dots(c1);
300     d2 = count_dots(c2);
301 bertho 1.5 if(d1 != d2)
302     {
303     return d1 - d2;
304     }
305    
306 bertho 1.7 s1 = v1 = xstrdup(c1);
307     s2 = v2 = xstrdup(c2);
308 bertho 1.5 while(1)
309     {
310     char *vc1 = strchr(s1, '.');
311     char *vc2 = strchr(s2, '.');
312     if(vc1 && vc2)
313     *vc1 = *vc2 = '\0';
314     if(*s1 && *s2)
315     {
316     d1 = atoi(s1);
317     d2 = atoi(s2);
318     if(d1 != d2)
319     {
320     retval = d1 - d2;
321     break;
322     }
323     }
324     if(!vc1 || !vc2)
325     break;
326     s1 = vc1 + 1;
327     s2 = vc2 + 1;
328     }
329     xfree(v1);
330     xfree(v2);
331     return retval;
332     }
333    
334 bertho 1.7 /*
335     **************************************************************************
336     * Reorganise the rcsfile for the branches
337     *
338     * Basically, we have a list of deltas (i.e. administrative info on
339     * revisions) and a list of delta text (the actual logs and diffs).
340     * The deltas are linked through the 'next' and the 'branches' fields
341     * which describe the tree-structure of revisions.
342     * The reorganisation means that we put each delta and corresponding
343     * delta text in a revision structure and assign it to a specific
344     * branch. This is required because we want to be able to calculate
345     * the bounding boxes of each branch. The revisions expand vertically
346     * and the branches expand horizontally.
347     * The reorganisation is performed in these steps:
348 bertho 1.17 * 1 - sort deltas and delta text on revision number for quick lookup
349 bertho 1.7 * 2 - start at the denoted head revision:
350     * * create a branch structure and add this revision
351     * * for each 'branches' in the delta do:
352     * - walk all 'branches' of the delta and recursively goto 2
353     * with the denoted branch delta as new head
354     * - backlink the newly create sub-branch to the head revision
355     * so that we can draw them recursively
356     * * set head to the 'next' field and goto 2 until no next is
357     * available
358     * 3 - update the administration
359     **************************************************************************
360     */
361 bertho 1.19 static int sort_delta(const void *d1, const void *d2)
362 bertho 1.7 {
363     return compare_rev(0, (*(delta_t **)d1)->rev, (*(delta_t **)d2)->rev);
364     }
365    
366 bertho 1.19 static int search_delta(const void *r, const void *d)
367 bertho 1.1 {
368 bertho 1.7 return compare_rev(0, (rev_t *)r, (*(delta_t **)d)->rev);
369 bertho 1.1 }
370    
371 bertho 1.19 static delta_t *find_delta(delta_t **dl, int n, rev_t *r)
372 bertho 1.1 {
373 bertho 1.7 delta_t **d;
374 bertho 1.23 if(!n)
375     return NULL;
376 bertho 1.7 d = bsearch(r, dl, n, sizeof(*dl), search_delta);
377     if(!d)
378     return NULL;
379     return *d;
380 bertho 1.1 }
381    
382 bertho 1.19 static int sort_dtext(const void *d1, const void *d2)
383 bertho 1.1 {
384 bertho 1.7 return compare_rev(0, (*(dtext_t **)d1)->rev, (*(dtext_t **)d2)->rev);
385 bertho 1.1 }
386    
387 bertho 1.19 static int search_dtext(const void *r, const void *d)
388 bertho 1.1 {
389 bertho 1.7 return compare_rev(0, (rev_t *)r, (*(dtext_t **)d)->rev);
390 bertho 1.1 }
391    
392 bertho 1.19 static dtext_t *find_dtext(dtext_t **dl, int n, rev_t *r)
393 bertho 1.1 {
394 bertho 1.7 dtext_t **d;
395 bertho 1.23 if(!n)
396     return NULL;
397 bertho 1.7 d = bsearch(r, dl, n, sizeof(*dl), search_dtext);
398     if(!d)
399 bertho 1.1 return NULL;
400 bertho 1.7 return *d;
401     }
402    
403 bertho 1.19 static rev_t *dup_rev(const rev_t *r)
404 bertho 1.7 {
405     rev_t *t = xmalloc(sizeof(*t));
406     t->rev = xstrdup(r->rev);
407     t->branch = xstrdup(r->branch);
408     t->isbranch = r->isbranch;
409     return t;
410     }
411    
412 bertho 1.19 static branch_t *new_branch(delta_t *d, dtext_t *t)
413 bertho 1.7 {
414     branch_t *b = xmalloc(sizeof(*b));
415     revision_t *r = xmalloc(sizeof(*r));
416     r->delta = d;
417     r->dtext = t;
418     r->rev = d->rev;
419     r->branch = b;
420     b->branch = dup_rev(d->rev);
421     b->branch->isbranch = 1;
422     b->nrevs = 1;
423     b->revs = xmalloc(sizeof(b->revs[0]));
424     b->revs[0] = r;
425     return b;
426     }
427    
428 bertho 1.19 static revision_t *add_to_branch(branch_t *b, delta_t *d, dtext_t *t)
429 bertho 1.7 {
430     revision_t *r = xmalloc(sizeof(*r));
431     r->delta = d;
432     r->dtext = t;
433     r->rev = d->rev;
434     r->branch = b;
435     b->revs = xrealloc(b->revs, (b->nrevs+1) * sizeof(b->revs[0]));
436     b->revs[b->nrevs] = r;
437     b->nrevs++;
438     return r;
439     }
440    
441     void build_branch(branch_t ***bl, int *nbl, delta_t **sdl, int nsdl, dtext_t **sdt, int nsdt, delta_t *head)
442     {
443     branch_t *b;
444     dtext_t *text;
445     revision_t *currev;
446    
447     assert(head != NULL);
448    
449     if(head->flag)
450     {
451     fprintf(stderr, "Circular reference on '%s' in branchpoint\n", head->rev->rev);
452     return;
453     }
454     head->flag++;
455     text = find_dtext(sdt, nsdt, head->rev);
456    
457     /* Create a new branch for this head */
458     b = new_branch(head, text);
459     *bl = xrealloc(*bl, (*nbl+1)*sizeof((*bl)[0]));
460     (*bl)[*nbl] = b;
461     (*nbl)++;
462     currev = b->revs[0];
463     while(1)
464     {
465     /* Process all sub-branches */
466     if(head->branches)
467     {
468     int i;
469     for(i = 0; i < head->branches->nrevs; i++)
470     {
471     delta_t *d = find_delta(sdl, nsdl, head->branches->revs[i]);
472     int btag = *nbl;
473     if(!d)
474     continue;
475     build_branch(bl, nbl, sdl, nsdl, sdt, nsdt, d);
476    
477     /* Set the new branch's origin */
478     (*bl)[btag]->branchpoint = currev;
479    
480     /* Add branch to this revision */
481     currev->branches = xrealloc(currev->branches, (currev->nbranches+1)*sizeof(currev->branches[0]));
482     currev->branches[currev->nbranches] = (*bl)[btag];
483     currev->nbranches++;
484     }
485     }
486    
487     /* Walk through the next list */
488     if(!head->next)
489     return;
490 bertho 1.9
491 bertho 1.7 head = find_delta(sdl, nsdl, head->next);
492     if(!head)
493     {
494     fprintf(stderr, "Next revision (%s) not found in deltalist\n", head->next->rev);
495     return;
496     }
497     if(head->flag)
498     {
499     fprintf(stderr, "Circular reference on '%s'\n", head->rev->rev);
500     return;
501     }
502     head->flag++;
503     text = find_dtext(sdt, nsdt, head->rev);
504     currev = add_to_branch(b, head, text);
505     }
506     }
507    
508     int reorganise_branches(rcsfile_t *rcs)
509     {
510     delta_t **sdelta;
511     int nsdelta;
512     dtext_t **sdtext;
513     int nsdtext;
514     delta_t *head;
515     branch_t **bl;
516     int nbl;
517     int i;
518    
519     assert(rcs->deltas != NULL);
520     assert(rcs->head != NULL);
521    
522     /* Make a new list for quick lookup */
523     nsdelta = rcs->deltas->ndeltas;
524     sdelta = xmalloc(nsdelta * sizeof(sdelta[0]));
525     memcpy(sdelta, rcs->deltas->deltas, nsdelta * sizeof(sdelta[0]));
526     qsort(sdelta, nsdelta, sizeof(sdelta[0]), sort_delta);
527    
528     /* Do the same for the delta text */
529 bertho 1.22 if(rcs->dtexts)
530     {
531     nsdtext = rcs->dtexts->ndtexts;
532     sdtext = xmalloc(nsdtext * sizeof(sdtext[0]));
533     memcpy(sdtext, rcs->dtexts->dtexts, nsdtext * sizeof(sdtext[0]));
534     qsort(sdtext, nsdtext, sizeof(sdtext[0]), sort_dtext);
535     }
536     else
537     {
538     nsdtext = 0;
539     sdtext = NULL;
540     }
541 bertho 1.7
542     /* Start from the head of the trunk */
543     head = find_delta(sdelta, nsdelta, rcs->head);
544     if(!head)
545     {
546     fprintf(stderr, "Head revision (%s) not found in deltalist\n", rcs->head->rev);
547     return 0;
548     }
549     bl = NULL;
550     nbl = 0;
551     build_branch(&bl, &nbl, sdelta, nsdelta, sdtext, nsdtext, head);
552    
553     /* Reverse the head branch */
554     for(i = 0; i < bl[0]->nrevs/2; i++)
555     {
556     revision_t *r;
557     r = bl[0]->revs[i];
558     bl[0]->revs[i] = bl[0]->revs[bl[0]->nrevs-i-1];
559     bl[0]->revs[bl[0]->nrevs-i-1] = r;
560     }
561    
562     /* Update the branch-number of the head because it was reversed */
563     xfree(bl[0]->branch->branch);
564     bl[0]->branch->branch = xstrdup(bl[0]->revs[0]->rev->branch);
565    
566     /* Keep the admin */
567     rcs->branches = bl;
568     rcs->nbranches = nbl;
569     rcs->sdelta = sdelta;
570     rcs->nsdelta = nsdelta;
571     rcs->sdtext = sdtext;
572     rcs->nsdtext = nsdtext;
573     rcs->active = bl[0];
574     return 1;
575     }
576    
577     /*
578     **************************************************************************
579     * Assign the symbolic tags to the revisions and branches
580     *
581     * The tags point to revision numbers somewhere in the tree structure
582     * of branches and revisions. First we make a sorted list of all
583     * revisions and then we assign each tag to the proper revision.
584     **************************************************************************
585     */
586 bertho 1.19 static int sort_revision(const void *r1, const void *r2)
587 bertho 1.7 {
588     return compare_rev(0, (*(revision_t **)r1)->delta->rev, (*(revision_t **)r2)->delta->rev);
589     }
590    
591 bertho 1.19 static int search_revision(const void *t, const void *r)
592 bertho 1.7 {
593     return compare_rev(0, (rev_t *)t, (*(revision_t **)r)->delta->rev);
594     }
595    
596 bertho 1.19 static int sort_branch(const void *b1, const void *b2)
597 bertho 1.7 {
598     return compare_rev(1, (*(branch_t **)b1)->branch, (*(branch_t **)b2)->branch);
599 bertho 1.1 }
600    
601 bertho 1.19 static int search_branch(const void *t, const void *b)
602 bertho 1.1 {
603 bertho 1.7 return compare_rev(1, (rev_t *)t, (*(branch_t **)b)->branch);
604 bertho 1.1 }
605    
606 bertho 1.19 static char *previous_rev(const char *c)
607 bertho 1.1 {
608 bertho 1.7 int dots = count_dots(c);
609     char *cptr;
610     char *r;
611     if(!dots)
612 bertho 1.9 {
613     fprintf(stderr, "FIXME: previous_rev(\"%s\"): Cannot determine parent branch revision\n", c);
614 bertho 1.7 return xstrdup("1.0"); /* FIXME: don't know what the parent is */
615 bertho 1.9 }
616 bertho 1.7 if(dots & 1)
617     {
618     /* Is is a revision we want the parent of */
619     r = xstrdup(c);
620     cptr = strrchr(r, '.');
621     assert(cptr != NULL);
622     if(dots == 1)
623     {
624 bertho 1.9 fprintf(stderr, "FIXME: previous_rev(\"%s\"): Going beyond top-level?\n", c);
625 bertho 1.7 /* FIXME: What is the parent of 1.1? */
626     cptr[1] = '\0';
627     strcat(r, "0");
628     return r;
629     }
630     /* Here we have a "x.x[.x.x]+" case */
631     *cptr = '\0';
632     cptr = strrchr(r, '.');
633     assert(cptr != NULL);
634     *cptr = '\0';
635     return r;
636     }
637     /* It is a branch we want the parent of */
638     r = xstrdup(c);
639     cptr = strrchr(r, '.');
640     assert(cptr != NULL);
641     *cptr = '\0';
642     return r;
643 bertho 1.1 }
644    
645 bertho 1.30 static char *build_regex(size_t n, regmatch_t *m, const char *ms)
646     {
647     char *cptr;
648     int i;
649    
650     if(!conf.merge_to || !conf.merge_to[0])
651     return NULL;
652    
653     zap_string();
654     for(cptr = conf.merge_to; *cptr; cptr++)
655     {
656     if(*cptr == '%')
657     {
658     if(cptr[1] >= '1' && cptr[1] <= '9')
659     {
660     int idx = cptr[1] - '0';
661     regmatch_t *p = &m[idx];
662     if(idx < n && !(p->rm_so == -1 || p->rm_so >= p->rm_eo))
663     {
664     for(i = p->rm_so; i < p->rm_eo; i++)
665     {
666     if(strchr("^$.*+\\[{()", ms[i]))
667     add_string_ch('\\');
668     add_string_ch(ms[i]);
669     }
670     }
671     cptr++;
672     }
673     else
674     add_string_ch('%');
675     }
676     else
677     add_string_ch(*cptr);
678     }
679     return dup_string();
680     }
681    
682 bertho 1.31 static void find_merges(rcsfile_t *rcs)
683 bertho 1.1 {
684     int i;
685 bertho 1.30 int err;
686 bertho 1.31 int rcflags = REG_EXTENDED | (conf.merge_nocase ? REG_ICASE : 0);
687 bertho 1.30 regex_t *refrom = NULL;
688     regex_t *reto = NULL;
689     regmatch_t *matchfrom = NULL;
690    
691 bertho 1.31 if(!conf.merge_from || !conf.merge_from[0] || !conf.merge_to || !conf.merge_to[0])
692     return;
693    
694     refrom = xmalloc(sizeof(*refrom));
695     reto = xmalloc(sizeof(*reto));
696    
697     /* Compile the 'from' regex match for merge identification */
698     err = regcomp(refrom, conf.merge_from, rcflags);
699     if(err)
700 bertho 1.30 {
701 bertho 1.31 if(!quiet)
702     {
703     char *msg;
704     i = regerror(err, refrom, NULL, 0);
705     msg = xmalloc(i+1);
706     regerror(err, refrom, msg, i+1);
707     fprintf(stderr, "%s\n", msg);
708     xfree(msg);
709     }
710     xfree(refrom);
711     xfree(reto);
712     return;
713     }
714     else
715     matchfrom = xmalloc((refrom->re_nsub+1) * sizeof(*matchfrom));
716 bertho 1.30
717 bertho 1.31 for(i = 0; i < rcs->tags->ntags; i++)
718     {
719     tag_t *t = rcs->tags->tags[i];
720    
721     /* Must be revision tags and not detached */
722     if(t->rev->isbranch || !t->logrev)
723     continue;
724    
725     /* Try to find merge tag matches */
726     if(!regexec(refrom, t->tag, refrom->re_nsub+1, matchfrom, 0))
727     {
728     int n;
729     char *to;
730    
731     to = build_regex(refrom->re_nsub+1, matchfrom, t->tag);
732     if(to)
733     {
734     err = regcomp(reto, to, rcflags);
735     if(err && !quiet)
736     {
737     char *msg;
738     i = regerror(err, reto, NULL, 0);
739     msg = xmalloc(i+1);
740     regerror(err, reto, msg, i+1);
741     fprintf(stderr, "%s\n", msg);
742     }
743     else if(!err)
744     {
745     for(n = 0; n < rcs->tags->ntags; n++)
746     {
747     tag_t *nt = rcs->tags->tags[n];
748     /* From and To never should match the same tag or belong to a branch */
749     if(n == i || nt->rev->isbranch || !nt->logrev)
750     continue;
751    
752     if(!regexec(reto, nt->tag, 0, NULL, REG_NOSUB))
753     {
754     /* Tag matches */
755     rcs->merges = xrealloc(rcs->merges,
756     sizeof(rcs->merges[0]) * (rcs->nmerges+1));
757     rcs->merges[rcs->nmerges].to = nt;
758     rcs->merges[rcs->nmerges].from = t;
759     rcs->nmerges++;
760     /* We cannot (should not) match multiple times */
761     break;
762     }
763     }
764     regfree(reto);
765     }
766     xfree(to);
767     }
768 bertho 1.30 }
769     }
770 bertho 1.31 if(matchfrom) xfree(matchfrom);
771     if(refrom) { regfree(refrom); xfree(refrom); }
772     if(reto) xfree(reto);
773     }
774    
775     static void assign_tags(rcsfile_t *rcs)
776     {
777     int i;
778     int nr;
779 bertho 1.7
780     for(i = nr = 0; i < rcs->nbranches; i++)
781     nr += rcs->branches[i]->nrevs;
782    
783     rcs->srev = xmalloc(nr * sizeof(rcs->srev[0]));
784     rcs->nsrev = nr;
785     for(i = nr = 0; i < rcs->nbranches; i++)
786     {
787     memcpy(&rcs->srev[nr], rcs->branches[i]->revs, rcs->branches[i]->nrevs * sizeof(rcs->branches[i]->revs[0]));
788     nr += rcs->branches[i]->nrevs;
789     }
790    
791     qsort(rcs->srev, rcs->nsrev, sizeof(rcs->srev[0]), sort_revision);
792     qsort(rcs->branches, rcs->nbranches, sizeof(rcs->branches[0]), sort_branch);
793    
794     if(!rcs->branch)
795     {
796     /* The main trunk is the active trunk */
797     rcs->tags->tags = xrealloc(rcs->tags->tags, (rcs->tags->ntags+1)*sizeof(rcs->tags->tags[0]));
798     rcs->tags->tags[rcs->tags->ntags] = xmalloc(sizeof(tag_t));
799     rcs->tags->tags[rcs->tags->ntags]->tag = xstrdup("MAIN");
800     rcs->tags->tags[rcs->tags->ntags]->rev = xmalloc(sizeof(rev_t));
801     rcs->tags->tags[rcs->tags->ntags]->rev->rev = xstrdup(rcs->active->branch->rev);
802     rcs->tags->tags[rcs->tags->ntags]->rev->branch = xstrdup(rcs->active->branch->branch);
803     rcs->tags->tags[rcs->tags->ntags]->rev->isbranch = 1;
804     rcs->tags->ntags++;
805     }
806    
807     /* We should have at least two tags (HEAD and MAIN) */
808     assert(rcs->tags != 0);
809    
810     for(i = 0; i < rcs->tags->ntags; i++)
811     {
812     tag_t *t = rcs->tags->tags[i];
813     if(t->rev->isbranch)
814     {
815     branch_t **b;
816     add_btag:
817     b = bsearch(t->rev, rcs->branches, rcs->nbranches, sizeof(rcs->branches[0]), search_branch);
818     if(!b)
819     {
820     rev_t rev;
821     revision_t **r;
822     /* This happens for the magic branch numbers if there are
823 bertho 1.12 * no commits within the new branch yet. So, we add the
824     * branch and try to continue.
825 bertho 1.7 */
826     rev.rev = previous_rev(t->rev->branch);
827     rev.branch = NULL;
828     rev.isbranch = 0;
829     r = bsearch(&rev, rcs->srev, rcs->nsrev, sizeof(rcs->srev[0]), search_revision);
830     xfree(rev.rev);
831     if(!r)
832     {
833 bertho 1.12 if(!quiet)
834     fprintf(stderr, "No branch found for tag '%s:%s'\n", t->tag, t->rev->branch);
835 bertho 1.7 }
836     else
837     {
838     rcs->branches = xrealloc(rcs->branches, (rcs->nbranches+1)*sizeof(rcs->branches[0]));
839     rcs->branches[rcs->nbranches] = xmalloc(sizeof(branch_t));
840     rcs->branches[rcs->nbranches]->branch = dup_rev(t->rev);
841     rcs->branches[rcs->nbranches]->branchpoint = *r;
842     (*r)->branches = xrealloc((*r)->branches, ((*r)->nbranches+1)*sizeof((*r)->branches[0]));
843     (*r)->branches[(*r)->nbranches] = rcs->branches[rcs->nbranches];
844     (*r)->nbranches++;
845     rcs->nbranches++;
846     /* Resort the branches */
847     qsort(rcs->branches, rcs->nbranches, sizeof(rcs->branches[0]), sort_branch);
848     goto add_btag;
849     }
850     }
851     else
852     {
853     branch_t *bb = *b;
854     bb->tags = xrealloc(bb->tags, (bb->ntags+1)*sizeof(bb->tags[0]));
855     bb->tags[bb->ntags] = t;
856     bb->ntags++;
857     }
858     }
859     else
860     {
861     revision_t **r = bsearch(t->rev, rcs->srev, rcs->nsrev, sizeof(rcs->srev[0]), search_revision);
862     if(!r)
863 bertho 1.12 {
864     if(!quiet)
865     fprintf(stderr, "No revision found for tag '%s:%s'\n", t->tag, t->rev->rev);
866     }
867 bertho 1.7 else
868     {
869     revision_t *rr = *r;
870 bertho 1.30 t->logrev = rr;
871 bertho 1.28 if(!conf.rev_maxtags || rr->ntags <= conf.rev_maxtags)
872     {
873     rr->tags = xrealloc(rr->tags, (rr->ntags+1)*sizeof(rr->tags[0]));
874     if(conf.rev_maxtags && rr->ntags == conf.rev_maxtags)
875     {
876     rr->tags[rr->ntags] = xmalloc(sizeof(tag_t));
877     rr->tags[rr->ntags]->tag = xstrdup("...");
878     rr->tags[rr->ntags]->rev = t->rev;
879     }
880     else
881     rr->tags[rr->ntags] = t;
882     rr->ntags++;
883     }
884 bertho 1.7 }
885     }
886     }
887    
888     /* We need to reset the first in the list of branches to the
889     * active branch to ensure the drawing of all
890     */
891     if(rcs->active != rcs->branches[0])
892 bertho 1.1 {
893 bertho 1.7 branch_t **b = bsearch(rcs->active->branch, rcs->branches, rcs->nbranches, sizeof(rcs->branches[0]), search_branch);
894     branch_t *t;
895     assert(b != NULL);
896     t = *b;
897     *b = rcs->branches[0];
898     rcs->branches[0] = t;
899 bertho 1.1 }
900     }
901    
902     /*
903     **************************************************************************
904 bertho 1.8 * String expansion
905     **************************************************************************
906     */
907     static char *_string;
908     static int _nstring;
909     static int _nastring;
910    
911 bertho 1.30 static void zap_string(void)
912     {
913     _nstring = 0;
914     if(_string)
915     _string[0] = '\0';
916     }
917    
918     static char *dup_string(void)
919     {
920     if(_string)
921     return xstrdup(_string);
922     else
923     return "";
924     }
925    
926 bertho 1.19 static void add_string_str(const char *s)
927 bertho 1.8 {
928     int l = strlen(s) + 1;
929     if(_nstring + l > _nastring)
930     {
931 bertho 1.24 _nastring += MAX(128, l);
932 bertho 1.8 _string = xrealloc(_string, _nastring * sizeof(_string[0]));
933     }
934     memcpy(_string+_nstring, s, l);
935     _nstring += l-1;
936     }
937    
938 bertho 1.19 static void add_string_ch(int ch)
939 bertho 1.8 {
940     char buf[2];
941     buf[0] = ch;
942     buf[1] = '\0';
943     add_string_str(buf);
944     }
945    
946 bertho 1.19 static void add_string_date(const char *d)
947 bertho 1.9 {
948     struct tm tm, *tmp;
949     int n;
950     time_t t;
951     char *buf;
952     int nbuf;
953    
954     memset(&tm, 0, sizeof(tm));
955     n = sscanf(d, "%d.%d.%d.%d.%d.%d",
956     &tm.tm_year, &tm.tm_mon, &tm.tm_mday,
957     &tm.tm_hour, &tm.tm_min, &tm.tm_sec);
958     tm.tm_mon--;
959     if(tm.tm_year > 1900)
960     tm.tm_year -= 1900;
961     t = mktime(&tm);
962     if(n != 6 || t == (time_t)(-1))
963     {
964     add_string_str("<invalid date>");
965     return;
966     }
967    
968     tmp = localtime(&t);
969     nbuf = strlen(conf.date_format) * 16; /* Should be enough to hold all types of expansions */
970     buf = xmalloc(nbuf);
971     strftime(buf, nbuf, conf.date_format, tmp);
972     add_string_str(buf);
973     xfree(buf);
974     }
975    
976 bertho 1.22 static void add_string_str_html(const char *s, int maxlen)
977     {
978     int l = 0;
979     char *str = xmalloc(6 * strlen(s) + 1); /* Should hold all char entity-expand */
980     char *cptr = str;
981     for(; *s; s++)
982     {
983     if(maxlen && l > abs(maxlen))
984     {
985     cptr += sprintf(cptr, "...");
986     break;
987     }
988     if(*s < 0x20)
989     {
990     if(*s == '\n')
991     {
992     if(maxlen < 0)
993     *cptr++ = ' ';
994     else
995     cptr += sprintf(cptr, "<br>");
996     }
997     }
998 bertho 1.30 else if(*s >= 0x7f || *s == '"')
999 bertho 1.22 cptr += sprintf(cptr, "&#%d;", (int)(unsigned char)*s);
1000     else if(*s == '<')
1001     cptr += sprintf(cptr, "&lt;");
1002     else if(*s == '>')
1003     cptr += sprintf(cptr, "&gt;");
1004     else
1005     *cptr++ = *s;
1006     l++;
1007     }
1008     *cptr = '\0';
1009     add_string_str(str);
1010     xfree(str);
1011     }
1012    
1013     static void add_string_str_len(const char *s, int maxlen)
1014     {
1015     int l = strlen(s);
1016     char *str = xmalloc(l + 1 + 3);
1017     strcpy(str, s);
1018     if(maxlen < l)
1019     sprintf(&str[maxlen], "...");
1020     add_string_str(str);
1021     xfree(str);
1022     }
1023    
1024 bertho 1.9 char *expand_string(const char *s, rcsfile_t *rcs, revision_t *r, rev_t *rev, rev_t *prev, tag_t *tag)
1025 bertho 1.8 {
1026     char nb[32];
1027     char nr[32];
1028     char *base;
1029 bertho 1.30 char *exp;
1030 bertho 1.22 int l;
1031     char ch;
1032 bertho 1.8
1033     if(!s)
1034     return xstrdup("");
1035    
1036 bertho 1.30 zap_string();
1037 bertho 1.8
1038     sprintf(nb, "%d", rcs->nbranches);
1039     sprintf(nr, "%d", rcs->nsrev);
1040     for(; *s; s++)
1041     {
1042     if(*s == '%')
1043     {
1044     switch(*++s)
1045     {
1046 bertho 1.12 case 'c':
1047     case 'C':
1048     add_string_str(conf.cvsroot);
1049     if(*s == 'C' && conf.cvsroot[0] && conf.cvsroot[strlen(conf.cvsroot)-1] == '/')
1050     {
1051     /* Strip the trailing '/' */
1052     _nstring--;
1053     _string[_nstring] = '\0';
1054     }
1055     break;
1056 bertho 1.8 case 'f':
1057     case 'F':
1058     base = strrchr(rcs->file, '/');
1059     if(!base)
1060     add_string_str(rcs->file);
1061     else
1062     add_string_str(base+1);
1063     if(*s == 'F' && _string[_nstring-1] == 'v' && _string[_nstring-2] == ',')
1064     {
1065     _nstring -= 2;
1066     _string[_nstring] = '\0';
1067     }
1068     break;
1069     case 'p':
1070     base = strrchr(rcs->file, '/');
1071     if(base)
1072     {
1073     char *c = xstrdup(rcs->file);
1074     base = strrchr(c, '/');
1075     assert(base != NULL);
1076     base[1] = '\0';
1077     add_string_str(c);
1078     xfree(c);
1079     }
1080 bertho 1.9 /*
1081     * We should not add anything here because we can encounter
1082     * a completely empty path, in which case we do not want
1083 bertho 1.17 * to add any slash. This prevents an inadvertent root redirect.
1084 bertho 1.9 *
1085     * else
1086     * add_string_str("/");
1087     */
1088 bertho 1.8 break;
1089 bertho 1.12 case 'm':
1090     case 'M':
1091     add_string_str(conf.cvsmodule);
1092     if(*s == 'M' && conf.cvsmodule[0] && conf.cvsmodule[strlen(conf.cvsmodule)-1] == '/')
1093     {
1094     /* Strip the trailing '/' */
1095     _nstring--;
1096     _string[_nstring] = '\0';
1097     }
1098     break;
1099 bertho 1.8 case 'r': add_string_str(nr); break;
1100     case 'b': add_string_str(nb); break;
1101     case '%': add_string_ch('%'); break;
1102     case '0': if(conf.expand[0]) add_string_str(conf.expand[0]); break;
1103     case '1': if(conf.expand[1]) add_string_str(conf.expand[1]); break;
1104     case '2': if(conf.expand[2]) add_string_str(conf.expand[2]); break;
1105     case '3': if(conf.expand[3]) add_string_str(conf.expand[3]); break;
1106     case '4': if(conf.expand[4]) add_string_str(conf.expand[4]); break;
1107     case '5': if(conf.expand[5]) add_string_str(conf.expand[5]); break;
1108     case '6': if(conf.expand[6]) add_string_str(conf.expand[6]); break;
1109     case '7': if(conf.expand[7]) add_string_str(conf.expand[7]); break;
1110     case '8': if(conf.expand[8]) add_string_str(conf.expand[8]); break;
1111     case '9': if(conf.expand[9]) add_string_str(conf.expand[9]); break;
1112     case 'R': if(rev && rev->rev) add_string_str(rev->rev); break;
1113 bertho 1.9 case 'P': if(prev && prev->rev) add_string_str(prev->rev); break;
1114 bertho 1.8 case 'B': if(rev && rev->branch) add_string_str(rev->branch); break;
1115     case 't': if(tag && tag->tag) add_string_str(tag->tag); break;
1116 bertho 1.9 case 'd': if(r && r->delta && r->delta->date) add_string_date(r->delta->date); break;
1117     case 's': if(r && r->delta && r->delta->state) add_string_str(r->delta->state); break;
1118     case 'a': if(r && r->delta && r->delta->author) add_string_str(r->delta->author); break;
1119 bertho 1.22 case 'L':
1120     case 'l':
1121     ch = *s;
1122     l = 0;
1123     if(s[1] == '[')
1124     {
1125     char *cptr = strchr(s, ']');
1126     char *eptr;
1127     if(cptr)
1128     {
1129     l = strtol(&s[2], &eptr, 10);
1130     if(eptr != cptr)
1131     l = 0;
1132     else
1133     s = cptr;
1134     }
1135     }
1136     if(!conf.parse_logs)
1137     add_string_str("N/A");
1138     else if(r && r->dtext && r->dtext->log)
1139     {
1140     if(ch == 'l')
1141     add_string_str_html(r->dtext->log, l);
1142     else
1143     add_string_str_len(r->dtext->log, abs(l));
1144     }
1145     break;
1146 bertho 1.30 case '(':
1147     base = dup_string();
1148     exp = expand_string(s+1, rcs, r, rev, prev, tag);
1149     zap_string();
1150     add_string_str(base);
1151     add_string_str_html(exp, 0);
1152     xfree(base);
1153     xfree(exp);
1154     /* Find the %) in this recursion level */
1155     for(; *s; s++)
1156     {
1157     if(*s == '%' && s[1] == ')')
1158     break;
1159     }
1160     if(!*s)
1161     {
1162     s--; /* To end outer loop */
1163     if(!quiet)
1164     fprintf(stderr, "string expand: Missing %%) in expansion\n");
1165     }
1166     break;
1167     case ')':
1168     return dup_string();
1169 bertho 1.8 default:
1170     add_string_ch('%');
1171     add_string_ch(*s);
1172     break;
1173     }
1174     }
1175     else
1176     add_string_ch(*s);
1177     }
1178 bertho 1.30 return dup_string();
1179 bertho 1.8 }
1180    
1181     /*
1182     **************************************************************************
1183 bertho 1.1 * Drawing routines
1184     **************************************************************************
1185     */
1186 bertho 1.19 static int get_swidth(const char *s, font_t *f)
1187 bertho 1.1 {
1188 bertho 1.9 int n;
1189     int m;
1190     if(!s || !*s)
1191 bertho 1.1 return 0;
1192 bertho 1.19
1193     #if defined(HAVE_GDIMAGESTRINGFT) || defined(HAVE_GDIMAGESTRINGTTF)
1194     if(conf.use_ttf && f->ttfont)
1195     {
1196     int bb[8];
1197     char *e;
1198     #ifdef HAVE_GDIMAGESTRINGFT
1199     e = gdImageStringFT(NULL, bb, 0, f->ttfont, f->ttsize, 0.0, 0, 0, (char *)s);
1200     #else
1201     e = gdImageStringTTF(NULL, bb, 0, f->ttfont, f->ttsize, 0.0, 0, 0, (char *)s);
1202     #endif
1203     if(!e)
1204     return bb[2] - bb[6];
1205     }
1206     #endif
1207 bertho 1.9 for(n = m = 0; *s; n++, s++)
1208     {
1209     if(*s == '\n')
1210     {
1211     if(n > m)
1212     m = n;
1213     n = 0;
1214     }
1215     }
1216     if(n > m)
1217     m = n;
1218 bertho 1.22 return f->gdfont ? m * f->gdfont->w : m;
1219 bertho 1.1 }
1220    
1221 bertho 1.19 static int get_sheight(const char *s, font_t *f)
1222 bertho 1.1 {
1223     int nl;
1224 bertho 1.9 if(!s || !*s)
1225 bertho 1.1 return 0;
1226 bertho 1.19
1227     #if defined(HAVE_GDIMAGESTRINGFT) || defined(HAVE_GDIMAGESTRINGTTF)
1228     if(conf.use_ttf && f->ttfont)
1229     {
1230     int bb[8];
1231     char *e;
1232     #ifdef HAVE_GDIMAGESTRINGFT
1233     e = gdImageStringFT(NULL, bb, 0, f->ttfont, f->ttsize, 0.0, 0, 0, (char *)s);
1234     #else
1235     e = gdImageStringTTF(NULL, bb, 0, f->ttfont, f->ttsize, 0.0, 0, 0, (char *)s);
1236     #endif
1237     if(!e)
1238     return bb[3] - bb[7] + 4;
1239     }
1240     #endif
1241 bertho 1.1 for(nl = 1; *s; s++)
1242     {
1243     if(*s == '\n' && s[1])
1244     nl++;
1245     }
1246 bertho 1.19 return nl * f->gdfont->h;
1247 bertho 1.1 }
1248    
1249 bertho 1.19 static void draw_rbox(gdImagePtr im, int x1, int y1, int x2, int y2, int r, color_t *color, color_t *bgcolor)
1250 bertho 1.1 {
1251     int r2 = 2*r;
1252     gdImageLine(im, x1+r, y1, x2-r, y1, color->id);
1253     gdImageLine(im, x1+r, y2, x2-r, y2, color->id);
1254     gdImageLine(im, x1, y1+r, x1, y2-r, color->id);
1255     gdImageLine(im, x2, y1+r, x2, y2-r, color->id);
1256 bertho 1.9 if(conf.box_shadow)
1257     {
1258     gdImageLine(im, x1+r+1, y2+1, x2-r, y2+1, black_color.id);
1259     gdImageLine(im, x2+1, y1+r+1, x2+1, y2-r, black_color.id);
1260     }
1261 bertho 1.1 if(r)
1262     {
1263 bertho 1.18 /* FIXME: Pixelization is not perfect */
1264 bertho 1.1 gdImageArc(im, x1+r, y1+r, r2, r2, 180, 270, color->id);
1265     gdImageArc(im, x2-r, y1+r, r2, r2, 270, 360, color->id);
1266     gdImageArc(im, x1+r, y2-r, r2, r2, 90, 180, color->id);
1267 bertho 1.9 if(conf.box_shadow)
1268     {
1269     gdImageArc(im, x2-r+1, y2-r+1, r2, r2, 0, 90, black_color.id);
1270 bertho 1.18 gdImageArc(im, x2-r+1, y2-r, r2, r2, 0, 90, black_color.id);
1271     gdImageArc(im, x2-r, y2-r+1, r2, r2, 0, 90, black_color.id);
1272 bertho 1.9 }
1273 bertho 1.18 gdImageArc(im, x2-r, y2-r, r2, r2, 0, 90, color->id);
1274 bertho 1.1 }
1275 bertho 1.19 #ifndef NOGDFILL
1276 bertho 1.9 gdImageFillToBorder(im, (x1+x2)/2, (y1+y2)/2, color->id, bgcolor->id);
1277 bertho 1.19 #endif
1278 bertho 1.1 }
1279    
1280 bertho 1.19 static void draw_string(gdImagePtr im, char *s, font_t *f, int x, int y, int align, color_t *c)
1281 bertho 1.1 {
1282 bertho 1.19 int h = get_sheight(s, f);
1283 bertho 1.1 int xx, yy;
1284     switch(align & ALIGN_HX)
1285     {
1286     default:
1287     case ALIGN_HL: xx = 0; break;
1288     case ALIGN_HC: xx = -get_swidth(s, f)/2; break;
1289     case ALIGN_HR: xx = -get_swidth(s, f); break;
1290     }
1291     switch(align & ALIGN_VX)
1292     {
1293     default:
1294     case ALIGN_VT: yy = 0; break;
1295 bertho 1.19 case ALIGN_VC: yy = h/2; break;
1296     case ALIGN_VB: yy = h; break;
1297 bertho 1.1 }
1298 bertho 1.19 #if defined(HAVE_GDIMAGESTRINGFT) || defined(HAVE_GDIMAGESTRINGTTF)
1299     if(conf.use_ttf && f->ttfont)
1300     {
1301     int bb[8];
1302     char *e;
1303     int cid = conf.anti_alias ? c->id : -c->id;
1304     #ifdef HAVE_GDIMAGESTRINGFT
1305     e = gdImageStringFT(im, bb, cid, f->ttfont, f->ttsize, 0.0, x+xx, y+yy+h-2, (char *)s);
1306     #else
1307     e = gdImageStringTTF(im, bb, cid, f->ttfont, f->ttsize, 0.0, x+xx, y+yy+h-2, (char *)s);
1308     #endif
1309     if(!e)
1310     return;
1311     }
1312     #endif
1313     yy = -yy;
1314     gdImageString(im, f->gdfont, x+xx+1, y+yy, s, c->id);
1315 bertho 1.1 }
1316    
1317 bertho 1.19 static void draw_stringnl(gdImagePtr im, char *s, font_t *f, int x, int y, int align, color_t *c)
1318 bertho 1.9 {
1319     char *t;
1320     char *d;
1321     d = s = xstrdup(s);
1322     do
1323     {
1324     t = strchr(s, '\n');
1325     if(t)
1326     *t = '\0';
1327     draw_string(im, s, f, x, y, align, c);
1328     y += get_sheight(s, f);
1329     s = t+1;
1330     } while(t);
1331     xfree(d);
1332     }
1333    
1334 bertho 1.19 static void draw_rev(gdImagePtr im, revision_t *r)
1335 bertho 1.1 {
1336 bertho 1.25 int lx;
1337     int rx;
1338     int x2;
1339 bertho 1.1 int i;
1340 bertho 1.25 int ty;
1341    
1342     if(conf.left_right)
1343     {
1344     lx = r->cx;
1345     rx = r->cx + r->w;
1346     ty = r->y - r->h/2;
1347     x2 = r->cx + r->w/2;
1348     }
1349     else
1350     {
1351     lx = r->cx - r->w/2;
1352     rx = lx + r->w;
1353     ty = r->y;
1354     x2 = r->cx;
1355     }
1356 bertho 1.9 draw_rbox(im, lx, ty, rx, ty+r->h, 0, &conf.rev_color, &conf.rev_bgcolor);
1357 bertho 1.1 ty += conf.rev_tspace;
1358 bertho 1.25 draw_string(im, r->rev->rev, &conf.rev_font, x2, ty, ALIGN_HC, &conf.rev_color);
1359 bertho 1.1 ty += get_sheight(r->rev->rev, &conf.rev_font);
1360 bertho 1.25 draw_stringnl(im, r->revtext, &conf.rev_text_font, x2, ty, ALIGN_HC, &conf.rev_text_color);
1361 bertho 1.9 ty += get_sheight(r->revtext, &conf.rev_text_font);
1362 bertho 1.1 for(i = 0; i < r->ntags; i++)
1363     {
1364 bertho 1.25 draw_string(im, r->tags[i]->tag, &conf.tag_font, x2, ty, ALIGN_HC, &conf.tag_color);
1365 bertho 1.19 ty += get_sheight(r->tags[i]->tag, &conf.tag_font) + conf.rev_separator;
1366 bertho 1.1 }
1367     }
1368    
1369 bertho 1.26 static void draw_branch_box(gdImagePtr im, branch_t *b, int xp, int yp)
1370 bertho 1.1 {
1371 bertho 1.25 int lx;
1372     int rx;
1373 bertho 1.16 int i;
1374 bertho 1.1 int yy;
1375 bertho 1.25 int x2;
1376 bertho 1.16
1377 bertho 1.25 if(conf.left_right)
1378     {
1379     lx = b->cx;
1380     rx = lx + b->w;
1381     x2 = b->cx + b->w/2;
1382     }
1383     else
1384     {
1385     lx = b->cx - b->w/2;
1386     rx = lx + b->w;
1387     x2 = b->cx;
1388     }
1389 bertho 1.26 draw_rbox(im, lx+xp, yp, rx+xp, yp+b->h, 5, &conf.branch_color, &conf.branch_bgcolor);
1390 bertho 1.1 yy = conf.branch_tspace;
1391 bertho 1.26 draw_string(im, b->branch->branch, &conf.branch_font, x2+xp, yp+yy, ALIGN_HC, &conf.branch_color);
1392 bertho 1.7 yy += get_sheight(b->branch->branch, &conf.branch_font);
1393     for(i = 0; i < b->ntags; i++)
1394 bertho 1.1 {
1395 bertho 1.26 draw_string(im, b->tags[i]->tag, &conf.branch_tag_font, x2+xp, yp+yy, ALIGN_HC, &conf.branch_tag_color);
1396 bertho 1.7 yy += get_sheight(b->tags[i]->tag, &conf.branch_font);
1397 bertho 1.1 }
1398 bertho 1.16 }
1399    
1400 bertho 1.19 static void draw_branch(gdImagePtr im, branch_t *b)
1401 bertho 1.16 {
1402 bertho 1.25 int yy, xx;
1403 bertho 1.16 int i;
1404 bertho 1.17 int line[4];
1405 bertho 1.20 int l;
1406     int sign;
1407 bertho 1.17
1408     line[0] = conf.rev_color.id;
1409     line[1] = gdTransparent;
1410     line[1] = gdTransparent;
1411     line[3] = conf.rev_color.id;
1412    
1413 bertho 1.26 draw_branch_box(im, b, 0, conf.left_right ? b->y - b->h/2 : b->y);
1414 bertho 1.1
1415 bertho 1.25 if(conf.left_right)
1416 bertho 1.16 {
1417 bertho 1.25 if(conf.upside_down)
1418 bertho 1.16 {
1419 bertho 1.25 xx = b->cx;
1420     for(i = 0; i < b->nrevs; i++)
1421 bertho 1.20 {
1422 bertho 1.25 revision_t *r = b->revs[i];
1423     gdImageSetStyle(im, line, r->stripped ? 4 : 1);
1424     gdImageLine(im, xx, r->y, r->cx+r->w, r->y, gdStyled);
1425     for(sign = l = 1; l < conf.thick_lines; l++)
1426     {
1427     int pp = (l+1)/2*sign;
1428     gdImageLine(im, xx, r->y+pp, r->cx+r->w, r->y+pp, gdStyled);
1429     sign *= -1;
1430     }
1431     draw_rev(im, r);
1432     xx = r->cx;
1433     }
1434     if(conf.branch_dupbox)
1435     {
1436     i = b->cx - b->tw + b->w;
1437 bertho 1.26 gdImageLine(im, xx, b->y, i+b->w, b->y, conf.rev_color.id);
1438 bertho 1.25 for(sign = l = 1; l < conf.thick_lines; l++)
1439     {
1440     int pp = (l+1)/2*sign;
1441 bertho 1.26 gdImageLine(im, xx, b->y+pp, i+b->w, b->y+pp, conf.rev_color.id);
1442 bertho 1.25 sign *= -1;
1443     }
1444 bertho 1.26 draw_branch_box(im, b, i - b->cx, b->y - b->h/2);
1445 bertho 1.20 }
1446 bertho 1.16 }
1447 bertho 1.25 else
1448 bertho 1.16 {
1449 bertho 1.25 xx = b->cx + b->w;
1450     for(i = 0; i < b->nrevs; i++)
1451     {
1452     revision_t *r = b->revs[i];
1453     gdImageSetStyle(im, line, r->stripped ? 4 : 1);
1454     gdImageLine(im, xx, r->y, r->cx, r->y, gdStyled);
1455     for(sign = l = 1; l < conf.thick_lines; l++)
1456     {
1457     int pp = (l+1)/2*sign;
1458     gdImageLine(im, xx, r->y+pp, r->cx, r->y+pp, gdStyled);
1459     sign *= -1;
1460     }
1461     draw_rev(im, r);
1462     xx = r->cx + r->w;
1463     }
1464     if(conf.branch_dupbox)
1465 bertho 1.20 {
1466 bertho 1.25 i = b->cx + b->tw - b->w;
1467     gdImageLine(im, xx, b->y, i, b->y, conf.rev_color.id);
1468     for(sign = l = 1; l < conf.thick_lines; l++)
1469     {
1470     int pp = (l+1)/2*sign;
1471     gdImageLine(im, xx, b->y+pp, i, b->y+pp, conf.rev_color.id);
1472     sign *= -1;
1473     }
1474 bertho 1.26 draw_branch_box(im, b, i - b->cx, b->y - b->h/2);
1475 bertho 1.20 }
1476 bertho 1.16 }
1477     }
1478     else
1479 bertho 1.1 {
1480 bertho 1.25 if(conf.upside_down)
1481 bertho 1.16 {
1482 bertho 1.25 yy = b->y;
1483     for(i = 0; i < b->nrevs; i++)
1484 bertho 1.20 {
1485 bertho 1.25 revision_t *r = b->revs[i];
1486     gdImageSetStyle(im, line, r->stripped ? 4 : 1);
1487     gdImageLine(im, r->cx, yy, r->cx, r->y+r->h, gdStyled);
1488     for(sign = l = 1; l < conf.thick_lines; l++)
1489     {
1490     int pp = (l+1)/2*sign;
1491     gdImageLine(im, r->cx+pp, yy, r->cx+pp, r->y+r->h, gdStyled);
1492     sign *= -1;
1493     }
1494     draw_rev(im, r);
1495     yy = r->y;
1496     }
1497     if(conf.branch_dupbox)
1498     {
1499     i = b->y - b->th + b->h;
1500     gdImageLine(im, b->cx, yy, b->cx, i, conf.rev_color.id);
1501     for(sign = l = 1; l < conf.thick_lines; l++)
1502     {
1503     int pp = (l+1)/2*sign;
1504     gdImageLine(im, b->cx+pp, yy, b->cx+pp, i, conf.rev_color.id);
1505     sign *= -1;
1506     }
1507 bertho 1.26 draw_branch_box(im, b, 0, i);
1508 bertho 1.20 }
1509 bertho 1.16 }
1510 bertho 1.25 else
1511 bertho 1.16 {
1512 bertho 1.25 yy = b->y + b->h;
1513     for(i = 0; i < b->nrevs; i++)
1514     {
1515     revision_t *r = b->revs[i];
1516     gdImageSetStyle(im, line, r->stripped ? 4 : 1);
1517     gdImageLine(im, r->cx, yy, r->cx, r->y, gdStyled);
1518     for(sign = l = 1; l < conf.thick_lines; l++)
1519     {
1520     int pp = (l+1)/2*sign;
1521     gdImageLine(im, r->cx+pp, yy, r->cx+pp, r->y, gdStyled);
1522     sign *= -1;
1523     }
1524     draw_rev(im, r);
1525     yy = r->y + r->h;
1526     }
1527     if(conf.branch_dupbox)
1528 bertho 1.20 {
1529 bertho 1.25 i = b->y + b->th - b->h;
1530     gdImageLine(im, b->cx, yy, b->cx, i, conf.rev_color.id);
1531     for(sign = l = 1; l < conf.thick_lines; l++)
1532     {
1533     int pp = (l+1)/2*sign;
1534     gdImageLine(im, b->cx+pp, yy, b->cx+pp, i, conf.rev_color.id);
1535     sign *= -1;
1536     }
1537 bertho 1.26 draw_branch_box(im, b, 0, i);
1538 bertho 1.20 }
1539 bertho 1.16 }
1540 bertho 1.1 }
1541     }
1542    
1543 bertho 1.19 static void draw_connector(gdImagePtr im, branch_t *b)
1544 bertho 1.1 {
1545 bertho 1.20 int l;
1546     int sign;
1547 bertho 1.1 revision_t *r = b->branchpoint;
1548 bertho 1.7 int x1 = r->cx + r->w/2 + 2;
1549 bertho 1.1 int y1 = r->y + r->h/2;
1550 bertho 1.7 int x2 = b->cx;
1551 bertho 1.1 int y2 = b->y;
1552 bertho 1.25
1553     if(conf.left_right)
1554     {
1555     x2 = r->cx + r->w/2;
1556 bertho 1.26 y2 = r->y + r->h/2 + 3;
1557 bertho 1.25 x1 = b->cx;
1558     y1 = b->y;
1559     if(conf.upside_down)
1560     x1 += b->w;
1561     }
1562     else
1563     {
1564     x1 = r->cx + r->w/2 + 2;
1565     y1 = r->y + r->h/2;
1566     x2 = b->cx;
1567     y2 = b->y;
1568     if(conf.upside_down)
1569     y2 += b->h;
1570     }
1571 bertho 1.1 gdImageLine(im, x1, y1, x2, y1, conf.branch_color.id);
1572     gdImageLine(im, x2, y1, x2, y2, conf.branch_color.id);
1573 bertho 1.20 for(sign = l = 1; l < conf.thick_lines; l++)
1574     {
1575     int pp = (l+1)/2*sign;
1576 bertho 1.26 gdImageLine(im, x1, y1+pp, x2, y1+pp, conf.branch_color.id);
1577     gdImageLine(im, x2+pp, y1, x2+pp, y2, conf.branch_color.id);
1578 bertho 1.20 sign *= -1;
1579     }
1580 bertho 1.1 }
1581    
1582 bertho 1.31 static void draw_merges(gdImagePtr im, rcsfile_t *rcs, int dot)
1583 bertho 1.30 {
1584     int i;
1585     for(i = 0; i < rcs->nmerges; i++)
1586     {
1587     revision_t *fr = rcs->merges[i].from->logrev;
1588     revision_t *tr = rcs->merges[i].to->logrev;
1589     int x1, x2, y1, y2;
1590 bertho 1.31 if(!fr || !tr || fr == tr)
1591     continue; /* This can happen with detached tags and self-references */
1592 bertho 1.30 if(conf.left_right)
1593     {
1594     if(fr->y < tr->y)
1595     {
1596     y1 = fr->y + fr->h/2;
1597     y2 = tr->y - tr->h/2;
1598     }
1599     else
1600     {
1601     y1 = fr->y - fr->h/2;
1602     y2 = tr->y + tr->h/2;
1603     }
1604     x1 = fr->cx + fr->w/2;
1605     x2 = tr->cx + tr->w/2;
1606     }
1607     else
1608     {
1609     if(fr->cx < tr->cx)
1610     {
1611     x1 = fr->cx + fr->w/2;
1612     x2 = tr->cx - tr->w/2;
1613     }
1614     else
1615     {
1616     x1 = fr->cx - fr->w/2;
1617     x2 = tr->cx + tr->w/2;
1618     }
1619 bertho 1.31 y1 = fr->y + rcs->merges[i].from->yofs;
1620     y2 = tr->y + rcs->merges[i].to->yofs;
1621 bertho 1.30 }
1622 bertho 1.31 if(dot)
1623 bertho 1.30 {
1624 bertho 1.31 int o = conf.left_right ? 1 : 0;
1625     gdImageArc(im, x2, y2+o, 8, 8, 0, 360, conf.merge_color.id);
1626     gdImageFillToBorder(im, x2+1, y2+o+1, conf.merge_color.id, conf.merge_color.id);
1627 bertho 1.30 }
1628     else
1629     {
1630 bertho 1.31 if(conf.left_right)
1631 bertho 1.30 {
1632 bertho 1.31 if(y1 > y2)
1633     {
1634     gdImageLine(im, x1, y1, x1, y1-3, conf.merge_color.id);
1635     gdImageLine(im, x2, y2+1, x2, y2+3+1, conf.merge_color.id);
1636     gdImageLine(im, x1, y1-3, x2, y2+3+1, conf.merge_color.id);
1637     }
1638     else
1639     {
1640     gdImageLine(im, x1, y1+1, x1, y1+3+1, conf.merge_color.id);
1641     gdImageLine(im, x2, y2, x2, y2-3, conf.merge_color.id);
1642     gdImageLine(im, x1, y1+3+1, x2, y2-3, conf.merge_color.id);
1643     }
1644 bertho 1.30 }
1645     else
1646     {
1647 bertho 1.31 if(x1 > x2)
1648     {
1649     gdImageLine(im, x1, y1, x1-3, y1, conf.merge_color.id);
1650     gdImageLine(im, x2, y2, x2+3, y2, conf.merge_color.id);
1651     gdImageLine(im, x1-3, y1, x2+3, y2, conf.merge_color.id);
1652     }
1653     else
1654     {
1655     gdImageLine(im, x1, y1, x1+3, y1, conf.merge_color.id);
1656     gdImageLine(im, x2, y2, x2-3, y2, conf.merge_color.id);
1657     gdImageLine(im, x1+3, y1, x2-3, y2, conf.merge_color.id);
1658     }
1659 bertho 1.30 }
1660     }
1661     }
1662     }
1663    
1664 bertho 1.19 static void alloc_color(gdImagePtr im, color_t *c)
1665 bertho 1.9 {
1666     c->id = gdImageColorAllocate(im, c->r, c->g, c->b);
1667     }
1668    
1669 bertho 1.7 gdImagePtr make_image(rcsfile_t *rcs)
1670 bertho 1.1 {
1671     gdImagePtr im;
1672     int i;
1673 bertho 1.8 char *cptr;
1674 bertho 1.1
1675 bertho 1.15 cptr = expand_string(conf.title, rcs, NULL, NULL, NULL, NULL);
1676     i = get_swidth(cptr, &conf.title_font);
1677     if(rcs->tw+conf.margin_left+conf.margin_right > i)
1678     i = rcs->tw+conf.margin_left+conf.margin_right;
1679     im = gdImageCreate(i, rcs->th+conf.margin_top+conf.margin_bottom);
1680 bertho 1.9 alloc_color(im, &conf.color_bg);
1681     alloc_color(im, &conf.tag_color);
1682     alloc_color(im, &conf.rev_color);
1683     alloc_color(im, &conf.rev_bgcolor);
1684     alloc_color(im, &conf.rev_text_color);
1685     alloc_color(im, &conf.branch_color);
1686 bertho 1.19 alloc_color(im, &conf.branch_tag_color);
1687 bertho 1.9 alloc_color(im, &conf.branch_bgcolor);
1688     alloc_color(im, &conf.title_color);
1689 bertho 1.30 alloc_color(im, &conf.merge_color);
1690 bertho 1.9 alloc_color(im, &black_color);
1691     alloc_color(im, &white_color);
1692 bertho 1.1
1693 bertho 1.19 if(conf.transparent_bg)
1694     gdImageColorTransparent(im, conf.color_bg.id);
1695    
1696 bertho 1.30 if(!conf.merge_front)
1697 bertho 1.31 draw_merges(im, rcs, 0);
1698 bertho 1.30
1699 bertho 1.1 for(i = 0; i < rcs->nbranches; i++)
1700 bertho 1.16 draw_branch(im, rcs->branches[i]);
1701 bertho 1.31
1702     draw_merges(im, rcs, 1); /* The dots of the merge dest */
1703    
1704 bertho 1.1 for(i = 0; i < rcs->nbranches; i++)
1705     {
1706     if(rcs->branches[i]->branchpoint)
1707     draw_connector(im, rcs->branches[i]);
1708     }
1709 bertho 1.9 draw_stringnl(im, cptr, &conf.title_font, conf.title_x, conf.title_y, conf.title_align, &conf.title_color);
1710 bertho 1.8 xfree(cptr);
1711 bertho 1.1
1712 bertho 1.30 if(conf.merge_front)
1713 bertho 1.31 draw_merges(im, rcs, 0);
1714 bertho 1.30
1715 bertho 1.1 return im;
1716     }
1717    
1718 bertho 1.7 /*
1719     **************************************************************************
1720     * Layout routines
1721 bertho 1.19 *
1722     * Branch BBox:
1723     * left = center_x - total_width / 2 (cx-tw)/2
1724     * right = center_x + total_width / 2 (cx+tw)/2
1725     * top = y_pos (y)
1726     * bottom = y_pos + total_height (y+th)
1727     *
1728     * Margins of branches:
1729     *
1730     * . .
1731     * . .
1732     * +--------------+
1733     * ^
1734     * | branch_margin .
1735     * v .
1736     * ----------------+ .
1737     * | ^ |
1738     * | | branch_connect |
1739     * | v |
1740     *..-+ +t-----+------+ +------+------+
1741     * | l | | |
1742     * | <--> | branch bbox | <--> | branch bbox |
1743     * | | | r | | |
1744     *..-+ | +------------b+ | +-------------+
1745     * | ^ branch_margin
1746     * | | branch_margin
1747     * | v
1748     * | +-------------+
1749     * | . .
1750     * | . .
1751     * |
1752     * branch_margin
1753     *
1754     * FIXME: There are probable som +/-1 errors in the code...
1755     * (notably shadows are not calculated in the margins)
1756 bertho 1.7 **************************************************************************
1757     */
1758 bertho 1.19 static void move_branch(branch_t *b, int x, int y)
1759 bertho 1.1 {
1760     int i;
1761 bertho 1.7 b->cx += x;
1762 bertho 1.1 b->y += y;
1763     for(i = 0; i < b->nrevs; i++)
1764     {
1765 bertho 1.7 b->revs[i]->cx += x;
1766 bertho 1.1 b->revs[i]->y += y;
1767     }
1768     }
1769    
1770 bertho 1.19 static void initial_reposition_branch(revision_t *r, int *x, int *w)
1771 bertho 1.6 {
1772     int i, j;
1773     for(j = 0; j < r->nbranches; j++)
1774     {
1775     branch_t *b = r->branches[j];
1776 bertho 1.7 *x += *w + conf.rev_minline + b->tw/2 - b->cx;
1777 bertho 1.6 *w = b->tw/2;
1778 bertho 1.7 move_branch(b, *x, r->y + r->h/2 + conf.branch_connect);
1779     *x = b->cx;
1780 bertho 1.6 /* Recurse to move branches of branched revisions */
1781     for(i = b->nrevs-1; i >= 0; i--)
1782     {
1783 bertho 1.18 initial_reposition_branch(b->revs[i], x, w);
1784 bertho 1.6 }
1785     }
1786     }
1787    
1788 bertho 1.25 static void initial_reposition_branch_lr(revision_t *r, int *y, int *h)
1789     {
1790     int i, j;
1791     for(j = 0; j < r->nbranches; j++)
1792     {
1793     branch_t *b = r->branches[j];
1794     *y += *h + conf.rev_minline + b->th/2 - b->y;
1795     *h = b->th/2;
1796     move_branch(b, r->cx + r->w/2 + conf.branch_connect, *y);
1797     *y = b->y;
1798     /* Recurse to move branches of branched revisions */
1799     for(i = b->nrevs-1; i >= 0; i--)
1800     {
1801     initial_reposition_branch(b->revs[i], y, h);
1802     }
1803     }
1804     }
1805    
1806 bertho 1.19 static void rect_union(int *x, int *y, int *w, int *h, branch_t *b)
1807 bertho 1.1 {
1808     int x1 = *x;
1809     int x2 = x1 + *w;
1810     int y1 = *y;
1811     int y2 = y1 + *h;
1812 bertho 1.25 int xx1;
1813     int xx2;
1814     int yy1;
1815     int yy2;
1816    
1817     if(conf.left_right)
1818     {
1819     xx1 = b->cx;
1820     yy1 = b->y - b->th/2;
1821     }
1822     else
1823     {
1824     xx1 = b->cx - b->tw/2;
1825     yy1 = b->y;
1826     }
1827     xx2 = xx1 + b->tw;
1828     yy2 = yy1 + b->th;
1829    
1830 bertho 1.1 x1 = MIN(x1, xx1);
1831     x2 = MAX(x2, xx2);
1832     y1 = MIN(y1, yy1);
1833     y2 = MAX(y2, yy2);
1834     *x = x1;
1835     *y = y1;
1836     *w = x2 - x1;
1837     *h = y2 - y1;
1838     }
1839    
1840 bertho 1.19 static int branch_intersects(int top, int bottom, int left, branch_t *b)
1841 bertho 1.7 {
1842     int br = b->cx + b->tw/2;
1843     int bt = b->y - conf.branch_connect - conf.branch_margin/2;
1844     int bb = b->y + b->th + conf.branch_margin/2;
1845     return !(bt > bottom || bb < top || br >= left);
1846     }
1847    
1848 bertho 1.25 static int branch_intersects_lr(int left, int right, int top, branch_t *b)
1849     {
1850     int bt = b->y + b->th/2;
1851     int bl = b->cx - conf.branch_connect - conf.branch_margin/2;
1852     int br = b->cx + b->tw + conf.branch_margin/2;
1853     return !(bl > right || br < left || bt >= top);
1854     }
1855    
1856 bertho 1.19 static int kern_branch(rcsfile_t *rcs, branch_t *b)
1857 bertho 1.7 {
1858     int left = b->cx - b->tw/2;
1859     int top = b->y - conf.branch_connect - conf.branch_margin/2;
1860     int bottom = b->y + b->th + conf.branch_margin/2;
1861     int i;
1862     int xpos = 0;
1863    
1864     for(i = 0; i < rcs->nbranches; i++)
1865     {
1866     branch_t *bp = rcs->branches[i];
1867     if(bp == b)
1868     continue;
1869     if(branch_intersects(top, bottom, left, bp))
1870     {
1871     int m = bp->cx + bp->tw/2 + conf.branch_margin;
1872     if(m > xpos)
1873     xpos = m;
1874     }
1875     }
1876     if(xpos && (b->cx - b->tw/2) - xpos > 0)
1877     {
1878     move_branch(b, xpos - (b->cx - b->tw/2), 0);
1879     return 1;
1880     }
1881     return 0;
1882     }
1883    
1884 bertho 1.25 static int kern_branch_lr(rcsfile_t *rcs, branch_t *b)
1885     {
1886     int top = b->y - b->th/2;
1887     int left = b->cx - conf.branch_connect - conf.branch_margin/2;
1888     int right = b->cx + b->tw + conf.branch_margin/2;
1889     int i;
1890     int ypos = 0;
1891    
1892     for(i = 0; i < rcs->nbranches; i++)
1893     {
1894     branch_t *bp = rcs->branches[i];
1895     if(bp == b)
1896     continue;
1897     if(branch_intersects_lr(left, right, top, bp))
1898     {
1899     int m = bp->y + bp->th/2 + conf.branch_margin;
1900     if(m > ypos)
1901     ypos = m;
1902     }
1903     }
1904     if(ypos && (b->y - b->th/2) - ypos > 0)
1905     {
1906     move_branch(b, 0, ypos - (b->y - b->th/2));
1907     return 1;
1908     }
1909     return 0;
1910     }
1911    
1912 bertho 1.19 static int kern_tree(rcsfile_t *rcs)
1913 bertho 1.18 {
1914     int i;
1915     int moved;
1916 bertho 1.19 int safeguard;
1917     int totalmoved = 0;
1918     for(moved = 1, safeguard = LOOPSAFEGUARD; moved && safeguard; safeguard--)
1919 bertho 1.18 {
1920     moved = 0;
1921     for(i = 1; i < rcs->nbranches; i++)
1922     {
1923 bertho 1.25 if(conf.left_right)
1924     moved += kern_branch_lr(rcs, rcs->branches[i]);
1925     else
1926     moved += kern_branch(rcs, rcs->branches[i]);
1927 bertho 1.18 }
1928 bertho 1.19 totalmoved += moved;
1929 bertho 1.18 #ifdef DEBUG
1930     fprintf(stderr, "kern_tree: moved=%d\n", moved);
1931     #endif
1932     }
1933 bertho 1.19 if(!quiet && !safeguard)
1934     fprintf(stderr, "kern_tree: safeguard terminated possible infinite loop; please report.\n");
1935     return totalmoved;
1936     }
1937    
1938     static int index_of_revision(revision_t *r)
1939     {
1940     branch_t *b = r->branch;
1941     int i;
1942     for(i = 0; i < b->nrevs; i++)
1943     {
1944     if(r == b->revs[i])
1945     return i;
1946     }
1947     fprintf(stderr, "index_of_revision: Cannot find revision in branch\n");
1948     return 0;
1949 bertho 1.18 }
1950    
1951 bertho 1.19 static void branch_bbox(branch_t *br, int *l, int *r, int *t, int *b)
1952     {
1953     if(l) *l = br->cx - br->tw/2;
1954     if(r) *r = br->cx + br->tw/2;
1955     if(t) *t = br->y;
1956     if(b) *b = br->y + br->th + (conf.branch_dupbox ? conf.rev_minline + br->h : 0);
1957     }
1958    
1959     static void branch_ext_bbox(branch_t *br, int *l, int *r, int *t, int *b)
1960     {
1961     int extra = conf.branch_margin & 1; /* Correct +/-1 error on div 2 */
1962     branch_bbox(br, l, r, t, b);
1963     if(l) *l -= conf.branch_margin/2;
1964     if(r) *r += conf.branch_margin/2 + extra;
1965     if(t) *t -= conf.branch_connect + conf.branch_margin/2;
1966     if(b) *b += conf.branch_margin/2 + extra;
1967     }
1968    
1969     static int branch_distance(branch_t *br1, branch_t *br2)
1970     {
1971     int l1, r1, t1, b1;
1972     int l2, r2, t2, b2;
1973     assert(br1 != NULL);
1974     assert(br2 != NULL);
1975     branch_bbox(br1, &l1, &r1, NULL, NULL);
1976     branch_bbox(br2, &l2, &r2, NULL, NULL);
1977     branch_ext_bbox(br1, NULL, NULL, &t1, &b1);
1978     branch_ext_bbox(br2, NULL, NULL, &t2, &b2);
1979     /* Return:
1980     * - 0 if branches have no horizontal overlap
1981     * - positive if b1 is left of b2
1982     * - negative if b2 is left of b1
1983     */
1984     if((t1 > t2 && t1 < b2) || (b1 > t2 && b1 < b2))
1985     return l1 < l2 ? l2 - r1 : -(l1 - r2);
1986     else
1987     return 0;
1988     }
1989    
1990     static int space_needed(branch_t *br1, branch_t *br2)
1991     {
1992     int t1, b1;
1993     int t2, b2;
1994     assert(br1 != NULL);
1995     assert(br2 != NULL);
1996     assert(br1->cx < br2->cx); /* br1 must be left of br2 */
1997     branch_ext_bbox(br1, NULL, NULL, &t1, &b1);
1998     branch_ext_bbox(br2, NULL, NULL, &t2, &b2);
1999     /* Return:
2000     * - positive if top br1 is located lower than br2
2001     * - negatve is top br2 is located lower than br1
2002     */
2003     if(t1 > t2)
2004     return -(t1 - b2);
2005     else
2006     return t2 - b1;
2007     }
2008    
2009     static void move_yr_branch(branch_t *b, int dy)
2010 bertho 1.18 {
2011     int i, j;
2012     #ifdef DEBUG
2013 bertho 1.23 /* fprintf(stderr, "move_yr_branch: b=%s, dy=%d\n", b->branch->branch, dy);*/
2014 bertho 1.18 #endif
2015 bertho 1.19 b->y += dy;
2016     for(i = 0; i < b->nrevs; i++)
2017 bertho 1.18 {
2018 bertho 1.19 b->revs[i]->y += dy;
2019     for(j = 0; j < b->revs[i]->nbranches; j++)
2020 bertho 1.18 {
2021 bertho 1.19 #ifdef DEBUG
2022 bertho 1.23 /* fprintf(stderr, ".");*/
2023 bertho 1.19 #endif
2024     move_yr_branch(b->revs[i]->branches[j], dy);
2025 bertho 1.18 }
2026     }
2027     }
2028    
2029 bertho 1.19 static void move_trunk(revision_t *r, int dy)
2030 bertho 1.18 {
2031 bertho 1.19 int i, j;
2032 bertho 1.18 branch_t *b = r->branch;
2033 bertho 1.19 b->th += dy;
2034     for(i = index_of_revision(r); i < b->nrevs; i++)
2035 bertho 1.18 {
2036 bertho 1.19 #ifdef DEBUG
2037     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);
2038     #endif
2039     b->revs[i]->y += dy;
2040     for(j = 0; j < b->revs[i]->nbranches; j++)
2041     {
2042     move_yr_branch(b->revs[i]->branches[j], dy);
2043     }
2044 bertho 1.18 }
2045     }
2046    
2047 bertho 1.19 static int space_below(rcsfile_t *rcs, revision_t *r)
2048 bertho 1.18 {
2049 bertho 1.19 int i, j;
2050     int bl, br, bb;
2051 bertho 1.18 int space = INT_MAX;
2052 bertho 1.19 branch_t *b = r->branch;
2053     branch_t *minb = NULL;
2054    
2055     branch_ext_bbox(b, &bl, &br, NULL, &bb);
2056 bertho 1.18 for(i = 0; i < rcs->nbranches; i++)
2057     {
2058 bertho 1.19 int tbl, tbr, tbt;
2059 bertho 1.18 branch_t *tb = rcs->branches[i];
2060 bertho 1.19 branch_ext_bbox(tb, &tbl, &tbr, &tbt, NULL);
2061 bertho 1.18 if(tb == b)
2062     continue;
2063 bertho 1.19 if(tbt > bb) /* Must be below our branch */
2064 bertho 1.18 {
2065 bertho 1.19 if(tb->branchpoint) /* Take account for the horiz connector */
2066     tbl = tb->branchpoint->cx + tb->branchpoint->branch->tw/2;
2067     if((bl >= tbl && bl <= tbr) || (br <= tbr && br >= tbl))
2068 bertho 1.18 {
2069 bertho 1.19 int s = tbt - bb - conf.branch_connect;
2070     if(s < space)
2071 bertho 1.18 {
2072 bertho 1.19 space = s;
2073     minb = tb;
2074 bertho 1.18 }
2075     }
2076     }
2077     }
2078 bertho 1.19 if(b->branchpoint)
2079     {
2080     for(i = index_of_revision(r); i < b->nrevs; i++)
2081     {
2082     for(j = 0; j < b->revs[i]->nbranches; j++)
2083     {
2084     int s = space_below(rcs, b->revs[i]->branches[j]->revs[0]);
2085     if(s < space)
2086     space = s;
2087     }
2088     }
2089     }
2090     #ifdef DEBUG
2091     fprintf(stderr, "space_below: from %s have %d to %s\n", b->branch->branch, space, minb ? minb->branch->branch : "<recursed>");
2092     #endif
2093 bertho 1.18 return space;
2094     }
2095    
2096 bertho 1.19 static int space_available(rcsfile_t *rcs, branch_t *colbr, branch_t *tagbr, int *nl, revision_t **bpcommon)
2097 bertho 1.18 {
2098 bertho 1.19 int i;
2099     int space = 0;
2100     int nlinks = 0;
2101     revision_t *r;
2102     branch_t *b;
2103     branch_t *ancestor;
2104     revision_t *branchpoint;
2105    
2106     if(!tagbr->branchpoint || !colbr->branchpoint)
2107 bertho 1.18 {
2108 bertho 1.19 if(!quiet)
2109     fprintf(stderr, "space_available: Trying to stretch the top?\n");
2110     return 0;
2111 bertho 1.18 }
2112 bertho 1.19
2113     r = colbr->branchpoint;
2114     b = r->branch;
2115     branchpoint = tagbr->branchpoint;
2116     ancestor = branchpoint->branch;
2117     assert(b != NULL);
2118     assert(ancestor != NULL);
2119    
2120     while(1)
2121 bertho 1.18 {
2122 bertho 1.19 int s;
2123     int rtag = b == ancestor ? index_of_revision(branchpoint)+1 : 0;
2124     for(i = index_of_revision(r); i >= rtag; i--)
2125 bertho 1.18 {
2126 bertho 1.19 if(i > 0)
2127     s = b->revs[i]->y - (b->revs[i-1]->y + b->revs[i-1]->h);
2128     else
2129     s = b->revs[i]->y - (b->y + b->h);
2130     if(s < conf.rev_maxline)
2131     {
2132     space += conf.rev_maxline - s;
2133     nlinks++;
2134     }
2135 bertho 1.18 }
2136 bertho 1.19 s = space_below(rcs, r);
2137     if(s < space)
2138     space = s;
2139     #ifdef DEBUG
2140     if(space < 0)
2141     return -1;
2142     #endif
2143     if(b == ancestor)
2144     break;
2145     r = b->branchpoint;
2146     if(!r)
2147     {
2148     /* Not a common ancestor */
2149     r = colbr->branchpoint;
2150     b = r->branch;
2151     branchpoint = ancestor->branchpoint;
2152     if(!branchpoint)
2153     {
2154     if(!quiet)
2155     fprintf(stderr, "space_available: No common ancestor?\n");
2156     return 0;
2157     }
2158     ancestor = branchpoint->branch;
2159     assert(ancestor != NULL);
2160     nlinks = 0;
2161     space = 0;
2162     continue; /* Restart with a new ancestor */
2163     }
2164     b = r->branch;
2165     }
2166     if(nl)
2167     *nl = nlinks; /* Return the number of links that can stretch */
2168     if(bpcommon)
2169     *bpcommon = branchpoint; /* Return the ancestral branchpoint on the common branch */
2170     return space;
2171 bertho 1.18 }
2172    
2173 bertho 1.19 static int stretch_branches(rcsfile_t *rcs, branch_t *br1, branch_t *br2, int totalstretch)
2174 bertho 1.18 {
2175 bertho 1.19 revision_t *r;
2176     revision_t *bpcommon = NULL;
2177     branch_t *ancestor = NULL;
2178     branch_t *b;
2179 bertho 1.18 int i;
2180 bertho 1.19 int space;
2181     int nlinks;
2182     int dy;
2183     int rest;
2184    
2185     space = space_available(rcs, br1, br2, &nlinks, &bpcommon);
2186     if(bpcommon)
2187     ancestor = bpcommon->branch;
2188    
2189     #ifdef DEBUG
2190     if(space == -1)
2191     return 0;
2192     fprintf(stderr, "stretch_branches: space available %d over %d links common %s\n", space, nlinks, ancestor->branch->branch);
2193     #endif
2194     if(space < totalstretch)
2195     return 0;
2196    
2197     dy = totalstretch / nlinks;
2198     rest = totalstretch - dy * nlinks;
2199    
2200     r = br1->branchpoint;
2201     b = r->branch;
2202     while(1)
2203 bertho 1.18 {
2204 bertho 1.19 int rtag = b == ancestor ? index_of_revision(bpcommon)+1 : 0;
2205     for(i = index_of_revision(r); i >= rtag; i--)
2206     {
2207     int s, q;
2208     if(i > 0)
2209     s = b->revs[i]->y - (b->revs[i-1]->y + b->revs[i-1]->h);
2210     else
2211     s = b->revs[i]->y - (b->y + b->h);
2212     q = conf.rev_maxline - s;
2213     if(q > 0)
2214     {
2215     int d = rest ? rest/nlinks+1 : 0;
2216     if(q >= dy+d)
2217     {
2218     move_trunk(b->revs[i], dy+d);
2219     }
2220     else
2221     {
2222     move_trunk(b->revs[i], q);
2223     rest += dy+d - q;
2224     }
2225     rest -= d;
2226     nlinks--;
2227     }
2228     }
2229     if(b == ancestor)
2230     break;
2231     r = b->branchpoint;
2232     assert(r != NULL); /* else 'space_available' wouldn't have returned positively */
2233     b = r->branch;
2234 bertho 1.18 }
2235 bertho 1.19 return 1;
2236 bertho 1.18 }
2237    
2238 bertho 1.19 static branch_t *find_collision_branch(rcsfile_t *rcs, branch_t *b)
2239 bertho 1.18 {
2240     int i;
2241 bertho 1.19 int dist = INT_MAX;
2242     branch_t *col = NULL;
2243    
2244 bertho 1.18 for(i = 0; i < rcs->nbranches; i++)
2245     {
2246 bertho 1.19 int t = branch_distance(rcs->branches[i], b);
2247     if(t > 0 && t < dist)
2248 bertho 1.18 {
2249 bertho 1.19 dist = t;
2250     col = rcs->branches[i];
2251 bertho 1.18 }
2252     }
2253 bertho 1.19 return col;
2254 bertho 1.18 }
2255    
2256 bertho 1.19 void auto_stretch(rcsfile_t *rcs)
2257 bertho 1.18 {
2258 bertho 1.19 int i;
2259     int safeguard;
2260 bertho 1.18
2261 bertho 1.19 for(i = 0, safeguard = LOOPSAFEGUARD; i < rcs->nbranches && safeguard; i++)
2262 bertho 1.18 {
2263 bertho 1.19 int bl, pr;
2264     branch_t *b = rcs->branches[i];
2265     if(!b->branchpoint)
2266     continue;
2267     branch_bbox(b, &bl, NULL, NULL, NULL);
2268     branch_bbox(b->branchpoint->branch, NULL, &pr, NULL, NULL);
2269     if(bl - conf.branch_margin - pr > 0)
2270 bertho 1.18 {
2271 bertho 1.19 branch_t *col;
2272 bertho 1.18 int spaceneeded;
2273 bertho 1.19 /* There is a potential to move branch b further left.
2274     * All branches obstructing this one from moving further
2275     * left must be originating from revisions below
2276     * b->branchpoint until a common ancester.
2277     * So, we search all branches for a branch that lies left
2278     * of b and is closest to b. This is then the collission
2279     * branch that needs to be moved.
2280     */
2281     col = find_collision_branch(rcs, b);
2282     if(!col)
2283 bertho 1.18 continue;
2284 bertho 1.19 spaceneeded = space_needed(col, b);
2285     if(spaceneeded < 0)
2286     continue;
2287     #ifdef DEBUG
2288     fprintf(stderr, "auto_stretch: %s collides %s need %d\n", b->branch->branch, col->branch->branch, spaceneeded);
2289     #endif
2290     /* Trace the collision branch back to find the common ancester
2291     * of both col and b. All revisions encountered while traversing
2292     * backwards must be stretched, including all revisions on the
2293     * common ancester from where the branches sprout.
2294     */
2295     if(stretch_branches(rcs, col, b, spaceneeded))
2296 bertho 1.18 {
2297 bertho 1.19 if(kern_tree(rcs))
2298     {
2299     /* Restart the process because movement can
2300     * cause more movement.
2301     */
2302     i = 0 - 1; /* -1 for the i++ of the loop */
2303     safeguard--; /* Prevent infinite loop, just in case */
2304     }
2305 bertho 1.23 /*return;*/
2306 bertho 1.18 }
2307     }
2308     }
2309 bertho 1.19 if(!quiet && !safeguard)
2310     fprintf(stderr, "auto_stretch: safeguard terminated possible infinite loop; please report.\n");
2311 bertho 1.18 }
2312    
2313 bertho 1.7 void make_layout(rcsfile_t *rcs)
2314 bertho 1.1 {
2315     int i, j;
2316     int x, y;
2317     int w, h;
2318     int w2;
2319    
2320 bertho 1.16 /* Remove all unwanted revisions */
2321     if(conf.strip_untagged)
2322     {
2323 bertho 1.21 int fr = conf.strip_first_rev ? 0 : 1;
2324 bertho 1.16 for(i = 0; i < rcs->nbranches; i++)
2325     {
2326     branch_t *bp = rcs->branches[i];
2327 bertho 1.18 for(j = fr; j < bp->nrevs-1; j++)
2328 bertho 1.16 {
2329     if(!bp->revs[j]->ntags && !bp->revs[j]->nbranches)
2330     {
2331     memmove(&bp->revs[j], &bp->revs[j+1], (bp->nrevs-j-1) * sizeof(bp->revs[0]));
2332     bp->nrevs--;
2333 bertho 1.17 bp->revs[j]->stripped = 1;
2334 bertho 1.16 j--;
2335     }
2336     }
2337     }
2338     }
2339    
2340 bertho 1.1 /* Calculate the box-sizes of the revisions */
2341 bertho 1.7 for(i = 0; i < rcs->nsrev; i++)
2342 bertho 1.1 {
2343     revision_t *rp;
2344     int w;
2345     int h;
2346 bertho 1.7 rp = rcs->srev[i];
2347 bertho 1.9 rp->revtext = expand_string(conf.rev_text, rcs, rp, rp->rev, NULL, rp->ntags ? rp->tags[0] : NULL);
2348     w = get_swidth(rp->revtext, &conf.rev_text_font);
2349     j = get_swidth(rp->rev->rev, &conf.rev_font);
2350     if(j > w)
2351     w = j;
2352     h = get_sheight(rp->revtext, &conf.rev_text_font) + get_sheight(rp->rev->rev, &conf.rev_font);
2353 bertho 1.1 for(j = 0; j < rp->ntags; j++)
2354     {
2355     int ww = get_swidth(rp->tags[j]->tag, &conf.tag_font);
2356 bertho 1.31 int th;
2357 bertho 1.1 if(ww > w) w = ww;
2358 bertho 1.31 th = get_sheight(rp->tags[j]->tag, &conf.tag_font) + conf.rev_separator;
2359     rp->tags[j]->yofs = h + th/2 + conf.rev_tspace;
2360     h += th;
2361 bertho 1.1 }
2362     rp->w = w + conf.rev_lspace + conf.rev_rspace;
2363     rp->h = h + conf.rev_tspace + conf.rev_bspace;
2364     }
2365    
2366     /* Calculate the box-sizes of the branches */
2367     for(i = 0; i < rcs->nbranches; i++)
2368     {
2369     branch_t *bp = rcs->branches[i];
2370     int w;
2371     int h;
2372 bertho 1.7 w = get_swidth(bp->branch->branch, &conf.branch_font);
2373     h = get_sheight(bp->branch->branch, &conf.branch_font);
2374     for(j = 0; j < bp->ntags; j++)
2375 bertho 1.1 {
2376 bertho 1.19 int ww = get_swidth(bp->tags[j]->tag, &conf.branch_tag_font);
2377 bertho 1.1 if(ww > w) w = ww;
2378 bertho 1.19 h += get_sheight(bp->tags[j]->tag, &conf.branch_tag_font);
2379 bertho 1.1 }
2380     w += conf.branch_lspace + conf.branch_rspace;
2381     h += conf.branch_tspace + conf.branch_bspace;
2382     bp->w = w;
2383     bp->h = h;
2384 bertho 1.25 if(conf.left_right)
2385     {
2386     for(j = 0; j < bp->nrevs; j++)
2387     {
2388     if(bp->revs[j]->h > h)
2389     h = bp->revs[j]->h;
2390     w += bp->revs[j]->w + conf.rev_minline;
2391     }
2392     if(conf.branch_dupbox)
2393     w += bp->w + conf.rev_minline;
2394     }
2395     else
2396 bertho 1.1 {
2397 bertho 1.25 for(j = 0; j < bp->nrevs; j++)
2398     {
2399     if(bp->revs[j]->w > w)
2400     w = bp->revs[j]->w;
2401     h += bp->revs[j]->h + conf.rev_minline;
2402     }
2403     if(conf.branch_dupbox)
2404     h += bp->h + conf.rev_minline;
2405 bertho 1.1 }
2406     bp->th = h;
2407     bp->tw = w;
2408     }
2409    
2410     /* Calculate the relative positions of revs in a branch */
2411 bertho 1.25 if(conf.left_right)
2412     {
2413     for(i = 0; i < rcs->nbranches; i++)
2414     {
2415     branch_t *b = rcs->branches[i];
2416     y = b->th/2;
2417     x = b->w;
2418     b->y = y;
2419     b->cx = 0;
2420     for(j = 0; j < b->nrevs; j++)
2421     {
2422     x += conf.rev_minline;
2423     b->revs[j]->y = y;
2424     b->revs[j]->cx = x;
2425     x += b->revs[j]->w;
2426     }
2427     }
2428     }
2429     else
2430 bertho 1.1 {
2431 bertho 1.25 for(i = 0; i < rcs->nbranches; i++)
2432     {
2433     branch_t *b = rcs->branches[i];
2434     x = b->tw/2;
2435     y = b->h;
2436     b->cx = x;
2437     b->y = 0;
2438     for(j = 0; j < b->nrevs; j++)
2439     {
2440     y += conf.rev_minline;
2441     b->revs[j]->cx = x;
2442     b->revs[j]->y = y;
2443     y += b->revs[j]->h;
2444     }
2445 bertho 1.1 }
2446     }
2447    
2448 bertho 1.18 /* Initially reposition the branches from bottom to top progressively right */
2449 bertho 1.25 if(conf.left_right)
2450     {
2451     x = rcs->branches[0]->y;
2452     w2 = rcs->branches[0]->th / 2;
2453     for(i = rcs->branches[0]->nrevs-1; i >= 0; i--)
2454     {
2455     initial_reposition_branch_lr(rcs->branches[0]->revs[i], &x, &w2);
2456     }
2457     }
2458     else
2459 bertho 1.1 {
2460 bertho 1.25 x = rcs->branches[0]->cx;
2461     w2 = rcs->branches[0]->tw / 2;
2462     for(i = rcs->branches[0]->nrevs-1; i >= 0; i--)
2463     {
2464     initial_reposition_branch(rcs->branches[0]->revs[i], &x, &w2);
2465     }
2466 bertho 1.1 }
2467    
2468 bertho 1.19 /* Initially move branches left if there is room */
2469     kern_tree(rcs);
2470    
2471 bertho 1.18 /* Try to kern the branches more by expanding the inter-revision spacing */
2472 bertho 1.25 if(conf.auto_stretch && !conf.left_right)
2473 bertho 1.19 auto_stretch(rcs);
2474 bertho 1.7
2475     /* Move everything w.r.t. the top-left margin */
2476 bertho 1.1 for(i = 0; i < rcs->nbranches; i++)
2477     move_branch(rcs->branches[i], conf.margin_left, conf.margin_top);
2478    
2479     /* Calculate overall image size */
2480 bertho 1.25 if(conf.left_right)
2481     {
2482     x = rcs->branches[0]->cx;
2483     y = rcs->branches[0]->y - rcs->branches[0]->th/2;
2484     }
2485     else
2486     {
2487     x = rcs->branches[0]->cx - rcs->branches[0]->tw/2;
2488     y = rcs->branches[0]->y;
2489     }
2490 bertho 1.1 w = rcs->branches[0]->tw;
2491     h = rcs->branches[0]->th;
2492     for(i = 1; i < rcs->nbranches; i++)
2493     rect_union(&x, &y, &w, &h, rcs->branches[i]);
2494     rcs->tw = w;
2495     rcs->th = h;
2496 bertho 1.16
2497     /* Flip the entire tree */
2498     if(conf.upside_down)
2499     {
2500 bertho 1.25 if(conf.left_right)
2501     {
2502     x += rcs->tw;
2503     for(i = 0; i < rcs->nbranches; i++)
2504     {
2505     branch_t *b = rcs->branches[i];
2506     for(j = 0; j < b->nrevs; j++)
2507     {
2508     revision_t *r = b->revs[j];
2509 bertho 1.26 r->cx = x - r->cx - r->w + conf.margin_left;
2510 bertho 1.25 }
2511 bertho 1.26 b->cx = x - b->cx - b->w + conf.margin_left;
2512 bertho 1.25 }
2513     }
2514     else
2515 bertho 1.16 {
2516 bertho 1.25 y += rcs->th;
2517     for(i = 0; i < rcs->nbranches; i++)
2518 bertho 1.16 {
2519 bertho 1.25 branch_t *b = rcs->branches[i];
2520     for(j = 0; j < b->nrevs; j++)
2521     {
2522     revision_t *r = b->revs[j];
2523     r->y = y - r->y - r->h + conf.margin_top;
2524     }
2525     b->y = y - b->y - b->h + conf.margin_top;
2526 bertho 1.16 }
2527     }
2528     }
2529 bertho 1.1 }
2530    
2531     /*
2532     **************************************************************************
2533 bertho 1.6 * Imagemap functions
2534     **************************************************************************
2535     */
2536 bertho 1.26 void make_imagemap(rcsfile_t *rcs, FILE *fp, gdImagePtr im)
2537 bertho 1.6 {
2538     int i, j;
2539 bertho 1.29 const char *htp = conf.html_level == HTMLLEVEL_X ? " /" : "";
2540    
2541     switch(conf.html_level)
2542     {
2543     case HTMLLEVEL_4:
2544     fprintf(fp, "<map name=\"%s\" id=\"%s\">\n", conf.map_name, conf.map_name);
2545     break;
2546     case HTMLLEVEL_X:
2547     fprintf(fp, "<map id=\"%s\">\n", conf.map_name);
2548     break;
2549     default:
2550     fprintf(fp, "<map name=\"%s\">\n", conf.map_name);
2551     }
2552    
2553 bertho 1.6 for(i = 0; i < rcs->nbranches; i++)
2554     {
2555     branch_t *b = rcs->branches[i];
2556 bertho 1.8 tag_t *tag = b->ntags ? b->tags[0] : NULL;
2557 bertho 1.16 char *bhref = expand_string(conf.map_branch_href, rcs, NULL, b->branch, NULL, tag);
2558     char *balt = expand_string(conf.map_branch_alt, rcs, NULL, b->branch, NULL, tag);
2559 bertho 1.26 int x1;
2560     int x2;
2561     int y1;
2562     int y2;
2563    
2564     if(conf.left_right)
2565     {
2566     x1 = b->cx;
2567     y1 = b->y - b->h/2;
2568     x2 = b->cx + b->w;
2569     y2 = b->y + b->h/2;
2570     }
2571     else
2572     {
2573     x1 = b->cx - b->w/2;
2574     y1 = b->y;
2575     x2 = b->cx + b->w/2;
2576     y2 = b->y + b->h;
2577     }
2578 bertho 1.29 fprintf(fp, "\t<area shape=\"rect\" %s coords=\"%d,%d,%d,%d\" %s%s>\n",
2579     bhref, x1, y1, x2, y2, balt, htp);
2580 bertho 1.26 if(im)
2581     {
2582     gdImageFilledRectangle(im, x1-2, y1-2, x1+2, y1+2, conf.title_color.id);
2583     gdImageFilledRectangle(im, x2-2, y2-2, x2+2, y2+2, conf.tag_color.id);
2584     gdImageLine(im, x1, y1, x2, y2, conf.title_color.id);
2585     }
2586 bertho 1.6 for(j = 0; j < b->nrevs; j++)
2587     {
2588     revision_t *r = b->revs[j];
2589 bertho 1.13 revision_t* r1;
2590 bertho 1.26 int xoff = 1;
2591     int yoff = 1;
2592 bertho 1.16 char *href;
2593     char *alt;
2594 bertho 1.13
2595 bertho 1.8 tag = r->ntags ? r->tags[0] : NULL;
2596 bertho 1.9 href = expand_string(conf.map_rev_href, rcs, r, r->rev, NULL, tag);
2597     alt = expand_string(conf.map_rev_alt, rcs, r, r->rev, NULL, tag);
2598 bertho 1.26 if(conf.left_right)
2599     {
2600     x1 = r->cx;
2601     y1 = r->y - r->h/2;
2602     x2 = r->cx + r->w;
2603     y2 = r->y + r->h/2;
2604     }
2605     else
2606     {
2607     x1 = r->cx - r->w/2;
2608     y1 = r->y;
2609     x2 = r->cx + r->w/2;
2610     y2 = r->y + r->h;
2611     }
2612 bertho 1.29 fprintf(fp, "\t<area shape=\"rect\" %s coords=\"%d,%d,%d,%d\" %s%s>\n",
2613     href, x1, y1, x2, y2, alt, htp);
2614 bertho 1.26 if(im)
2615     {
2616     gdImageFilledRectangle(im, x1-2, y1-2, x1+2, y1+2, conf.title_color.id);
2617     gdImageFilledRectangle(im, x2-2, y2-2, x2+2, y2+2, conf.tag_color.id);
2618     gdImageLine(im, x1, y1, x2, y2, conf.title_color.id);
2619     }
2620 bertho 1.8 xfree(href);
2621     xfree(alt);
2622 bertho 1.16 if(j > 0 || b->branchpoint)
2623 bertho 1.9 {
2624 bertho 1.16 if(j > 0)
2625     {
2626     r1 = b->revs[j-1];
2627 bertho 1.26 if(conf.left_right)
2628     {
2629     yoff = MIN(r->h, r1->h)/4;
2630     x1 = conf.upside_down ? r1->cx : r1->cx + r1->w;
2631     }
2632     else
2633     {
2634     xoff = MIN(r->w, r1->w)/4;
2635     y1 = conf.upside_down ? r1->y : r1->y + r1->h;
2636     }
2637 bertho 1.16 }
2638     else
2639     {
2640     r1 = b->branchpoint;
2641 bertho 1.26 if(conf.left_right)
2642     {
2643     yoff = MIN(r->h, b->h)/4;
2644     x1 = conf.upside_down ? b->cx : b->cx + b->w;
2645     }
2646     else
2647     {
2648     xoff = MIN(r->w, b->w)/4;
2649     y1 = conf.upside_down ? b->y : b->y + b->h;
2650     }
2651     }
2652     if(conf.left_right)
2653     {
2654     y1 = r->y - yoff;
2655     y2 = r->y + yoff;
2656     x2 = conf.upside_down ? r->cx + r->w : r->cx;
2657     yoff = 0;
2658     }
2659     else
2660     {
2661     x1 = r->cx - xoff;
2662     x2 = r->cx + xoff;
2663     y2 = conf.upside_down ? r->y + r->h : r->y;
2664     xoff = 0;
2665     }
2666     if(x1 > x2)
2667     {
2668     int tt = x1;
2669     x1 = x2;
2670     x2 = tt;
2671     }
2672     if(y1 > y2)
2673     {
2674     int tt = y1;
2675     y1 = y2;
2676     y2 = tt;
2677 bertho 1.16 }
2678     href = expand_string(conf.map_diff_href, rcs, r, r->rev, r1->rev, tag);
2679     alt = expand_string(conf.map_diff_alt, rcs, r, r->rev, r1->rev, tag);
2680 bertho 1.29 fprintf(fp, "\t<area shape=\"rect\" %s coords=\"%d,%d,%d,%d\" %s%s>\n",
2681 bertho 1.16 href,
2682 bertho 1.26 x1+xoff, y1+yoff, x2-xoff, y2-yoff,
2683 bertho 1.29 alt, htp);
2684 bertho 1.26 if(im)
2685     {
2686     gdImageFilledRectangle(im, x1-2, y1-2, x1+2, y1+2, conf.title_color.id);
2687     gdImageFilledRectangle(im, x2-2, y2-2, x2+2, y2+2, conf.tag_color.id);
2688     gdImageLine(im, x1, y1, x2, y2, conf.title_color.id);
2689     }
2690 bertho 1.16 xfree(href);
2691     xfree(alt);
2692 bertho 1.9 }
2693 bertho 1.6 }
2694 bertho 1.17 if(conf.branch_dupbox)
2695 bertho 1.16 {
2696 bertho 1.26 if(conf.left_right)
2697     {
2698     x1 = conf.upside_down ? b->cx + b->w - b->tw : b->cx - b->w + b->tw;
2699     y1 = b->y - b->h/2;
2700     x2 = x1 + b->w;
2701     y2 = b->y + b->h/2;
2702     }
2703 bertho 1.16 else
2704 bertho 1.26 {
2705     x1 = b->cx - b->w/2;
2706     y1 = conf.upside_down ? b->y + b->h - b->th : b->y - b->h + b->th;
2707     x2 = b->cx + b->w/2;
2708     y2 = y1 + b->h;
2709     }
2710 bertho 1.29 fprintf(fp, "\t<area shape=\"rect\" %s coords=\"%d,%d,%d,%d\" %s%s>\n",
2711     bhref, x1, y1, x2, y2, balt, htp);
2712 bertho 1.26 if(im)
2713     {
2714     gdImageFilledRectangle(im, x1-2, y1-2, x1+2, y1+2, conf.title_color.id);
2715     gdImageFilledRectangle(im, x2-2, y2-2, x2+2, y2+2, conf.tag_color.id);
2716     gdImageLine(im, x1, y1, x2, y2, conf.title_color.id);
2717     }
2718 bertho 1.16 }
2719     xfree(bhref);
2720     xfree(balt);
2721 bertho 1.6 }
2722     fprintf(fp, "</map>\n");
2723     }
2724    
2725     /*
2726     **************************************************************************
2727 bertho 1.1 * Program entry
2728     **************************************************************************
2729     */
2730     static const char usage_str[] =
2731     "Usage: cvsgraph [options] <file>\n"
2732 bertho 1.16 " -b Add a branch box at both sides of the trunk (config value is negated)\n"
2733 bertho 1.8 " -c <file> Read alternative config from <file>\n"
2734     " -d <level> Enable debug mode at <level>\n"
2735     " -h This message\n"
2736     " -i Generate an imagemap instead of image\n"
2737 bertho 1.18 " -I <file> Also write the imagemap to <file>\n"
2738 bertho 1.19 " -k Auto stretch the tree (config value is negated)\n"
2739 bertho 1.8 " -M <name> Use <name> as imagemap name\n"
2740     " -m <mod> Use <mod> as cvs module\n"
2741     " -o <file> Output to <file>\n"
2742 bertho 1.18 " -O <opt=val> Set option opt to value val\n"
2743 bertho 1.8 " -q Be quiet (i.e. no warnings)\n"
2744     " -r <path> Use <path> as cvsroot path\n"
2745 bertho 1.16 " -s Strip untagged revisions (config value is negated)\n"
2746 bertho 1.18 " -S Also strip the first revision (config value is negated)\n"
2747 bertho 1.16 " -u Upside down image (mirror vertically; config value is negated)\n"
2748 bertho 1.8 " -V Print version and exit\n"
2749 bertho 1.29 " -x [34x] Specify level of HTML 3.2 (default), 4.0 or XHTML\n"
2750 bertho 1.8 " -[0-9] <txt> Use <txt> for expansion\n"
2751 bertho 1.1 ;
2752    
2753 bertho 1.29 #define VERSION_STR "1.3.1"
2754     #define NOTICE_STR "Copyright (c) 2001,2002,2003 B.Stultiens"
2755 bertho 1.1
2756 bertho 1.19 static void append_slash(char **path)
2757 bertho 1.9 {
2758     int l;
2759     assert(path != NULL);
2760     assert(*path != NULL);
2761     l = strlen(*path);
2762     if(!l || (*path)[l-1] == '/')
2763     return;
2764     *path = xrealloc(*path, l+2);
2765     strcat(*path, "/");
2766     }
2767    
2768 bertho 1.1 int main(int argc, char *argv[])
2769     {
2770 bertho 1.7 extern int rcs_flex_debug;
2771     extern int rcsdebug;
2772 bertho 1.1 int optc;
2773     char *confpath = NULL;
2774     char *outfile = NULL;
2775     char *cvsroot = NULL;
2776     char *cvsmodule = NULL;
2777 bertho 1.7 int imagemap = 0;
2778 bertho 1.16 int upsidedown = 0;
2779 bertho 1.17 int bdupbox = 0;
2780 bertho 1.16 int stripuntag = 0;
2781 bertho 1.18 int stripfirst = 0;
2782 bertho 1.19 int autostretch = 0;
2783 bertho 1.29 int htmllevel = 0;
2784 bertho 1.7 char *imgmapname = NULL;
2785 bertho 1.18 char *imgmapfile = NULL;
2786 bertho 1.1 int lose = 0;
2787     FILE *fp;
2788 bertho 1.18 char *rcsfilename;
2789 bertho 1.7 rcsfile_t *rcs;
2790 bertho 1.1 gdImagePtr im;
2791    
2792 bertho 1.29 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)
2793 bertho 1.1 {
2794     switch(optc)
2795     {
2796 bertho 1.16 case 'b':
2797 bertho 1.17 bdupbox = 1;
2798 bertho 1.16 break;
2799 bertho 1.1 case 'c':
2800     confpath = xstrdup(optarg);
2801     break;
2802 bertho 1.7 case 'd':
2803     debuglevel = strtol(optarg, NULL, 0);
2804     break;
2805 bertho 1.18 case 'I':
2806     imgmapfile = xstrdup(optarg);
2807     break;
2808 bertho 1.6 case 'i':
2809 bertho 1.7 imagemap = 1;
2810     break;
2811 bertho 1.18 case 'k':
2812 bertho 1.19 autostretch = 1;
2813 bertho 1.18 break;
2814 bertho 1.7 case 'M':
2815     imgmapname = xstrdup(optarg);
2816 bertho 1.6 break;
2817 bertho 1.1 case 'm':
2818     cvsmodule = xstrdup(optarg);
2819     break;
2820 bertho 1.18 case 'O':
2821     stack_option(optarg);
2822     break;
2823 bertho 1.1 case 'o':
2824     outfile = xstrdup(optarg);
2825     break;
2826 bertho 1.7 case 'q':
2827     quiet = 1;
2828     break;
2829 bertho 1.1 case 'r':
2830     cvsroot = xstrdup(optarg);
2831     break;
2832 bertho 1.18 case 'S':
2833     stripfirst = 1;
2834     break;
2835 bertho 1.16 case 's':
2836     stripuntag = 1;
2837     break;
2838     case 'u':
2839     upsidedown = 1;
2840     break;
2841 bertho 1.1 case 'V':
2842     fprintf(stdout, "cvsgraph v%s, %s\n", VERSION_STR, NOTICE_STR);
2843     return 0;
2844 bertho 1.29 case 'x':
2845     switch(optarg[0])
2846     {
2847     case '3':
2848     htmllevel = HTMLLEVEL_3;
2849     break;
2850     case '4':
2851     htmllevel = HTMLLEVEL_4;
2852     break;
2853     case 'x':
2854     htmllevel = HTMLLEVEL_X;
2855     break;
2856     default:
2857     fprintf(stderr, "Invalid HTML level in -x\n");
2858     lose++;
2859     }
2860     break;
2861 bertho 1.1 case 'h':
2862     fprintf(stdout, "%s", usage_str);
2863     return 0;
2864     default:
2865 bertho 1.8 if(isdigit(optc))
2866     {
2867     conf.expand[optc-'0'] = xstrdup(optarg);
2868     }
2869     else
2870     lose++;
2871 bertho 1.1 }
2872     }
2873    
2874     if(lose)
2875     {
2876     fprintf(stderr, "%s", usage_str);
2877     return 1;
2878     }
2879    
2880 bertho 1.7 if(debuglevel)
2881     {
2882     setvbuf(stdout, NULL, 0, _IONBF);
2883     setvbuf(stderr, NULL, 0, _IONBF);
2884     }
2885     rcs_flex_debug = (debuglevel & DEBUG_RCS_LEX) != 0;
2886     rcsdebug = (debuglevel & DEBUG_RCS_YACC) != 0;
2887    
2888 bertho 1.1 /* Set defaults */
2889 bertho 1.21 conf.tag_font.gdfont = gdFontTiny;
2890     conf.rev_font.gdfont = gdFontTiny;
2891     conf.branch_font.gdfont = gdFontTiny;
2892     conf.branch_tag_font.gdfont = gdFontTiny;
2893     conf.title_font.gdfont = gdFontTiny;
2894     conf.rev_text_font.gdfont = gdFontTiny;
2895    
2896 bertho 1.19 conf.anti_alias = 1;
2897 bertho 1.20 conf.thick_lines = 1;
2898 bertho 1.9
2899     conf.cvsroot = xstrdup("");
2900     conf.cvsmodule = xstrdup("");
2901     conf.date_format = xstrdup("%d-%b-%Y %H:%M:%S");
2902     conf.title = xstrdup("");
2903     conf.map_name = xstrdup("CvsGraphImageMap");
2904     conf.map_branch_href = xstrdup("href=\"unset: conf.map_branch_href\"");
2905     conf.map_branch_alt = xstrdup("alt=\"%B\"");
2906     conf.map_rev_href = xstrdup("href=\"unset: conf.map_rev_href\"");
2907     conf.map_rev_alt = xstrdup("alt=\"%R\"");
2908     conf.map_diff_href = xstrdup("href=\"unset: conf.map_diff_href\"");
2909 bertho 1.12 conf.map_diff_alt = xstrdup("alt=\"%P &lt;-&gt; %R\"");
2910 bertho 1.10 conf.rev_text = xstrdup("%d");
2911 bertho 1.30 conf.merge_from = xstrdup("");
2912     conf.merge_to = xstrdup("");
2913 bertho 1.9
2914     conf.color_bg = white_color;
2915     conf.branch_bgcolor = white_color;
2916     conf.branch_color = black_color;
2917 bertho 1.19 conf.branch_tag_color = black_color;
2918 bertho 1.9 conf.rev_color = black_color;
2919     conf.rev_bgcolor = white_color;
2920 bertho 1.30 conf.merge_color = black_color;
2921 bertho 1.9 conf.tag_color = black_color;
2922     conf.title_color = black_color;
2923     conf.rev_text_color = black_color;
2924 bertho 1.10
2925     conf.image_quality = 100;
2926 bertho 1.18 conf.rev_maxline = -1; /* Checked later to set to default */
2927    
2928     read_config(confpath);
2929 bertho 1.1
2930 bertho 1.18 if(conf.rev_maxline == -1) conf.rev_maxline = 5 * conf.rev_minline;
2931 bertho 1.1
2932     /* Set overrides */
2933 bertho 1.7 if(cvsroot) conf.cvsroot = cvsroot;
2934     if(cvsmodule) conf.cvsmodule = cvsmodule;
2935     if(imgmapname) conf.map_name = imgmapname;
2936 bertho 1.16 if(upsidedown) conf.upside_down = !conf.upside_down;
2937 bertho 1.17 if(bdupbox) conf.branch_dupbox = !conf.branch_dupbox;
2938 bertho 1.16 if(stripuntag) conf.strip_untagged = !conf.strip_untagged;
2939 bertho 1.18 if(stripfirst) conf.strip_first_rev = !conf.strip_first_rev;
2940 bertho 1.19 if(autostretch) conf.auto_stretch = !conf.auto_stretch;
2941 bertho 1.29 if(htmllevel) conf.html_level = htmllevel;
2942 bertho 1.18
2943     if(conf.rev_minline >= conf.rev_maxline)
2944     {
2945 bertho 1.19 if(conf.auto_stretch && !quiet)
2946     fprintf(stderr, "Auto stretch is only possible if rev_minline < rev_maxline\n");
2947     conf.auto_stretch = 0;
2948 bertho 1.18 }
2949 bertho 1.20
2950     if(conf.thick_lines < 1)
2951     conf.thick_lines = 1;
2952     if(conf.thick_lines > 11)
2953     conf.thick_lines = 11;
2954 bertho 1.1
2955 bertho 1.9 append_slash(&conf.cvsroot);
2956     append_slash(&conf.cvsmodule);
2957    
2958 bertho 1.18 if(optind >= argc)
2959     {
2960     #ifdef __WIN32__
2961     /* Bad hack for DOS/Windows */
2962     if(setmode(fileno(stdin), O_BINARY) == -1)
2963     {
2964     perror("Set binary mode for stdin");
2965     return 1;
2966     }
2967     #endif
2968     rcsfilename = NULL;
2969     }
2970     else
2971     rcsfilename = argv[optind];
2972    
2973     rcs = get_rcsfile(conf.cvsroot, conf.cvsmodule, rcsfilename);
2974 bertho 1.1 if(!rcs)
2975     return 1;
2976    
2977 bertho 1.7 if(debuglevel & DEBUG_RCS_FILE)
2978     dump_rcsfile(rcs);
2979 bertho 1.1
2980 bertho 1.7 if(!reorganise_branches(rcs))
2981     return 1;
2982 bertho 1.1
2983 bertho 1.31 assign_tags(rcs);
2984     find_merges(rcs);
2985 bertho 1.1
2986     if(outfile)
2987     {
2988 bertho 1.15 if((fp = fopen(outfile, "wb")) == NULL)
2989 bertho 1.1 {
2990     perror(outfile);
2991     return 1;
2992     }
2993     }
2994     else
2995 bertho 1.15 {
2996 bertho 1.1 fp = stdout;
2997 bertho 1.15 #ifdef __WIN32__
2998     /* Bad hack for DOS/Windows */
2999     if(setmode(fileno(fp), O_BINARY) == -1)
3000     {
3001     perror("Set binary mode for stdout");
3002     return 1;
3003     }
3004     #endif
3005     }
3006 bertho 1.5
3007 bertho 1.7 make_layout(rcs);
3008    
3009     if(!imagemap)
3010 bertho 1.5 {
3011 bertho 1.7 /* Create an image */
3012     im = make_image(rcs);
3013 bertho 1.26 #ifdef DEBUG_IMAGEMAP
3014     {
3015     FILE *nulfile = fopen("/dev/null", "w");
3016     make_imagemap(rcs, nulfile, im);
3017     fclose(nulfile);
3018     }
3019     #endif
3020 bertho 1.7 switch(conf.image_type)
3021     {
3022 bertho 1.5 #ifdef HAVE_IMAGE_GIF
3023 bertho 1.7 # ifndef HAVE_IMAGE_PNG
3024     default:
3025     # endif
3026     case IMAGE_GIF:
3027     gdImageGif(im, fp);
3028     break;
3029 bertho 1.5 #endif
3030     #ifdef HAVE_IMAGE_PNG
3031 bertho 1.7 default:
3032     case IMAGE_PNG:
3033     gdImagePng(im, fp);
3034     break;
3035 bertho 1.5 #endif
3036     #ifdef HAVE_IMAGE_JPEG
3037     # if !defined(HAVE_IMAGE_GIF) && !defined(HAVE_IMAGE_PNG)
3038 bertho 1.7 default:
3039 bertho 1.5 # endif
3040 bertho 1.7 case IMAGE_JPEG:
3041     gdImageJpeg(im, fp, conf.image_quality);
3042     break;
3043 bertho 1.5 #endif
3044 bertho 1.7 }
3045    
3046     gdImageDestroy(im);
3047     }
3048     else
3049     {
3050     /* Create an imagemap */
3051 bertho 1.26 make_imagemap(rcs, fp, NULL);
3052 bertho 1.18 }
3053    
3054     /* Also create imagemap to file if requested */
3055     if(imgmapfile)
3056     {
3057     FILE *ifp = fopen(imgmapfile, "wb");
3058     if(!ifp)
3059     {
3060     perror(imgmapfile);
3061     return 1;
3062     }
3063 bertho 1.26 make_imagemap(rcs, ifp, NULL);
3064 bertho 1.18 fclose(ifp);
3065 bertho 1.5 }
3066    
3067 bertho 1.1 if(outfile)
3068     fclose(fp);
3069 bertho 1.6
3070 bertho 1.1 return 0;
3071     }
3072    

  ViewVC Help
Powered by ViewVC 1.1.0 with CvsGraph 1.7.0