freebsd-nq/lib/libc/nls/msgcat.c

/* $FreeBSD$ */

/***********************************************************
Copyright 1990, by Alfalfa Software Incorporated, Cambridge, Massachusetts.

                        All Rights Reserved

Permission to use, copy, modify, and distribute this software and its
documentation for any purpose and without fee is hereby granted,
provided that the above copyright notice appear in all copies and that
both that copyright notice and this permission notice appear in
supporting documentation, and that Alfalfa's name not be used in
advertising or publicity pertaining to distribution of the software
without specific, written prior permission.

ALPHALPHA DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
ALPHALPHA BE LIABLE FOR ANY SPECIAL, 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.

If you make any modifications, bugfixes or other changes to this software
we'd appreciate it if you could send a copy to us so we can keep things
up-to-date.  Many thanks.
				Kee Hinckley
				Alfalfa Software, Inc.
				267 Allston St., #3
				Cambridge, MA 02139  USA
				nazgul@alfalfa.com

******************************************************************/

#if defined(LIBC_SCCS) && !defined(lint)
static char *rcsid = "$FreeBSD$";
#endif /* LIBC_SCCS and not lint */

/*
 * We need a better way of handling errors than printing text.  I need
 * to add an error handling routine.
 */

#include <sys/types.h>
#include <sys/stat.h>
#include <sys/syslimits.h>
#include <errno.h>
#include <fcntl.h>
#include <locale.h>
#include <nl_types.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>

#include "msgcat.h"

#define _DEFAULT_NLS_PATH "/usr/share/nls/%L/%N.cat:/usr/share/nls/%N/%L:/usr/local/share/nls/%L/%N.cat:/usr/local/share/nls/%N/%L"

#define	TRUE	1
#define	FALSE	0

#define	NLERR		((nl_catd) -1)
#define	NLRETERR(errc)	errno = errc; return(NLERR);

static nl_catd loadCat();
static int loadSet();
static void __nls_free_resources();

nl_catd
catopen( name, type)
	__const char *name;
	int type;
{
  int		spcleft;
  char		path[PATH_MAX];
  char		*nlspath, *lang, *base, *cptr, *pathP, *tmpptr;
  struct stat	sbuf;

  if (name == NULL || *name == '\0') {
	NLRETERR(ENOENT);
  }

  /* is it absolute path ? if yes, load immidiately */
  if (strchr(name, '/'))
	return loadCat(name);

  if (type == NL_CAT_LOCALE)
	lang = setlocale(LC_MESSAGES, NULL);
  else
	lang = getenv("LANG");
  if (lang == NULL || *lang == '\0' || strchr(lang, '/') != NULL)
	lang = "C";
  if ((nlspath = (char *) getenv("NLSPATH")) == NULL
#ifndef __NETBSD_SYSCALLS
    || issetugid()
#endif
    )
    nlspath = _DEFAULT_NLS_PATH;

  base = cptr = malloc(strlen(nlspath)+1);
  if (base == NULL) return(NLERR);
  strcpy(cptr, nlspath);

  while ((nlspath = strsep((char**)&cptr, ":")) != NULL) {
	if (*nlspath != NULL) {
		for (pathP = path; *nlspath; ++nlspath) {
	    	  if (*nlspath == '%') {
			switch (*(nlspath + 1)) {
			    case 'L':
				tmpptr = lang;
				break;
			    case 'N':
				tmpptr = (char*)name;
				break;
			    default:
				*(pathP++) = *nlspath;
				continue;
			}
			++nlspath;
	        	spcleft = sizeof(path) - (pathP - path) - 1;
		    	if (strlcpy(pathP, tmpptr, spcleft) >= spcleft) {
				free(base);
				NLRETERR(ENAMETOOLONG);
			}
		    	pathP += strlen(tmpptr);
	    	  } else
			*(pathP++) = *nlspath;
		}
		*pathP = '\0';
		if (stat(path, &sbuf) == 0) {
			free(base);
			return loadCat(path);
		}
		nlspath = cptr+1;
	}
  }
  free(base);
  NLRETERR(ENOENT);
}

