patriciasearch/patriciasearch.c

   1 #include <stdio.h>
   2 #include <stdarg.h>
   3 #include <string.h>
   4
   5 #include "../control/control.h"
   6 #include "../irc/irc_config.h"
   7 #include "../lib/irc_string.h"
   8 #include "../parser/parser.h"
   9 #include "../lib/splitline.h"
  10 #include "../lib/version.h"
  11 #include "../lib/stringbuf.h"
  12 #include "../lib/strlfunc.h"
  13 #include "patriciasearch.h"
  14 #include "../lib/version.h"
  15 #include "../newsearch/newsearch.h"
  16
  17 MODULE_VERSION("")
  18
  19 searchCmd *reg_nodesearch;
  20
  21 int do_pnodesearch(void *source, int cargc, char **cargv);
  22
  23 NodeDisplayFunc defaultpnodefn = printnode;
  24
  25 void _init() {
  26   reg_nodesearch = (searchCmd *)registersearchcommand("nodesearch",NO_OPER,do_pnodesearch, printnode);
  27
  28   registersearchterm(reg_nodesearch, "users", ps_users_parse, 0, "");
  29   registersearchterm(reg_nodesearch, "nick", ps_nick_parse, 0, "");
  30   registersearchterm(reg_nodesearch, "ipvsix", ps_ipv6_parse, 0, "");
  31 }
  32
  33 void _fini() {
  34   deregistersearchcommand( reg_nodesearch );
  35 }
  36
  37 static void controlwallwrapper(int level, char *format, ...) {
  38   char buf[1024];
  39   va_list ap;
  40
  41   va_start(ap, format);
  42   vsnprintf(buf, sizeof(buf), format, ap);
  43   controlwall(NO_OPER, level, "%s", buf);
  44   va_end(ap);
  45 }
  46
  47 int do_pnodesearch_real(replyFunc reply, wallFunc wall, void *source, int cargc, char **cargv) {
  48   nick *sender = source;
  49   int limit=500;
  50   int arg=0;
  51   NodeDisplayFunc display=defaultpnodefn;
  52   int ret;
  53   patricia_node_t *subset = iptree->head;
  54   parsertree *tree;
  55
  56   if (cargc<1) {
  57     reply( sender, "Usage: [flags] <criteria>");
  58     reply( sender, "For help, see help nodesearch");
  59     return CMD_OK;
  60   }
  61
  62   ret = parseopts(cargc, cargv, &arg, &limit, (void *)&subset, (void *)&display, reg_nodesearch->outputtree, reply, sender);
  63   if(ret != CMD_OK)
  64     return ret;
  65
  66   if (arg>=cargc) {
  67     reply(sender,"No search terms - aborting.");
  68     return CMD_ERROR;
  69   }
  70
  71   if (arg<(cargc-1)) {
  72     rejoinline(cargv[arg],cargc-arg);
  73   }
  74
  75   tree = parse_string(reg_nodesearch, cargv[arg]);
  76   if(!tree) {
  77     displaystrerror(reply, sender, cargv[arg]);
  78     return CMD_ERROR;
  79   }
  80
  81   ast_nodesearch(tree->root, reply, sender, wall, display, NULL, NULL, limit, NULL);
  82
  83   parse_free(tree);
  84
  85   return CMD_OK;
  86 }
  87
  88 int do_pnodesearch(void *source, int cargc, char **cargv) {
  89   return do_pnodesearch_real(controlreply, controlwallwrapper, source, cargc, cargv);
  90 }
  91
  92 void pnodesearch_exe(struct searchNode *search, searchCtx *ctx, patricia_node_t *subset) {
  93   int matches = 0;
  94   patricia_node_t *node;
  95   nick *sender = ctx->sender;
  96   senderNSExtern = sender;
  97   int limit = ctx->limit;
  98   NodeDisplayFunc display = ctx->displayfn;
  99
 100   /* Get a marker value to mark "seen" channels for unique count */
 101   //nmarker=nextnodemarker();
 102
 103   /* The top-level node needs to return a BOOL */
 104   search=coerceNode(ctx, search, RETURNTYPE_BOOL);
 105
 106   PATRICIA_WALK(subset, node) {
 107     if ((search->exe)(ctx, search, node)) {
 108       if (matches<limit)
 109         display(ctx, sender, node);
 110
 111       if (matches==limit)
 112         ctx->reply(sender, "--- More than %d matches, skipping the rest",limit);
 113       matches++;
 114     }
 115   }
 116   PATRICIA_WALK_END;
 117
 118   ctx->reply(sender,"--- End of list: %d matches",
 119                 matches);
 120 }
 121
 122