Searched defs:need (Results 1 - 25 of 75) sorted by relevance

123

/external/mesa3d/src/mesa/drivers/dri/i915/
H A Dintel_resolve_map.c33 * changed to the given value of \c need.
39 enum gen6_hiz_op need)
46 (*tail)->need = need;
58 (*tail)->need = need;
36 intel_resolve_map_set(struct intel_resolve_map *head, uint32_t level, uint32_t layer, enum gen6_hiz_op need) argument
/external/mesa3d/src/mesa/drivers/dri/i965/
H A Dintel_resolve_map.c33 * changed to the given value of \c need.
39 enum gen6_hiz_op need)
46 (*tail)->need = need;
58 (*tail)->need = need;
36 intel_resolve_map_set(struct intel_resolve_map *head, uint32_t level, uint32_t layer, enum gen6_hiz_op need) argument
/external/mesa3d/src/mesa/drivers/dri/intel/
H A Dintel_resolve_map.c33 * changed to the given value of \c need.
39 enum gen6_hiz_op need)
46 (*tail)->need = need;
58 (*tail)->need = need;
36 intel_resolve_map_set(struct intel_resolve_map *head, uint32_t level, uint32_t layer, enum gen6_hiz_op need) argument
H A Dintel_resolve_map.h59 * There are two possible ways to record which miptree slices need
62 * those slices that need a resolve.
78 enum gen6_hiz_op need; member in struct:intel_resolve_map
88 enum gen6_hiz_op need);
/external/wpa_supplicant_8/hostapd/src/tls/
H A Dbignum.c77 size_t need = mp_unsigned_bin_size((mp_int *) n); local
78 if (len && need > *len) {
79 *len = need;
87 *len = need;
/external/wpa_supplicant_8/src/tls/
H A Dbignum.c77 size_t need = mp_unsigned_bin_size((mp_int *) n); local
78 if (len && need > *len) {
79 *len = need;
87 *len = need;
/external/wpa_supplicant_8/wpa_supplicant/src/tls/
H A Dbignum.c77 size_t need = mp_unsigned_bin_size((mp_int *) n); local
78 if (len && need > *len) {
79 *len = need;
87 *len = need;
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DLookaheadStream.h82 /** Make sure we have 'need' elements from current position p. Last valid
83 * p index is data.size()-1. p+need-1 is the data index 'need' elements
84 * ahead. If we need 1 element, (p+1-1)==p must be < data.size().
86 public void sync(int need) { argument
87 int n = (p+need-1) - data.size() + 1; // how many more elements we need?
/external/elfutils/src/libdwfl/
H A Dsegment.c54 size_t need = need_start + need_end; local
55 if (need == 0)
58 if (dwfl->lookup_alloc - dwfl->lookup_elts < need)
92 memmove (&dwfl->lookup_addr[i + need], &dwfl->lookup_addr[i],
94 memmove (&dwfl->lookup_segndx[i + need], &dwfl->lookup_segndx[i],
97 memmove (&dwfl->lookup_module[i + need], &dwfl->lookup_module[i],
120 dwfl->lookup_elts += need;
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Misc/
H A DLookaheadStream.cs109 * Make sure we have 'need' elements from current position p. Last valid
110 * p index is data.size()-1. p+need-1 is the data index 'need' elements
111 * ahead. If we need 1 element, (p+1-1)==p must be &lt; data.size().
114 protected virtual void SyncAhead(int need) { argument
115 int n = (_p + need - 1) - _data.Count + 1; // how many more elements we need?
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/misc/
H A DLookaheadStream.java95 /** Make sure we have 'need' elements from current position p. Last valid
96 * p index is data.size()-1. p+need-1 is the data index 'need' elements
97 * ahead. If we need 1 element, (p+1-1)==p must be < data.size().
99 protected void syncAhead(int need) { argument
100 int n = (p+need-1) - data.size() + 1; // how many more elements we need?
/external/apache-harmony/x-net/src/test/api/java/org/apache/harmony/xnet/tests/javax/net/ssl/
H A DSSLServerSocketTest.java127 public void setNeedClientAuth(boolean need) { argument
H A DSSLSocketTest.java186 public void setNeedClientAuth(boolean need) { argument
/external/conscrypt/src/main/java/org/conscrypt/
H A DOpenSSLServerSocketImpl.java152 public void setNeedClientAuth(boolean need) { argument
153 sslParameters.setNeedClientAuth(need);
/external/freetype/src/gzip/
H A Dinflate.c40 uLong need; /* stream check value */ member in struct:internal_state::__anon5050::__anon5051
196 z->state->sub.check.need = (uLong)NEXTBYTE << 24;
200 z->state->sub.check.need += (uLong)NEXTBYTE << 16;
204 z->state->sub.check.need += (uLong)NEXTBYTE << 8;
208 z->state->sub.check.need += (uLong)NEXTBYTE;
209 z->adler = z->state->sub.check.need;
214 z->msg = (char*)"need dictionary";
239 z->state->sub.check.need = (uLong)NEXTBYTE << 24;
243 z->state->sub.check.need += (uLong)NEXTBYTE << 16;
247 z->state->sub.check.need
[all...]
/external/openssh/
H A Dbitmap.c169 size_t i, j, k, need = bitmap_nbytes(b); local
171 if (l < need || b->top >= b->len)
173 if (l > need)
174 l = need;
180 s[need - 1 - k++] = (b->d[i] >> (j * 8)) & 0xff;
H A Ddh.c258 dh_gen_key(DH *dh, int need) argument
262 if (need < 0 || dh->p == NULL ||
264 need > INT_MAX / 2 || 2 * need >= pbits)
270 dh->length = MIN(need * 2, pbits - 1);
296 * This just returns the group, we still need to generate the exchange
H A Dsshbuf.c323 size_t rlen, need; local
344 need = len + buf->size - buf->alloc;
345 rlen = roundup(buf->alloc + need, SSHBUF_SIZE_INC);
346 SSHBUF_DBG(("need %zu initial rlen %zu", need, rlen));
348 rlen = buf->alloc + need;
/external/openssh/openbsd-compat/
H A Dmd5.c11 * except that you don't need to include two pages of legalese
71 size_t have, need; local
73 /* Check how many bytes we already have and how many more we need. */
75 need = MD5_BLOCK_LENGTH - have;
80 if (len >= need) {
82 memcpy(ctx->buffer + have, input, need);
84 input += need;
85 len -= need;
/external/protobuf/java/src/main/java/com/google/protobuf/nano/
H A DFieldArray.java228 private int idealIntArraySize(int need) { argument
229 return idealByteArraySize(need * 4) / 4;
232 private int idealByteArraySize(int need) { argument
234 if (need <= (1 << i) - 12)
237 return need;
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowSparseArray.java370 public static int idealIntArraySize(int need) { argument
371 return idealByteArraySize(need * 4) / 4;
374 public static int idealByteArraySize(int need) { argument
376 if (need <= (1 << i) - 12)
379 return need;
/external/valgrind/coregrind/
H A Dlauncher-linux.c101 unsigned need = strlen(path) + strlen("/") + strlen(clientname) + 1; local
103 fullname = malloc(need);
/external/wpa_supplicant_8/hostapd/src/crypto/
H A Dmd4-internal.c54 * except that you don't need to include two pages of legalese
110 size_t have, need; local
112 /* Check how many bytes we already have and how many more we need. */
114 need = MD4_BLOCK_LENGTH - have;
119 if (len >= need) {
121 os_memcpy(ctx->buffer + have, input, need);
123 input += need;
124 len -= need;
/external/wpa_supplicant_8/src/crypto/
H A Dmd4-internal.c54 * except that you don't need to include two pages of legalese
110 size_t have, need; local
112 /* Check how many bytes we already have and how many more we need. */
114 need = MD4_BLOCK_LENGTH - have;
119 if (len >= need) {
121 os_memcpy(ctx->buffer + have, input, need);
123 input += need;
124 len -= need;
/external/wpa_supplicant_8/wpa_supplicant/src/crypto/
H A Dmd4-internal.c54 * except that you don't need to include two pages of legalese
110 size_t have, need; local
112 /* Check how many bytes we already have and how many more we need. */
114 need = MD4_BLOCK_LENGTH - have;
119 if (len >= need) {
121 os_memcpy(ctx->buffer + have, input, need);
123 input += need;
124 len -= need;

Completed in 572 milliseconds

123