HomeSort by: relevance | last modified time | path
    Searched defs:arc_p (Results 1 - 3 of 3) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
gcov.cc 2272 arc_info *arc_p, *arc_n;
2274 for (arc_p = NULL, arc = fn->blocks[ix].succ; arc;
2275 arc_p = arc, arc = arc_n)
2278 arc->succ_next = arc_p;
2280 fn->blocks[ix].succ = arc_p;
2282 for (arc_p = NULL, arc = fn->blocks[ix].pred; arc;
2283 arc_p = arc, arc = arc_n)
2286 arc->pred_next = arc_p;
2288 fn->blocks[ix].pred = arc_p;
2370 arc_info *arc, *arc_p, *arc_n
2271 arc_info *arc_p, *arc_n; local
2369 arc_info *arc, *arc_p, *arc_n; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
gcov.cc 2135 arc_info *arc_p, *arc_n;
2137 for (arc_p = NULL, arc = fn->blocks[ix].succ; arc;
2138 arc_p = arc, arc = arc_n)
2141 arc->succ_next = arc_p;
2143 fn->blocks[ix].succ = arc_p;
2145 for (arc_p = NULL, arc = fn->blocks[ix].pred; arc;
2146 arc_p = arc, arc = arc_n)
2149 arc->pred_next = arc_p;
2151 fn->blocks[ix].pred = arc_p;
2233 arc_info *arc, *arc_p, *arc_n
2134 arc_info *arc_p, *arc_n; local
2232 arc_info *arc, *arc_p, *arc_n; local
    [all...]
  /src/external/cddl/osnet/dist/uts/common/fs/zfs/
arc.c 343 /* shift of arc_c for calculating both min and max arc_p */
920 #define arc_p ARCSTAT(arcstat_p) /* target size of MRU */ macro
1122 arc_p = (arc_c >> 1);
3565 * evict so much that we drop the MRU below arc_p, though. If
3566 * we're over the meta limit more than we're over arc_p, we
3571 refcount_count(&arc_mru->arcs_size) - arc_p));
3578 * space alloted to the MFU (which is defined as arc_c - arc_p).
3581 (int64_t)(refcount_count(&arc_mfu->arcs_size) - (arc_c - arc_p)));
3685 * arc_p. So, if we're over our target cache size more than
3686 * the MRU is over arc_p, we'll evict enough to get back t
    [all...]

Completed in 38 milliseconds