003 File Manager
Current Path:
/usr/src/contrib/ncurses/ncurses/tinfo
usr
/
src
/
contrib
/
ncurses
/
ncurses
/
tinfo
/
📁
..
📄
MKcaptab.awk
(3.75 KB)
📄
MKcaptab.sh
(6.23 KB)
📄
MKcodes.awk
(6.15 KB)
📄
MKfallback.sh
(4.32 KB)
📄
MKkeys_list.sh
(2.83 KB)
📄
MKnames.awk
(7.32 KB)
📄
MKuserdefs.sh
(4.51 KB)
📄
README
(2.67 KB)
📄
access.c
(5.24 KB)
📄
add_tries.c
(4.12 KB)
📄
alloc_entry.c
(8.89 KB)
📄
alloc_ttype.c
(17.38 KB)
📄
captoinfo.c
(25.38 KB)
📄
comp_error.c
(5.19 KB)
📄
comp_expand.c
(7.11 KB)
📄
comp_hash.c
(5.43 KB)
📄
comp_parse.c
(19.35 KB)
📄
comp_scan.c
(25.5 KB)
📄
db_iterator.c
(11.56 KB)
📄
doalloc.c
(2.94 KB)
📄
entries.c
(5.38 KB)
📄
free_ttype.c
(3.64 KB)
📄
getenv_num.c
(3.22 KB)
📄
hashed_db.c
(8.09 KB)
📄
home_terminfo.c
(3.07 KB)
📄
init_keytry.c
(3.91 KB)
📄
lib_acs.c
(12.9 KB)
📄
lib_baudrate.c
(7.41 KB)
📄
lib_cur_term.c
(5.58 KB)
📄
lib_data.c
(10.92 KB)
📄
lib_has_cap.c
(3.68 KB)
📄
lib_kernel.c
(5.17 KB)
📄
lib_longname.c
(3.73 KB)
📄
lib_napms.c
(3.7 KB)
📄
lib_options.c
(9.58 KB)
📄
lib_print.c
(4.44 KB)
📄
lib_raw.c
(9.45 KB)
📄
lib_setup.c
(24.89 KB)
📄
lib_termcap.c
(12.72 KB)
📄
lib_termname.c
(2.68 KB)
📄
lib_tgoto.c
(5.93 KB)
📄
lib_ti.c
(5.58 KB)
📄
lib_tparm.c
(20.23 KB)
📄
lib_tputs.c
(11.39 KB)
📄
lib_ttyflags.c
(7.86 KB)
📄
make_hash.c
(11.92 KB)
📄
make_keys.c
(4.79 KB)
📄
name_match.c
(4.21 KB)
📄
obsolete.c
(6.93 KB)
📄
parse_entry.c
(32.3 KB)
📄
read_entry.c
(24.47 KB)
📄
read_termcap.c
(33.32 KB)
📄
strings.c
(4.65 KB)
📄
tinfo_driver.c
(34.5 KB)
📄
trim_sgr0.c
(9.39 KB)
📄
use_screen.c
(3.05 KB)
📄
write_entry.c
(24.01 KB)
Editing: hashed_db.c
/**************************************************************************** * Copyright 2019,2020 Thomas E. Dickey * * Copyright 2006-2011,2013 Free Software Foundation, Inc. * * * * 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: Thomas E. Dickey 2006-on * ****************************************************************************/ #include <curses.priv.h> #include <tic.h> #include <hashed_db.h> #if USE_HASHED_DB MODULE_ID("$Id: hashed_db.c,v 1.19 2020/02/02 23:34:34 tom Exp $") #if HASHED_DB_API >= 2 static DBC *cursor; #endif typedef struct _myconn { struct _myconn *next; DB *db; char *path; bool modify; } MYCONN; static MYCONN *connections; static void cleanup(void) { while (connections != 0) { _nc_db_close(connections->db); } } static DB * find_connection(const char *path, bool modify) { DB *result = 0; MYCONN *p; for (p = connections; p != 0; p = p->next) { if (!strcmp(p->path, path) && p->modify == modify) { result = p->db; break; } } return result; } static void drop_connection(DB * db) { MYCONN *p, *q; for (p = connections, q = 0; p != 0; q = p, p = p->next) { if (p->db == db) { if (q != 0) q->next = p->next; else connections = p->next; free(p->path); free(p); break; } } } static void make_connection(DB * db, const char *path, bool modify) { MYCONN *p = typeCalloc(MYCONN, 1); if (p != 0) { p->db = db; p->path = strdup(path); p->modify = modify; if (p->path != 0) { p->next = connections; connections = p; } else { free(p); } } } /* * Open the database. */ NCURSES_EXPORT(DB *) _nc_db_open(const char *path, bool modify) { DB *result = 0; int code; if (connections == 0) atexit(cleanup); if ((result = find_connection(path, modify)) == 0) { #if HASHED_DB_API >= 4 db_create(&result, NULL, 0); if ((code = result->open(result, NULL, path, NULL, DB_HASH, modify ? DB_CREATE : DB_RDONLY, 0644)) != 0) { result = 0; } #elif HASHED_DB_API >= 3 db_create(&result, NULL, 0); if ((code = result->open(result, path, NULL, DB_HASH, modify ? DB_CREATE : DB_RDONLY, 0644)) != 0) { result = 0; } #elif HASHED_DB_API >= 2 if ((code = db_open(path, DB_HASH, modify ? DB_CREATE : DB_RDONLY, 0644, (DB_ENV *) 0, (DB_INFO *) 0, &result)) != 0) { result = 0; } #else if ((result = dbopen(path, modify ? (O_CREAT | O_RDWR) : O_RDONLY, 0644, DB_HASH, NULL)) == 0) { code = errno; } #endif if (result != 0) { make_connection(result, path, modify); T(("opened %s", path)); } else { T(("cannot open %s: %s", path, strerror(code))); } } return result; } /* * Close the database. Do not attempt to use the 'db' handle after this call. */ NCURSES_EXPORT(int) _nc_db_close(DB * db) { int result; drop_connection(db); #if HASHED_DB_API >= 2 result = db->close(db, 0); #else result = db->close(db); #endif return result; } /* * Write a record to the database. * * Returns 0 on success. * * FIXME: the FreeBSD cap_mkdb program assumes the database could have * duplicates. There appears to be no good reason for that (review/fix). */ NCURSES_EXPORT(int) _nc_db_put(DB * db, DBT * key, DBT * data) { int result; #if HASHED_DB_API >= 2 /* remove any pre-existing value, since we do not want duplicates */ (void) db->del(db, NULL, key, 0); result = db->put(db, NULL, key, data, DB_NOOVERWRITE); #else result = db->put(db, key, data, R_NOOVERWRITE); #endif return result; } /* * Read a record from the database. * * Returns 0 on success. */ NCURSES_EXPORT(int) _nc_db_get(DB * db, DBT * key, DBT * data) { int result; memset(data, 0, sizeof(*data)); #if HASHED_DB_API >= 2 result = db->get(db, NULL, key, data, 0); #else result = db->get(db, key, data, 0); #endif return result; } /* * Read the first record from the database, ignoring order. * * Returns 0 on success. */ NCURSES_EXPORT(int) _nc_db_first(DB * db, DBT * key, DBT * data) { int result; memset(key, 0, sizeof(*key)); memset(data, 0, sizeof(*data)); #if HASHED_DB_API >= 2 if ((result = db->cursor(db, NULL, &cursor, 0)) == 0) { result = cursor->c_get(cursor, key, data, DB_FIRST); } #else result = db->seq(db, key, data, 0); #endif return result; } /* * Read the next record from the database, ignoring order. * * Returns 0 on success. */ NCURSES_EXPORT(int) _nc_db_next(DB * db, DBT * key, DBT * data) { int result; #if HASHED_DB_API >= 2 (void) db; if (cursor != 0) { result = cursor->c_get(cursor, key, data, DB_NEXT); } else { result = -1; } #else result = db->seq(db, key, data, R_NEXT); #endif return result; } /* * Check if a record is a terminfo index record. Index records are those that * contain only an alias pointing to a list of aliases. */ NCURSES_EXPORT(bool) _nc_db_have_index(DBT * key, DBT * data, char **buffer, int *size) { bool result = FALSE; int used = (int) data->size - 1; char *have = (char *) data->data; (void) key; if (*have++ == 2) { result = TRUE; } /* * Update params in any case for consistency with _nc_db_have_data(). */ *buffer = have; *size = used; return result; } /* * Check if a record is the terminfo data record. Ignore index records, e.g., * those that contain only an alias pointing to a list of aliases. */ NCURSES_EXPORT(bool) _nc_db_have_data(DBT * key, DBT * data, char **buffer, int *size) { bool result = FALSE; int used = (int) data->size - 1; char *have = (char *) data->data; if (*have++ == 0) { if (data->size > key->size && IS_TIC_MAGIC(have)) { result = TRUE; } } /* * Update params in any case to make it simple to follow a index record * to the data record. */ *buffer = have; *size = used; return result; } #else extern NCURSES_EXPORT(void) _nc_hashed_db(void); NCURSES_EXPORT(void) _nc_hashed_db(void) { } #endif /* USE_HASHED_DB */
Upload File
Create Folder