Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	usr.bin/mandoc/roff_term.c	Lines:	73	108	67.6 %
Date:	2017-11-13	Branches:	38	74	51.4 %


/*	$OpenBSD: roff_term.c,v 1.14 2017/06/24 14:38:28 schwarze Exp $ */
/*
 * Copyright (c) 2010, 2014, 2015, 2017 Ingo Schwarze <schwarze@openbsd.org>
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */
#include <sys/types.h>

#include <assert.h>
#include <stddef.h>

#include "mandoc.h"
#include "roff.h"
#include "out.h"
#include "term.h"

#define	ROFF_TERM_ARGS struct termp *p, const struct roff_node *n

typedef	void	(*roff_term_pre_fp)(ROFF_TERM_ARGS);

static	void	  roff_term_pre_br(ROFF_TERM_ARGS);
static	void	  roff_term_pre_ce(ROFF_TERM_ARGS);
static	void	  roff_term_pre_ft(ROFF_TERM_ARGS);
static	void	  roff_term_pre_ll(ROFF_TERM_ARGS);
static	void	  roff_term_pre_mc(ROFF_TERM_ARGS);
static	void	  roff_term_pre_po(ROFF_TERM_ARGS);
static	void	  roff_term_pre_sp(ROFF_TERM_ARGS);
static	void	  roff_term_pre_ta(ROFF_TERM_ARGS);
static	void	  roff_term_pre_ti(ROFF_TERM_ARGS);

static	const roff_term_pre_fp roff_term_pre_acts[ROFF_MAX] = {
	roff_term_pre_br,  /* br */
	roff_term_pre_ce,  /* ce */
	roff_term_pre_ft,  /* ft */
	roff_term_pre_ll,  /* ll */
	roff_term_pre_mc,  /* mc */
	roff_term_pre_po,  /* po */
	roff_term_pre_ce,  /* rj */
	roff_term_pre_sp,  /* sp */
	roff_term_pre_ta,  /* ta */
	roff_term_pre_ti,  /* ti */
};


void
roff_term_pre(struct termp *p, const struct roff_node *n)
{
	assert(n->tok < ROFF_MAX);
	(*roff_term_pre_acts[n->tok])(p, n);
}

static void
roff_term_pre_br(ROFF_TERM_ARGS)
{
	term_newln(p);
	if (p->flags & TERMP_BRIND) {
		p->tcol->offset = p->tcol->rmargin;
		p->tcol->rmargin = p->maxrmargin;
		p->flags &= ~(TERMP_NOBREAK | TERMP_BRIND);
	}
}

static void
roff_term_pre_ce(ROFF_TERM_ARGS)
{
	const struct roff_node	*nc1, *nc2;
	size_t			 len, lm;

	roff_term_pre_br(p, n);
	lm = p->tcol->offset;
	nc1 = n->child->next;
	while (nc1 != NULL) {
		nc2 = nc1;
		len = 0;
		do {
			if (nc2->type == ROFFT_TEXT) {
				if (len)
					len++;
				len += term_strlen(p, nc2->string);
			}
			nc2 = nc2->next;
		} while (nc2 != NULL && (nc2->type != ROFFT_TEXT ||
		    (nc2->flags & NODE_LINE) == 0));
		p->tcol->offset = len >= p->tcol->rmargin ? 0 :
		    lm + len >= p->tcol->rmargin ? p->tcol->rmargin - len :
		    n->tok == ROFF_rj ? p->tcol->rmargin - len :
		    (lm + p->tcol->rmargin - len) / 2;
		while (nc1 != nc2) {
			if (nc1->type == ROFFT_TEXT)
				term_word(p, nc1->string);
			else
				roff_term_pre(p, nc1);
			nc1 = nc1->next;
		}
		p->flags |= TERMP_NOSPACE;
		term_flushln(p);
	}
	p->tcol->offset = lm;
}

