File Manager

003 File Manager

Current Path: /usr/src/contrib/mandoc

📁 ..
📄 INSTALL(6.86 KB)
📄 LICENSE(2.46 KB)
📄 Makefile(15.29 KB)
📄 Makefile.depend(5.65 KB)
📄 NEWS(60.04 KB)
📄 TODO(23.98 KB)
📄 apropos.1(10.66 KB)
📄 arch.c(1.94 KB)
📄 att.c(1.62 KB)
📄 catman.8(4.49 KB)
📄 catman.c(5.52 KB)
📄 cgi.c(27.06 KB)
📄 cgi.h.example(220 B)
📄 chars.c(13.24 KB)
📄 compat_err.c(2.68 KB)
📄 compat_fts.c(17.42 KB)
📄 compat_fts.h(4.09 KB)
📄 compat_getline.c(1.59 KB)
📄 compat_getsubopt.c(2.89 KB)
📄 compat_isblank.c(986 B)
📄 compat_mkdtemp.c(1.59 KB)
📄 compat_ohash.c(6.82 KB)
📄 compat_ohash.h(2.63 KB)
📄 compat_progname.c(1.05 KB)
📄 compat_reallocarray.c(1.49 KB)
📄 compat_recallocarray.c(2.88 KB)
📄 compat_strcasestr.c(2.38 KB)
📄 compat_stringlist.c(2.71 KB)
📄 compat_stringlist.h(1.73 KB)
📄 compat_strlcat.c(1.71 KB)
📄 compat_strlcpy.c(1.59 KB)
📄 compat_strndup.c(1.3 KB)
📄 compat_strsep.c(2.55 KB)
📄 compat_strtonum.c(1.88 KB)
📄 compat_vasprintf.c(1.55 KB)
📄 config.h(1.33 KB)
📄 configure(17.5 KB)
📄 configure.local.example(11.37 KB)
📄 dba.c(13.02 KB)
📄 dba.h(1.73 KB)
📄 dba_array.c(4.23 KB)
📄 dba_array.h(2 KB)
📄 dba_read.c(2.33 KB)
📄 dba_write.c(2.42 KB)
📄 dba_write.h(1.23 KB)
📄 dbm.c(9.28 KB)
📄 dbm.h(1.94 KB)
📄 dbm_map.c(4.67 KB)
📄 dbm_map.h(1.2 KB)
📄 demandoc.1(2.64 KB)
📄 demandoc.c(5.21 KB)
📄 eqn.7(12.07 KB)
📄 eqn.c(27.21 KB)
📄 eqn.h(2.19 KB)
📄 eqn_html.c(5.91 KB)
📄 eqn_parse.h(1.96 KB)
📄 eqn_term.c(4.83 KB)
📄 gmdiff(1.74 KB)
📄 html.c(19.34 KB)
📄 html.h(3.86 KB)
📄 lib.c(1.07 KB)
📄 lib.in(8.96 KB)
📄 libman.h(1.66 KB)
📄 libmandoc.h(3.21 KB)
📄 libmdoc.h(2.97 KB)
📄 main.c(28.93 KB)
📄 main.h(2.06 KB)
📄 makewhatis.8(4.78 KB)
📄 man-cgi.css(464 B)
📄 man.1(9.33 KB)
📄 man.7(16.8 KB)
📄 man.c(8.62 KB)
📄 man.cgi.3(7.83 KB)
📄 man.cgi.8(11.02 KB)
📄 man.conf.5(3.92 KB)
📄 man.h(991 B)
📄 man.options.1(21.05 KB)
📄 man_html.c(13.39 KB)
📄 man_macro.c(11.4 KB)
📄 man_term.c(25.6 KB)
📄 man_validate.c(11.84 KB)
📄 manconf.h(1.56 KB)
📄 mandoc.1(54.89 KB)
📄 mandoc.3(12.5 KB)
📄 mandoc.c(12.41 KB)
📄 mandoc.css(8.63 KB)
📄 mandoc.db.5(5.74 KB)
📄 mandoc.h(14.92 KB)
📄 mandoc_aux.c(2.42 KB)
📄 mandoc_aux.h(1.31 KB)
📄 mandoc_char.7(29.23 KB)
📄 mandoc_escape.3(9.33 KB)
📄 mandoc_headers.3(12.41 KB)
📄 mandoc_html.3(7.42 KB)
📄 mandoc_malloc.3(4.46 KB)
📄 mandoc_msg.c(8.92 KB)
📄 mandoc_ohash.c(1.58 KB)
📄 mandoc_ohash.h(1004 B)
📄 mandoc_parse.h(1.82 KB)
📄 mandoc_xr.c(2.75 KB)
📄 mandoc_xr.h(1.17 KB)
📄 mandocd.8(4.59 KB)
📄 mandocd.c(5.98 KB)
📄 mandocdb.c(55.16 KB)
📄 manpath.c(7.73 KB)
📄 manpath.h(1.22 KB)
📄 mansearch.3(3.26 KB)
📄 mansearch.c(18.99 KB)
📄 mansearch.h(4.03 KB)
📄 mchars_alloc.3(5.24 KB)
📄 mdoc.7(73.34 KB)
📄 mdoc.c(9.99 KB)
📄 mdoc.h(3.96 KB)
📄 mdoc_argv.c(16.19 KB)
📄 mdoc_html.c(36.48 KB)
📄 mdoc_macro.c(39.55 KB)
📄 mdoc_man.c(37.07 KB)
📄 mdoc_markdown.c(33.41 KB)
📄 mdoc_state.c(5.24 KB)
📄 mdoc_term.c(43.69 KB)
📄 mdoc_validate.c(61.85 KB)
📄 msec.c(1.09 KB)
📄 msec.in(1.48 KB)
📄 out.c(13.61 KB)
📄 out.h(2.26 KB)
📄 preconv.c(3.84 KB)
📄 predefs.in(2.05 KB)
📄 read.c(16.44 KB)
📄 roff.7(61.96 KB)
📄 roff.c(98.93 KB)
📄 roff.h(8.85 KB)
📄 roff_html.c(2.92 KB)
📄 roff_int.h(4.08 KB)
📄 roff_term.c(5.36 KB)
📄 roff_validate.c(3.41 KB)
📄 soelim.1(2.6 KB)
📄 soelim.c(3.76 KB)
📄 st.c(4.33 KB)
📄 tag.c(6.65 KB)
📄 tag.h(1.09 KB)
📄 tbl.3(6.9 KB)
📄 tbl.7(10.91 KB)
📄 tbl.c(3.89 KB)
📄 tbl.h(4.43 KB)
📄 tbl_data.c(7.3 KB)
📄 tbl_html.c(5.74 KB)
📄 tbl_int.h(2.09 KB)
📄 tbl_layout.c(8.06 KB)
📄 tbl_opts.c(3.77 KB)
📄 tbl_parse.h(1.31 KB)
📄 tbl_term.c(24.42 KB)
📄 term.c(24.4 KB)
📄 term.h(6.14 KB)
📄 term_ascii.c(9.88 KB)
📄 term_ps.c(27.41 KB)
📄 term_tab.c(3 KB)
📄 test-EFTYPE.c(56 B)
📄 test-O_DIRECTORY.c(88 B)
📄 test-PATH_MAX.c(1.02 KB)
📄 test-be32toh.c(147 B)
📄 test-cmsg.c(174 B)
📄 test-dirent-namlen.c(124 B)
📄 test-err.c(994 B)
📄 test-fgetln.c(147 B)
📄 test-fts.c(964 B)
📄 test-getline.c(186 B)
📄 test-getsubopt.c(1.31 KB)
📄 test-isblank.c(96 B)
📄 test-mkdtemp.c(175 B)
📄 test-nanosleep.c(239 B)
📄 test-noop.c(30 B)
📄 test-ntohl.c(91 B)
📄 test-ohash.c(585 B)
📄 test-pledge.c(73 B)
📄 test-progname.c(118 B)
📄 test-reallocarray.c(75 B)
📄 test-recallocarray.c(132 B)
📄 test-recvmsg.c(100 B)
📄 test-rewb-bsd.c(618 B)
📄 test-rewb-sysv.c(610 B)
📄 test-sandbox_init.c(186 B)
📄 test-strcasestr.c(131 B)
📄 test-stringlist.c(1.14 KB)
📄 test-strlcat.c(166 B)
📄 test-strlcpy.c(148 B)
📄 test-strndup.c(141 B)
📄 test-strptime.c(212 B)
📄 test-strsep.c(183 B)
📄 test-strtonum.c(1.25 KB)
📄 test-vasprintf.c(1.25 KB)
📄 test-wchar.c(1.58 KB)
📄 tree.c(8.17 KB)

