| /src/crypto/external/apache2/openssl/dist/crypto/x509/ |
| pcy_map.c | 18 * Set policy mapping entries in cache. Note: this modifies the passed
26 X509_POLICY_CACHE *cache = x->policy_cache; local
43 data = ossl_policy_cache_find_data(cache, map->issuerDomainPolicy);
45 if (data == NULL && !cache->anyPolicy)
51 cache->anyPolicy->flags
55 data->qualifier_set = cache->anyPolicy->qualifier_set;
61 if (!sk_X509_POLICY_DATA_push(cache->data, data)) {
|
| pcy_cache.c | 22 * Set cache entry according to CertificatePolicies extension. Note: this
30 X509_POLICY_CACHE *cache = x->policy_cache; local
36 cache->data = sk_X509_POLICY_DATA_new(policy_data_cmp);
37 if (cache->data == NULL) {
52 if (cache->anyPolicy) {
56 cache->anyPolicy = data;
57 } else if (sk_X509_POLICY_DATA_find(cache->data, data) >= 0) {
60 } else if (!sk_X509_POLICY_DATA_push(cache->data, data)) {
67 sk_X509_POLICY_DATA_sort(cache->data);
77 sk_X509_POLICY_DATA_pop_free(cache->data, ossl_policy_data_free)
85 X509_POLICY_CACHE *cache; local
[all...] |
| /src/crypto/external/bsd/openssl/dist/crypto/x509/ |
| pcy_map.c | 18 * Set policy mapping entries in cache. Note: this modifies the passed
26 X509_POLICY_CACHE *cache = x->policy_cache; local
43 data = ossl_policy_cache_find_data(cache, map->issuerDomainPolicy);
45 if (data == NULL && !cache->anyPolicy)
51 cache->anyPolicy->flags
55 data->qualifier_set = cache->anyPolicy->qualifier_set;
61 if (!sk_X509_POLICY_DATA_push(cache->data, data)) {
|
| pcy_cache.c | 22 * Set cache entry according to CertificatePolicies extension. Note: this
30 X509_POLICY_CACHE *cache = x->policy_cache; local
36 cache->data = sk_X509_POLICY_DATA_new(policy_data_cmp);
37 if (cache->data == NULL) {
52 if (cache->anyPolicy) {
56 cache->anyPolicy = data;
57 } else if (sk_X509_POLICY_DATA_find(cache->data, data) >=0 ) {
60 } else if (!sk_X509_POLICY_DATA_push(cache->data, data)) {
75 sk_X509_POLICY_DATA_pop_free(cache->data, ossl_policy_data_free);
76 cache->data = NULL
83 X509_POLICY_CACHE *cache; local
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/crypto/x509v3/ |
| pcy_map.c | 18 * Set policy mapping entries in cache. Note: this modifies the passed
26 X509_POLICY_CACHE *cache = x->policy_cache; local
43 data = policy_cache_find_data(cache, map->issuerDomainPolicy);
45 if (data == NULL && !cache->anyPolicy)
51 cache->anyPolicy->flags
55 data->qualifier_set = cache->anyPolicy->qualifier_set;
61 if (!sk_X509_POLICY_DATA_push(cache->data, data)) {
|
| pcy_cache.c | 22 * Set cache entry according to CertificatePolicies extension. Note: this
30 X509_POLICY_CACHE *cache = x->policy_cache; local
36 cache->data = sk_X509_POLICY_DATA_new(policy_data_cmp);
37 if (cache->data == NULL) {
52 if (cache->anyPolicy) {
56 cache->anyPolicy = data;
57 } else if (sk_X509_POLICY_DATA_find(cache->data, data) >=0 ) {
60 } else if (!sk_X509_POLICY_DATA_push(cache->data, data)) {
75 sk_X509_POLICY_DATA_pop_free(cache->data, policy_data_free);
76 cache->data = NULL
83 X509_POLICY_CACHE *cache; local
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/engine/fifo/ |
| channv50.h | 15 struct nvkm_gpuobj *cache; member in struct:nv50_fifo_chan
|
| /src/external/gpl3/gdb.old/dist/gdb/ |
| sentinel-frame.c | 34 struct frame_unwind_cache *cache = local
37 cache->regcache = regcache;
38 return cache;
41 /* Here the register value is taken direct from the register cache. */
48 struct frame_unwind_cache *cache local
55 value = cache->regcache->cooked_read_value (regnum);
75 struct frame_unwind_cache *cache local
78 return cache->regcache->arch ();
|
| sparc-sol2-tdep.c | 106 struct sparc_frame_cache *cache;
113 cache = sparc_frame_cache (this_frame, this_cache);
114 gdb_assert (cache == *this_cache);
116 cache->saved_regs = trad_frame_alloc_saved_regs (this_frame);
122 (cache->copied_regs_mask & 0x04) ? SPARC_I2_REGNUM : SPARC_O2_REGNUM;
125 cache->saved_regs[SPARC32_PSR_REGNUM].set_addr (mcontext_addr + 0 * 4);
126 cache->saved_regs[SPARC32_PC_REGNUM].set_addr (mcontext_addr + 1 * 4);
127 cache->saved_regs[SPARC32_NPC_REGNUM].set_addr (mcontext_addr + 2 * 4);
128 cache->saved_regs[SPARC32_Y_REGNUM].set_addr (mcontext_addr + 3 * 4);
133 cache->saved_regs[regnum].set_addr (addr)
105 struct sparc_frame_cache *cache; local
157 struct sparc_frame_cache *cache = local
168 struct sparc_frame_cache *cache = local
[all...] |
| /src/external/ibm-public/postfix/dist/src/smtp/ |
| smtp_unalias.c | 22 /* results in a private cache, so a name is looked up only once.
69 static HTABLE *cache; local
77 * Initialize the cache on the fly. The smtp client is designed to exit
79 * prevent the cache from growing too large, or to expire old entries.
81 if (cache == 0)
82 cache = htable_create(10);
88 if ((result = htable_find(cache, name)) == 0) {
97 htable_enter(cache, name, result = vstring_export(fqdn));
|
| /src/external/gpl3/gdb/dist/gdb/ |
| sentinel-frame.c | 34 struct frame_unwind_cache *cache = local
37 cache->regcache = regcache;
38 return cache;
41 /* Here the register value is taken direct from the register cache. */
48 struct frame_unwind_cache *cache local
55 value = cache->regcache->cooked_read_value (regnum);
75 struct frame_unwind_cache *cache local
78 return cache->regcache->arch ();
|
| /src/sys/external/bsd/compiler_rt/dist/lib/tsan/tests/unit/ |
| tsan_dense_alloc_test.cc | 26 typedef Alloc::Cache Cache;
31 Cache cache; local
32 alloc.InitCache(&cache);
37 IndexT idx = alloc.Alloc(&cache);
48 alloc.Free(&cache, idx);
51 alloc.FlushCache(&cache);
|
| /src/usr.sbin/rpc.pcnfsd/ |
| pcnfsd_cache.c | 38 struct cache { struct
49 ** User cache support procedures
|
| /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/ |
| rtree_tsd.h | 5 * Number of leafkey/leaf pairs to cache in L1 and L2 level respectively. Each
6 * entry supports an entire leaf, so the cache hit rate is typically high even
10 * that this cache can directly cover, the cache will become less effective if
11 * locality of reference is low, but the consequence is merely cache misses
14 * The L1 direct mapped cache offers consistent and low cost on cache hit.
16 * combining with a L2 LRU cache, which requires linear search and re-ordering
17 * on access but suffers no collision. Note that, the cache will itself suffer
18 * cache misses if made overly large, plus the cost of linear search in the LR
43 rtree_ctx_cache_elm_t cache[RTREE_CTX_NCACHE]; member in struct:rtree_ctx_s
[all...] |
| /src/external/bsd/jemalloc.old/include/jemalloc/internal/ |
| rtree_tsd.h | 5 * Number of leafkey/leaf pairs to cache in L1 and L2 level respectively. Each
6 * entry supports an entire leaf, so the cache hit rate is typically high even
10 * that this cache can directly cover, the cache will become less effective if
11 * locality of reference is low, but the consequence is merely cache misses
14 * The L1 direct mapped cache offers consistent and low cost on cache hit.
16 * combining with a L2 LRU cache, which requires linear search and re-ordering
17 * on access but suffers no collision. Note that, the cache will itself suffer
18 * cache misses if made overly large, plus the cost of linear search in the LR
43 rtree_ctx_cache_elm_t cache[RTREE_CTX_NCACHE]; member in struct:rtree_ctx_s
[all...] |
| /src/external/zlib/pigz/dist/zopfli/ |
| cache.c | 20 #include "cache.h"
36 that this cache value is not filled in yet. */
54 unsigned char* cache; local
60 cache = &lmc->sublen[ZOPFLI_CACHE_LENGTH * pos * 3];
64 cache[j * 3] = i - 3;
65 cache[j * 3 + 1] = sublen[i] % 256;
66 cache[j * 3 + 2] = (sublen[i] >> 8) % 256;
74 cache[(ZOPFLI_CACHE_LENGTH - 1) * 3] = bestlength - 3;
87 unsigned char* cache; local
92 cache = &lmc->sublen[ZOPFLI_CACHE_LENGTH * pos * 3]
109 unsigned char* cache; local
[all...] |
| /src/lib/libc/locale/ |
| setlocale.c | 64 _setlocale_cache(locale_t loc, struct _locale_cache_t *cache)
85 loc->cache = old_cache;
86 free(cache);
90 if (cache == NULL) {
91 cache = malloc(sizeof(*cache));
92 if (cache == NULL)
96 cache->monetary_name = monetary_name;
97 cache->numeric_name = numeric_name;
98 cache->message_name = message_name
180 struct _locale_cache_t *cache; local
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/ |
| sanitizer_quarantine_test.cc | 31 typedef QuarantineCache<QuarantineCallback> Cache;
38 static void DeallocateCache(Cache *cache) {
39 while (QuarantineBatch *batch = cache->DequeueBatch())
78 Cache cache; local
79 Cache to_deallocate;
80 cache.MergeBatches(&to_deallocate);
87 Cache cache; local
107 Cache cache; local
129 Cache cache; local
155 Cache cache; local
[all...] |
| /src/crypto/external/bsd/heimdal/dist/kuser/ |
| kdecode_ticket.c | 103 krb5_ccache cache; local
130 ret = krb5_cc_default(context, &cache);
145 ret = krb5_cc_get_principal(context, cache, &in.client);
154 ret = krb5_get_credentials(context, 0, cache, &in, &out);
|
| kdestroy.c | 38 static const char *cache; variable
51 { "cache", 'c', arg_string, rk_UNCONST(&cache), "cache to destroy", "cache" },
124 if(cache == NULL) {
130 cache,
|
| /src/external/apache2/llvm/dist/clang/lib/AST/ |
| Linkage.h | 75 // We have a cache for repeated linkage/visibility computations. This saves us
102 void cache(const NamedDecl *ND, LVComputationKind Kind, LinkageInfo Info) { function in class:clang::LinkageComputer
|
| /src/external/bsd/jemalloc/dist/src/ |
| rtree.c | 177 assert(rtree_ctx->cache[i].leafkey != leafkey);
206 * Cache replacement upon hard lookup (i.e. L1 & L2 rtree cache miss):
207 * (1) evict last entry in L2 cache; (2) move the collision slot from L1
208 * cache down to L2; and 3) fill L1.
223 rtree_ctx->cache[slot].leafkey; \
225 rtree_ctx->cache[slot].leaf; \
227 rtree_ctx->cache[slot].leafkey = leafkey; \
228 rtree_ctx->cache[slot].leaf = leaf; \
252 rtree_ctx_cache_elm_t *cache = &ctx->cache[i] local
257 rtree_ctx_cache_elm_t *cache = &ctx->l2_cache[i]; local
[all...] |
| /src/external/cddl/osnet/lib/libumem/ |
| umem.c | 110 umem_cache_t *cache = malloc(sizeof(umem_cache_t)); local
111 if(cache == NULL)
114 cache->constructor = constructor;
115 cache->destructor = destructor;
116 cache->callback_data = callback_data;
117 cache->bufsize = bufsize;
119 return cache;
125 void *umem_cache_alloc(umem_cache_t *cache, int flags)
127 void *buf = malloc(cache->bufsize);
137 if(cache->constructor != NULL)
[all...] |
| /src/external/gpl3/gcc/dist/libobjc/ |
| hash.c | 35 #define FULLNESS(cache) \
36 ((((cache)->size * 75) / 100) <= (cache)->used)
37 #define EXPANSION(cache) \
38 ((cache)->size * 2)
44 cache_ptr cache; local
50 /* Allocate the cache structure. calloc insures its initialization
52 cache = (cache_ptr) objc_calloc (1, sizeof (struct cache));
53 assert (cache);
[all...] |
| /src/external/gpl3/gcc.old/dist/libobjc/ |
| hash.c | 35 #define FULLNESS(cache) \
36 ((((cache)->size * 75) / 100) <= (cache)->used)
37 #define EXPANSION(cache) \
38 ((cache)->size * 2)
44 cache_ptr cache; local
50 /* Allocate the cache structure. calloc insures its initialization
52 cache = (cache_ptr) objc_calloc (1, sizeof (struct cache));
53 assert (cache);
[all...] |
