newsearch changes to support addition of trust_search/patriciasearch

[irc/quakenet/newserv.git] / newsearch / newsearch_ast.c

diff --git a/newsearch/newsearch_ast.c b/newsearch/newsearch_ast.c
index f79f019b861e231f49c24d453bc149ee55e7d834..5925d447f4fa4870434a073f6eafc7c4d66b91e1 100644 (file)
--- a/newsearch/newsearch_ast.c
+++ b/newsearch/newsearch_ast.c
@@ -1,6 +1,7 @@
 #include "newsearch.h"
 #include "../lib/sstring.h"
 #include "../lib/strlfunc.h"
+#include "../lib/stringbuf.h"
 #include <stdarg.h>
 #include <string.h>
 
@@ -76,7 +77,7 @@ static void cachepush(searchASTCache *cache, searchASTExpr *expr) {
 }
 
 /* ast parser, the way we pass context around is very very hacky... */
-searchNode *search_astparse(searchCtx *ctx, int type, char *loc) {
+searchNode *search_astparse(searchCtx *ctx, char *loc) {
   searchASTCache *cache = ctx->arg;
   searchASTExpr *expr = cachesearch(cache, (exprunion *)&loc);
   searchNode *node;
@@ -123,7 +124,7 @@ searchNode *search_astparse(searchCtx *ctx, int type, char *loc) {
         }
       }
 
-      node = expr->u.child->fn(ctx, type, expr->u.child->argc, v);
+      node = expr->u.child->fn(ctx, expr->u.child->argc, v);
       free(v);
       return node;
    default:
@@ -132,7 +133,7 @@ searchNode *search_astparse(searchCtx *ctx, int type, char *loc) {
   }
 }
 
