/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/chromium_org/native_client_sdk/src/libraries/nacl_io/ |
H A D | mount_node_mem.cc | 67 size_t need = (new_size + BLOCK_MASK) & ~BLOCK_MASK; local 71 if (need == capacity_) { 77 char* newdata = static_cast<char*>(realloc(data_, need)); 81 memset(newdata + old_size, 0, need - old_size); 84 capacity_ = need;
|
/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/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) 110 memcpy (&dwfl->lookup_addr[i + need], &dwfl->lookup_addr[i], 111 need * sizeof dwfl->lookup_addr[0]); 112 memcpy (&dwfl->lookup_segndx[i + need], &dwfl->lookup_segndx[i], 113 need * sizeof dwfl->lookup_segndx[0]); 115 memcpy (&dwfl->lookup_module[i + need], &dwfl->lookup_module[i], 116 need * sizeof dwfl->lookup_module[0]); 134 dwfl->lookup_elts += need; [all...] |
/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 | 128 public void setNeedClientAuth(boolean need) { argument
|
/external/openssh/ |
H A D | dh.c | 235 dh_gen_key(DH *dh, int need) argument 241 if (need > INT_MAX / 2 || 2 * need >= BN_num_bits(dh->p)) 242 fatal("dh_gen_key: group too small: %d (2*need %d)", 243 BN_num_bits(dh->p), 2*need); 249 /* generate a 2*need bits random private exponent */ 250 if (!BN_rand(dh->priv_key, 2*need, 0, 0)) 281 * This just returns the group, we still need to generate the exchange
|
/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/wpa_supplicant_8/hostapd/src/crypto/ |
H A D | md4-internal.c | 54 * 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 D | md4-internal.c | 54 * 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;
|