Searched refs:indx (Results 1 - 25 of 241) sorted by relevance

12345678910

/macosx-10.10.1/BerkeleyDB-21/db/db/
H A Ddb_dup.c23 __db_ditem(dbc, pagep, indx, nbytes)
26 u_int32_t indx, nbytes;
36 DB_ASSERT(dbp->env, indx < NUM_ENT(pagep));
39 ldbt.data = P_ENTRY(dbp, pagep, indx);
43 (u_int32_t)indx, nbytes, &ldbt, NULL, &LSN(pagep))) != 0)
64 DB_ASSERT(dbp->env, inp[indx] >= HOFFSET(pagep));
65 memmove(from + nbytes, from, inp[indx] - HOFFSET(pagep));
69 offset = inp[indx];
76 if (indx != NUM_ENT(pagep))
77 memmove(&inp[indx],
[all...]
H A Ddb_reclaim.c118 db_indx_t indx, len, off, tlen, top; local
132 for (indx = 0; indx < top; indx += P_INDX) {
133 type = GET_BKEYDATA(dbp, p, indx + O_INDX)->type;
161 for (indx = 0; indx < top; indx += O_INDX) {
162 type = GET_BKEYDATA(dbp, p, indx)->type;
174 for (indx
[all...]
H A Ddb_upg_opd.c51 db_indx_t indx; local
122 for (indx = 0, i = next_cnt = 0; i < cur_cnt;) {
123 if (indx == 0) {
144 dbp, fhp, ipage, page, indx, &nomem)) != 0)
148 dbp, fhp, ipage, page, indx, &nomem)) != 0)
151 indx = 0;
154 ++indx;
194 __db_build_bi(dbp, fhp, ipage, page, indx, nomemp)
198 u_int32_t indx;
215 inp[indx]
[all...]
/macosx-10.10.1/text_cmds-88/fold/
H A Dfold.c147 int col, i, indx, space; local
150 col = indx = 0;
153 wprintf(L"%.*ls\n", indx, buf);
154 col = indx = 0;
159 i = indx;
167 wmemmove(buf, buf + space, indx - space);
168 indx -= space;
170 for (i = 0; i < indx; i++)
173 wprintf(L"%.*ls\n", indx, buf);
174 col = indx
[all...]
/macosx-10.10.1/BerkeleyDB-21/db/btree/
H A Dbt_rsearch.c69 db_indx_t adjust, deloffset, indx, top; local
168 for (t_recno = 0, indx = 0;; indx += adjust) {
169 if (indx >= NUM_ENT(h)) {
186 indx + deloffset)->type) &&
193 cp, h, indx, lock, lock_mode, ret);
198 for (indx = 0, top = NUM_ENT(h);;) {
199 bi = GET_BINTERNAL(dbp, h, indx);
200 if (++indx == top || total + bi->nrecs >= recno)
217 for (indx
400 db_indx_t indx, top; local
[all...]
H A Dbt_put.c81 db_indx_t cnt, indx; local
94 indx = cp->indx;
114 __bam_partsize(dbp, op, data, h, indx) : data->size;
134 __bam_build(dbc, op, &tdbt, h, indx, data_size)) != 0)
148 indx + (TYPE(h) == P_LBTREE ? O_INDX : 0),
193 indx + (TYPE(h) == P_LBTREE ? O_INDX : 0));
226 __bam_dup_check(dbc, op, h, indx, needed, &cnt)) {
268 B_OVERFLOW, PGNO_INVALID, h, indx, key)) != 0)
271 if ((ret = __db_pitem(dbc, h, indx,
[all...]
H A Dbt_upgrade.c134 db_indx_t indx; local
138 for (indx = O_INDX; indx < NUM_ENT(h); indx += P_INDX) {
139 bk = GET_BKEYDATA(dbp, h, indx);
141 pgno = GET_BOVERFLOW(dbp, h, indx)->pgno;
145 if (pgno != GET_BOVERFLOW(dbp, h, indx)->pgno) {
147 GET_BOVERFLOW(dbp, h, indx)->pgno = pgno;
H A Dbt_stat.c325 db_indx_t indx, *inp, top; local
345 for (indx = 0; indx < top; indx += P_INDX) {
346 type = GET_BKEYDATA(dbp, h, indx + O_INDX)->type;
352 if (indx + P_INDX >= top ||
353 inp[indx] != inp[indx + P_INDX])
381 for (indx = 0; indx < to
570 db_indx_t indx, *inp; local
[all...]
H A Dbt_search.c174 db_indx_t base, i, indx, *inp, lim; local
221 indx = 0;
223 indx = NUM_ENT(h) - 2;
225 indx = NUM_ENT(h) - 1;
243 DB_BINARY_SEARCH_INCR(indx, base, lim, adjust);
245 dbc->txn, key, h, indx, func, &cmp)) != 0)
258 DB_BINARY_SEARCH_SHIFT_BASE(indx, base,
312 indx = cp->sp->indx + 1;
313 if (indx
[all...]
H A Dbt_cursor.c118 #define IS_DELETED(dbp, page, indx) \
120 (indx) + (TYPE(page) == P_LBTREE ? O_INDX : 0))->type)
123 IS_DELETED((dbc)->dbp, (dbc)->internal->page, (dbc)->internal->indx)
141 IS_DUPLICATE(dbc, (dbc)->internal->indx, orig_indx)))
349 dbp, cp->pgno, cp->indx, 1, &count)) != 0)
384 root_pgno = GET_BOVERFLOW(dbp, h, cp->indx + O_INDX)->pgno;
393 dbp, cp_opd->pgno, cp_opd->indx, 1, &count)) != 0)
603 db_indx_t indx, top; local
628 for (indx = cp->indx;; ind
1051 db_indx_t *inp, indx, pg_keyoff; local
1436 db_indx_t indx, *inp; local
2299 db_indx_t indx, *inp; local
[all...]
H A Dbt_delete.c59 __bam_ditem(dbc, h, indx)
62 u_int32_t indx;
79 bi = GET_BINTERNAL(dbp, h, indx);
108 if ((indx % 2) == 0) {
112 * data item, otherwise the "indx + P_INDX" calculation
115 if (indx + P_INDX < (u_int32_t)NUM_ENT(h) &&
116 inp[indx] == inp[indx + P_INDX])
118 h, indx, indx
[all...]
H A Dbt_compare.c59 __bam_cmp(dbp, ip, txn, dbt, h, indx, func, cmpp)
65 u_int32_t indx;
91 bk = GET_BKEYDATA(dbp, h, indx);
120 if (indx == 0) {
125 bi = GET_BINTERNAL(dbp, h, indx);
/macosx-10.10.1/BerkeleyDB-21/db/mutex/
H A Dmut_method.c55 __mutex_free_pp(dbenv, indx)
57 db_mutex_t indx;
65 if (indx == MUTEX_INVALID)
75 ret = __mutex_free(env, &indx);
88 __mutex_lock_pp(dbenv, indx)
90 db_mutex_t indx;
98 if (indx == MUTEX_INVALID)
102 ret = __mutex_lock(env, indx);
114 __mutex_unlock_pp(dbenv, indx)
116 db_mutex_t indx;
[all...]
H A Dmut_stub.c69 __mutex_free_pp(dbenv, indx)
71 db_mutex_t indx;
73 COMPQUIET(indx, 0);
124 __mutex_lock_pp(dbenv, indx)
126 db_mutex_t indx;
128 COMPQUIET(indx, 0);
226 __mutex_unlock_pp(dbenv, indx)
228 db_mutex_t indx;
230 COMPQUIET(indx, 0);
/macosx-10.10.1/BerkeleyDB-21/db/dbinc/
H A Ddb_page.h363 #define P_ENTRY(dbp, pg, indx) ((u_int8_t *)pg + P_INP(dbp, pg)[indx])
412 #define HPAGE_TYPE(dbp, pg, indx) (*P_ENTRY(dbp, pg, indx))
439 * The length of any HKEYDATA item. Note that indx is an element index,
442 #define LEN_HITEM(dbp, pg, pgsize, indx) \
443 (((indx) == 0 ? (pgsize) : \
444 (P_INP(dbp, pg)[(indx) - 1])) - (P_INP(dbp, pg)[indx]))
446 #define LEN_HKEYDATA(dbp, pg, psize, indx) \
[all...]
/macosx-10.10.1/hfs-285/CopyHFSMeta/
H A Dmisc.c84 size_t indx; local
90 indx = (*ep)->count;
91 (*ep)->extents[indx].base = start;
92 (*ep)->extents[indx].length = length;
93 (*ep)->extents[indx].fid = fid;
138 int indx; local
139 for (indx = 0; indx < exts->count; indx++) {
140 printf("\t\t<%lld, %lld> (file %u)\n", exts->extents[indx]
165 int indx; local
[all...]
/macosx-10.10.1/BerkeleyDB-21/db/examples_c/csv/
H A Dcsv.h57 #define OFFSET_LEN(offset, indx) \
58 (((offset)[(indx) + 1] - (offset)[(indx)]) - 1)
80 int indx; /* Indexed */ member in struct:__anon330
/macosx-10.10.1/file_cmds-242/pax/
H A Dtables.c139 u_int indx; local
152 indx = ((unsigned)arcn->sb.st_ino) % L_TAB_SZ;
153 if ((pt = ltab[indx]) != NULL) {
157 ppt = &(ltab[indx]);
205 pt->fow = ltab[indx];
206 ltab[indx] = pt;
228 u_int indx; local
242 indx = ((unsigned)arcn->sb.st_ino) % L_TAB_SZ;
243 if ((pt = ltab[indx]) == NULL)
250 ppt = &(ltab[indx]);
380 u_int indx; local
519 u_int indx; local
587 u_int indx; local
715 u_int indx; local
966 u_int indx; local
1029 u_int indx; local
[all...]
/macosx-10.10.1/BerkeleyDB-21/db/dbinc_auto/
H A Dqam_auto.h38 u_int32_t indx; member in struct:___qam_del_args
50 u_int32_t indx; member in struct:___qam_add_args
65 u_int32_t indx; member in struct:___qam_delext_args
H A Dbtree_auto.h15 u_int32_t indx; member in struct:___bam_split_args
45 u_int32_t indx; member in struct:___bam_adj_args
58 u_int32_t indx; member in struct:___bam_cadjust_args
71 u_int32_t indx; member in struct:___bam_cdel_args
82 u_int32_t indx; member in struct:___bam_repl_args
194 u_int32_t indx; member in struct:___bam_pgno_args
/macosx-10.10.1/bc-21/bc/bc/
H A Dstorage.c75 int indx; local
91 for (indx = 0; indx < old_count; indx++)
93 functions[indx] = old_f[indx];
94 f_names[indx] = old_names[indx];
98 for (; indx < f_count; indx
121 int indx; local
155 int indx; local
[all...]
/macosx-10.10.1/BerkeleyDB-21/db/hash/
H A Dhash.c196 dp = (HKEYDATA *)H_PAIRDATA(dbc->dbp, hcp->page, hcp->indx);
273 if (hcp->indx >= NUM_ENT(hcp->page)) {
278 switch (HPAGE_PTYPE(H_PAIRDATA(dbp, hcp->page, hcp->indx))) {
284 p = HKEYDATA_DATA(H_PAIRDATA(dbp, hcp->page, hcp->indx));
286 LEN_HDATA(dbp, hcp->page, dbp->pgsize, hcp->indx);
332 if (HPAGE_TYPE(dbp, hcp->page, H_DATAINDEX(hcp->indx)) == H_OFFDUP)
342 hcp->hdr->dbmeta.pagesize, hcp->indx))
351 hcp->indx));
522 hcp->indx = NDX_INVALID;
533 hcp->indx
590 db_indx_t dup_len, dup_off, dup_tlen, indx, *inp; local
[all...]
H A Dhash_page.c103 if (hcp->indx < NUM_ENT(hcp->page) &&
104 HPAGE_TYPE(dbp, hcp->page, H_DATAINDEX(hcp->indx)) == H_OFFDUP) {
106 HOFFDUP_PGNO(H_PAIRDATA(dbp, hcp->page, hcp->indx)),
120 HKEYDATA_DATA(H_PAIRDATA(dbp, hcp->page, hcp->indx)) +
123 if (hcp->indx >= (db_indx_t)NUM_ENT(hcp->page)) {
130 hcp->indx = 0;
203 hcp->indx = NDX_INVALID;
296 if (HPAGE_TYPE(dbp, hcp->page, H_DATAINDEX(hcp->indx)) ==
299 HOFFDUP_PGNO(H_PAIRDATA(dbp, hcp->page, hcp->indx)),
308 H_PAIRDATA(dbp, hcp->page, hcp->indx))
480 u_int16_t n, indx; local
730 db_indx_t indx; local
2565 db_indx_t indx; local
[all...]
H A Dhash_dup.c113 hk = H_PAIRDATA(dbp, hcp->page, hcp->indx);
118 LEN_HKEYDATA(dbp, hcp->page, dbp->pgsize, H_DATAINDEX(hcp->indx)) +
142 hcp->indx);
148 hk = H_PAIRDATA(dbp, hcp->page, hcp->indx);
180 dbp->pgsize, hcp->indx);
231 memcpy(pgnop, HOFFDUP_PGNO(H_PAIRDATA(dbp, hcp->page, hcp->indx)),
278 PGNO(hcp->page), (u_int32_t)hcp->indx, &hcs)) != 0)
285 switch (HPAGE_PTYPE(H_PAIRDATA(dbp, hcp->page, hcp->indx))) {
288 dbt.size = LEN_HDATA(dbp, hcp->page, dbp->pgsize, hcp->indx);
289 dbt.data = HKEYDATA_DATA(H_PAIRDATA(dbp, hcp->page, hcp->indx));
[all...]
/macosx-10.10.1/BerkeleyDB-21/db/qam/
H A Dqam.src57 ARG indx u_int32_t lu
71 ARG indx u_int32_t lu
87 ARG indx u_int32_t lu

Completed in 514 milliseconds

12345678910