Lines Matching refs:left
40 * fast adding to the left side (reversed path). A reversed path can also be
575 int left = sctx->send_max_size - sctx->send_size;
577 if (unlikely(left < total_len))
5655 * Following comments will refer to these graphics. L is the left
5751 /* Fix the left offset for all behind 2a and 2b */
5789 * We're now behind the left extent (treat as unchanged) or at the end
6494 * refs of the right tree as deleted and all refs of the left tree as new.
6905 * If left < right treat left item as new, advance left tree
6907 * If left > right treat right item as deleted, advance right tree
6909 * If left == right do deep compare of items, treat as changed if
6913 * If left < right advance left tree and repeat
6914 * If left > right advance right tree and repeat
6915 * If left == right compare blockptrs of the next nodes/leafs
7221 * Not much left to do, we don't know why it's unbalanced and