-int ast_nicksearch(searchASTExpr *tree, replyFunc reply, void *sender, wallFunc wall, NickDisplayFunc display, int limit) {
+int ast_nicksearch(searchASTExpr *tree, replyFunc reply, void *sender, wallFunc wall, NickDisplayFunc display, HeaderFunc header, void *headerarg, int limit) {
   searchCtx ctx;
   searchASTCache cache;
   searchNode *search;
@@ -141,20 +142,19 @@ int ast_nicksearch(searchASTExpr *tree, replyFunc reply, void *sender, wallFunc
   memset(&cache, 0, sizeof(cache));
   cache.tree = tree;
 
-  ctx.reply = reply;
-  ctx.wall = wall;
-  ctx.parser = search_astparse;
-  ctx.arg = (void *)&cache;
+  newsearch_ctxinit(&ctx, search_astparse, reply, wall, &cache, reg_nicksearch);
 
   buf[0] = '\0';
-  reply(sender, "Parsing: %s", ast_printtree(buf, sizeof(buf), tree));
-  search = ctx.parser(&ctx, SEARCHTYPE_NICK, (char *)tree);
+  reply(sender, "Parsing: %s", ast_printtree(buf, sizeof(buf), tree, reg_nicksearch));
+  search = ctx.parser(&ctx, (char *)tree);
   if(!search) {
     reply(sender, "Parse error: %s", parseError);
     return CMD_ERROR;
   }
 
   reply(sender, "Executing...");
+  if(header)  
+    header(sender, headerarg);
   nicksearch_exe(search, &ctx, sender, display, limit);
 
   (search->free)(&ctx, search);
@@ -162,26 +162,25 @@ int ast_nicksearch(searchASTExpr *tree, replyFunc reply, void *sender, wallFunc
   return CMD_OK;
 }
 
-int ast_chansearch(searchASTExpr *tree, replyFunc reply, void *sender, wallFunc wall, ChanDisplayFunc display, int limit) {
+int ast_chansearch(searchASTExpr *tree, replyFunc reply, void *sender, wallFunc wall, ChanDisplayFunc display, HeaderFunc header, void *headerarg, int limit) {
   searchCtx ctx;
   searchASTCache cache;
   searchNode *search;
   char buf[1024];
 
-  ctx.reply = reply;
-  ctx.wall = wall;
-  ctx.parser = search_astparse;
-  ctx.arg = (void *)&cache;
+  newsearch_ctxinit(&ctx, search_astparse, reply, wall, &cache, reg_chansearch);
 
   buf[0] = '\0';
-  reply(sender, "Parsing: %s", ast_printtree(buf, sizeof(buf), tree));
-  search = ctx.parser(&ctx, SEARCHTYPE_CHANNEL, (char *)tree);
+  reply(sender, "Parsing: %s", ast_printtree(buf, sizeof(buf), tree, reg_chansearch));
+  search = ctx.parser(&ctx, (char *)tree);
   if(!search) {
     reply(sender, "Parse error: %s", parseError);
     return CMD_ERROR;
   }
 
   reply(sender, "Executing...");
+  if(header)  
+    header(sender, headerarg);
   chansearch_exe(search, &ctx, sender, display, limit);
 
   (search->free)(&ctx, search);
@@ -189,31 +188,75 @@ int ast_chansearch(searchASTExpr *tree, replyFunc reply, void *sender, wallFunc
   return CMD_OK;
 }
 
-/* horribly, horribly inefficient -- don't call me very often! */
-char *ast_printtree(char *buf, size_t bufsize, searchASTExpr *expr) {
+int ast_usersearch(searchASTExpr *tree, replyFunc reply, void *sender, wallFunc wall, UserDisplayFunc display, HeaderFunc header, void *headerarg, int limit) {
+  searchCtx ctx;
+  searchASTCache cache;
+  searchNode *search;
+  char buf[1024];
+
+  memset(&cache, 0, sizeof(cache));
+  cache.tree = tree;
+
+  newsearch_ctxinit(&ctx, search_astparse, reply, wall, &cache, reg_usersearch);
+
+  buf[0] = '\0';
+  reply(sender, "Parsing: %s", ast_printtree(buf, sizeof(buf), tree, reg_usersearch));
+  search = ctx.parser(&ctx, (char *)tree);
+  if(!search) {
+    reply(sender, "Parse error: %s", parseError);
+    return CMD_ERROR;
+  }
+
+  reply(sender, "Executing...");
+  if(header)  
+    header(sender, headerarg);
+  usersearch_exe(search, &ctx, sender, display, limit);
+
+  (search->free)(&ctx, search);
+
+  return CMD_OK;
+}
+
+
+/* horribly inefficient -- don't call me very often! */
+static char *ast_printtree_real(StringBuf *buf, searchASTExpr *expr, searchCmd *cmd) {
   char lbuf[256];
   if(expr->type == AST_NODE_CHILD) {    
     int i;
-    sstring *command = getcommandname(searchTree, (void *)expr->u.child->fn);
-    char *space = expr->u.child->argc>0?" ":"";
+    sstring *command = getcommandname(cmd->searchtree, (void *)expr->u.child->fn);
 
     if(command) {
-      snprintf(lbuf, sizeof(lbuf), "(%s%s", command->content, space);
+      snprintf(lbuf, sizeof(lbuf), "(%s", command->content);
     } else {
-      snprintf(lbuf, sizeof(lbuf), "(%p%s", expr->u.child->fn, space);
+      snprintf(lbuf, sizeof(lbuf), "(%p", expr->u.child->fn);
     }
-    strlcat(buf, lbuf, bufsize);
+    sbaddstr(buf, lbuf);
 
-    for(i=0;i<expr->u.child->argc;i++)
-      ast_printtree(buf, bufsize, expr->u.child->argv[i]);
+    for(i=0;i<expr->u.child->argc;i++) {
+      sbaddchar(buf, ' ');
+      ast_printtree_real(buf, expr->u.child->argv[i], cmd);
+    }
+    sbaddchar(buf, ')');
 
-    strlcat(buf, ")", bufsize);
   } else if(expr->type == AST_NODE_LITERAL) {
-    snprintf(lbuf, sizeof(lbuf), " %s", expr->u.literal);
-    strlcat(buf, lbuf, bufsize);
+    sbaddstr(buf, expr->u.literal);
   } else {
-    strlcat(buf, " ??? ", bufsize);
+    sbaddstr(buf, "???");
   }
 
-  return buf;
+  return buf->buf;
+}
+
+char *ast_printtree(char *buf, size_t bufsize, searchASTExpr *expr, searchCmd *cmd) {
+  StringBuf b;
+  char *p;
+
+  b.capacity = bufsize;
+  b.len = 0;
+  b.buf = buf;
+
+  p = ast_printtree_real(&b, expr, cmd);
+ 
+  sbterminate(&b);
+  return p;
 }