/external/mesa3d/src/mesa/tnl/ |
H A D | t_vp_build.c | 44 const struct gl_vertex_program *prev = ctx->VertexProgram._Current; local 56 if (ctx->VertexProgram._Current != prev && ctx->Driver.BindProgram) {
|
/external/boringssl/src/crypto/x509v3/ |
H A D | tabtest.c | 76 int i, prev = -1, bad = 0; local 84 if((*tmp)->ext_nid < prev) bad = 1; 85 prev = (*tmp)->ext_nid;
|
/external/compiler-rt/test/tsan/ |
H A D | barrier.cc | 18 int *prev = data[i % 2]; local 20 int left = idx - 1 >= 0 ? prev[idx - 1] : 0; 21 int right = idx + 1 < kSize ? prev[idx + 1] : 0;
|
/external/iptables/include/linux/netfilter/ |
H A D | xt_limit.h | 18 unsigned long prev; /* moved to xt_limit_priv */ member in struct:xt_rateinfo
|
/external/kernel-headers/original/uapi/linux/netfilter/ |
H A D | xt_limit.h | 18 unsigned long prev; /* moved to xt_limit_priv */ member in struct:xt_rateinfo
|
/external/kernel-headers/original/uapi/linux/netfilter_bridge/ |
H A D | ebt_limit.h | 19 unsigned long prev; member in struct:ebt_limit_info
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.permutation.generators/ |
H A D | next_permutation.pass.cpp | 39 int prev[sa]; local 46 std::copy(ia, ia+e, prev); 51 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e)); 53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
|
H A D | next_permutation_comp.pass.cpp | 41 int prev[sa]; local 48 std::copy(ia, ia+e, prev); 53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C())); 55 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
|
H A D | prev_permutation.pass.cpp | 39 int prev[sa]; local 46 std::copy(ia, ia+e, prev); 51 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e)); 53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
|
H A D | prev_permutation_comp.pass.cpp | 41 int prev[sa]; local 48 std::copy(ia, ia+e, prev); 53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C())); 55 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
|
/external/libopus/src/ |
H A D | opus_multistream.c | 57 int get_left_channel(const ChannelLayout *layout, int stream_id, int prev) argument 60 i = (prev<0) ? 0 : prev+1; 69 int get_right_channel(const ChannelLayout *layout, int stream_id, int prev) argument 72 i = (prev<0) ? 0 : prev+1; 81 int get_mono_channel(const ChannelLayout *layout, int stream_id, int prev) argument 84 i = (prev<0) ? 0 : prev+1;
|
/external/mesa3d/src/gallium/drivers/nouveau/ |
H A D | nouveau_heap.h | 27 struct nouveau_heap *prev; member in struct:nouveau_heap
|
/external/mesa3d/src/gallium/drivers/trace/ |
H A D | tr_screen.h | 43 struct tr_list *prev; member in struct:tr_list
|
/external/skia/src/core/ |
H A D | SkLazyFnPtr.h | 53 F prev = (F)sk_atomic_cas(&fPtr, NULL, (void*)fn); local 55 // If prev != NULL, someone snuck in and set fPtr concurrently. 56 // If prev == NULL, we did write fn to fPtr. 57 return prev != NULL ? prev : fn;
|
/external/valgrind/callgrind/ |
H A D | costs.h | 49 CostChunk *next, *prev; member in struct:_CostChunk
|
/external/wpa_supplicant_8/wpa_supplicant/ |
H A D | blacklist.c | 94 struct wpa_blacklist *e, *prev = NULL; local 102 if (prev == NULL) { 105 prev->next = e->next; 112 prev = e; 125 struct wpa_blacklist *e, *prev; local 133 prev = e; 136 "blacklist (clear)", MAC2STR(prev->bssid)); 137 os_free(prev);
|
/external/clang/test/CoverageMapping/ |
H A D | loopmacro.c | 14 prev[(s) & WMASK] = match_head = head[ins_h], \ 40 int prev[32<<10] = { 0 }; local
|
/external/harfbuzz_ng/src/ |
H A D | hb-utf-private.hh | 110 prev (const uint8_t *text, function in struct:hb_utf_t 172 prev (const uint16_t *text, function in struct:hb_utf_t 230 prev (const uint32_t *text, function in struct:hb_utf_t
|
/external/icu/icu4c/source/i18n/ |
H A D | bocsu.cpp | 90 * code points. Lexical order is preserved if "prev" is always moved 93 * Additionally, "prev" is moved from anywhere in the Unihan 99 u_writeIdenticalLevelRun(UChar32 prev, const UChar *s, int32_t length, icu::ByteSink &sink) { argument 117 if(prev<0x4e00 || prev>=0xa000) { 118 prev=(prev&~0x7f)-SLOPE_REACH_NEG_1; 124 prev=0x9fff-SLOPE_REACH_POS_2; 131 prev=0; 133 p=u_writeDiff(c-prev, [all...] |
/external/linux-tools-perf/src/tools/perf/util/include/linux/ |
H A D | types.h | 18 struct list_head *next, *prev; member in struct:list_head
|
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_mm.h | 38 struct mem_block *next, *prev; member in struct:mem_block
|
/external/mesa3d/src/gallium/drivers/r600/ |
H A D | compute_memory_pool.h | 43 struct compute_memory_item* prev; member in struct:compute_memory_item
|
/external/mesa3d/src/mesa/drivers/dri/i915/ |
H A D | intel_resolve_map.c | 42 struct intel_resolve_map *prev = head; local 49 prev = *tail; 54 (*tail)->prev = prev; 88 if (elem->prev) 89 elem->prev->next = elem->next; 91 elem->next->prev = elem->prev;
|
/external/mesa3d/src/mesa/drivers/dri/i965/ |
H A D | intel_resolve_map.c | 42 struct intel_resolve_map *prev = head; local 49 prev = *tail; 54 (*tail)->prev = prev; 88 if (elem->prev) 89 elem->prev->next = elem->next; 91 elem->next->prev = elem->prev;
|
/external/mesa3d/src/mesa/drivers/dri/intel/ |
H A D | intel_resolve_map.c | 42 struct intel_resolve_map *prev = head; local 49 prev = *tail; 54 (*tail)->prev = prev; 88 if (elem->prev) 89 elem->prev->next = elem->next; 91 elem->next->prev = elem->prev;
|