ISA/filters.cc at master · H00N24/ISA · GitHub

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
/**
 * filters.cc
 * LDAP server - ISA 2017/2018
 * Author: Ondrej Kurak
 * Mail: xkurak00@stud.fit.vutbr.cz
 **/

#include "ldap_fsm.h"


/** Loading of filter
 * Recursive loading filtes to tree like structure
 * @return Tree like structure of filters
*/
Filter LDAP_parser::get_filter() {
    Filter f;
    f.type = ch;
    if(DEBUG) cerr << "Filter type: ";
    switch (f.type) {
        case EQUALITY:
            if(DEBUG) cerr << "Equality" << endl;
            break;
        case SUBSTRING:
            if(DEBUG) cerr << "Substring" << endl;
            break;
        case AND:
            if(DEBUG) cerr << "and" << endl;
            break;
        case OR:
            if(DEBUG) cerr << "Or" << endl;
            break;
        case NOT:
            if(DEBUG) cerr << "Neg" << endl;
            break;
        default:
            if(DEBUG) cerr << "Unknown" << endl;
        return f;
    }
    next();
    f.length = get_ll();
    if(DEBUG) cerr << "Length: " << f.length << endl;

    if (f.type != EQUALITY && f.type != SUBSTRING) {
        int tmp_len = f.length;
        while (tmp_len) {
            f.filters.push_back(get_filter());
            tmp_len -= 2 + f.filters.back().length;
        }
    }

    if (f.type == EQUALITY) {
         if (ch != 0x04) {
            f.type = -1;
            return f;
        }
        next();

        f.what = get_string();
        transform(f.what.begin(),
                  f.what.end(),
                  f.what.begin(),
                  ::tolower);
        f.w = f.known[f.what];
        if(DEBUG) cerr << "AttributeDesc: " << f.what << endl;
            if (ch != 0x04) {
                f.type = -1;
                return f;
            }
            next();

            f.value = get_string();
            if(DEBUG) cerr << "AssertValue: " << f.value << endl;
    }

    if (f.type == SUBSTRING) {
         if (ch != 0x04) {
            f.type = -1;
            return f;
        }
        next();

        f.what = get_string();
        transform(f.what.begin(),
                  f.what.end(),
                  f.what.begin(),
                  ::tolower);
        f.w = f.known[f.what];
        if(DEBUG) cerr << "AttributeDesc: " << f.what << endl;
        if (ch != 0x30) {
            f.type = -1;
            return f;
        }
        next();

        int tmp_len = get_ll();
        string tmp_str;
        while(tmp_len) {
            unsigned char val = ch;
            next();

            tmp_str = get_string();
            switch (val) {
                case 0x80:
                    f.value += tmp_str + ".*";
                    break;
                case 0x81:
                    f.value += ".*" + tmp_str + ".*";
                    break;
                case 0x82:
                    f.value += ".*" + tmp_str;
                    break;
                default:
                    f.type = -1;
                    return f;
            }

            tmp_len -= 2 + tmp_str.length();
        }
        if(DEBUG) cerr << "AssertValue: " << f.value << endl;
    }
    return f;
}

/** Printing filters
 * Prints all filters
*/
void LDAP_parser::print_filters(Filter f) {
    switch (f.type) {
        case EQUALITY:
            if(DEBUG) cerr << "Equality ";
            break;
        case SUBSTRING:
            if(DEBUG) cerr << "Substring ";
            break;
        case AND:
            if(DEBUG) cerr << "And ";
            break;
        case OR:
            if(DEBUG) cerr << "Or ";
            break;
        case NOT:
            if(DEBUG) cerr << "Neg ";
            break;
        default:
            if(DEBUG) cerr << "Unknown ";
    }
    if(DEBUG) cerr << f.filters.size() << endl;

    for (auto i: f.filters) {
        if(DEBUG) cerr << "-> ";
        print_filters(i);
    }
}

/** Resolving filters
 * Recursively resolves all filters in Filter
 * @return entrys for filter
*/
set<vector<string>> LDAP_parser::resolve_filters(Filter f) {
    set<vector<string>> result;
    if (f.type == EQUALITY || f.type == SUBSTRING) {
        for (auto i: data) {
            if (regex_match(i[f.w], regex(f.value, ECMAScript | icase))) {
                result.emplace(i);
            }
        }
    }

    if (f.type == NOT) {
        set<vector<string>> tmp = resolve_filters(f.filters[0]);
        for (auto i: data) {
            if (tmp.find(i) == tmp.end()) {
                result.emplace(i);
            }
        }
    }

    if (f.type == OR) {
        for (auto i: f.filters) {
            set<vector<string>> tmp = resolve_filters(i);
            result.insert(tmp.begin(), tmp.end());
        }
    }

    if (f.type == AND) {
        result = resolve_filters(f.filters[0]);
        for (auto i: f.filters) {
            set<vector<string>> tmp = resolve_filters(i);
            set<vector<string>> tmp1 = result;
            result.clear();
            set_intersection(tmp1.begin(), tmp1.end(),
                             tmp.begin(), tmp.end(),
                             inserter(result, result.begin()));
        }
    }

    return result;
}