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
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
|
/**
* Copyright (c) 2011 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/>.
*/
#pragma once
#include "mongo/pch.h"
#include <boost/unordered_map.hpp>
#include "util/intrusive_counter.h"
#include "db/clientcursor.h"
#include "db/jsobj.h"
#include "db/pipeline/document.h"
#include "db/pipeline/expression.h"
#include "mongo/db/pipeline/expression_context.h"
#include "db/pipeline/value.h"
#include "util/string_writer.h"
#include "mongo/db/projection.h"
#include "mongo/s/shard.h"
namespace mongo {
class Accumulator;
class Cursor;
class Document;
class Expression;
class ExpressionContext;
class ExpressionFieldPath;
class ExpressionObject;
class DocumentSourceLimit;
class Matcher;
class DocumentSource :
public IntrusiveCounterUnsigned,
public StringWriter {
public:
virtual ~DocumentSource();
// virtuals from StringWriter
virtual void writeString(stringstream &ss) const;
/**
Set the step for a user-specified pipeline step.
The step is used for diagnostics.
@param step step number 0 to n.
*/
void setPipelineStep(int step);
/**
Get the user-specified pipeline step.
@returns the step number, or -1 if it has never been set
*/
int getPipelineStep() const;
/**
Is the source at EOF?
@returns true if the source has no more Documents to return.
*/
virtual bool eof() = 0;
/**
Advance the state of the DocumentSource so that it will return the
next Document.
The default implementation returns false, after checking for
interrupts. Derived classes can call the default implementation
in their own implementations in order to check for interrupts.
@returns whether there is another document to fetch, i.e., whether or
not getCurrent() will succeed. This default implementation always
returns false.
*/
virtual bool advance();
/** @returns the current Document without advancing.
*
* It is illegal to call this without first checking eof() == false or advance() == true.
*
* While it is legal to call getCurrent() multiple times between calls to advance, and
* you will get the same Document returned, some DocumentSources do expensive work in
* getCurrent(). You are advised to cache the result if you plan to access it more than
* once.
*/
virtual Document getCurrent() = 0;
/**
* Inform the source that it is no longer needed and may release its resources. After
* dispose() is called the source must still be able to handle iteration requests, but may
* become eof().
* NOTE: For proper mutex yielding, dispose() must be called on any DocumentSource that will
* not be advanced until eof(), see SERVER-6123.
*/
virtual void dispose();
/**
Get the source's name.
@returns the string name of the source as a constant string;
this is static, and there's no need to worry about adopting it
*/
virtual const char *getSourceName() const;
/**
Set the underlying source this source should use to get Documents
from.
It is an error to set the source more than once. This is to
prevent changing sources once the original source has been started;
this could break the state maintained by the DocumentSource.
This pointer is not reference counted because that has led to
some circular references. As a result, this doesn't keep
sources alive, and is only intended to be used temporarily for
the lifetime of a Pipeline::run().
@param pSource the underlying source to use
*/
virtual void setSource(DocumentSource *pSource);
/**
Attempt to coalesce this DocumentSource with its successor in the
document processing pipeline. If successful, the successor
DocumentSource should be removed from the pipeline and discarded.
If successful, this operation can be applied repeatedly, in an
attempt to coalesce several sources together.
The default implementation is to do nothing, and return false.
@param pNextSource the next source in the document processing chain.
@returns whether or not the attempt to coalesce was successful or not;
if the attempt was not successful, nothing has been changed
*/
virtual bool coalesce(const intrusive_ptr<DocumentSource> &pNextSource);
/**
Optimize the pipeline operation, if possible. This is a local
optimization that only looks within this DocumentSource. For best
results, first coalesce compatible sources using coalesce().
This is intended for any operations that include expressions, and
provides a hook for those to optimize those operations.
The default implementation is to do nothing.
*/
virtual void optimize();
enum GetDepsReturn {
NOT_SUPPORTED, // This means the set should be ignored
EXHAUSTIVE, // This means that everything needed should be in the set
SEE_NEXT, // Add the next Source's deps to the set
};
/** Get the fields this operation needs to do its job.
* Deps should be in "a.b.c" notation
*
* @param deps results are added here. NOT CLEARED
*/
virtual GetDepsReturn getDependencies(set<string>& deps) const {
return NOT_SUPPORTED;
}
/** This takes dependencies from getDependencies and
* returns a projection that includes all of them
*/
static BSONObj depsToProjection(const set<string>& deps);
/** These functions take the same input as depsToProjection but are able to
* produce a Document from a BSONObj with the needed fields much faster.
*/
typedef Document ParsedDeps; // See implementation for structure
static ParsedDeps parseDeps(const set<string>& deps);
static Document documentFromBsonWithDeps(const BSONObj& object, const ParsedDeps& deps);
/**
Add the DocumentSource to the array builder.
The default implementation calls sourceToBson() in order to
convert the inner part of the object which will be added to the
array being built here.
A subclass may choose to overwrite this rather than addToBsonArray
if it should output multiple stages.
@param pBuilder the array builder to add the operation to.
@param explain create explain output
*/
virtual void addToBsonArray(BSONArrayBuilder *pBuilder, bool explain=false) const;
protected:
/**
Base constructor.
*/
DocumentSource(const intrusive_ptr<ExpressionContext> &pExpCtx);
/**
Create an object that represents the document source. The object
will have a single field whose name is the source's name. This
will be used by the default implementation of addToBsonArray()
to add this object to a pipeline being represented in BSON.
@param pBuilder a blank object builder to write to
@param explain create explain output
*/
virtual void sourceToBson(BSONObjBuilder *pBuilder,
bool explain) const = 0;
/*
Most DocumentSources have an underlying source they get their data
from. This is a convenience for them.
The default implementation of setSource() sets this; if you don't
need a source, override that to verify(). The default is to
verify() if this has already been set.
*/
DocumentSource *pSource;
/*
The zero-based user-specified pipeline step. Used for diagnostics.
Will be set to -1 for artificial pipeline steps that were not part
of the original user specification.
*/
int step;
intrusive_ptr<ExpressionContext> pExpCtx;
/*
for explain: # of rows returned by this source
This is *not* unsigned so it can be passed to BSONObjBuilder.append().
*/
long long nRowsOut;
};
/** This class marks DocumentSources that should be split between the router and the shards
* See Pipeline::splitForSharded() for details
*/
class SplittableDocumentSource : public DocumentSource {
public:
/** returns a source to be run on the shards.
* if NULL, don't run on shards
*/
virtual intrusive_ptr<DocumentSource> getShardSource() = 0;
/** returns a source that combines results from shards.
* if NULL, don't run on router
*/
virtual intrusive_ptr<DocumentSource> getRouterSource() = 0;
protected:
SplittableDocumentSource(intrusive_ptr<ExpressionContext> ctx) :DocumentSource(ctx) {}
};
class DocumentSourceBsonArray :
public DocumentSource {
public:
// virtuals from DocumentSource
virtual ~DocumentSourceBsonArray();
virtual bool eof();
virtual bool advance();
virtual Document getCurrent();
virtual void setSource(DocumentSource *pSource);
/**
Create a document source based on a BSON array.
This is usually put at the beginning of a chain of document sources
in order to fetch data from the database.
CAUTION: the BSON is not read until the source is used. Any
elements that appear after these documents must not be read until
this source is exhausted.
@param pBsonElement the BSON array to treat as a document source
@param pExpCtx the expression context for the pipeline
@returns the newly created document source
*/
static intrusive_ptr<DocumentSourceBsonArray> create(
BSONElement *pBsonElement,
const intrusive_ptr<ExpressionContext> &pExpCtx);
protected:
// virtuals from DocumentSource
virtual void sourceToBson(BSONObjBuilder *pBuilder, bool explain) const;
private:
DocumentSourceBsonArray(BSONElement *pBsonElement,
const intrusive_ptr<ExpressionContext> &pExpCtx);
BSONObj embeddedObject;
BSONObjIterator arrayIterator;
BSONElement currentElement;
bool haveCurrent;
};
class DocumentSourceCommandShards :
public DocumentSource {
public:
// virtuals from DocumentSource
virtual ~DocumentSourceCommandShards();
virtual bool eof();
virtual bool advance();
virtual Document getCurrent();
virtual void setSource(DocumentSource *pSource);
/* convenient shorthand for a commonly used type */
typedef map<Shard, BSONObj> ShardOutput;
/**
Create a DocumentSource that wraps the output of many shards
@param shardOutput output from the individual shards
@param pExpCtx the expression context for the pipeline
@returns the newly created DocumentSource
*/
static intrusive_ptr<DocumentSourceCommandShards> create(
const ShardOutput& shardOutput,
const intrusive_ptr<ExpressionContext>& pExpCtx);
protected:
// virtuals from DocumentSource
virtual void sourceToBson(BSONObjBuilder *pBuilder, bool explain) const;
private:
DocumentSourceCommandShards(const ShardOutput& shardOutput,
const intrusive_ptr<ExpressionContext>& pExpCtx);
/**
Advance to the next document, setting pCurrent appropriately.
Adjusts pCurrent, pBsonSource, and iterator, as needed. On exit,
pCurrent is the Document to return, or NULL. If NULL, this
indicates there is nothing more to return.
*/
void getNextDocument();
bool unstarted;
bool hasCurrent;
bool newSource; // set to true for the first item of a new source
intrusive_ptr<DocumentSourceBsonArray> pBsonSource;
Document pCurrent;
ShardOutput::const_iterator iterator;
ShardOutput::const_iterator listEnd;
};
/**
* Constructs and returns Documents from the BSONObj objects produced by a supplied Cursor.
* An object of this type may only be used by one thread, see SERVER-6123.
*/
class DocumentSourceCursor :
public DocumentSource {
public:
/**
* Holds a Cursor and all associated state required to access the cursor. An object of this
* type may only be used by one thread.
*/
struct CursorWithContext {
/** Takes a read lock that will be held for the lifetime of the object. */
CursorWithContext( const string& ns );
// Must be the first struct member for proper construction and destruction, as other
// members may depend on the read lock it acquires.
Client::ReadContext _readContext;
shared_ptr<ShardChunkManager> _chunkMgr;
ClientCursor::Holder _cursor;
};
// virtuals from DocumentSource
virtual ~DocumentSourceCursor();
virtual bool eof();
virtual bool advance();
virtual Document getCurrent();
virtual void setSource(DocumentSource *pSource);
/**
* Release the Cursor and the read lock it requires, but without changing the other data.
* Releasing the lock is required for proper concurrency, see SERVER-6123. This
* functionality is also used by the explain version of pipeline execution.
*/
virtual void dispose();
/**
Create a document source based on a cursor.
This is usually put at the beginning of a chain of document sources
in order to fetch data from the database.
@param pCursor the cursor to use to fetch data
@param pExpCtx the expression context for the pipeline
*/
static intrusive_ptr<DocumentSourceCursor> create(
const shared_ptr<CursorWithContext>& cursorWithContext,
const intrusive_ptr<ExpressionContext> &pExpCtx);
/*
Record the namespace. Required for explain.
@param namespace the namespace
*/
void setNamespace(const string &ns);
/*
Record the query that was specified for the cursor this wraps, if
any.
This should be captured after any optimizations are applied to
the pipeline so that it reflects what is really used.
This gets used for explain output.
@param pBsonObj the query to record
*/
void setQuery(const shared_ptr<BSONObj> &pBsonObj);
/*
Record the sort that was specified for the cursor this wraps, if
any.
This should be captured after any optimizations are applied to
the pipeline so that it reflects what is really used.
This gets used for explain output.
@param pBsonObj the sort to record
*/
void setSort(const shared_ptr<BSONObj> &pBsonObj);
void setProjection(const BSONObj& projection, const ParsedDeps& deps);
protected:
// virtuals from DocumentSource
virtual void sourceToBson(BSONObjBuilder *pBuilder, bool explain) const;
private:
DocumentSourceCursor(
const shared_ptr<CursorWithContext>& cursorWithContext,
const intrusive_ptr<ExpressionContext> &pExpCtx);
void findNext();
bool unstarted;
bool hasCurrent;
Document pCurrent;
string ns; // namespace
/*
The bson dependencies must outlive the Cursor wrapped by this
source. Therefore, bson dependencies must appear before pCursor
in order cause its destructor to be called *after* pCursor's.
*/
shared_ptr<BSONObj> pQuery;
shared_ptr<BSONObj> pSort;
shared_ptr<Projection> _projection; // shared with pClientCursor
ParsedDeps _dependencies;
shared_ptr<CursorWithContext> _cursorWithContext;
ClientCursor::Holder& cursor();
const ShardChunkManager* chunkMgr() { return _cursorWithContext->_chunkMgr.get(); }
bool canUseCoveredIndex();
/*
Yield the cursor sometimes.
If the state of the world changed during the yield such that we
are unable to continue execution of the query, this will release the
client cursor, and throw an error. NOTE This differs from the
behavior of most other operations, see SERVER-2454.
*/
void yieldSometimes();
};
/*
This contains all the basic mechanics for filtering a stream of
Documents, except for the actual predicate evaluation itself. This was
factored out so we could create DocumentSources that use both Matcher
style predicates as well as full Expressions.
*/
class DocumentSourceFilterBase :
public DocumentSource {
public:
// virtuals from DocumentSource
virtual ~DocumentSourceFilterBase();
virtual bool eof();
virtual bool advance();
virtual Document getCurrent();
/**
Create a BSONObj suitable for Matcher construction.
This is used after filter analysis has moved as many filters to
as early a point as possible in the document processing pipeline.
See db/Matcher.h and the associated wiki documentation for the
format. This conversion is used to move back to the low-level
find() Cursor mechanism.
@param pBuilder the builder to write to
*/
virtual void toMatcherBson(BSONObjBuilder *pBuilder) const = 0;
protected:
DocumentSourceFilterBase(
const intrusive_ptr<ExpressionContext> &pExpCtx);
/**
Test the given document against the predicate and report if it
should be accepted or not.
@param pDocument the document to test
@returns true if the document matches the filter, false otherwise
*/
virtual bool accept(const Document& pDocument) const = 0;
private:
void findNext();
bool unstarted;
bool hasCurrent;
Document pCurrent;
};
class DocumentSourceFilter :
public DocumentSourceFilterBase {
public:
// virtuals from DocumentSource
virtual ~DocumentSourceFilter();
virtual bool coalesce(const intrusive_ptr<DocumentSource> &pNextSource);
virtual void optimize();
virtual const char *getSourceName() const;
/**
Create a filter.
@param pBsonElement the raw BSON specification for the filter
@param pExpCtx the expression context for the pipeline
@returns the filter
*/
static intrusive_ptr<DocumentSource> createFromBson(
BSONElement *pBsonElement,
const intrusive_ptr<ExpressionContext> &pExpCtx);
/**
Create a filter.
@param pFilter the expression to use to filter
@param pExpCtx the expression context for the pipeline
@returns the filter
*/
static intrusive_ptr<DocumentSourceFilter> create(
const intrusive_ptr<Expression> &pFilter,
const intrusive_ptr<ExpressionContext> &pExpCtx);
/**
Create a BSONObj suitable for Matcher construction.
This is used after filter analysis has moved as many filters to
as early a point as possible in the document processing pipeline.
See db/Matcher.h and the associated wiki documentation for the
format. This conversion is used to move back to the low-level
find() Cursor mechanism.
@param pBuilder the builder to write to
*/
void toMatcherBson(BSONObjBuilder *pBuilder) const;
static const char filterName[];
protected:
// virtuals from DocumentSource
virtual void sourceToBson(BSONObjBuilder *pBuilder, bool explain) const;
// virtuals from DocumentSourceFilterBase
virtual bool accept(const Document& pDocument) const;
private:
DocumentSourceFilter(const intrusive_ptr<Expression> &pFilter,
const intrusive_ptr<ExpressionContext> &pExpCtx);
intrusive_ptr<Expression> pFilter;
};
class DocumentSourceGroup :
public SplittableDocumentSource {
public:
// virtuals from DocumentSource
virtual ~DocumentSourceGroup();
virtual bool eof();
virtual bool advance();
virtual const char *getSourceName() const;
virtual Document getCurrent();
virtual GetDepsReturn getDependencies(set<string>& deps) const;
virtual void dispose();
/**
Create a new grouping DocumentSource.
@param pExpCtx the expression context for the pipeline
@returns the DocumentSource
*/
static intrusive_ptr<DocumentSourceGroup> create(
const intrusive_ptr<ExpressionContext> &pExpCtx);
/**
Set the Id Expression.
Documents that pass through the grouping Document are grouped
according to this key. This will generate the id_ field in the
result documents.
@param pExpression the group key
*/
void setIdExpression(const intrusive_ptr<Expression> &pExpression);
/**
Add an accumulator.
Accumulators become fields in the Documents that result from
grouping. Each unique group document must have it's own
accumulator; the accumulator factory is used to create that.
@param fieldName the name the accumulator result will have in the
result documents
@param pAccumulatorFactory used to create the accumulator for the
group field
*/
void addAccumulator(const std::string& fieldName,
intrusive_ptr<Accumulator> (*pAccumulatorFactory)(
const intrusive_ptr<ExpressionContext> &),
const intrusive_ptr<Expression> &pExpression);
/**
Create a grouping DocumentSource from BSON.
This is a convenience method that uses the above, and operates on
a BSONElement that has been deteremined to be an Object with an
element named $group.
@param pBsonElement the BSONELement that defines the group
@param pExpCtx the expression context
@returns the grouping DocumentSource
*/
static intrusive_ptr<DocumentSource> createFromBson(
BSONElement *pBsonElement,
const intrusive_ptr<ExpressionContext> &pExpCtx);
// Virtuals for SplittableDocumentSource
virtual intrusive_ptr<DocumentSource> getShardSource();
virtual intrusive_ptr<DocumentSource> getRouterSource();
static const char groupName[];
protected:
// virtuals from DocumentSource
virtual void sourceToBson(BSONObjBuilder *pBuilder, bool explain) const;
private:
DocumentSourceGroup(const intrusive_ptr<ExpressionContext> &pExpCtx);
/*
Before returning anything, this source must fetch everything from
the underlying source and group it. populate() is used to do that
on the first call to any method on this source. The populated
boolean indicates that this has been done.
*/
void populate();
bool populated;
intrusive_ptr<Expression> pIdExpression;
typedef boost::unordered_map<Value,
vector<intrusive_ptr<Accumulator> >, Value::Hash> GroupsType;
GroupsType groups;
/*
The field names for the result documents and the accumulator
factories for the result documents. The Expressions are the
common expressions used by each instance of each accumulator
in order to find the right-hand side of what gets added to the
accumulator. Note that each of those is the same for each group,
so we can share them across all groups by adding them to the
accumulators after we use the factories to make a new set of
accumulators for each new group.
These three vectors parallel each other.
*/
vector<string> vFieldName;
vector<intrusive_ptr<Accumulator> (*)(
const intrusive_ptr<ExpressionContext> &)> vpAccumulatorFactory;
vector<intrusive_ptr<Expression> > vpExpression;
Document makeDocument(const GroupsType::iterator &rIter);
GroupsType::iterator groupsIterator;
};
class DocumentSourceMatch :
public DocumentSourceFilterBase {
public:
// virtuals from DocumentSource
virtual ~DocumentSourceMatch();
virtual const char *getSourceName() const;
/**
Create a filter.
@param pBsonElement the raw BSON specification for the filter
@returns the filter
*/
static intrusive_ptr<DocumentSource> createFromBson(
BSONElement *pBsonElement,
const intrusive_ptr<ExpressionContext> &pCtx);
/**
Create a BSONObj suitable for Matcher construction.
This is used after filter analysis has moved as many filters to
as early a point as possible in the document processing pipeline.
See db/Matcher.h and the associated wiki documentation for the
format. This conversion is used to move back to the low-level
find() Cursor mechanism.
@param pBuilder the builder to write to
*/
void toMatcherBson(BSONObjBuilder *pBuilder) const;
static const char matchName[];
protected:
// virtuals from DocumentSource
virtual void sourceToBson(BSONObjBuilder *pBuilder, bool explain) const;
// virtuals from DocumentSourceFilterBase
virtual bool accept(const Document& pDocument) const;
private:
DocumentSourceMatch(const BSONObj &query,
const intrusive_ptr<ExpressionContext> &pExpCtx);
Matcher matcher;
};
class DocumentSourceOut :
public DocumentSource {
public:
// virtuals from DocumentSource
virtual ~DocumentSourceOut();
virtual bool eof();
virtual bool advance();
virtual const char *getSourceName() const;
virtual Document getCurrent();
/**
Create a document source for output and pass-through.
This can be put anywhere in a pipeline and will store content as
well as pass it on.
@param pBsonElement the raw BSON specification for the source
@param pExpCtx the expression context for the pipeline
@returns the newly created document source
*/
static intrusive_ptr<DocumentSourceOut> createFromBson(
BSONElement *pBsonElement,
const intrusive_ptr<ExpressionContext> &pExpCtx);
static const char outName[];
protected:
// virtuals from DocumentSource
virtual void sourceToBson(BSONObjBuilder *pBuilder, bool explain) const;
private:
DocumentSourceOut(BSONElement *pBsonElement,
const intrusive_ptr<ExpressionContext> &pExpCtx);
};
class DocumentSourceProject :
public DocumentSource {
public:
// virtuals from DocumentSource
virtual ~DocumentSourceProject();
virtual bool eof();
virtual bool advance();
virtual const char *getSourceName() const;
virtual Document getCurrent();
virtual void optimize();
virtual GetDepsReturn getDependencies(set<string>& deps) const;
/**
Create a new projection DocumentSource from BSON.
This is a convenience for directly handling BSON, and relies on the
above methods.
@param pBsonElement the BSONElement with an object named $project
@param pExpCtx the expression context for the pipeline
@returns the created projection
*/
static intrusive_ptr<DocumentSource> createFromBson(
BSONElement *pBsonElement,
const intrusive_ptr<ExpressionContext> &pExpCtx);
static const char projectName[];
/** projection as specified by the user */
BSONObj getRaw() const { return _raw; }
protected:
// virtuals from DocumentSource
virtual void sourceToBson(BSONObjBuilder *pBuilder, bool explain) const;
private:
DocumentSourceProject(const intrusive_ptr<ExpressionContext> &pExpCtx);
// configuration state
intrusive_ptr<ExpressionObject> pEO;
BSONObj _raw;
#if defined(_DEBUG)
// this is used in DEBUG builds to ensure we are compatible
Projection _simpleProjection;
#endif
};
class DocumentSourceSort :
public SplittableDocumentSource {
public:
// virtuals from DocumentSource
virtual ~DocumentSourceSort();
virtual bool eof();
virtual bool advance();
virtual const char *getSourceName() const;
virtual Document getCurrent();
virtual void addToBsonArray(BSONArrayBuilder *pBuilder, bool explain=false) const;
virtual bool coalesce(const intrusive_ptr<DocumentSource> &pNextSource);
virtual void dispose();
virtual GetDepsReturn getDependencies(set<string>& deps) const;
// Virtuals for SplittableDocumentSource
// All work for sort is done in router currently if there is no limit.
// If there is a limit, the $sort/$limit combination is performed on the
// shards, then the results are resorted and limited on mongos
virtual intrusive_ptr<DocumentSource> getShardSource() { return limitSrc ? this : NULL; }
virtual intrusive_ptr<DocumentSource> getRouterSource() { return this; }
/**
Add sort key field.
Adds a sort key field to the key being built up. A concatenated
key is built up by calling this repeatedly.
@param fieldPath the field path to the key component
@param ascending if true, use the key for an ascending sort,
otherwise, use it for descending
*/
void addKey(const string &fieldPath, bool ascending);
/**
Write out an object whose contents are the sort key.
@param pBuilder initialized object builder.
@param fieldPrefix specify whether or not to include the field prefix
*/
void sortKeyToBson(BSONObjBuilder *pBuilder, bool usePrefix) const;
/**
Create a sorting DocumentSource from BSON.
This is a convenience method that uses the above, and operates on
a BSONElement that has been deteremined to be an Object with an
element named $group.
@param pBsonElement the BSONELement that defines the group
@param pExpCtx the expression context for the pipeline
@returns the grouping DocumentSource
*/
static intrusive_ptr<DocumentSource> createFromBson(
BSONElement *pBsonElement,
const intrusive_ptr<ExpressionContext> &pExpCtx);
/// Create a DocumentSourceSort with a given sort and (optional) limit
static intrusive_ptr<DocumentSourceSort> create(
const intrusive_ptr<ExpressionContext> &pExpCtx,
BSONObj sortOrder,
long long limit=-1);
/// returns -1 for no limit
long long getLimit() const;
intrusive_ptr<DocumentSourceLimit> getLimitSrc() const { return limitSrc; }
static const char sortName[];
protected:
// virtuals from DocumentSource
virtual void sourceToBson(BSONObjBuilder *pBuilder, bool explain) const {
verify(false); // should call addToBsonArray instead
}
private:
DocumentSourceSort(const intrusive_ptr<ExpressionContext> &pExpCtx);
/*
Before returning anything, this source must fetch everything from
the underlying source and group it. populate() is used to do that
on the first call to any method on this source. The populated
boolean indicates that this has been done.
*/
void populate();
bool populated;
// These are called by populate()
void populateAll(); // no limit
void populateOne(); // limit == 1
void populateTopK(); // limit > 1
/* these two parallel each other */
typedef vector<intrusive_ptr<ExpressionFieldPath> > SortPaths;
SortPaths vSortKey;
vector<char> vAscending; // used like vector<bool> but without specialization
struct KeyAndDoc {
explicit KeyAndDoc(const Document& d, const SortPaths& sp); // extracts sort key
Value key; // array of keys if vSortKey.size() > 1
Document doc;
};
friend void swap(KeyAndDoc& l, KeyAndDoc& r);
/// Compare two KeyAndDocs according to the specified sort key.
int compare(const KeyAndDoc& lhs, const KeyAndDoc& rhs) const;
/*
This is a utility class just for the STL sort that is done
inside.
*/
class Comparator {
public:
explicit Comparator(const DocumentSourceSort& source): _source(source) {}
bool operator()(const KeyAndDoc& lhs, const KeyAndDoc& rhs) const {
return (_source.compare(lhs, rhs) < 0);
}
private:
const DocumentSourceSort& _source;
};
deque<KeyAndDoc> documents;
intrusive_ptr<DocumentSourceLimit> limitSrc;
};
inline void swap(DocumentSourceSort::KeyAndDoc& l, DocumentSourceSort::KeyAndDoc& r) {
l.key.swap(r.key);
l.doc.swap(r.doc);
}
class DocumentSourceLimit :
public SplittableDocumentSource {
public:
// virtuals from DocumentSource
virtual ~DocumentSourceLimit();
virtual bool eof();
virtual bool advance();
virtual Document getCurrent();
virtual const char *getSourceName() const;
virtual bool coalesce(const intrusive_ptr<DocumentSource> &pNextSource);
virtual GetDepsReturn getDependencies(set<string>& deps) const {
return SEE_NEXT; // This doesn't affect needed fields
}
/**
Create a new limiting DocumentSource.
@param pExpCtx the expression context for the pipeline
@returns the DocumentSource
*/
static intrusive_ptr<DocumentSourceLimit> create(
const intrusive_ptr<ExpressionContext> &pExpCtx,
long long limit);
// Virtuals for SplittableDocumentSource
// Need to run on rounter. Running on shard as well is an optimization.
virtual intrusive_ptr<DocumentSource> getShardSource() { return this; }
virtual intrusive_ptr<DocumentSource> getRouterSource() { return this; }
long long getLimit() const { return limit; }
void setLimit(long long newLimit) { limit = newLimit; }
/**
Create a limiting DocumentSource from BSON.
This is a convenience method that uses the above, and operates on
a BSONElement that has been deteremined to be an Object with an
element named $limit.
@param pBsonElement the BSONELement that defines the limit
@param pExpCtx the expression context
@returns the grouping DocumentSource
*/
static intrusive_ptr<DocumentSource> createFromBson(
BSONElement *pBsonElement,
const intrusive_ptr<ExpressionContext> &pExpCtx);
static const char limitName[];
protected:
// virtuals from DocumentSource
virtual void sourceToBson(BSONObjBuilder *pBuilder, bool explain) const;
private:
DocumentSourceLimit(const intrusive_ptr<ExpressionContext> &pExpCtx,
long long limit);
long long limit;
long long count;
};
class DocumentSourceSkip :
public SplittableDocumentSource {
public:
// virtuals from DocumentSource
virtual ~DocumentSourceSkip();
virtual bool eof();
virtual bool advance();
virtual Document getCurrent();
virtual const char *getSourceName() const;
virtual bool coalesce(const intrusive_ptr<DocumentSource> &pNextSource);
virtual GetDepsReturn getDependencies(set<string>& deps) const {
return SEE_NEXT; // This doesn't affect needed fields
}
/**
Create a new skipping DocumentSource.
@param pExpCtx the expression context
@returns the DocumentSource
*/
static intrusive_ptr<DocumentSourceSkip> create(
const intrusive_ptr<ExpressionContext> &pExpCtx);
// Virtuals for SplittableDocumentSource
// Need to run on rounter. Can't run on shards.
virtual intrusive_ptr<DocumentSource> getShardSource() { return NULL; }
virtual intrusive_ptr<DocumentSource> getRouterSource() { return this; }
long long getSkip() const { return skip; }
void setSkip(long long newSkip) { skip = newSkip; }
/**
Create a skipping DocumentSource from BSON.
This is a convenience method that uses the above, and operates on
a BSONElement that has been deteremined to be an Object with an
element named $skip.
@param pBsonElement the BSONELement that defines the skip
@param pExpCtx the expression context
@returns the grouping DocumentSource
*/
static intrusive_ptr<DocumentSource> createFromBson(
BSONElement *pBsonElement,
const intrusive_ptr<ExpressionContext> &pExpCtx);
static const char skipName[];
protected:
// virtuals from DocumentSource
virtual void sourceToBson(BSONObjBuilder *pBuilder, bool explain) const;
private:
DocumentSourceSkip(const intrusive_ptr<ExpressionContext> &pExpCtx);
/*
Skips initial documents.
*/
void skipper();
long long skip;
long long count;
Document pCurrent;
};
class DocumentSourceUnwind :
public DocumentSource {
public:
// virtuals from DocumentSource
virtual ~DocumentSourceUnwind();
virtual bool eof();
virtual bool advance();
virtual const char *getSourceName() const;
virtual Document getCurrent();
virtual GetDepsReturn getDependencies(set<string>& deps) const;
/**
Create a new projection DocumentSource from BSON.
This is a convenience for directly handling BSON, and relies on the
above methods.
@param pBsonElement the BSONElement with an object named $project
@param pExpCtx the expression context for the pipeline
@returns the created projection
*/
static intrusive_ptr<DocumentSource> createFromBson(
BSONElement *pBsonElement,
const intrusive_ptr<ExpressionContext> &pExpCtx);
static const char unwindName[];
protected:
// virtuals from DocumentSource
virtual void sourceToBson(BSONObjBuilder *pBuilder, bool explain) const;
private:
DocumentSourceUnwind(const intrusive_ptr<ExpressionContext> &pExpCtx);
/**
* Lazily construct the _unwinder and initialize the iterator state of this DocumentSource.
* To be called by all members that depend on the iterator state.
*/
void lazyInit();
/**
* If the _unwinder is exhausted and the source may be advanced, advance the pSource and
* reset the _unwinder's source document.
*/
void mayAdvanceSource();
/** Specify the field to unwind. */
void unwindPath(const FieldPath &fieldPath);
// Configuration state.
scoped_ptr<FieldPath> _unwindPath;
// Iteration state.
class Unwinder;
scoped_ptr<Unwinder> _unwinder;
};
class DocumentSourceGeoNear : public SplittableDocumentSource {
public:
// virtuals from DocumentSource
virtual ~DocumentSourceGeoNear();
virtual bool eof();
virtual bool advance();
virtual Document getCurrent();
virtual const char *getSourceName() const;
virtual void setSource(DocumentSource *pSource); // errors out since this must be first
virtual bool coalesce(const intrusive_ptr<DocumentSource> &pNextSource);
// Virtuals for SplittableDocumentSource
virtual intrusive_ptr<DocumentSource> getShardSource();
virtual intrusive_ptr<DocumentSource> getRouterSource();
static intrusive_ptr<DocumentSource> createFromBson(
BSONElement *pBsonElement,
const intrusive_ptr<ExpressionContext> &pCtx);
static char geoNearName[];
long long getLimit() { return limit; }
// this should only be used for testing
static intrusive_ptr<DocumentSourceGeoNear> create(
const intrusive_ptr<ExpressionContext> &pCtx);
protected:
// virtuals from DocumentSource
virtual void sourceToBson(BSONObjBuilder *pBuilder, bool explain) const;
private:
DocumentSourceGeoNear(const intrusive_ptr<ExpressionContext> &pExpCtx);
void parseOptions(BSONObj options);
BSONObj buildGeoNearCmd(const StringData& collection) const;
void runCommand();
// These fields describe the command to run.
// coords and distanceField are required, rest are optional
BSONObj coords; // "near" option, but near is a reserved keyword on windows
bool coordsIsArray;
scoped_ptr<FieldPath> distanceField; // Using scoped_ptr because FieldPath can't be empty
long long limit;
double maxDistance;
BSONObj query;
bool spherical;
double distanceMultiplier;
scoped_ptr<FieldPath> includeLocs;
bool uniqueDocs;
// These fields are injected by PipelineD. This division of labor allows the
// DocumentSourceGeoNear class to be linked into both mongos and mongod while
// allowing it to run a command using DBDirectClient when in mongod.
string db;
string collection;
boost::scoped_ptr<DBClientWithCommands> client; // either NULL or a DBDirectClient
friend class PipelineD;
// these fields are used while processing the results
BSONObj cmdOutput;
boost::scoped_ptr<BSONObjIterator> resultsIterator; // iterator over cmdOutput["results"]
Document currentDoc;
bool hasCurrent;
};
}
/* ======================= INLINED IMPLEMENTATIONS ========================== */
namespace mongo {
inline void DocumentSource::setPipelineStep(int s) {
step = s;
}
inline int DocumentSource::getPipelineStep() const {
return step;
}
inline void DocumentSourceGroup::setIdExpression(
const intrusive_ptr<Expression> &pExpression) {
pIdExpression = pExpression;
}
}
|