0
0
mirror of https://github.com/mongodb/mongo.git synced 2024-11-30 00:56:44 +01:00
mongodb/util/bufreader.h

99 lines
2.9 KiB
C
Raw Normal View History

2010-11-27 00:18:24 +01:00
// @file bufreader.h parse a memory region into usable pieces
2010-11-23 08:51:36 +01:00
/**
* Copyright (C) 2009 10gen Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License, version 3,
* as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#pragma once
2011-01-04 06:40:41 +01:00
namespace mongo {
2010-11-23 08:51:36 +01:00
2011-01-04 06:40:41 +01:00
/** helper to read and parse a block of memory
2010-11-23 20:13:46 +01:00
methods throw the eof exception if the operation would pass the end of the
2010-11-23 08:51:36 +01:00
buffer with which we are working.
*/
2011-01-04 06:40:41 +01:00
class BufReader : boost::noncopyable {
2010-11-23 08:51:36 +01:00
public:
2011-01-04 06:40:41 +01:00
class eof : public std::exception {
2010-11-23 08:51:36 +01:00
public:
virtual const char * what() { return "BufReader eof"; }
};
BufReader(const void *p, unsigned len) : _start(p), _pos(p), _end(((char *)_pos)+len) { }
2010-11-23 08:51:36 +01:00
2010-11-27 00:18:24 +01:00
bool atEof() const { return _pos == _end; }
2011-01-04 06:40:41 +01:00
2010-11-27 00:18:24 +01:00
/** read in the object specified, and advance buffer pointer */
2010-11-23 08:51:36 +01:00
template <typename T>
2011-01-04 06:40:41 +01:00
void read(T &t) {
2010-11-23 20:13:46 +01:00
T* cur = (T*) _pos;
T *next = cur + 1;
2010-11-23 08:51:36 +01:00
if( _end < next ) throw eof();
2010-11-23 20:13:46 +01:00
t = *cur;
2010-11-23 08:51:36 +01:00
_pos = next;
}
/** verify we can look at t, but do not advance */
template <typename T>
2011-01-04 06:40:41 +01:00
void peek(T &t) {
2010-11-23 20:13:46 +01:00
T* cur = (T*) _pos;
T *next = cur + 1;
2010-11-23 08:51:36 +01:00
if( _end < next ) throw eof();
2010-11-23 20:13:46 +01:00
t = *cur;
2010-11-23 08:51:36 +01:00
}
2010-11-23 20:13:46 +01:00
/** return current offset into buffer */
unsigned offset() const { return (char*)_pos - (char*)_start; }
/** return remaining bytes */
unsigned remaining() const { return (char*)_end -(char*)_pos; }
/** back up by nbytes */
2011-01-04 06:40:41 +01:00
void rewind(unsigned nbytes) {
_pos = ((char *) _pos) - nbytes;
assert( _pos >= _start );
}
2010-11-23 20:13:46 +01:00
/** return current position pointer, and advance by len */
2011-01-04 06:40:41 +01:00
const void* skip(unsigned len) {
const char *nxt = ((char *) _pos) + len;
2010-11-23 20:13:46 +01:00
if( _end < nxt ) throw eof();
const void *p = _pos;
2010-11-23 20:13:46 +01:00
_pos = nxt;
return p;
}
2010-11-27 00:18:24 +01:00
void readStr(string& s) {
StringBuilder b;
2011-01-04 06:40:41 +01:00
while( 1 ) {
2010-11-27 00:18:24 +01:00
char ch;
read(ch);
if( ch == 0 )
break;
b << ch;
}
s = b.str();
}
const void* pos() { return _pos; }
2010-11-23 08:51:36 +01:00
private:
const void *_start;
const void *_pos;
const void *_end;
2010-11-23 08:51:36 +01:00
};
}