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