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