fill
fill = 1U << curr;
mmin = fill; /* save offset to next table */
fill -= incr;
next[(huff >> drop) + fill] = here;
} while (fill != 0);
unsigned fill; /* index for replicating entries */
fill = (unsigned char)c;
fill |= fill << 8;
fill |= fill << 16;
fill |= fill << (sizeof(c) < sizeof(fill) ? 32 : 0);
*dstp = (*dstp & keep_mask) | (fill & ~keep_mask);
*dp = fill;
*dstp = fill;
*dstp = (*dstp & keep_mask) | (fill & ~keep_mask);
*dp = fill;
memword_t fill;
static uint16_t shld_word (struct X86EMU *, uint16_t d, uint16_t fill, uint8_t s);
static uint32_t shld_long (struct X86EMU *, uint32_t d, uint32_t fill, uint8_t s);
static uint16_t shrd_word (struct X86EMU *, uint16_t d, uint16_t fill, uint8_t s);
static uint32_t shrd_long (struct X86EMU *, uint32_t d, uint32_t fill, uint8_t s);
shld_word(struct X86EMU *emu, uint16_t d, uint16_t fill, uint8_t s)
res = (d << cnt) | (fill >> (16 - cnt));
shld_long(struct X86EMU *emu, uint32_t d, uint32_t fill, uint8_t s)
res = (d << cnt) | (fill >> (32 - cnt));
shrd_word(struct X86EMU *emu, uint16_t d, uint16_t fill, uint8_t s)
res = (d >> cnt) | (fill << (16 - cnt));
shrd_long(struct X86EMU *emu, uint32_t d, uint32_t fill, uint8_t s)
res = (d >> cnt) | (fill << (32 - cnt));
int fill;
int fill;
static void fill(void);
fill();
static void fill(char *, char *);
fill((char *)datap, optarg);
.fill (IBRS_ENTER_BYTES-2),1,0xCC
.fill (IBRS_LEAVE_BYTES-2),1,0xCC
.fill (MDS_LEAVE_BYTES-2),1,0xCC
.fill (SVS_ENTER_BYTES-2),1,0xCC
.fill (SVS_LEAVE_BYTES-2),1,0xCC
.fill (SVS_ENTER_ALT_BYTES-2),1,0xCC
.fill (SVS_LEAVE_ALT_BYTES-2),1,0xCC
.fill (SVS_ENTER_NMI_BYTES-2),1,0xCC
.fill (SVS_LEAVE_NMI_BYTES-2),1,0xCC
int fill;
fill = (bgcolor & 1) ? 255 : 0;
memset(dst, fill, ncols);
int fill;
fill = (bgcolor & 1) ? 255 : 0;
memset(dst, fill, fillsize);
memset(dst, fill, widthbytes);
goto fill;
goto fill;
goto fill;
goto fill;
fill:
u_char fill[0x1c2]; /* Filler, can be boot code */
char fill[412]; /* Filler bytes to the end of the
char fill[412-2]; /* Filler bytes to the end of the block */
unsigned char fill[3]; /* bytes are longword aligned */
void (*fill)(struct nvme_queue *, struct nvme_ccb *, void *))
(*fill)(q, ccb, sqe);
void (*fill)(struct nvme_queue *, struct nvme_ccb *, void *), int timo_sec)
(*fill)(q, ccb, &state.s);
u_int32_t fill = bgcolor | (bgcolor << 8) |
scr->dispoffset + i, fill);
u_int16_t fill = bgcolor | (bgcolor << 8);
scr->dispoffset + i, fill);
uint64_t *fill;
fill = qat_alloc_mem(MAX_USTORE * sizeof(uint64_t));
memcpy(&fill[i], ui->ui_fill_pattern, sizeof(uint64_t));
if (dont_init == (uint32_t)fill[0])
fill[i] = (uint64_t)dont_init;
if ((uint32_t)fill[start] != dont_init)
if ((uint32_t)fill[end] == dont_init)
start, end - start, &fill[start]);
qat_free_mem(fill);
uint64_t fill, *ucode_cpybuf;
memcpy(&fill, sc->sc_aefw_uof.qafu_imgs[0].qui_image->ui_fill_pattern,
ucode_cpybuf[i] = fill;
while (sce->cur == sce->fill) {
while (sce->cur != sce->fill && uio->uio_resid > 0 && !error) {
if(sce->fill > sce->cur)
n = uimin(sce->fill - sce->cur, uio->uio_resid);
n = uimin(n, sce->limit - sce->fill);
error = uiomove(sce->fill, n, uio);
sce->fill += n;
if (sce->fill == sce->limit)
sce->fill = sce->ibuf;
if (sce->fill < sce->cur && sce->cur <= sce->fill + count) {
n = uimin(actlen, sce->limit - sce->fill);
memcpy(sce->fill, tbuf, n);
sce->fill += n;
if (sce->fill == sce->limit)
sce->fill = sce->ibuf;
n = uimin(count, sce->limit - sce->fill);
memcpy(sce->fill, tbuf, n);
sce->fill += n;
if (sce->fill == sce->limit)
sce->fill = sce->ibuf;
memcpy(sce->fill, tbuf, count);
sce->fill += count;
u_char *fill; /* location for input (isoc) */
sce->fill = sce->cur = sce->ibuf;
sce->fill = sce->cur = sce->ibuf;
if (sce_in->cur != sce_in->fill)
} else if (sce->cur == sce->fill) {
} else if (sce->cur < sce->fill) {
kn->kn_data = sce->fill - sce->cur;
(sce->fill - sce->ibuf);
sce->cur = sce->fill = sce->ibuf;
uid_stats(struct hashstat_sysctl *hs, bool fill)
if (!fill)
bool fill, query;
fill = false;
fill = true;
error = hash->hs_func(&hs, fill);
bufhash_stats(struct hashstat_sysctl *hs, bool fill)
if (!fill)
vcache_stats(struct hashstat_sysctl *hs, bool fill)
if (!fill)
ubchash_stats(struct hashstat_sysctl *hs, bool fill)
if (!fill)
static int ubchash_stats(struct hashstat_sysctl *hs, bool fill);
bool fill;
fill = false;
fill = true;
if (__predict_true(b == ucpu->pgflbucket && fill)) {
fill(ret, page, 0);
fill(ret, page, 'x');
static void fill(char *, size_t, char);
const uint32_t fill = 0x0F0F0F0F;
: "g"(fill)
const uint32_t fill = 0x0F0F0F0F;
: "g"(fill)
const uint64_t fill = 0x0F0F0F0F0F0F0F0F;
: "g"(fill)
const uint64_t fill = 0x0F0F0F0F0F0F0F0F;
: "a"(out), "m"(fill)
const uint64_t fill = 0x0F0F0F0F0F0F0F0F;
: "a"(out), "m"(fill)
union x86_test_register fill __aligned(32) = {
: "a"(out), "m"(fill)
union x86_test_register fill __aligned(32) = {
: "a"(out), "m"(fill)
union x86_test_register fill __aligned(64) = {
: "a"(out), "m"(fill)
char *fill;
for (outblock_remaining = output_block_size, fill = blockbuf;
fill += input_block_size + input_pad_size,
if (read(ifd, fill, this_inblock)
short n, fill;
fill = first ? 0 : 2; /* fill space for ``, '' */
if (((n = strlen(nfile)) + col + fill) >= SIZCOL-4) {
col += n+fill;
properties[PROP_MAGIC1].fill(&properties[PROP_MAGIC1]);
properties[PROP_MAGIC2].fill(&properties[PROP_MAGIC2]);
fill_t fill;
prop->fill(prop);
prop->fill(prop);
prop->fill(prop);
prop->fill(prop);
prop->fill(prop);
prop->fill(prop);
prop->fill(prop);
prop->fill(prop);
prop->fill(prop);
prop->fill(prop);
fill(str);
fill(line);