0
0
mirror of https://github.com/mongodb/mongo.git synced 2024-12-01 01:21:03 +01:00
mongodb/db/query.cpp
2007-11-13 16:44:01 -05:00

283 lines
6.9 KiB
C++

// query.cpp
#include "stdafx.h"
#include "query.h"
#include "pdfile.h"
#include "jsobj.h"
#include "../util/builder.h"
#include <time.h>
#include "introspect.h"
#include "btree.h"
int nextCursorId = 1;
/* todo: _ cache query plans
_ use index on partial match with the query
*/
auto_ptr<Cursor> getIndexCursor(const char *ns, JSObj& query, JSObj& order) {
NamespaceDetails *d = namespaceIndex.details(ns);
if( d == 0 ) return auto_ptr<Cursor>();
set<string> queryFields;
query.getFieldNames(queryFields);
if( !order.isEmpty() ) {
set<string> orderFields;
order.getFieldNames(orderFields);
// order by
for(int i = 0; i < d->nIndexes; i++ ) {
JSObj idxInfo = d->indexes[i].info.obj();
assert( strcmp(ns, idxInfo.getStringField("ns")) == 0 );
JSObj idxKey = idxInfo.getObjectField("key");
set<string> keyFields;
idxKey.getFieldNames(keyFields);
if( keyFields == orderFields ) {
bool reverse =
order.firstElement().type() == Number &&
order.firstElement().number() < 0;
JSObjBuilder b;
return auto_ptr<Cursor>(new BtreeCursor(d->indexes[i].head, reverse ? maxKey : JSObj(), reverse ? -1 : 1, false));
}
}
}
// where/query
for(int i = 0; i < d->nIndexes; i++ ) {
JSObj idxInfo = d->indexes[i].info.obj();
JSObj idxKey = idxInfo.getObjectField("key");
set<string> keyFields;
idxKey.getFieldNames(keyFields);
if( keyFields == queryFields ) {
JSObjBuilder b;
return auto_ptr<Cursor>(
new BtreeCursor(d->indexes[i].head, query.extractFields(idxKey, b), 1, true));
}
}
return auto_ptr<Cursor>();
}
void deleteObjects(const char *ns, JSObj pattern, bool justOne) {
cout << "delete ns:" << ns << " queryobjsize:" <<
pattern.objsize() << endl;
if( strncmp(ns, "system.", 7) == 0 ) {
cout << "ERROR: attempt to delete in system namespace " << ns << endl;
return;
}
JSMatcher matcher(pattern);
JSObj order;
auto_ptr<Cursor> c = getIndexCursor(ns, pattern, order);
if( c.get() == 0 )
c = theDataFileMgr.findAll(ns);
while( c->ok() ) {
Record *r = c->_current();
DiskLoc rloc = c->currLoc();
c->advance(); // must advance before deleting as the next ptr will die
JSObj js(r);
if( !matcher.matches(js) ) {
if( c->tempStopOnMiss() )
break;
}
else {
cout << " found match to delete" << endl;
if( !justOne )
c->noteLocation();
theDataFileMgr.deleteRecord(ns, r, rloc);
if( justOne )
return;
c->checkLocation();
}
}
}
void updateObjects(const char *ns, JSObj updateobj, JSObj pattern, bool upsert) {
cout << "update ns:" << ns << " objsize:" << updateobj.objsize() << " queryobjsize:" <<
pattern.objsize();
if( strncmp(ns, "system.", 7) == 0 ) {
cout << "\nERROR: attempt to update in system namespace " << ns << endl;
return;
}
{
JSMatcher matcher(pattern);
JSObj order;
auto_ptr<Cursor> c = getIndexCursor(ns, pattern, order);
if( c.get() == 0 )
c = theDataFileMgr.findAll(ns);
while( c->ok() ) {
Record *r = c->_current();
JSObj js(r);
if( !matcher.matches(js) ) {
if( c->tempStopOnMiss() )
break;
}
else {
cout << " found match to update" << endl;
theDataFileMgr.update(ns, r, c->currLoc(), updateobj.objdata(), updateobj.objsize());
return;
}
c->advance();
}
}
cout << " no match ";
if( upsert )
cout << "- upsert.";
cout << endl;
if( upsert )
theDataFileMgr.insert(ns, (void*) updateobj.objdata(), updateobj.objsize());
}
QueryResult* runQuery(const char *ns, int ntoreturn, JSObj jsobj, auto_ptr< set<string> > filter) {
cout << "runQuery ns:" << ns << " ntoreturn:" << ntoreturn << " queryobjsize:" <<
jsobj.objsize();
BufBuilder b;
JSObj query = jsobj.getObjectField("query");
JSObj order = jsobj.getObjectField("orderby");
if( query.isEmpty() && order.isEmpty() )
query = jsobj;
auto_ptr<JSMatcher> matcher(new JSMatcher(query));
QueryResult *qr = 0;
b.skip(sizeof(QueryResult));
int n = 0;
auto_ptr<Cursor> c = getSpecialCursor(ns);
if( c.get() == 0 )
c = getIndexCursor(ns, query, order);
if( c.get() == 0 )
c = theDataFileMgr.findAll(ns);
long long cursorid = 0;
while( c->ok() ) {
JSObj js = c->current();
if( !matcher->matches(js) ) {
if( c->tempStopOnMiss() )
break;
}
else {
bool ok = true;
if( filter.get() ) {
JSObj x;
ok = x.addFields(js, *filter) > 0;
if( ok )
b.append((void*) x.objdata(), x.objsize());
}
else {
b.append((void*) js.objdata(), js.objsize());
}
if( ok ) {
n++;
if( (ntoreturn>0 && (n >= ntoreturn || b.len() > 16*1024*1024)) ||
(ntoreturn==0 && b.len()>1*1024*1024) ) {
// more...so save a cursor
ClientCursor *cc = new ClientCursor();
cc->c = c;
cursorid = allocCursorId();
cc->cursorid = cursorid;
cc->matcher = matcher;
cc->ns = ns;
cc->pos = n;
ClientCursor::add(cc);
cc->updateLocation();
cc->filter = filter;
break;
}
}
}
c->advance();
}
qr = (QueryResult *) b.buf();
qr->len = b.len();
qr->reserved = 0;
qr->operation = opReply;
qr->cursorId = cursorid;
qr->startingFrom = 0;
qr->nReturned = n;
b.decouple();
cout << " nReturned:" << n << endl;
return qr;
}
QueryResult* getMore(const char *ns, int ntoreturn, long long cursorid) {
cout << "getMore ns:" << ns << " ntoreturn:" << ntoreturn << " cursorid:" <<
cursorid << endl;
BufBuilder b;
ClientCursor *cc = 0;
CCMap::iterator it = clientCursors.find(cursorid);
if( it == clientCursors.end() ) {
cout << "Cursor not found in map. cursorid: " << cursorid << endl;
}
else {
cc = it->second;
}
b.skip(sizeof(QueryResult));
int start = 0;
int n = 0;
if( cc ) {
start = cc->pos;
Cursor *c = cc->c.get();
while( 1 ) {
if( !c->ok() ) {
done:
// done! kill cursor.
cursorid = 0;
clientCursors.erase(it);
delete cc;
cc = 0;
break;
}
JSObj js = c->current();
if( !cc->matcher->matches(js) ) {
if( c->tempStopOnMiss() )
goto done;
}
else {
bool ok = true;
if( cc->filter.get() ) {
JSObj x;
ok = x.addFields(js, *cc->filter) > 0;
if( ok )
b.append((void*) x.objdata(), x.objsize());
}
else {
b.append((void*) js.objdata(), js.objsize());
}
if( ok ) {
n++;
if( (ntoreturn>0 && (n >= ntoreturn || b.len() > 16*1024*1024)) ||
(ntoreturn==0 && b.len()>1*1024*1024) ) {
cc->pos += n;
cc->updateLocation();
break;
}
}
}
}
c->advance();
}
QueryResult *qr = (QueryResult *) b.buf();
qr->cursorId = cursorid;
qr->startingFrom = start;
qr->len = b.len();
qr->reserved = 0;
qr->operation = opReply;
qr->nReturned = n;
b.decouple();
return qr;
}