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