/usr/include/mongo/db/clientcursor.h is in mongodb-dev 1:2.4.9-1ubuntu2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 | /* clientcursor.h */
/**
* Copyright (C) 2008 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/>.
*/
/* Cursor -- and its derived classes -- are our internal cursors.
ClientCursor is a wrapper that represents a cursorid from our database
application's perspective.
*/
#pragma once
#include "mongo/pch.h"
#include <boost/thread/recursive_mutex.hpp>
#include "cursor.h"
#include "jsobj.h"
#include "../util/net/message.h"
#include "../util/background.h"
#include "cc_by_loc.h"
#include "diskloc.h"
#include "dbhelpers.h"
#include "matcher.h"
#include "projection.h"
#include "s/d_chunk_manager.h"
#include "mongo/db/keypattern.h"
#include "mongo/util/elapsed_tracker.h"
namespace mongo {
typedef boost::recursive_mutex::scoped_lock recursive_scoped_lock;
class Cursor; /* internal server cursor base class */
class ClientCursor;
class ParsedQuery;
/* todo: make this map be per connection. this will prevent cursor hijacking security attacks perhaps.
* ERH: 9/2010 this may not work since some drivers send getMore over a different connection
*/
typedef map<CursorId, ClientCursor*> CCById;
extern BSONObj id_obj;
class ClientCursor : private boost::noncopyable {
friend class CmdCursorInfo;
public:
static void assertNoCursors();
/* use this to assure we don't in the background time out cursor while it is under use.
if you are using noTimeout() already, there is no risk anyway.
Further, this mechanism guards against two getMore requests on the same cursor executing
at the same time - which might be bad. That should never happen, but if a client driver
had a bug, it could (or perhaps some sort of attack situation).
*/
class Pin : boost::noncopyable {
public:
Pin( long long cursorid ) :
_cursorid( INVALID_CURSOR_ID ) {
recursive_scoped_lock lock( ccmutex );
ClientCursor *cursor = ClientCursor::find_inlock( cursorid, true );
if ( cursor ) {
uassert( 12051, "clientcursor already in use? driver problem?",
cursor->_pinValue < 100 );
cursor->_pinValue += 100;
_cursorid = cursorid;
}
}
void release() {
if ( _cursorid == INVALID_CURSOR_ID ) {
return;
}
ClientCursor *cursor = c();
_cursorid = INVALID_CURSOR_ID;
if ( cursor ) {
verify( cursor->_pinValue >= 100 );
cursor->_pinValue -= 100;
}
}
~Pin() { DESTRUCTOR_GUARD( release(); ) }
ClientCursor *c() const { return ClientCursor::find( _cursorid ); }
private:
CursorId _cursorid;
};
/** Assures safe and reliable cleanup of a ClientCursor. */
class Holder : boost::noncopyable {
public:
Holder( ClientCursor *c = 0 ) :
_c( 0 ),
_id( INVALID_CURSOR_ID ) {
reset( c );
}
void reset( ClientCursor *c = 0 ) {
if ( c == _c )
return;
if ( _c ) {
// be careful in case cursor was deleted by someone else
ClientCursor::erase( _id );
}
if ( c ) {
_c = c;
_id = c->_cursorid;
}
else {
_c = 0;
_id = INVALID_CURSOR_ID;
}
}
~Holder() {
DESTRUCTOR_GUARD ( reset(); );
}
ClientCursor* get() { return _c; }
operator bool() { return _c; }
ClientCursor * operator-> () { return _c; }
const ClientCursor * operator-> () const { return _c; }
/** Release ownership of the ClientCursor. */
void release() {
_c = 0;
_id = INVALID_CURSOR_ID;
}
private:
ClientCursor *_c;
CursorId _id;
};
/**
* Iterates through all ClientCursors, under its own ccmutex lock.
* Also supports deletion on the fly.
*/
class LockedIterator : boost::noncopyable {
public:
LockedIterator() : _lock( ccmutex ), _i( clientCursorsById.begin() ) {}
bool ok() const { return _i != clientCursorsById.end(); }
ClientCursor *current() const { return _i->second; }
void advance() { ++_i; }
/**
* Delete 'current' and advance. Properly handles cascading deletions that may occur
* when one ClientCursor is directly deleted.
*/
void deleteAndAdvance();
private:
recursive_scoped_lock _lock;
CCById::const_iterator _i;
};
ClientCursor(int queryOptions, const shared_ptr<Cursor>& c, const string& ns, BSONObj query = BSONObj() );
~ClientCursor();
// *************** basic accessors *******************
CursorId cursorid() const { return _cursorid; }
string ns() const { return _ns; }
Database * db() const { return _db; }
const BSONObj& query() const { return _query; }
int queryOptions() const { return _queryOptions; }
DiskLoc lastLoc() const { return _lastLoc; }
/* Get rid of cursors for namespaces 'ns'. When dropping a db, ns is "dbname."
Used by drop, dropIndexes, dropDatabase.
*/
static void invalidate(const char *ns);
/**
* @param microsToSleep -1 : ask client
* 0 : pthread_yield or equivilant
* >0 : sleep for that amount
* @param recordToLoad after yielding lock, load this record with only mmutex
* do a dbtemprelease
* note: caller should check matcher.docMatcher().atomic() first and not yield if atomic -
* we don't do herein as this->matcher (above) is only initialized for true queries/getmore.
* (ie not set for remote/update)
* @return if the cursor is still valid.
* if false is returned, then this ClientCursor should be considered deleted -
* in fact, the whole database could be gone.
*/
bool yield( int microsToSleep = -1, Record * recordToLoad = 0 );
enum RecordNeeds {
DontNeed = -1 , MaybeCovered = 0 , WillNeed = 100
};
/**
* @param needRecord whether or not the next record has to be read from disk for sure
* if this is true, will yield of next record isn't in memory
* @param yielded true if a yield occurred, and potentially if a yield did not occur
* @return same as yield()
*/
bool yieldSometimes( RecordNeeds need, bool *yielded = 0 );
static int suggestYieldMicros();
static void staticYield( int micros , const StringData& ns , Record * rec );
struct YieldData { CursorId _id; bool _doingDeletes; };
bool prepareToYield( YieldData &data );
static bool recoverFromYield( const YieldData &data );
struct YieldLock : boost::noncopyable {
explicit YieldLock( ptr<ClientCursor> cc );
~YieldLock();
/**
* @return if the cursor is still ok
* if it is, we also relock
*/
bool stillOk();
void relock();
private:
const bool _canYield;
YieldData _data;
scoped_ptr<dbtempreleasecond> _unlock;
};
// --- some pass through helpers for Cursor ---
Cursor* c() const { return _c.get(); }
int pos() const { return _pos; }
void incPos( int n ) { _pos += n; } // TODO: this is bad
void setPos( int n ) { _pos = n; } // TODO : this is bad too
BSONObj indexKeyPattern() { return _c->indexKeyPattern(); }
bool modifiedKeys() const { return _c->modifiedKeys(); }
bool isMultiKey() const { return _c->isMultiKey(); }
bool ok() { return _c->ok(); }
bool advance() { return _c->advance(); }
BSONObj current() { return _c->current(); }
DiskLoc currLoc() { return _c->currLoc(); }
BSONObj currKey() const { return _c->currKey(); }
/**
* same as BSONObj::getFieldsDotted
* if it can be retrieved from key, it is
* @param holder keeps the currKey in scope by keeping a reference to it here. generally you'll want
* holder and ret to destruct about the same time.
* @return if this was retrieved from key
*/
bool getFieldsDotted( const string& name, BSONElementSet &ret, BSONObj& holder );
/**
* same as BSONObj::getFieldDotted
* if it can be retrieved from key, it is
* @return if this was retrieved from key
*/
BSONElement getFieldDotted( const string& name , BSONObj& holder , bool * fromKey = 0 ) ;
/** extract items from object which match a pattern object.
* e.g., if pattern is { x : 1, y : 1 }, builds an object with
* x and y elements of this object, if they are present.
* returns elements with original field names
* NOTE: copied from BSONObj::extractFields
*/
BSONObj extractFields(const BSONObj &pattern , bool fillWithNull = false) ;
/** Extract elements from the object this cursor currently points to, using the expression
* specified in KeyPattern. Will use a covered index if the one in this cursor is usable.
* TODO: there are some cases where a covered index could be used but is not, for instance
* if both this index and the keyPattern are {a : "hashed"}
*/
BSONObj extractKey( const KeyPattern& usingKeyPattern ) const;
void fillQueryResultFromObj( BufBuilder &b, const MatchDetails* details = NULL ) const;
bool currentIsDup() { return _c->getsetdup( _c->currLoc() ); }
bool currentMatches() {
if ( ! _c->matcher() )
return true;
return _c->matcher()->matchesCurrent( _c.get() );
}
void setChunkManager( ShardChunkManagerPtr manager ){ _chunkManager = manager; }
ShardChunkManagerPtr getChunkManager(){ return _chunkManager; }
private:
void setLastLoc_inlock(DiskLoc);
static ClientCursor* find_inlock(CursorId id, bool warn = true) {
CCById::iterator it = clientCursorsById.find(id);
if ( it == clientCursorsById.end() ) {
if ( warn ) {
OCCASIONALLY out() << "ClientCursor::find(): cursor not found in map '" << id
<< "' (ok after a drop)" << endl;
}
return 0;
}
return it->second;
}
/* call when cursor's location changes so that we can update the
cursorsbylocation map. if you are locked and internally iterating, only
need to call when you are ready to "unlock".
*/
void updateLocation();
public:
static ClientCursor* find(CursorId id, bool warn = true) {
recursive_scoped_lock lock(ccmutex);
ClientCursor *c = find_inlock(id, warn);
// if this asserts, your code was not thread safe - you either need to set no timeout
// for the cursor or keep a ClientCursor::Pointer in scope for it.
massert( 12521, "internal error: use of an unlocked ClientCursor", c == 0 || c->_pinValue );
return c;
}
/**
* Deletes the cursor with the provided @param 'id' if one exists.
* @throw if the cursor with the provided id is pinned.
* This does not do any auth checking and should be used only when erasing cursors as part
* of cleaning up internal operations.
*/
static bool erase(CursorId id);
// Same as erase but checks to make sure this thread has read permission on the cursor's
// namespace. This should be called when receiving killCursors from a client. This should
// not be called when ccmutex is held.
static bool eraseIfAuthorized(CursorId id);
/**
* @return number of cursors found
*/
static int erase(int n, long long* ids);
static int eraseIfAuthorized(int n, long long* ids);
void mayUpgradeStorage() {
/* if ( !ids_.get() )
return;
stringstream ss;
ss << ns << "." << cursorid;
ids_->mayUpgradeStorage( ss.str() );*/
}
/**
* @param millis amount of idle passed time since last call
*/
bool shouldTimeout( unsigned millis );
void storeOpForSlave( DiskLoc last );
void updateSlaveLocation( CurOp& curop );
unsigned idleTime() const { return _idleAgeMillis; }
void setDoingDeletes( bool doingDeletes ) {_doingDeletes = doingDeletes; }
void slaveReadTill( const OpTime& t ) { _slaveReadTill = t; }
/** Just for testing. */
OpTime getSlaveReadTill() const { return _slaveReadTill; }
public: // static methods
static void idleTimeReport(unsigned millis);
static void appendStats( BSONObjBuilder& result );
static unsigned numCursors() { return clientCursorsById.size(); }
static void informAboutToDeleteBucket(const DiskLoc& b);
static void aboutToDelete(const NamespaceDetails* nsd, const DiskLoc& dl);
static void find( const string& ns , set<CursorId>& all );
private: // methods
// cursors normally timeout after an inactivity period to prevent excess memory use
// setting this prevents timeout of the cursor in question.
void noTimeout() { _pinValue++; }
CCByLoc& byLoc() { return _db->ccByLoc; }
Record* _recordForYield( RecordNeeds need );
static bool _erase_inlock(ClientCursor* cursor);
private:
CursorId _cursorid;
const string _ns;
Database * _db;
const shared_ptr<Cursor> _c;
map<string,int> _indexedFields; // map from indexed field to offset in key object
int _pos; // # objects into the cursor so far
const BSONObj _query; // used for logging diags only; optional in constructor
int _queryOptions; // see enum QueryOptions dbclient.h
OpTime _slaveReadTill;
DiskLoc _lastLoc; // use getter and setter not this (important)
unsigned _idleAgeMillis; // how long has the cursor been around, relative to server idle time
/* 0 = normal
1 = no timeout allowed
100 = in use (pinned) -- see Pointer class
*/
unsigned _pinValue;
bool _doingDeletes; // when true we are the delete and aboutToDelete shouldn't manipulate us
ElapsedTracker _yieldSometimesTracker;
ShardChunkManagerPtr _chunkManager;
public:
shared_ptr<ParsedQuery> pq;
shared_ptr<Projection> fields; // which fields query wants returned
private: // static members
static CCById clientCursorsById;
static long long numberTimedOut;
static boost::recursive_mutex& ccmutex; // must use this for all statics above!
static CursorId allocCursorId_inlock();
};
class ClientCursorMonitor : public BackgroundJob {
public:
string name() const { return "ClientCursorMonitor"; }
void run();
};
} // namespace mongo
// ClientCursor should only be used with auto_ptr because it needs to be
// release()ed after a yield if stillOk() returns false and these pointer types
// do not support releasing. This will prevent them from being used accidentally
// Instead of auto_ptr<>, which still requires some degree of manual management
// of this, consider using ClientCursor::Holder which handles ClientCursor's
// unusual self-deletion mechanics.
namespace boost{
template<> class scoped_ptr<mongo::ClientCursor> {};
template<> class shared_ptr<mongo::ClientCursor> {};
}
|