HomeSort by: relevance | last modified time | path
    Searched defs:space (Results 1 - 25 of 101) sorted by relevancy

1 2 3 4 5

  /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/core/
nouveau_nvkm_core_enum.c 49 bool space = false; local in function:nvkm_snprintbf
53 space ? " " : "", bf->name);
56 space = true;
  /src/usr.bin/make/unit-tests/
varmod-to-upper.mk 20 mod-tu-space:
sh-dots.mk 9 all: first hidden repeated commented indirect indirect-space
39 # If the dots are followed by a space, that space is part of the command and
41 indirect-space: .IGNORE
42 @echo indirect-space regular
44 @echo indirect-space deferred
opt-debug-errors.mk 9 all: fail-escaped-space
21 fail-escaped-space:
24 # XXX: A newline is turned into an ordinary space in the debug log.
29 # space before the command is actually run.
opt-debug-errors-jobs.mk 9 all: fail-escaped-space
18 fail-escaped-space:
25 # space before the command is actually run.
33 # irrelevant. Since "usually" is not "always", these space characters are
34 # not merged into a single space.
cmdline.mk 14 all: space-and-comment
50 space-and-comment: .PHONY
  /src/tests/kernel/
t_sysctl.c 50 unsigned char space[256]; member in union:ATF_TC_BODY::__anon37878dc5010a
  /src/tests/usr.bin/indent/
opt_di.c 9 int space; variable in typeref:typename:int
17 int space; variable in typeref:typename:int
32 * '-di', the others are separated with a single space.
53 * An indentation of 0 columns uses a single space between the declaration
73 /* The indentation consists of a tab and a space. */
88 int space; variable in typeref:typename:int
95 int space; variable in typeref:typename:int
104 * indented to the right of the keyword 'struct', it only needs a single space
lsym_preprocessing.c 32 #define space ' ' /* the 'define' is followed by a space */ macro
98 * The effect was that the extra space after d2 was not formatted, as that
  /src/sys/external/bsd/drm2/dist/drm/i915/gt/
