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

12

/osnet-11/usr/src/cmd/sendmail/db/btree/
H A Dbt_search.c84 db_indx_t base, i, indx, lim; local
155 indx = base + ((lim >> 1) * jump);
157 __bam_cmp(dbp, key, h, indx, t->bt_compare)) == 0) {
163 base = indx + jump;
199 indx = base > 0 ? base - O_INDX : base;
203 * all the record numbers on this page up to the indx point.
206 for (i = 0; i < indx; ++i)
209 next: pg = GET_BINTERNAL(h, indx)->pgno;
213 BT_STK_ENTER(cp, h, indx, lock, ret);
216 BT_STK_PUSH(cp, h, indx, loc
[all...]
H A Dbt_rsearch.c77 db_indx_t indx, top; local
204 for (indx = 0, top = NUM_ENT(h);;) {
205 bi = GET_BINTERNAL(h, indx);
206 if (++indx == top || total + bi->nrecs >= recno)
220 for (indx = 0, top = NUM_ENT(h);;) {
221 ri = GET_RINTERNAL(h, indx);
222 if (++indx == top || total + ri->nrecs >= recno)
231 --indx;
236 BT_STK_ENTER(cp, h, indx, lock, ret);
239 BT_STK_PUSH(cp, h, indx, loc
365 db_indx_t indx, top; local
[all...]
H A Dbt_put.c91 db_indx_t indx, nbytes; local
100 indx = *indxp;
155 __bam_partsize(data, h, indx) : data->size;
176 indx + (TYPE(h) == P_LBTREE ? O_INDX : 0));
211 &tdbt, h, indx, data_size, flags)) != 0)
229 indx += 2;
240 if ((ret = __bam_ovput(dbc, h, indx, key)) != 0)
243 if ((ret = __db_pitem(dbc, h, indx,
246 ++indx;
256 h, indx
[all...]
H A Dbt_delete.c141 __bam_ditem(dbc, h, indx)
144 u_int32_t indx;
157 bi = GET_BINTERNAL(h, indx);
184 if ((indx % 2) == 0) {
188 * data item, otherwise the "indx + P_INDX" calculation
191 if (indx + P_INDX < (u_int32_t)NUM_ENT(h) &&
192 h->inp[indx] == h->inp[indx + P_INDX])
194 h, indx, indx
[all...]
H A Dbt_cursor.c64 (cp)->indx + O_INDX)->type)) || \
70 #define IS_DELETED(cp, indx) \
72 B_DISSET(GET_BKEYDATA((cp)->page, (indx) + O_INDX)->type)) || \
74 B_DISSET(GET_BKEYDATA((cp)->page, (indx))->type)))
88 ((cursor)->indx == (saved_copy).indx || \
91 (cursor)->page->inp[(cursor)->indx] == \
92 (cursor)->page->inp[(saved_copy).indx])))
106 cp->indx = 0;
240 db_indx_t indx; local
763 db_indx_t indx; local
1171 db_indx_t adjust, indx; local
1284 db_indx_t indx, adjust; local
1402 db_indx_t indx; local
1639 db_indx_t indx; local
[all...]
H A Dbt_curadj.c46 (u_int)dbc, (u_int)cp, (u_long)cp->pgno, (u_long)cp->indx,
66 __bam_ca_delete(dbp, pgno, indx, delete)
69 u_int32_t indx;
96 if ((cp->pgno == pgno && cp->indx == indx) ||
97 (cp->dpgno == pgno && cp->dindx == indx)) {
117 __bam_ca_di(dbp, pgno, indx, adjust)
120 u_int32_t indx;
137 if (cp->pgno == pgno && cp->indx >= indx)
[all...]
H A Dbt_compare.c71 __bam_cmp(dbp, dbt, h, indx, func)
75 u_int32_t indx;
98 bk = GET_BKEYDATA(h, indx);
114 if (indx == 0 && h->prev_pgno == PGNO_INVALID)
117 bi = GET_BINTERNAL(h, indx);
H A Dbtree_auto.c359 fileid, left, llsn, right, rlsn, indx,
370 u_int32_t indx;
395 + sizeof(indx)
425 memcpy(bp, &indx, sizeof(indx));
426 bp += sizeof(indx);
494 printf("\tindx: %lu\n", (u_long)argp->indx);
546 memcpy(&argp->indx, bp, sizeof(argp->indx));
547 bp += sizeof(argp->indx);
[all...]
H A Dbt_recno.c251 db_indx_t indx; local
286 indx = cp->csp->indx;
299 if (B_DISSET(GET_BKEYDATA(h, indx)->type)) {
306 if ((ret = __bam_ditem(dbc, h, indx)) != 0)
321 if ((ret = __bam_ditem(dbc, h, indx)) != 0)
333 h, indx, BKEYDATA_SIZE(0), &hdr, &data)) != 0)
537 db_indx_t indx; local
639 indx = cp->csp->indx;
1275 db_indx_t indx; local
[all...]
H A Dbt_rec.c332 if ((ret = __bam_copy(file_dbp, sp, _lp, 0, argp->indx)) != 0 ||
333 (ret = __bam_copy(file_dbp, sp, _rp, argp->indx,
632 pagep, argp->indx, argp->indx_copy, argp->is_insert)) != 0)
640 pagep, argp->indx, argp->indx_copy, !argp->is_insert)) != 0)
699 GET_BINTERNAL(pagep, argp->indx)->nrecs += argp->adjust;
704 GET_RINTERNAL(pagep, argp->indx)->nrecs += argp->adjust;
715 GET_BINTERNAL(pagep, argp->indx)->nrecs -= argp->adjust;
720 GET_RINTERNAL(pagep, argp->indx)->nrecs -= argp->adjust;
775 B_DSET(GET_BKEYDATA(pagep, argp->indx)->type);
777 B_DSET(GET_BKEYDATA(pagep, argp->indx
[all...]
H A Dbt_split.c602 off = parent->indx + O_INDX;
748 PGNO(ppage), &LSN(ppage), (u_int32_t)parent->indx,
754 GET_RINTERNAL(ppage, parent->indx)->nrecs -= nrecs;
756 GET_BINTERNAL(ppage, parent->indx)->nrecs -= nrecs;
791 ((ISINTERNAL(pp) && cp->indx == NUM_ENT(cp->page) - 1) ||
792 (!ISINTERNAL(pp) && cp->indx == NUM_ENT(cp->page))))
794 else if (PREV_PGNO(pp) == PGNO_INVALID && cp->indx == 0)
/osnet-11/usr/src/cmd/sendmail/db/include/
H A Ddb_page.h222 #define P_ENTRY(pg, indx) ((u_int8_t *)pg + ((PAGE *)pg)->inp[indx])
268 #define HPAGE_TYPE(pg, indx) (*P_ENTRY(pg, indx))
295 * The length of any HKEYDATA item. Note that indx is an element index,
298 #define LEN_HITEM(pg, pgsize, indx) \
299 (((indx) == 0 ? pgsize : pg->inp[indx - 1]) - pg->inp[indx])
301 #define LEN_HKEYDATA(pg, psize, indx) \
[all...]
H A Dbtree_auto.h53 u_int32_t indx; member in struct:_bam_split_args
84 u_int32_t indx; member in struct:_bam_adj_args
99 u_int32_t indx; member in struct:_bam_cadjust_args
114 u_int32_t indx; member in struct:_bam_cdel_args
127 u_int32_t indx; member in struct:_bam_repl_args
H A Dbtree.h120 * pointer to the page or a page number; for either, an indx can designate
125 db_indx_t indx; /* The index on the page. */ member in struct:__epg
142 (c)->csp->indx = page_indx; \
187 db_indx_t indx; /* Page item ref'd by the cursor. */ member in struct:__cursor
H A Ddb_auto.h14 u_int32_t indx; member in struct:_db_addrem_args
/osnet-11/usr/src/cmd/sendmail/db/db/
H A Ddb_ret.c34 __db_ret(dbp, h, indx, dbt, memp, memsize)
37 u_int32_t indx;
51 hk = P_ENTRY(h, indx);
57 len = LEN_HKEYDATA(h, dbp->pgsize, indx);
63 bk = GET_BKEYDATA(h, indx);
H A Ddb_dup.c93 * Now, pagep references the page on which to insert and indx is the
112 __db_drem(dbc, pp, indx, freefunc)
115 u_int32_t indx;
124 if (B_TYPE(GET_BKEYDATA(pagep, indx)->type) == B_OVERFLOW) {
126 GET_BOVERFLOW(pagep, indx)->pgno, freefunc)) != 0)
128 ret = __db_ditem(dbc, pagep, indx, BOVERFLOW_SIZE);
130 ret = __db_ditem(dbc, pagep, indx,
131 BKEYDATA_SIZE(GET_BKEYDATA(pagep, indx)->len));
220 db_indx_t halfbytes, i, indx, lastsum, nindex, oindex, s, sum; local
224 indx
755 db_indx_t base, indx, lim, save_indx; local
[all...]
/osnet-11/usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/
H A Dbtree.h129 /* Get the page's BINTERNAL structure at index indx. */
130 #define GETBINTERNAL(pg, indx) \
131 ((BINTERNAL *)((char *)(pg) + (pg)->linp[indx]))
156 /* Get the page's RINTERNAL structure at index indx. */
157 #define GETRINTERNAL(pg, indx) \
158 ((RINTERNAL *)((char *)(pg) + (pg)->linp[indx]))
179 /* Get the page's BLEAF structure at index indx. */
180 #define GETBLEAF(pg, indx) \
181 ((BLEAF *)((char *)(pg) + (pg)->linp[indx]))
211 /* Get the page's RLEAF structure at index indx
[all...]
/osnet-11/usr/src/lib/libshell/common/bltins/
H A Dhist.c50 int range[2], incr, index2, indx= -1; local
85 if(indx<=0)
89 range[++indx] = flag;
121 flag = indx;
/osnet-11/usr/src/grub/grub-0.97/stage2/
H A Dfs.h267 #define fs_cs(fs, indx) \
268 fs_csp[(indx) >> (fs)->fs_csshift][(indx) & ~(fs)->fs_csmask]
/osnet-11/usr/src/lib/libsmbfs/common/
H A Dsmbfs_ssp.c88 int indx, rc; local
117 spnego_mech_oid_NTLMSSP, &indx)) {
/osnet-11/usr/src/lib/lvm/libmeta/common/
H A Dmeta_set_tkr.c610 int indx; local
618 for (indx = 0; indx < cnames.min_count; ++indx) {
631 len = strlen(cnames.min_names[indx]) + strlen("s0");
638 cnames.min_names[indx]);
664 cnames.min_names[indx], ep);
671 mde_perror(ep, cnames.min_names[indx]);
/osnet-11/usr/src/lib/krb5/kdb/
H A Dkdb_log.c737 uint_t indx, count, tdiff; local
796 indx = (sno - 1) % ulogentries;
798 indx_log = (kdb_ent_header_t *)INDEX(ulog, indx);
832 indx = sno % ulogentries;
835 INDEX(ulog, indx);
/osnet-11/usr/src/grub/grub2/grub-core/fs/
H A Dntfs.c784 char *cur_pos, *indx, *bmp; local
797 indx = NULL;
892 indx = grub_malloc (mft->data->idx_size << GRUB_NTFS_BLK_SHR);
893 if (indx == NULL)
902 (at, indx, i * (mft->data->idx_size << GRUB_NTFS_BLK_SHR),
904 || (fixup (mft->data, indx, mft->data->idx_size, "INDX")))
906 ret = list_file (mft, &indx[0x18 + u16at (indx, 0x18)], hook);
921 grub_free (indx);
/osnet-11/usr/src/lib/udapl/udapl_tavor/tavor/
H A Ddapl_arbel_hw.c1391 uint32_t new_indx, check_indx, indx; local
1495 for (indx = cons_indx; indx <= new_indx;
1496 indx = (indx + 1) & wrap_around_mask) {
1498 cqe = &cq->cq_addr[indx];

Completed in 125 milliseconds

12