Lines Matching defs:ordered
9 #include "ordered-data.h"
118 * running delalloc, but usually we need to wait for ordered extents to
635 * If we are doing more ordered than delalloc we need to just wait on
636 * ordered extents, otherwise we'll waste time trying to flush delalloc
658 * their jobs and thus have ordered extents set up properly.
664 * that we know we'll have ordered extents for everything and we
859 u64 ordered, delalloc;
933 * If we have more ordered bytes than delalloc bytes then we're either
937 * of ordered extents, preemptively waiting on ordered extents gets us
938 * nothing, if our reservations are tied up in ordered extents we'll
939 * simply have to slow down writers by forcing them to wait on ordered
942 * In the case that ordered is larger than delalloc, only include the
946 * of heavy DIO or ordered reservations, preemptive flushing will just
949 * We want to make sure we truly are maxed out on ordered however, so
950 * cut ordered in half, and if it's still higher than delalloc then we
952 * flushing, and now delalloc == ordered and we stop preemptively
955 ordered = percpu_counter_read_positive(&fs_info->ordered_bytes) >> 1;
957 if (ordered >= delalloc)
1256 * For #2 this is trickier. Once the ordered extent runs we will drop the
1580 u64 ordered = percpu_counter_sum_positive(&fs_info->ordered_bytes);
1584 * If we're heavy on ordered operations then clamping won't help us. We
1588 * delayed nodes. If we're already more ordered than delalloc then
1591 if (ordered < delalloc)