/*
 * We've got an odd situation here.  The odds are real good that the
 * number we are looking for is almost the same as the index.  We could
 * use the index, check the difference and do something intelligent, but
 * I haven't quite figured out what's intelligent.
 *
 * Here's a start.
 *	Take an id N.  If there are > N items in the list, then N cannot
 *	be more than N items from the start, since otherwise there would
 *	have to be duplicate items.  So we can safely set the top to N+1
 *	(after taking into account that ids start at 1, and arrays at 0)
 *
 *	Let's say we are at position P, and we are looking for N, but have
 *	V.  If N > V, then the furthest away that N could be is
 *	P + (N-V).  So we can safely set hi to P+(N-V)+1.  For example:
 *		We are looking for 10, but have 8
 *		8	?	?	?	?
 *			>=9	>=10	>=11
 *
 */

#define LOOKUP(PARENT, CHILD, ID, NUM, SET) {	\
    lo = 0; 					\
    if (ID - 1 < PARENT->NUM) {			\
	cur = ID - 1; hi = ID;			\
    } else {					\
	hi = PARENT->NUM; cur = (hi - lo) / 2;	\
    }						\
    while (TRUE) {				\
	CHILD = PARENT->SET + cur;		\
	if (CHILD->ID == ID) break;		\
	if (CHILD->ID < ID) {			\
	    lo = cur+1;				\
	    if (hi > cur+(ID-CHILD->ID)+1)	\
		hi = cur+(ID-CHILD->ID)+1;	\
	    dir = 1;				\
	} else {				\
	    hi = cur; dir = -1;			\
	}					\
	if (lo >= hi) return(NULL);		\
	if (hi - lo == 1) cur += dir;		\
	else cur += ((hi - lo) / 2) * dir;	\
    }						\
  }

static MCSetT*
MCGetSet( cat, setId)
	MCCatT *cat;
	int setId;
{
    MCSetT	*set;
    long	lo, hi, cur, dir;

    if (cat == NULL || setId <= 0) return(NULL);
    LOOKUP(cat, set, setId, numSets, sets);
    if (set->invalid && loadSet(cat, set) <= 0)
	return(NULL);
    return(set);
}


static MCMsgT*
MCGetMsg( set, msgId)
	MCSetT *set;
	int msgId;
{
    MCMsgT	*msg;
    long	lo, hi, cur, dir;

    if (set == NULL || set->invalid || msgId <= 0) return(NULL);
    LOOKUP(set, msg, msgId, numMsgs, u.msgs);
    return(msg);
}

char*
catgets( catd, setId, msgId, dflt)
	nl_catd catd;
	int setId;
	int msgId;
	__const char *dflt;
{
    MCMsgT	*msg;
    MCCatT	*cat = (MCCatT *) catd;
    __const char *cptr;

    if (catd == NULL || catd == NLERR)
	return((char *)dflt);
    msg = MCGetMsg(MCGetSet(cat, setId), msgId);
    if (msg != NULL) cptr = msg->msg.str;
    else cptr = dflt;
    return((char *)cptr);
}


int
catclose( catd)
	nl_catd catd;
{
    MCCatT	*cat = (MCCatT *) catd;

    if (catd == NULL || catd == NLERR) {
	errno = EBADF; return(-1);
    }

#if 0
    if (cat->loadType != MCLoadAll)
#endif
	(void) fclose(cat->fp);
    __nls_free_resources(cat, cat->numSets);
    free(cat);

    return(0);
}

/*
 * Internal routines
 */

/* Note that only malloc failures are allowed to return an error */
static char* _errowner = "Message Catalog System";;
#define CORRUPT() { 						\
	fprintf(stderr, "%s: currupt file.", _errowner);	\
		free(cat);					\
		NLRETERR(EINVAL);				\
	}

#define NOSPACE() {						\
	fprintf(stderr, "%s: no more memory.", _errowner);	\
		free(cat);					\
		return(NLERR);					\
	}

