ascii_xxx -> chars_xxx (intended to hold more than just ascii encoding).

More html work.

1 files changed, 0 insertions, 217 deletions

diff --git a/ascii.c b/ascii.c
deleted file mode 100644
index 60698339..00000000
--- a/ascii.c
+++ /dev/null
@@ -1,217 +0,0 @@
-/*	$Id: ascii.c,v 1.9 2009/07/27 12:02:49 kristaps Exp $ */
-/*
- * Copyright (c) 2009 Kristaps Dzonsons <kristaps@kth.se>
- *
- * 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 <assert.h>
-#include <err.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include "term.h"
-
-#define	ASCII_PRINT_HI	 126
-#define	ASCII_PRINT_LO	 32
-
-struct	line {
-	const char	 *code;
-	const char	 *out;
-	size_t		  codesz;
-	size_t		  outsz;
-	int		  type;
-#define	ASCII_CHAR	 (1 << 0)
-#define	ASCII_STRING	 (1 << 1)
-#define ASCII_BOTH	 (0x03)
-};
-
-struct	linep {
-	const struct line *line;
-	struct linep	 *next;
-};
-
-#define CHAR(w, x, y, z) \
-	{ (w), (y), (x), (z), ASCII_CHAR },
-#define STRING(w, x, y, z) \
-	{ (w), (y), (x), (z), ASCII_STRING },
-#define BOTH(w, x, y, z) \
-	{ (w), (y), (x), (z), ASCII_BOTH },
-static	const struct line lines[] = {
-#include "ascii.in"
-};
-
-struct	asciitab {
-	struct linep	 *lines;
-	void		**htab;
-};
-
-
-static	inline int	  match(const struct line *,
-				const char *, size_t, int);
-static	const char *	  lookup(struct asciitab *, const char *, 
-				size_t, size_t *, int);
-
-
-void
-term_asciifree(void *arg)
-{
-	struct asciitab	*tab;
-
-	tab = (struct asciitab *)arg;
-
-	free(tab->lines);
-	free(tab->htab);
-	free(tab);
-}
-
-
-void *
-term_ascii2htab(void)
-{
-	struct asciitab  *tab;
-	void		**htab;
-	struct linep	 *pp, *p;
-	int		  i, len, hash;
-
-	/*
-	 * Constructs a very basic chaining hashtable.  The hash routine
-	 * is simply the integral value of the first character.
-	 * Subsequent entries are chained in the order they're processed
-	 * (they're in-line re-ordered during lookup).
-	 */
-
-	if (NULL == (tab = malloc(sizeof(struct asciitab))))
-		err(1, "malloc");
-
-	len = sizeof(lines) / sizeof(struct line);
-
-	if (NULL == (p = calloc((size_t)len, sizeof(struct linep))))
-		err(1, "malloc");
-
-	htab = calloc(ASCII_PRINT_HI - ASCII_PRINT_LO + 1, 
-			sizeof(struct linep **));
-
-	if (NULL == htab)
-		err(1, "malloc");
-
-	for (i = 0; i < len; i++) {
-		assert(lines[i].codesz > 0);
-		assert(lines[i].code);
-		assert(lines[i].out);
-
-		p[i].line = &lines[i];
-
-		hash = (int)lines[i].code[0] - ASCII_PRINT_LO;
-
-		if (NULL == (pp = ((struct linep **)htab)[hash])) {
-			htab[hash] = &p[i];
-			continue;
-		}
-
-		for ( ; pp->next; pp = pp->next)
-			/* Scan ahead. */ ;
-
-		pp->next = &p[i];
-	}
-
-	tab->htab = htab;
-	tab->lines = p;
-
-	return(tab);
-}
-
-
-const char *
-term_a2ascii(void *arg, const char *p, size_t sz, size_t *rsz)
-{
-
-	return(lookup((struct asciitab *)arg, p, 
-				sz, rsz, ASCII_CHAR));
-}
-
-
-const char *
-term_a2res(void *arg, const char *p, size_t sz, size_t *rsz)
-{
-
-	return(lookup((struct asciitab *)arg, p, 
-				sz, rsz, ASCII_STRING));
-}
-
-
-static const char *
-lookup(struct asciitab *tab, const char *p, 
-		size_t sz, size_t *rsz, int type)
-{
-	struct linep	 *pp, *prev;
-	void		**htab;
-	int		  hash;
-
-	assert(p);
-	assert(sz > 0);
-
-	if (p[0] < ASCII_PRINT_LO || p[0] > ASCII_PRINT_HI)
-		return(NULL);
-
-
-	/*
-	 * Lookup the symbol in the symbol hash.  See ascii2htab for the
-	 * hashtable specs.  This dynamically re-orders the hash chain
-	 * to optimise for repeat hits.
-	 */
-
-	hash = (int)p[0] - ASCII_PRINT_LO;
-	htab = tab->htab;
-
-	if (NULL == (pp = ((struct linep **)htab)[hash]))
-		return(NULL);
-
-	if (NULL == pp->next) {
-		if ( ! match(pp->line, p, sz, type)) 
-			return(NULL);
-		*rsz = pp->line->outsz;
-		return(pp->line->out);
-	}
-
-	for (prev = NULL; pp; pp = pp->next) {
-		if ( ! match(pp->line, p, sz, type)) {
-			prev = pp;
-			continue;
-		}
-
-		/* Re-order the hash chain. */
-
-		if (prev) {
-			prev->next = pp->next;
-			pp->next = ((struct linep **)htab)[hash];
-			htab[hash] = pp;
-		}
-
-		*rsz = pp->line->outsz;
-		return(pp->line->out);
-	}
-
-	return(NULL);
-}
-
-
-static inline int
-match(const struct line *line, const char *p, size_t sz, int type)
-{
-
-	if ( ! (line->type & type))
-		return(0);
-	if (line->codesz != sz)
-		return(0);
-	return(0 == strncmp(line->code, p, sz));
-}