2
0
mirror of https://github.com/Aigor44/ncursesw-morphos.git synced 2025-01-24 15:13:56 +08:00
ncursesw-morphos/ncurses/tinfo/alloc_entry.c

290 lines
8.5 KiB
C
Raw Normal View History

1998-03-01 12:21:12 +08:00
/****************************************************************************
2006-12-18 12:32:42 +08:00
* Copyright (c) 1998-2005,2006 Free Software Foundation, Inc. *
1998-03-01 12:21:12 +08:00
* *
* Permission is hereby granted, free of charge, to any person obtaining a *
* copy of this software and associated documentation files (the *
* "Software"), to deal in the Software without restriction, including *
* without limitation the rights to use, copy, modify, merge, publish, *
* distribute, distribute with modifications, sublicense, and/or sell *
* copies of the Software, and to permit persons to whom the Software is *
* furnished to do so, subject to the following conditions: *
* *
* The above copyright notice and this permission notice shall be included *
* in all copies or substantial portions of the Software. *
* *
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
* IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
* OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
* THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
* *
* Except as contained in this notice, the name(s) of the above copyright *
* holders shall not be used in advertising or otherwise to promote the *
* sale, use or other dealings in this Software without prior written *
* authorization. *
****************************************************************************/
/****************************************************************************
* Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 *
* and: Eric S. Raymond <esr@snark.thyrsus.com> *
2005-10-10 02:41:57 +08:00
* and: Thomas E. Dickey 1996-on *
1998-03-01 12:21:12 +08:00
****************************************************************************/
1997-05-15 12:00:00 +08:00
/*
* alloc_entry.c -- allocation functions for terminfo entries
*
1999-10-24 12:32:42 +08:00
* _nc_copy_entry()
1997-05-15 12:00:00 +08:00
* _nc_init_entry()
1999-10-24 12:32:42 +08:00
* _nc_merge_entry()
1997-05-15 12:00:00 +08:00
* _nc_save_str()
1999-10-24 12:32:42 +08:00
* _nc_wrap_entry()
1997-05-15 12:00:00 +08:00
*
*/
#include <curses.priv.h>
#include <tic.h>
#include <term_entry.h>
2006-12-18 12:32:42 +08:00
MODULE_ID("$Id: alloc_entry.c,v 1.47 2006/12/16 19:06:58 tom Exp $")
1999-10-24 12:32:42 +08:00
#define ABSENT_OFFSET -1
#define CANCELLED_OFFSET -2
1997-05-15 12:00:00 +08:00
#define MAX_STRTAB 4096 /* documented maximum entry size */
2002-10-13 11:35:53 +08:00
static char *stringbuf; /* buffer for string capabilities */
2000-07-09 10:46:08 +08:00
static size_t next_free; /* next free character in stringbuf */
1997-05-15 12:00:00 +08:00
2002-10-13 11:35:53 +08:00
NCURSES_EXPORT(void)
2005-10-10 02:41:57 +08:00
_nc_init_entry(TERMTYPE *const tp)
1997-05-15 12:00:00 +08:00
/* initialize a terminal type data block */
{
2004-02-09 10:15:26 +08:00
unsigned i;
1997-05-15 12:00:00 +08:00
2005-10-10 02:41:57 +08:00
#if NO_LEAKS
if (tp == 0 && stringbuf != 0) {
FreeAndNull(stringbuf);
return;
}
#endif
2002-10-13 11:35:53 +08:00
if (stringbuf == 0)
2004-02-09 10:15:26 +08:00
stringbuf = (char *) malloc(MAX_STRTAB);
2002-10-13 11:35:53 +08:00
1999-10-24 12:32:42 +08:00
#if NCURSES_XNAMES
2000-07-09 10:46:08 +08:00
tp->num_Booleans = BOOLCOUNT;
tp->num_Numbers = NUMCOUNT;
tp->num_Strings = STRCOUNT;
tp->ext_Booleans = 0;
tp->ext_Numbers = 0;
tp->ext_Strings = 0;
1999-10-24 12:32:42 +08:00
#endif
2000-07-09 10:46:08 +08:00
if (tp->Booleans == 0)
2006-12-18 12:32:42 +08:00
tp->Booleans = typeMalloc(NCURSES_SBOOL, BOOLCOUNT);
2000-07-09 10:46:08 +08:00
if (tp->Numbers == 0)
tp->Numbers = typeMalloc(short, NUMCOUNT);
if (tp->Strings == 0)
tp->Strings = typeMalloc(char *, STRCOUNT);
1999-10-24 12:32:42 +08:00
2000-07-09 10:46:08 +08:00
for_each_boolean(i, tp)
tp->Booleans[i] = FALSE;
1999-10-24 12:32:42 +08:00
2000-07-09 10:46:08 +08:00
for_each_number(i, tp)
tp->Numbers[i] = ABSENT_NUMERIC;
1999-10-24 12:32:42 +08:00
2000-07-09 10:46:08 +08:00
for_each_string(i, tp)
tp->Strings[i] = ABSENT_STRING;
1997-05-15 12:00:00 +08:00
2000-07-09 10:46:08 +08:00
next_free = 0;
1999-10-24 12:32:42 +08:00
}
1997-05-15 12:00:00 +08:00
2002-10-13 11:35:53 +08:00
NCURSES_EXPORT(ENTRY *)
2000-07-09 10:46:08 +08:00
_nc_copy_entry(ENTRY * oldp)
1999-10-24 12:32:42 +08:00
{
2000-07-09 10:46:08 +08:00
ENTRY *newp = typeCalloc(ENTRY, 1);
1997-05-15 12:00:00 +08:00
2000-07-09 10:46:08 +08:00
if (newp != 0) {
*newp = *oldp;
_nc_copy_termtype(&(newp->tterm), &(oldp->tterm));
}
return newp;
1997-05-15 12:00:00 +08:00
}
2005-10-10 02:41:57 +08:00
/* save a copy of string in the string buffer */
2002-10-13 11:35:53 +08:00
NCURSES_EXPORT(char *)
2000-07-09 10:46:08 +08:00
_nc_save_str(const char *const string)
1997-05-15 12:00:00 +08:00
{
2005-10-10 02:41:57 +08:00
char *result = 0;
2000-07-09 10:46:08 +08:00
size_t old_next_free = next_free;
size_t len = strlen(string) + 1;
2005-10-10 02:41:57 +08:00
if (len == 1 && next_free != 0) {
/*
* Cheat a little by making an empty string point to the end of the
* previous string.
*/
if (next_free < MAX_STRTAB) {
result = (stringbuf + next_free - 1);
}
} else if (next_free + len < MAX_STRTAB) {
2000-07-09 10:46:08 +08:00
strcpy(&stringbuf[next_free], string);
DEBUG(7, ("Saved string %s", _nc_visbuf(string)));
DEBUG(7, ("at location %d", (int) next_free));
next_free += len;
2005-10-10 02:41:57 +08:00
result = (stringbuf + old_next_free);
} else {
_nc_warning("Too much data, some is lost");
2000-07-09 10:46:08 +08:00
}
2005-10-10 02:41:57 +08:00
return result;
1997-05-15 12:00:00 +08:00
}
2002-10-13 11:35:53 +08:00
NCURSES_EXPORT(void)
_nc_wrap_entry(ENTRY * const ep, bool copy_strings)
1997-05-15 12:00:00 +08:00
/* copy the string parts to allocated storage, preserving pointers to it */
{
2000-07-09 10:46:08 +08:00
int offsets[MAX_ENTRY_SIZE / 2], useoffsets[MAX_USES];
2004-02-09 10:15:26 +08:00
unsigned i, n;
unsigned nuses = ep->nuses;
2000-07-09 10:46:08 +08:00
TERMTYPE *tp = &(ep->tterm);
2002-10-13 11:35:53 +08:00
if (copy_strings) {
next_free = 0; /* clear static storage */
/* copy term_names, Strings, uses */
tp->term_names = _nc_save_str(tp->term_names);
for_each_string(i, tp) {
if (tp->Strings[i] != ABSENT_STRING &&
tp->Strings[i] != CANCELLED_STRING) {
tp->Strings[i] = _nc_save_str(tp->Strings[i]);
}
}
2004-02-09 10:15:26 +08:00
for (i = 0; i < nuses; i++) {
2002-10-13 11:35:53 +08:00
if (ep->uses[i].name == 0) {
ep->uses[i].name = _nc_save_str(ep->uses[i].name);
}
}
free(tp->str_table);
}
2000-07-09 10:46:08 +08:00
n = tp->term_names - stringbuf;
for_each_string(i, &(ep->tterm)) {
if (tp->Strings[i] == ABSENT_STRING)
offsets[i] = ABSENT_OFFSET;
else if (tp->Strings[i] == CANCELLED_STRING)
offsets[i] = CANCELLED_OFFSET;
else
offsets[i] = tp->Strings[i] - stringbuf;
}
1997-05-15 12:00:00 +08:00
2004-02-09 10:15:26 +08:00
for (i = 0; i < nuses; i++) {
2000-07-09 10:46:08 +08:00
if (ep->uses[i].name == 0)
useoffsets[i] = ABSENT_OFFSET;
else
useoffsets[i] = ep->uses[i].name - stringbuf;
}
1997-05-15 12:00:00 +08:00
2000-07-09 10:46:08 +08:00
if ((tp->str_table = typeMalloc(char, next_free)) == (char *) 0)
2002-10-13 11:35:53 +08:00
_nc_err_abort(MSG_NO_MEMORY);
2000-07-09 10:46:08 +08:00
(void) memcpy(tp->str_table, stringbuf, next_free);
tp->term_names = tp->str_table + n;
for_each_string(i, &(ep->tterm)) {
if (offsets[i] == ABSENT_OFFSET)
tp->Strings[i] = ABSENT_STRING;
else if (offsets[i] == CANCELLED_OFFSET)
tp->Strings[i] = CANCELLED_STRING;
else
tp->Strings[i] = tp->str_table + offsets[i];
}
1997-05-15 12:00:00 +08:00
1999-10-24 12:32:42 +08:00
#if NCURSES_XNAMES
2002-10-13 11:35:53 +08:00
if (!copy_strings) {
if ((n = NUM_EXT_NAMES(tp)) != 0) {
unsigned length = 0;
for (i = 0; i < n; i++) {
length += strlen(tp->ext_Names[i]) + 1;
offsets[i] = tp->ext_Names[i] - stringbuf;
}
if ((tp->ext_str_table = typeMalloc(char, length)) == 0)
_nc_err_abort(MSG_NO_MEMORY);
for (i = 0, length = 0; i < n; i++) {
tp->ext_Names[i] = tp->ext_str_table + length;
strcpy(tp->ext_Names[i], stringbuf + offsets[i]);
length += strlen(tp->ext_Names[i]) + 1;
}
1999-10-24 12:32:42 +08:00
}
2000-07-09 10:46:08 +08:00
}
1999-10-24 12:32:42 +08:00
#endif
2004-02-09 10:15:26 +08:00
for (i = 0; i < nuses; i++) {
2000-07-09 10:46:08 +08:00
if (useoffsets[i] == ABSENT_OFFSET)
ep->uses[i].name = 0;
else
ep->uses[i].name = (tp->str_table + useoffsets[i]);
}
1997-05-15 12:00:00 +08:00
}
2002-10-13 11:35:53 +08:00
NCURSES_EXPORT(void)
2005-10-10 02:41:57 +08:00
_nc_merge_entry(TERMTYPE *const to, TERMTYPE *const from)
1997-05-15 12:00:00 +08:00
/* merge capabilities from `from' entry into `to' entry */
{
2004-02-09 10:15:26 +08:00
unsigned i;
1997-05-15 12:00:00 +08:00
1999-10-24 12:32:42 +08:00
#if NCURSES_XNAMES
_nc_align_termtype(to, from);
#endif
2000-07-09 10:46:08 +08:00
for_each_boolean(i, from) {
2005-10-10 02:41:57 +08:00
if (to->Booleans[i] != (char) CANCELLED_BOOLEAN) {
2004-02-09 10:15:26 +08:00
int mergebool = from->Booleans[i];
1997-05-15 12:00:00 +08:00
2004-02-09 10:15:26 +08:00
if (mergebool == CANCELLED_BOOLEAN)
to->Booleans[i] = FALSE;
else if (mergebool == TRUE)
to->Booleans[i] = mergebool;
}
1997-05-15 12:00:00 +08:00
}
2000-07-09 10:46:08 +08:00
for_each_number(i, from) {
2004-02-09 10:15:26 +08:00
if (to->Numbers[i] != CANCELLED_NUMERIC) {
int mergenum = from->Numbers[i];
1997-05-15 12:00:00 +08:00
2004-02-09 10:15:26 +08:00
if (mergenum == CANCELLED_NUMERIC)
to->Numbers[i] = ABSENT_NUMERIC;
else if (mergenum != ABSENT_NUMERIC)
to->Numbers[i] = mergenum;
}
1997-05-15 12:00:00 +08:00
}
/*
* Note: the copies of strings this makes don't have their own
* storage. This is OK right now, but will be a problem if we
* we ever want to deallocate entries.
*/
2000-07-09 10:46:08 +08:00
for_each_string(i, from) {
2004-02-09 10:15:26 +08:00
if (to->Strings[i] != CANCELLED_STRING) {
char *mergestring = from->Strings[i];
1997-05-15 12:00:00 +08:00
2004-02-09 10:15:26 +08:00
if (mergestring == CANCELLED_STRING)
to->Strings[i] = ABSENT_STRING;
else if (mergestring != ABSENT_STRING)
to->Strings[i] = mergestring;
}
1997-05-15 12:00:00 +08:00
}
}
2005-10-10 02:41:57 +08:00
#if NO_LEAKS
NCURSES_EXPORT(void)
_nc_alloc_entry_leaks(void)
{
2006-12-18 12:32:42 +08:00
if (stringbuf != 0) {
FreeAndNull(stringbuf);
}
2005-10-10 02:41:57 +08:00
next_free = 0;
}
#endif