Lines Matching refs:nodes
1253 gc->nodes++; in btree_gc_mark_node()
1300 unsigned i, nodes = 0, keys = 0, blocks; in btree_gc_coalesce() local
1314 while (nodes < GC_MERGE_NODES && !IS_ERR_OR_NULL(r[nodes].b)) in btree_gc_coalesce()
1315 keys += r[nodes++].keys; in btree_gc_coalesce()
1319 if (nodes < 2 || in btree_gc_coalesce()
1321 block_bytes(b->c)) > blocks * (nodes - 1)) in btree_gc_coalesce()
1324 for (i = 0; i < nodes; i++) { in btree_gc_coalesce()
1339 for (i = 0; i < nodes; i++) in btree_gc_coalesce()
1342 for (i = nodes - 1; i > 0; --i) { in btree_gc_coalesce()
1408 for (i = 0; i < nodes; i++) in btree_gc_coalesce()
1419 for (i = 0; i < nodes; i++) { in btree_gc_coalesce()
1430 for (i = 0; i < nodes; i++) { in btree_gc_coalesce()
1437 memmove(r, r + 1, sizeof(r[0]) * (nodes - 1)); in btree_gc_coalesce()
1438 r[nodes - 1].b = ERR_PTR(-EINTR); in btree_gc_coalesce()
1440 trace_bcache_btree_gc_coalesce(nodes); in btree_gc_coalesce()
1441 gc->nodes--; in btree_gc_coalesce()
1456 for (i = 0; i < nodes; i++) in btree_gc_coalesce()