]> jfr.im git - irc/quakenet/newserv.git/blob - newsearch/newsearch.c
Remove old newsearch parser.
[irc/quakenet/newserv.git] / newsearch / newsearch.c
1 #include <stdio.h>
2 #include <stdarg.h>
3 #include <string.h>
4
5 #include "../irc/irc_config.h"
6 #include "../lib/irc_string.h"
7 #include "../parser/parser.h"
8 #include "../control/control.h"
9 #include "../lib/splitline.h"
10 #include "../lib/version.h"
11 #include "../lib/stringbuf.h"
12 #include "../lib/strlfunc.h"
13 #include "../lib/array.h"
14 #include "newsearch.h"
15 #include "parser.h"
16
17 MODULE_VERSION("");
18
19 CommandTree *searchCmdTree;
20 searchList *globalterms = NULL;
21
22 int do_nicksearch(void *source, int cargc, char **cargv);
23 int do_chansearch(void *source, int cargc, char **cargv);
24 int do_usersearch(void *source, int cargc, char **cargv);
25
26 void printnick_channels(searchCtx *, nick *, nick *);
27 void printchannel(searchCtx *, nick *, chanindex *);
28 void printchannel_topic(searchCtx *, nick *, chanindex *);
29 void printchannel_services(searchCtx *, nick *, chanindex *);
30
31 UserDisplayFunc defaultuserfn = printuser;
32 NickDisplayFunc defaultnickfn = printnick;
33 ChanDisplayFunc defaultchanfn = printchannel;
34
35 searchCmd *reg_nicksearch, *reg_chansearch, *reg_usersearch;
36 void displaycommandhelp(nick *, Command *);
37 void displaystrerror(replyFunc, nick *, const char *);
38
39 searchCmd *registersearchcommand(char *name, int level, CommandHandler cmd, void *defaultdisplayfunc) {
40 searchCmd *acmd;
41 searchList *sl;
42
43 registercontrolhelpfunccmd(name, NO_OPER,4, cmd, &displaycommandhelp);
44 acmd=(struct searchCmd *)malloc(sizeof(struct searchCmd));
45 if (!acmd) {
46 Error("newsearch", ERR_ERROR, "malloc failed: registersearchcommand");
47 return NULL;
48 }
49 acmd->handler = cmd;
50
51 acmd->name = getsstring( name, NSMAX_COMMAND_LEN);
52 acmd->outputtree = newcommandtree();
53 acmd->searchtree = newcommandtree();
54
55 addcommandtotree(searchCmdTree, name, 0, 0, (CommandHandler)acmd);
56
57 for (sl=globalterms; sl; sl=sl->next) {
58 addcommandexttotree(acmd->searchtree, sl->name->content, 0, 1, (CommandHandler)sl->cmd, sl->help);
59 }
60
61 return acmd;
62 }
63
64 void deregistersearchcommand(searchCmd *scmd) {
65 deregistercontrolcmd(scmd->name->content, (CommandHandler)scmd->handler);
66 destroycommandtree(scmd->outputtree);
67 destroycommandtree(scmd->searchtree);
68 deletecommandfromtree(searchCmdTree, scmd->name->content, (CommandHandler) scmd);
69 freesstring(scmd->name);
70 free(scmd);
71 }
72
73 void displaycommandhelp(nick *np, Command *cmd) {
74 int i,n,j,m;
75 Command *cmdlist[100], *acmdlist[100];
76 searchCmd *acmd;
77
78 n=getcommandlist(searchCmdTree,cmdlist,100);
79 for(i=0;i<n;i++) {
80 /* note: we may want to only deregister a command if we've already registered it, for now, try de-registering new commands anyway */
81 if ( ((searchCmd *)cmdlist[i]->handler)->handler != cmd->handler )
82 continue;
83 acmd = ((searchCmd *)(cmdlist[i]->handler));
84
85 controlreply(np, "Usage: [flags] <criteria>\n");
86 controlreply(np, "Flags:\n");
87 controlreply(np, " -l int : Limit number of rows of results\n");
88 controlreply(np, " -d string : a valid output format for the results\n");
89 controlreply(np, " -s subset : ipmask subset of network to search (only for node search)\n");
90 controlreply(np, " \n");
91 controlreply(np, "Available Output Formats:\n");
92
93 m=getcommandlist(acmd->outputtree,acmdlist,100);
94 for(j=0;j<m;j++) {
95 if ( controlpermitted( acmdlist[j]->level, np) ) {
96 char *help=(char *)acmdlist[j]->ext;
97 if ( help && help[0] != '\0')
98 controlreply(np, "%-10s: %s\n", acmdlist[j]->command->content, help);
99 else
100 controlreply(np, "%s\n", acmdlist[j]->command->content );
101 }
102 }
103
104 controlreply(np, " \n");
105 controlreply(np, "Available Global Commands and Operators:\n" );
106 m=getcommandlist(acmd->searchtree,acmdlist,100);
107 for(j=0;j<m;j++) {
108 if ( acmdlist[j]->maxparams) {
109 char *help=(char *)acmdlist[j]->ext;
110 if ( help && help[0] != '\0')
111 controlreply(np, "%-10s: %s\n", acmdlist[j]->command->content, help );
112 else
113 controlreply(np, "%s\n", acmdlist[j]->command->content );
114 }
115 }
116
117 controlreply(np, " \n");
118 controlreply(np, "Available Commands and Operators for %s:\n", acmd->name->content);
119
120 m=getcommandlist(acmd->searchtree,acmdlist,100);
121 for(j=0;j<m;j++) {
122 if ( !acmdlist[j]->maxparams && controlpermitted( acmdlist[j]->level, np) ) {
123 char *help=(char *)acmdlist[j]->ext;
124 if ( help && help[0] != '\0')
125 controlreply(np, "%-10s: %s\n", acmdlist[j]->command->content, help );
126 else
127 controlreply(np, "%s\n", acmdlist[j]->command->content );
128 }
129 }
130 }
131 }
132
133 void regdisp( searchCmd *cmd, const char *name, void *handler, int level, char *help) {
134 addcommandexttotree(cmd->outputtree, name, level, 0, (CommandHandler) handler, (char *)help);
135 }
136
137 void unregdisp( searchCmd *cmd, const char *name, void *handler ) {
138 deletecommandfromtree(cmd->outputtree, name, (CommandHandler) handler);
139 }
140
141 void *findcommandinlist( searchList *sl, char *name){
142 while (sl) {
143 if(strcmp(sl->name->content,name) == 0 ) {
144 return sl;
145 }
146 sl=sl->next;
147 }
148 return NULL;
149 }
150
151 const char *parseError;
152 /* used for *_free functions that need to warn users of certain things
153 i.e. hitting too many users in a (kill) or (gline) */
154 nick *senderNSExtern;
155
156 void _init() {
157 searchCmdTree=newcommandtree();
158
159 reg_nicksearch = (searchCmd *)registersearchcommand("nicksearch",NO_OPER,&do_nicksearch, printnick);
160 reg_chansearch = (searchCmd *)registersearchcommand("chansearch",NO_OPER,&do_chansearch, printchannel);
161 reg_usersearch = (searchCmd *)registersearchcommand("usersearch",NO_OPER,&do_usersearch, printuser);
162
163 /* Boolean operations */
164 registerglobalsearchterm("and",and_parse, "usage: (and (X) (X))" );
165 registerglobalsearchterm("not",not_parse, "usage: (not (X))");
166 registerglobalsearchterm("or",or_parse, "usage: (or (X) (X))" );
167
168 registerglobalsearchterm("eq",eq_parse, "usage: (eq (X) Y)");
169
170 registerglobalsearchterm("lt",lt_parse, "usage: (lt (X) int)");
171 registerglobalsearchterm("gt",gt_parse, "usage: (gt (X) int)");
172
173 /* String operations */
174 registerglobalsearchterm("match",match_parse, "usage: (match (X) string)");
175 registerglobalsearchterm("regex",regex_parse, "usage: (regex (X) string)");
176 registerglobalsearchterm("length",length_parse, "usage: (length string)");
177
178 /* Nickname operations */
179 registersearchterm(reg_nicksearch, "hostmask",hostmask_parse, 0, "The user's nick!user@host; \"hostmask real\" returns nick!user@host\rreal"); /* nick only */
180 registersearchterm(reg_nicksearch, "realname",realname_parse, 0, "User's current realname"); /* nick only */
181 registersearchterm(reg_nicksearch, "away",away_parse, 0, "User's current away message"); /* nick only */
182 registersearchterm(reg_nicksearch, "authname",authname_parse, 0, "User's current authname or false"); /* nick only */
183 registersearchterm(reg_nicksearch, "authts",authts_parse, 0, "User's Auth timestamp"); /* nick only */
184 registersearchterm(reg_nicksearch, "ident",ident_parse, 0, "User's current ident"); /* nick only */
185 registersearchterm(reg_nicksearch, "host",host_parse, 0, "User's host, allow \"host real\" to match real host"); /* nick only */
186 registersearchterm(reg_nicksearch, "channel",channel_parse, 0, "Valid Channel Name to match users against"); /* nick only */
187 registersearchterm(reg_nicksearch, "timestamp",timestamp_parse, 0, "User's Timestamp"); /* nick only */
188 registersearchterm(reg_nicksearch, "country",country_parse, 0, "2 letter country code (data source is geoip)"); /* nick only */
189 registersearchterm(reg_nicksearch, "ip",ip_parse, 0, "User's IP - ipv4 or ipv6 format as appropriate. Note: not 6to4"); /* nick only */
190 registersearchterm(reg_nicksearch, "channels",channels_parse, 0, "Channel Count"); /* nick only */
191 registersearchterm(reg_nicksearch, "server",server_parse, 0, "Server Name. Either (server string) or (match (server) string)"); /* nick only */
192 registersearchterm(reg_nicksearch, "authid",authid_parse, 0, "User's Auth ID"); /* nick only */
193 registersearchterm(reg_nicksearch, "cidr",cidr_parse, 0, "CIDR matching"); /* nick only */
194 registersearchterm(reg_nicksearch, "ipvsix",ipv6_parse, 0, "IPv6 user"); /* nick only */
195
196 /* Channel operations */
197 registersearchterm(reg_chansearch, "exists",exists_parse, 0, "Returns if channel exists on network. Note: newserv may store data on empty channels"); /* channel only */
198 registersearchterm(reg_chansearch, "services",services_parse, 0, ""); /* channel only */
199 registersearchterm(reg_chansearch, "size",size_parse, 0, "Channel user count"); /* channel only */
200 registersearchterm(reg_chansearch, "name",name_parse, 0, "Channel Name"); /* channel only */
201 registersearchterm(reg_chansearch, "topic",topic_parse, 0, "Channel topic"); /* channel only */
202 registersearchterm(reg_chansearch, "oppct",oppct_parse, 0, "Percentage Opped"); /* channel only */
203 registersearchterm(reg_chansearch, "cumodecount",cumodecount_parse, 0, "Count of users with given channel modes"); /* channel only */
204 registersearchterm(reg_chansearch, "cumodepct",cumodepct_parse, 0, "Percentage of users with given channel modes"); /* channel only */
205 registersearchterm(reg_chansearch, "uniquehostpct",hostpct_parse, 0, "uniquehost percent"); /* channel only */
206 registersearchterm(reg_chansearch, "authedpct",authedpct_parse, 0, "Percentage of authed users"); /* channel only */
207 registersearchterm(reg_chansearch, "kick",kick_parse, 0, "KICK users channels in newsearch result. Note: evaluation order"); /* channel only */
208
209 /* Nickname / channel operations */
210 registersearchterm(reg_chansearch, "modes",modes_parse, 0, "User Modes");
211 registersearchterm(reg_nicksearch, "modes",modes_parse, 0, "Channel Modes");
212 registersearchterm(reg_chansearch, "nick",nick_parse, 0, "Nickname");
213 registersearchterm(reg_nicksearch, "nick",nick_parse, 0, "Nickname");
214
215 /* Kill / gline parameters */
216 registersearchterm(reg_chansearch,"kill",kill_parse, 0, "KILL users in newsearch result. Note: evaluation order");
217 registersearchterm(reg_chansearch,"gline",gline_parse, 0, "GLINE users in newsearch result. Note: evaluation order");
218 registersearchterm(reg_nicksearch,"kill",kill_parse, 0, "KILL users in newsearch result. Note: evaluation order");
219 registersearchterm(reg_nicksearch,"gline",gline_parse, 0, "GLINE users in newsearch result. Note: evaluation order");
220
221 /* Iteration functionality */
222 registerglobalsearchterm("any",any_parse, "usage: any (generatorfn x) (fn ... (var x) ...)");
223 registerglobalsearchterm("all",all_parse, "usage: all (generatorfn x) (fn ... (var x) ...)");
224 registerglobalsearchterm("var",var_parse, "usage: var variable");
225
226 /* Iterable functions */
227 registersearchterm(reg_nicksearch, "channeliter",channeliter_parse, 0, "Channel Iterable function - usage: (any (channeliter x) (match (var x) #twilight*))"); /* nick only */
228 registersearchterm(reg_chansearch, "nickiter",nickiter_parse, 0, "Nick Iterable function - usage: (any (nickiter x) (match (var x) nickname*))"); /* channel only */
229
230 /* Functions that work on strings?! */
231 registersearchterm(reg_nicksearch, "cumodes", cumodes_parse, 0, "usage: (cumodes (var x) <modes>)");
232 registersearchterm(reg_chansearch, "cumodes", cumodes_parse, 0, "usage: (cumodes (var x) <modes>)");
233
234 /* Notice functionality */
235 registersearchterm(reg_chansearch,"notice",notice_parse, 0, "NOTICE users in newsearch result. Note: evaluation order");
236 registersearchterm(reg_nicksearch,"notice",notice_parse, 0, "NOTICE users in newsearch result. Note: evaluation order");
237
238 /* Nick output filters */
239 regdisp(reg_nicksearch,"default",printnick, 0, "");
240 regdisp(reg_nicksearch,"channels",printnick_channels, 0, "include channels in output");
241
242 /* Channel output filters */
243 regdisp(reg_chansearch,"default",printchannel, 0, "");
244 regdisp(reg_chansearch,"topic",printchannel_topic, 0, "display channel topics");
245 regdisp(reg_chansearch,"services",printchannel_services, 0, "display services on channels");
246
247 /* Nick output filters */
248 regdisp(reg_usersearch,"default",printuser, 0, "");
249
250 }
251
252 void _fini() {
253 searchList *sl, *psl;
254 int i,n;
255 Command *cmdlist[100];
256
257 sl=globalterms;
258 while (sl) {
259 psl = sl;
260 sl=sl->next;
261
262 n=getcommandlist(searchCmdTree,cmdlist,100);
263 for(i=0;i<n;i++) {
264 deregistersearchterm( (searchCmd *)cmdlist[i]->handler, psl->name->content, psl->cmd);
265 }
266
267 freesstring(psl->name);
268 if (psl->help)
269 free (psl->help);
270 free(psl);
271 }
272
273 deregistersearchcommand( reg_nicksearch );
274 deregistersearchcommand( reg_chansearch );
275 deregistersearchcommand( reg_usersearch );
276 destroycommandtree( searchCmdTree );
277 }
278
279 void registerglobalsearchterm(char *term, parseFunc parsefunc, char *help) {
280 int i,n;
281 Command *cmdlist[100];
282 searchList *sl = malloc(sizeof(searchList));
283 if (!sl) {
284 Error("newsearch", ERR_ERROR, "malloc failed: registerglobalsearchterm");
285 return;
286 }
287
288 sl->cmd = parsefunc;
289 sl->name = getsstring(term, NSMAX_COMMAND_LEN);
290 sl->next = NULL;
291 if (help) {
292 int len=strlen(help);
293 sl->help=(char *)malloc(len+1);
294 if(!sl->help) {
295 Error("newsearch", ERR_ERROR, "malloc failed: registerglobalsearchterm");
296 return;
297 }
298 strncpy(sl->help, help, len);
299 sl->help[len] = '\0';
300 } else {
301 sl->help=NULL;
302 }
303
304
305 if ( globalterms != NULL ) {
306 sl->next = globalterms;
307 }
308 globalterms = sl;
309
310 n=getcommandlist(searchCmdTree,cmdlist,100);
311 for(i=0;i<n;i++) {
312 /* maxparams is set to 1 to indicate a global term */
313 /* access level is set to 0 for all global terms */
314 addcommandexttotree( ((searchCmd *)cmdlist[i]->handler)->searchtree,term, 0, 1, (CommandHandler) parsefunc, help);
315 }
316 }
317
318 void deregisterglobalsearchterm(char *term, parseFunc parsefunc) {
319 int i,n;
320 Command *cmdlist[100];
321 searchList *sl, *psl=NULL;
322
323 for (sl=globalterms; sl; sl=sl->next) {
324 if ( strcmp( sl->name->content, term) == 0 ) {
325 break;
326 }
327 psl = sl;
328 }
329
330 if (sl) {
331 if( psl ) {
332 psl->next = sl->next;
333 }
334
335 n=getcommandlist(searchCmdTree,cmdlist,100);
336 for(i=0;i<n;i++) {
337 deletecommandfromtree( ((searchCmd *)cmdlist[i]->handler)->searchtree, term, (CommandHandler) parsefunc);
338 }
339 freesstring(sl->name);
340 free(sl);
341 }
342 }
343
344 void registersearchterm(searchCmd *cmd, char *term, parseFunc parsefunc, int level, char *help) {
345 /* NOTE: global terms are added to the tree elsewhere as we set maxparams to 1 to indicate global */
346 addcommandexttotree(cmd->searchtree, term, level, 0, (CommandHandler) parsefunc, help);
347 }
348
349 void deregistersearchterm(searchCmd *cmd, char *term, parseFunc parsefunc) {
350 /* NOTE: global terms are removed from the tree within deregisterglobalsearchterm */
351 deletecommandfromtree(cmd->searchtree, term, (CommandHandler) parsefunc);
352 }
353
354 static void controlwallwrapper(int level, char *format, ...) __attribute__ ((format (printf, 2, 3)));
355 static void controlwallwrapper(int level, char *format, ...) {
356 char buf[1024];
357 va_list ap;
358
359 va_start(ap, format);
360 vsnprintf(buf, sizeof(buf), format, ap);
361 controlwall(NO_OPER, level, "%s", buf);
362 va_end(ap);
363 }
364
365 int parseopts(int cargc, char **cargv, int *arg, int *limit, void **subset, void *display, CommandTree *sl, replyFunc reply, void *sender) {
366 char *ch;
367 Command *cmd;
368 struct irc_in_addr sin; unsigned char bits;
369
370 if (*cargv[0] == '-') {
371 /* options */
372 (*arg)++;
373
374 for (ch=cargv[0]+1;*ch;ch++) {
375 switch(*ch) {
376 case 'l':
377 if (cargc<*arg) {
378 reply(sender,"Error: -l switch requires an argument (for help, see help <searchcmd>)");
379 return CMD_ERROR;
380 }
381 *limit=strtoul(cargv[(*arg)++],NULL,10);
382 break;
383
384 case 'd':
385 if (cargc<*arg) {
386 reply(sender,"Error: -d switch requires an argument (for help, see help <searchcmd>)");
387 return CMD_ERROR;
388 }
389 cmd=findcommandintree(sl, cargv[*arg],1);
390 if (!cmd) {
391 reply(sender,"Error: unknown output format %s (for help, see help <searchcmd>)",cargv[*arg]);
392 return CMD_ERROR;
393 }
394 if ( !controlpermitted( cmd->level, sender) ) {
395 reply(sender,"Error: Access Denied for output format %s (for help, see help <searchcmd>)", cargv[*arg]);
396 return CMD_ERROR;
397 }
398 *((void **)display)=(void *)cmd->handler;
399 (*arg)++;
400 break;
401
402 case 's':
403 if (subset == NULL) {
404 reply(sender,"Error: -s switch not supported for this search.");
405 return CMD_ERROR;
406 }
407 if (cargc<*arg) {
408 reply(sender,"Error: -s switch requires an argument (for help, see help <searchcmd>)");
409 return CMD_ERROR;
410 }
411 if (ipmask_parse(cargv[*arg], &sin, &bits) == 0) {
412 reply(sender, "Error: Invalid CIDR mask supplied (for help, see help <searchcmd>)");
413 return CMD_ERROR;
414 }
415 *subset = (void *)refnode(iptree, &sin, bits);
416 (*arg)++;
417 break;
418
419 default:
420 reply(sender,"Unrecognised flag -%c. (for help, see help <searchcmd>)",*ch);
421 return CMD_ERROR;
422 }
423 }
424 }
425
426 return CMD_OK;
427 }
428
429 void newsearch_ctxinit(searchCtx *ctx, searchParseFunc searchfn, replyFunc replyfn, wallFunc wallfn, void *arg, searchCmd *cmd, nick *np, void *displayfn, int limit) {
430 memset(ctx, 0, sizeof(searchCtx));
431
432 ctx->reply = replyfn;
433 ctx->wall = wallfn;
434 ctx->parser = searchfn;
435 ctx->arg = arg;
436 ctx->searchcmd = cmd;
437 ctx->sender = np;
438 ctx->limit = limit;
439 ctx->displayfn = displayfn;
440 }
441
442 int do_nicksearch_real(replyFunc reply, wallFunc wall, void *source, int cargc, char **cargv) {
443 nick *sender = source;
444 int limit=500;
445 int arg=0;
446 NickDisplayFunc display=defaultnickfn;
447 int ret;
448 parsertree *tree;
449
450 if (cargc<1) {
451 reply( sender, "Usage: [flags] <criteria>");
452 reply( sender, "For help, see help nicksearch");
453 return CMD_OK;
454 }
455
456 ret = parseopts(cargc, cargv, &arg, &limit, NULL, (void *)&display, reg_nicksearch->outputtree, reply, sender);
457 if(ret != CMD_OK)
458 return ret;
459
460 if (arg>=cargc) {
461 reply(sender,"No search terms - aborting.");
462 return CMD_ERROR;
463 }
464
465 if (arg<(cargc-1)) {
466 rejoinline(cargv[arg],cargc-arg);
467 }
468
469 tree = parse_string(reg_nicksearch, cargv[arg]);
470 if(!tree) {
471 displaystrerror(reply, sender, cargv[arg]);
472 return CMD_ERROR;
473 }
474
475 ast_nicksearch(tree->root, reply, sender, wall, display, NULL, NULL, limit);
476
477 parse_free(tree);
478
479 return CMD_OK;
480 }
481
482 int do_nicksearch(void *source, int cargc, char **cargv) {
483 return do_nicksearch_real(controlreply, controlwallwrapper, source, cargc, cargv);
484 }
485
486 void nicksearch_exe(struct searchNode *search, searchCtx *ctx) {
487 int i, j;
488 int matches = 0;
489 unsigned int cmarker;
490 unsigned int tchans=0,uchans=0;
491 struct channel **cs;
492 nick *np, *sender = ctx->sender;
493 senderNSExtern = sender;
494 NickDisplayFunc display = ctx->displayfn;
495 int limit = ctx->limit;
496
497 /* Get a marker value to mark "seen" channels for unique count */
498 cmarker=nextchanmarker();
499
500 /* The top-level node needs to return a BOOL */
501 search=coerceNode(ctx, search, RETURNTYPE_BOOL);
502
503 for (i=0;i<NICKHASHSIZE;i++) {
504 for (np=nicktable[i];np;np=np->next) {
505 if ((search->exe)(ctx, search, np)) {
506 /* Add total channels */
507 tchans += np->channels->cursi;
508
509 /* Check channels for uniqueness */
510 cs=(channel **)np->channels->content;
511 for (j=0;j<np->channels->cursi;j++) {
512 if (cs[j]->index->marker != cmarker) {
513 cs[j]->index->marker=cmarker;
514 uchans++;
515 }
516 }
517
518 if (matches<limit)
519 display(ctx, sender, np);
520
521 if (matches==limit)
522 ctx->reply(sender, "--- More than %d matches, skipping the rest",limit);
523 matches++;
524 }
525 }
526 }
527
528 ctx->reply(sender,"--- End of list: %d matches; users were on %u channels (%u unique, %.1f average clones)",
529 matches, tchans, uchans, (float)tchans/uchans);
530 }
531
532 int do_chansearch_real(replyFunc reply, wallFunc wall, void *source, int cargc, char **cargv) {
533 nick *sender = source;
534 int limit=500;
535 int arg=0;
536 ChanDisplayFunc display=defaultchanfn;
537 int ret;
538 parsertree *tree;
539
540 if (cargc<1) {
541 reply( sender, "Usage: [flags] <criteria>");
542 reply( sender, "For help, see help chansearch");
543 return CMD_OK;
544 }
545
546 ret = parseopts(cargc, cargv, &arg, &limit, NULL, (void *)&display, reg_chansearch->outputtree, reply, sender);
547 if(ret != CMD_OK)
548 return ret;
549
550 if (arg>=cargc) {
551 reply(sender,"No search terms - aborting.");
552 return CMD_ERROR;
553 }
554
555 if (arg<(cargc-1)) {
556 rejoinline(cargv[arg],cargc-arg);
557 }
558
559 tree = parse_string(reg_chansearch, cargv[arg]);
560 if(!tree) {
561 displaystrerror(reply, sender, cargv[arg]);
562 return CMD_ERROR;
563 }
564
565 ast_chansearch(tree->root, reply, sender, wall, display, NULL, NULL, limit);
566
567 parse_free(tree);
568
569 return CMD_OK;
570 }
571
572 int do_chansearch(void *source, int cargc, char **cargv) {
573 return do_chansearch_real(controlreply, controlwallwrapper, source, cargc, cargv);
574 }
575
576 void chansearch_exe(struct searchNode *search, searchCtx *ctx) {
577 int i;
578 chanindex *cip;
579 int matches = 0;
580 nick *sender = ctx->sender;
581 senderNSExtern = sender;
582 ChanDisplayFunc display = ctx->displayfn;
583 int limit = ctx->limit;
584
585 search=coerceNode(ctx, search, RETURNTYPE_BOOL);
586
587 for (i=0;i<CHANNELHASHSIZE;i++) {
588 for (cip=chantable[i];cip;cip=cip->next) {
589 if ((search->exe)(ctx, search, cip)) {
590 if (matches<limit)
591 display(ctx, sender, cip);
592 if (matches==limit)
593 ctx->reply(sender, "--- More than %d matches, skipping the rest",limit);
594 matches++;
595 }
596 }
597 }
598
599 ctx->reply(sender,"--- End of list: %d matches", matches);
600 }
601
602 int do_usersearch_real(replyFunc reply, wallFunc wall, void *source, int cargc, char **cargv) {
603 nick *sender = source;
604 int limit=500;
605 int arg=0;
606 UserDisplayFunc display=defaultuserfn;
607 int ret;
608 parsertree *tree;
609
610 if (cargc<1) {
611 reply( sender, "Usage: [flags] <criteria>");
612 reply( sender, "For help, see help usersearch");
613 return CMD_OK;
614 }
615
616 ret = parseopts(cargc, cargv, &arg, &limit, NULL, (void *)&display, reg_usersearch->outputtree, reply, sender);
617 if(ret != CMD_OK)
618 return ret;
619
620 if (arg>=cargc) {
621 reply(sender,"No search terms - aborting.");
622 return CMD_ERROR;
623 }
624
625 if (arg<(cargc-1)) {
626 rejoinline(cargv[arg],cargc-arg);
627 }
628
629 tree = parse_string(reg_usersearch, cargv[arg]);
630 if(!tree) {
631 displaystrerror(reply, sender, cargv[arg]);
632 return CMD_ERROR;
633 }
634
635 ast_usersearch(tree->root, reply, sender, wall, display, NULL, NULL, limit);
636
637 parse_free(tree);
638
639 return CMD_OK;
640 }
641
642 int do_usersearch(void *source, int cargc, char **cargv) {
643 return do_usersearch_real(controlreply, controlwallwrapper, source, cargc, cargv);
644 }
645
646 void usersearch_exe(struct searchNode *search, searchCtx *ctx) {
647 int i;
648 authname *aup;
649 int matches = 0;
650 nick *sender = ctx->sender;
651 int limit = ctx->limit;
652 UserDisplayFunc display = ctx->displayfn;
653 senderNSExtern = sender;
654
655 search=coerceNode(ctx, search, RETURNTYPE_BOOL);
656
657 for (i=0;i<AUTHNAMEHASHSIZE;i++) {
658 for (aup=authnametable[i];aup;aup=aup->next) {
659 if ((search->exe)(ctx, search, aup)) {
660 if (matches<limit)
661 display(ctx, sender, aup);
662 if (matches==limit)
663 ctx->reply(sender, "--- More than %d matches, skipping the rest",limit);
664 matches++;
665 }
666 }
667 }
668
669 ctx->reply(sender,"--- End of list: %d matches", matches);
670 }
671
672 /* Free a coerce node */
673 void free_coerce(searchCtx *ctx, struct searchNode *thenode) {
674 struct coercedata *cd=thenode->localdata;
675
676 cd->child->free(ctx, cd->child);
677 free(thenode->localdata);
678 free(thenode);
679 }
680
681 /* Free a coerce node with a stringbuf allocated */
682 void free_coercestring(searchCtx *ctx, struct searchNode *thenode) {
683 free(((struct coercedata *)thenode->localdata)->u.stringbuf);
684 free_coerce(ctx, thenode);
685 }
686
687 /* exe_tostr_null: return the constant string */
688 void *exe_tostr_null(searchCtx *ctx, struct searchNode *thenode, void *theinput) {
689 struct coercedata *cd=thenode->localdata;
690
691 return cd->u.stringbuf;
692 }
693
694 /* exe_val_null: return the constant value */
695 void *exe_val_null(searchCtx *ctx, struct searchNode *thenode, void *theinput) {
696 struct coercedata *cd=thenode->localdata;
697
698 return (void *)cd->u.val;
699 }
700
701 /* Lots of very dull type conversion functions */
702 void *exe_inttostr(searchCtx *ctx, struct searchNode *thenode, void *theinput) {
703 struct coercedata *cd=thenode->localdata;
704
705 sprintf(cd->u.stringbuf, "%lu", (unsigned long)(cd->child->exe)(ctx, cd->child, theinput));
706
707 return cd->u.stringbuf;
708 }
709
710 void *exe_booltostr(searchCtx *ctx, struct searchNode *thenode, void *theinput) {
711 struct coercedata *cd=thenode->localdata;
712
713 if ((cd->child->exe)(ctx, cd->child, theinput)) {
714 sprintf(cd->u.stringbuf,"1");
715 } else {
716 cd->u.stringbuf[0]='\0';
717 }
718
719 return cd->u.stringbuf;
720 }
721
722 void *exe_strtoint(searchCtx *ctx, struct searchNode *thenode, void *theinput) {
723 struct coercedata *cd=thenode->localdata;
724
725 return (void *)strtoul((cd->child->exe)(ctx,cd->child,theinput),NULL,10);
726 }
727
728 void *exe_booltoint(searchCtx *ctx, struct searchNode *thenode, void *theinput) {
729 struct coercedata *cd=thenode->localdata;
730
731 /* Don't need to do anything */
732 return (cd->child->exe)(ctx, cd->child, theinput);
733 }
734
735 void *exe_strtobool(searchCtx *ctx, struct searchNode *thenode, void *theinput) {
736 struct coercedata *cd=thenode->localdata;
737 char *ch=(cd->child->exe)(ctx, cd->child, theinput);
738
739 if (!ch || *ch=='\0' || (*ch=='0' && ch[1]=='\0')) {
740 return (void *)0;
741 } else {
742 return (void *)1;
743 }
744 }
745
746 void *exe_inttobool(searchCtx *ctx, struct searchNode *thenode, void *theinput) {
747 struct coercedata *cd=thenode->localdata;
748
749 if ((cd->child->exe)(ctx, cd->child, theinput)) {
750 return (void *)1;
751 } else {
752 return (void *)0;
753 }
754 }
755
756 struct searchNode *coerceNode(searchCtx *ctx, struct searchNode *thenode, int type) {
757 struct searchNode *anode;
758 struct coercedata *cd;
759
760 /* You can't coerce a NULL */
761 if (!thenode)
762 return NULL;
763
764 /* No effort required to coerce to the same type */
765 if (type==(thenode->returntype & RETURNTYPE_TYPE))
766 return thenode;
767
768 anode=(struct searchNode *)malloc(sizeof(struct searchNode));
769 anode->localdata=cd=(struct coercedata *)malloc(sizeof(struct coercedata));
770 cd->child=thenode;
771 anode->returntype=type; /* We'll return what they want, always */
772 anode->free=free_coerce;
773
774 switch(type) {
775 case RETURNTYPE_STRING:
776 /* For a string we'll need a buffer */
777 /* A 64-bit number prints out to 20 digits, this leaves some slack */
778 cd->u.stringbuf=malloc(25);
779 anode->free=free_coercestring;
780
781 switch(thenode->returntype & RETURNTYPE_TYPE) {
782 default:
783 case RETURNTYPE_INT:
784 if (thenode->returntype & RETURNTYPE_CONST) {
785 /* Constant node: sort it out now */
786 sprintf(cd->u.stringbuf, "%lu", (unsigned long)thenode->exe(ctx, thenode, NULL));
787 anode->exe=exe_tostr_null;
788 anode->returntype |= RETURNTYPE_CONST;
789 } else {
790 /* Variable data */
791 anode->exe=exe_inttostr;
792 }
793 break;
794
795 case RETURNTYPE_BOOL:
796 if (thenode->returntype & RETURNTYPE_CONST) {
797 /* Constant bool value */
798 if (thenode->exe(ctx, thenode,NULL)) {
799 /* True! */
800 sprintf(cd->u.stringbuf, "1");
801 } else {
802 cd->u.stringbuf[0] = '\0';
803 }
804 anode->exe=exe_tostr_null;
805 anode->returntype |= RETURNTYPE_CONST;
806 } else {
807 /* Variable bool value */
808 anode->exe=exe_booltostr;
809 }
810 break;
811 }
812 break;
813
814 case RETURNTYPE_INT:
815 /* we want an int */
816 switch (thenode->returntype & RETURNTYPE_TYPE) {
817 case RETURNTYPE_STRING:
818 if (thenode->returntype & RETURNTYPE_CONST) {
819 cd->u.val=strtoul((thenode->exe)(ctx, thenode, NULL), NULL, 10);
820 anode->exe=exe_val_null;
821 anode->returntype |= RETURNTYPE_CONST;
822 } else {
823 anode->exe=exe_strtoint;
824 }
825 break;
826
827 default:
828 case RETURNTYPE_BOOL:
829 if (thenode->returntype & RETURNTYPE_CONST) {
830 if ((thenode->exe)(ctx, thenode,NULL))
831 cd->u.val=1;
832 else
833 cd->u.val=0;
834
835 anode->exe=exe_val_null;
836 anode->returntype |= RETURNTYPE_CONST;
837 } else {
838 anode->exe=exe_booltoint;
839 }
840 break;
841 }
842 break;
843
844 default:
845 case RETURNTYPE_BOOL:
846 /* we want a bool */
847 switch (thenode->returntype & RETURNTYPE_TYPE) {
848 case RETURNTYPE_STRING:
849 if (thenode->returntype & RETURNTYPE_CONST) {
850 char *rv=(char *)((thenode->exe)(ctx, thenode, NULL));
851 if (!rv || *rv=='\0' || (*rv=='0' && rv[1]=='\0'))
852 cd->u.val=0;
853 else
854 cd->u.val=1;
855
856 anode->exe=exe_val_null;
857 anode->returntype |= RETURNTYPE_CONST;
858 } else {
859 anode->exe=exe_strtobool;
860 }
861 break;
862
863 default:
864 case RETURNTYPE_INT:
865 if (thenode->returntype & RETURNTYPE_CONST) {
866 if ((thenode->exe)(ctx, thenode,NULL))
867 cd->u.val=1;
868 else
869 cd->u.val=0;
870
871 anode->exe=exe_val_null;
872 anode->returntype |= RETURNTYPE_CONST;
873 } else {
874 anode->exe=exe_inttobool;
875 }
876 break;
877 }
878 break;
879 }
880
881 return anode;
882 }
883
884 /* Literals always return constant strings... */
885 void *literal_exe(searchCtx *ctx, struct searchNode *thenode, void *theinput) {
886 if (thenode->localdata)
887 return ((sstring *)thenode->localdata)->content;
888 else
889 return "";
890 }
891
892 void literal_free(searchCtx *ctx, struct searchNode *thenode) {
893 freesstring(thenode->localdata);
894 free(thenode);
895 }
896
897 void nssnprintf(char *buf, size_t size, const char *format, nick *np) {
898 StringBuf b;
899 const char *p;
900 char *c;
901 char hostbuf[512];
902
903 if(size == 0)
904 return;
905
906 b.buf = buf;
907 b.capacity = size;
908 b.len = 0;
909
910 for(p=format;*p;p++) {
911 if(*p != '%') {
912 if(!sbaddchar(&b, *p))
913 break;
914 continue;
915 }
916 p++;
917 if(*p == '\0')
918 break;
919 if(*p == '%') {
920 if(!sbaddchar(&b, *p))
921 break;
922 continue;
923 }
924
925 c = NULL;
926 switch(*p) {
927 case 'n':
928 c = np->nick; break;
929 case 'i':
930 c = np->ident; break;
931 case 'h':
932 c = np->host->name->content; break;
933 case 'I':
934 snprintf(hostbuf, sizeof(hostbuf), "%s", IPtostr(np->p_ipaddr));
935 c = hostbuf;
936 break;
937 case 'u':
938 snprintf(hostbuf, sizeof(hostbuf), "%s!%s@%s", np->nick, np->ident, IPtostr(np->p_ipaddr));
939 c = hostbuf;
940 break;
941 default:
942 c = "(bad format specifier)";
943 }
944 if(c)
945 if(!sbaddstr(&b, c))
946 break;
947 }
948
949 sbterminate(&b);
950
951 /* not required */
952 /*
953 buf[size-1] = '\0';
954 */
955 }
956
957 static char *var_tochar(searchCtx *ctx, char *arg, searchNode **variable) {
958 *variable = ctx->parser(ctx, arg);
959 if (!(*variable = coerceNode(ctx, *variable, RETURNTYPE_STRING)))
960 return NULL;
961
962 if(!((*variable)->returntype & RETURNTYPE_CONST)) {
963 parseError = "only constant variables allowed";
964 ((*variable)->free)(ctx, *variable);
965 return NULL;
966 }
967
968 return (char *)((*variable)->exe)(ctx, *variable, NULL);
969 }
970
971 void free_val_null(searchCtx *ctx, struct searchNode *thenode) {
972 }
973
974 struct searchVariable *var_register(searchCtx *ctx, char *arg, int type) {
975 searchNode *variable;
976 struct searchVariable *us;
977 char *var;
978 int i;
979
980 if(ctx->lastvar >= MAX_VARIABLES) {
981 parseError = "Maximum number of variables reached";
982 return NULL;
983 }
984
985 us = &ctx->vars[ctx->lastvar];
986
987 var = var_tochar(ctx, arg, &variable);
988 if(!var)
989 return NULL;
990
991 strlcpy(us->name, var, sizeof(us->name));
992 (variable->free)(ctx, variable);
993
994 for(i=0;i<ctx->lastvar;i++) {
995 if(!strcmp(us->name, ctx->vars[i].name)) {
996 parseError = "variable name already in use";
997 return NULL;
998 }
999 }
1000
1001 ctx->lastvar++;
1002 us->data.returntype = type;
1003 us->data.localdata = &us->cdata;
1004 us->data.exe = exe_val_null;
1005 us->data.free = free_val_null;
1006
1007 us->cdata.child = NULL;
1008 return us;
1009 }
1010
1011 searchNode *var_get(searchCtx *ctx, char *arg) {
1012 searchNode *variable, *found = NULL;
1013 int i;
1014 char *var = var_tochar(ctx, arg, &variable);
1015 if(!var)
1016 return NULL;
1017
1018 for(i=0;i<ctx->lastvar;i++) {
1019 if(!strcmp(var, ctx->vars[i].name)) {
1020 found = &ctx->vars[i].data;
1021 break;
1022 }
1023 }
1024 (variable->free)(ctx, variable);
1025
1026 if(!found)
1027 parseError = "variable not found";
1028 return found;
1029 }
1030
1031 void var_setstr(struct searchVariable *v, char *data) {
1032 v->cdata.u.stringbuf = data;
1033 }
1034
1035 void displaystrerror(replyFunc reply, nick *np, const char *input) {
1036 char buf[515];
1037
1038 if((parseStrErrorPos >= 0) && (parseStrErrorPos < sizeof(buf) - 3)) {
1039 int i;
1040
1041 for(i=0;i<parseStrErrorPos;i++)
1042 buf[i] = ' ';
1043
1044 buf[i++] = '^';
1045 buf[i] = '\0';
1046
1047 reply(np, "%s", input);
1048 reply(np, "%s", buf);
1049 }
1050
1051 reply(np, "Parse error: %s", parseStrError);
1052 }
1053
1054 struct searchNode *argtoconststr(char *command, searchCtx *ctx, char *arg, char **p) {
1055 struct searchNode *c;
1056 static char errorbuf[512];
1057
1058 c = ctx->parser(ctx, arg);
1059 if (!(c = coerceNode(ctx, c, RETURNTYPE_STRING))) {
1060 snprintf(errorbuf, sizeof(errorbuf), "%s: unable to coerce argument to string", command);
1061 parseError = errorbuf;
1062 return NULL;
1063 }
1064
1065 if (!(c->returntype & RETURNTYPE_CONST)) {
1066 snprintf(errorbuf, sizeof(errorbuf), "%s: constant argument required", command);
1067 parseError = errorbuf;
1068 (c->free)(ctx, c);
1069 return NULL;
1070 }
1071
1072 if(p)
1073 *p = (char *)(c->exe)(ctx, c, NULL);
1074
1075 return c;
1076 }