File Manager

003 File Manager

Current Path: /usr/src/contrib/mandoc

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: compat_ohash.c

#include "config.h"

#if HAVE_OHASH

int dummy;

#else

/* $OpenBSD: ohash.c,v 1.1 2014/06/02 18:52:03 deraadt Exp $ */

/* Copyright (c) 1999, 2004 Marc Espie <espie@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 <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#include "compat_ohash.h"

struct _ohash_record {
	uint32_t	hv;
	const char	*p;
};

#define DELETED		((const char *)h)
#define NONE		(h->size)

/* Don't bother changing the hash table if the change is small enough.  */
#define MINSIZE		(1UL << 4)
#define MINDELETED	4

static void ohash_resize(struct ohash *);

/* This handles the common case of variable length keys, where the
 * key is stored at the end of the record.
 */
void *
ohash_create_entry(struct ohash_info *i, const char *start, const char **end)
{
	char *p;

if (!*end)
		*end = start + strlen(start);
	p = (i->alloc)(i->key_offset + (*end - start) + 1, i->data);
	if (p) {
		memcpy(p+i->key_offset, start, *end-start);
		p[i->key_offset + (*end - start)] = '\0';
	}
	return (void *)p;
}

/* hash_delete only frees the hash structure. Use hash_first/hash_next
 * to free entries as well.  */
void
ohash_delete(struct ohash *h)
{
	(h->info.free)(h->t, h->info.data);
#ifndef NDEBUG
	h->t = NULL;
#endif
}

static void
ohash_resize(struct ohash *h)
{
	struct _ohash_record *n;
	size_t ns;
	unsigned int	j;
	unsigned int	i, incr;

if (4 * h->deleted < h->total) {
		if (h->size >= (UINT_MAX >> 1U))
			ns = UINT_MAX;
		else
			ns = h->size << 1U;
	} else if (3 * h->deleted > 2 * h->total)
		ns = h->size >> 1U;
	else
		ns = h->size;
	if (ns < MINSIZE)
		ns = MINSIZE;
#ifdef STATS_HASH
	STAT_HASH_EXPAND++;
	STAT_HASH_SIZE += ns - h->size;
#endif

n = (h->info.calloc)(ns, sizeof(struct _ohash_record), h->info.data);
	if (!n)
		return;

for (j = 0; j < h->size; j++) {
		if (h->t[j].p != NULL && h->t[j].p != DELETED) {
			i = h->t[j].hv % ns;
			incr = ((h->t[j].hv % (ns - 2)) & ~1) + 1;
			while (n[i].p != NULL) {
				i += incr;
				if (i >= ns)
					i -= ns;
			}
			n[i].hv = h->t[j].hv;
			n[i].p = h->t[j].p;
		}
	}
	(h->info.free)(h->t, h->info.data);
	h->t = n;
	h->size = ns;
	h->total -= h->deleted;
	h->deleted = 0;
}

void *
ohash_remove(struct ohash *h, unsigned int i)
{
	void		*result = (void *)h->t[i].p;

if (result == NULL || result == DELETED)
		return NULL;

#ifdef STATS_HASH
	STAT_HASH_ENTRIES--;
#endif
	h->t[i].p = DELETED;
	h->deleted++;
	if (h->deleted >= MINDELETED && 4 * h->deleted > h->total)
		ohash_resize(h);
	return result;
}

void *
ohash_find(struct ohash *h, unsigned int i)
{
	if (h->t[i].p == DELETED)
		return NULL;
	else
		return (void *)h->t[i].p;
}

void *
ohash_insert(struct ohash *h, unsigned int i, void *p)
{
#ifdef STATS_HASH
	STAT_HASH_ENTRIES++;
#endif
	if (h->t[i].p == DELETED) {
		h->deleted--;
		h->t[i].p = p;
	} else {
		h->t[i].p = p;
		/* Arbitrary resize boundary.  Tweak if not efficient enough.  */
		if (++h->total * 4 > h->size * 3)
			ohash_resize(h);
	}
	return p;
}

unsigned int
ohash_entries(struct ohash *h)
{
	return h->total - h->deleted;
}

void *
ohash_first(struct ohash *h, unsigned int *pos)
{
	*pos = 0;
	return ohash_next(h, pos);
}

