Range
typedef Range<int32, IntRangeCap> IntRange;
typedef Range<double, DoubleRangeCap> DoubleRange;
class Range
Range();
Range(const char* label, const char* key, const R* range, BSlider* slider);
Range<T, R>::Range()
Range<T, R>::Range(const char* label, const char* key, const R* range,
Range<T, R>::Key() const
Range<T, R>::Value()
Range<T, R>::UpdateLabel()
Range()
Range(int32 lowValue, int32 highValue)
class RangeList : private BObjectList<Range, true>
status_t AddRange(const Range& range);
const Range* RangeAt(int32 index) const;
void Range(double* min, double* max);
void Range(int32* min, int32* max);
Range(const Value& offset, const Value& size)
using BPrivate::Range;
typedef Range<Value> RangeType;
UINT64 Range;
fRange = firstSource->Range();
fRange.Extend(source->Range());
inline ChartDataRange Range() const;
virtual ChartDataRange Range() const = 0;
const Range* range = ranges.RangeAt(i);
const Range* range = ItemAt(i);
const Range*
Range* nextRange = ItemAt(i);
BObjectList<Range, true>(20)
Range* range = ItemAt(i);
Range* range = new(std::nothrow) Range(lowValue, highValue);
BPrivate::ObjectDeleter<Range> rangeDeleter(range);
RangeList::AddRange(const Range& range)
const Range<uint64>& range = ranges[i];
return ParsePatternList(Range(0, 0));
Range
Range range(start, end);
Parser::ParsePatternList(Range range)
Range range = ParseRange();
Range ParseRange();
DisjList* ParsePatternList(Range range);
class Range;
Pattern::Sniff(Range range, const Data& data, bool caseInsensitive) const
bool Sniff(Range range, const Data& data, bool caseInsensitive) const;
PatternList::PatternList(Range range)
PatternList(Range range);
Range fRange;
RPattern::RPattern(Range range, Pattern* pattern)
RPattern(Range range, Pattern *pattern);
Range fRange;
Range::Range(int32 start, int32 end)
Range::InitCheck() const
Range::GetErr() const
Range::Start() const
Range::End() const
Range::SetTo(int32 start, int32 end)
class Range {
Range(int32 start, int32 end);
Range* range = new(fRangesObjectCache, 0) Range(fBase, size,
Range::RANGE_FREE);
Range* range = fRangeList.Head();
while (range != NULL && range->type != Range::RANGE_AREA)
Range* range = static_cast<VMKernelArea*>(_area)->Range();
} while (range != NULL && range->type != Range::RANGE_AREA);
Range* range = fRangeTree.FindClosest(address, true);
if (range == NULL || range->type != Range::RANGE_AREA)
Range* range = fRangeTree.FindClosest(address, less);
while (range != NULL && range->type != Range::RANGE_AREA)
Range* range;
range->type = Range::RANGE_AREA;
_FreeRange(area->Range(), allocationFlags);
Range* range = static_cast<VMKernelArea*>(area)->Range();
Range* nextRange = fRangeList.GetNext(range);
if (nextRange == NULL || nextRange->type == Range::RANGE_AREA)
if (nextRange->type == Range::RANGE_RESERVED
Range* range = area->Range();
Range* nextRange = fRangeList.GetNext(range);
if (nextRange != NULL && nextRange->type == Range::RANGE_FREE) {
nextRange = new(fRangesObjectCache, allocationFlags) Range(
Range::RANGE_FREE);
|| (nextRange->type == Range::RANGE_RESERVED
if (nextRange->type == Range::RANGE_FREE)
if (nextRange->type == Range::RANGE_FREE)
Range* range = area->Range();
Range* previousRange = fRangeList.GetPrevious(range);
if (previousRange != NULL && previousRange->type == Range::RANGE_FREE) {
previousRange = new(fRangesObjectCache, allocationFlags) Range(
range->base, sizeDiff, Range::RANGE_FREE);
Range* range;
range->type = Range::RANGE_RESERVED;
Range* range = fRangeTree.FindClosest(address, false);
Range* nextRange = fRangeList.GetNext(range);
while (nextRange != NULL && nextRange->type == Range::RANGE_FREE)
if (range->type == Range::RANGE_RESERVED) {
Range* range = fRangeList.Head();
Range* nextRange = fRangeList.GetNext(range);
while (nextRange != NULL && nextRange->type == Range::RANGE_FREE)
if (range->type == Range::RANGE_RESERVED) {
Range* range = it.Next();) {
case Range::RANGE_AREA:
case Range::RANGE_RESERVED:
case Range::RANGE_FREE:
VMKernelAddressSpace::_FreeListInsertRange(Range* range, size_t size)
VMKernelAddressSpace::_FreeListRemoveRange(Range* range, size_t size)
VMKernelAddressSpace::_InsertRange(Range* range)
Range* insertBeforeRange = fRangeTree.FindClosest(range->base, true);
if (range->type == Range::RANGE_FREE)
VMKernelAddressSpace::_RemoveRange(Range* range)
if (range->type == Range::RANGE_FREE)
Range*& _range)
Range* range = _FindFreeRange(address, size, alignment,
Range* leftOverRange = new(fRangesObjectCache, allocationFlags)
Range(address + size, range->size - size, range);
Range* leftOverRange = new(fRangesObjectCache, allocationFlags) Range(
Range* leftOverRange1 = new(fRangesObjectCache, allocationFlags) Range(
Range* leftOverRange2 = new(fRangesObjectCache, allocationFlags) Range(
if (range->type == Range::RANGE_FREE)
VMKernelAddressSpace::Range*
Range* range = fRangeTree.FindClosest(start, true);
if (range->type == Range::RANGE_FREE) {
Range* range = it.Next();) {
Range* range = fRangeTree.FindClosest(start, true);
if (range->type == Range::RANGE_RESERVED) {
Range* range = fRangeTree.FindClosest(start, true);
if (range == NULL || range->type == Range::RANGE_AREA
if (range->type != Range::RANGE_FREE && !allowReservedRange)
VMKernelAddressSpace::_FreeRange(Range* range, uint32 allocationFlags)
Range* previousRange = fRangeList.GetPrevious(range);
Range* nextRange = fRangeList.GetNext(range);
if (previousRange != NULL && previousRange->type == Range::RANGE_FREE) {
if (nextRange != NULL && nextRange->type == Range::RANGE_FREE) {
if (nextRange != NULL && nextRange->type == Range::RANGE_FREE) {
range->type = Range::RANGE_FREE;
Range* previousRange = NULL;
int previousRangeType = Range::RANGE_AREA;
Range* range = listIt.Next();
Range* treeRange = treeIt.Next();
if (range->type == Range::RANGE_FREE) {
if (previousRangeType == Range::RANGE_FREE) {
Range* range = it.Next();) {
if (range->type != Range::RANGE_FREE) {
sizeof(Range), 0);
DoublyLinkedListMemberGetLink<Range, &Range::listLink> >
inline void _FreeListInsertRange(Range* range, size_t size);
inline void _FreeListRemoveRange(Range* range, size_t size);
void _InsertRange(Range* range);
void _RemoveRange(Range* range);
uint32 allocationFlags, Range*& _range);
Range* _FindFreeRange(addr_t start, size_t size,
void _FreeRange(Range* range,
VMKernelAddressRange* Range() const