This file is indexed.

/usr/include/mongo/db/minilex.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
// minilex.h
// mini js lexical analyzer.  idea is to be dumb and fast.

/**
*    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/>.
*/

#error does anything use this?

namespace mongo {

#if defined(_WIN32)

} // namespace mongo

#include <hash_map>
using namespace stdext;

namespace mongo {

    typedef const char * MyStr;
    struct less_str {
        bool operator()(const MyStr & x, const MyStr & y) const {
            if ( strcmp(x, y) > 0)
                return true;

            return false;
        }
    };

    typedef hash_map<const char*, int, hash_compare<const char *, less_str> > strhashmap;

#else

} // namespace mongo

#include <ext/hash_map>

namespace mongo {

    using namespace __gnu_cxx;

    typedef const char * MyStr;
    struct eq_str {
        bool operator()(const MyStr & x, const MyStr & y) const {
            if ( strcmp(x, y) == 0)
                return true;

            return false;
        }
    };

    typedef hash_map<const char*, int, hash<const char *>, eq_str > strhashmap;

#endif

    /*
    struct MiniLexNotUsed {
        strhashmap reserved;
        bool ic[256]; // ic=Identifier Character
        bool starter[256];

        // dm: very dumb about comments and escaped quotes -- but we are faster then at least,
        // albeit returning too much (which is ok for jsbobj current usage).
        void grabVariables(char *code , strhashmap& vars) { // 'code' modified and must stay in scope*/
    char *p = code;
    char last = 0;
    while ( *p ) {
        if ( starter[*p] ) {
            char *q = p+1;
            while ( *q && ic[*q] ) q++;
            const char *identifier = p;
            bool done = *q == 0;
            *q = 0;
            if ( !reserved.count(identifier) ) {
                // we try to be smart about 'obj' but have to be careful as obj.obj
                // can happen; this is so that nFields is right for simplistic where cases
                // so we can stop scanning in jsobj when we find the field of interest.
                if ( strcmp(identifier,"obj")==0 && p>code && p[-1] != '.' )
                    ;
                else
                    vars[identifier] = 1;
            }
            if ( done )
                break;
            p = q + 1;
            continue;
        }

        if ( *p == '\'' ) {
            p++;
            while ( *p && *p != '\'' ) p++;
        }
        else if ( *p == '"' ) {
            p++;
            while ( *p && *p != '"' ) p++;
        }
        p++;
    }
}

MiniLex() {
    strhashmap atest;
    atest["foo"] = 3;
    verify( atest.count("bar") == 0 );
    verify( atest.count("foo") == 1 );
    verify( atest["foo"] == 3 );

    for ( int i = 0; i < 256; i++ ) {
        ic[i] = starter[i] = false;
    }
    for ( int i = 'a'; i <= 'z'; i++ )
        ic[i] = starter[i] = true;
    for ( int i = 'A'; i <= 'Z'; i++ )
        ic[i] = starter[i] = true;
    for ( int i = '0'; i <= '9'; i++ )
        ic[i] = true;
    for ( int i = 128; i < 256; i++ )
        ic[i] = starter[i] = true;
    ic['$'] = starter['$'] = true;
    ic['_'] = starter['_'] = true;

    reserved["break"] = true;
    reserved["case"] = true;
    reserved["catch"] = true;
    reserved["continue"] = true;
    reserved["default"] = true;
    reserved["delete"] = true;
    reserved["do"] = true;
    reserved["else"] = true;
    reserved["finally"] = true;
    reserved["for"] = true;
    reserved["function"] = true;
    reserved["if"] = true;
    reserved["in"] = true;
    reserved["instanceof"] = true;
    reserved["new"] = true;
    reserved["return"] = true;
    reserved["switch"] = true;
    reserved["this"] = true;
    reserved["throw"] = true;
    reserved["try"] = true;
    reserved["typeof"] = true;
    reserved["var"] = true;
    reserved["void"] = true;
    reserved["while"] = true;
    reserved["with "] = true;
}
};
*/

} // namespace mongo