void *
ohash_next(struct ohash *h, unsigned int *pos)
{
	for (; *pos < h->size; (*pos)++)
		if (h->t[*pos].p != DELETED && h->t[*pos].p != NULL)
			return (void *)h->t[(*pos)++].p;
	return NULL;
}

void
ohash_init(struct ohash *h, unsigned int size, struct ohash_info *info)
{
	h->size = 1UL << size;
	if (h->size < MINSIZE)
		h->size = MINSIZE;
#ifdef STATS_HASH
	STAT_HASH_CREATION++;
	STAT_HASH_SIZE += h->size;
#endif
	/* Copy info so that caller may free it.  */
	h->info.key_offset = info->key_offset;
	h->info.calloc = info->calloc;
	h->info.free = info->free;
	h->info.alloc = info->alloc;
	h->info.data = info->data;
	h->t = (h->info.calloc)(h->size, sizeof(struct _ohash_record),
		    h->info.data);
	h->total = h->deleted = 0;
}

uint32_t
ohash_interval(const char *s, const char **e)
{
	uint32_t k;

if (!*e)
		*e = s + strlen(s);
	if (s == *e)
		k = 0;
	else
		k = *s++;
	while (s != *e)
		k =  ((k << 2) | (k >> 30)) ^ *s++;
	return k;
}

unsigned int
ohash_lookup_interval(struct ohash *h, const char *start, const char *end,
    uint32_t hv)
{
	unsigned int	i, incr;
	unsigned int	empty;

#ifdef STATS_HASH
	STAT_HASH_LOOKUP++;
#endif
	empty = NONE;
	i = hv % h->size;
	incr = ((hv % (h->size-2)) & ~1) + 1;
	while (h->t[i].p != NULL) {
#ifdef STATS_HASH
		STAT_HASH_LENGTH++;
#endif
		if (h->t[i].p == DELETED) {
			if (empty == NONE)
				empty = i;
		} else if (h->t[i].hv == hv &&
		    strncmp(h->t[i].p+h->info.key_offset, start,
			end - start) == 0 &&
		    (h->t[i].p+h->info.key_offset)[end-start] == '\0') {
			if (empty != NONE) {
				h->t[empty].hv = hv;
				h->t[empty].p = h->t[i].p;
				h->t[i].p = DELETED;
				return empty;
			} else {
#ifdef STATS_HASH
				STAT_HASH_POSITIVE++;
#endif
				return i;
			}
		}
		i += incr;
		if (i >= h->size)
			i -= h->size;
	}

/* Found an empty position.  */
	if (empty != NONE)
		i = empty;
	h->t[i].hv = hv;
	return i;
}

unsigned int
ohash_lookup_memory(struct ohash *h, const char *k, size_t size, uint32_t hv)
{
	unsigned int	i, incr;
	unsigned int	empty;

#ifdef STATS_HASH
	STAT_HASH_LOOKUP++;
#endif
	empty = NONE;
	i = hv % h->size;
	incr = ((hv % (h->size-2)) & ~1) + 1;
	while (h->t[i].p != NULL) {
#ifdef STATS_HASH
		STAT_HASH_LENGTH++;
#endif
		if (h->t[i].p == DELETED) {
			if (empty == NONE)
				empty = i;
		} else if (h->t[i].hv == hv &&
		    memcmp(h->t[i].p+h->info.key_offset, k, size) == 0) {
			if (empty != NONE) {
				h->t[empty].hv = hv;
				h->t[empty].p = h->t[i].p;
				h->t[i].p = DELETED;
				return empty;
			} else {
#ifdef STATS_HASH
				STAT_HASH_POSITIVE++;
#endif
			}	return i;
		}
		i += incr;
		if (i >= h->size)
			i -= h->size;
	}

/* Found an empty position.  */
	if (empty != NONE)
		i = empty;
	h->t[i].hv = hv;
	return i;
}

unsigned int
ohash_qlookup(struct ohash *h, const char *s)
{
	const char *e = NULL;
	return ohash_qlookupi(h, s, &e);
}

unsigned int
ohash_qlookupi(struct ohash *h, const char *s, const char **e)
{
	uint32_t hv;

hv = ohash_interval(s, e);
	return ohash_lookup_interval(h, s, *e, hv);
}

#endif /*!HAVE_OHASH*/

003 File Manager

Editing: compat_ohash.c

Upload File

Create Folder