HomeSort by relevance Sort by last modified time
    Searched refs:used (Results 51 - 75 of 3017) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/mesa3d/src/gallium/winsys/i915/sw/
i915_sw_batchbuffer.c 106 unsigned used = 0; local
110 used = batch->base.ptr - batch->base.map;
111 assert((used & 3) == 0);
116 used += 4;
119 if ((used & 4) == 0) {
126 used = batch->base.ptr - batch->base.map;
127 assert((used & 4) == 0);
  /external/mesa3d/src/gallium/winsys/svga/drm/
vmw_context.c 70 uint32_t used; member in struct:vmw_svga_winsys_context::__anon31422
77 uint32_t used; member in struct:vmw_svga_winsys_context::__anon31423
85 uint32_t used; member in struct:vmw_svga_winsys_context::__anon31424
142 for(i = 0; i < vswc->region.used; ++i) {
154 if (vswc->command.used || pfence != NULL)
159 vswc->command.used,
165 vswc->command.used = 0;
168 for(i = 0; i < vswc->surface.used + vswc->surface.staged; ++i) {
175 vswc->surface.used = 0;
178 for(i = 0; i < vswc->region.used + vswc->region.staged; ++i)
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/
radeon_program.c 75 unsigned char * Used;
94 d->Used[index] |= mask;
98 * This function fills in the parameter 'used' with a writemask that
99 * represent which components of each temporary register are used by the
102 * @param used The function does not initialize this parameter.
106 unsigned char * used,
111 d.Used = used;
122 /* Search a list of used temporaries for a free one
124 * @note If this functions finds a free temporary, it will mark it as used
152 unsigned char used[RC_REGISTER_MAX_INDEX]; local
    [all...]
  /external/mesa3d/src/gallium/drivers/r300/compiler/
radeon_program.c 75 unsigned char * Used;
94 d->Used[index] |= mask;
98 * This function fills in the parameter 'used' with a writemask that
99 * represent which components of each temporary register are used by the
102 * @param used The function does not initialize this parameter.
106 unsigned char * used,
111 d.Used = used;
122 /* Search a list of used temporaries for a free one
124 * @note If this functions finds a free temporary, it will mark it as used
152 unsigned char used[RC_REGISTER_MAX_INDEX]; local
    [all...]
  /external/chromium_org/third_party/mesa/src/src/glsl/
opt_dead_functions.cpp 43 this->used = false;
47 bool used; member in class:__anon17888::signature_entry
95 entry->used = true;
109 entry->used = true;
122 /* Now that we've figured out which function signatures are used, remove
129 if (!entry->used) {
  /external/mesa3d/src/glsl/
opt_dead_functions.cpp 43 this->used = false;
47 bool used; member in class:__anon31447::signature_entry
95 entry->used = true;
109 entry->used = true;
122 /* Now that we've figured out which function signatures are used, remove
129 if (!entry->used) {
  /external/valgrind/main/memcheck/tests/
leak-pool.c 18 size_t used; member in struct:pool
25 void *a = p->buf + p->used;
26 assert(p->used + n < p->allocated);
28 p->used += n;
38 p->used = 0;
mallinfo.c 15 size_t used; local
36 used = mi.uordblks + mi.hblkhd;
37 if (used < min)
40 if (used > max)
43 // used should be reasonably close to min
45 if (used/5*4 > min)
71 return used;
  /external/wpa_supplicant_8/src/utils/
wpabuf.c 39 wpa_printf(MSG_ERROR, "wpabuf %p (size=%lu used=%lu) overflow len=%lu",
40 buf, (unsigned long) buf->size, (unsigned long) buf->used,
69 if (buf->used + add_len > buf->size) {
72 nbuf = os_realloc(buf->buf, buf->used + add_len);
75 os_memset(nbuf + buf->used, 0, add_len);
81 buf->used + add_len);
87 sizeof(struct wpabuf) + buf->used, 0,
91 buf->used + add_len);
95 os_memset(nbuf + sizeof(struct wpabuf) + buf->used, 0,
101 buf->size = buf->used + add_len
    [all...]
  /external/chromium_org/third_party/openssl/openssl/crypto/bn/
bn_ctx.c 23 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
104 unsigned used, size; member in struct:bignum_pool
146 unsigned int used; member in struct:bignum_ctx
162 while(bnidx < ctx->used)
197 /* This function is an evil legacy and should not be used. This implementation
208 ctx->used = 0;
225 ret->used = 0;
262 else if(!BN_STACK_push(&ctx->stack, ctx->used))
279 if(fp < ctx->used)
280 BN_POOL_release(&ctx->pool, ctx->used - fp)
    [all...]
  /external/openssl/crypto/bn/
bn_ctx.c 23 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
104 unsigned used, size; member in struct:bignum_pool
146 unsigned int used; member in struct:bignum_ctx
162 while(bnidx < ctx->used)
197 /* This function is an evil legacy and should not be used. This implementation
208 ctx->used = 0;
225 ret->used = 0;
262 else if(!BN_STACK_push(&ctx->stack, ctx->used))
279 if(fp < ctx->used)
280 BN_POOL_release(&ctx->pool, ctx->used - fp)
    [all...]
  /frameworks/wilhelm/tools/permute/
permute.c 105 unsigned used; local
107 used = split(s, leftStart, leftLength, segmentBudget / 2);
108 used += split(s, rightStart, rightLength, segmentBudget - used);
110 used = split(s, rightStart, rightLength, segmentBudget / 2);
111 used += split(s, leftStart, leftLength, segmentBudget - used);
113 assert(used >= 2);
114 assert(used <= segmentBudget);
115 return used;
223 unsigned used; local
    [all...]
  /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
fx_zlib_inftrees.c 24 lens shorts, which is used as a work area. type is the type of code
47 unsigned used; /* code entries in table used */ local
99 The length counts are used for other purposes as well, i.e. finding
151 filled is at next and has curr index bits. The code being used is huff
165 counts are used for this, and so count[] is decremented as codes are
168 used keeps track of how many table entries have been allocated from the
183 base = extra = work; /* dummy value--not used */
207 used = 1U << root; /* use root table entries */
208 mask = used - 1; /* mask for comparing low *
    [all...]
  /external/qemu/distrib/zlib-1.2.8/
inftrees.c 24 lens shorts, which is used as a work area. type is the type of code
47 unsigned used; /* code entries in table used */ local
99 The length counts are used for other purposes as well, i.e. finding
151 filled is at next and has curr index bits. The code being used is huff
165 counts are used for this, and so count[] is decremented as codes are
168 used keeps track of how many table entries have been allocated from the
183 base = extra = work; /* dummy value--not used */
207 used = 1U << root; /* use root table entries */
208 mask = used - 1; /* mask for comparing low *
    [all...]
  /external/zlib/src/contrib/infback9/
inftree9.c 24 lens shorts, which is used as a work area. type is the type of code
47 unsigned used; /* code entries in table used */ local
101 The length counts are used for other purposes as well, i.e. finding
145 filled is at next and has curr index bits. The code being used is huff
159 counts are used for this, and so count[] is decremented as codes are
162 used keeps track of how many table entries have been allocated from the
177 base = extra = work; /* dummy value--not used */
201 used = 1U << root; /* use root table entries */
202 mask = used - 1; /* mask for comparing low *
    [all...]
  /external/zlib/src/
inftrees.c 24 lens shorts, which is used as a work area. type is the type of code
47 unsigned used; /* code entries in table used */ local
99 The length counts are used for other purposes as well, i.e. finding
151 filled is at next and has curr index bits. The code being used is huff
165 counts are used for this, and so count[] is decremented as codes are
168 used keeps track of how many table entries have been allocated from the
183 base = extra = work; /* dummy value--not used */
207 used = 1U << root; /* use root table entries */
208 mask = used - 1; /* mask for comparing low *
    [all...]
  /external/libedit/src/
chartype.c 20 * contributors may be used to endorse or promote products derived
81 ssize_t used = 0; local
92 used = (ssize_t)(conv->csize - (size_t)(dst - conv->cbuff));
93 if (used < 5) {
94 used = dst - conv->cbuff;
99 dst = conv->cbuff + used;
101 used = ct_encode_char(dst, (size_t)5, *s);
102 if (used == -1) /* failed to encode, need more buffer space */
105 dst += used;
214 ssize_t used = 0 local
    [all...]
  /bionic/libc/kernel/uapi/linux/
virtio_ring.h 61 struct vring_used *used; member in struct:vring
65 #define vring_avail_event(vr) (*(__u16 *)&(vr)->used->ring[(vr)->num])
  /development/ndk/platforms/android-L/include/linux/
virtio_ring.h 61 struct vring_used *used; member in struct:vring
65 #define vring_avail_event(vr) (*(__u16 *)&(vr)->used->ring[(vr)->num])
  /external/chromium_org/third_party/yasm/source/patched-yasm/modules/preprocs/nasm/tests/
ifcritical-err.asm 1 ; This worked under NASM. Due to the once-parse model used by YASM, this no
  /external/clang/test/CodeGenCXX/
lambda-expressions.cpp 6 // CHECK: @used = internal global
7 auto used = [](int i) { return i+1; }; variable
8 void *use = &used;
  /external/clang/test/Sema/
warn-unused-function.c 18 static void __attribute__((used)) f5() {}
20 static void __attribute__((used)) f6();
  /external/llvm/autoconf/m4/
need_dev_zero_for_mmap.m4 16 [Define if /dev/zero should be used when mapping RWX memory, or undefine if its not necessary])
  /external/speex/libspeex/
vq_sse.h 19 contributors may be used to endorse or promote products derived from
38 int i,j,k,used; local
42 used = 0;
59 for (k=N-1; (k >= 1) && (k > used || dist[i] < best_dist[k-1]); k--)
66 used++;
77 int i,j,k,used; local
81 used = 0;
108 for (k=N-1; (k >= 1) && (k > used || dist[i] < best_dist[k-1]); k--)
115 used++;
  /prebuilts/ndk/9/platforms/android-19/arch-arm64/usr/include/linux/
virtio_ring.h 61 struct vring_used *used; member in struct:vring
65 #define vring_avail_event(vr) (*(__u16 *)&(vr)->used->ring[(vr)->num])

Completed in 673 milliseconds

1 23 4 5 6 7 8 91011>>