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