fmap
size_t bucket, fmap[FMAP_ENTRIES + 1];
fmap[cnt] = R_OFFSET(dbmp, mfp);
fmap[cnt] = R_OFFSET(dbmp, mfp);
fmap[cnt] = INVALID;
fmap[FMAP_ENTRIES] = INVALID;
__memp_pbh(dbmp, bhp, fmap, fp);
__memp_pbh(dbmp, bhp, fmap, fp);
__memp_pbh(dbmp, bhp, fmap, fp)
size_t *fmap;
if (fmap[i] == INVALID || fmap[i] == bhp->mf_offset)
if (fmap[i] == INVALID)
fallbackSimpleSort ( fmap, eclass, lo, hi );
if (r3 == 0) med = eclass[fmap[lo]]; else
if (r3 == 1) med = eclass[fmap[(lo+hi)>>1]]; else
med = eclass[fmap[hi]];
n = (Int32)eclass[fmap[unLo]] - (Int32)med;
fswap(fmap[unLo], fmap[ltLo]);
n = (Int32)eclass[fmap[unHi]] - (Int32)med;
fswap(fmap[unHi], fmap[gtHi]);
fswap(fmap[unLo], fmap[unHi]); unLo++; unHi--;
void fallbackSort ( UInt32* fmap,
fmap[k] = i;
k = fmap[i] - H; if (k < 0) k += nblock;
fallbackQSort3 ( fmap, eclass, l, r );
cc1 = eclass[fmap[i]];
void fallbackSimpleSort ( UInt32* fmap,
eclass8[fmap[i]] = (UChar)j;
tmp = fmap[i];
for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 )
fmap[j-4] = fmap[j];
fmap[j-4] = tmp;
tmp = fmap[i];
for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ )
fmap[j-1] = fmap[j];
fmap[j-1] = tmp;
fswap(fmap[yyp1], fmap[yyp2]); \
void fallbackQSort3 ( UInt32* fmap,
ctf_merge_funcmap_t *fmap;
fmap = ctf_alloc(sizeof (ctf_merge_funcmap_t) +
if (fmap == NULL)
fmap->cmf_idx = idx;
fmap->cmf_sym = *symp;
fmap->cmf_rtid = fip->ctc_return;
fmap->cmf_flags = fip->ctc_flags;
fmap->cmf_argc = fip->ctc_argc;
fmap->cmf_name = name;
fmap->cmf_file = file;
fmap->cmf_file = NULL;
if (ctf_func_args(cmi->cmi_input, idx, fmap->cmf_argc,
fmap->cmf_args) != 0) {
ctf_free(fmap, sizeof (ctf_merge_funcmap_t) +
fmap->cmf_file != NULL ? fmap->cmf_file : "global",
list_insert_tail(&cmi->cmi_fmap, fmap);
bzero(cl->cl_fmap, sizeof (struct fmap) * FD_NUMPART);
bzero(cl->cl_fmap, sizeof (struct fmap) * FD_NUMPART);
bzero(cl->cl_fmap, sizeof (struct fmap) * FD_NUMPART);
struct fmap cl_fmap[FDISK_PARTS]; /* fdisk partitions */