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