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
|
// matcher.cpp
/* Matcher is our boolean expression evaluator for "where" clauses */
/**
* 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/>.
*/
#include "pch.h"
#include "matcher.h"
#include "../util/goodies.h"
#include "../util/unittest.h"
#include "diskloc.h"
#include "../scripting/engine.h"
#include "db.h"
#include "queryutil.h"
#include "client.h"
#include "pdfile.h"
namespace {
inline pcrecpp::RE_Options flags2options(const char* flags) {
pcrecpp::RE_Options options;
options.set_utf8(true);
while ( flags && *flags ) {
if ( *flags == 'i' )
options.set_caseless(true);
else if ( *flags == 'm' )
options.set_multiline(true);
else if ( *flags == 'x' )
options.set_extended(true);
else if ( *flags == 's' )
options.set_dotall(true);
flags++;
}
return options;
}
}
//#define DEBUGMATCHER(x) cout << x << endl;
#define DEBUGMATCHER(x)
namespace mongo {
extern BSONObj staticNull;
class Where {
public:
Where() {
jsScope = 0;
func = 0;
}
~Where() {
if ( scope.get() ){
try {
scope->execSetup( "_mongo.readOnly = false;" , "make not read only" );
}
catch( DBException& e ){
warning() << "javascript scope cleanup interrupted" << causedBy( e ) << endl;
}
}
if ( jsScope ) {
delete jsScope;
jsScope = 0;
}
func = 0;
}
auto_ptr<Scope> scope;
ScriptingFunction func;
BSONObj *jsScope;
void setFunc(const char *code) {
massert( 10341 , "scope has to be created first!" , scope.get() );
func = scope->createFunction( code );
}
};
Matcher::~Matcher() {
delete _where;
_where = 0;
}
ElementMatcher::ElementMatcher( BSONElement e , int op, bool isNot )
: _toMatch( e ) , _compareOp( op ), _isNot( isNot ), _subMatcherOnPrimitives(false) {
if ( op == BSONObj::opMOD ) {
BSONObj o = e.embeddedObject();
_mod = o["0"].numberInt();
_modm = o["1"].numberInt();
uassert( 10073 , "mod can't be 0" , _mod );
}
else if ( op == BSONObj::opTYPE ) {
_type = (BSONType)(e.numberInt());
}
else if ( op == BSONObj::opELEM_MATCH ) {
BSONElement m = e;
uassert( 12517 , "$elemMatch needs an Object" , m.type() == Object );
BSONObj x = m.embeddedObject();
if ( x.firstElement().getGtLtOp() == 0 ) {
_subMatcher.reset( new Matcher( x ) );
_subMatcherOnPrimitives = false;
}
else {
// meant to act on primitives
_subMatcher.reset( new Matcher( BSON( "" << x ) ) );
_subMatcherOnPrimitives = true;
}
}
}
ElementMatcher::ElementMatcher( BSONElement e , int op , const BSONObj& array, bool isNot )
: _toMatch( e ) , _compareOp( op ), _isNot( isNot ), _subMatcherOnPrimitives(false) {
_myset.reset( new set<BSONElement,element_lt>() );
BSONObjIterator i( array );
while ( i.more() ) {
BSONElement ie = i.next();
if ( op == BSONObj::opALL && ie.type() == Object && ie.embeddedObject().firstElement().getGtLtOp() == BSONObj::opELEM_MATCH ) {
shared_ptr<Matcher> s;
s.reset( new Matcher( ie.embeddedObject().firstElement().embeddedObjectUserCheck() ) );
_allMatchers.push_back( s );
}
else if ( ie.type() == RegEx ) {
if ( !_myregex.get() ) {
_myregex.reset( new vector< RegexMatcher >() );
}
_myregex->push_back( RegexMatcher() );
RegexMatcher &rm = _myregex->back();
rm._re.reset( new pcrecpp::RE( ie.regex(), flags2options( ie.regexFlags() ) ) );
rm._fieldName = 0; // no need for field name
rm._regex = ie.regex();
rm._flags = ie.regexFlags();
rm._isNot = false;
bool purePrefix;
string prefix = simpleRegex(rm._regex, rm._flags, &purePrefix);
if (purePrefix)
rm._prefix = prefix;
}
else {
uassert( 15882, "$elemMatch not allowed within $in",
ie.type() != Object ||
ie.embeddedObject().firstElement().getGtLtOp() != BSONObj::opELEM_MATCH );
_myset->insert(ie);
}
}
if ( _allMatchers.size() ) {
uassert( 13020 , "with $all, can't mix $elemMatch and others" , _myset->size() == 0 && !_myregex.get());
}
}
void Matcher::addRegex(const char *fieldName, const char *regex, const char *flags, bool isNot) {
if ( _nRegex >= 4 ) {
out() << "ERROR: too many regexes in query" << endl;
}
else {
RegexMatcher& rm = _regexs[_nRegex];
rm._re.reset( new pcrecpp::RE(regex, flags2options(flags)) );
rm._fieldName = fieldName;
rm._regex = regex;
rm._flags = flags;
rm._isNot = isNot;
_nRegex++;
if (!isNot) { //TODO something smarter
bool purePrefix;
string prefix = simpleRegex(regex, flags, &purePrefix);
if (purePrefix)
rm._prefix = prefix;
}
}
}
bool Matcher::addOp( const BSONElement &e, const BSONElement &fe, bool isNot, const char *& regex, const char *&flags ) {
const char *fn = fe.fieldName();
int op = fe.getGtLtOp( -1 );
if ( op == -1 ) {
if ( !isNot && fn[1] == 'r' && fn[2] == 'e' && fn[3] == 'f' && fn[4] == 0 ) {
return false; // { $ref : xxx } - treat as normal object
}
uassert( 10068 , (string)"invalid operator: " + fn , op != -1 );
}
switch ( op ) {
case BSONObj::GT:
case BSONObj::GTE:
case BSONObj::LT:
case BSONObj::LTE: {
shared_ptr< BSONObjBuilder > b( new BSONObjBuilder() );
_builders.push_back( b );
b->appendAs(fe, e.fieldName());
addBasic(b->done().firstElement(), op, isNot);
break;
}
case BSONObj::NE: {
_haveNeg = true;
shared_ptr< BSONObjBuilder > b( new BSONObjBuilder() );
_builders.push_back( b );
b->appendAs(fe, e.fieldName());
addBasic(b->done().firstElement(), BSONObj::NE, isNot);
break;
}
case BSONObj::opALL:
_all = true;
case BSONObj::opIN: {
uassert( 13276 , "$in needs an array" , fe.isABSONObj() );
_basics.push_back( ElementMatcher( e , op , fe.embeddedObject(), isNot ) );
BSONObjIterator i( fe.embeddedObject() );
while( i.more() ) {
if ( i.next().type() == Array ) {
_hasArray = true;
}
}
break;
}
case BSONObj::NIN:
uassert( 13277 , "$nin needs an array" , fe.isABSONObj() );
_haveNeg = true;
_basics.push_back( ElementMatcher( e , op , fe.embeddedObject(), isNot ) );
break;
case BSONObj::opMOD:
case BSONObj::opTYPE:
case BSONObj::opELEM_MATCH: {
shared_ptr< BSONObjBuilder > b( new BSONObjBuilder() );
_builders.push_back( b );
b->appendAs(fe, e.fieldName());
// these are types where ElementMatcher has all the info
_basics.push_back( ElementMatcher( b->done().firstElement() , op, isNot ) );
break;
}
case BSONObj::opSIZE: {
shared_ptr< BSONObjBuilder > b( new BSONObjBuilder() );
_builders.push_back( b );
b->appendAs(fe, e.fieldName());
addBasic(b->done().firstElement(), BSONObj::opSIZE, isNot);
_haveSize = true;
break;
}
case BSONObj::opEXISTS: {
shared_ptr< BSONObjBuilder > b( new BSONObjBuilder() );
_builders.push_back( b );
b->appendAs(fe, e.fieldName());
addBasic(b->done().firstElement(), BSONObj::opEXISTS, isNot);
break;
}
case BSONObj::opREGEX: {
uassert( 13032, "can't use $not with $regex, use BSON regex type instead", !isNot );
if ( fe.type() == RegEx ) {
regex = fe.regex();
flags = fe.regexFlags();
}
else {
regex = fe.valuestrsafe();
}
break;
}
case BSONObj::opOPTIONS: {
uassert( 13029, "can't use $not with $options, use BSON regex type instead", !isNot );
flags = fe.valuestrsafe();
break;
}
case BSONObj::opNEAR:
case BSONObj::opWITHIN:
case BSONObj::opMAX_DISTANCE:
break;
default:
uassert( 10069 , (string)"BUG - can't operator for: " + fn , 0 );
}
return true;
}
void Matcher::parseExtractedClause( const BSONElement &e, list< shared_ptr< Matcher > > &matchers ) {
uassert( 13086, "$and/$or/$nor must be a nonempty array", e.type() == Array && e.embeddedObject().nFields() > 0 );
BSONObjIterator j( e.embeddedObject() );
while( j.more() ) {
BSONElement f = j.next();
uassert( 13087, "$and/$or/$nor match element must be an object", f.type() == Object );
matchers.push_back( shared_ptr< Matcher >( new Matcher( f.embeddedObject(), true ) ) );
}
}
bool Matcher::parseClause( const BSONElement &e ) {
const char *ef = e.fieldName();
if ( ef[ 0 ] != '$' )
return false;
if ( ef[ 1 ] == 'a' && ef[ 2 ] == 'n' && ef[ 3 ] == 'd' ) {
parseExtractedClause( e, _andMatchers );
}
else if ( ef[ 1 ] == 'o' && ef[ 2 ] == 'r' && ef[ 3 ] == 0 ) {
parseExtractedClause( e, _orMatchers );
}
else if ( ef[ 1 ] == 'n' && ef[ 2 ] == 'o' && ef[ 3 ] == 'r' && ef[ 4 ] == 0 ) {
parseExtractedClause( e, _norMatchers );
}
else {
return false;
}
return true;
}
void Matcher::parseMatchExpressionElement( const BSONElement &e, bool nested ) {
uassert( 13629 , "can't have undefined in a query expression" , e.type() != Undefined );
if ( parseClause( e ) ) {
return;
}
if ( ( e.type() == CodeWScope || e.type() == Code || e.type() == String ) && strcmp(e.fieldName(), "$where")==0 ) {
// $where: function()...
uassert( 10066 , "$where may only appear once in query", _where == 0 );
uassert( 10067 , "$where query, but no script engine", globalScriptEngine );
massert( 13089 , "no current client needed for $where" , haveClient() );
_where = new Where();
_where->scope = globalScriptEngine->getPooledScope( cc().ns() );
_where->scope->localConnect( cc().database()->name.c_str() );
if ( e.type() == CodeWScope ) {
_where->setFunc( e.codeWScopeCode() );
_where->jsScope = new BSONObj( e.codeWScopeScopeData() );
}
else {
const char *code = e.valuestr();
_where->setFunc(code);
}
_where->scope->execSetup( "_mongo.readOnly = true;" , "make read only" );
return;
}
if ( e.type() == RegEx ) {
addRegex( e.fieldName(), e.regex(), e.regexFlags() );
return;
}
// greater than / less than...
// e.g., e == { a : { $gt : 3 } }
// or
// { a : { $in : [1,2,3] } }
if ( e.type() == Object ) {
// support {$regex:"a|b", $options:"imx"}
const char* regex = NULL;
const char* flags = "";
// e.g., fe == { $gt : 3 }
BSONObjIterator j(e.embeddedObject());
bool isOperator = false;
while ( j.more() ) {
BSONElement fe = j.next();
const char *fn = fe.fieldName();
if ( fn[0] == '$' && fn[1] ) {
isOperator = true;
if ( fn[1] == 'n' && fn[2] == 'o' && fn[3] == 't' && fn[4] == 0 ) {
_haveNeg = true;
switch( fe.type() ) {
case Object: {
BSONObjIterator k( fe.embeddedObject() );
uassert( 13030, "$not cannot be empty", k.more() );
while( k.more() ) {
addOp( e, k.next(), true, regex, flags );
}
break;
}
case RegEx:
addRegex( e.fieldName(), fe.regex(), fe.regexFlags(), true );
break;
default:
uassert( 13031, "invalid use of $not", false );
}
}
else {
if ( !addOp( e, fe, false, regex, flags ) ) {
isOperator = false;
break;
}
}
}
else {
isOperator = false;
break;
}
}
if (regex) {
addRegex(e.fieldName(), regex, flags);
}
if ( isOperator )
return;
}
if ( e.type() == Array ) {
_hasArray = true;
}
else if( strcmp(e.fieldName(), "$atomic") == 0 ) {
uassert( 14844, "$atomic specifier must be a top level field", !nested );
_atomic = e.trueValue();
return;
}
// normal, simple case e.g. { a : "foo" }
addBasic(e, BSONObj::Equality, false);
}
/* _jsobj - the query pattern
*/
Matcher::Matcher(const BSONObj &jsobj, bool nested) :
_where(0), _jsobj(jsobj), _haveSize(), _all(), _hasArray(0), _haveNeg(), _atomic(false), _nRegex(0) {
BSONObjIterator i(_jsobj);
while ( i.more() ) {
parseMatchExpressionElement( i.next(), nested );
}
}
Matcher::Matcher( const Matcher &docMatcher, const BSONObj &key ) :
_where(0), _constrainIndexKey( key ), _haveSize(), _all(), _hasArray(0), _haveNeg(), _atomic(false), _nRegex(0) {
// Filter out match components that will provide an incorrect result
// given a key from a single key index.
for( vector< ElementMatcher >::const_iterator i = docMatcher._basics.begin(); i != docMatcher._basics.end(); ++i ) {
if ( key.hasField( i->_toMatch.fieldName() ) ) {
switch( i->_compareOp ) {
case BSONObj::opSIZE:
case BSONObj::opALL:
case BSONObj::NE:
case BSONObj::NIN:
case BSONObj::opEXISTS: // We can't match on index in this case.
case BSONObj::opTYPE: // For $type:10 (null), a null key could be a missing field or a null value field.
break;
case BSONObj::opIN: {
bool inContainsArray = false;
for( set<BSONElement,element_lt>::const_iterator j = i->_myset->begin(); j != i->_myset->end(); ++j ) {
if ( j->type() == Array ) {
inContainsArray = true;
break;
}
}
// Can't match an array to its first indexed element.
if ( !i->_isNot && !inContainsArray ) {
_basics.push_back( *i );
}
break;
}
default: {
// Can't match an array to its first indexed element.
if ( !i->_isNot && i->_toMatch.type() != Array ) {
_basics.push_back( *i );
}
}
}
}
}
for( int i = 0; i < docMatcher._nRegex; ++i ) {
if ( !docMatcher._regexs[ i ]._isNot && key.hasField( docMatcher._regexs[ i ]._fieldName ) ) {
_regexs[ _nRegex++ ] = docMatcher._regexs[ i ];
}
}
// Recursively filter match components for and and or matchers.
for( list< shared_ptr< Matcher > >::const_iterator i = docMatcher._andMatchers.begin(); i != docMatcher._andMatchers.end(); ++i ) {
_andMatchers.push_back( shared_ptr< Matcher >( new Matcher( **i, key ) ) );
}
for( list< shared_ptr< Matcher > >::const_iterator i = docMatcher._orMatchers.begin(); i != docMatcher._orMatchers.end(); ++i ) {
_orMatchers.push_back( shared_ptr< Matcher >( new Matcher( **i, key ) ) );
}
}
inline bool regexMatches(const RegexMatcher& rm, const BSONElement& e) {
switch (e.type()) {
case String:
case Symbol:
if (rm._prefix.empty())
return rm._re->PartialMatch(e.valuestr());
else
return !strncmp(e.valuestr(), rm._prefix.c_str(), rm._prefix.size());
case RegEx:
return !strcmp(rm._regex, e.regex()) && !strcmp(rm._flags, e.regexFlags());
default:
return false;
}
}
inline int Matcher::valuesMatch(const BSONElement& l, const BSONElement& r, int op, const ElementMatcher& bm) {
assert( op != BSONObj::NE && op != BSONObj::NIN );
if ( op == BSONObj::Equality ) {
return l.valuesEqual(r);
}
if ( op == BSONObj::opIN ) {
// { $in : [1,2,3] }
int count = bm._myset->count(l);
if ( count )
return count;
if ( bm._myregex.get() ) {
for( vector<RegexMatcher>::const_iterator i = bm._myregex->begin(); i != bm._myregex->end(); ++i ) {
if ( regexMatches( *i, l ) ) {
return true;
}
}
}
}
if ( op == BSONObj::opSIZE ) {
if ( l.type() != Array )
return 0;
int count = 0;
BSONObjIterator i( l.embeddedObject() );
while( i.moreWithEOO() ) {
BSONElement e = i.next();
if ( e.eoo() )
break;
++count;
}
return count == r.number();
}
if ( op == BSONObj::opMOD ) {
if ( ! l.isNumber() )
return false;
return l.numberLong() % bm._mod == bm._modm;
}
if ( op == BSONObj::opTYPE ) {
return bm._type == l.type();
}
/* check LT, GTE, ... */
if ( l.canonicalType() != r.canonicalType() )
return false;
int c = compareElementValues(l, r);
if ( c < -1 ) c = -1;
if ( c > 1 ) c = 1;
int z = 1 << (c+1);
return (op & z);
}
int Matcher::matchesNe(const char *fieldName, const BSONElement &toMatch, const BSONObj &obj, const ElementMatcher& bm , MatchDetails * details ) {
int ret = matchesDotted( fieldName, toMatch, obj, BSONObj::Equality, bm , false , details );
if ( bm._toMatch.type() != jstNULL )
return ( ret <= 0 ) ? 1 : 0;
else
return -ret;
}
int retExistsFound( const ElementMatcher &bm ) {
return bm._toMatch.trueValue() ? 1 : -1;
}
/* Check if a particular field matches.
fieldName - field to match "a.b" if we are reaching into an embedded object.
toMatch - element we want to match.
obj - database object to check against
compareOp - Equality, LT, GT, etc.
isArr -
Special forms:
{ "a.b" : 3 } means obj.a.b == 3
{ a : { $lt : 3 } } means obj.a < 3
{ a : { $in : [1,2] } } means [1,2].contains(obj.a)
return value
-1 mismatch
0 missing element
1 match
*/
int Matcher::matchesDotted(const char *fieldName, const BSONElement& toMatch, const BSONObj& obj, int compareOp, const ElementMatcher& em , bool isArr, MatchDetails * details ) {
DEBUGMATCHER( "\t matchesDotted : " << fieldName << " hasDetails: " << ( details ? "yes" : "no" ) );
if ( compareOp == BSONObj::opALL ) {
if ( em._allMatchers.size() ) {
BSONElement e = obj.getFieldDotted( fieldName );
uassert( 13021 , "$all/$elemMatch needs to be applied to array" , e.type() == Array );
for ( unsigned i=0; i<em._allMatchers.size(); i++ ) {
bool found = false;
BSONObjIterator x( e.embeddedObject() );
while ( x.more() ) {
BSONElement f = x.next();
if ( f.type() != Object )
continue;
if ( em._allMatchers[i]->matches( f.embeddedObject() ) ) {
found = true;
break;
}
}
if ( ! found )
return -1;
}
return 1;
}
if ( em._myset->size() == 0 && !em._myregex.get() )
return -1; // is this desired?
BSONElementSet myValues;
obj.getFieldsDotted( fieldName , myValues );
for( set< BSONElement, element_lt >::const_iterator i = em._myset->begin(); i != em._myset->end(); ++i ) {
// ignore nulls
if ( i->type() == jstNULL )
continue;
if ( myValues.count( *i ) == 0 )
return -1;
}
if ( !em._myregex.get() )
return 1;
for( vector< RegexMatcher >::const_iterator i = em._myregex->begin(); i != em._myregex->end(); ++i ) {
bool match = false;
for( BSONElementSet::const_iterator j = myValues.begin(); j != myValues.end(); ++j ) {
if ( regexMatches( *i, *j ) ) {
match = true;
break;
}
}
if ( !match )
return -1;
}
return 1;
} // end opALL
if ( compareOp == BSONObj::NE )
return matchesNe( fieldName, toMatch, obj, em , details );
if ( compareOp == BSONObj::NIN ) {
for( set<BSONElement,element_lt>::const_iterator i = em._myset->begin(); i != em._myset->end(); ++i ) {
int ret = matchesNe( fieldName, *i, obj, em , details );
if ( ret != 1 )
return ret;
}
if ( em._myregex.get() ) {
BSONElementSet s;
obj.getFieldsDotted( fieldName, s );
for( vector<RegexMatcher>::const_iterator i = em._myregex->begin(); i != em._myregex->end(); ++i ) {
for( BSONElementSet::const_iterator j = s.begin(); j != s.end(); ++j ) {
if ( regexMatches( *i, *j ) ) {
return -1;
}
}
}
}
return 1;
}
BSONElement e;
bool indexed = !_constrainIndexKey.isEmpty();
if ( indexed ) {
e = obj.getFieldUsingIndexNames(fieldName, _constrainIndexKey);
if( e.eoo() ) {
cout << "obj: " << obj << endl;
cout << "fieldName: " << fieldName << endl;
cout << "_constrainIndexKey: " << _constrainIndexKey << endl;
assert( !e.eoo() );
}
}
else {
const char *p = strchr(fieldName, '.');
if ( p ) {
string left(fieldName, p-fieldName);
BSONElement se = obj.getField(left.c_str());
if ( se.eoo() )
;
else if ( se.type() != Object && se.type() != Array )
;
else {
BSONObj eo = se.embeddedObject();
return matchesDotted(p+1, toMatch, eo, compareOp, em, se.type() == Array , details );
}
}
// An array was encountered while scanning for components of the field name.
if ( isArr ) {
DEBUGMATCHER( "\t\t isArr 1 : obj : " << obj );
BSONObjIterator ai(obj);
bool found = false;
while ( ai.moreWithEOO() ) {
BSONElement z = ai.next();
if( strcmp(z.fieldName(),fieldName) == 0 ) {
if ( compareOp == BSONObj::opEXISTS ) {
return retExistsFound( em );
}
if (valuesMatch(z, toMatch, compareOp, em) ) {
// "field.<n>" array notation was used
if ( details )
details->_elemMatchKey = z.fieldName();
return 1;
}
}
if ( z.type() == Object ) {
BSONObj eo = z.embeddedObject();
int cmp = matchesDotted(fieldName, toMatch, eo, compareOp, em, false, details );
if ( cmp > 0 ) {
if ( details )
details->_elemMatchKey = z.fieldName();
return 1;
}
else if ( cmp < 0 ) {
found = true;
}
}
}
return found ? -1 : 0;
}
if( p ) {
// Left portion of field name was not found or wrong type.
return 0;
}
else {
e = obj.getField(fieldName);
}
}
if ( compareOp == BSONObj::opEXISTS ) {
if( e.eoo() ) {
return 0;
} else {
return retExistsFound( em );
}
}
else if ( ( e.type() != Array || indexed || compareOp == BSONObj::opSIZE ) &&
valuesMatch(e, toMatch, compareOp, em ) ) {
return 1;
}
else if ( e.type() == Array && compareOp != BSONObj::opSIZE ) {
BSONObjIterator ai(e.embeddedObject());
while ( ai.moreWithEOO() ) {
BSONElement z = ai.next();
if ( compareOp == BSONObj::opELEM_MATCH ) {
if ( z.type() == Object ) {
if ( em._subMatcher->matches( z.embeddedObject() ) ) {
if ( details )
details->_elemMatchKey = z.fieldName();
return 1;
}
}
else if ( em._subMatcherOnPrimitives ) {
if ( z.type() && em._subMatcher->matches( z.wrap( "" ) ) ) {
if ( details )
details->_elemMatchKey = z.fieldName();
return 1;
}
}
}
else {
if ( valuesMatch( z, toMatch, compareOp, em) ) {
if ( details )
details->_elemMatchKey = z.fieldName();
return 1;
}
}
}
// match an entire array to itself
if ( compareOp == BSONObj::Equality && e.woCompare( toMatch , false ) == 0 ) {
return 1;
}
if ( compareOp == BSONObj::opIN && valuesMatch( e, toMatch, compareOp, em ) ) {
return 1;
}
}
else if ( e.eoo() ) {
return 0;
}
return -1;
}
extern int dump;
/* See if an object matches the query.
*/
bool Matcher::matches(const BSONObj& jsobj , MatchDetails * details ) {
/* assuming there is usually only one thing to match. if more this
could be slow sometimes. */
// check normal non-regex cases:
for ( unsigned i = 0; i < _basics.size(); i++ ) {
ElementMatcher& bm = _basics[i];
BSONElement& m = bm._toMatch;
// -1=mismatch. 0=missing element. 1=match
int cmp = matchesDotted(m.fieldName(), m, jsobj, bm._compareOp, bm , false , details );
if ( cmp == 0 && bm._compareOp == BSONObj::opEXISTS ) {
// If missing, match cmp is opposite of $exists spec.
cmp = -retExistsFound(bm);
}
if ( bm._isNot )
cmp = -cmp;
if ( cmp < 0 )
return false;
if ( cmp == 0 ) {
/* missing is ok iff we were looking for null */
if ( m.type() == jstNULL || m.type() == Undefined || ( bm._compareOp == BSONObj::opIN && bm._myset->count( staticNull.firstElement() ) > 0 ) ) {
if ( ( bm._compareOp == BSONObj::NE ) ^ bm._isNot ) {
return false;
}
}
else {
if ( !bm._isNot ) {
return false;
}
}
}
}
for ( int r = 0; r < _nRegex; r++ ) {
RegexMatcher& rm = _regexs[r];
BSONElementSet s;
if ( !_constrainIndexKey.isEmpty() ) {
BSONElement e = jsobj.getFieldUsingIndexNames(rm._fieldName, _constrainIndexKey);
// Should only have keys nested one deep here, for geo-indices
// TODO: future indices may nest deeper?
if( e.type() == Array ){
BSONObjIterator i( e.Obj() );
while( i.more() ){
s.insert( i.next() );
}
}
else if ( !e.eoo() )
s.insert( e );
}
else {
jsobj.getFieldsDotted( rm._fieldName, s );
}
bool match = false;
for( BSONElementSet::const_iterator i = s.begin(); i != s.end(); ++i )
if ( regexMatches(rm, *i) )
match = true;
if ( !match ^ rm._isNot )
return false;
}
if ( _orDedupConstraints.size() > 0 ) {
for( vector< shared_ptr< FieldRangeVector > >::const_iterator i = _orDedupConstraints.begin();
i != _orDedupConstraints.end(); ++i ) {
if ( (*i)->matches( jsobj ) ) {
return false;
}
}
}
if ( _andMatchers.size() > 0 ) {
for( list< shared_ptr< Matcher > >::const_iterator i = _andMatchers.begin();
i != _andMatchers.end(); ++i ) {
// SERVER-3192 Track field matched using details the same as for
// top level fields, at least for now.
if ( !(*i)->matches( jsobj, details ) ) {
return false;
}
}
}
if ( _orMatchers.size() > 0 ) {
bool match = false;
for( list< shared_ptr< Matcher > >::const_iterator i = _orMatchers.begin();
i != _orMatchers.end(); ++i ) {
// SERVER-205 don't submit details - we don't want to track field
// matched within $or
if ( (*i)->matches( jsobj ) ) {
match = true;
break;
}
}
if ( !match ) {
return false;
}
}
if ( _norMatchers.size() > 0 ) {
for( list< shared_ptr< Matcher > >::const_iterator i = _norMatchers.begin();
i != _norMatchers.end(); ++i ) {
// SERVER-205 don't submit details - we don't want to track field
// matched within $nor
if ( (*i)->matches( jsobj ) ) {
return false;
}
}
}
if ( _where ) {
if ( _where->func == 0 ) {
uassert( 10070 , "$where compile error", false);
return false; // didn't compile
}
if ( _where->jsScope ) {
_where->scope->init( _where->jsScope );
}
_where->scope->setObject( "obj", const_cast< BSONObj & >( jsobj ) );
_where->scope->setBoolean( "fullObject" , true ); // this is a hack b/c fullObject used to be relevant
int err = _where->scope->invoke( _where->func , 0, &jsobj , 1000 * 60 , false );
if ( err == -3 ) { // INVOKE_ERROR
stringstream ss;
ss << "error on invocation of $where function:\n"
<< _where->scope->getError();
uassert( 10071 , ss.str(), false);
return false;
}
else if ( err != 0 ) { // ! INVOKE_SUCCESS
uassert( 10072 , "unknown error in invocation of $where function", false);
return false;
}
return _where->scope->getBoolean( "return" ) != 0;
}
return true;
}
bool Matcher::keyMatch( const Matcher &docMatcher ) const {
// Quick check certain non key match cases.
if ( docMatcher._all
|| docMatcher._haveSize
|| docMatcher._hasArray // We can't match an array to its first indexed element using keymatch
|| docMatcher._haveNeg ) {
return false;
}
// Check that all match components are available in the index matcher.
if ( !( _basics.size() == docMatcher._basics.size() && _nRegex == docMatcher._nRegex && !docMatcher._where ) ) {
return false;
}
if ( _andMatchers.size() != docMatcher._andMatchers.size() ) {
return false;
}
if ( _orMatchers.size() != docMatcher._orMatchers.size() ) {
return false;
}
if ( docMatcher._norMatchers.size() > 0 ) {
return false;
}
if ( docMatcher._orDedupConstraints.size() > 0 ) {
return false;
}
// Recursively check that all submatchers support key match.
{
list< shared_ptr< Matcher > >::const_iterator i = _andMatchers.begin();
list< shared_ptr< Matcher > >::const_iterator j = docMatcher._andMatchers.begin();
while( i != _andMatchers.end() ) {
if ( !(*i)->keyMatch( **j ) ) {
return false;
}
++i; ++j;
}
}
{
list< shared_ptr< Matcher > >::const_iterator i = _orMatchers.begin();
list< shared_ptr< Matcher > >::const_iterator j = docMatcher._orMatchers.begin();
while( i != _orMatchers.end() ) {
if ( !(*i)->keyMatch( **j ) ) {
return false;
}
++i; ++j;
}
}
// Nor matchers and or dedup constraints aren't created for index matchers,
// so no need to check those here.
return true;
}
/*- just for testing -- */
#pragma pack(1)
struct JSObj1 {
JSObj1() {
totsize=sizeof(JSObj1);
n = NumberDouble;
strcpy_s(nname, 5, "abcd");
N = 3.1;
s = String;
strcpy_s(sname, 7, "abcdef");
slen = 10;
strcpy_s(sval, 10, "123456789");
eoo = EOO;
}
unsigned totsize;
char n;
char nname[5];
double N;
char s;
char sname[7];
unsigned slen;
char sval[10];
char eoo;
};
#pragma pack()
struct JSObj1 js1;
#pragma pack(1)
struct JSObj2 {
JSObj2() {
totsize=sizeof(JSObj2);
s = String;
strcpy_s(sname, 7, "abcdef");
slen = 10;
strcpy_s(sval, 10, "123456789");
eoo = EOO;
}
unsigned totsize;
char s;
char sname[7];
unsigned slen;
char sval[10];
char eoo;
} js2;
struct JSUnitTest : public UnitTest {
void run() {
BSONObj j1((const char *) &js1);
BSONObj j2((const char *) &js2);
Matcher m(j2);
assert( m.matches(j1) );
js2.sval[0] = 'z';
assert( !m.matches(j1) );
Matcher n(j1);
assert( n.matches(j1) );
assert( !n.matches(j2) );
BSONObj j0 = BSONObj();
// BSONObj j0((const char *) &js0);
Matcher p(j0);
assert( p.matches(j1) );
assert( p.matches(j2) );
}
} jsunittest;
#pragma pack()
struct RXTest : public UnitTest {
RXTest() {
}
void run() {
/*
static const boost::regex e("(\\d{4}[- ]){3}\\d{4}");
static const boost::regex b(".....");
out() << "regex result: " << regex_match("hello", e) << endl;
out() << "regex result: " << regex_match("abcoo", b) << endl;
*/
int ret = 0;
pcre_config( PCRE_CONFIG_UTF8 , &ret );
massert( 10342 , "pcre not compiled with utf8 support" , ret );
pcrecpp::RE re1(")({a}h.*o");
pcrecpp::RE re("h.llo");
assert( re.FullMatch("hello") );
assert( !re1.FullMatch("hello") );
pcrecpp::RE_Options options;
options.set_utf8(true);
pcrecpp::RE part("dwi", options);
assert( part.PartialMatch("dwight") );
pcre_config( PCRE_CONFIG_UNICODE_PROPERTIES , &ret );
if ( ! ret )
cout << "warning: some regex utf8 things will not work. pcre build doesn't have --enable-unicode-properties" << endl;
}
} rxtest;
} // namespace mongo
|