Editing: tbl_data.c

/*	$Id: tbl_data.c,v 1.52 2019/02/09 16:00:39 schwarze Exp $ */
/*
 * Copyright (c) 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv>
 * Copyright (c) 2011,2015,2017,2018,2019 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 "config.h"

#include <sys/types.h>

#include <assert.h>
#include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>

#include "mandoc_aux.h"
#include "mandoc.h"
#include "tbl.h"
#include "libmandoc.h"
#include "tbl_int.h"

static	void		 getdata(struct tbl_node *, struct tbl_span *,
				int, const char *, int *);
static	struct tbl_span	*newspan(struct tbl_node *, int,
				struct tbl_row *);

static void
getdata(struct tbl_node *tbl, struct tbl_span *dp,
		int ln, const char *p, int *pos)
{
	struct tbl_dat	*dat, *pdat;
	struct tbl_cell	*cp;
	struct tbl_span	*pdp;
	int		 sv;

/*
	 * Determine the length of the string in the cell
	 * and advance the parse point to the end of the cell.
	 */

sv = *pos;
	while (p[*pos] != '\0' && p[*pos] != tbl->opts.tab)
		(*pos)++;

/* Advance to the next layout cell, skipping spanners. */

cp = dp->last == NULL ? dp->layout->first : dp->last->layout->next;
	while (cp != NULL && cp->pos == TBL_CELL_SPAN)
		cp = cp->next;

