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"
19 CommandTree
*searchCmdTree
;
20 searchList
*globalterms
= NULL
;
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
);
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
*);
31 UserDisplayFunc defaultuserfn
= printuser
;
32 NickDisplayFunc defaultnickfn
= printnick
;
33 ChanDisplayFunc defaultchanfn
= printchannel
;
35 searchCmd
*reg_nicksearch
, *reg_chansearch
, *reg_usersearch
;
36 void displaycommandhelp(nick
*, Command
*);
37 void displaystrerror(replyFunc
, nick
*, const char *);
39 searchCmd
*registersearchcommand(char *name
, int level
, CommandHandler cmd
, void *defaultdisplayfunc
) {
43 registercontrolhelpfunccmd(name
, NO_OPER
,4, cmd
, &displaycommandhelp
);
44 acmd
=(struct searchCmd
*)malloc(sizeof(struct searchCmd
));
46 Error("newsearch", ERR_ERROR
, "malloc failed: registersearchcommand");
51 acmd
->name
= getsstring( name
, NSMAX_COMMAND_LEN
);
52 acmd
->outputtree
= newcommandtree();
53 acmd
->searchtree
= newcommandtree();
55 addcommandtotree(searchCmdTree
, name
, 0, 0, (CommandHandler
)acmd
);
57 for (sl
=globalterms
; sl
; sl
=sl
->next
) {
58 addcommandexttotree(acmd
->searchtree
, sl
->name
->content
, 0, 1, (CommandHandler
)sl
->cmd
, sl
->help
);
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
);
73 void displaycommandhelp(nick
*np
, Command
*cmd
) {
75 Command
*cmdlist
[100], *acmdlist
[100];
78 n
=getcommandlist(searchCmdTree
,cmdlist
,100);
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
)
83 acmd
= ((searchCmd
*)(cmdlist
[i
]->handler
));
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");
93 m
=getcommandlist(acmd
->outputtree
,acmdlist
,100);
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
);
100 controlreply(np
, "%s\n", acmdlist
[j
]->command
->content
);
104 controlreply(np
, " \n");
105 controlreply(np
, "Available Global Commands and Operators:\n" );
106 m
=getcommandlist(acmd
->searchtree
,acmdlist
,100);
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
);
113 controlreply(np
, "%s\n", acmdlist
[j
]->command
->content
);
117 controlreply(np
, " \n");
118 controlreply(np
, "Available Commands and Operators for %s:\n", acmd
->name
->content
);
120 m
=getcommandlist(acmd
->searchtree
,acmdlist
,100);
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
);
127 controlreply(np
, "%s\n", acmdlist
[j
]->command
->content
);
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
);
137 void unregdisp( searchCmd
*cmd
, const char *name
, void *handler
) {
138 deletecommandfromtree(cmd
->outputtree
, name
, (CommandHandler
) handler
);
141 void *findcommandinlist( searchList
*sl
, char *name
){
143 if(strcmp(sl
->name
->content
,name
) == 0 ) {
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
;
157 searchCmdTree
=newcommandtree();
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
);
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))" );
168 registerglobalsearchterm("eq",eq_parse
, "usage: (eq (X) Y)");
170 registerglobalsearchterm("lt",lt_parse
, "usage: (lt (X) int)");
171 registerglobalsearchterm("gt",gt_parse
, "usage: (gt (X) int)");
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)");
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
, "authname",authname_parse
, 0, "User's current authname or false"); /* nick only */
182 registersearchterm(reg_nicksearch
, "authts",authts_parse
, 0, "User's Auth timestamp"); /* nick only */
183 registersearchterm(reg_nicksearch
, "ident",ident_parse
, 0, "User's current ident"); /* nick only */
184 registersearchterm(reg_nicksearch
, "host",host_parse
, 0, "User's host, allow \"host real\" to match real host"); /* nick only */
185 registersearchterm(reg_nicksearch
, "channel",channel_parse
, 0, "Valid Channel Name to match users against"); /* nick only */
186 registersearchterm(reg_nicksearch
, "timestamp",timestamp_parse
, 0, "User's Timestamp"); /* nick only */
187 registersearchterm(reg_nicksearch
, "country",country_parse
, 0, "2 letter country code (data source is geoip)"); /* nick only */
188 registersearchterm(reg_nicksearch
, "ip",ip_parse
, 0, "User's IP - ipv4 or ipv6 format as appropriate. Note: not 6to4"); /* nick only */
189 registersearchterm(reg_nicksearch
, "channels",channels_parse
, 0, "Channel Count"); /* nick only */
190 registersearchterm(reg_nicksearch
, "server",server_parse
, 0, "Server Name. Either (server string) or (match (server) string)"); /* nick only */
191 registersearchterm(reg_nicksearch
, "authid",authid_parse
, 0, "User's Auth ID"); /* nick only */
192 registersearchterm(reg_nicksearch
, "cidr",cidr_parse
, 0, "CIDR matching"); /* nick only */
193 registersearchterm(reg_nicksearch
, "ipvsix",ipv6_parse
, 0, "IPv6 user"); /* nick only */
195 /* Channel operations */
196 registersearchterm(reg_chansearch
, "exists",exists_parse
, 0, "Returns if channel exists on network. Note: newserv may store data on empty channels"); /* channel only */
197 registersearchterm(reg_chansearch
, "services",services_parse
, 0, ""); /* channel only */
198 registersearchterm(reg_chansearch
, "size",size_parse
, 0, "Channel user count"); /* channel only */
199 registersearchterm(reg_chansearch
, "name",name_parse
, 0, "Channel Name"); /* channel only */
200 registersearchterm(reg_chansearch
, "topic",topic_parse
, 0, "Channel topic"); /* channel only */
201 registersearchterm(reg_chansearch
, "oppct",oppct_parse
, 0, "Percentage Opped"); /* channel only */
202 registersearchterm(reg_chansearch
, "cumodecount",cumodecount_parse
, 0, "Count of users with given channel modes"); /* channel only */
203 registersearchterm(reg_chansearch
, "cumodepct",cumodepct_parse
, 0, "Percentage of users with given channel modes"); /* channel only */
204 registersearchterm(reg_chansearch
, "uniquehostpct",hostpct_parse
, 0, "uniquehost percent"); /* channel only */
205 registersearchterm(reg_chansearch
, "authedpct",authedpct_parse
, 0, "Percentage of authed users"); /* channel only */
206 registersearchterm(reg_chansearch
, "kick",kick_parse
, 0, "KICK users channels in newsearch result. Note: evaluation order"); /* channel only */
208 /* Nickname / channel operations */
209 registersearchterm(reg_chansearch
, "modes",modes_parse
, 0, "User Modes");
210 registersearchterm(reg_nicksearch
, "modes",modes_parse
, 0, "Channel Modes");
211 registersearchterm(reg_chansearch
, "nick",nick_parse
, 0, "Nickname");
212 registersearchterm(reg_nicksearch
, "nick",nick_parse
, 0, "Nickname");
214 /* Kill / gline parameters */
215 registersearchterm(reg_chansearch
,"kill",kill_parse
, 0, "KILL users in newsearch result. Note: evaluation order");
216 registersearchterm(reg_chansearch
,"gline",gline_parse
, 0, "GLINE users in newsearch result. Note: evaluation order");
217 registersearchterm(reg_nicksearch
,"kill",kill_parse
, 0, "KILL users in newsearch result. Note: evaluation order");
218 registersearchterm(reg_nicksearch
,"gline",gline_parse
, 0, "GLINE users in newsearch result. Note: evaluation order");
220 /* Iteration functionality */
221 registerglobalsearchterm("any",any_parse
, "usage: any (generatorfn x) (fn ... (var x) ...)");
222 registerglobalsearchterm("all",all_parse
, "usage: all (generatorfn x) (fn ... (var x) ...)");
223 registerglobalsearchterm("var",var_parse
, "usage: var variable");
225 /* Iterable functions */
226 registersearchterm(reg_nicksearch
, "channeliter",channeliter_parse
, 0, "Channel Iterable function - usage: (any (channeliter x) (match (var x) #twilight*))"); /* nick only */
227 registersearchterm(reg_chansearch
, "nickiter",nickiter_parse
, 0, "Nick Iterable function - usage: (any (nickiter x) (match (var x) nickname*))"); /* channel only */
229 /* Functions that work on strings?! */
230 registersearchterm(reg_nicksearch
, "cumodes", cumodes_parse
, 0, "usage: (cumodes (var x) <modes>)");
231 registersearchterm(reg_chansearch
, "cumodes", cumodes_parse
, 0, "usage: (cumodes (var x) <modes>)");
233 /* Notice functionality */
234 registersearchterm(reg_chansearch
,"notice",notice_parse
, 0, "NOTICE users in newsearch result. Note: evaluation order");
235 registersearchterm(reg_nicksearch
,"notice",notice_parse
, 0, "NOTICE users in newsearch result. Note: evaluation order");
237 /* Nick output filters */
238 regdisp(reg_nicksearch
,"default",printnick
, 0, "");
239 regdisp(reg_nicksearch
,"channels",printnick_channels
, 0, "include channels in output");
241 /* Channel output filters */
242 regdisp(reg_chansearch
,"default",printchannel
, 0, "");
243 regdisp(reg_chansearch
,"topic",printchannel_topic
, 0, "display channel topics");
244 regdisp(reg_chansearch
,"services",printchannel_services
, 0, "display services on channels");
246 /* Nick output filters */
247 regdisp(reg_usersearch
,"default",printuser
, 0, "");
252 searchList
*sl
, *psl
;
254 Command
*cmdlist
[100];
261 n
=getcommandlist(searchCmdTree
,cmdlist
,100);
263 deregistersearchterm( (searchCmd
*)cmdlist
[i
]->handler
, psl
->name
->content
, psl
->cmd
);
266 freesstring(psl
->name
);
272 deregistersearchcommand( reg_nicksearch
);
273 deregistersearchcommand( reg_chansearch
);
274 deregistersearchcommand( reg_usersearch
);
275 destroycommandtree( searchCmdTree
);
278 void registerglobalsearchterm(char *term
, parseFunc parsefunc
, char *help
) {
280 Command
*cmdlist
[100];
281 searchList
*sl
= malloc(sizeof(searchList
));
283 Error("newsearch", ERR_ERROR
, "malloc failed: registerglobalsearchterm");
288 sl
->name
= getsstring(term
, NSMAX_COMMAND_LEN
);
291 int len
=strlen(help
);
292 sl
->help
=(char *)malloc(len
+1);
294 Error("newsearch", ERR_ERROR
, "malloc failed: registerglobalsearchterm");
297 strncpy(sl
->help
, help
, len
);
298 sl
->help
[len
] = '\0';
304 if ( globalterms
!= NULL
) {
305 sl
->next
= globalterms
;
309 n
=getcommandlist(searchCmdTree
,cmdlist
,100);
311 /* maxparams is set to 1 to indicate a global term */
312 /* access level is set to 0 for all global terms */
313 addcommandexttotree( ((searchCmd
*)cmdlist
[i
]->handler
)->searchtree
,term
, 0, 1, (CommandHandler
) parsefunc
, help
);
317 void deregisterglobalsearchterm(char *term
, parseFunc parsefunc
) {
319 Command
*cmdlist
[100];
320 searchList
*sl
, *psl
=NULL
;
322 for (sl
=globalterms
; sl
; sl
=sl
->next
) {
323 if ( strcmp( sl
->name
->content
, term
) == 0 ) {
331 psl
->next
= sl
->next
;
334 n
=getcommandlist(searchCmdTree
,cmdlist
,100);
336 deletecommandfromtree( ((searchCmd
*)cmdlist
[i
]->handler
)->searchtree
, term
, (CommandHandler
) parsefunc
);
338 freesstring(sl
->name
);
343 void registersearchterm(searchCmd
*cmd
, char *term
, parseFunc parsefunc
, int level
, char *help
) {
344 /* NOTE: global terms are added to the tree elsewhere as we set maxparams to 1 to indicate global */
345 addcommandexttotree(cmd
->searchtree
, term
, level
, 0, (CommandHandler
) parsefunc
, help
);
348 void deregistersearchterm(searchCmd
*cmd
, char *term
, parseFunc parsefunc
) {
349 /* NOTE: global terms are removed from the tree within deregisterglobalsearchterm */
350 deletecommandfromtree(cmd
->searchtree
, term
, (CommandHandler
) parsefunc
);
353 static void controlwallwrapper(int level
, char *format
, ...) __attribute__ ((format (printf
, 2, 3)));
354 static void controlwallwrapper(int level
, char *format
, ...) {
358 va_start(ap
, format
);
359 vsnprintf(buf
, sizeof(buf
), format
, ap
);
360 controlwall(NO_OPER
, level
, "%s", buf
);
364 int parseopts(int cargc
, char **cargv
, int *arg
, int *limit
, void **subset
, void *display
, CommandTree
*sl
, replyFunc reply
, void *sender
) {
367 struct irc_in_addr sin
; unsigned char bits
;
369 if (*cargv
[0] == '-') {
373 for (ch
=cargv
[0]+1;*ch
;ch
++) {
377 reply(sender
,"Error: -l switch requires an argument (for help, see help <searchcmd>)");
380 *limit
=strtoul(cargv
[(*arg
)++],NULL
,10);
385 reply(sender
,"Error: -d switch requires an argument (for help, see help <searchcmd>)");
388 cmd
=findcommandintree(sl
, cargv
[*arg
],1);
390 reply(sender
,"Error: unknown output format %s (for help, see help <searchcmd>)",cargv
[*arg
]);
393 if ( !controlpermitted( cmd
->level
, sender
) ) {
394 reply(sender
,"Error: Access Denied for output format %s (for help, see help <searchcmd>)", cargv
[*arg
]);
397 *((void **)display
)=(void *)cmd
->handler
;
403 reply(sender
,"Error: -s switch requires an argument (for help, see help <searchcmd>)");
406 if (ipmask_parse(cargv
[*arg
], &sin
, &bits
) == 0) {
407 reply(sender
, "Error: Invalid CIDR mask supplied (for help, see help <searchcmd>)");
410 *subset
= (void *)refnode(iptree
, &sin
, bits
);
415 reply(sender
,"Unrecognised flag -%c. (for help, see help <searchcmd>)",*ch
);
424 void newsearch_ctxinit(searchCtx
*ctx
, searchParseFunc searchfn
, replyFunc replyfn
, wallFunc wallfn
, void *arg
, searchCmd
*cmd
, nick
*np
, void *displayfn
, int limit
) {
425 memset(ctx
, 0, sizeof(searchCtx
));
427 ctx
->reply
= replyfn
;
429 ctx
->parser
= searchfn
;
431 ctx
->searchcmd
= cmd
;
434 ctx
->displayfn
= displayfn
;
437 int do_nicksearch_real(replyFunc reply
, wallFunc wall
, void *source
, int cargc
, char **cargv
) {
438 nick
*sender
= source
;
441 NickDisplayFunc display
=defaultnickfn
;
443 #ifndef NEWSEARCH_NEWPARSER
445 struct searchNode
*search
;
451 reply( sender
, "Usage: [flags] <criteria>");
452 reply( sender
, "For help, see help nicksearch");
456 ret
= parseopts(cargc
, cargv
, &arg
, &limit
, NULL
, (void *)&display
, reg_nicksearch
->outputtree
, reply
, sender
);
461 reply(sender
,"No search terms - aborting.");
466 rejoinline(cargv
[arg
],cargc
-arg
);
469 #ifndef NEWSEARCH_NEWPARSER
470 newsearch_ctxinit(&ctx
, search_parse
, reply
, wall
, NULL
, reg_nicksearch
, sender
, display
, limit
);
471 if (!(search
= ctx
.parser(&ctx
, cargv
[arg
]))) {
472 reply(sender
,"Parse error: %s",parseError
);
476 nicksearch_exe(search
, &ctx
);
478 (search
->free
)(&ctx
, search
);
480 tree
= parse_string(reg_nicksearch
, cargv
[arg
]);
482 displaystrerror(reply
, sender
, cargv
[arg
]);
486 ast_nicksearch(tree
->root
, reply
, sender
, wall
, display
, NULL
, NULL
, limit
);
494 int do_nicksearch(void *source
, int cargc
, char **cargv
) {
495 return do_nicksearch_real(controlreply
, controlwallwrapper
, source
, cargc
, cargv
);
498 void nicksearch_exe(struct searchNode
*search
, searchCtx
*ctx
) {
501 unsigned int cmarker
;
502 unsigned int tchans
=0,uchans
=0;
504 nick
*np
, *sender
= ctx
->sender
;
505 senderNSExtern
= sender
;
506 NickDisplayFunc display
= ctx
->displayfn
;
507 int limit
= ctx
->limit
;
509 /* Get a marker value to mark "seen" channels for unique count */
510 cmarker
=nextchanmarker();
512 /* The top-level node needs to return a BOOL */
513 search
=coerceNode(ctx
, search
, RETURNTYPE_BOOL
);
515 for (i
=0;i
<NICKHASHSIZE
;i
++) {
516 for (np
=nicktable
[i
];np
;np
=np
->next
) {
517 if ((search
->exe
)(ctx
, search
, np
)) {
518 /* Add total channels */
519 tchans
+= np
->channels
->cursi
;
521 /* Check channels for uniqueness */
522 cs
=(channel
**)np
->channels
->content
;
523 for (j
=0;j
<np
->channels
->cursi
;j
++) {
524 if (cs
[j
]->index
->marker
!= cmarker
) {
525 cs
[j
]->index
->marker
=cmarker
;
531 display(ctx
, sender
, np
);
534 ctx
->reply(sender
, "--- More than %d matches, skipping the rest",limit
);
540 ctx
->reply(sender
,"--- End of list: %d matches; users were on %u channels (%u unique, %.1f average clones)",
541 matches
, tchans
, uchans
, (float)tchans
/uchans
);
544 int do_chansearch_real(replyFunc reply
, wallFunc wall
, void *source
, int cargc
, char **cargv
) {
545 nick
*sender
= source
;
548 ChanDisplayFunc display
=defaultchanfn
;
550 #ifndef NEWSEARCH_NEWPARSER
551 struct searchNode
*search
;
558 reply( sender
, "Usage: [flags] <criteria>");
559 reply( sender
, "For help, see help chansearch");
563 ret
= parseopts(cargc
, cargv
, &arg
, &limit
, NULL
, (void *)&display
, reg_chansearch
->outputtree
, reply
, sender
);
568 reply(sender
,"No search terms - aborting.");
573 rejoinline(cargv
[arg
],cargc
-arg
);
576 #ifndef NEWSEARCH_NEWPARSER
577 newsearch_ctxinit(&ctx
, search_parse
, reply
, wall
, NULL
, reg_chansearch
, sender
, display
, limit
);
578 if (!(search
= ctx
.parser(&ctx
, cargv
[arg
]))) {
579 reply(sender
,"Parse error: %s",parseError
);
583 chansearch_exe(search
, &ctx
);
585 (search
->free
)(&ctx
, search
);
587 tree
= parse_string(reg_chansearch
, cargv
[arg
]);
589 displaystrerror(reply
, sender
, cargv
[arg
]);
593 ast_chansearch(tree
->root
, reply
, sender
, wall
, display
, NULL
, NULL
, limit
);
601 int do_chansearch(void *source
, int cargc
, char **cargv
) {
602 return do_chansearch_real(controlreply
, controlwallwrapper
, source
, cargc
, cargv
);
605 void chansearch_exe(struct searchNode
*search
, searchCtx
*ctx
) {
609 nick
*sender
= ctx
->sender
;
610 senderNSExtern
= sender
;
611 ChanDisplayFunc display
= ctx
->displayfn
;
612 int limit
= ctx
->limit
;
614 search
=coerceNode(ctx
, search
, RETURNTYPE_BOOL
);
616 for (i
=0;i
<CHANNELHASHSIZE
;i
++) {
617 for (cip
=chantable
[i
];cip
;cip
=cip
->next
) {
618 if ((search
->exe
)(ctx
, search
, cip
)) {
620 display(ctx
, sender
, cip
);
622 ctx
->reply(sender
, "--- More than %d matches, skipping the rest",limit
);
628 ctx
->reply(sender
,"--- End of list: %d matches", matches
);
631 int do_usersearch_real(replyFunc reply
, wallFunc wall
, void *source
, int cargc
, char **cargv
) {
632 nick
*sender
= source
;
635 UserDisplayFunc display
=defaultuserfn
;
637 #ifndef NEWSEARCH_NEWPARSER
638 struct searchNode
*search
;
645 reply( sender
, "Usage: [flags] <criteria>");
646 reply( sender
, "For help, see help usersearch");
650 ret
= parseopts(cargc
, cargv
, &arg
, &limit
, NULL
, (void *)&display
, reg_usersearch
->outputtree
, reply
, sender
);
655 reply(sender
,"No search terms - aborting.");
660 rejoinline(cargv
[arg
],cargc
-arg
);
663 #ifndef NEWSEARCH_NEWPARSER
664 newsearch_ctxinit(&ctx
, search_parse
, reply
, wall
, NULL
, reg_usersearch
, sender
, display
, limit
);
666 if (!(search
= ctx
.parser(&ctx
, cargv
[arg
]))) {
667 reply(sender
,"Parse error: %s",parseError
);
671 usersearch_exe(search
, &ctx
);
673 (search
->free
)(&ctx
, search
);
675 tree
= parse_string(reg_usersearch
, cargv
[arg
]);
677 displaystrerror(reply
, sender
, cargv
[arg
]);
681 ast_usersearch(tree
->root
, reply
, sender
, wall
, display
, NULL
, NULL
, limit
);
689 int do_usersearch(void *source
, int cargc
, char **cargv
) {
690 return do_usersearch_real(controlreply
, controlwallwrapper
, source
, cargc
, cargv
);
693 void usersearch_exe(struct searchNode
*search
, searchCtx
*ctx
) {
697 nick
*sender
= ctx
->sender
;
698 int limit
= ctx
->limit
;
699 UserDisplayFunc display
= ctx
->displayfn
;
700 senderNSExtern
= sender
;
702 search
=coerceNode(ctx
, search
, RETURNTYPE_BOOL
);
704 for (i
=0;i
<AUTHNAMEHASHSIZE
;i
++) {
705 for (aup
=authnametable
[i
];aup
;aup
=aup
->next
) {
706 if ((search
->exe
)(ctx
, search
, aup
)) {
708 display(ctx
, sender
, aup
);
710 ctx
->reply(sender
, "--- More than %d matches, skipping the rest",limit
);
716 ctx
->reply(sender
,"--- End of list: %d matches", matches
);
719 /* Free a coerce node */
720 void free_coerce(searchCtx
*ctx
, struct searchNode
*thenode
) {
721 struct coercedata
*cd
=thenode
->localdata
;
723 cd
->child
->free(ctx
, cd
->child
);
724 free(thenode
->localdata
);
728 /* Free a coerce node with a stringbuf allocated */
729 void free_coercestring(searchCtx
*ctx
, struct searchNode
*thenode
) {
730 free(((struct coercedata
*)thenode
->localdata
)->u
.stringbuf
);
731 free_coerce(ctx
, thenode
);
734 /* exe_tostr_null: return the constant string */
735 void *exe_tostr_null(searchCtx
*ctx
, struct searchNode
*thenode
, void *theinput
) {
736 struct coercedata
*cd
=thenode
->localdata
;
738 return cd
->u
.stringbuf
;
741 /* exe_val_null: return the constant value */
742 void *exe_val_null(searchCtx
*ctx
, struct searchNode
*thenode
, void *theinput
) {
743 struct coercedata
*cd
=thenode
->localdata
;
745 return (void *)cd
->u
.val
;
748 /* Lots of very dull type conversion functions */
749 void *exe_inttostr(searchCtx
*ctx
, struct searchNode
*thenode
, void *theinput
) {
750 struct coercedata
*cd
=thenode
->localdata
;
752 sprintf(cd
->u
.stringbuf
, "%lu", (unsigned long)(cd
->child
->exe
)(ctx
, cd
->child
, theinput
));
754 return cd
->u
.stringbuf
;
757 void *exe_booltostr(searchCtx
*ctx
, struct searchNode
*thenode
, void *theinput
) {
758 struct coercedata
*cd
=thenode
->localdata
;
760 if ((cd
->child
->exe
)(ctx
, cd
->child
, theinput
)) {
761 sprintf(cd
->u
.stringbuf
,"1");
763 cd
->u
.stringbuf
[0]='\0';
766 return cd
->u
.stringbuf
;
769 void *exe_strtoint(searchCtx
*ctx
, struct searchNode
*thenode
, void *theinput
) {
770 struct coercedata
*cd
=thenode
->localdata
;
772 return (void *)strtoul((cd
->child
->exe
)(ctx
,cd
->child
,theinput
),NULL
,10);
775 void *exe_booltoint(searchCtx
*ctx
, struct searchNode
*thenode
, void *theinput
) {
776 struct coercedata
*cd
=thenode
->localdata
;
778 /* Don't need to do anything */
779 return (cd
->child
->exe
)(ctx
, cd
->child
, theinput
);
782 void *exe_strtobool(searchCtx
*ctx
, struct searchNode
*thenode
, void *theinput
) {
783 struct coercedata
*cd
=thenode
->localdata
;
784 char *ch
=(cd
->child
->exe
)(ctx
, cd
->child
, theinput
);
786 if (!ch
|| *ch
=='\0' || (*ch
=='0' && ch
[1]=='\0')) {
793 void *exe_inttobool(searchCtx
*ctx
, struct searchNode
*thenode
, void *theinput
) {
794 struct coercedata
*cd
=thenode
->localdata
;
796 if ((cd
->child
->exe
)(ctx
, cd
->child
, theinput
)) {
803 struct searchNode
*coerceNode(searchCtx
*ctx
, struct searchNode
*thenode
, int type
) {
804 struct searchNode
*anode
;
805 struct coercedata
*cd
;
807 /* You can't coerce a NULL */
811 /* No effort required to coerce to the same type */
812 if (type
==(thenode
->returntype
& RETURNTYPE_TYPE
))
815 anode
=(struct searchNode
*)malloc(sizeof(struct searchNode
));
816 anode
->localdata
=cd
=(struct coercedata
*)malloc(sizeof(struct coercedata
));
818 anode
->returntype
=type
; /* We'll return what they want, always */
819 anode
->free
=free_coerce
;
822 case RETURNTYPE_STRING
:
823 /* For a string we'll need a buffer */
824 /* A 64-bit number prints out to 20 digits, this leaves some slack */
825 cd
->u
.stringbuf
=malloc(25);
826 anode
->free
=free_coercestring
;
828 switch(thenode
->returntype
& RETURNTYPE_TYPE
) {
831 if (thenode
->returntype
& RETURNTYPE_CONST
) {
832 /* Constant node: sort it out now */
833 sprintf(cd
->u
.stringbuf
, "%lu", (unsigned long)thenode
->exe(ctx
, thenode
, NULL
));
834 anode
->exe
=exe_tostr_null
;
835 anode
->returntype
|= RETURNTYPE_CONST
;
838 anode
->exe
=exe_inttostr
;
842 case RETURNTYPE_BOOL
:
843 if (thenode
->returntype
& RETURNTYPE_CONST
) {
844 /* Constant bool value */
845 if (thenode
->exe(ctx
, thenode
,NULL
)) {
847 sprintf(cd
->u
.stringbuf
, "1");
849 cd
->u
.stringbuf
[0] = '\0';
851 anode
->exe
=exe_tostr_null
;
852 anode
->returntype
|= RETURNTYPE_CONST
;
854 /* Variable bool value */
855 anode
->exe
=exe_booltostr
;
863 switch (thenode
->returntype
& RETURNTYPE_TYPE
) {
864 case RETURNTYPE_STRING
:
865 if (thenode
->returntype
& RETURNTYPE_CONST
) {
866 cd
->u
.val
=strtoul((thenode
->exe
)(ctx
, thenode
, NULL
), NULL
, 10);
867 anode
->exe
=exe_val_null
;
868 anode
->returntype
|= RETURNTYPE_CONST
;
870 anode
->exe
=exe_strtoint
;
875 case RETURNTYPE_BOOL
:
876 if (thenode
->returntype
& RETURNTYPE_CONST
) {
877 if ((thenode
->exe
)(ctx
, thenode
,NULL
))
882 anode
->exe
=exe_val_null
;
883 anode
->returntype
|= RETURNTYPE_CONST
;
885 anode
->exe
=exe_booltoint
;
892 case RETURNTYPE_BOOL
:
894 switch (thenode
->returntype
& RETURNTYPE_TYPE
) {
895 case RETURNTYPE_STRING
:
896 if (thenode
->returntype
& RETURNTYPE_CONST
) {
897 char *rv
=(char *)((thenode
->exe
)(ctx
, thenode
, NULL
));
898 if (!rv
|| *rv
=='\0' || (*rv
=='0' && rv
[1]=='\0'))
903 anode
->exe
=exe_val_null
;
904 anode
->returntype
|= RETURNTYPE_CONST
;
906 anode
->exe
=exe_strtobool
;
912 if (thenode
->returntype
& RETURNTYPE_CONST
) {
913 if ((thenode
->exe
)(ctx
, thenode
,NULL
))
918 anode
->exe
=exe_val_null
;
919 anode
->returntype
|= RETURNTYPE_CONST
;
921 anode
->exe
=exe_inttobool
;
931 /* Literals always return constant strings... */
932 void *literal_exe(searchCtx
*ctx
, struct searchNode
*thenode
, void *theinput
) {
933 if (thenode
->localdata
)
934 return ((sstring
*)thenode
->localdata
)->content
;
939 void literal_free(searchCtx
*ctx
, struct searchNode
*thenode
) {
940 freesstring(thenode
->localdata
);
944 static int unescape(char *input
, char *output
, size_t buflen
) {
949 for (ch
=input
;*ch
;ch
++) {
950 if(ch
- input
>= buflen
) {
951 parseError
="Buffer overflow";
956 if (*(ch
-1) != '\"') {
957 parseError
="Quote mismatch";
966 for (ch
=input
;*ch
;ch
++) {
967 if(ch
- input
>= buflen
) {
968 parseError
="Buffer overflow";
975 } else if (*ch
=='\\') {
986 struct searchNode
*search_parse(searchCtx
*ctx
, char *cinput
) {
987 /* OK, we need to split the input into chunks on spaces and brackets.. */
988 char *argvector
[100];
995 struct searchNode
*thenode
;
997 strlcpy(inputb
, cinput
, sizeof(inputb
));
1000 /* If it starts with a bracket, it's a function call.. */
1002 /* Skip past string */
1003 for (ch
=input
;*ch
;ch
++);
1004 if (*(ch
-1) != ')') {
1005 parseError
= "Bracket mismatch!";
1011 /* Split further args */
1012 i
=-1; /* i = -1 BoW, 0 = inword, 1 = bracket nest depth */
1013 j
=0; /* j = current arg */
1017 for (ch
=input
;*ch
;ch
++) {
1018 /*printf("i: %d j: %d e: %d q: %d ch: '%c'\n", i, j, e, q, *ch);*/
1023 } else if (*ch
!= ' ') {
1027 } else if (*ch
=='\"') {
1036 } else if (*ch
=='\"') {
1042 } else if (*ch
=='\"') {
1044 } else if (*ch
==' ') {
1047 if(j
>= (sizeof(argvector
) / sizeof(*argvector
))) {
1048 parseError
= "Too many arguments";
1056 } else if (*ch
=='\"') {
1058 } else if (*ch
=='(') {
1060 } else if (*ch
==')') {
1067 parseError
= "Bracket mismatch!";
1071 if (*(ch
-1) == 0) /* if the last character was a space */
1072 j
--; /* remove an argument */
1074 /* for(k=1;k<=j;k++)
1075 if(!unescape(argvector[k], argvector[k], sizeof(inputb)))
1079 if (!(cmd
=findcommandintree(ctx
->searchcmd
->searchtree
,argvector
[0],1))) {
1080 parseError
= "Unknown command (for valid command list, see help <searchcmd>)";
1083 if (!controlpermitted(cmd
->level
, ctx
->sender
)) {
1084 parseError
= "Access denied (for valid command list, see help <searchcmd>)";
1087 return ((parseFunc
)cmd
->handler
)(ctx
, j
, argvector
+1);
1092 /* slug: disabled now we unescape during the main parse stage */
1093 if(!unescape(input
, thestring
, sizeof(thestring
)))
1096 if (!(thenode
=(struct searchNode
*)malloc(sizeof(struct searchNode
)))) {
1097 parseError
= "malloc: could not allocate memory for this search.";
1101 thenode
->localdata
= getsstring(thestring
,512);
1102 thenode
->returntype
= RETURNTYPE_CONST
| RETURNTYPE_STRING
;
1103 thenode
->exe
= literal_exe
;
1104 thenode
->free
= literal_free
;
1110 void nssnprintf(char *buf
, size_t size
, const char *format
, nick
*np
) {
1123 for(p
=format
;*p
;p
++) {
1125 if(!sbaddchar(&b
, *p
))
1133 if(!sbaddchar(&b
, *p
))
1141 c
= np
->nick
; break;
1143 c
= np
->ident
; break;
1145 c
= np
->host
->name
->content
; break;
1147 snprintf(hostbuf
, sizeof(hostbuf
), "%s", IPtostr(np
->p_ipaddr
));
1151 snprintf(hostbuf
, sizeof(hostbuf
), "%s!%s@%s", np
->nick
, np
->ident
, IPtostr(np
->p_ipaddr
));
1155 c
= "(bad format specifier)";
1158 if(!sbaddstr(&b
, c
))
1170 static char *var_tochar(searchCtx
*ctx
, char *arg
, searchNode
**variable
) {
1171 *variable
= ctx
->parser(ctx
, arg
);
1172 if (!(*variable
= coerceNode(ctx
, *variable
, RETURNTYPE_STRING
)))
1175 if(!((*variable
)->returntype
& RETURNTYPE_CONST
)) {
1176 parseError
= "only constant variables allowed";
1177 ((*variable
)->free
)(ctx
, *variable
);
1181 return (char *)((*variable
)->exe
)(ctx
, *variable
, NULL
);
1184 void free_val_null(searchCtx
*ctx
, struct searchNode
*thenode
) {
1187 struct searchVariable
*var_register(searchCtx
*ctx
, char *arg
, int type
) {
1188 searchNode
*variable
;
1189 struct searchVariable
*us
;
1193 if(ctx
->lastvar
>= MAX_VARIABLES
) {
1194 parseError
= "Maximum number of variables reached";
1198 us
= &ctx
->vars
[ctx
->lastvar
];
1200 var
= var_tochar(ctx
, arg
, &variable
);
1204 strlcpy(us
->name
, var
, sizeof(us
->name
));
1205 (variable
->free
)(ctx
, variable
);
1207 for(i
=0;i
<ctx
->lastvar
;i
++) {
1208 if(!strcmp(us
->name
, ctx
->vars
[i
].name
)) {
1209 parseError
= "variable name already in use";
1215 us
->data
.returntype
= type
;
1216 us
->data
.localdata
= &us
->cdata
;
1217 us
->data
.exe
= exe_val_null
;
1218 us
->data
.free
= free_val_null
;
1220 us
->cdata
.child
= NULL
;
1224 searchNode
*var_get(searchCtx
*ctx
, char *arg
) {
1225 searchNode
*variable
, *found
= NULL
;
1227 char *var
= var_tochar(ctx
, arg
, &variable
);
1231 for(i
=0;i
<ctx
->lastvar
;i
++) {
1232 if(!strcmp(var
, ctx
->vars
[i
].name
)) {
1233 found
= &ctx
->vars
[i
].data
;
1237 (variable
->free
)(ctx
, variable
);
1240 parseError
= "variable not found";
1244 void var_setstr(struct searchVariable
*v
, char *data
) {
1245 v
->cdata
.u
.stringbuf
= data
;
1248 #ifdef NEWSEARCH_NEWPARSER
1249 void displaystrerror(replyFunc reply
, nick
*np
, const char *input
) {
1252 if((parseStrErrorPos
>= 0) && (parseStrErrorPos
< sizeof(buf
) - 3)) {
1255 for(i
=0;i
<parseStrErrorPos
;i
++)
1261 reply(np
, "%s", input
);
1262 reply(np
, "%s", buf
);
1265 reply(np
, "Parse error: %s", parseStrError
);
1269 struct searchNode
*argtoconststr(char *command
, searchCtx
*ctx
, char *arg
, char **p
) {
1270 struct searchNode
*c
;
1271 static char errorbuf
[512];
1273 c
= ctx
->parser(ctx
, arg
);
1274 if (!(c
= coerceNode(ctx
, c
, RETURNTYPE_STRING
))) {
1275 snprintf(errorbuf
, sizeof(errorbuf
), "%s: unable to coerce argument to string", command
);
1276 parseError
= errorbuf
;
1280 if (!(c
->returntype
& RETURNTYPE_CONST
)) {
1281 snprintf(errorbuf
, sizeof(errorbuf
), "%s: constant argument required", command
);
1282 parseError
= errorbuf
;
1288 *p
= (char *)(c
->exe
)(ctx
, c
, NULL
);