static void
roff_term_pre_ft(ROFF_TERM_ARGS)
{
	switch (*n->child->string) {
	case '4':
	case '3':
	case 'B':
		term_fontrepl(p, TERMFONT_BOLD);
		break;
	case '2':
	case 'I':
		term_fontrepl(p, TERMFONT_UNDER);
		break;
	case 'P':
		term_fontlast(p);
		break;
	case '1':
	case 'C':
	case 'R':
		term_fontrepl(p, TERMFONT_NONE);
		break;
	default:
		break;
	}
}

static void
roff_term_pre_ll(ROFF_TERM_ARGS)
{
	term_setwidth(p, n->child != NULL ? n->child->string : NULL);
}

static void
roff_term_pre_mc(ROFF_TERM_ARGS)
{
	if (p->col) {
		p->flags |= TERMP_NOBREAK;
		term_flushln(p);
		p->flags &= ~(TERMP_NOBREAK | TERMP_NOSPACE);
	}
	if (n->child != NULL) {
		p->mc = n->child->string;
		p->flags |= TERMP_NEWMC;
	} else
		p->flags |= TERMP_ENDMC;
}

static void
roff_term_pre_po(ROFF_TERM_ARGS)
{
	struct roffsu	 su;
	static int	 po, polast;
	int		 ponew;

	if (n->child != NULL &&
	    a2roffsu(n->child->string, &su, SCALE_EM) != NULL) {
		ponew = term_hen(p, &su);
		if (*n->child->string == '+' ||
		    *n->child->string == '-')
			ponew += po;
	} else
		ponew = polast;
	polast = po;
	po = ponew;

	ponew = po - polast + (int)p->tcol->offset;
	p->tcol->offset = ponew > 0 ? ponew : 0;
}

static void
roff_term_pre_sp(ROFF_TERM_ARGS)
{
	struct roffsu	 su;
	int		 len;

	if (n->child != NULL) {
		if (a2roffsu(n->child->string, &su, SCALE_VS) == NULL)
			su.scale = 1.0;
		len = term_vspan(p, &su);
	} else
		len = 1;

	if (len < 0)
		p->skipvsp -= len;
	else
		while (len--)
			term_vspace(p);

	roff_term_pre_br(p, n);
}

static void
roff_term_pre_ta(ROFF_TERM_ARGS)
{
	term_tab_set(p, NULL);
	for (n = n->child; n != NULL; n = n->next)
		term_tab_set(p, n->string);
}

