eqn_term.c revision 1.1.1.4 
1/*	Id: eqn_term.c,v 1.8 2015/01/01 15:36:08 schwarze Exp  */
2/*
3 * Copyright (c) 2011 Kristaps Dzonsons <kristaps@bsd.lv>
4 * Copyright (c) 2014, 2015 Ingo Schwarze <schwarze@openbsd.org>
5 *
6 * Permission to use, copy, modify, and distribute this software for any
7 * purpose with or without fee is hereby granted, provided that the above
8 * copyright notice and this permission notice appear in all copies.
9 *
10 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
11 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
12 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
13 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
14 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
15 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
16 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
17 */
18#include "config.h"
19
20#include <sys/types.h>
21
22#include <assert.h>
23#include <stdio.h>
24#include <stdlib.h>
25#include <string.h>
26
27#include "mandoc.h"
28#include "out.h"
29#include "term.h"
30
31static	const enum termfont fontmap[EQNFONT__MAX] = {
32	TERMFONT_NONE, /* EQNFONT_NONE */
33	TERMFONT_NONE, /* EQNFONT_ROMAN */
34	TERMFONT_BOLD, /* EQNFONT_BOLD */
35	TERMFONT_BOLD, /* EQNFONT_FAT */
36	TERMFONT_UNDER /* EQNFONT_ITALIC */
37};
38
39static void	eqn_box(struct termp *, const struct eqn_box *);
40
41
42void
43term_eqn(struct termp *p, const struct eqn *ep)
44{
45
46	eqn_box(p, ep->root);
47	p->flags &= ~TERMP_NOSPACE;
48}
49
50static void
51eqn_box(struct termp *p, const struct eqn_box *bp)
52{
53	const struct eqn_box *child;
54
55	if (bp->type == EQN_LIST ||
56	    (bp->type == EQN_PILE && (bp->prev || bp->next)) ||
57	    (bp->parent != NULL && bp->parent->pos == EQNPOS_SQRT)) {
58		if (bp->parent->type == EQN_SUBEXPR && bp->prev != NULL)
59			p->flags |= TERMP_NOSPACE;
60		term_word(p, bp->left != NULL ? bp->left : "(");
61		p->flags |= TERMP_NOSPACE;
62	}
63	if (bp->font != EQNFONT_NONE)
64		term_fontpush(p, fontmap[(int)bp->font]);
65
66	if (bp->text != NULL)
67		term_word(p, bp->text);
68
69	if (bp->pos == EQNPOS_SQRT) {
70		term_word(p, "sqrt");
71		p->flags |= TERMP_NOSPACE;
72		eqn_box(p, bp->first);
73	} else if (bp->type == EQN_SUBEXPR) {
74		child = bp->first;
75		eqn_box(p, child);
76		p->flags |= TERMP_NOSPACE;
77		term_word(p, bp->pos == EQNPOS_OVER ? "/" :
78		    (bp->pos == EQNPOS_SUP ||
79		     bp->pos == EQNPOS_TO) ? "^" : "_");
80		p->flags |= TERMP_NOSPACE;
81		child = child->next;
82		if (child != NULL) {
83			eqn_box(p, child);
84			if (bp->pos == EQNPOS_FROMTO ||
85			    bp->pos == EQNPOS_SUBSUP) {
86				p->flags |= TERMP_NOSPACE;
87				term_word(p, "^");
88				p->flags |= TERMP_NOSPACE;
89				child = child->next;
90				if (child != NULL)
91					eqn_box(p, child);
92			}
93		}
94	} else {
95		child = bp->first;
96		if (bp->type == EQN_MATRIX && child->type == EQN_LIST)
97			child = child->first;
98		while (child != NULL) {
99			eqn_box(p,
100			    bp->type == EQN_PILE &&
101			    child->type == EQN_LIST &&
102			    child->args == 1 ?
103			    child->first : child);
104			child = child->next;
105		}
106	}
107
108	if (bp->font != EQNFONT_NONE)
109		term_fontpop(p);
110	if (bp->type == EQN_LIST ||
111	    (bp->type == EQN_PILE && (bp->prev || bp->next)) ||
112	    (bp->parent != NULL && bp->parent->pos == EQNPOS_SQRT)) {
113		p->flags |= TERMP_NOSPACE;
114		term_word(p, bp->right != NULL ? bp->right : ")");
115		if (bp->parent->type == EQN_SUBEXPR && bp->next != NULL)
116			p->flags |= TERMP_NOSPACE;
117	}
118
119	if (bp->top != NULL) {
120		p->flags |= TERMP_NOSPACE;
121		term_word(p, bp->top);
122	}
123	if (bp->bottom != NULL) {
124		p->flags |= TERMP_NOSPACE;
125		term_word(p, "_");
126	}
127}
128