/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i915/ |
H A D | intel_resolve_map.c | 33 * 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/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
H A D | intel_resolve_map.c | 33 * 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/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/intel/ |
H A D | intel_resolve_map.c | 33 * 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 D | intel_resolve_map.h | 59 * 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/mesa3d/src/mesa/drivers/dri/i915/ |
H A D | intel_resolve_map.c | 33 * 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 D | intel_resolve_map.c | 33 * 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 D | intel_resolve_map.c | 33 * 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 D | intel_resolve_map.h | 59 * 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/oprofile/libabi/ |
H A D | abi.cpp | 38 int abi::need(string const key) const throw (abi_exception) function in class:abi
|
/external/wpa_supplicant_8/hostapd/src/tls/ |
H A D | bignum.c | 77 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 D | bignum.c | 77 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 D | bignum.c | 77 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 D | LookaheadStream.h | 82 /** 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/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/port/ |
H A D | __init__.py | 33 from base import Port # It's possible we don't need to export this virtual baseclass outside the module. namespace
|
/external/chromium_org/third_party/sqlite/src/src/ |
H A D | table.c | 46 int need; /* Slots needed in p->azResult[] */ local 51 ** we need to remember from this invocation of the callback. 54 need = nCol*2; 56 need = nCol; 58 if( p->nData + need > p->nAlloc ){ 60 p->nAlloc = p->nAlloc*2 + need;
|
/external/elfutils/0.153/libdwfl/ |
H A D | segment.c | 73 size_t need = need_start + need_end; local 74 if (need == 0) 77 if (dwfl->lookup_alloc - dwfl->lookup_elts < need) 111 memmove (&dwfl->lookup_addr[i + need], &dwfl->lookup_addr[i], 113 memmove (&dwfl->lookup_segndx[i + need], &dwfl->lookup_segndx[i], 116 memmove (&dwfl->lookup_module[i + need], &dwfl->lookup_module[i], 139 dwfl->lookup_elts += need;
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Misc/ |
H A D | LookaheadStream.cs | 109 * 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 < 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 D | LookaheadStream.java | 95 /** 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 D | SSLServerSocketTest.java | 127 public void setNeedClientAuth(boolean need) { argument
|
/external/conscrypt/src/main/java/org/conscrypt/ |
H A D | OpenSSLServerSocketImpl.java | 152 public void setNeedClientAuth(boolean need) { argument 153 sslParameters.setNeedClientAuth(need);
|
/external/freetype/src/gzip/ |
H A D | inflate.c | 40 uLong need; /* stream check value */ member in struct:internal_state::__anon21553::__anon21554 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/protobuf/java/src/main/java/com/google/protobuf/nano/ |
H A D | FieldArray.java | 225 private int idealIntArraySize(int need) { argument 226 return idealByteArraySize(need * 4) / 4; 229 private int idealByteArraySize(int need) { argument 231 if (need <= (1 << i) - 12) 234 return need;
|
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
H A D | ShadowSparseArray.java | 370 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/smack/src/org/xbill/DNS/ |
H A D | DNSOutput.java | 56 need(int n) { method in class:DNSOutput 111 need(1); 122 need(2); 149 need(4); 164 need(len); 188 need(1 + s.length);
|
/external/valgrind/main/coregrind/ |
H A D | launcher-linux.c | 93 unsigned need = strlen(path) + strlen("/") + strlen(clientname) + 1; local 95 fullname = malloc(need);
|