Searched refs:cache (Results 1 - 25 of 361) sorted by relevance

1234567891011>>

/haiku-buildtools/legacy/gcc/libobjc/
H A Dhash.c37 #define FULLNESS(cache) \
38 ((((cache)->size * 75) / 100) <= (cache)->used)
39 #define EXPANSION(cache) \
40 ((cache)->size * 2)
46 cache_ptr cache; local
52 /* Allocate the cache structure. calloc insures
54 cache = (cache_ptr) objc_calloc (1, sizeof (struct cache));
55 assert (cache);
80 hash_delete(cache_ptr cache) argument
173 hash_remove(cache_ptr cache, const void *key) argument
209 hash_next(cache_ptr cache, node_ptr node) argument
249 hash_value_for_key(cache_ptr cache, const void *key) argument
270 hash_is_key_in_hash(cache_ptr cache, const void *key) argument
[all...]
/haiku-buildtools/binutils/gas/testsuite/gas/mips/
H A Dcache.s7 .macro cache ops:vararg
19 cache 5, 255($2)
20 cache 5, -256($3)
22 cache 5, 2047($2)
23 cache 5, -2048($3)
29 cache 5, 2048($4)
30 cache 5, -2049($5)
31 cache 5, 32767($6)
32 cache 5, -32768($7)
38 cache
[all...]
H A Dmipsr6@cache.d3 #source: cache.s
11 [0-9a-f]+ <[^>]*> 7c457fa5 cache 0x5,255\(v0\)
12 [0-9a-f]+ <[^>]*> 7c658025 cache 0x5,-256\(v1\)
H A Dcache.d10 [0-9a-f]+ <[^>]*> bc4507ff cache 0x5,2047\(v0\)
11 [0-9a-f]+ <[^>]*> bc65f800 cache 0x5,-2048\(v1\)
12 [0-9a-f]+ <[^>]*> bc850800 cache 0x5,2048\(a0\)
13 [0-9a-f]+ <[^>]*> bca5f7ff cache 0x5,-2049\(a1\)
14 [0-9a-f]+ <[^>]*> bcc57fff cache 0x5,32767\(a2\)
15 [0-9a-f]+ <[^>]*> bce58000 cache 0x5,-32768\(a3\)
18 [0-9a-f]+ <[^>]*> bc258000 cache 0x5,-32768\(at\)
21 [0-9a-f]+ <[^>]*> bc257fff cache 0x5,32767\(at\)
24 [0-9a-f]+ <[^>]*> bc259000 cache 0x5,-28672\(at\)
27 [0-9a-f]+ <[^>]*> bc256fff cache
[all...]
H A Dmicromips@cache.d4 #source: cache.s
11 [0-9a-f]+ <[^>]*> 20a2 67ff cache 0x5,2047\(v0\)
12 [0-9a-f]+ <[^>]*> 20a3 6800 cache 0x5,-2048\(v1\)
14 [0-9a-f]+ <[^>]*> 20a1 6000 cache 0x5,0\(at\)
16 [0-9a-f]+ <[^>]*> 20a1 6000 cache 0x5,0\(at\)
18 [0-9a-f]+ <[^>]*> 20a1 6000 cache 0x5,0\(at\)
20 [0-9a-f]+ <[^>]*> 20a1 6000 cache 0x5,0\(at\)
23 [0-9a-f]+ <[^>]*> 20a1 6000 cache 0x5,0\(at\)
26 [0-9a-f]+ <[^>]*> 20a1 6fff cache 0x5,-1\(at\)
29 [0-9a-f]+ <[^>]*> 20a1 6000 cache
[all...]
H A Dmips32.d21 0+002c <[^>]*> bc250000 cache 0x5,0\(at\)
22 0+0030 <[^>]*> bc4507ff cache 0x5,2047\(v0\)
23 0+0034 <[^>]*> bc65f800 cache 0x5,-2048\(v1\)
26 0+0040 <[^>]*> bc258000 cache 0x5,-32768\(at\)
29 0+004c <[^>]*> bc257fff cache 0x5,32767\(at\)
31 0+0054 <[^>]*> bc258000 cache 0x5,-32768\(at\)
33 0+005c <[^>]*> bc257fff cache 0x5,32767\(at\)
H A Dmips32.s30 cache 5, ($1)
32 cache 5, 2047($2)
33 cache 5, -2048($3)
35 cache 5, 32768($4)
36 cache 5, -32769($5)
37 cache 5, 32768
38 cache 5, -32769
H A Dmicromips@mips32.d22 [0-9a-f]+ <[^>]*> 20a1 6000 cache 0x5,0\(at\)
23 [0-9a-f]+ <[^>]*> 20a2 67ff cache 0x5,2047\(v0\)
24 [0-9a-f]+ <[^>]*> 20a3 6800 cache 0x5,-2048\(v1\)
27 [0-9a-f]+ <[^>]*> 20a1 6000 cache 0x5,0\(at\)
30 [0-9a-f]+ <[^>]*> 20a1 6fff cache 0x5,-1\(at\)
32 [0-9a-f]+ <[^>]*> 20a1 6000 cache 0x5,0\(at\)
34 [0-9a-f]+ <[^>]*> 20a1 6fff cache 0x5,-1\(at\)
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/
H A Dpr63527.c12 struct cache_file *cache __attribute__ ((visibility ("hidden"))); variable in typeref:struct:cache_file
17 if (cache != ((void *)0) && cache != (struct cache_file *) -1)
19 __munmap (cache, cachesize);
20 cache = ((void *)0) ;
/haiku-buildtools/gcc/gcc/testsuite/c-c++-common/goacc/
H A Dcache-1.c24 #pragma acc cache /* { dg-error "expected '\\\(' before end of line" } */
26 #pragma acc cache a[0:N] /* { dg-error "expected '\\\(' before 'a'" } */
29 #pragma acc cache (a) /* { dg-error "expected '\\\['" } */
31 #pragma acc cache ( /* { dg-error "expected (identifier|unqualified-id) before end of line" } */
33 #pragma acc cache () /* { dg-error "expected (identifier|unqualified-id) before '\\\)' token" } */
35 #pragma acc cache (,) /* { dg-error "expected (identifier|unqualified-id) before '(,|\\\))' token" } */
37 #pragma acc cache (a[0:N] /* { dg-error "expected '\\\)' before end of line" } */
39 #pragma acc cache (a[0:N],) /* { dg-error "expected (identifier|unqualified-id) before '(,|\\\))' token" "" { xfail c } } */
41 #pragma acc cache (a[0:N]) copyin (a[0:N]) /* { dg-error "expected end of line before 'copyin'" } */
43 #pragma acc cache () /* { d
[all...]
/haiku-buildtools/gcc/mpfr/src/
H A Dcache.c1 /* mpfr_cache -- cache interface for multiple-precision constants in MPFR.
27 implement a cache mechanism for that constant */
29 mpfr_init_cache (mpfr_cache_t cache, int (*func)(mpfr_ptr, mpfr_rnd_t))
31 MPFR_PREC (cache->x) = 0; /* Invalid prec to detect that the cache is not
33 cache->func = func;
38 mpfr_clear_cache (mpfr_cache_t cache) argument
40 if (MPFR_PREC (cache->x) != 0)
41 mpfr_clear (cache->x);
42 MPFR_PREC (cache
46 mpfr_cache(mpfr_ptr dest, mpfr_cache_t cache, mpfr_rnd_t rnd) argument
[all...]
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.other/
H A Dlookup1.C8 char cache[blah]; member in struct:bar
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/template/
H A Dref7.C7 static Bar cache; member in struct:Foo
10 template <int& F> typename Foo<F>::Bar Foo<F>::cache; member in class:Foo
/haiku-buildtools/gcc/gcc/
H A Dtree-streamer.c129 streamer_tree_cache_add_to_node_array (struct streamer_tree_cache_d *cache, argument
133 if (cache->nodes.exists ())
135 if (cache->nodes.length () == ix)
136 cache->nodes.safe_push (t);
138 cache->nodes[ix] = t;
140 if (cache->hashes.exists ())
142 if (cache->hashes.length () == ix)
143 cache->hashes.safe_push (hash);
145 cache->hashes[ix] = hash;
154 slot in the cache
161 streamer_tree_cache_insert_1(struct streamer_tree_cache_d *cache, tree t, hashval_t hash, unsigned *ix_p, bool insert_at_next_slot_p) argument
206 streamer_tree_cache_insert(struct streamer_tree_cache_d *cache, tree t, hashval_t hash, unsigned *ix_p) argument
216 streamer_tree_cache_replace_tree(struct streamer_tree_cache_d *cache, tree t, unsigned ix) argument
232 streamer_tree_cache_append(struct streamer_tree_cache_d *cache, tree t, hashval_t hash) argument
247 streamer_tree_cache_lookup(struct streamer_tree_cache_d *cache, tree t, unsigned *ix_p) argument
278 record_common_node(struct streamer_tree_cache_d *cache, tree node) argument
326 preload_common_nodes(struct streamer_tree_cache_d *cache) argument
370 struct streamer_tree_cache_d *cache; local
[all...]
/haiku-buildtools/legacy/gcc/libobjc/objc/
H A Dhash.h39 * Items in the cache are really of type void *.
75 * This data structure is the cache.
80 typedef struct cache struct
113 /* Deallocate all of the hash nodes and the cache itself. */
115 void hash_delete (cache_ptr cache);
127 void hash_remove (cache_ptr cache, const void *key);
138 node_ptr hash_next (cache_ptr cache, node_ptr node);
142 void *hash_value_for_key (cache_ptr cache, const void *key);
146 BOOL hash_is_key_in_hash (cache_ptr cache, const void *key);
161 hash_ptr (cache_ptr cache, cons argument
170 hash_string(cache_ptr cache, const void *key) argument
[all...]
/haiku-buildtools/gcc/libgomp/testsuite/libgomp.oacc-c-c++-common/
H A Dcache-1.c24 #pragma acc cache (a[0:N])
26 #pragma acc cache (a[0:N], b[0:N])
28 #pragma acc cache (a[0])
30 #pragma acc cache (a[0], a[1], b[0:N])
32 #pragma acc cache (a[idx])
34 #pragma acc cache (a[idx:len])
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ipa/
H A Dinlinehint-4.c19 static int cache, cache_val; local
21 return cache;
25 cache = lookup_slow (val);
26 return cache;
/haiku-buildtools/gcc/libsanitizer/sanitizer_common/
H A Dsanitizer_allocator.cc32 static void *RawInternalAlloc(uptr size, InternalAllocatorCache *cache) { argument
33 (void)cache;
37 static void RawInternalFree(void *ptr, InternalAllocatorCache *cache) { argument
38 (void)cache;
69 static void *RawInternalAlloc(uptr size, InternalAllocatorCache *cache) {
70 if (cache == 0) {
75 return internal_allocator()->Allocate(cache, size, 8, false);
78 static void RawInternalFree(void *ptr, InternalAllocatorCache *cache) {
79 if (cache == 0) {
83 internal_allocator()->Deallocate(cache, pt
90 InternalAlloc(uptr size, InternalAllocatorCache *cache) argument
100 InternalFree(void *addr, InternalAllocatorCache *cache) argument
[all...]
H A Dsanitizer_allocator_internal.h46 void *InternalAlloc(uptr size, InternalAllocatorCache *cache = 0);
47 void InternalFree(void *p, InternalAllocatorCache *cache = 0);
/haiku-buildtools/jam/
H A Djcache.c236 // the jamfile cache
240 char* cache_file; // name of the cache file
243 // a cache entry for an include file
248 int used; // whether this cache entry has been used
251 // pointer to the jamfile cache
254 // jamfile cache prototypes
256 static void delete_jamfile_cache(jamfile_cache* cache);
260 static int add_jcache_entry(jamfile_cache* cache, jcache_entry* entry);
261 static jcache_entry* find_jcache_entry(jamfile_cache* cache, char* filename);
263 static int read_jcache(jamfile_cache* cache, cha
277 jamfile_cache *cache = (jamfile_cache*)malloc(sizeof(jamfile_cache)); local
296 delete_jamfile_cache(jamfile_cache* cache) argument
367 add_jcache_entry(jamfile_cache* cache, jcache_entry* entry) argument
391 find_jcache_entry(jamfile_cache* cache, char* filename) argument
485 read_jcache(jamfile_cache* cache, char* filename) argument
559 write_jcache(jamfile_cache* cache) argument
711 jamfile_cache* cache = get_jcache(); local
737 jamfile_cache* cache = get_jcache(); local
[all...]
/haiku-buildtools/isl/
H A Disl_blk.c13 /* The maximal number of cache misses before first element is evicted */
82 for (i = 1; ctx->cache[best].size != n && i < ctx->n_cached; ++i) {
83 if (ctx->cache[best].size < n) {
84 if (ctx->cache[i].size > ctx->cache[best].size)
86 } else if (ctx->cache[i].size >= n &&
87 ctx->cache[i].size < ctx->cache[best].size)
90 if (ctx->cache[best].size < 2 * n + 100) {
91 block = ctx->cache[bes
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/goacc/
H A Dcache-1.f959 !$acc cache (d)
/haiku-buildtools/gcc/libgcc/config/arc/gmon/
H A Ddcache_linesz.S35 ; For Arctangent-A5, if no data cache is present, a read of the
36 ; cache build register returns the ID register. For ARC600 and
/haiku-buildtools/gcc/libsanitizer/tsan/
H A Dtsan_dense_alloc.h11 // DenseSlabAllocCache is a thread-local cache for DenseSlabAlloc.
30 IndexT cache[kSize]; member in class:__tsan::DenseSlabAllocCache
62 return c->cache[--c->pos];
69 c->cache[c->pos++] = idx;
81 IndexT idx = c->cache[--c->pos];
89 internal_memset(c->cache, 0, sizeof(c->cache));
118 c->cache[c->pos++] = idx;
126 IndexT idx = c->cache[--c->pos];
/haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/23_containers/insert/
H A D54075.cc111 template<bool cache>
115 cache>;
116 template<bool cache>
120 cache>;
121 template<bool cache>
125 std::__uset_traits<cache>>;
126 template<bool cache>
130 std::__uset_traits<cache>>;
185 "std::unordered_set default cache ", foos);
187 "std::unordered_multiset default cache ", foo
[all...]

Completed in 180 milliseconds

1234567891011>>