1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294
|
#include "tintin.h"
#include "protos/action.h"
#include "protos/glob.h"
#include "protos/globals.h"
#include "protos/lists.h"
#include "protos/math.h"
#include "protos/print.h"
#include "protos/parse.h"
#include "protos/utils.h"
#include "protos/string.h"
#include "protos/vars.h"
int msec(timens_t t)
{
t%=NANO;
if (t<0)
t+=NANO;
return t/1000000;
}
/* remove ev->next from list */
static void remove_event(struct eventnode **ev)
{
struct eventnode *tmp = (*ev)->next;
SFREE((*ev)->event);
SFREE((*ev)->label);
TFREE(*ev, struct eventnode);
*ev=tmp;
}
static void schedule_event(struct session *ses, struct eventnode *restrict ev1)
{
const char *l1, *l2;
if ((l1=ev1->label))
{
struct eventnode **ev2 = &(ses->events);
while (*ev2)
if (((l2=(*ev2)->label)) && !strcmp(l1, l2))
remove_event(ev2);
else
ev2=&(*ev2)->next;
}
timens_t t1 = ev1->time;
struct eventnode **ev2 = &ses->events;
while (*ev2 && (*ev2)->time <= t1)
ev2 = &(*ev2)->next;
ev1->next = *ev2;
*ev2 = ev1;
}
static void execute_event(struct eventnode *ev, struct session *ses)
{
if (activesession==ses && ses->mesvar[MSG_EVENT])
tintin_printf(ses, "[EVENT: %s]", ev->event);
parse_input(ev->event, true, ses);
recursion=0;
}
/* execute due events, abort and return 1 if any_closed */
bool do_events(struct session *ses, timens_t now)
{
struct eventnode *ev;
while ((ev=ses->events) && (ev->time<=now))
{
ses->events=ev->next;
execute_event(ev, ses);
if (ev->period >= 0)
{
// If badly lagged, wait at least half of period.
timens_t old = ev->time - now;
timens_t del = ev->period;
timens_t new = old + del;
timens_t cap = del/2;
if (new < cap)
new = cap;
if (new <= 0)
new = 1; // rapid-fire events shouldn't starve others
ev->time = now + new;
schedule_event(ses, ev);
}
else
{
SFREE(ev->event);
TFREE(ev, struct eventnode);
}
if (any_closed)
return 1;
}
return 0;
}
static void show_event(struct session *ses, struct eventnode *ev, timens_t ct)
{
char times[64];
if (ev->period >= 0)
sprintf(times, "(%lld.%03d, %lld.%03d)\t",
(ev->time-ct)/NANO, msec(ev->time-ct),
(ev->period)/NANO, msec(ev->period));
else
sprintf(times, "(%lld.%03d)\t\t", (ev->time-ct)/NANO, msec(ev->time-ct));
if (ev->label)
tintin_printf(ses, "%s {%s} {%s}", times, ev->event, ev->label);
else
tintin_printf(ses, "%s {%s}", times, ev->event);
}
/* list active events matching regexp arg */
static void list_events(const char *arg, struct session *ses)
{
char left[BUFFER_SIZE];
timens_t ct = current_time();
struct eventnode *ev = ses->events;
arg = get_arg_in_braces(arg, left, 1);
if (!*left)
{
tintin_printf(ses, "#Defined events:");
while (ev)
{
show_event(ses, ev, ct);
ev = ev->next;
}
return;
}
bool flag = false;
while (ev)
{
if (match(left, ev->event))
{
show_event(ses, ev, ct);
flag = true;
}
ev = ev->next;
}
if (!flag)
tintin_printf(ses, "#THAT EVENT (%s) IS NOT DEFINED.", left);
}
/* add new event to the list */
void delay_command(const char *arg, struct session *ses)
{
char left[BUFFER_SIZE], right[BUFFER_SIZE], label[BUFFER_SIZE];
timens_t period = -1;
arg = get_arg(arg, left, 0, ses);
arg = get_arg(arg, right, 1, ses);
arg = get_arg(arg, label, 0, ses);
if (!*right)
return list_events(left, ses);
if (!*left)
return tintin_eprintf(ses, "#EVENT IGNORED, NO DELAY GIVEN");
char *slash = strchr(left, ',');
if (slash)
*slash = 0;
timens_t delay = time2secs(left, ses);
if (delay==INVALID_TIME || delay<0)
return tintin_eprintf(ses, "#EVENT IGNORED (DELAY={%s}), INVALID DELAY", left);
if (slash)
{
slash++;
period = time2secs(slash, ses);
if (period==INVALID_TIME || period<0)
return tintin_eprintf(ses, "#EVENT IGNORED (PERIOD={%s}), INVALID PERIOD", slash);
}
struct eventnode *ev = TALLOC(struct eventnode);
ev->time = current_time() + delay;
ev->period = period;
ev->event = mystrdup(right);
ev->label = label[0]? mystrdup(label) : 0;
schedule_event(ses, ev);
}
void event_command(const char *arg, struct session *ses)
{
delay_command(arg, ses);
}
/* remove events matching regexp arg from list */
void undelay_command(const char *arg, struct session *ses)
{
char left[BUFFER_SIZE], label[BUFFER_SIZE];
arg = get_arg(arg, left, 1, ses);
arg = get_arg(arg, label, 0, ses);
if (!*left && !*label)
return tintin_eprintf(ses, "#ERROR: valid syntax is: #undelay {event pattern} [{label pattern}]");
timens_t ct = current_time();
bool flag = false;
struct eventnode **ev = &(ses->events);
while (*ev)
{
const char *label2;
if ((!*left || match(left, (*ev)->event))
&& (!*label || (((label2=(*ev)->label)) && match(label, label2))))
{
flag=true;
if (ses==activesession && ses->mesvar[MSG_EVENT])
tintin_printf(ses, "#Ok. Event {%s} at %lld.%03d won't be executed.",
(*ev)->event, ((*ev)->time-ct)/NANO, msec((*ev)->time-ct));
remove_event(ev);
}
else
ev=&((*ev)->next);
}
if (!flag)
tintin_printf(ses, "#THAT EVENT IS NOT DEFINED.");
}
void removeevent_command(const char *arg, struct session *ses)
{
undelay_command(arg, ses);
}
void unevent_command(const char *arg, struct session *ses)
{
undelay_command(arg, ses);
}
void kill_events(struct session *ses)
{
struct eventnode *ev = ses->events;
while (ev)
remove_event(&ev);
ses->events = 0;
}
void findevents_command(const char *arg, struct session *ses)
{
char left[BUFFER_SIZE], right[BUFFER_SIZE];
arg = get_arg(arg, left, 0, ses);
arg = get_arg(arg, right, 1, ses);
if (!*left)
{
tintin_eprintf(ses, "#Syntax: #findevents <result> <pattern>");
return;
}
if (!*right)
strcpy(right, "*");
timens_t ct = current_time();
char buf[BUFFER_SIZE], *b=buf;
*buf=0;
struct eventnode *ev = ses->events;
while (ev)
{
if (match(right, ev->event))
{
char time[BUFFER_SIZE], this[BUFFER_SIZE+10];
// lie that overdue events are due right now
nsecstr(time, (ev->time>ct)? ev->time-ct : 0);
if (isatom(ev->event))
snprintf(this, sizeof this, "{%s %s}", time, ev->event);
else
snprintf(this, sizeof this, "{%s {%s}}", time, ev->event);
if (b!=buf)
*b++=' ';
b+=snprintf(b, buf-b+sizeof(buf), "%s", this);
if (b >= buf+BUFFER_SIZE-10)
{
tintin_eprintf(ses, "#Too many events to store.");
break;
}
}
ev = ev->next;
}
set_variable(left, buf, ses);
}
|