Lines Matching defs:merged
67 * be merged into existing bad range E. The result is,
84 * be merged into existing bad range E. The result is,
149 * they will be merged into one, the result is,
172 * they will be merged into one, the result is,
255 * can be merged with rest part of S into less range S1 and S2. Now there is
322 * to no space, or some ranges are not merged to save bad blocks table space.
531 * Return 'true' if the range indicated by 'bad' can be backward merged
551 * (from the bad table) indexed by 'behind'. The return value is merged
560 int merged = 0;
566 merged = BB_OFFSET(p[behind]) - s;
567 p[behind] = BB_MAKE(s, BB_LEN(p[behind]) + merged, bad->ack);
569 WARN_ON((BB_LEN(p[behind]) + merged) >= BB_MAX_LEN);
572 return merged;
577 * merged with the bad range (from the bad table) indexed by 'prev'.
595 * merged from bad->len.
602 int merged = 0;
607 merged = min_t(sector_t, sectors, BB_END(p[prev]) - s);
609 merged = min_t(sector_t, sectors, BB_MAX_LEN - BB_LEN(p[prev]));
611 merged > (BB_OFFSET(p[prev + 1]) - BB_END(p[prev]))) {
612 merged = BB_OFFSET(p[prev + 1]) - BB_END(p[prev]);
616 BB_LEN(p[prev]) + merged, bad->ack);
619 return merged;
939 /* in case p[prev-1] can be merged with p[prev] */
1022 * merged. (prev < 0) condition is not handled here,
1422 * can be merged. We binary-search to find the 'insertion' point, then