static void
roff_term_pre_ti(ROFF_TERM_ARGS)
{
	struct roffsu	 su;
	const char	*cp;
	int		 len, sign;

	roff_term_pre_br(p, n);

	if (n->child == NULL)
		return;
	cp = n->child->string;
	if (*cp == '+') {
		sign = 1;
		cp++;
	} else if (*cp == '-') {
		sign = -1;
		cp++;
	} else
		sign = 0;

	if (a2roffsu(cp, &su, SCALE_EM) == NULL)
		return;
	len = term_hen(p, &su);

	if (sign == 0) {
		p->ti = len - p->tcol->offset;
		p->tcol->offset = len;
	} else if (sign == 1) {
		p->ti = len;
		p->tcol->offset += len;
	} else if ((size_t)len < p->tcol->offset) {
		p->ti = -len;
		p->tcol->offset -= len;
	} else {
		p->ti = -p->tcol->offset;
		p->tcol->offset = 0;
	}
}


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: roff_term.c,v 1.14 2017/06/24 14:38:28 schwarze Exp $ */
2			/*
3			* Copyright (c) 2010, 2014, 2015, 2017 Ingo Schwarze <schwarze@openbsd.org>
4			*
5			* Permission to use, copy, modify, and distribute this software for any
6			* purpose with or without fee is hereby granted, provided that the above
7			* copyright notice and this permission notice appear in all copies.
8			*
9			* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
10			* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
11			* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
12			* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13			* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14			* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
15			* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
16			*/
17			#include <sys/types.h>
18
19			#include <assert.h>
20			#include <stddef.h>
21
22			#include "mandoc.h"
23			#include "roff.h"
24			#include "out.h"
25			#include "term.h"
26
27			#define ROFF_TERM_ARGS struct termp p, const struct roff_node n
28
29			typedef void (*roff_term_pre_fp)(ROFF_TERM_ARGS);
30
31			static void roff_term_pre_br(ROFF_TERM_ARGS);
32			static void roff_term_pre_ce(ROFF_TERM_ARGS);
33			static void roff_term_pre_ft(ROFF_TERM_ARGS);
34			static void roff_term_pre_ll(ROFF_TERM_ARGS);
35			static void roff_term_pre_mc(ROFF_TERM_ARGS);
36			static void roff_term_pre_po(ROFF_TERM_ARGS);
37			static void roff_term_pre_sp(ROFF_TERM_ARGS);
38			static void roff_term_pre_ta(ROFF_TERM_ARGS);
39			static void roff_term_pre_ti(ROFF_TERM_ARGS);
40
41			static const roff_term_pre_fp roff_term_pre_acts[ROFF_MAX] = {
42			roff_term_pre_br, /* br */
43			roff_term_pre_ce, /* ce */
44			roff_term_pre_ft, /* ft */
45			roff_term_pre_ll, /* ll */
46			roff_term_pre_mc, /* mc */
47			roff_term_pre_po, /* po */
48			roff_term_pre_ce, /* rj */
49			roff_term_pre_sp, /* sp */
50			roff_term_pre_ta, /* ta */
51			roff_term_pre_ti, /* ti */
52			};
53
54
55			void
56			roff_term_pre(struct termp p, const struct roff_node n)
57			{
58	✗✓	8148	assert(n->tok < ROFF_MAX);
59		4074	(*roff_term_pre_acts[n->tok])(p, n);
60		4074	}
61
62			static void
63			roff_term_pre_br(ROFF_TERM_ARGS)
64			{
65		7938	term_newln(p);
66	✓✓	3969	if (p->flags & TERMP_BRIND) {
67		39	p->tcol->offset = p->tcol->rmargin;
68		39	p->tcol->rmargin = p->maxrmargin;
69		39	p->flags &= ~(TERMP_NOBREAK \| TERMP_BRIND);
70		39	}
71		3969	}
72
73			static void
74			roff_term_pre_ce(ROFF_TERM_ARGS)
75			{
76			const struct roff_node nc1, nc2;
77			size_t len, lm;
78
79			roff_term_pre_br(p, n);
80			lm = p->tcol->offset;
81			nc1 = n->child->next;
82			while (nc1 != NULL) {
83			nc2 = nc1;
84			len = 0;
85			do {
86			if (nc2->type == ROFFT_TEXT) {
87			if (len)
88			len++;
89			len += term_strlen(p, nc2->string);
90			}
91			nc2 = nc2->next;
92			} while (nc2 != NULL && (nc2->type != ROFFT_TEXT \|\|
93			(nc2->flags & NODE_LINE) == 0));
94			p->tcol->offset = len >= p->tcol->rmargin ? 0 :
95			lm + len >= p->tcol->rmargin ? p->tcol->rmargin - len :
96			n->tok == ROFF_rj ? p->tcol->rmargin - len :
97			(lm + p->tcol->rmargin - len) / 2;
98			while (nc1 != nc2) {
99			if (nc1->type == ROFFT_TEXT)
100			term_word(p, nc1->string);
101			else
102			roff_term_pre(p, nc1);
103			nc1 = nc1->next;
104			}
105			p->flags \|= TERMP_NOSPACE;
106			term_flushln(p);
107			}
108			p->tcol->offset = lm;
109			}
110
111			static void
112			roff_term_pre_ft(ROFF_TERM_ARGS)
113			{
114	✗✗✓✗ ✓✓✗✗ ✗✓	108	switch (*n->child->string) {
115			case '4':
116			case '3':
117			case 'B':
118		9	term_fontrepl(p, TERMFONT_BOLD);
119		9	break;
120			case '2':
121			case 'I':
122		9	term_fontrepl(p, TERMFONT_UNDER);
123		9	break;
124			case 'P':
125		18	term_fontlast(p);
126		18	break;
127			case '1':
128			case 'C':
129			case 'R':
130			term_fontrepl(p, TERMFONT_NONE);
131			break;
132			default:
133			break;
134			}
135		36	}
136
137			static void
138			roff_term_pre_ll(ROFF_TERM_ARGS)
139			{
140	✓✓	114	term_setwidth(p, n->child != NULL ? n->child->string : NULL);
141		30	}
142
143			static void
144			roff_term_pre_mc(ROFF_TERM_ARGS)
145			{
146			if (p->col) {
147			p->flags \|= TERMP_NOBREAK;
148			term_flushln(p);
149			p->flags &= ~(TERMP_NOBREAK \| TERMP_NOSPACE);
150			}
151			if (n->child != NULL) {
152			p->mc = n->child->string;
153			p->flags \|= TERMP_NEWMC;
154			} else
155			p->flags \|= TERMP_ENDMC;
156			}
157
158			static void
159			roff_term_pre_po(ROFF_TERM_ARGS)
160			{
161		24	struct roffsu su;
162			static int po, polast;
163			int ponew;
164
165	✓✗✓✓	24	if (n->child != NULL &&
166		12	a2roffsu(n->child->string, &su, SCALE_EM) != NULL) {
167		9	ponew = term_hen(p, &su);
168	✓✓✓✓	15	if (*n->child->string == '+' \|\|
169		6	*n->child->string == '-')
170		6	ponew += po;
171			} else
172		3	ponew = polast;
173		12	polast = po;
174		12	po = ponew;
175
176		12	ponew = po - polast + (int)p->tcol->offset;
177		12	p->tcol->offset = ponew > 0 ? ponew : 0;
178		12	}
179
180			static void
181			roff_term_pre_sp(ROFF_TERM_ARGS)
182			{
183		4776	struct roffsu su;
184			int len;
185
186	✓✓	2388	if (n->child != NULL) {
187	✓✓	876	if (a2roffsu(n->child->string, &su, SCALE_VS) == NULL)
188		6	su.scale = 1.0;
189		876	len = term_vspan(p, &su);
190		876	} else
191			len = 1;
192
193	✓✓	2388	if (len < 0)
194		3	p->skipvsp -= len;
195			else
196	✓✓	11100	while (len--)
197		3165	term_vspace(p);
198
199		2388	roff_term_pre_br(p, n);
200		2388	}
201
202			static void
203			roff_term_pre_ta(ROFF_TERM_ARGS)
204			{
205		54	term_tab_set(p, NULL);
206	✓✓	180	for (n = n->child; n != NULL; n = n->next)
207		63	term_tab_set(p, n->string);
208		27	}
209
210			static void
211			roff_term_pre_ti(ROFF_TERM_ARGS)
212			{
213		48	struct roffsu su;
214			const char *cp;
215			int len, sign;
216
217		24	roff_term_pre_br(p, n);
218
219	✗✓	24	if (n->child == NULL)
220			return;
221		24	cp = n->child->string;
222	✓✓	24	if (*cp == '+') {
223			sign = 1;
224		6	cp++;
225	✓✓	24	} else if (*cp == '-') {
226			sign = -1;
227		12	cp++;
228		12	} else
229			sign = 0;
230
231	✗✓	24	if (a2roffsu(cp, &su, SCALE_EM) == NULL)
232			return;
233		24	len = term_hen(p, &su);
234
235	✓✓	24	if (sign == 0) {
236		6	p->ti = len - p->tcol->offset;
237		6	p->tcol->offset = len;
238	✓✓	24	} else if (sign == 1) {
239		6	p->ti = len;
240		6	p->tcol->offset += len;
241	✓✓	18	} else if ((size_t)len < p->tcol->offset) {
242		6	p->ti = -len;
243		6	p->tcol->offset -= len;
244		6	} else {
245		6	p->ti = -p->tcol->offset;
246		6	p->tcol->offset = 0;
247			}
248		48	}