intel_ring_types.h 48 u32 space; member in struct:intel_ring
intel_ring.c 21 unsigned int space; local in function:intel_ring_update_space
23 space = __intel_ring_space(ring->head, ring->emit, ring->size);
25 ring->space = space;
26 return space;
200 /* Would completion of this request free enough space? */
218 GEM_BUG_ON(ring->space < bytes);
242 * Not enough space for the basic request. So need to
250 * The base request will fit but the reserved space
259 if (unlikely(total_bytes > ring->space)) {
    [all...]
  /src/usr.bin/uname/
uname.c 68 int space = 0; local in function:main
125 space++;
129 if (space++) putchar(' ');
133 if (space++) putchar(' ');
137 if (space++) putchar(' ');
141 if (space++) putchar(' ');
145 if (space++) putchar(' ');
  /src/lib/libc/gen/
initdir.c 66 * to user space to be done by getdents()
78 size_t space; local in function:_initdir
102 space = 0;
111 if (space < DIRBLKSIZ) {
112 space += incr;
120 ddptr = buf + (len - space);
124 n = getdents(fd, ddptr, space);
141 space -= n;
  /src/sys/compat/common/
uipc_syscalls_40.c 42 int space = 0, error = 0; local in function:compat_ifconf
61 space = ifc->ifc_len;
82 if (space >= sz) {
88 space -= sizeof(ifr);
110 if (space >= sz) {
118 if (space >= sz) {
123 space -= sa->sa_len - sizeof(*sa);
124 if (space >= sz) {
141 space -= sz;
159 ifc->ifc_len -= space;
    [all...]
  /src/sys/arch/sparc/fpu/
fpu_explode.c 239 u_int s, *space; local in function:fpu_explode
246 space = &fe->fe_fpstate->fs_regs[reg];
247 s = space[0];
266 s = fpu_dtof(fp, s, space[1]);
270 s = fpu_qtof(fp, s, space[1], space[2], space[3]);
fpu.c 311 u_int space[4]; local in function:fpu_execute
606 fpu_implode(fe, fp, type, space);
627 fs->fs_regs[rd] = space[0];
629 fs->fs_regs[rd + 1] = space[1];
631 fs->fs_regs[rd + 2] = space[2];
632 fs->fs_regs[rd + 3] = space[3];
  /src/sys/dev/rasops/
rasops1-4_putchar.h 95 bool space; local in function:NAME
126 /* If fg and bg match this becomes a space character */
128 space = true;
131 space = false;
140 if (space) {
208 if (space) {
rasops1.c 100 bool space; local in function:rasops1_putchar
131 /* If fg and bg match this becomes a space character */
133 space = true;
136 space = false;
145 if (space) {
198 if (space) {
  /src/sys/external/bsd/drm2/dist/drm/i915/
i915_vgpu.c 44 * A primary function introduced here is so-called "address space ballooning"
52 * To reduce the complexity, Intel GVT-g introduces "address space ballooning",
162 struct drm_mm_node space[4]; member in struct:_balloon_info_
173 DRM_DEBUG_DRIVER("deballoon space: range [0x%"PRIx64" - 0x%"PRIx64"] %"PRIu64" KiB.\n",
199 vgt_deballoon_space(ggtt, &bl_info.space[i]);
212 DRM_INFO("balloon space: range [ 0x%lx - 0x%lx ] %lu KiB.\n",
228 * graphic address space allocated to other vGPUs, by marking these spaces as
237 * of its graphic space being zero. Yet there are some portions ballooned out(
239 * host point of view, the graphic address space is partitioned by multiple
306 ret = vgt_balloon_space(ggtt, &bl_info.space[2]
    [all...]
  /src/games/gomoku/
makemove.c 133 bool space = fsp->s_occ == EMPTY; local in function:makemove
167 if (space && sp->s_occ == EMPTY) {
  /src/sys/net80211/
ieee80211_acl.c 277 uint32_t i, space; local in function:acl_getioctl
284 space = as->as_nacls * IEEE80211_ADDR_LEN;
286 ireq->i_len = space; /* return required space */
289 ap = malloc(space, M_TEMP, M_WAITOK);
297 if (ireq->i_len >= space) {
298 error = copyout(ap, ireq->i_data, space);
299 ireq->i_len = space;
  /src/sys/dev/
kttcp.c 202 long space, len, mlen; local in function:kttcp_sosend
211 * However, space must be signed, as it might be less than 0
213 * of space and resid. On the other hand, a negative resid
244 space = sbspace(&so->so_snd);
246 space += 1024;
249 if (space < resid && (atomic || space < so->so_snd.sb_lowat)) {
275 if (resid >= MINCLSIZE && space >= MCLBYTES) {
290 space -= len;
293 len = lmin(lmin(mlen, resid), space);
    [all...]
  /src/bin/sh/
memalloc.c 57 * Like malloc, but returns an error when out of space.
67 error("Out of space");
81 error("Out of space");
114 char space[MINSIZE]; member in struct:stack_block
120 char *stacknxt = stackbase.space;
140 stacknxt = sp->space;
212 * of space on top of the stack and stackblocklen returns the length of
213 * this block. Growstackblock will grow this space by at least one byte,
224 if (stacknxt == stackp->space && stackp != &stackbase) {
236 stacknxt = sp->space;
    [all...]
  /src/lib/libc/db/hash/
hash_bigkey.c 90 uint16_t space, move_bytes, off; local in function:__big_insert
108 space = (uint16_t)temp;
110 size_t kspace = MIN(space, key_size);
130 space = FREESPACE(p);
131 if (space) {
132 size_t vspace = MIN(space, val_size);
137 * remaining space, we must overflow it to the
142 if (space == val_size && val_size == val->size)
162 space = (uint16_t)temp;
168 space = (uint16_t)temp
    [all...]
  /src/sys/arch/arm/at91/
at91pdcvar.h 123 /* fifo has enough space left for next chunk! */
219 panic("%s: len %d > pdc_space (f_length=%d space=%d size=%d)",
224 panic("%s: len < 0 (f_length=%d space=%d size=%d)",
276 int space = fifo->f_buf_size - fifo->f_length; local in function:AT91PDC_FIFO_WRPTR
277 if (space <= 0)
280 if (contig_bytes > space)
281 contig_bytes = space;

Completed in 33 milliseconds

1 2 3 4 5