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
|
/*
Functions and classes which keep track of and use regexes to classify streams
of application data.
By Ethan Sommer <sommere@users.sf.net> and Matthew Strait
<quadong@users.sf.net>, (C) 2006-2007
http://l7-filter.sf.net
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version
2 of the License, or (at your option) any later version.
http://www.gnu.org/licenses/gpl.txt
*/
using namespace std;
#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
#include <string>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <signal.h>
#include <dirent.h>
#define MAX_SUBDIRS 128
#define MAX_FN_LEN 256
string l7dir = "/etc/l7-protocols";
// by default, take the whole thing.
// The second two are derivable from the first. They're here for convenience.
unsigned int markmask = 0xffffffff; // the mask itself
unsigned int maskfirstbit = 0; // how far from the LSB does our region start?
unsigned int masknbits = 32;
#include "l7-classify.h"
#include "l7-queue.h"
#include "l7-parse-patterns.h"
#include "util.h"
l7_pattern::l7_pattern(string name, string pattern_string, int eflags,
int cflags, int mark)
{
this->name = name;
this->pattern_string = pattern_string;
this->eflags = eflags;
this->cflags = cflags;
this->mark = mark;
char *preprocessed = pre_process(pattern_string.c_str());
int rc = regcomp(&preg, preprocessed, cflags);
if (rc != 0){
cerr << "error compiling " << name << " -- " << pattern_string << endl;
exit(1);
}
free(preprocessed);
}
int l7_pattern::hex2dec(char c)
{
switch (c){
case '0' ... '9':
return c - '0';
case 'a' ... 'f':
return c - 'a' + 10;
case 'A' ... 'F':
return c - 'A' + 10;
default:
cerr << "Bad hex digit, " << c << ", in regular expression!" << endl;
exit(1);
}
}
char * l7_pattern::pre_process(const char * s)
{
char * result = (char *)malloc(strlen(s) + 1);
unsigned int sindex = 0, rindex = 0;
while( sindex < strlen(s) ) {
if( sindex + 3 < strlen(s) && s[sindex] == '\\' && s[sindex+1] == 'x' &&
isxdigit(s[sindex + 2]) && isxdigit(s[sindex + 3]) ){
result[rindex] = hex2dec(s[sindex + 2])*16 + hex2dec(s[sindex + 3]);
switch ( result[rindex] ) {
case '$':
case '(':
case ')':
case '*':
case '+':
case '.':
case '?':
case '[':
case ']':
case '^':
case '|':
case '{':
case '}':
case '\\':
cerr << "Warning: regexp contains a regexp control character, "
<< result[rindex] << ", in hex (\\x" << s[sindex + 2]
<< s[sindex+3] << ".\nI recommend that you write this as "
<< result[rindex] << " or \\" << result[rindex]
<< " depending on what you meant.\n";
break;
case '\0':
cerr << "Warning: null (\\x00) in layer7 regexp. "
<< "A null terminates the regexp string!\n";
break;
default:
break;
}
sindex += 3; /* 4 total */
}
else
result[rindex] = s[sindex];
sindex++;
rindex++;
}
result[rindex] = '\0';
return result;
}
bool l7_pattern::matches(char *buffer)
{
int rc = regexec(&preg, buffer, 0, NULL, eflags);
if(rc == 0) return true;
else return false;
}
string l7_pattern::getName()
{
return name;
}
int l7_pattern::getMark()
{
return mark;
}
static char ** readl7dir(string dirname)
{
DIR * scratchdir;
struct dirent ** namelist;
char ** subdirs = (char **)malloc(MAX_SUBDIRS * sizeof(char *));
int n, d = 1;
subdirs[0] = ""; // generates warning with newer gcc versions
n = scandir(dirname.c_str(), &namelist, 0, alphasort);
if (n < 0){
perror(dirname.c_str());
cerr << "Couldn't open patterns directory at " << dirname << endl;
exit(1);
}
else{
while(n--){
char fulldirname[MAX_FN_LEN];
snprintf(fulldirname, MAX_FN_LEN, "%s/%s", dirname.c_str(),
namelist[n]->d_name);
if((scratchdir = opendir(fulldirname)) != NULL)
{
closedir(scratchdir);
if(!strcmp(namelist[n]->d_name, ".") ||
!strcmp(namelist[n]->d_name, ".."))
/* do nothing */ ;
else{
subdirs[d] = (char *)malloc(strlen(namelist[n]->d_name) + 1);
strcpy(subdirs[d], namelist[n]->d_name);
d++;
if(d >= MAX_SUBDIRS - 1)
{
cerr << "Too many subdirectories, skipping the rest!\n";
break;
}
}
}
free(namelist[n]);
}
free(namelist);
}
subdirs[d] = NULL;
return subdirs;
}
static string findpatternfile(string protocol)
{
char filename[MAX_FN_LEN];
char ** subdirs;
int n = 0;
subdirs = readl7dir(l7dir);
while(subdirs[n] != NULL){
int c = snprintf(filename, MAX_FN_LEN, "%s/%s/%s.pat", l7dir.c_str(),
subdirs[n], protocol.c_str());
if(c > MAX_FN_LEN){
cerr << "Filename beginning with " << filename << " is too long!\n";
exit(1);
}
ifstream test(filename);
/* read in the pattern from the file */
if(test.is_open()){
test.close();
string answer = filename;
return answer;
}
n++;
}
cerr << "Couldn't find a pattern definition file for " << protocol << endl;
exit(1);
}
// Loads in the configuration file
l7_classify::l7_classify(string filename)
{
string line;
int nrules = 0;
int discussedbitusage = 0;
ifstream conf(filename.c_str());
l7printf(2, "Attempting to read configuration from %s\n", filename.c_str());
if(!conf.is_open()){
cerr << "Could not read from " << filename << endl;
exit(1);
}
while(getline(conf, line)){
stringstream sline;
string proto, patternfile;
unsigned int mk;
bool nothingbutspaces = true;
// Lines starting with # are comments
if(line[0] == '#') continue;
// blank lines are ignored
for(unsigned int i = 0; i < line.size(); i++)
if(!isspace(line[i])) nothingbutspaces = false;
if(nothingbutspaces) continue;
sline << line;
if(!(sline >> proto) || !(sline >> mk)){
cerr << "Ignoring line because it isn't in the format 'protocol mark':"
<< line << endl;
continue;
}
if(mk <= 1 || mk >= (markmask >> maskfirstbit) ){
cerr << "Ignoring line because the mark is not in the range 3-"
<< (markmask >> maskfirstbit) << ":\n" << line << endl;
if(!discussedbitusage){
cerr << "Your mask allows me to use " << masknbits
<< " bits, and the values 0, 1 and 2 have special meanings.\n";
discussedbitusage = 1;
}
continue;
}
patternfile = findpatternfile(proto);
if(add_pattern_from_file(patternfile, mk)){
nrules++;
if(markmask == 0xffffffff)
l7printf(0, "Added: %s\tmark=%d\n", proto.c_str(), mk);
else
l7printf(0, "Added: %s\tGiven mark=%d\t"
"Actual mark (after applying mask)=%#08x\n",
proto.c_str(), mk, (mk << maskfirstbit));
}
}
if(nrules < 1){
cerr << "No valid rules, exiting.\n";
exit(1);
}
}
l7_classify::~l7_classify()
{
}
// Returns 1 on sucess, 0 on failure
int l7_classify::add_pattern_from_file(string filename, int mark)
{
int eflags, cflags;
string pattern = "";
l7printf(2, "Attempting to load pattern from %s\n", filename.c_str());
if(!parse_pattern_file(cflags, eflags, pattern, filename)){
cerr << "Failed to parse pattern file " << filename << endl;
return 0;
}
l7printf(2, "pattern='%s'\n", pattern.c_str());
l7printf(2, "eflags=%d cflags=%d\n", eflags, cflags);
l7_pattern *l7p=new l7_pattern(basename(filename),pattern,eflags,cflags,mark);
patterns.push_back(l7p);
return 1;
}
int l7_classify::classify(char * buffer)
{
list<l7_pattern *>::iterator current = patterns.begin();
while (current != patterns.end()) {
l7printf(3, "checking against %s\n", (*current)->getName().c_str());
if((*current)->matches(buffer)){
l7printf(1, "matched %s\n", (*current)->getName().c_str());
return (*current)->getMark();
}
current++;
}
l7printf(3, "No match yet\n");
return NO_MATCH_YET;
}
|