|
|
1.1 root 1: /*
2: * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
3: *
4: * @APPLE_LICENSE_HEADER_START@
5: *
6: * The contents of this file constitute Original Code as defined in and
7: * are subject to the Apple Public Source License Version 1.1 (the
8: * "License"). You may not use this file except in compliance with the
9: * License. Please obtain a copy of the License at
10: * http://www.apple.com/publicsource and read it before using this file.
11: *
12: * This Original Code and all software distributed under the License are
13: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
14: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
15: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
16: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
17: * License for the specific language governing rights and limitations
18: * under the License.
19: *
20: * @APPLE_LICENSE_HEADER_END@
21: */
22: /*-
23: * Copyright (c) 1990, 1993
24: * The Regents of the University of California. All rights reserved.
25: *
26: * This code is derived from software contributed to Berkeley by
27: * Margo Seltzer.
28: *
29: * Redistribution and use in source and binary forms, with or without
30: * modification, are permitted provided that the following conditions
31: * are met:
32: * 1. Redistributions of source code must retain the above copyright
33: * notice, this list of conditions and the following disclaimer.
34: * 2. Redistributions in binary form must reproduce the above copyright
35: * notice, this list of conditions and the following disclaimer in the
36: * documentation and/or other materials provided with the distribution.
37: * 3. All advertising materials mentioning features or use of this software
38: * must display the following acknowledgement:
39: * This product includes software developed by the University of
40: * California, Berkeley and its contributors.
41: * 4. Neither the name of the University nor the names of its contributors
42: * may be used to endorse or promote products derived from this software
43: * without specific prior written permission.
44: *
45: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
46: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
47: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
48: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
49: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
50: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
51: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
52: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
53: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
54: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
55: * SUCH DAMAGE.
56: *
57: * @(#)ndbm.h 8.1 (Berkeley) 6/2/93
58: */
59:
60: #ifndef _NDBM_H_
61: #define _NDBM_H_
62:
63: #include <db.h>
64:
65: /* Map dbm interface onto db(3). */
66: #define DBM_RDONLY O_RDONLY
67:
68: /* Flags to dbm_store(). */
69: #define DBM_INSERT 0
70: #define DBM_REPLACE 1
71:
72: /*
73: * The db(3) support for ndbm(3) always appends this suffix to the
74: * file name to avoid overwriting the user's original database.
75: */
76: #define DBM_SUFFIX ".db"
77:
78: typedef struct {
79: char *dptr;
80: int dsize;
81: } datum;
82:
83: typedef DB DBM;
84: #define dbm_pagfno(a) DBM_PAGFNO_NOT_AVAILABLE
85:
86: __BEGIN_DECLS
87: void dbm_close __P((DBM *));
88: int dbm_delete __P((DBM *, datum));
89: datum dbm_fetch __P((DBM *, datum));
90: datum dbm_firstkey __P((DBM *));
91: long dbm_forder __P((DBM *, datum));
92: datum dbm_nextkey __P((DBM *));
93: DBM *dbm_open __P((const char *, int, int));
94: int dbm_store __P((DBM *, datum, datum, int));
95: int dbm_dirfno __P((DBM *));
96: __END_DECLS
97:
98: #endif /* !_NDBM_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.