parse-filter.c 52 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442
  1. /*
  2. * Copyright (C) 2010 Red Hat Inc, Steven Rostedt <srostedt@redhat.com>
  3. *
  4. * ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  5. * This program is free software; you can redistribute it and/or
  6. * modify it under the terms of the GNU Lesser General Public
  7. * License as published by the Free Software Foundation;
  8. * version 2.1 of the License (not later!)
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU Lesser General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU Lesser General Public
  16. * License along with this program; if not, see <http://www.gnu.org/licenses>
  17. *
  18. * ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  19. */
  20. #include <stdio.h>
  21. #include <stdlib.h>
  22. #include <string.h>
  23. #include <stdarg.h>
  24. #include <errno.h>
  25. #include <sys/types.h>
  26. #include "event-parse.h"
  27. #include "event-utils.h"
  28. #define COMM "COMM"
  29. static struct format_field comm = {
  30. .name = "COMM",
  31. };
  32. struct event_list {
  33. struct event_list *next;
  34. struct event_format *event;
  35. };
  36. static void show_error(char *error_buf, const char *fmt, ...)
  37. {
  38. unsigned long long index;
  39. const char *input;
  40. va_list ap;
  41. int len;
  42. int i;
  43. input = pevent_get_input_buf();
  44. index = pevent_get_input_buf_ptr();
  45. len = input ? strlen(input) : 0;
  46. if (len) {
  47. strcpy(error_buf, input);
  48. error_buf[len] = '\n';
  49. for (i = 1; i < len && i < index; i++)
  50. error_buf[len+i] = ' ';
  51. error_buf[len + i] = '^';
  52. error_buf[len + i + 1] = '\n';
  53. len += i+2;
  54. }
  55. va_start(ap, fmt);
  56. vsnprintf(error_buf + len, PEVENT_FILTER_ERROR_BUFSZ - len, fmt, ap);
  57. va_end(ap);
  58. }
  59. static void free_token(char *token)
  60. {
  61. pevent_free_token(token);
  62. }
  63. static enum event_type read_token(char **tok)
  64. {
  65. enum event_type type;
  66. char *token = NULL;
  67. do {
  68. free_token(token);
  69. type = pevent_read_token(&token);
  70. } while (type == EVENT_NEWLINE || type == EVENT_SPACE);
  71. /* If token is = or ! check to see if the next char is ~ */
  72. if (token &&
  73. (strcmp(token, "=") == 0 || strcmp(token, "!") == 0) &&
  74. pevent_peek_char() == '~') {
  75. /* append it */
  76. *tok = malloc(3);
  77. if (*tok == NULL) {
  78. free_token(token);
  79. return EVENT_ERROR;
  80. }
  81. sprintf(*tok, "%c%c", *token, '~');
  82. free_token(token);
  83. /* Now remove the '~' from the buffer */
  84. pevent_read_token(&token);
  85. free_token(token);
  86. } else
  87. *tok = token;
  88. return type;
  89. }
  90. static int filter_cmp(const void *a, const void *b)
  91. {
  92. const struct filter_type *ea = a;
  93. const struct filter_type *eb = b;
  94. if (ea->event_id < eb->event_id)
  95. return -1;
  96. if (ea->event_id > eb->event_id)
  97. return 1;
  98. return 0;
  99. }
  100. static struct filter_type *
  101. find_filter_type(struct event_filter *filter, int id)
  102. {
  103. struct filter_type *filter_type;
  104. struct filter_type key;
  105. key.event_id = id;
  106. filter_type = bsearch(&key, filter->event_filters,
  107. filter->filters,
  108. sizeof(*filter->event_filters),
  109. filter_cmp);
  110. return filter_type;
  111. }
  112. static struct filter_type *
  113. add_filter_type(struct event_filter *filter, int id)
  114. {
  115. struct filter_type *filter_type;
  116. int i;
  117. filter_type = find_filter_type(filter, id);
  118. if (filter_type)
  119. return filter_type;
  120. filter_type = realloc(filter->event_filters,
  121. sizeof(*filter->event_filters) *
  122. (filter->filters + 1));
  123. if (!filter_type)
  124. return NULL;
  125. filter->event_filters = filter_type;
  126. for (i = 0; i < filter->filters; i++) {
  127. if (filter->event_filters[i].event_id > id)
  128. break;
  129. }
  130. if (i < filter->filters)
  131. memmove(&filter->event_filters[i+1],
  132. &filter->event_filters[i],
  133. sizeof(*filter->event_filters) *
  134. (filter->filters - i));
  135. filter_type = &filter->event_filters[i];
  136. filter_type->event_id = id;
  137. filter_type->event = pevent_find_event(filter->pevent, id);
  138. filter_type->filter = NULL;
  139. filter->filters++;
  140. return filter_type;
  141. }
  142. /**
  143. * pevent_filter_alloc - create a new event filter
  144. * @pevent: The pevent that this filter is associated with
  145. */
  146. struct event_filter *pevent_filter_alloc(struct pevent *pevent)
  147. {
  148. struct event_filter *filter;
  149. filter = malloc(sizeof(*filter));
  150. if (filter == NULL)
  151. return NULL;
  152. memset(filter, 0, sizeof(*filter));
  153. filter->pevent = pevent;
  154. pevent_ref(pevent);
  155. return filter;
  156. }
  157. static struct filter_arg *allocate_arg(void)
  158. {
  159. return calloc(1, sizeof(struct filter_arg));
  160. }
  161. static void free_arg(struct filter_arg *arg)
  162. {
  163. if (!arg)
  164. return;
  165. switch (arg->type) {
  166. case FILTER_ARG_NONE:
  167. case FILTER_ARG_BOOLEAN:
  168. break;
  169. case FILTER_ARG_NUM:
  170. free_arg(arg->num.left);
  171. free_arg(arg->num.right);
  172. break;
  173. case FILTER_ARG_EXP:
  174. free_arg(arg->exp.left);
  175. free_arg(arg->exp.right);
  176. break;
  177. case FILTER_ARG_STR:
  178. free(arg->str.val);
  179. regfree(&arg->str.reg);
  180. free(arg->str.buffer);
  181. break;
  182. case FILTER_ARG_VALUE:
  183. if (arg->value.type == FILTER_STRING ||
  184. arg->value.type == FILTER_CHAR)
  185. free(arg->value.str);
  186. break;
  187. case FILTER_ARG_OP:
  188. free_arg(arg->op.left);
  189. free_arg(arg->op.right);
  190. default:
  191. break;
  192. }
  193. free(arg);
  194. }
  195. static int add_event(struct event_list **events,
  196. struct event_format *event)
  197. {
  198. struct event_list *list;
  199. list = malloc(sizeof(*list));
  200. if (list == NULL)
  201. return -1;
  202. list->next = *events;
  203. *events = list;
  204. list->event = event;
  205. return 0;
  206. }
  207. static int event_match(struct event_format *event,
  208. regex_t *sreg, regex_t *ereg)
  209. {
  210. if (sreg) {
  211. return !regexec(sreg, event->system, 0, NULL, 0) &&
  212. !regexec(ereg, event->name, 0, NULL, 0);
  213. }
  214. return !regexec(ereg, event->system, 0, NULL, 0) ||
  215. !regexec(ereg, event->name, 0, NULL, 0);
  216. }
  217. static enum pevent_errno
  218. find_event(struct pevent *pevent, struct event_list **events,
  219. char *sys_name, char *event_name)
  220. {
  221. struct event_format *event;
  222. regex_t ereg;
  223. regex_t sreg;
  224. int match = 0;
  225. int fail = 0;
  226. char *reg;
  227. int ret;
  228. int i;
  229. if (!event_name) {
  230. /* if no name is given, then swap sys and name */
  231. event_name = sys_name;
  232. sys_name = NULL;
  233. }
  234. reg = malloc(strlen(event_name) + 3);
  235. if (reg == NULL)
  236. return PEVENT_ERRNO__MEM_ALLOC_FAILED;
  237. sprintf(reg, "^%s$", event_name);
  238. ret = regcomp(&ereg, reg, REG_ICASE|REG_NOSUB);
  239. free(reg);
  240. if (ret)
  241. return PEVENT_ERRNO__INVALID_EVENT_NAME;
  242. if (sys_name) {
  243. reg = malloc(strlen(sys_name) + 3);
  244. if (reg == NULL) {
  245. regfree(&ereg);
  246. return PEVENT_ERRNO__MEM_ALLOC_FAILED;
  247. }
  248. sprintf(reg, "^%s$", sys_name);
  249. ret = regcomp(&sreg, reg, REG_ICASE|REG_NOSUB);
  250. free(reg);
  251. if (ret) {
  252. regfree(&ereg);
  253. return PEVENT_ERRNO__INVALID_EVENT_NAME;
  254. }
  255. }
  256. for (i = 0; i < pevent->nr_events; i++) {
  257. event = pevent->events[i];
  258. if (event_match(event, sys_name ? &sreg : NULL, &ereg)) {
  259. match = 1;
  260. if (add_event(events, event) < 0) {
  261. fail = 1;
  262. break;
  263. }
  264. }
  265. }
  266. regfree(&ereg);
  267. if (sys_name)
  268. regfree(&sreg);
  269. if (!match)
  270. return PEVENT_ERRNO__EVENT_NOT_FOUND;
  271. if (fail)
  272. return PEVENT_ERRNO__MEM_ALLOC_FAILED;
  273. return 0;
  274. }
  275. static void free_events(struct event_list *events)
  276. {
  277. struct event_list *event;
  278. while (events) {
  279. event = events;
  280. events = events->next;
  281. free(event);
  282. }
  283. }
  284. static enum pevent_errno
  285. create_arg_item(struct event_format *event, const char *token,
  286. enum event_type type, struct filter_arg **parg, char *error_str)
  287. {
  288. struct format_field *field;
  289. struct filter_arg *arg;
  290. arg = allocate_arg();
  291. if (arg == NULL) {
  292. show_error(error_str, "failed to allocate filter arg");
  293. return PEVENT_ERRNO__MEM_ALLOC_FAILED;
  294. }
  295. switch (type) {
  296. case EVENT_SQUOTE:
  297. case EVENT_DQUOTE:
  298. arg->type = FILTER_ARG_VALUE;
  299. arg->value.type =
  300. type == EVENT_DQUOTE ? FILTER_STRING : FILTER_CHAR;
  301. arg->value.str = strdup(token);
  302. if (!arg->value.str) {
  303. free_arg(arg);
  304. show_error(error_str, "failed to allocate string filter arg");
  305. return PEVENT_ERRNO__MEM_ALLOC_FAILED;
  306. }
  307. break;
  308. case EVENT_ITEM:
  309. /* if it is a number, then convert it */
  310. if (isdigit(token[0])) {
  311. arg->type = FILTER_ARG_VALUE;
  312. arg->value.type = FILTER_NUMBER;
  313. arg->value.val = strtoull(token, NULL, 0);
  314. break;
  315. }
  316. /* Consider this a field */
  317. field = pevent_find_any_field(event, token);
  318. if (!field) {
  319. if (strcmp(token, COMM) != 0) {
  320. /* not a field, Make it false */
  321. arg->type = FILTER_ARG_BOOLEAN;
  322. arg->boolean.value = FILTER_FALSE;
  323. break;
  324. }
  325. /* If token is 'COMM' then it is special */
  326. field = &comm;
  327. }
  328. arg->type = FILTER_ARG_FIELD;
  329. arg->field.field = field;
  330. break;
  331. default:
  332. free_arg(arg);
  333. show_error(error_str, "expected a value but found %s", token);
  334. return PEVENT_ERRNO__UNEXPECTED_TYPE;
  335. }
  336. *parg = arg;
  337. return 0;
  338. }
  339. static struct filter_arg *
  340. create_arg_op(enum filter_op_type btype)
  341. {
  342. struct filter_arg *arg;
  343. arg = allocate_arg();
  344. if (!arg)
  345. return NULL;
  346. arg->type = FILTER_ARG_OP;
  347. arg->op.type = btype;
  348. return arg;
  349. }
  350. static struct filter_arg *
  351. create_arg_exp(enum filter_exp_type etype)
  352. {
  353. struct filter_arg *arg;
  354. arg = allocate_arg();
  355. if (!arg)
  356. return NULL;
  357. arg->type = FILTER_ARG_EXP;
  358. arg->op.type = etype;
  359. return arg;
  360. }
  361. static struct filter_arg *
  362. create_arg_cmp(enum filter_exp_type etype)
  363. {
  364. struct filter_arg *arg;
  365. arg = allocate_arg();
  366. if (!arg)
  367. return NULL;
  368. /* Use NUM and change if necessary */
  369. arg->type = FILTER_ARG_NUM;
  370. arg->op.type = etype;
  371. return arg;
  372. }
  373. static enum pevent_errno
  374. add_right(struct filter_arg *op, struct filter_arg *arg, char *error_str)
  375. {
  376. struct filter_arg *left;
  377. char *str;
  378. int op_type;
  379. int ret;
  380. switch (op->type) {
  381. case FILTER_ARG_EXP:
  382. if (op->exp.right)
  383. goto out_fail;
  384. op->exp.right = arg;
  385. break;
  386. case FILTER_ARG_OP:
  387. if (op->op.right)
  388. goto out_fail;
  389. op->op.right = arg;
  390. break;
  391. case FILTER_ARG_NUM:
  392. if (op->op.right)
  393. goto out_fail;
  394. /*
  395. * The arg must be num, str, or field
  396. */
  397. switch (arg->type) {
  398. case FILTER_ARG_VALUE:
  399. case FILTER_ARG_FIELD:
  400. break;
  401. default:
  402. show_error(error_str, "Illegal rvalue");
  403. return PEVENT_ERRNO__ILLEGAL_RVALUE;
  404. }
  405. /*
  406. * Depending on the type, we may need to
  407. * convert this to a string or regex.
  408. */
  409. switch (arg->value.type) {
  410. case FILTER_CHAR:
  411. /*
  412. * A char should be converted to number if
  413. * the string is 1 byte, and the compare
  414. * is not a REGEX.
  415. */
  416. if (strlen(arg->value.str) == 1 &&
  417. op->num.type != FILTER_CMP_REGEX &&
  418. op->num.type != FILTER_CMP_NOT_REGEX) {
  419. arg->value.type = FILTER_NUMBER;
  420. goto do_int;
  421. }
  422. /* fall through */
  423. case FILTER_STRING:
  424. /* convert op to a string arg */
  425. op_type = op->num.type;
  426. left = op->num.left;
  427. str = arg->value.str;
  428. /* reset the op for the new field */
  429. memset(op, 0, sizeof(*op));
  430. /*
  431. * If left arg was a field not found then
  432. * NULL the entire op.
  433. */
  434. if (left->type == FILTER_ARG_BOOLEAN) {
  435. free_arg(left);
  436. free_arg(arg);
  437. op->type = FILTER_ARG_BOOLEAN;
  438. op->boolean.value = FILTER_FALSE;
  439. break;
  440. }
  441. /* Left arg must be a field */
  442. if (left->type != FILTER_ARG_FIELD) {
  443. show_error(error_str,
  444. "Illegal lvalue for string comparison");
  445. return PEVENT_ERRNO__ILLEGAL_LVALUE;
  446. }
  447. /* Make sure this is a valid string compare */
  448. switch (op_type) {
  449. case FILTER_CMP_EQ:
  450. op_type = FILTER_CMP_MATCH;
  451. break;
  452. case FILTER_CMP_NE:
  453. op_type = FILTER_CMP_NOT_MATCH;
  454. break;
  455. case FILTER_CMP_REGEX:
  456. case FILTER_CMP_NOT_REGEX:
  457. ret = regcomp(&op->str.reg, str, REG_ICASE|REG_NOSUB);
  458. if (ret) {
  459. show_error(error_str,
  460. "RegEx '%s' did not compute",
  461. str);
  462. return PEVENT_ERRNO__INVALID_REGEX;
  463. }
  464. break;
  465. default:
  466. show_error(error_str,
  467. "Illegal comparison for string");
  468. return PEVENT_ERRNO__ILLEGAL_STRING_CMP;
  469. }
  470. op->type = FILTER_ARG_STR;
  471. op->str.type = op_type;
  472. op->str.field = left->field.field;
  473. op->str.val = strdup(str);
  474. if (!op->str.val) {
  475. show_error(error_str, "Failed to allocate string filter");
  476. return PEVENT_ERRNO__MEM_ALLOC_FAILED;
  477. }
  478. /*
  479. * Need a buffer to copy data for tests
  480. */
  481. op->str.buffer = malloc(op->str.field->size + 1);
  482. if (!op->str.buffer) {
  483. show_error(error_str, "Failed to allocate string filter");
  484. return PEVENT_ERRNO__MEM_ALLOC_FAILED;
  485. }
  486. /* Null terminate this buffer */
  487. op->str.buffer[op->str.field->size] = 0;
  488. /* We no longer have left or right args */
  489. free_arg(arg);
  490. free_arg(left);
  491. break;
  492. case FILTER_NUMBER:
  493. do_int:
  494. switch (op->num.type) {
  495. case FILTER_CMP_REGEX:
  496. case FILTER_CMP_NOT_REGEX:
  497. show_error(error_str,
  498. "Op not allowed with integers");
  499. return PEVENT_ERRNO__ILLEGAL_INTEGER_CMP;
  500. default:
  501. break;
  502. }
  503. /* numeric compare */
  504. op->num.right = arg;
  505. break;
  506. default:
  507. goto out_fail;
  508. }
  509. break;
  510. default:
  511. goto out_fail;
  512. }
  513. return 0;
  514. out_fail:
  515. show_error(error_str, "Syntax error");
  516. return PEVENT_ERRNO__SYNTAX_ERROR;
  517. }
  518. static struct filter_arg *
  519. rotate_op_right(struct filter_arg *a, struct filter_arg *b)
  520. {
  521. struct filter_arg *arg;
  522. arg = a->op.right;
  523. a->op.right = b;
  524. return arg;
  525. }
  526. static enum pevent_errno add_left(struct filter_arg *op, struct filter_arg *arg)
  527. {
  528. switch (op->type) {
  529. case FILTER_ARG_EXP:
  530. if (arg->type == FILTER_ARG_OP)
  531. arg = rotate_op_right(arg, op);
  532. op->exp.left = arg;
  533. break;
  534. case FILTER_ARG_OP:
  535. op->op.left = arg;
  536. break;
  537. case FILTER_ARG_NUM:
  538. if (arg->type == FILTER_ARG_OP)
  539. arg = rotate_op_right(arg, op);
  540. /* left arg of compares must be a field */
  541. if (arg->type != FILTER_ARG_FIELD &&
  542. arg->type != FILTER_ARG_BOOLEAN)
  543. return PEVENT_ERRNO__INVALID_ARG_TYPE;
  544. op->num.left = arg;
  545. break;
  546. default:
  547. return PEVENT_ERRNO__INVALID_ARG_TYPE;
  548. }
  549. return 0;
  550. }
  551. enum op_type {
  552. OP_NONE,
  553. OP_BOOL,
  554. OP_NOT,
  555. OP_EXP,
  556. OP_CMP,
  557. };
  558. static enum op_type process_op(const char *token,
  559. enum filter_op_type *btype,
  560. enum filter_cmp_type *ctype,
  561. enum filter_exp_type *etype)
  562. {
  563. *btype = FILTER_OP_NOT;
  564. *etype = FILTER_EXP_NONE;
  565. *ctype = FILTER_CMP_NONE;
  566. if (strcmp(token, "&&") == 0)
  567. *btype = FILTER_OP_AND;
  568. else if (strcmp(token, "||") == 0)
  569. *btype = FILTER_OP_OR;
  570. else if (strcmp(token, "!") == 0)
  571. return OP_NOT;
  572. if (*btype != FILTER_OP_NOT)
  573. return OP_BOOL;
  574. /* Check for value expressions */
  575. if (strcmp(token, "+") == 0) {
  576. *etype = FILTER_EXP_ADD;
  577. } else if (strcmp(token, "-") == 0) {
  578. *etype = FILTER_EXP_SUB;
  579. } else if (strcmp(token, "*") == 0) {
  580. *etype = FILTER_EXP_MUL;
  581. } else if (strcmp(token, "/") == 0) {
  582. *etype = FILTER_EXP_DIV;
  583. } else if (strcmp(token, "%") == 0) {
  584. *etype = FILTER_EXP_MOD;
  585. } else if (strcmp(token, ">>") == 0) {
  586. *etype = FILTER_EXP_RSHIFT;
  587. } else if (strcmp(token, "<<") == 0) {
  588. *etype = FILTER_EXP_LSHIFT;
  589. } else if (strcmp(token, "&") == 0) {
  590. *etype = FILTER_EXP_AND;
  591. } else if (strcmp(token, "|") == 0) {
  592. *etype = FILTER_EXP_OR;
  593. } else if (strcmp(token, "^") == 0) {
  594. *etype = FILTER_EXP_XOR;
  595. } else if (strcmp(token, "~") == 0)
  596. *etype = FILTER_EXP_NOT;
  597. if (*etype != FILTER_EXP_NONE)
  598. return OP_EXP;
  599. /* Check for compares */
  600. if (strcmp(token, "==") == 0)
  601. *ctype = FILTER_CMP_EQ;
  602. else if (strcmp(token, "!=") == 0)
  603. *ctype = FILTER_CMP_NE;
  604. else if (strcmp(token, "<") == 0)
  605. *ctype = FILTER_CMP_LT;
  606. else if (strcmp(token, ">") == 0)
  607. *ctype = FILTER_CMP_GT;
  608. else if (strcmp(token, "<=") == 0)
  609. *ctype = FILTER_CMP_LE;
  610. else if (strcmp(token, ">=") == 0)
  611. *ctype = FILTER_CMP_GE;
  612. else if (strcmp(token, "=~") == 0)
  613. *ctype = FILTER_CMP_REGEX;
  614. else if (strcmp(token, "!~") == 0)
  615. *ctype = FILTER_CMP_NOT_REGEX;
  616. else
  617. return OP_NONE;
  618. return OP_CMP;
  619. }
  620. static int check_op_done(struct filter_arg *arg)
  621. {
  622. switch (arg->type) {
  623. case FILTER_ARG_EXP:
  624. return arg->exp.right != NULL;
  625. case FILTER_ARG_OP:
  626. return arg->op.right != NULL;
  627. case FILTER_ARG_NUM:
  628. return arg->num.right != NULL;
  629. case FILTER_ARG_STR:
  630. /* A string conversion is always done */
  631. return 1;
  632. case FILTER_ARG_BOOLEAN:
  633. /* field not found, is ok */
  634. return 1;
  635. default:
  636. return 0;
  637. }
  638. }
  639. enum filter_vals {
  640. FILTER_VAL_NORM,
  641. FILTER_VAL_FALSE,
  642. FILTER_VAL_TRUE,
  643. };
  644. static enum pevent_errno
  645. reparent_op_arg(struct filter_arg *parent, struct filter_arg *old_child,
  646. struct filter_arg *arg, char *error_str)
  647. {
  648. struct filter_arg *other_child;
  649. struct filter_arg **ptr;
  650. if (parent->type != FILTER_ARG_OP &&
  651. arg->type != FILTER_ARG_OP) {
  652. show_error(error_str, "can not reparent other than OP");
  653. return PEVENT_ERRNO__REPARENT_NOT_OP;
  654. }
  655. /* Get the sibling */
  656. if (old_child->op.right == arg) {
  657. ptr = &old_child->op.right;
  658. other_child = old_child->op.left;
  659. } else if (old_child->op.left == arg) {
  660. ptr = &old_child->op.left;
  661. other_child = old_child->op.right;
  662. } else {
  663. show_error(error_str, "Error in reparent op, find other child");
  664. return PEVENT_ERRNO__REPARENT_FAILED;
  665. }
  666. /* Detach arg from old_child */
  667. *ptr = NULL;
  668. /* Check for root */
  669. if (parent == old_child) {
  670. free_arg(other_child);
  671. *parent = *arg;
  672. /* Free arg without recussion */
  673. free(arg);
  674. return 0;
  675. }
  676. if (parent->op.right == old_child)
  677. ptr = &parent->op.right;
  678. else if (parent->op.left == old_child)
  679. ptr = &parent->op.left;
  680. else {
  681. show_error(error_str, "Error in reparent op");
  682. return PEVENT_ERRNO__REPARENT_FAILED;
  683. }
  684. *ptr = arg;
  685. free_arg(old_child);
  686. return 0;
  687. }
  688. /* Returns either filter_vals (success) or pevent_errno (failfure) */
  689. static int test_arg(struct filter_arg *parent, struct filter_arg *arg,
  690. char *error_str)
  691. {
  692. int lval, rval;
  693. switch (arg->type) {
  694. /* bad case */
  695. case FILTER_ARG_BOOLEAN:
  696. return FILTER_VAL_FALSE + arg->boolean.value;
  697. /* good cases: */
  698. case FILTER_ARG_STR:
  699. case FILTER_ARG_VALUE:
  700. case FILTER_ARG_FIELD:
  701. return FILTER_VAL_NORM;
  702. case FILTER_ARG_EXP:
  703. lval = test_arg(arg, arg->exp.left, error_str);
  704. if (lval != FILTER_VAL_NORM)
  705. return lval;
  706. rval = test_arg(arg, arg->exp.right, error_str);
  707. if (rval != FILTER_VAL_NORM)
  708. return rval;
  709. return FILTER_VAL_NORM;
  710. case FILTER_ARG_NUM:
  711. lval = test_arg(arg, arg->num.left, error_str);
  712. if (lval != FILTER_VAL_NORM)
  713. return lval;
  714. rval = test_arg(arg, arg->num.right, error_str);
  715. if (rval != FILTER_VAL_NORM)
  716. return rval;
  717. return FILTER_VAL_NORM;
  718. case FILTER_ARG_OP:
  719. if (arg->op.type != FILTER_OP_NOT) {
  720. lval = test_arg(arg, arg->op.left, error_str);
  721. switch (lval) {
  722. case FILTER_VAL_NORM:
  723. break;
  724. case FILTER_VAL_TRUE:
  725. if (arg->op.type == FILTER_OP_OR)
  726. return FILTER_VAL_TRUE;
  727. rval = test_arg(arg, arg->op.right, error_str);
  728. if (rval != FILTER_VAL_NORM)
  729. return rval;
  730. return reparent_op_arg(parent, arg, arg->op.right,
  731. error_str);
  732. case FILTER_VAL_FALSE:
  733. if (arg->op.type == FILTER_OP_AND)
  734. return FILTER_VAL_FALSE;
  735. rval = test_arg(arg, arg->op.right, error_str);
  736. if (rval != FILTER_VAL_NORM)
  737. return rval;
  738. return reparent_op_arg(parent, arg, arg->op.right,
  739. error_str);
  740. default:
  741. return lval;
  742. }
  743. }
  744. rval = test_arg(arg, arg->op.right, error_str);
  745. switch (rval) {
  746. case FILTER_VAL_NORM:
  747. default:
  748. break;
  749. case FILTER_VAL_TRUE:
  750. if (arg->op.type == FILTER_OP_OR)
  751. return FILTER_VAL_TRUE;
  752. if (arg->op.type == FILTER_OP_NOT)
  753. return FILTER_VAL_FALSE;
  754. return reparent_op_arg(parent, arg, arg->op.left,
  755. error_str);
  756. case FILTER_VAL_FALSE:
  757. if (arg->op.type == FILTER_OP_AND)
  758. return FILTER_VAL_FALSE;
  759. if (arg->op.type == FILTER_OP_NOT)
  760. return FILTER_VAL_TRUE;
  761. return reparent_op_arg(parent, arg, arg->op.left,
  762. error_str);
  763. }
  764. return rval;
  765. default:
  766. show_error(error_str, "bad arg in filter tree");
  767. return PEVENT_ERRNO__BAD_FILTER_ARG;
  768. }
  769. return FILTER_VAL_NORM;
  770. }
  771. /* Remove any unknown event fields */
  772. static int collapse_tree(struct filter_arg *arg,
  773. struct filter_arg **arg_collapsed, char *error_str)
  774. {
  775. int ret;
  776. ret = test_arg(arg, arg, error_str);
  777. switch (ret) {
  778. case FILTER_VAL_NORM:
  779. break;
  780. case FILTER_VAL_TRUE:
  781. case FILTER_VAL_FALSE:
  782. free_arg(arg);
  783. arg = allocate_arg();
  784. if (arg) {
  785. arg->type = FILTER_ARG_BOOLEAN;
  786. arg->boolean.value = ret == FILTER_VAL_TRUE;
  787. } else {
  788. show_error(error_str, "Failed to allocate filter arg");
  789. ret = PEVENT_ERRNO__MEM_ALLOC_FAILED;
  790. }
  791. break;
  792. default:
  793. /* test_arg() already set the error_str */
  794. free_arg(arg);
  795. arg = NULL;
  796. break;
  797. }
  798. *arg_collapsed = arg;
  799. return ret;
  800. }
  801. static enum pevent_errno
  802. process_filter(struct event_format *event, struct filter_arg **parg,
  803. char *error_str, int not)
  804. {
  805. enum event_type type;
  806. char *token = NULL;
  807. struct filter_arg *current_op = NULL;
  808. struct filter_arg *current_exp = NULL;
  809. struct filter_arg *left_item = NULL;
  810. struct filter_arg *arg = NULL;
  811. enum op_type op_type;
  812. enum filter_op_type btype;
  813. enum filter_exp_type etype;
  814. enum filter_cmp_type ctype;
  815. enum pevent_errno ret;
  816. *parg = NULL;
  817. do {
  818. free(token);
  819. type = read_token(&token);
  820. switch (type) {
  821. case EVENT_SQUOTE:
  822. case EVENT_DQUOTE:
  823. case EVENT_ITEM:
  824. ret = create_arg_item(event, token, type, &arg, error_str);
  825. if (ret < 0)
  826. goto fail;
  827. if (!left_item)
  828. left_item = arg;
  829. else if (current_exp) {
  830. ret = add_right(current_exp, arg, error_str);
  831. if (ret < 0)
  832. goto fail;
  833. left_item = NULL;
  834. /* Not's only one one expression */
  835. if (not) {
  836. arg = NULL;
  837. if (current_op)
  838. goto fail_syntax;
  839. free(token);
  840. *parg = current_exp;
  841. return 0;
  842. }
  843. } else
  844. goto fail_syntax;
  845. arg = NULL;
  846. break;
  847. case EVENT_DELIM:
  848. if (*token == ',') {
  849. show_error(error_str, "Illegal token ','");
  850. ret = PEVENT_ERRNO__ILLEGAL_TOKEN;
  851. goto fail;
  852. }
  853. if (*token == '(') {
  854. if (left_item) {
  855. show_error(error_str,
  856. "Open paren can not come after item");
  857. ret = PEVENT_ERRNO__INVALID_PAREN;
  858. goto fail;
  859. }
  860. if (current_exp) {
  861. show_error(error_str,
  862. "Open paren can not come after expression");
  863. ret = PEVENT_ERRNO__INVALID_PAREN;
  864. goto fail;
  865. }
  866. ret = process_filter(event, &arg, error_str, 0);
  867. if (ret != PEVENT_ERRNO__UNBALANCED_PAREN) {
  868. if (ret == 0) {
  869. show_error(error_str,
  870. "Unbalanced number of '('");
  871. ret = PEVENT_ERRNO__UNBALANCED_PAREN;
  872. }
  873. goto fail;
  874. }
  875. ret = 0;
  876. /* A not wants just one expression */
  877. if (not) {
  878. if (current_op)
  879. goto fail_syntax;
  880. *parg = arg;
  881. return 0;
  882. }
  883. if (current_op)
  884. ret = add_right(current_op, arg, error_str);
  885. else
  886. current_exp = arg;
  887. if (ret < 0)
  888. goto fail;
  889. } else { /* ')' */
  890. if (!current_op && !current_exp)
  891. goto fail_syntax;
  892. /* Make sure everything is finished at this level */
  893. if (current_exp && !check_op_done(current_exp))
  894. goto fail_syntax;
  895. if (current_op && !check_op_done(current_op))
  896. goto fail_syntax;
  897. if (current_op)
  898. *parg = current_op;
  899. else
  900. *parg = current_exp;
  901. free(token);
  902. return PEVENT_ERRNO__UNBALANCED_PAREN;
  903. }
  904. break;
  905. case EVENT_OP:
  906. op_type = process_op(token, &btype, &ctype, &etype);
  907. /* All expect a left arg except for NOT */
  908. switch (op_type) {
  909. case OP_BOOL:
  910. /* Logic ops need a left expression */
  911. if (!current_exp && !current_op)
  912. goto fail_syntax;
  913. /* fall through */
  914. case OP_NOT:
  915. /* logic only processes ops and exp */
  916. if (left_item)
  917. goto fail_syntax;
  918. break;
  919. case OP_EXP:
  920. case OP_CMP:
  921. if (!left_item)
  922. goto fail_syntax;
  923. break;
  924. case OP_NONE:
  925. show_error(error_str,
  926. "Unknown op token %s", token);
  927. ret = PEVENT_ERRNO__UNKNOWN_TOKEN;
  928. goto fail;
  929. }
  930. ret = 0;
  931. switch (op_type) {
  932. case OP_BOOL:
  933. arg = create_arg_op(btype);
  934. if (arg == NULL)
  935. goto fail_alloc;
  936. if (current_op)
  937. ret = add_left(arg, current_op);
  938. else
  939. ret = add_left(arg, current_exp);
  940. current_op = arg;
  941. current_exp = NULL;
  942. break;
  943. case OP_NOT:
  944. arg = create_arg_op(btype);
  945. if (arg == NULL)
  946. goto fail_alloc;
  947. if (current_op)
  948. ret = add_right(current_op, arg, error_str);
  949. if (ret < 0)
  950. goto fail;
  951. current_exp = arg;
  952. ret = process_filter(event, &arg, error_str, 1);
  953. if (ret < 0)
  954. goto fail;
  955. ret = add_right(current_exp, arg, error_str);
  956. if (ret < 0)
  957. goto fail;
  958. break;
  959. case OP_EXP:
  960. case OP_CMP:
  961. if (op_type == OP_EXP)
  962. arg = create_arg_exp(etype);
  963. else
  964. arg = create_arg_cmp(ctype);
  965. if (arg == NULL)
  966. goto fail_alloc;
  967. if (current_op)
  968. ret = add_right(current_op, arg, error_str);
  969. if (ret < 0)
  970. goto fail;
  971. ret = add_left(arg, left_item);
  972. if (ret < 0) {
  973. arg = NULL;
  974. goto fail_syntax;
  975. }
  976. current_exp = arg;
  977. break;
  978. default:
  979. break;
  980. }
  981. arg = NULL;
  982. if (ret < 0)
  983. goto fail_syntax;
  984. break;
  985. case EVENT_NONE:
  986. break;
  987. case EVENT_ERROR:
  988. goto fail_alloc;
  989. default:
  990. goto fail_syntax;
  991. }
  992. } while (type != EVENT_NONE);
  993. if (!current_op && !current_exp)
  994. goto fail_syntax;
  995. if (!current_op)
  996. current_op = current_exp;
  997. ret = collapse_tree(current_op, parg, error_str);
  998. /* collapse_tree() may free current_op, and updates parg accordingly */
  999. current_op = NULL;
  1000. if (ret < 0)
  1001. goto fail;
  1002. free(token);
  1003. return 0;
  1004. fail_alloc:
  1005. show_error(error_str, "failed to allocate filter arg");
  1006. ret = PEVENT_ERRNO__MEM_ALLOC_FAILED;
  1007. goto fail;
  1008. fail_syntax:
  1009. show_error(error_str, "Syntax error");
  1010. ret = PEVENT_ERRNO__SYNTAX_ERROR;
  1011. fail:
  1012. free_arg(current_op);
  1013. free_arg(current_exp);
  1014. free_arg(arg);
  1015. free(token);
  1016. return ret;
  1017. }
  1018. static enum pevent_errno
  1019. process_event(struct event_format *event, const char *filter_str,
  1020. struct filter_arg **parg, char *error_str)
  1021. {
  1022. int ret;
  1023. pevent_buffer_init(filter_str, strlen(filter_str));
  1024. ret = process_filter(event, parg, error_str, 0);
  1025. if (ret < 0)
  1026. return ret;
  1027. /* If parg is NULL, then make it into FALSE */
  1028. if (!*parg) {
  1029. *parg = allocate_arg();
  1030. if (*parg == NULL)
  1031. return PEVENT_ERRNO__MEM_ALLOC_FAILED;
  1032. (*parg)->type = FILTER_ARG_BOOLEAN;
  1033. (*parg)->boolean.value = FILTER_FALSE;
  1034. }
  1035. return 0;
  1036. }
  1037. static enum pevent_errno
  1038. filter_event(struct event_filter *filter, struct event_format *event,
  1039. const char *filter_str, char *error_str)
  1040. {
  1041. struct filter_type *filter_type;
  1042. struct filter_arg *arg;
  1043. enum pevent_errno ret;
  1044. if (filter_str) {
  1045. ret = process_event(event, filter_str, &arg, error_str);
  1046. if (ret < 0)
  1047. return ret;
  1048. } else {
  1049. /* just add a TRUE arg */
  1050. arg = allocate_arg();
  1051. if (arg == NULL)
  1052. return PEVENT_ERRNO__MEM_ALLOC_FAILED;
  1053. arg->type = FILTER_ARG_BOOLEAN;
  1054. arg->boolean.value = FILTER_TRUE;
  1055. }
  1056. filter_type = add_filter_type(filter, event->id);
  1057. if (filter_type == NULL)
  1058. return PEVENT_ERRNO__MEM_ALLOC_FAILED;
  1059. if (filter_type->filter)
  1060. free_arg(filter_type->filter);
  1061. filter_type->filter = arg;
  1062. return 0;
  1063. }
  1064. static void filter_init_error_buf(struct event_filter *filter)
  1065. {
  1066. /* clear buffer to reset show error */
  1067. pevent_buffer_init("", 0);
  1068. filter->error_buffer[0] = '\0';
  1069. }
  1070. /**
  1071. * pevent_filter_add_filter_str - add a new filter
  1072. * @filter: the event filter to add to
  1073. * @filter_str: the filter string that contains the filter
  1074. *
  1075. * Returns 0 if the filter was successfully added or a
  1076. * negative error code. Use pevent_filter_strerror() to see
  1077. * actual error message in case of error.
  1078. */
  1079. enum pevent_errno pevent_filter_add_filter_str(struct event_filter *filter,
  1080. const char *filter_str)
  1081. {
  1082. struct pevent *pevent = filter->pevent;
  1083. struct event_list *event;
  1084. struct event_list *events = NULL;
  1085. const char *filter_start;
  1086. const char *next_event;
  1087. char *this_event;
  1088. char *event_name = NULL;
  1089. char *sys_name = NULL;
  1090. char *sp;
  1091. enum pevent_errno rtn = 0; /* PEVENT_ERRNO__SUCCESS */
  1092. int len;
  1093. int ret;
  1094. filter_init_error_buf(filter);
  1095. filter_start = strchr(filter_str, ':');
  1096. if (filter_start)
  1097. len = filter_start - filter_str;
  1098. else
  1099. len = strlen(filter_str);
  1100. do {
  1101. next_event = strchr(filter_str, ',');
  1102. if (next_event &&
  1103. (!filter_start || next_event < filter_start))
  1104. len = next_event - filter_str;
  1105. else if (filter_start)
  1106. len = filter_start - filter_str;
  1107. else
  1108. len = strlen(filter_str);
  1109. this_event = malloc(len + 1);
  1110. if (this_event == NULL) {
  1111. /* This can only happen when events is NULL, but still */
  1112. free_events(events);
  1113. return PEVENT_ERRNO__MEM_ALLOC_FAILED;
  1114. }
  1115. memcpy(this_event, filter_str, len);
  1116. this_event[len] = 0;
  1117. if (next_event)
  1118. next_event++;
  1119. filter_str = next_event;
  1120. sys_name = strtok_r(this_event, "/", &sp);
  1121. event_name = strtok_r(NULL, "/", &sp);
  1122. if (!sys_name) {
  1123. /* This can only happen when events is NULL, but still */
  1124. free_events(events);
  1125. free(this_event);
  1126. return PEVENT_ERRNO__FILTER_NOT_FOUND;
  1127. }
  1128. /* Find this event */
  1129. ret = find_event(pevent, &events, strim(sys_name), strim(event_name));
  1130. if (ret < 0) {
  1131. free_events(events);
  1132. free(this_event);
  1133. return ret;
  1134. }
  1135. free(this_event);
  1136. } while (filter_str);
  1137. /* Skip the ':' */
  1138. if (filter_start)
  1139. filter_start++;
  1140. /* filter starts here */
  1141. for (event = events; event; event = event->next) {
  1142. ret = filter_event(filter, event->event, filter_start,
  1143. filter->error_buffer);
  1144. /* Failures are returned if a parse error happened */
  1145. if (ret < 0)
  1146. rtn = ret;
  1147. if (ret >= 0 && pevent->test_filters) {
  1148. char *test;
  1149. test = pevent_filter_make_string(filter, event->event->id);
  1150. if (test) {
  1151. printf(" '%s: %s'\n", event->event->name, test);
  1152. free(test);
  1153. }
  1154. }
  1155. }
  1156. free_events(events);
  1157. if (rtn >= 0 && pevent->test_filters)
  1158. exit(0);
  1159. return rtn;
  1160. }
  1161. static void free_filter_type(struct filter_type *filter_type)
  1162. {
  1163. free_arg(filter_type->filter);
  1164. }
  1165. /**
  1166. * pevent_filter_strerror - fill error message in a buffer
  1167. * @filter: the event filter contains error
  1168. * @err: the error code
  1169. * @buf: the buffer to be filled in
  1170. * @buflen: the size of the buffer
  1171. *
  1172. * Returns 0 if message was filled successfully, -1 if error
  1173. */
  1174. int pevent_filter_strerror(struct event_filter *filter, enum pevent_errno err,
  1175. char *buf, size_t buflen)
  1176. {
  1177. if (err <= __PEVENT_ERRNO__START || err >= __PEVENT_ERRNO__END)
  1178. return -1;
  1179. if (strlen(filter->error_buffer) > 0) {
  1180. size_t len = snprintf(buf, buflen, "%s", filter->error_buffer);
  1181. if (len > buflen)
  1182. return -1;
  1183. return 0;
  1184. }
  1185. return pevent_strerror(filter->pevent, err, buf, buflen);
  1186. }
  1187. /**
  1188. * pevent_filter_remove_event - remove a filter for an event
  1189. * @filter: the event filter to remove from
  1190. * @event_id: the event to remove a filter for
  1191. *
  1192. * Removes the filter saved for an event defined by @event_id
  1193. * from the @filter.
  1194. *
  1195. * Returns 1: if an event was removed
  1196. * 0: if the event was not found
  1197. */
  1198. int pevent_filter_remove_event(struct event_filter *filter,
  1199. int event_id)
  1200. {
  1201. struct filter_type *filter_type;
  1202. unsigned long len;
  1203. if (!filter->filters)
  1204. return 0;
  1205. filter_type = find_filter_type(filter, event_id);
  1206. if (!filter_type)
  1207. return 0;
  1208. free_filter_type(filter_type);
  1209. /* The filter_type points into the event_filters array */
  1210. len = (unsigned long)(filter->event_filters + filter->filters) -
  1211. (unsigned long)(filter_type + 1);
  1212. memmove(filter_type, filter_type + 1, len);
  1213. filter->filters--;
  1214. memset(&filter->event_filters[filter->filters], 0,
  1215. sizeof(*filter_type));
  1216. return 1;
  1217. }
  1218. /**
  1219. * pevent_filter_reset - clear all filters in a filter
  1220. * @filter: the event filter to reset
  1221. *
  1222. * Removes all filters from a filter and resets it.
  1223. */
  1224. void pevent_filter_reset(struct event_filter *filter)
  1225. {
  1226. int i;
  1227. for (i = 0; i < filter->filters; i++)
  1228. free_filter_type(&filter->event_filters[i]);
  1229. free(filter->event_filters);
  1230. filter->filters = 0;
  1231. filter->event_filters = NULL;
  1232. }
  1233. void pevent_filter_free(struct event_filter *filter)
  1234. {
  1235. pevent_unref(filter->pevent);
  1236. pevent_filter_reset(filter);
  1237. free(filter);
  1238. }
  1239. static char *arg_to_str(struct event_filter *filter, struct filter_arg *arg);
  1240. static int copy_filter_type(struct event_filter *filter,
  1241. struct event_filter *source,
  1242. struct filter_type *filter_type)
  1243. {
  1244. struct filter_arg *arg;
  1245. struct event_format *event;
  1246. const char *sys;
  1247. const char *name;
  1248. char *str;
  1249. /* Can't assume that the pevent's are the same */
  1250. sys = filter_type->event->system;
  1251. name = filter_type->event->name;
  1252. event = pevent_find_event_by_name(filter->pevent, sys, name);
  1253. if (!event)
  1254. return -1;
  1255. str = arg_to_str(source, filter_type->filter);
  1256. if (!str)
  1257. return -1;
  1258. if (strcmp(str, "TRUE") == 0 || strcmp(str, "FALSE") == 0) {
  1259. /* Add trivial event */
  1260. arg = allocate_arg();
  1261. if (arg == NULL)
  1262. return -1;
  1263. arg->type = FILTER_ARG_BOOLEAN;
  1264. if (strcmp(str, "TRUE") == 0)
  1265. arg->boolean.value = 1;
  1266. else
  1267. arg->boolean.value = 0;
  1268. filter_type = add_filter_type(filter, event->id);
  1269. if (filter_type == NULL)
  1270. return -1;
  1271. filter_type->filter = arg;
  1272. free(str);
  1273. return 0;
  1274. }
  1275. filter_event(filter, event, str, NULL);
  1276. free(str);
  1277. return 0;
  1278. }
  1279. /**
  1280. * pevent_filter_copy - copy a filter using another filter
  1281. * @dest - the filter to copy to
  1282. * @source - the filter to copy from
  1283. *
  1284. * Returns 0 on success and -1 if not all filters were copied
  1285. */
  1286. int pevent_filter_copy(struct event_filter *dest, struct event_filter *source)
  1287. {
  1288. int ret = 0;
  1289. int i;
  1290. pevent_filter_reset(dest);
  1291. for (i = 0; i < source->filters; i++) {
  1292. if (copy_filter_type(dest, source, &source->event_filters[i]))
  1293. ret = -1;
  1294. }
  1295. return ret;
  1296. }
  1297. /**
  1298. * pevent_update_trivial - update the trivial filters with the given filter
  1299. * @dest - the filter to update
  1300. * @source - the filter as the source of the update
  1301. * @type - the type of trivial filter to update.
  1302. *
  1303. * Scan dest for trivial events matching @type to replace with the source.
  1304. *
  1305. * Returns 0 on success and -1 if there was a problem updating, but
  1306. * events may have still been updated on error.
  1307. */
  1308. int pevent_update_trivial(struct event_filter *dest, struct event_filter *source,
  1309. enum filter_trivial_type type)
  1310. {
  1311. struct pevent *src_pevent;
  1312. struct pevent *dest_pevent;
  1313. struct event_format *event;
  1314. struct filter_type *filter_type;
  1315. struct filter_arg *arg;
  1316. char *str;
  1317. int i;
  1318. src_pevent = source->pevent;
  1319. dest_pevent = dest->pevent;
  1320. /* Do nothing if either of the filters has nothing to filter */
  1321. if (!dest->filters || !source->filters)
  1322. return 0;
  1323. for (i = 0; i < dest->filters; i++) {
  1324. filter_type = &dest->event_filters[i];
  1325. arg = filter_type->filter;
  1326. if (arg->type != FILTER_ARG_BOOLEAN)
  1327. continue;
  1328. if ((arg->boolean.value && type == FILTER_TRIVIAL_FALSE) ||
  1329. (!arg->boolean.value && type == FILTER_TRIVIAL_TRUE))
  1330. continue;
  1331. event = filter_type->event;
  1332. if (src_pevent != dest_pevent) {
  1333. /* do a look up */
  1334. event = pevent_find_event_by_name(src_pevent,
  1335. event->system,
  1336. event->name);
  1337. if (!event)
  1338. return -1;
  1339. }
  1340. str = pevent_filter_make_string(source, event->id);
  1341. if (!str)
  1342. continue;
  1343. /* Don't bother if the filter is trivial too */
  1344. if (strcmp(str, "TRUE") != 0 && strcmp(str, "FALSE") != 0)
  1345. filter_event(dest, event, str, NULL);
  1346. free(str);
  1347. }
  1348. return 0;
  1349. }
  1350. /**
  1351. * pevent_filter_clear_trivial - clear TRUE and FALSE filters
  1352. * @filter: the filter to remove trivial filters from
  1353. * @type: remove only true, false, or both
  1354. *
  1355. * Removes filters that only contain a TRUE or FALES boolean arg.
  1356. *
  1357. * Returns 0 on success and -1 if there was a problem.
  1358. */
  1359. int pevent_filter_clear_trivial(struct event_filter *filter,
  1360. enum filter_trivial_type type)
  1361. {
  1362. struct filter_type *filter_type;
  1363. int count = 0;
  1364. int *ids = NULL;
  1365. int i;
  1366. if (!filter->filters)
  1367. return 0;
  1368. /*
  1369. * Two steps, first get all ids with trivial filters.
  1370. * then remove those ids.
  1371. */
  1372. for (i = 0; i < filter->filters; i++) {
  1373. int *new_ids;
  1374. filter_type = &filter->event_filters[i];
  1375. if (filter_type->filter->type != FILTER_ARG_BOOLEAN)
  1376. continue;
  1377. switch (type) {
  1378. case FILTER_TRIVIAL_FALSE:
  1379. if (filter_type->filter->boolean.value)
  1380. continue;
  1381. case FILTER_TRIVIAL_TRUE:
  1382. if (!filter_type->filter->boolean.value)
  1383. continue;
  1384. default:
  1385. break;
  1386. }
  1387. new_ids = realloc(ids, sizeof(*ids) * (count + 1));
  1388. if (!new_ids) {
  1389. free(ids);
  1390. return -1;
  1391. }
  1392. ids = new_ids;
  1393. ids[count++] = filter_type->event_id;
  1394. }
  1395. if (!count)
  1396. return 0;
  1397. for (i = 0; i < count; i++)
  1398. pevent_filter_remove_event(filter, ids[i]);
  1399. free(ids);
  1400. return 0;
  1401. }
  1402. /**
  1403. * pevent_filter_event_has_trivial - return true event contains trivial filter
  1404. * @filter: the filter with the information
  1405. * @event_id: the id of the event to test
  1406. * @type: trivial type to test for (TRUE, FALSE, EITHER)
  1407. *
  1408. * Returns 1 if the event contains a matching trivial type
  1409. * otherwise 0.
  1410. */
  1411. int pevent_filter_event_has_trivial(struct event_filter *filter,
  1412. int event_id,
  1413. enum filter_trivial_type type)
  1414. {
  1415. struct filter_type *filter_type;
  1416. if (!filter->filters)
  1417. return 0;
  1418. filter_type = find_filter_type(filter, event_id);
  1419. if (!filter_type)
  1420. return 0;
  1421. if (filter_type->filter->type != FILTER_ARG_BOOLEAN)
  1422. return 0;
  1423. switch (type) {
  1424. case FILTER_TRIVIAL_FALSE:
  1425. return !filter_type->filter->boolean.value;
  1426. case FILTER_TRIVIAL_TRUE:
  1427. return filter_type->filter->boolean.value;
  1428. default:
  1429. return 1;
  1430. }
  1431. }
  1432. static int test_filter(struct event_format *event, struct filter_arg *arg,
  1433. struct pevent_record *record, enum pevent_errno *err);
  1434. static const char *
  1435. get_comm(struct event_format *event, struct pevent_record *record)
  1436. {
  1437. const char *comm;
  1438. int pid;
  1439. pid = pevent_data_pid(event->pevent, record);
  1440. comm = pevent_data_comm_from_pid(event->pevent, pid);
  1441. return comm;
  1442. }
  1443. static unsigned long long
  1444. get_value(struct event_format *event,
  1445. struct format_field *field, struct pevent_record *record)
  1446. {
  1447. unsigned long long val;
  1448. /* Handle our dummy "comm" field */
  1449. if (field == &comm) {
  1450. const char *name;
  1451. name = get_comm(event, record);
  1452. return (unsigned long)name;
  1453. }
  1454. pevent_read_number_field(field, record->data, &val);
  1455. if (!(field->flags & FIELD_IS_SIGNED))
  1456. return val;
  1457. switch (field->size) {
  1458. case 1:
  1459. return (char)val;
  1460. case 2:
  1461. return (short)val;
  1462. case 4:
  1463. return (int)val;
  1464. case 8:
  1465. return (long long)val;
  1466. }
  1467. return val;
  1468. }
  1469. static unsigned long long
  1470. get_arg_value(struct event_format *event, struct filter_arg *arg,
  1471. struct pevent_record *record, enum pevent_errno *err);
  1472. static unsigned long long
  1473. get_exp_value(struct event_format *event, struct filter_arg *arg,
  1474. struct pevent_record *record, enum pevent_errno *err)
  1475. {
  1476. unsigned long long lval, rval;
  1477. lval = get_arg_value(event, arg->exp.left, record, err);
  1478. rval = get_arg_value(event, arg->exp.right, record, err);
  1479. if (*err) {
  1480. /*
  1481. * There was an error, no need to process anymore.
  1482. */
  1483. return 0;
  1484. }
  1485. switch (arg->exp.type) {
  1486. case FILTER_EXP_ADD:
  1487. return lval + rval;
  1488. case FILTER_EXP_SUB:
  1489. return lval - rval;
  1490. case FILTER_EXP_MUL:
  1491. return lval * rval;
  1492. case FILTER_EXP_DIV:
  1493. return lval / rval;
  1494. case FILTER_EXP_MOD:
  1495. return lval % rval;
  1496. case FILTER_EXP_RSHIFT:
  1497. return lval >> rval;
  1498. case FILTER_EXP_LSHIFT:
  1499. return lval << rval;
  1500. case FILTER_EXP_AND:
  1501. return lval & rval;
  1502. case FILTER_EXP_OR:
  1503. return lval | rval;
  1504. case FILTER_EXP_XOR:
  1505. return lval ^ rval;
  1506. case FILTER_EXP_NOT:
  1507. default:
  1508. if (!*err)
  1509. *err = PEVENT_ERRNO__INVALID_EXP_TYPE;
  1510. }
  1511. return 0;
  1512. }
  1513. static unsigned long long
  1514. get_arg_value(struct event_format *event, struct filter_arg *arg,
  1515. struct pevent_record *record, enum pevent_errno *err)
  1516. {
  1517. switch (arg->type) {
  1518. case FILTER_ARG_FIELD:
  1519. return get_value(event, arg->field.field, record);
  1520. case FILTER_ARG_VALUE:
  1521. if (arg->value.type != FILTER_NUMBER) {
  1522. if (!*err)
  1523. *err = PEVENT_ERRNO__NOT_A_NUMBER;
  1524. }
  1525. return arg->value.val;
  1526. case FILTER_ARG_EXP:
  1527. return get_exp_value(event, arg, record, err);
  1528. default:
  1529. if (!*err)
  1530. *err = PEVENT_ERRNO__INVALID_ARG_TYPE;
  1531. }
  1532. return 0;
  1533. }
  1534. static int test_num(struct event_format *event, struct filter_arg *arg,
  1535. struct pevent_record *record, enum pevent_errno *err)
  1536. {
  1537. unsigned long long lval, rval;
  1538. lval = get_arg_value(event, arg->num.left, record, err);
  1539. rval = get_arg_value(event, arg->num.right, record, err);
  1540. if (*err) {
  1541. /*
  1542. * There was an error, no need to process anymore.
  1543. */
  1544. return 0;
  1545. }
  1546. switch (arg->num.type) {
  1547. case FILTER_CMP_EQ:
  1548. return lval == rval;
  1549. case FILTER_CMP_NE:
  1550. return lval != rval;
  1551. case FILTER_CMP_GT:
  1552. return lval > rval;
  1553. case FILTER_CMP_LT:
  1554. return lval < rval;
  1555. case FILTER_CMP_GE:
  1556. return lval >= rval;
  1557. case FILTER_CMP_LE:
  1558. return lval <= rval;
  1559. default:
  1560. if (!*err)
  1561. *err = PEVENT_ERRNO__ILLEGAL_INTEGER_CMP;
  1562. return 0;
  1563. }
  1564. }
  1565. static const char *get_field_str(struct filter_arg *arg, struct pevent_record *record)
  1566. {
  1567. struct event_format *event;
  1568. struct pevent *pevent;
  1569. unsigned long long addr;
  1570. const char *val = NULL;
  1571. unsigned int size;
  1572. char hex[64];
  1573. /* If the field is not a string convert it */
  1574. if (arg->str.field->flags & FIELD_IS_STRING) {
  1575. val = record->data + arg->str.field->offset;
  1576. size = arg->str.field->size;
  1577. if (arg->str.field->flags & FIELD_IS_DYNAMIC) {
  1578. addr = *(unsigned int *)val;
  1579. val = record->data + (addr & 0xffff);
  1580. size = addr >> 16;
  1581. }
  1582. /*
  1583. * We need to copy the data since we can't be sure the field
  1584. * is null terminated.
  1585. */
  1586. if (*(val + size - 1)) {
  1587. /* copy it */
  1588. memcpy(arg->str.buffer, val, arg->str.field->size);
  1589. /* the buffer is already NULL terminated */
  1590. val = arg->str.buffer;
  1591. }
  1592. } else {
  1593. event = arg->str.field->event;
  1594. pevent = event->pevent;
  1595. addr = get_value(event, arg->str.field, record);
  1596. if (arg->str.field->flags & (FIELD_IS_POINTER | FIELD_IS_LONG))
  1597. /* convert to a kernel symbol */
  1598. val = pevent_find_function(pevent, addr);
  1599. if (val == NULL) {
  1600. /* just use the hex of the string name */
  1601. snprintf(hex, 64, "0x%llx", addr);
  1602. val = hex;
  1603. }
  1604. }
  1605. return val;
  1606. }
  1607. static int test_str(struct event_format *event, struct filter_arg *arg,
  1608. struct pevent_record *record, enum pevent_errno *err)
  1609. {
  1610. const char *val;
  1611. if (arg->str.field == &comm)
  1612. val = get_comm(event, record);
  1613. else
  1614. val = get_field_str(arg, record);
  1615. switch (arg->str.type) {
  1616. case FILTER_CMP_MATCH:
  1617. return strcmp(val, arg->str.val) == 0;
  1618. case FILTER_CMP_NOT_MATCH:
  1619. return strcmp(val, arg->str.val) != 0;
  1620. case FILTER_CMP_REGEX:
  1621. /* Returns zero on match */
  1622. return !regexec(&arg->str.reg, val, 0, NULL, 0);
  1623. case FILTER_CMP_NOT_REGEX:
  1624. return regexec(&arg->str.reg, val, 0, NULL, 0);
  1625. default:
  1626. if (!*err)
  1627. *err = PEVENT_ERRNO__ILLEGAL_STRING_CMP;
  1628. return 0;
  1629. }
  1630. }
  1631. static int test_op(struct event_format *event, struct filter_arg *arg,
  1632. struct pevent_record *record, enum pevent_errno *err)
  1633. {
  1634. switch (arg->op.type) {
  1635. case FILTER_OP_AND:
  1636. return test_filter(event, arg->op.left, record, err) &&
  1637. test_filter(event, arg->op.right, record, err);
  1638. case FILTER_OP_OR:
  1639. return test_filter(event, arg->op.left, record, err) ||
  1640. test_filter(event, arg->op.right, record, err);
  1641. case FILTER_OP_NOT:
  1642. return !test_filter(event, arg->op.right, record, err);
  1643. default:
  1644. if (!*err)
  1645. *err = PEVENT_ERRNO__INVALID_OP_TYPE;
  1646. return 0;
  1647. }
  1648. }
  1649. static int test_filter(struct event_format *event, struct filter_arg *arg,
  1650. struct pevent_record *record, enum pevent_errno *err)
  1651. {
  1652. if (*err) {
  1653. /*
  1654. * There was an error, no need to process anymore.
  1655. */
  1656. return 0;
  1657. }
  1658. switch (arg->type) {
  1659. case FILTER_ARG_BOOLEAN:
  1660. /* easy case */
  1661. return arg->boolean.value;
  1662. case FILTER_ARG_OP:
  1663. return test_op(event, arg, record, err);
  1664. case FILTER_ARG_NUM:
  1665. return test_num(event, arg, record, err);
  1666. case FILTER_ARG_STR:
  1667. return test_str(event, arg, record, err);
  1668. case FILTER_ARG_EXP:
  1669. case FILTER_ARG_VALUE:
  1670. case FILTER_ARG_FIELD:
  1671. /*
  1672. * Expressions, fields and values evaluate
  1673. * to true if they return non zero
  1674. */
  1675. return !!get_arg_value(event, arg, record, err);
  1676. default:
  1677. if (!*err)
  1678. *err = PEVENT_ERRNO__INVALID_ARG_TYPE;
  1679. return 0;
  1680. }
  1681. }
  1682. /**
  1683. * pevent_event_filtered - return true if event has filter
  1684. * @filter: filter struct with filter information
  1685. * @event_id: event id to test if filter exists
  1686. *
  1687. * Returns 1 if filter found for @event_id
  1688. * otherwise 0;
  1689. */
  1690. int pevent_event_filtered(struct event_filter *filter, int event_id)
  1691. {
  1692. struct filter_type *filter_type;
  1693. if (!filter->filters)
  1694. return 0;
  1695. filter_type = find_filter_type(filter, event_id);
  1696. return filter_type ? 1 : 0;
  1697. }
  1698. /**
  1699. * pevent_filter_match - test if a record matches a filter
  1700. * @filter: filter struct with filter information
  1701. * @record: the record to test against the filter
  1702. *
  1703. * Returns: match result or error code (prefixed with PEVENT_ERRNO__)
  1704. * FILTER_MATCH - filter found for event and @record matches
  1705. * FILTER_MISS - filter found for event and @record does not match
  1706. * FILTER_NOT_FOUND - no filter found for @record's event
  1707. * NO_FILTER - if no filters exist
  1708. * otherwise - error occurred during test
  1709. */
  1710. enum pevent_errno pevent_filter_match(struct event_filter *filter,
  1711. struct pevent_record *record)
  1712. {
  1713. struct pevent *pevent = filter->pevent;
  1714. struct filter_type *filter_type;
  1715. int event_id;
  1716. int ret;
  1717. enum pevent_errno err = 0;
  1718. filter_init_error_buf(filter);
  1719. if (!filter->filters)
  1720. return PEVENT_ERRNO__NO_FILTER;
  1721. event_id = pevent_data_type(pevent, record);
  1722. filter_type = find_filter_type(filter, event_id);
  1723. if (!filter_type)
  1724. return PEVENT_ERRNO__FILTER_NOT_FOUND;
  1725. ret = test_filter(filter_type->event, filter_type->filter, record, &err);
  1726. if (err)
  1727. return err;
  1728. return ret ? PEVENT_ERRNO__FILTER_MATCH : PEVENT_ERRNO__FILTER_MISS;
  1729. }
  1730. static char *op_to_str(struct event_filter *filter, struct filter_arg *arg)
  1731. {
  1732. char *str = NULL;
  1733. char *left = NULL;
  1734. char *right = NULL;
  1735. char *op = NULL;
  1736. int left_val = -1;
  1737. int right_val = -1;
  1738. int val;
  1739. switch (arg->op.type) {
  1740. case FILTER_OP_AND:
  1741. op = "&&";
  1742. /* fall through */
  1743. case FILTER_OP_OR:
  1744. if (!op)
  1745. op = "||";
  1746. left = arg_to_str(filter, arg->op.left);
  1747. right = arg_to_str(filter, arg->op.right);
  1748. if (!left || !right)
  1749. break;
  1750. /* Try to consolidate boolean values */
  1751. if (strcmp(left, "TRUE") == 0)
  1752. left_val = 1;
  1753. else if (strcmp(left, "FALSE") == 0)
  1754. left_val = 0;
  1755. if (strcmp(right, "TRUE") == 0)
  1756. right_val = 1;
  1757. else if (strcmp(right, "FALSE") == 0)
  1758. right_val = 0;
  1759. if (left_val >= 0) {
  1760. if ((arg->op.type == FILTER_OP_AND && !left_val) ||
  1761. (arg->op.type == FILTER_OP_OR && left_val)) {
  1762. /* Just return left value */
  1763. str = left;
  1764. left = NULL;
  1765. break;
  1766. }
  1767. if (right_val >= 0) {
  1768. /* just evaluate this. */
  1769. val = 0;
  1770. switch (arg->op.type) {
  1771. case FILTER_OP_AND:
  1772. val = left_val && right_val;
  1773. break;
  1774. case FILTER_OP_OR:
  1775. val = left_val || right_val;
  1776. break;
  1777. default:
  1778. break;
  1779. }
  1780. asprintf(&str, val ? "TRUE" : "FALSE");
  1781. break;
  1782. }
  1783. }
  1784. if (right_val >= 0) {
  1785. if ((arg->op.type == FILTER_OP_AND && !right_val) ||
  1786. (arg->op.type == FILTER_OP_OR && right_val)) {
  1787. /* Just return right value */
  1788. str = right;
  1789. right = NULL;
  1790. break;
  1791. }
  1792. /* The right value is meaningless */
  1793. str = left;
  1794. left = NULL;
  1795. break;
  1796. }
  1797. asprintf(&str, "(%s) %s (%s)", left, op, right);
  1798. break;
  1799. case FILTER_OP_NOT:
  1800. op = "!";
  1801. right = arg_to_str(filter, arg->op.right);
  1802. if (!right)
  1803. break;
  1804. /* See if we can consolidate */
  1805. if (strcmp(right, "TRUE") == 0)
  1806. right_val = 1;
  1807. else if (strcmp(right, "FALSE") == 0)
  1808. right_val = 0;
  1809. if (right_val >= 0) {
  1810. /* just return the opposite */
  1811. asprintf(&str, right_val ? "FALSE" : "TRUE");
  1812. break;
  1813. }
  1814. asprintf(&str, "%s(%s)", op, right);
  1815. break;
  1816. default:
  1817. /* ?? */
  1818. break;
  1819. }
  1820. free(left);
  1821. free(right);
  1822. return str;
  1823. }
  1824. static char *val_to_str(struct event_filter *filter, struct filter_arg *arg)
  1825. {
  1826. char *str = NULL;
  1827. asprintf(&str, "%lld", arg->value.val);
  1828. return str;
  1829. }
  1830. static char *field_to_str(struct event_filter *filter, struct filter_arg *arg)
  1831. {
  1832. return strdup(arg->field.field->name);
  1833. }
  1834. static char *exp_to_str(struct event_filter *filter, struct filter_arg *arg)
  1835. {
  1836. char *lstr;
  1837. char *rstr;
  1838. char *op;
  1839. char *str = NULL;
  1840. lstr = arg_to_str(filter, arg->exp.left);
  1841. rstr = arg_to_str(filter, arg->exp.right);
  1842. if (!lstr || !rstr)
  1843. goto out;
  1844. switch (arg->exp.type) {
  1845. case FILTER_EXP_ADD:
  1846. op = "+";
  1847. break;
  1848. case FILTER_EXP_SUB:
  1849. op = "-";
  1850. break;
  1851. case FILTER_EXP_MUL:
  1852. op = "*";
  1853. break;
  1854. case FILTER_EXP_DIV:
  1855. op = "/";
  1856. break;
  1857. case FILTER_EXP_MOD:
  1858. op = "%";
  1859. break;
  1860. case FILTER_EXP_RSHIFT:
  1861. op = ">>";
  1862. break;
  1863. case FILTER_EXP_LSHIFT:
  1864. op = "<<";
  1865. break;
  1866. case FILTER_EXP_AND:
  1867. op = "&";
  1868. break;
  1869. case FILTER_EXP_OR:
  1870. op = "|";
  1871. break;
  1872. case FILTER_EXP_XOR:
  1873. op = "^";
  1874. break;
  1875. default:
  1876. op = "[ERROR IN EXPRESSION TYPE]";
  1877. break;
  1878. }
  1879. asprintf(&str, "%s %s %s", lstr, op, rstr);
  1880. out:
  1881. free(lstr);
  1882. free(rstr);
  1883. return str;
  1884. }
  1885. static char *num_to_str(struct event_filter *filter, struct filter_arg *arg)
  1886. {
  1887. char *lstr;
  1888. char *rstr;
  1889. char *str = NULL;
  1890. char *op = NULL;
  1891. lstr = arg_to_str(filter, arg->num.left);
  1892. rstr = arg_to_str(filter, arg->num.right);
  1893. if (!lstr || !rstr)
  1894. goto out;
  1895. switch (arg->num.type) {
  1896. case FILTER_CMP_EQ:
  1897. op = "==";
  1898. /* fall through */
  1899. case FILTER_CMP_NE:
  1900. if (!op)
  1901. op = "!=";
  1902. /* fall through */
  1903. case FILTER_CMP_GT:
  1904. if (!op)
  1905. op = ">";
  1906. /* fall through */
  1907. case FILTER_CMP_LT:
  1908. if (!op)
  1909. op = "<";
  1910. /* fall through */
  1911. case FILTER_CMP_GE:
  1912. if (!op)
  1913. op = ">=";
  1914. /* fall through */
  1915. case FILTER_CMP_LE:
  1916. if (!op)
  1917. op = "<=";
  1918. asprintf(&str, "%s %s %s", lstr, op, rstr);
  1919. break;
  1920. default:
  1921. /* ?? */
  1922. break;
  1923. }
  1924. out:
  1925. free(lstr);
  1926. free(rstr);
  1927. return str;
  1928. }
  1929. static char *str_to_str(struct event_filter *filter, struct filter_arg *arg)
  1930. {
  1931. char *str = NULL;
  1932. char *op = NULL;
  1933. switch (arg->str.type) {
  1934. case FILTER_CMP_MATCH:
  1935. op = "==";
  1936. /* fall through */
  1937. case FILTER_CMP_NOT_MATCH:
  1938. if (!op)
  1939. op = "!=";
  1940. /* fall through */
  1941. case FILTER_CMP_REGEX:
  1942. if (!op)
  1943. op = "=~";
  1944. /* fall through */
  1945. case FILTER_CMP_NOT_REGEX:
  1946. if (!op)
  1947. op = "!~";
  1948. asprintf(&str, "%s %s \"%s\"",
  1949. arg->str.field->name, op, arg->str.val);
  1950. break;
  1951. default:
  1952. /* ?? */
  1953. break;
  1954. }
  1955. return str;
  1956. }
  1957. static char *arg_to_str(struct event_filter *filter, struct filter_arg *arg)
  1958. {
  1959. char *str = NULL;
  1960. switch (arg->type) {
  1961. case FILTER_ARG_BOOLEAN:
  1962. asprintf(&str, arg->boolean.value ? "TRUE" : "FALSE");
  1963. return str;
  1964. case FILTER_ARG_OP:
  1965. return op_to_str(filter, arg);
  1966. case FILTER_ARG_NUM:
  1967. return num_to_str(filter, arg);
  1968. case FILTER_ARG_STR:
  1969. return str_to_str(filter, arg);
  1970. case FILTER_ARG_VALUE:
  1971. return val_to_str(filter, arg);
  1972. case FILTER_ARG_FIELD:
  1973. return field_to_str(filter, arg);
  1974. case FILTER_ARG_EXP:
  1975. return exp_to_str(filter, arg);
  1976. default:
  1977. /* ?? */
  1978. return NULL;
  1979. }
  1980. }
  1981. /**
  1982. * pevent_filter_make_string - return a string showing the filter
  1983. * @filter: filter struct with filter information
  1984. * @event_id: the event id to return the filter string with
  1985. *
  1986. * Returns a string that displays the filter contents.
  1987. * This string must be freed with free(str).
  1988. * NULL is returned if no filter is found or allocation failed.
  1989. */
  1990. char *
  1991. pevent_filter_make_string(struct event_filter *filter, int event_id)
  1992. {
  1993. struct filter_type *filter_type;
  1994. if (!filter->filters)
  1995. return NULL;
  1996. filter_type = find_filter_type(filter, event_id);
  1997. if (!filter_type)
  1998. return NULL;
  1999. return arg_to_str(filter, filter_type->filter);
  2000. }
  2001. /**
  2002. * pevent_filter_compare - compare two filters and return if they are the same
  2003. * @filter1: Filter to compare with @filter2
  2004. * @filter2: Filter to compare with @filter1
  2005. *
  2006. * Returns:
  2007. * 1 if the two filters hold the same content.
  2008. * 0 if they do not.
  2009. */
  2010. int pevent_filter_compare(struct event_filter *filter1, struct event_filter *filter2)
  2011. {
  2012. struct filter_type *filter_type1;
  2013. struct filter_type *filter_type2;
  2014. char *str1, *str2;
  2015. int result;
  2016. int i;
  2017. /* Do the easy checks first */
  2018. if (filter1->filters != filter2->filters)
  2019. return 0;
  2020. if (!filter1->filters && !filter2->filters)
  2021. return 1;
  2022. /*
  2023. * Now take a look at each of the events to see if they have the same
  2024. * filters to them.
  2025. */
  2026. for (i = 0; i < filter1->filters; i++) {
  2027. filter_type1 = &filter1->event_filters[i];
  2028. filter_type2 = find_filter_type(filter2, filter_type1->event_id);
  2029. if (!filter_type2)
  2030. break;
  2031. if (filter_type1->filter->type != filter_type2->filter->type)
  2032. break;
  2033. switch (filter_type1->filter->type) {
  2034. case FILTER_TRIVIAL_FALSE:
  2035. case FILTER_TRIVIAL_TRUE:
  2036. /* trivial types just need the type compared */
  2037. continue;
  2038. default:
  2039. break;
  2040. }
  2041. /* The best way to compare complex filters is with strings */
  2042. str1 = arg_to_str(filter1, filter_type1->filter);
  2043. str2 = arg_to_str(filter2, filter_type2->filter);
  2044. if (str1 && str2)
  2045. result = strcmp(str1, str2) != 0;
  2046. else
  2047. /* bail out if allocation fails */
  2048. result = 1;
  2049. free(str1);
  2050. free(str2);
  2051. if (result)
  2052. break;
  2053. }
  2054. if (i < filter1->filters)
  2055. return 0;
  2056. return 1;
  2057. }