/*
	 * If the current layout row is out of cells, allocate
	 * a new cell if another row of the table has at least
	 * this number of columns, or discard the input if we
	 * are beyond the last column of the table as a whole.
	 */

if (cp == NULL) {
		if (dp->layout->last->col + 1 < dp->opts->cols) {
			cp = mandoc_calloc(1, sizeof(*cp));
			cp->pos = TBL_CELL_LEFT;
			dp->layout->last->next = cp;
			cp->col = dp->layout->last->col + 1;
			dp->layout->last = cp;
		} else {
			mandoc_msg(MANDOCERR_TBLDATA_EXTRA,
			    ln, sv, "%s", p + sv);
			while (p[*pos] != '\0')
				(*pos)++;
			return;
		}
	}

dat = mandoc_malloc(sizeof(*dat));
	dat->layout = cp;
	dat->next = NULL;
	dat->string = NULL;
	dat->hspans = 0;
	dat->vspans = 0;
	dat->block = 0;
	dat->pos = TBL_DATA_NONE;

/*
	 * Increment the number of vertical spans in a data cell above,
	 * if this cell vertically extends one or more cells above.
	 * The iteration must be done over data rows,
	 * not over layout rows, because one layout row
	 * can be reused for more than one data row.
	 */

if (cp->pos == TBL_CELL_DOWN ||
	    (*pos - sv == 2 && p[sv] == '\\' && p[sv + 1] == '^')) {
		pdp = dp;
		while ((pdp = pdp->prev) != NULL) {
			pdat = pdp->first;
			while (pdat != NULL &&
			    pdat->layout->col < dat->layout->col)
				pdat = pdat->next;
			if (pdat == NULL)
				break;
			if (pdat->layout->pos != TBL_CELL_DOWN &&
			    strcmp(pdat->string, "\\^") != 0) {
				pdat->vspans++;
				break;
			}
		}
	}

/*
	 * Count the number of horizontal spans to the right of this cell.
	 * This is purely a matter of the layout, independent of the data.
	 */

for (cp = cp->next; cp != NULL; cp = cp->next)
		if (cp->pos == TBL_CELL_SPAN)
			dat->hspans++;
		else
			break;

/* Append the new data cell to the data row. */

if (dp->last == NULL)
		dp->first = dat;
	else
		dp->last->next = dat;
	dp->last = dat;

/*
	 * Check for a continued-data scope opening.  This consists of a
	 * trailing `T{' at the end of the line.  Subsequent lines,
	 * until a standalone `T}', are included in our cell.
	 */

if (*pos - sv == 2 && p[sv] == 'T' && p[sv + 1] == '{') {
		tbl->part = TBL_PART_CDATA;
		return;
	}

dat->string = mandoc_strndup(p + sv, *pos - sv);

if (p[*pos] != '\0')
		(*pos)++;

