| /openbsd-src/lib/libc/db/btree/ |
| H A D | bt_split.c | 45 static int bt_broot(BTREE *, PAGE *, PAGE *, PAGE *);
46 static PAGE *bt_page(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
48 static PAGE *bt_psplit(BTREE *, PAGE *, PAGE *, PAGE *, indx_t *, size_t);
49 static PAGE *bt_root(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
50 static int bt_rroot(BTREE *, PAGE *, PAGE *, PAGE *);
51 static recno_t rec_total(PAGE *);
62 * sp: page to split
73 __bt_split(BTREE *t, PAGE *sp, const DBT *key, const DBT *data, int flags, in __bt_split()
80 PAGE *h, *l, *r, *lchild, *rchild; in __bt_split()
88 * Split the page into two pages, l and r. The split routines return in __bt_split()
[all …]
|
| H A D | btree.h | 44 #define DEFMINKEYPAGE (2) /* Minimum keys per page */
46 #define MINPSIZE (512) /* Minimum page size */
49 * Page 0 of a btree file contains a copy of the meta-data. This page is also
50 * used as an out-of-band page, i.e. page pointers that point to nowhere point
51 * to page 0. Page 1 is the root of the btree.
53 #define P_INVALID 0 /* Invalid tree page number. */
54 #define P_META 0 /* Tree metadata page number. */
55 #define P_ROOT 1 /* Tree root page number. */
58 * There are five page layouts in the btree: btree internal pages (BINTERNAL),
60 * (RLEAF) and overflow pages. All five page types have a page header (PAGE).
[all …]
|
| H A D | bt_delete.c | 45 static int __bt_curdel(BTREE *, const DBT *, PAGE *, u_int);
46 static int __bt_pdelete(BTREE *, PAGE *);
47 static int __bt_relink(BTREE *, PAGE *);
48 static int __bt_stkacq(BTREE *, PAGE **, CURSOR *);
61 PAGE *h; in __bt_delete()
66 /* Toss any page pinned across calls. */ in __bt_delete()
95 * If the page is about to be emptied, we'll need to in __bt_delete()
128 * hp: pointer to current, pinned PAGE pointer
135 __bt_stkacq(BTREE *t, PAGE **hp, CURSOR *c) in __bt_stkacq()
140 PAGE *h; in __bt_stkacq()
[all …]
|
| H A D | bt_search.c | 42 static int __bt_snext(BTREE *, PAGE *, const DBT *, int *);
43 static int __bt_sprev(BTREE *, PAGE *, const DBT *, int *);
62 PAGE *h; in __bt_search()
72 /* Do a binary search on the current page. */ in __bt_search()
73 t->bt_cur.page = h; in __bt_search()
90 * If it's a leaf page, we're almost done. If no duplicates in __bt_search()
92 * it's possible that there were matching keys on this page, in __bt_search()
93 * which later deleted, and we're on a page with no matches in __bt_search()
95 * end of a page, check the adjacent page. in __bt_search()
116 * decrement by one, and record the internal page which should in __bt_search()
[all …]
|
| /openbsd-src/regress/lib/libc/sys/ |
| H A D | t_mlock.c | 48 static long page = 0; variable
62 buf = malloc(page); in ATF_TC_BODY()
64 fprintf(stderr, "mlock_clip: buf = %p (page=%ld)\n", buf, page); in ATF_TC_BODY()
66 if (page < 1024) in ATF_TC_BODY()
67 atf_tc_skip("page size too small"); in ATF_TC_BODY()
69 for (size_t i = page; i >= 1; i = i - 1024) { in ATF_TC_BODY()
70 err1 = mlock(buf, page - i); in ATF_TC_BODY()
72 fprintf(stderr, "mlock_clip: page=%ld i=%zu," in ATF_TC_BODY()
73 " mlock(%p, %ld): %s\n", page, i, buf, page - i, in ATF_TC_BODY()
75 err2 = munlock(buf, page - i); in ATF_TC_BODY()
[all …]
|
| /openbsd-src/gnu/usr.bin/perl/cpan/Pod-Checker/t/pod/ |
| H A D | podchklink.t | 12 'page' => 'manpage',
18 'page' => '"manpage"',
24 'page' => 'manpage',
30 'page' => 'manpage',
36 'page' => 'manpage',
42 'page' => 'manpage',
48 'page' => 'manpage',
54 'page' => 'manpage',
60 'page' => 'manpage',
66 'page' => 'foo',
[all …]
|
| /openbsd-src/lib/libc/db/hash/ |
| H A D | hash.h | 48 BUFHEAD *ovfl; /* Overflow page buffer header */
49 u_int32_t addr; /* Address of this page */
50 char *page; /* Actual page data */ member
67 int32_t bsize; /* Bucket/Page Size */
74 int32_t last_freed; /* Last overflow page freed */
86 u_int16_t bitmaps[NCACHED]; /* address of overflow page
101 BUFHEAD *cpage; /* Current page */
111 u_int32_t *mapp[NCACHED]; /* Pointers to page maps */
157 * Overflow page numbers are allocated per split point. At each doubling of
158 * the table, we can allocate extra pages. So, an overflow page number has
[all …]
|
| /openbsd-src/regress/usr.sbin/httpd/patterns/ |
| H A D | test-patterns.out | 2 string='/page/51'
5 0: /page/51
6 1: page
13 string='/^page/51'
16 0: /^page/51
17 1: page
19 string='/page/page-51'
22 0: /page/page-51
23 1: page
25 string='/page/[51]'
[all …]
|
| H A D | test-patterns.in | 3 /page/51 ^/(%a+)/(%d+)$
5 /^page/51 /^(.a.e)/(.)
6 /page/page-51 /(.*)/%1-(%d+)
7 /page/[51] /page/(%b[])
10 /page/51 $^
14 /page/51 no-%d-match no match
15 /page/page-51 /(.*)/%9-(%d+) invalid capture index
17 /page/51 /page/51( unfinished capture
18 /page/51 /page/51% malformed pattern (ends with '%')
19 /page/51 /page/[51 malformed pattern (missing ']')
[all …]
|
| H A D | test-patterns-lua.out | 1 string='/page/51'
3 page 51
7 string='/^page/51'
9 page 5
10 string='/page/page-51'
12 page 51
13 string='/page/[51]'
14 pattern='/page/(%b[])'
22 string='/page/51'
34 string='/page/51'
[all …]
|
| /openbsd-src/usr.bin/mandoc/ |
| H A D | dba.c | 77 struct dba_array *page; in dba_free() local
94 dba_array_FOREACH(dba->pages, page) { in dba_free()
95 dba_array_free(dba_array_get(page, DBP_NAME)); in dba_free()
96 dba_array_free(dba_array_get(page, DBP_SECT)); in dba_free()
97 dba_array_free(dba_array_get(page, DBP_ARCH)); in dba_free()
98 free(dba_array_get(page, DBP_DESC)); in dba_free()
99 dba_array_free(dba_array_get(page, DBP_FILE)); in dba_free()
100 dba_array_free(page); in dba_free()
147 * Create a new page and append it to the pages table.
153 struct dba_array *page, *entry; in dba_page_new() local
[all …]
|
| /openbsd-src/regress/usr.bin/mandoc/db/out/ |
| H A D | badarch0.dout | 5 page count 3
7 page name # [fh1t]empty
8 page sect # 1
9 page arch # (NULL)
10 page desc # no title
11 page file src # man1/amd64/empty.1
12 page name # [fh1t]empty
13 page sect # 1
14 page arch # i386
15 page desc # no title
[all …]
|
| H A D | threearch.dout | 5 page count 3
7 page name # [fh1t]empty
8 page sect # 1
9 page arch # amd64
10 page desc # no title
11 page file src # man1/amd64/empty.1
12 page name # [fh1t]empty
13 page sect # 1
14 page arch # i386
15 page desc # no title
[all …]
|
| H A D | badarch.dout | 5 page count 3
7 page name # [fh1t]empty
8 page sect # 1
9 page arch # amd64
10 page desc # no title
11 page file src # man1/amd64/empty.1
12 page name # [fh1t]empty
13 page sect # 1
14 page arch # i386
15 page desc # no title
[all …]
|
| H A D | badsect.dout | 5 page count 3
7 page name # [fh1t]empty
8 page sect # 1
9 page desc # no title
10 page file src # man1/empty.1
11 page name # [f]second # [h1t]empty
12 page sect # 1
13 page desc # no title
14 page file src # man1/second.1
15 page name # [f]third # [h1t]empty
[all …]
|
| H A D | badname.dout | 5 page count 3
7 page name # [fh1t]empty
8 page sect # 1
9 page desc # no title
10 page file src # man1/empty.1
11 page name # [f]second # [h1t]empty
12 page sect # 1
13 page desc # no title
14 page file src # man1/second.1
15 page name # [f]third # [h1t]empty
[all …]
|
| H A D | baddesc.dout | 5 page count 3
7 page name # [fh1t]empty
8 page sect # 1
9 page desc # no title
10 page file src # man1/empty.1
11 page name # [f]second # [h1t]empty
12 page sect # 1
13 page desc # no title
14 page file src # man1/second.1
15 page name # [f]third # [h1t]empty
[all …]
|
| H A D | badfile.dout | 5 page count 3
7 page name # [fh1t]empty
8 page sect # 1
9 page desc # no title
10 page file src # man1/empty.1
11 page name # [f]second # [h1t]empty
12 page sect # 1
13 page desc # no title
14 page file src # man1/second.1
15 page name # [f]third # [h1t]empty
[all …]
|
| H A D | threepages.dout | 5 page count 3
7 page name # [fh1t]empty
8 page sect # 1
9 page desc # no title
10 page file src # man1/empty.1
11 page name # [f]second # [h1t]empty
12 page sect # 1
13 page desc # no title
14 page file src # man1/second.1
15 page name # [f]third # [h1t]empty
[all …]
|
| /openbsd-src/sys/dev/pci/drm/i915/gt/ |
| H A D | shmem_utils.c | 61 struct page **pages; in shmem_pin_map()
104 struct page *page; in __shmem_rw() local
107 page = shmem_read_mapping_page_gfp(file->f_mapping, pfn, in __shmem_rw()
109 if (IS_ERR(page)) in __shmem_rw()
110 return PTR_ERR(page); in __shmem_rw()
112 vaddr = kmap(page); in __shmem_rw()
115 set_page_dirty(page); in __shmem_rw()
119 mark_page_accessed(page); in __shmem_rw()
120 kunmap(page); in __shmem_rw()
121 put_page(page); in __shmem_rw()
[all …]
|
| /openbsd-src/lib/libc/db/mpool/ |
| H A D | mpool.c | 102 * Get a new page of memory.
111 (void)fprintf(stderr, "mpool_new: page allocation overflow.\n"); in mpool_new()
118 * Get a BKT from the cache. Assign a new page number, attach in mpool_new()
135 return (bp->page); in mpool_new()
139 mpool_delete(MPOOL *mp, void *page) in mpool_delete() argument
144 bp = (BKT *)((char *)page - sizeof(BKT)); in mpool_delete()
149 "mpool_delete: page %d not pinned\n", bp->pgno); in mpool_delete()
166 * Get a page.
181 /* Check for a page that is cached. */ in mpool_get()
186 "mpool_get: page %d already pinned\n", bp->pgno); in mpool_get()
[all …]
|
| /openbsd-src/gnu/gcc/gcc/ |
| H A D | ggc-zone.c | 107 objects are greater than page size.
109 Pages for small objects are broken up into chunks. The page has
117 Empty pages (of all sizes) are kept on a single page cache list,
120 been recycled by then. The free page list is currently per-zone. */
125 2: Page-entry allocations/deallocations as well.
136 chunks are allocated one at a time to their own page, and so don't
144 /* The size of the fixed-size portion of a small page descriptor. */
147 /* The collector's idea of the page size. This must be a power of two
148 no larger than the system page size, because pages must be aligned
149 to this amount and are tracked at this granularity in the page
[all …]
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/ |
| H A D | ggc-page.c | 71 of pages. Each page can allocate objects of a single size only;
74 (`order'), and satisfied from the appropriate page.
76 Each page is recorded in a page-entry, which also maintains an
77 in-use bitmap of object positions on the page. This allows the
79 touching the page itself.
81 Each page-entry also has a context depth, which is used to track
85 Page entries are arranged in an array of singly-linked lists. The
92 Empty pages (of all orders) are kept on a single page cache list,
100 2: Page-entry allocations/deallocations as well.
110 /* A two-level tree is used to look up the page-entry for a given
[all …]
|
| /openbsd-src/share/man/man9/ |
| H A D | pmap.9 | 69 the page's protection, whether the page has been referenced or modified and
74 interface is consistent across all platforms and hides the way page mappings
87 .Sh PAGE MANAGEMENT
100 The modified/referenced bits must be tracked on a per-page basis, as they
101 are not attributes of a mapping, but attributes of a page.
102 Therefore, even after all mappings for a given page have been removed, the
103 modified/referenced bits for that page must be preserved.
111 the page being modified or referenced again after the modified/referenced
134 function creates a managed mapping for physical page
[all...] |
| /openbsd-src/usr.sbin/ldapd/ |
| H A D | btree.c | 63 /* There are four page types: meta, index, leaf and overflow.
64 * They all share the same page header.
66 struct page { /* represents an on-disk page */ struct
67 pgno_t pgno; /* page number */ argument
68 #define P_BRANCH 0x01 /* branch page */
69 #define P_LEAF 0x02 /* leaf page */
70 #define P_OVERFLOW 0x04 /* overflow page */
71 #define P_META 0x08 /* meta page */
72 #define P_HEAD 0x10 /* header page */
82 pgno_t pb_next_pgno; /* overflow page linked list */ argument
[all …]
|