Lines Matching defs:ordered
9 #include "ordered-data.h"
119 * running delalloc, but usually we need to wait for ordered extents to
616 * If we are doing more ordered than delalloc we need to just wait on
617 * ordered extents, otherwise we'll waste time trying to flush delalloc
639 * their jobs and thus have ordered extents set up properly.
645 * that we know we'll have ordered extents for everything and we
841 u64 ordered, delalloc;
915 * If we have more ordered bytes than delalloc bytes then we're either
919 * of ordered extents, preemptively waiting on ordered extents gets us
920 * nothing, if our reservations are tied up in ordered extents we'll
921 * simply have to slow down writers by forcing them to wait on ordered
924 * In the case that ordered is larger than delalloc, only include the
928 * of heavy DIO or ordered reservations, preemptive flushing will just
931 * We want to make sure we truly are maxed out on ordered however, so
932 * cut ordered in half, and if it's still higher than delalloc then we
934 * flushing, and now delalloc == ordered and we stop preemptively
937 ordered = percpu_counter_read_positive(&fs_info->ordered_bytes) >> 1;
939 if (ordered >= delalloc)
1237 * For #2 this is trickier. Once the ordered extent runs we will drop the
1561 u64 ordered = percpu_counter_sum_positive(&fs_info->ordered_bytes);
1565 * If we're heavy on ordered operations then clamping won't help us. We
1569 * delayed nodes. If we're already more ordered than delalloc then
1572 if (ordered < delalloc)