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