if ( ! strcmp(dat->string, "_"))
		dat->pos = TBL_DATA_HORIZ;
	else if ( ! strcmp(dat->string, "="))
		dat->pos = TBL_DATA_DHORIZ;
	else if ( ! strcmp(dat->string, "\\_"))
		dat->pos = TBL_DATA_NHORIZ;
	else if ( ! strcmp(dat->string, "\\="))
		dat->pos = TBL_DATA_NDHORIZ;
	else
		dat->pos = TBL_DATA_DATA;

if ((dat->layout->pos == TBL_CELL_HORIZ ||
	    dat->layout->pos == TBL_CELL_DHORIZ ||
	    dat->layout->pos == TBL_CELL_DOWN) &&
	    dat->pos == TBL_DATA_DATA && *dat->string != '\0')
		mandoc_msg(MANDOCERR_TBLDATA_SPAN,
		    ln, sv, "%s", dat->string);
}

void
tbl_cdata(struct tbl_node *tbl, int ln, const char *p, int pos)
{
	struct tbl_dat	*dat;
	size_t		 sz;

dat = tbl->last_span->last;

if (p[pos] == 'T' && p[pos + 1] == '}') {
		pos += 2;
		if (p[pos] == tbl->opts.tab) {
			tbl->part = TBL_PART_DATA;
			pos++;
			while (p[pos] != '\0')
				getdata(tbl, tbl->last_span, ln, p, &pos);
			return;
		} else if (p[pos] == '\0') {
			tbl->part = TBL_PART_DATA;
			return;
		}

/* Fallthrough: T} is part of a word. */
	}

dat->pos = TBL_DATA_DATA;
	dat->block = 1;

if (dat->string != NULL) {
		sz = strlen(p + pos) + strlen(dat->string) + 2;
		dat->string = mandoc_realloc(dat->string, sz);
		(void)strlcat(dat->string, " ", sz);
		(void)strlcat(dat->string, p + pos, sz);
	} else
		dat->string = mandoc_strdup(p + pos);

if (dat->layout->pos == TBL_CELL_DOWN)
		mandoc_msg(MANDOCERR_TBLDATA_SPAN,
		    ln, pos, "%s", dat->string);
}

static struct tbl_span *
newspan(struct tbl_node *tbl, int line, struct tbl_row *rp)
{
	struct tbl_span	*dp;

dp = mandoc_calloc(1, sizeof(*dp));
	dp->line = line;
	dp->opts = &tbl->opts;
	dp->layout = rp;
	dp->prev = tbl->last_span;

if (dp->prev == NULL) {
		tbl->first_span = dp;
		tbl->current_span = NULL;
	} else
		dp->prev->next = dp;
	tbl->last_span = dp;

return dp;
}

void
tbl_data(struct tbl_node *tbl, int ln, const char *p, int pos)
{
	struct tbl_row	*rp;
	struct tbl_cell	*cp;
	struct tbl_span	*sp;

rp = (sp = tbl->last_span) == NULL ? tbl->first_row :
	    sp->pos == TBL_SPAN_DATA && sp->layout->next != NULL ?
	    sp->layout->next : sp->layout;

assert(rp != NULL);

if (p[1] == '\0') {
		switch (p[0]) {
		case '.':
			/*
			 * Empty request lines must be handled here
			 * and cannot be discarded in roff_parseln()
			 * because in the layout section, they
			 * are significant and end the layout.
			 */
			return;
		case '_':
			sp = newspan(tbl, ln, rp);
			sp->pos = TBL_SPAN_HORIZ;
			return;
		case '=':
			sp = newspan(tbl, ln, rp);
			sp->pos = TBL_SPAN_DHORIZ;
			return;
		default:
			break;
		}
	}

/*
	 * If the layout row contains nothing but horizontal lines,
	 * allocate an empty span for it and assign the current span
	 * to the next layout row accepting data.
	 */

while (rp->next != NULL) {
		if (rp->last->col + 1 < tbl->opts.cols)
			break;
		for (cp = rp->first; cp != NULL; cp = cp->next)
			if (cp->pos != TBL_CELL_HORIZ &&
			    cp->pos != TBL_CELL_DHORIZ)
				break;
		if (cp != NULL)
			break;
		sp = newspan(tbl, ln, rp);
		sp->pos = TBL_SPAN_DATA;
		rp = rp->next;
	}

/* Process a real data row. */

sp = newspan(tbl, ln, rp);
	sp->pos = TBL_SPAN_DATA;
	while (p[pos] != '\0')
		getdata(tbl, sp, ln, p, &pos);
}

003 File Manager

Editing: tbl_data.c

Upload File

Create Folder