Lines Matching refs:left
49 * fast adding to the left side (reversed path). A reversed path can also be
663 int left = sctx->send_max_size - sctx->send_size;
668 if (unlikely(left < total_len))
6209 * Following comments will refer to these graphics. L is the left
6305 /* Fix the left offset for all behind 2a and 2b */
6343 * We're now behind the left extent (treat as unchanged) or at the end
7042 * refs of the right tree as deleted and all refs of the left tree as new.
7706 * If left < right treat left item as new, advance left tree
7708 * If left > right treat right item as deleted, advance right tree
7710 * If left == right do deep compare of items, treat as changed if
7714 * If left < right advance left tree and repeat
7715 * If left > right advance right tree and repeat
7716 * If left == right compare blockptrs of the next nodes/leafs
7763 * Our right root is the parent root, while the left root is the "send"
7764 * root. We know that all new nodes/leaves in the left root must have
7766 * readahead for those nodes and leaves of the left root, as we know we
8054 * Not much left to do, we don't know why it's unbalanced and