summaryrefslogtreecommitdiff
path: root/src/mongo/db/exec/working_set.cpp
blob: 7a4b96e54d401e4e738373d4dba1d20507ba308e (plain)
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
/**
 *    Copyright (C) 2013 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/>.
 */

#include "mongo/db/exec/working_set.h"

#include "mongo/db/index/index_descriptor.h"

namespace mongo {

    const WorkingSetID WorkingSet::INVALID_ID = -1;

    WorkingSet::WorkingSet() : _nextId(0) { }

    WorkingSet::~WorkingSet() {
        for (DataMap::const_iterator i = _data.begin(); i != _data.end(); ++i) {
            delete i->second;
        }
    }

    WorkingSetID WorkingSet::allocate() {
        verify(_data.end() == _data.find(_nextId));
        _data[_nextId] = new WorkingSetMember();
        return _nextId++;
    }

    WorkingSetMember* WorkingSet::get(const WorkingSetID& i) {
        DataMap::iterator it = _data.find(i);
        verify(_data.end() != it);
        return it->second;
    }

    void WorkingSet::free(const WorkingSetID& i) {
        DataMap::iterator it = _data.find(i);
        verify(_data.end() != it);
        delete it->second;
        _data.erase(it);
    }

    WorkingSetMember::WorkingSetMember() : state(WorkingSetMember::INVALID) { }

    bool WorkingSetMember::hasLoc() const {
        return state == LOC_AND_IDX || state == LOC_AND_UNOWNED_OBJ
               || state == LOC_AND_OWNED_OBJ;
    }

    bool WorkingSetMember::hasObj() const {
        return hasOwnedObj() || hasUnownedObj();
    }

    bool WorkingSetMember::hasOwnedObj() const {
        return state == OWNED_OBJ || state == LOC_AND_OWNED_OBJ;
    }

    bool WorkingSetMember::hasUnownedObj() const {
        return state == LOC_AND_UNOWNED_OBJ;
    }

    bool WorkingSetMember::getFieldDotted(const string& field, BSONElement* out) {
        // If our state is such that we have an object, use it.
        if (hasObj()) {
            *out = obj.getFieldDotted(field);
            return true;
        }

        // Our state should be such that we have index data/are covered.
        for (size_t i = 0; i < keyData.size(); ++i) {
            BSONObjIterator keyPatternIt(keyData[i].indexKeyPattern);
            BSONObjIterator keyDataIt(keyData[i].keyData);

            while (keyPatternIt.more()) {
                BSONElement keyPatternElt = keyPatternIt.next();
                verify(keyDataIt.more());
                BSONElement keyDataElt = keyDataIt.next();

                if (field == keyPatternElt.fieldName()) {
                    *out = keyDataElt;
                    return true;
                }
            }
        }

        return false;
    }

}  // namespace mongo