// strategy_sharded.cpp #include "stdafx.h" #include "request.h" #include "shard.h" #include "cursors.h" #include "../client/connpool.h" #include "../db/commands.h" namespace mongo { class ShardStrategy : public Strategy { virtual void queryOp( Request& r ){ QueryMessage q( r.d() ); log(3) << "shard query: " << q.ns << " " << q.query << endl; if ( q.ntoreturn == 1 && strstr(q.ns, ".$cmd") ) throw UserException( "something is wrong, shouldn't see a command here" ); ShardManager * info = r.getShardManager(); assert( info ); Query query( q.query ); vector shards; info->getShardsForQuery( shards , query.getFilter() ); set servers; map serverCounts; for ( vector::iterator i = shards.begin(); i != shards.end(); i++ ){ servers.insert( (*i)->getServer() ); int& num = serverCounts[(*i)->getServer()]; num++; } ShardedCursor * cursor = 0; BSONObj sort = query.getSort(); if ( sort.isEmpty() ){ // 1. no sort, can just hit them in serial cursor = new SerialServerShardedCursor( servers , q ); } else { int shardKeyOrder = info->getShardKey().canOrder( sort ); if ( shardKeyOrder ){ // 2. sort on shard key, can do in serial intelligently set buckets; for ( vector::iterator i = shards.begin(); i != shards.end(); i++ ){ Shard * s = *i; BSONObj extra = BSONObj(); if ( serverCounts[s->getServer()] > 1 ){ BSONObjBuilder b; s->getFilter( b ); extra = b.obj(); } buckets.insert( ServerAndQuery( s->getServer() , extra , s->getMin() ) ); } cursor = new SerialServerShardedCursor( buckets , q , shardKeyOrder ); } else { // 3. sort on non-sharded key, pull back a portion from each server and iterate slowly cursor = new ParallelSortShardedCursor( servers , q , sort ); } } assert( cursor ); if ( ! cursor->sendNextBatch( r ) ){ delete( cursor ); return; } log(6) << "storing cursor : " << cursor->getId() << endl; cursorCache.store( cursor ); } virtual void getMore( Request& r ){ int ntoreturn = r.d().pullInt(); long long id = r.d().pullInt64(); log(6) << "want cursor : " << id << endl; ShardedCursor * cursor = cursorCache.get( id ); if ( ! cursor ){ log(6) << "\t invalid cursor :(" << endl; replyToQuery( QueryResult::ResultFlag_CursorNotFound , r.p() , r.m() , 0 , 0 , 0 ); return; } if ( cursor->sendNextBatch( r , ntoreturn ) ){ log(6) << "\t cursor finished: " << id << endl; return; } delete( cursor ); cursorCache.remove( id ); } void _insert( Request& r , DbMessage& d, ShardManager* manager ){ while ( d.moreJSObjs() ){ BSONObj o = d.nextJsObj(); if ( ! manager->hasShardKey( o ) ){ log() << "tried to insert object without shard key: " << r.getns() << " " << o << endl; throw UserException( "tried to insert object without shard key" ); } Shard& s = manager->findShard( o ); log(4) << " server:" << s.getServer() << " " << o << endl; insert( s.getServer() , r.getns() , o ); s.splitIfShould( o.objsize() ); } } void _update( Request& r , DbMessage& d, ShardManager* manager ){ int flags = d.pullInt(); BSONObj query = d.nextJsObj(); uassert( "invalid update" , d.moreJSObjs() ); BSONObj toupdate = d.nextJsObj(); bool upsert = flags & 1; if ( upsert && ! manager->hasShardKey( toupdate ) ) throw UserException( "can't upsert something without shard key" ); bool save = false; if ( ! manager->hasShardKey( query ) ){ if ( query.nFields() != 1 || strcmp( query.firstElement().fieldName() , "_id" ) ) throw UserException( "can't do update with query that doesn't have the shard key" ); save = true; } if ( ! save && manager->hasShardKey( toupdate ) && manager->getShardKey().compare( query , toupdate ) ){ throw UserException( "change would move shards!" ); } Shard& s = manager->findShard( toupdate ); doWrite( dbUpdate , r , s.getServer() ); s.splitIfShould( d.msg().data->dataLen() ); } void _delete( Request& r , DbMessage& d, ShardManager* manager ){ int flags = d.pullInt(); bool justOne = flags & 1; uassert( "bad delete message" , d.moreJSObjs() ); BSONObj pattern = d.nextJsObj(); if ( manager->hasShardKey( pattern ) ){ Shard& s = manager->findShard( pattern ); doWrite( dbDelete , r , s.getServer() ); return; } if ( ! justOne && ! pattern.hasField( "_id" ) ) throw UserException( "can only delete with a non-shard key pattern if can delete as many as we find" ); vector shards; manager->getShardsForQuery( shards , pattern ); set seen; for ( vector::iterator i=shards.begin(); i!=shards.end(); i++){ Shard * s = *i; if ( seen.count( s->getServer() ) ) continue; seen.insert( s->getServer() ); doWrite( dbDelete , r , s->getServer() ); } } virtual void writeOp( int op , Request& r ){ const char *ns = r.getns(); log(3) << "write: " << ns << endl; DbMessage& d = r.d(); ShardManager * info = r.getShardManager(); assert( info ); if ( op == dbInsert ){ _insert( r , d , info ); } else if ( op == dbUpdate ){ _update( r , d , info ); } else if ( op == dbDelete ){ _delete( r , d , info ); } else { log() << "sharding can't do write op: " << op << endl; throw UserException( "can't do this write op on sharded collection" ); } } }; Strategy * SHARDED = new ShardStrategy(); }