add db.1.85
[nvi.git] / db.1.85 / db / tags
blobf9c1143b716a32874242485317c20510e55942bf
1 BT_CLR  ../btree/btree.h        /^#define       BT_CLR(t)       (t->bt_sp = t->bt_stack)$/
2 BT_POP  ../btree/btree.h        /^#define       BT_POP(t)       (t->bt_sp == t->bt_stack ? NULL /
3 BT_PUSH ../btree/btree.h        /^#define       BT_PUSH(t, p, i) {                                              \\$/
4 BUCKET_TO_PAGE  ../hash/hash.h  /^#define BUCKET_TO_PAGE(B) \\$/
5 BUF_INSERT      ../hash/hash_buf.c      /^#define BUF_INSERT(B, P) { \\$/
6 BUF_REMOVE      ../hash/hash_buf.c      /^#define BUF_REMOVE(B) { \\$/
7 CLRBIT  ../hash/hash.h  /^#define CLRBIT(A, N)  ((A)[(N)\/BITS_PER_MAP] &= ~(/
8 DODISK  ../hash/hash.h  /^#define DODISK(X)     ((X) = (char *)((ptrdiff_t)(X)|0/
9 DOMOD   ../hash/hash.h  /^#define DOMOD(X)      ((X) = (char *)((ptrdiff_t)(X)|0x/
10 FREESPACE       ../hash/page.h  /^#define FREESPACE(P)  ((P)[(P)[0]+1])$/
11 F_CLR   ../btree/btree.h        /^#define       F_CLR(p, f)     (p)->flags &= ~(f)$/
12 F_ISSET ../btree/btree.h        /^#define       F_ISSET(p, f)   ((p)->flags & (f))$/
13 F_SET   ../btree/btree.h        /^#define       F_SET(p, f)     (p)->flags |= (f)$/
14 GETBINTERNAL    ../btree/btree.h        /^#define       GETBINTERNAL(pg, indx)                                          \\$/
15 GETBLEAF        ../btree/btree.h        /^#define       GETBLEAF(pg, indx)                                              \\$/
16 GETRINTERNAL    ../btree/btree.h        /^#define       GETRINTERNAL(pg, indx)                                          \\$/
17 GETRLEAF        ../btree/btree.h        /^#define       GETRLEAF(pg, indx)                                              \\$/
18 HASHKEY ../include/mpool.h      /^#define       HASHKEY(pgno)   ((pgno - 1) % HASHSIZE)$/
19 ISDISK  ../hash/hash.h  /^#define ISDISK(X)     ((u_int32_t)(ptrdiff_t)(X)&0x2)$/
20 ISMOD   ../hash/hash.h  /^#define ISMOD(X)      ((u_int32_t)(ptrdiff_t)(X)&0x1)$/
21 ISSET   ../hash/hash.h  /^#define ISSET(A, N)   ((A)[(N)\/BITS_PER_MAP] & (1<</
22 IS_BUCKET       ../hash/hash.h  /^#define IS_BUCKET(X)  ((X) & BUF_BUCKET)$/
23 KEYSIZE ../hash/page.h  /^#define KEYSIZE(K)    (4*sizeof(u_int16_t) + (K)->siz/
24 LALIGN  ../btree/btree.h        /^#define       LALIGN(n)       (((n) + sizeof(pgno_t) - 1) & ~(/
25 LRU_INSERT      ../hash/hash_buf.c      /^#define LRU_INSERT(B) BUF_INSERT((B), LRU)$/
26 MOD     ../hash/hash.c  /^#define MOD(x, y)             ((x) & ((y) - 1))$/
27 MRU_INSERT      ../hash/hash_buf.c      /^#define MRU_INSERT(B) BUF_INSERT((B), &hashp->bufh/
28 M_16_SWAP       ../include/db.h /^#define       M_16_SWAP(a) {                                                  \\$/
29 M_32_SWAP       ../include/db.h /^#define       M_32_SWAP(a) {                                                  \\$/
30 NBINTERNAL      ../btree/btree.h        /^#define NBINTERNAL(len)                                                       \\$/
31 NBLEAF  ../btree/btree.h        /^#define NBLEAF(p)     NBLEAFDBT((p)->ksize, (p)->dsize/
32 NBLEAFDBT       ../btree/btree.h        /^#define NBLEAFDBT(ksize, dsize)                                               \\$/
33 NEXTINDEX       ../btree/btree.h        /^#define       NEXTINDEX(p)    (((p)->lower - BTDATAOFF) \/ /
34 NRLEAF  ../btree/btree.h        /^#define NRLEAF(p)     NRLEAFDBT((p)->dsize)$/
35 NRLEAFDBT       ../btree/btree.h        /^#define       NRLEAFDBT(dsize)                                                \\$/
36 OADDR_OF        ../hash/hash.h  /^#define       OADDR_OF(S,O)   ((u_int32_t)((u_int32_t)(S) /
37 OADDR_TO_PAGE   ../hash/hash.h  /^#define OADDR_TO_PAGE(B)      \\$/
38 OFFSET  ../hash/page.h  /^#define       OFFSET(P)       ((P)[(P)[0]+2])$/
39 OPAGENUM        ../hash/hash.h  /^#define OPAGENUM(N)   ((N) & SPLITMASK)$/
40 PAGE_INIT       ../hash/hash_page.c     /^#define       PAGE_INIT(P) { \\$/
41 PAGE_META       ../hash/page.h  /^#define PAGE_META(N)  (((N)+3) * sizeof(u_int16_t))/
42 PAIRFITS        ../hash/page.h  /^#define PAIRFITS(P,K,D) \\$/
43 PAIRSIZE        ../hash/page.h  /^#define       PAIRSIZE(K,D)   (2*sizeof(u_int16_t) + (K)->/
44 PTROF   ../hash/hash.h  /^#define PTROF(X)      ((BUFHEAD *)((ptrdiff_t)(X)&~0x3)/
45 P_16_COPY       ../include/db.h /^#define       P_16_COPY(a, b) {                                               \\$/
46 P_16_SWAP       ../include/db.h /^#define       P_16_SWAP(a) {                                                  \\$/
47 P_32_COPY       ../include/db.h /^#define       P_32_COPY(a, b) {                                               \\$/
48 P_32_SWAP       ../include/db.h /^#define       P_32_SWAP(a) {                                                  \\$/
49 RETURN_ERROR    ../hash/hash.c  /^#define RETURN_ERROR(ERR, LOC)        { save_errno = ERR;/
50 SETBIT  ../hash/hash.h  /^#define SETBIT(A, N)  ((A)[(N)\/BITS_PER_MAP] |= (1/
51 SPLITNUM        ../hash/hash.h  /^#define SPLITNUM(N)   (((u_int32_t)(N)) >> SPLITSHIF/
52 WR_BINTERNAL    ../btree/btree.h        /^#define       WR_BINTERNAL(p, size, pgno, flags) {                            \\/
53 WR_BLEAF        ../btree/btree.h        /^#define       WR_BLEAF(p, key, data, flags) {                                 \\$/
54 WR_RINTERNAL    ../btree/btree.h        /^#define       WR_RINTERNAL(p, nrecs, pgno) {                                  \\$/
55 WR_RLEAF        ../btree/btree.h        /^#define       WR_RLEAF(p, data, flags) {                                      \\$/
56 X       ../btree/bt_debug.c     /^#define       X(flag, name) \\$/
57 __add_ovflpage  ../hash/hash_page.c     /^__add_ovflpage(hashp, bufp)$/
58 __addel ../hash/hash_page.c     /^__addel(hashp, bufp, key, val)$/
59 __big_delete    ../hash/hash_bigkey.c   /^__big_delete(hashp, bufp)$/
60 __big_insert    ../hash/hash_bigkey.c   /^__big_insert(hashp, bufp, key, val)$/
61 __big_keydata   ../hash/hash_bigkey.c   /^__big_keydata(hashp, bufp, key, val, set)$/
62 __big_return    ../hash/hash_bigkey.c   /^__big_return(hashp, bufp, ndx, val, set_current)$/
63 __big_split     ../hash/hash_bigkey.c   /^__big_split(hashp, op, np, big_keyp, addr, obucket/
64 __bt_bdelete    ../btree/bt_delete.c    /^__bt_bdelete(t, key)$/
65 __bt_close      ../btree/bt_close.c     /^__bt_close(dbp)$/
66 __bt_cmp        ../btree/bt_utils.c     /^__bt_cmp(t, k1, e)$/
67 __bt_curdel     ../btree/bt_delete.c    /^__bt_curdel(t, key, h, index)$/
68 __bt_defcmp     ../btree/bt_utils.c     /^__bt_defcmp(a, b)$/
69 __bt_defpfx     ../btree/bt_utils.c     /^__bt_defpfx(a, b)$/
70 __bt_delete     ../btree/bt_delete.c    /^__bt_delete(dbp, key, flags)$/
71 __bt_dleaf      ../btree/bt_delete.c    /^__bt_dleaf(t, key, h, index)$/
72 __bt_dmpage     ../btree/bt_debug.c     /^__bt_dmpage(h)$/
73 __bt_dnpage     ../btree/bt_debug.c     /^__bt_dnpage(dbp, pgno)$/
74 __bt_dpage      ../btree/bt_debug.c     /^__bt_dpage(h)$/
75 __bt_dump       ../btree/bt_debug.c     /^__bt_dump(dbp)$/
76 __bt_fd ../btree/bt_open.c      /^__bt_fd(dbp)$/
77 __bt_first      ../btree/bt_seq.c       /^__bt_first(t, key, erval, exactp)$/
78 __bt_free       ../btree/bt_page.c      /^__bt_free(t, h)$/
79 __bt_get        ../btree/bt_get.c       /^__bt_get(dbp, key, data, flags)$/
80 __bt_new        ../btree/bt_page.c      /^__bt_new(t, npg)$/
81 __bt_open       ../btree/bt_open.c      /^__bt_open(fname, flags, mode, openinfo, dflags)$/
82 __bt_pdelete    ../btree/bt_delete.c    /^__bt_pdelete(t, h)$/
83 __bt_pgin       ../btree/bt_conv.c      /^__bt_pgin(t, pg, pp)$/
84 __bt_pgout      ../btree/bt_conv.c      /^__bt_pgout(t, pg, pp)$/
85 __bt_put        ../btree/bt_put.c       /^__bt_put(dbp, key, data, flags)$/
86 __bt_relink     ../btree/bt_delete.c    /^__bt_relink(t, h)$/
87 __bt_ret        ../btree/bt_utils.c     /^__bt_ret(t, e, key, rkey, data, rdata, copy)$/
88 __bt_search     ../btree/bt_search.c    /^__bt_search(t, key, exactp)$/
89 __bt_seq        ../btree/bt_seq.c       /^__bt_seq(dbp, key, data, flags)$/
90 __bt_seqadv     ../btree/bt_seq.c       /^__bt_seqadv(t, ep, flags)$/
91 __bt_seqset     ../btree/bt_seq.c       /^__bt_seqset(t, ep, key, flags)$/
92 __bt_setcur     ../btree/bt_seq.c       /^__bt_setcur(t, pgno, index)$/
93 __bt_snext      ../btree/bt_search.c    /^__bt_snext(t, h, key, exactp)$/
94 __bt_split      ../btree/bt_split.c     /^__bt_split(t, sp, key, data, flags, ilen, argskip)/
95 __bt_sprev      ../btree/bt_search.c    /^__bt_sprev(t, h, key, exactp)$/
96 __bt_stat       ../btree/bt_debug.c     /^__bt_stat(dbp)$/
97 __bt_stkacq     ../btree/bt_delete.c    /^__bt_stkacq(t, hp, c)$/
98 __bt_sync       ../btree/bt_close.c     /^__bt_sync(dbp, flags)$/
99 __buf_free      ../hash/hash_buf.c      /^__buf_free(hashp, do_free, to_disk)$/
100 __buf_init      ../hash/hash_buf.c      /^__buf_init(hashp, nbytes)$/
101 __call_hash     ../hash/hash.c  /^__call_hash(hashp, k, len)$/
102 __dberr ../db/db.c      /^__dberr()$/
103 __dbpanic       ../db/db.c      /^__dbpanic(dbp)$/
104 __delpair       ../hash/hash_page.c     /^__delpair(hashp, bufp, ndx)$/
105 __expand_table  ../hash/hash.c  /^__expand_table(hashp)$/
106 __find_bigpair  ../hash/hash_bigkey.c   /^__find_bigpair(hashp, bufp, ndx, key, size)$/
107 __find_last_page        ../hash/hash_bigkey.c   /^__find_last_page(hashp, bpp)$/
108 __free_ovflpage ../hash/hash_page.c     /^__free_ovflpage(hashp, obufp)$/
109 __get_buf       ../hash/hash_buf.c      /^__get_buf(hashp, addr, prev_bp, newpage)$/
110 __get_page      ../hash/hash_page.c     /^__get_page(hashp, p, bucket, is_bucket, is_disk, i/
111 __hash_open     ../hash/hash.c  /^__hash_open(file, flags, mode, info, dflags)$/
112 __ibitmap       ../hash/hash_page.c     /^__ibitmap(hashp, pnum, nbits, ndx)$/
113 __log2  ../hash/hash_log2.c     /^__log2(num)$/
114 __ovfl_delete   ../btree/bt_overflow.c  /^__ovfl_delete(t, p)$/
115 __ovfl_get      ../btree/bt_overflow.c  /^__ovfl_get(t, p, ssz, buf, bufsz)$/
116 __ovfl_put      ../btree/bt_overflow.c  /^__ovfl_put(t, dbt, pg)$/
117 __put_page      ../hash/hash_page.c     /^__put_page(hashp, p, bucket, is_bucket, is_bitmap)/
118 __rec_close     ../recno/rec_close.c    /^__rec_close(dbp)$/
119 __rec_delete    ../recno/rec_delete.c   /^__rec_delete(dbp, key, flags)$/
120 __rec_dleaf     ../recno/rec_delete.c   /^__rec_dleaf(t, h, index)$/
121 __rec_fd        ../recno/rec_open.c     /^__rec_fd(dbp)$/
122 __rec_fmap      ../recno/rec_get.c      /^__rec_fmap(t, top)$/
123 __rec_fpipe     ../recno/rec_get.c      /^__rec_fpipe(t, top)$/
124 __rec_get       ../recno/rec_get.c      /^__rec_get(dbp, key, data, flags)$/
125 __rec_iput      ../recno/rec_put.c      /^__rec_iput(t, nrec, data, flags)$/
126 __rec_open      ../recno/rec_open.c     /^__rec_open(fname, flags, mode, openinfo, dflags)$/
127 __rec_put       ../recno/rec_put.c      /^__rec_put(dbp, key, data, flags)$/
128 __rec_ret       ../recno/rec_utils.c    /^__rec_ret(t, e, nrec, key, data)$/
129 __rec_search    ../recno/rec_search.c   /^__rec_search(t, recno, op)$/
130 __rec_seq       ../recno/rec_seq.c      /^__rec_seq(dbp, key, data, flags)$/
131 __rec_sync      ../recno/rec_close.c    /^__rec_sync(dbp, flags)$/
132 __rec_vmap      ../recno/rec_get.c      /^__rec_vmap(t, top)$/
133 __rec_vpipe     ../recno/rec_get.c      /^__rec_vpipe(t, top)$/
134 __reclaim_buf   ../hash/hash_buf.c      /^__reclaim_buf(hashp, bp)$/
135 __split_page    ../hash/hash_page.c     /^__split_page(hashp, obucket, nbucket)$/
136 alloc_segs      ../hash/hash.c  /^alloc_segs(hashp, nsegs)$/
137 bt_broot        ../btree/bt_split.c     /^bt_broot(t, h, l, r)$/
138 bt_fast ../btree/bt_put.c       /^bt_fast(t, key, data, exactp)$/
139 bt_meta ../btree/bt_close.c     /^bt_meta(t)$/
140 bt_page ../btree/bt_split.c     /^bt_page(t, h, lp, rp, skip, ilen)$/
141 bt_preserve     ../btree/bt_split.c     /^bt_preserve(t, pg)$/
142 bt_psplit       ../btree/bt_split.c     /^bt_psplit(t, h, l, r, pskip, ilen)$/
143 bt_root ../btree/bt_split.c     /^bt_root(t, h, lp, rp, skip, ilen)$/
144 bt_rroot        ../btree/bt_split.c     /^bt_rroot(t, h, l, r)$/
145 byteorder       ../btree/bt_open.c      /^byteorder()$/
146 collect_data    ../hash/hash_bigkey.c   /^collect_data(hashp, bufp, len, set)$/
147 collect_key     ../hash/hash_bigkey.c   /^collect_key(hashp, bufp, len, val, set)$/
148 dbm_clearerr    ../hash/ndbm.c  /^dbm_clearerr(db)$/
149 dbm_close       ../hash/ndbm.c  /^dbm_close(db)$/
150 dbm_delete      ../hash/ndbm.c  /^dbm_delete(db, key)$/
151 dbm_dirfno      ../hash/ndbm.c  /^dbm_dirfno(db)$/
152 dbm_error       ../hash/ndbm.c  /^dbm_error(db)$/
153 dbm_fetch       ../hash/ndbm.c  /^dbm_fetch(db, key)$/
154 dbm_firstkey    ../hash/ndbm.c  /^dbm_firstkey(db)$/
155 dbm_nextkey     ../hash/ndbm.c  /^dbm_nextkey(db)$/
156 dbm_open        ../hash/ndbm.c  /^dbm_open(file, flags, mode)$/
157 dbm_store       ../hash/ndbm.c  /^dbm_store(db, key, content, flags)$/
158 dbopen  ../db/db.c      /^dbopen(fname, flags, mode, type, openinfo)$/
159 dcharhash       ../hash/hash_func.c     /^#define dcharhash(h, c)       ((h) = 0x63c63cd9*(h) + 0x/
160 fetch_bitmap    ../hash/hash_page.c     /^fetch_bitmap(hashp, ndx)$/
161 first_free      ../hash/hash_page.c     /^first_free(map)$/
162 flush_meta      ../hash/hash.c  /^flush_meta(hashp)$/
163 hash2   ../hash/hash_func.c     /^hash2(keyarg, len)$/
164 hash3   ../hash/hash_func.c     /^hash3(keyarg, len)$/
165 hash4   ../hash/hash_func.c     /^hash4(keyarg, len)$/
166 hash_access     ../hash/hash.c  /^hash_access(hashp, action, key, val)$/
167 hash_close      ../hash/hash.c  /^hash_close(dbp)$/
168 hash_delete     ../hash/hash.c  /^hash_delete(dbp, key, flag)$/
169 hash_fd ../hash/hash.c  /^hash_fd(dbp)$/
170 hash_get        ../hash/hash.c  /^hash_get(dbp, key, data, flag)$/
171 hash_put        ../hash/hash.c  /^hash_put(dbp, key, data, flag)$/
172 hash_realloc    ../hash/hash.c  /^hash_realloc(p_ptr, oldsize, newsize)$/
173 hash_seq        ../hash/hash.c  /^hash_seq(dbp, key, data, flag)$/
174 hash_sync       ../hash/hash.c  /^hash_sync(dbp, flags)$/
175 hcreate ../hash/hsearch.c       /^hcreate(nel)$/
176 hdestroy        ../hash/hash.c  /^hdestroy(hashp)$/
177 hsearch ../hash/hsearch.c       /^hsearch(item, action)$/
178 init_hash       ../hash/hash.c  /^init_hash(hashp, file, info)$/
179 init_htab       ../hash/hash.c  /^init_htab(hashp, nelem)$/
180 mpool_bkt       ../mpool/mpool.c        /^mpool_bkt(mp)$/
181 mpool_close     ../mpool/mpool.c        /^mpool_close(mp)$/
182 mpool_filter    ../mpool/mpool.c        /^mpool_filter(mp, pgin, pgout, pgcookie)$/
183 mpool_get       ../mpool/mpool.c        /^mpool_get(mp, pgno, flags)$/
184 mpool_look      ../mpool/mpool.c        /^mpool_look(mp, pgno)$/
185 mpool_new       ../mpool/mpool.c        /^mpool_new(mp, pgnoaddr)$/
186 mpool_open      ../mpool/mpool.c        /^mpool_open(key, fd, pagesize, maxcache)$/
187 mpool_put       ../mpool/mpool.c        /^mpool_put(mp, page, flags)$/
188 mpool_stat      ../mpool/mpool.c        /^mpool_stat(mp)$/
189 mpool_sync      ../mpool/mpool.c        /^mpool_sync(mp)$/
190 mpool_write     ../mpool/mpool.c        /^mpool_write(mp, bp)$/
191 mswap   ../btree/bt_conv.c      /^mswap(pg)$/
192 newbuf  ../hash/hash_buf.c      /^newbuf(hashp, addr, prev_bp)$/
193 nroot   ../btree/bt_open.c      /^nroot(t)$/
194 open_temp       ../hash/hash_page.c     /^open_temp(hashp)$/
195 overflow_page   ../hash/hash_page.c     /^overflow_page(hashp)$/
196 print_chain     ../hash/hash_page.c     /^print_chain(addr)$/
197 putpair ../hash/hash_page.c     /^putpair(p, key, val)$/
198 rec_rdelete     ../recno/rec_delete.c   /^rec_rdelete(t, nrec)$/
199 rec_total       ../btree/bt_split.c     /^rec_total(h)$/
200 squeeze_key     ../hash/hash_page.c     /^squeeze_key(sp, key, val)$/
201 swap_header     ../hash/hash.c  /^swap_header(hashp)$/
202 swap_header_copy        ../hash/hash.c  /^swap_header_copy(srcp, destp)$/
203 tmp     ../btree/bt_open.c      /^tmp()$/
204 u_int32_t       ../hash/extern.h        /^extern u_int32_t (*__default_hash) __P((const void/
205 ugly_split      ../hash/hash_page.c     /^ugly_split(hashp, obucket, old_bufp, new_bufp, cop/