0
0
mirror of https://github.com/mongodb/mongo.git synced 2024-11-30 09:06:21 +01:00
mongodb/db/pdfile.h
2007-11-04 20:47:12 -05:00

288 lines
7.2 KiB
C++

// pdfile.h
#pragma once
#include "../stdafx.h"
#include "../util/mmap.h"
#include "storage.h"
#include "jsobj.h"
class PDFHeader;
class Extent;
class Record;
class Cursor;
/*---------------------------------------------------------------------*/
class Namespace {
public:
Namespace(const char *ns) {
*this = ns;
}
Namespace& operator=(const char *ns) {
memset(buf, 0, 128); /* this is just to keep stuff clean in the files for easy dumping and reading */
strcpy_s(buf, 128, ns); return *this;
}
bool operator==(const Namespace& r) { return strcmp(buf, r.buf) == 0; }
int hash() const {
unsigned x = 0;
const char *p = buf;
while( *p ) {
x = x * 131 + *p;
p++;
}
return (x & 0x7fffffff) | 0x8000000; // must be > 0
}
char buf[128];
};
auto_ptr<Cursor> makeNamespaceCursor();
/*---------------------------------------------------------------------*/
class PDFHeader;
class PhysicalDataFile {
friend class DataFileMgr;
friend class BasicCursor;
public:
void open(const char *filename, int length = 64 * 1024 * 1024);
private:
Extent* newExtent(const char *ns);
Extent* getExtent(DiskLoc loc);
Extent* _getExtent(DiskLoc loc);
Record* recordAt(DiskLoc dl);
MemoryMappedFile mmf;
PDFHeader *header;
int length;
};
class DataFileMgr {
friend class BasicCursor;
public:
void init();
void update(
const char *ns,
Record *toupdate, const DiskLoc& dl,
const char *buf, int len);
void insert(const char *ns, const void *buf, int len, bool usethedefault = false);
void deleteRecord(const char *ns, Record *todelete, const DiskLoc& dl);
auto_ptr<Cursor> findAll(const char *ns);
static Extent* getExtent(const DiskLoc& dl);
static Record* getRecord(const DiskLoc& dl);
private:
PhysicalDataFile temp;
};
extern DataFileMgr theDataFileMgr;
#pragma pack(push)
#pragma pack(1)
class DeletedRecord {
public:
int lengthWithHeaders;
int extentOfs;
DiskLoc nextDeleted;
};
class Record {
public:
enum { HeaderSize = 16 };
int lengthWithHeaders;
int extentOfs, nextOfs, prevOfs;
char data[4];
int netLength() { return lengthWithHeaders - HeaderSize; }
//void setNewLength(int netlen) { lengthWithHeaders = netlen + HeaderSize; }
/* use this when a record is deleted. basically a union with next/prev fields */
DeletedRecord& asDeleted() { return *((DeletedRecord*) this); }
Extent* myExtent(const DiskLoc& myLoc) {
return DataFileMgr::getExtent(DiskLoc(myLoc.a(), extentOfs));
}
/* get the next record in the namespace, traversing extents as necessary */
DiskLoc getNext(const DiskLoc& myLoc);
DiskLoc getPrev(const DiskLoc& myLoc);
};
/* extents are regions where all the records within the region
belong to the same namespace.
*/
class Extent {
public:
unsigned magic;
DiskLoc myLoc;
DiskLoc xnext, xprev; /* next/prev extent for this namespace */
Namespace ns; /* which namespace this extent is for. this is just for troubleshooting really */
int length; /* size of the extent, including these fields */
// DiskLoc firstEmptyRegion;
DiskLoc firstRecord, lastRecord;
char extentData[4];
/* assumes already zeroed -- insufficient for block 'reuse' perhaps
Returns a DeletedRecord location which is the data in the extent ready for us.
Caller will need to add that to the freelist structure in namespacedetail.
*/
DiskLoc init(const char *nsname, int _length, int _offset);
void assertOk() { assert(magic == 0x41424344); }
Record* newRecord(int len);
Record* getRecord(DiskLoc dl) {
assert( !dl.isNull() );
assert( dl.sameFile(myLoc) );
int x = dl.getOfs() - myLoc.getOfs();
assert( x > 0 );
return (Record *) (((char *) this) + x);
}
Extent* getNextExtent() { return xnext.isNull() ? 0 : DataFileMgr::getExtent(xnext); }
Extent* getPrevExtent() { return xprev.isNull() ? 0 : DataFileMgr::getExtent(xprev); }
};
/*
----------------------
Header
----------------------
Extent (for a particular namespace)
Record
...
Record (some chained for unused space)
----------------------
more Extents...
----------------------
*/
/* data file header */
class PDFHeader {
public:
int version;
int versionMinor;
int fileLength;
DiskLoc unused; /* unused is the portion of the file that doesn't belong to any allocated extents. -1 = no more */
int unusedLength;
int reserved[8192 - 4*4];
char data[4];
static int headerSize() { return sizeof(PDFHeader) - 4; }
bool uninitialized() { if( version == 0 ) return true; assert(version == 3); return false; }
Record* getRecord(DiskLoc dl) {
int ofs = dl.getOfs();
assert( ofs >= headerSize() );
return (Record*) (((char *) this) + ofs);
}
void init(int filelength) {
if( uninitialized() ) {
assert(filelength > 32768 );
fileLength = filelength;
version = 3;
versionMinor = 0;
unused.setOfs( headerSize() );
assert( (data-(char*)this) == headerSize() );
unusedLength = fileLength - headerSize() - 16;
memcpy(data+unusedLength, " \nthe end\n", 16);
}
}
};
#pragma pack(pop)
inline Extent* PhysicalDataFile::_getExtent(DiskLoc loc) {
loc.assertOk();
Extent *e = (Extent *) (((char *)header) + loc.getOfs());
return e;
}
inline Extent* PhysicalDataFile::getExtent(DiskLoc loc) {
Extent *e = _getExtent(loc);
e->assertOk();
return e;
}
class Cursor {
public:
virtual bool ok() = 0;
bool eof() { return !ok(); }
virtual Record* _current() = 0;
virtual JSObj current() = 0;
virtual DiskLoc currLoc() = 0;
virtual bool advance() = 0;
/* optional to implement. if implemented, means 'this' is a prototype */
virtual Cursor* clone() { return 0; }
};
class BasicCursor : public Cursor {
public:
bool ok() { return !curr.isNull(); }
Record* _current() {
assert( ok() );
return theDataFileMgr.temp.recordAt(curr);
}
JSObj current() {
return JSObj( _current() );
}
virtual DiskLoc currLoc() { return curr; }
bool advance() {
if( eof() )
return false;
Record *r = _current();
curr = r->getNext(curr);
return ok();
}
BasicCursor(DiskLoc dl) : curr(dl) { }
BasicCursor() { }
DiskLoc curr;
};
inline Record* PhysicalDataFile::recordAt(DiskLoc dl) { return header->getRecord(dl); }
inline Extent* DataFileMgr::getExtent(const DiskLoc& dl) {
return theDataFileMgr.temp.getExtent(dl);
}
inline Record* DataFileMgr::getRecord(const DiskLoc& dl) {
return theDataFileMgr.temp.recordAt(dl);
}
inline DiskLoc Record::getNext(const DiskLoc& myLoc) {
if( nextOfs )
return DiskLoc(myLoc.a(), nextOfs);
Extent *e = myLoc.ext();
if( e->xnext.isNull() )
return DiskLoc(); // end of table.
return e->xnext.ext()->firstRecord;
}
inline DiskLoc Record::getPrev(const DiskLoc& myLoc) {
if( prevOfs )
return DiskLoc(myLoc.a(), prevOfs);
Extent *e = myLoc.ext();
if( e->xprev.isNull() )
return DiskLoc();
return e->xprev.ext()->firstRecord;
}
inline Record* DiskLoc::rec() const {
return DataFileMgr::getRecord(*this);
}
inline DeletedRecord* DiskLoc::drec() const {
return (DeletedRecord*) rec();
}
inline Extent* DiskLoc::ext() const {
return DataFileMgr::getExtent(*this);
}