Searched refs:CACHE (Results 1 – 13 of 13) sorted by relevance
65 CACHE(vd)[s] = NIL(Block_t*);80 LINK(tp) = CACHE(vd)[C_INDEX(SIZE(tp))];81 CACHE(vd)[C_INDEX(SIZE(tp))] = tp;
133 for(t = CACHE(vd)[C_INDEX(SIZE(b))]; t; t = LINK(t))139 for(t = CACHE(vd)[S_CACHE]; t; t = LINK(t))387 { LINK(fp) = CACHE(vd)[S_CACHE]; CACHE(vd)[S_CACHE] = fp;393 { list = CACHE(vd)[n]; CACHE(vd)[n] = NIL(Block_t*);635 LINK(bp) = CACHE(vd)[C_INDEX(SIZE(bp))];636 CACHE(vd)[C_INDEX(SIZE(bp))] = bp;711 LINK(tp) = CACHE(vd)[S_CACHE];712 CACHE(vd)[S_CACHE] = tp;894 { /**/ASSERT(!vmonlist(CACHE(vd)[INDEX(s)], bp) );895 LINK(bp) = CACHE(vd)[INDEX(s)];[all …]
198 LINK(t) = CACHE(vd)[C_INDEX(SIZE(t))];199 CACHE(vd)[C_INDEX(SIZE(t))] = t;
133 CACHE(vd)[e] = NIL(Block_t*);
338 #define CACHE(vd) ((vd)->cache) macro
187 CACHE(hdp)->update_count = DB_HDR(hdp)->update_count; in di_devlink_open()475 CACHE(hdp)->hash = calloc(hash_sz, sizeof (cache_link_t *)); in cache_alloc()476 if (CACHE(hdp)->hash == NULL) { in cache_alloc()479 CACHE(hdp)->hash_sz = hash_sz; in cache_alloc()705 CACHE(hdp)->update_count); in di_devlink_close()713 if (CACHE(hdp)->update_count == 0) { in di_devlink_close()714 CACHE(hdp)->update_count = 1; in di_devlink_close()751 (void) write_links(hdp, NULL, CACHE(hdp)->dngl, next); in di_devlink_close()752 DB_HDR(hdp)->update_count = CACHE(hdp)->update_count; in di_devlink_close()925 if (clp != NULL && ((pdmp == NULL) ^ (clp == CACHE(hdp)->dngl))) { in write_links()[all …]
248 #define CACHE(h) (&(h)->cache) macro249 #define CACHE_ROOT(h) (CACHE(h)->root)250 #define CACHE_HASH(h, i) (CACHE(h)->hash[i])251 #define CACHE_LAST(h) (CACHE(h)->last_minor)252 #define CACHE_EMPTY(h) (CACHE(h)->root == NULL && CACHE(h)->dngl == NULL)
32 #define CACHE 8 /* default # cached re's */ macro113 if (!(matchstate.cache = newof(0, Cache_t*, CACHE, 0))) in regcache()115 matchstate.size = CACHE; in regcache()
345 #define CACHE(i) (ROOT + ((i) << INFO->fullblocksize_shift)) macro346 #define LEAF CACHE (DISK_LEAF_NODE_LEVEL)695 char* cache = CACHE(depth); in read_tree_node()706 cache = CACHE(num_cached); in read_tree_node()769 cache = CACHE (depth); in next_key()
51 #define CACHE() do{CACHEINX();CACHEOUTX();st=pp.state;if(!pp.hidden)spliced=0;}while(0) macro159 #define CACHE() do{CACHEIN();CACHEOUT();}while(0) macro212 CACHE(); in ppcpp()398 CACHE(); in ppcpp()444 CACHE(); in ppcpp()1661 CACHE(); in ppcpp()1736 CACHE(); in ppcpp()1762 CACHE(); in ppcpp()1773 CACHE(); in ppcpp()
479 #define CACHE() do{CACHEIN();CACHEOUT();call=proto->call;}while(0) macro584 CACHE(); in lex()1866 CACHE(); in lex()
116 2.2 KSTATS (PER CACHE DESCRIPTOR):227 3.2 IO KSTATS (PER CACHE DESCRIPTOR):
1959 return_cmp(CACHE); in idmap_string2stat()