reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
80 if (n && ctx->n_cached) { 82 for (i = 1; ctx->cache[best].size != n && i < ctx->n_cached; ++i) { 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) 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) 87 ctx->cache[i].size < ctx->cache[best].size) 90 if (ctx->cache[best].size < 2 * n + 100) { 91 block = ctx->cache[best]; 92 if (--ctx->n_cached != best) 93 ctx->cache[best] = ctx->cache[ctx->n_cached]; 93 ctx->cache[best] = ctx->cache[ctx->n_cached]; 93 ctx->cache[best] = ctx->cache[ctx->n_cached]; 95 ctx->n_miss = 0; 96 } else if (ctx->n_miss++ >= ISL_BLK_MAX_MISS) { 97 isl_blk_free_force(ctx, ctx->cache[0]); 97 isl_blk_free_force(ctx, ctx->cache[0]); 98 if (--ctx->n_cached != 0) 99 ctx->cache[0] = ctx->cache[ctx->n_cached]; 99 ctx->cache[0] = ctx->cache[ctx->n_cached]; 99 ctx->cache[0] = ctx->cache[ctx->n_cached]; 100 ctx->n_miss = 0; 104 return extend(ctx, block, n);