static void
__nls_free_resources(cat, i)
	MCCatT *cat;
	int i;
{
  MCSetT	*set;
  int		j;

  for (j = 0; j < i; j++) {
	set = cat->sets + j;
	if (!set->invalid) {
	    free(set->data.str);
	    free(set->u.msgs);
	}
  }
  free(cat->sets);
}

static nl_catd
loadCat(catpath)
	__const char *catpath;
{
    MCHeaderT	header;
    MCCatT	*cat;
    MCSetT	*set;
    long        i;
    off_t	nextSet;

    cat = (MCCatT *) malloc(sizeof(MCCatT));
    if (cat == NULL) return(NLERR);
    cat->loadType = MCLoadBySet;

    if ((cat->fp = fopen(catpath, "r")) == NULL) {
	free(cat);
	return(NLERR);
    }

    (void) _fcntl(fileno(cat->fp), F_SETFD, FD_CLOEXEC);

    if (fread(&header, sizeof(header), 1, cat->fp) != 1)
    	CORRUPT();

    if (strncmp(header.magic, MCMagic, MCMagicLen) != 0) CORRUPT();

    if (header.majorVer != MCMajorVer) {
	free(cat);
	fprintf(stderr, "%s: %s is version %ld, we need %ld.\n", _errowner,
		catpath, header.majorVer, MCMajorVer);
	NLRETERR(EINVAL);
    }

    if (header.numSets <= 0) {
	free(cat);
	fprintf(stderr, "%s: %s has %ld sets!\n", _errowner, catpath,
		header.numSets);
	NLRETERR(EINVAL);
    }

    cat->numSets = header.numSets;
    cat->sets = (MCSetT *) malloc(sizeof(MCSetT) * header.numSets);
    if (cat->sets == NULL) NOSPACE();

    nextSet = header.firstSet;
    for (i = 0; i < cat->numSets; ++i) {
	if (fseeko(cat->fp, nextSet, SEEK_SET) == -1) {
		__nls_free_resources(cat, i);
		CORRUPT();
	}

	/* read in the set header */
	set = cat->sets + i;
	if (fread(set, sizeof(*set), 1, cat->fp) != 1) {
		__nls_free_resources(cat, i);
		CORRUPT();
	}

	/* if it's invalid, skip over it (and backup 'i') */
	if (set->invalid) {
	    --i;
	    nextSet = set->nextSet;
	    continue;
	}

#if 0
	if (cat->loadType == MCLoadAll) {
	    int res;

	    if ((res = loadSet(cat, set)) <= 0) {
		__nls_free_resources(cat, i);
		if (res < 0) NOSPACE();
		CORRUPT();
	    }
	} else
#endif
		set->invalid = TRUE;
	nextSet = set->nextSet;
    }
#if 0
    if (cat->loadType == MCLoadAll) {
	(void) fclose(cat->fp);
	cat->fp = NULL;
    }
#endif
    return((nl_catd) cat);
}

static int
loadSet(cat, set)
	MCCatT *cat;
	MCSetT *set;
{
    MCMsgT	*msg;
    int		i;

    /* Get the data */
    if (fseeko(cat->fp, set->data.off, SEEK_SET) == -1) return(0);
    if ((set->data.str = malloc(set->dataLen)) == NULL) return(-1);
    if (fread(set->data.str, set->dataLen, 1, cat->fp) != 1) {
	free(set->data.str); return(0);
    }

    /* Get the messages */
    if (fseeko(cat->fp, set->u.firstMsg, SEEK_SET) == -1) {
	free(set->data.str); return(0);
    }
    if ((set->u.msgs = (MCMsgT *) malloc(sizeof(MCMsgT) * set->numMsgs)) == NULL) {
	free(set->data.str); return(-1);
    }

    for (i = 0; i < set->numMsgs; ++i) {
	msg = set->u.msgs + i;
	if (fread(msg, sizeof(*msg), 1, cat->fp) != 1) {
	    free(set->u.msgs); free(set->data.str); return(0);
	}
	if (msg->invalid) {
	    --i;
	    continue;
	}
	msg->msg.str = (char *) (set->data.str + msg->msg.off);
    }
    set->invalid = FALSE;
    return(1);
}