Lines Matching refs:cache
79 x86_cpu_cache_t *cache;
83 cache = kalloc(sizeof(x86_cpu_cache_t) + (MAX_CPUS * sizeof(x86_lcpu_t *)));
84 if (cache == NULL)
87 cache = x86_caches;
88 x86_caches = cache->next;
89 cache->next = NULL;
92 bzero(cache, sizeof(x86_cpu_cache_t));
93 cache->next = NULL;
94 cache->maxcpus = MAX_CPUS;
95 for (i = 0; i < cache->maxcpus; i += 1) {
96 cache->cpus[i] = NULL;
101 return(cache);
120 * cache information. Set LLC sharing to 1, since
164 * Save the number of CPUs sharing this cache.
177 * logical CPUs sharing the cache.
186 * threads that are sharing the cache.
262 x86_cache_free(x86_cpu_cache_t *cache)
265 if (cache->level > 0 && cache->level <= MAX_CACHE_DEPTH)
266 num_Lx_caches[cache->level - 1] -= 1;
267 cache->next = x86_caches;
268 x86_caches = cache;
272 * This returns a list of cache structures that represent the
291 * cache information. Don't report anything
616 x86_cache_add_lcpu(x86_cpu_cache_t *cache, x86_lcpu_t *lcpu)
622 * Put the new CPU into the list of the cache.
624 cur_cache = lcpu->caches[cache->level - 1];
625 lcpu->caches[cache->level - 1] = cache;
626 cache->next = cur_cache;
627 cache->nlcpus += 1;
628 for (i = 0; i < cache->nlcpus; i += 1) {
629 if (cache->cpus[i] == NULL) {
630 cache->cpus[i] = lcpu;
651 * Add the cache data to the topology.
659 * Remove the cache from the front of the list.
667 * If the cache isn't shared then just put it where it
677 * have the same sharing. So if we have a cache already at
686 * This is a shared cache, so we have to figure out if
687 * this is the first time we've seen this cache. We do
689 * this cache is already described.
710 * If there's a cache on this logical CPU,
739 * If there's a cache on this logical CPU,
755 * If a shared cache wasn't found, then this logical CPU must