| /src/lib/libc/db/btree/ |
| extern.h | 42 int __bt_dleaf(BTREE *, const DBT *, PAGE *, unsigned int);
44 int __bt_free(BTREE *, PAGE *);
46 PAGE *__bt_new(BTREE *, pgno_t *);
51 int __bt_relink(BTREE *, PAGE *);
56 int __bt_split(BTREE *, PAGE *,
65 void __bt_dmpage(PAGE *);
67 void __bt_dpage(PAGE *);
|
| bt_page.c | 50 * Put a page on the freelist.
54 * h: page to free
60 * mpool_put's the page.
63 __bt_free(BTREE *t, PAGE *h)
65 /* Insert the page at the head of the free list. */
71 /* Make sure the page gets written back. */
77 * Get a new page, preferably from the freelist.
81 * npg: storage for page number.
84 * Pointer to a page, NULL on error.
86 PAGE *
[all...] |
| bt_split.c | 54 static int bt_broot(BTREE *, PAGE *, PAGE *, PAGE *);
55 static PAGE *bt_page(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
57 static PAGE *bt_psplit(BTREE *, PAGE *, PAGE *, PAGE *, indx_t *, size_t)
[all...] |
| bt_conv.c | 49 static void mswap(PAGE *);
58 * pg: page number
59 * h: page to convert
64 PAGE *h;
131 PAGE *h;
196 * MSWAP -- Actually swap the bytes on the meta page.
199 * p: page to convert
202 mswap(PAGE *pg)
|
| bt_delete.c | 54 static int __bt_curdel(BTREE *, const DBT *, PAGE *, u_int);
55 static int __bt_pdelete(BTREE *, PAGE *);
56 static int __bt_stkacq(BTREE *, PAGE **, CURSOR *);
69 PAGE *h;
74 /* Toss any page pinned across calls. */
103 * If the page is about to be emptied, we'll need to
137 * hp: pointer to current, pinned PAGE pointer
144 __bt_stkacq(BTREE *t, PAGE **hp, CURSOR *c)
149 PAGE *h;
157 * currently locked page so we don't hit an already-locked page
[all...] |
| bt_search.c | 51 static int __bt_snext(BTREE *, PAGE *, const DBT *, int *);
52 static int __bt_sprev(BTREE *, PAGE *, const DBT *, int *);
71 PAGE *h;
81 /* Do a binary search on the current page. */
82 t->bt_cur.page = h;
99 * If it's a leaf page, we're almost done. If no duplicates
101 * it's possible that there were matching keys on this page,
102 * which later deleted, and we're on a page with no matches
104 * end of a page, check the adjacent page
[all...] |
| bt_overflow.c | 57 * reference is byte string stored with the key or data and is the page number
59 * nextpg field of the PAGE header.
61 * The first page of the chain has a special property. If the record is used
62 * by an internal page, it cannot be deleted and the P_PRESERVE bit will be set
66 * A single DBT is written to each chain, so a lot of space on the last page
85 PAGE *h;
134 * pgno: storage page number
142 PAGE *h, *last;
150 * number of the first page in the chain.
199 PAGE *h
[all...] |
| bt_debug.c | 84 PAGE *h;
121 * BT_DMPAGE -- Dump the meta page
124 * h: pointer to the PAGE
127 __bt_dmpage(PAGE *h)
172 * BT_DNPAGE -- Dump the page
175 * n: page number to dump.
181 PAGE *h;
194 * BT_DPAGE -- Dump the page
197 * h: pointer to the PAGE
200 __bt_dpage(PAGE *h
[all...] |
| btree.h | 48 #define DEFMINKEYPAGE (2) /* Minimum keys per page */
50 #define MINPSIZE (512) /* Minimum page size */
53 * Page 0 of a btree file contains a copy of the meta-data. This page is also
54 * used as an out-of-band page, i.e. page pointers that point to nowhere point
55 * to page 0. Page 1 is the root of the btree.
57 #define P_INVALID 0 /* Invalid tree page number. */
58 #define P_META 0 /* Tree metadata page number. *
297 PAGE *page; \/* the (pinned) page *\/ member in struct:_epg
[all...] |
| bt_seq.c | 90 /* Toss any page pinned across calls. */
99 * the page the cursor references if they're successful.
122 __bt_setcur(t, e.page->pgno, (u_int)e.index);
129 * key/data, toss the page.
132 mpool_put(t->bt_mp, e.page, 0);
134 t->bt_pinned = e.page;
150 * Pins the page the cursor references.
158 PAGE *h;
199 ep->page = h;
224 ep->page = h
[all...] |
| bt_put.c | 75 PAGE *h;
84 /* Toss any page pinned across calls. */
116 * If the key/data pair won't fit on a page, store it on overflow
117 * pages. Only put the key on the overflow page if the pair are
118 * still too big after moving the data to an overflow page.
163 * Bt_fast and __bt_search both pin the returned page.
168 h = e->page;
188 * Note, the delete may empty the page, so we need to put a
189 * new entry into the page immediately.
200 * keys permitted in the page, split the page. The split code wil
[all...] |
| bt_utils.c | 74 bl = GETBLEAF(e->page, e->index);
78 * leave the page pinned and don't copy unless the user specified
153 PAGE *h;
160 * page when the user inserts a new key in the tree smaller than
163 h = e->page;
|
| bt_open.c | 111 * we don't know the right page size, lorder or flags until the backing
112 * file is opened. Also, the file's page size can cause the cachesize
124 * Page size must be indx_t aligned and >= MINPSIZE. Default
125 * page size is set farther on, based on the underlying file
133 /* Minimum number of keys per page; absolute minimum is 2. */
224 * the lorder, page size and flags are, and, when the page size
254 * Set the page size to the best value for I/O to this file.
255 * Don't overflow the page offset type.
276 /* Set the cache size; must be a multiple of the page size. *
[all...] |
| /src/lib/libc/db/recno/ |
| extern.h | 38 int __rec_dleaf(BTREE *, PAGE *, uint32_t);
|
| rec_delete.c | 75 /* Toss any page pinned across calls. */
123 PAGE *h;
126 /* Find the record; __rec_search pins the page. */
131 h = e->page;
142 * __REC_DLEAF -- Delete a single record from a recno leaf page.
146 * index: index on current page to delete
152 __rec_dleaf(BTREE *t, PAGE *h, uint32_t idx)
162 * Delete a record from a recno leaf page. Internal records are never
167 * Pack the remaining entries at the end of the page, shift the indices
|
| rec_search.c | 70 PAGE *h;
83 t->bt_cur.page = h;
|
| rec_open.c | 65 PAGE *h;
199 /* If the root page was created, reset the flags. */
232 /* Toss any page pinned across calls. */
|
| rec_put.c | 74 /* Toss any page pinned across calls. */
197 PAGE *h;
205 * If the data won't fit on a page, store it on indirect pages.
224 /* __rec_search pins the returned page. */
230 h = e->page;
255 * If not enough room, split the page. The split code will insert
256 * the key and data and unpin the current page. If inserting into
|
| /src/sys/dev/pcmcia/ |
| if_xi.c | 283 PAGE(sc, 0);
303 PAGE(sc, 0x40);
316 PAGE(sc, 0);
379 PAGE(sc, 0);
398 PAGE(sc, 0);
559 PAGE(sc, 2);
588 PAGE(sc, 2);
660 PAGE(sc, 0x40);
664 PAGE(sc, 0);
667 PAGE(sc, 1)
949 int page, num; local
[all...] |
| if_xireg.h | 85 #define PR 0x1 /* RW - Page register select */
91 /* Page 0 */
101 /* Page 1 */
106 /* Page 2 */
114 /* Page 3 */
118 /* Page 4 */
124 /* Page 5 */
127 /* Page 6 */
129 /* Page 7 */
131 /* Page 8 *
[all...] |
| /src/tests/lib/libc/db/ |
| h_db.c | 87 extern int __bt_relink(BTREE *, PAGE *);
337 * used, otherwise a page will be locked and it will fail.
527 PAGE *h = NULL;
534 /* Look for a nonempty leaf page that has both left
544 errx(1, "%s: no appropriate page found", __func__);
|
| /src/share/terminfo/ |
| terminfo | 264 # please go to the terminfo resource page, grab the UFO file (ufo.ti), and
516 # and more than one page of memory. It uses local motions instead of
1703 # From the man-page, this is a quasi-vt100 emulator that runs on SGI's IRIX
2173 # The sc(4) manual page states that it is possible to switch between the two
2377 # see VT100 manual page A-31. This is the list that does match:
2984 vt340|dec-vt340|vt330|dec-vt330|DEC VT340 graphics terminal with 24 line page,
3024 # page memory and rectangle checksums, insert/delete column, reception
7832 # manual page states that it is possible to override initial window size,
8164 # According to its manual page
8831 # The Sun console was documented in the wscons manual page (apparentl
[all...] |
