2013-09-24 01:35:40 +00:00
|
|
|
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
|
|
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
|
|
// found in the LICENSE file.
|
|
|
|
|
2014-04-08 00:39:14 +00:00
|
|
|
#ifndef MEDIA_BASE_OFFSET_BYTE_QUEUE_H_
|
|
|
|
#define MEDIA_BASE_OFFSET_BYTE_QUEUE_H_
|
2013-09-24 01:35:40 +00:00
|
|
|
|
|
|
|
#include "base/basictypes.h"
|
|
|
|
#include "media/base/byte_queue.h"
|
|
|
|
|
2014-09-19 20:41:13 +00:00
|
|
|
namespace edash_packager {
|
2013-09-24 01:35:40 +00:00
|
|
|
namespace media {
|
|
|
|
|
2014-01-23 22:34:39 +00:00
|
|
|
/// Wrapper around ByteQueue, which encapsulates the notion of a
|
|
|
|
/// monotonically-increasing byte offset. All buffer access is done by passing
|
|
|
|
/// these offsets into this class, reducing the proliferation of many different
|
|
|
|
/// meanings of "offset", "head", etc.
|
2013-09-24 04:17:12 +00:00
|
|
|
class OffsetByteQueue {
|
2013-09-24 01:35:40 +00:00
|
|
|
public:
|
|
|
|
OffsetByteQueue();
|
|
|
|
~OffsetByteQueue();
|
|
|
|
|
2014-01-23 22:34:39 +00:00
|
|
|
/// @name These work like their underlying ByteQueue counterparts.
|
|
|
|
/// @{
|
2013-09-24 01:35:40 +00:00
|
|
|
void Reset();
|
|
|
|
void Push(const uint8* buf, int size);
|
|
|
|
void Peek(const uint8** buf, int* size);
|
|
|
|
void Pop(int count);
|
2014-01-23 22:34:39 +00:00
|
|
|
/// @}
|
2013-09-24 01:35:40 +00:00
|
|
|
|
2014-01-23 22:34:39 +00:00
|
|
|
/// Set @a buf to point at the first buffered byte corresponding to @a offset,
|
|
|
|
/// and @a size to the number of bytes available starting from that offset.
|
|
|
|
///
|
|
|
|
/// It is an error if the offset is before the current head. It's not an error
|
|
|
|
/// if the current offset is beyond tail(), but you will of course get back
|
|
|
|
/// a null @a buf and a @a size of zero.
|
2013-09-24 01:35:40 +00:00
|
|
|
void PeekAt(int64 offset, const uint8** buf, int* size);
|
|
|
|
|
2014-01-23 22:34:39 +00:00
|
|
|
/// Mark the bytes up to (but not including) @a max_offset as ready for
|
|
|
|
/// deletion. This is relatively inexpensive, but will not necessarily reduce
|
|
|
|
/// the resident buffer size right away (or ever).
|
|
|
|
///
|
|
|
|
/// @return true if the full range of bytes were successfully trimmed,
|
|
|
|
/// including the case where @a max_offset is less than the current
|
|
|
|
/// head.
|
|
|
|
/// @return false if @a max_offset > tail() (although all bytes currently
|
|
|
|
/// buffered are still cleared).
|
2013-09-24 01:35:40 +00:00
|
|
|
bool Trim(int64 max_offset);
|
|
|
|
|
2014-01-23 22:34:39 +00:00
|
|
|
/// @return The head position, in terms of the file's absolute offset.
|
2013-09-24 01:35:40 +00:00
|
|
|
int64 head() { return head_; }
|
2014-01-23 22:34:39 +00:00
|
|
|
/// @return The tail position (exclusive), in terms of the file's absolute
|
|
|
|
/// offset.
|
2013-09-24 01:35:40 +00:00
|
|
|
int64 tail() { return head_ + size_; }
|
|
|
|
|
|
|
|
private:
|
|
|
|
// Synchronize |buf_| and |size_| with |queue_|.
|
|
|
|
void Sync();
|
|
|
|
|
|
|
|
ByteQueue queue_;
|
|
|
|
const uint8* buf_;
|
|
|
|
int size_;
|
|
|
|
int64 head_;
|
|
|
|
|
|
|
|
DISALLOW_COPY_AND_ASSIGN(OffsetByteQueue);
|
|
|
|
};
|
|
|
|
|
|
|
|
} // namespace media
|
2014-09-19 20:41:13 +00:00
|
|
|
} // namespace edash_packager
|
2013-09-24 01:35:40 +00:00
|
|
|
|
2014-04-08 00:39:14 +00:00
|
|
|
#endif // MEDIA_BASE_OFFSET_BYTE_QUEUE_H_
|