eval.c 18.2 KB
Newer Older
1
/*
2
 * Copyright (c) 2002-2006 Michael Niedermayer <michaelni@gmx.at>
3
 * Copyright (c) 2006 Oded Shimon <ods15@ods15.dyndns.org>
4
 *
5
 * This file is part of Libav.
6
 *
7
 * Libav is free software; you can redistribute it and/or
8 9
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
10
 * version 2.1 of the License, or (at your option) any later version.
11
 *
12
 * Libav is distributed in the hope that it will be useful,
13 14 15 16 17
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
18
 * License along with Libav; if not, write to the Free Software
19
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 21
 */

Michael Niedermayer's avatar
Michael Niedermayer committed
22
/**
23
 * @file
Michael Niedermayer's avatar
Michael Niedermayer committed
24 25
 * simple arithmetic expression evaluator.
 *
26 27 28
 * see http://joe.hotchkiss.com/programming/eval/eval.html
 */

29
#include "avutil.h"
30
#include "eval.h"
31
#include "log.h"
32

33
typedef struct Parser {
34
    const AVClass *class;
35 36
    int stack_index;
    char *s;
37 38 39 40 41 42
    const double *const_values;
    const char * const *const_names;          // NULL terminated
    double (* const *funcs1)(void *, double a);           // NULL terminated
    const char * const *func1_names;          // NULL terminated
    double (* const *funcs2)(void *, double a, double b); // NULL terminated
    const char * const *func2_names;          // NULL terminated
43
    void *opaque;
44 45
    int log_offset;
    void *log_ctx;
46 47
#define VARS 10
    double var[VARS];
48 49
} Parser;

50 51
static const AVClass class = { "Eval", av_default_item_name, NULL, LIBAVUTIL_VERSION_INT, offsetof(Parser,log_offset), offsetof(Parser,log_ctx) };

52
static const int8_t si_prefixes['z' - 'E' + 1] = {
53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74
    ['y'-'E']= -24,
    ['z'-'E']= -21,
    ['a'-'E']= -18,
    ['f'-'E']= -15,
    ['p'-'E']= -12,
    ['n'-'E']= - 9,
    ['u'-'E']= - 6,
    ['m'-'E']= - 3,
    ['c'-'E']= - 2,
    ['d'-'E']= - 1,
    ['h'-'E']=   2,
    ['k'-'E']=   3,
    ['K'-'E']=   3,
    ['M'-'E']=   6,
    ['G'-'E']=   9,
    ['T'-'E']=  12,
    ['P'-'E']=  15,
    ['E'-'E']=  18,
    ['Z'-'E']=  21,
    ['Y'-'E']=  24,
};

75 76
double av_strtod(const char *numstr, char **tail)
{
77 78
    double d;
    char *next;
79
    d = strtod(numstr, &next);
80
    /* if parsing succeeded, check for and interpret postfixes */
81
    if (next!=numstr) {
82
        if (*next >= 'E' && *next <= 'z') {
83
            int e= si_prefixes[*next - 'E'];
84 85
            if (e) {
                if (next[1] == 'i') {
86 87
                    d*= pow( 2, e/0.3);
                    next+=2;
88
                } else {
89 90 91 92 93 94
                    d*= pow(10, e);
                    next++;
                }
            }
        }

95
        if (*next=='B') {
96
            d*=8;
97
            next++;
98 99 100 101 102 103 104 105 106
        }
    }
    /* if requested, fill in tail with the position after the last parsed
       character */
    if (tail)
        *tail = next;
    return d;
}

107 108
#define IS_IDENTIFIER_CHAR(c) ((c) - '0' <= 9U || (c) - 'a' <= 25U || (c) - 'A' <= 25U || (c) == '_')

109 110
static int strmatch(const char *s, const char *prefix)
{
111
    int i;
112 113
    for (i=0; prefix[i]; i++) {
        if (prefix[i] != s[i]) return 0;
114
    }
115 116
    /* return 1 only if the s identifier is terminated */
    return !IS_IDENTIFIER_CHAR(s[i]);
117 118
}

119
struct AVExpr {
120 121
    enum {
        e_value, e_const, e_func0, e_func1, e_func2,
122
        e_squish, e_gauss, e_ld, e_isnan,
123 124
        e_mod, e_max, e_min, e_eq, e_gt, e_gte,
        e_pow, e_mul, e_div, e_add,
125
        e_last, e_st, e_while, e_floor, e_ceil, e_trunc,
126 127 128 129 130 131 132 133
    } type;
    double value; // is sign in other types
    union {
        int const_index;
        double (*func0)(double);
        double (*func1)(void *, double);
        double (*func2)(void *, double, double);
    } a;
134
    struct AVExpr *param[2];
135 136
};

137 138
static double eval_expr(Parser *p, AVExpr *e)
{
139 140
    switch (e->type) {
        case e_value:  return e->value;
141
        case e_const:  return e->value * p->const_values[e->a.const_index];
142 143 144 145 146
        case e_func0:  return e->value * e->a.func0(eval_expr(p, e->param[0]));
        case e_func1:  return e->value * e->a.func1(p->opaque, eval_expr(p, e->param[0]));
        case e_func2:  return e->value * e->a.func2(p->opaque, eval_expr(p, e->param[0]), eval_expr(p, e->param[1]));
        case e_squish: return 1/(1+exp(4*eval_expr(p, e->param[0])));
        case e_gauss: { double d = eval_expr(p, e->param[0]); return exp(-d*d/2)/sqrt(2*M_PI); }
147
        case e_ld:     return e->value * p->var[av_clip(eval_expr(p, e->param[0]), 0, VARS-1)];
148
        case e_isnan:  return e->value * !!isnan(eval_expr(p, e->param[0]));
149 150 151
        case e_floor:  return e->value * floor(eval_expr(p, e->param[0]));
        case e_ceil :  return e->value * ceil (eval_expr(p, e->param[0]));
        case e_trunc:  return e->value * trunc(eval_expr(p, e->param[0]));
152
        case e_while: {
153
            double d = NAN;
154
            while (eval_expr(p, e->param[0]))
155 156 157
                d=eval_expr(p, e->param[1]);
            return d;
        }
158 159 160 161 162 163 164 165 166 167 168 169 170 171
        default: {
            double d = eval_expr(p, e->param[0]);
            double d2 = eval_expr(p, e->param[1]);
            switch (e->type) {
                case e_mod: return e->value * (d - floor(d/d2)*d2);
                case e_max: return e->value * (d >  d2 ?   d : d2);
                case e_min: return e->value * (d <  d2 ?   d : d2);
                case e_eq:  return e->value * (d == d2 ? 1.0 : 0.0);
                case e_gt:  return e->value * (d >  d2 ? 1.0 : 0.0);
                case e_gte: return e->value * (d >= d2 ? 1.0 : 0.0);
                case e_pow: return e->value * pow(d, d2);
                case e_mul: return e->value * (d * d2);
                case e_div: return e->value * (d / d2);
                case e_add: return e->value * (d + d2);
Oded Shimon's avatar
Oded Shimon committed
172
                case e_last:return e->value * d2;
173
                case e_st : return e->value * (p->var[av_clip(d, 0, VARS-1)]= d2);
174 175 176 177 178 179
            }
        }
    }
    return NAN;
}

180
static int parse_expr(AVExpr **e, Parser *p);
181

182
void av_expr_free(AVExpr *e)
183
{
184
    if (!e) return;
185 186
    av_expr_free(e->param[0]);
    av_expr_free(e->param[1]);
187 188 189
    av_freep(&e);
}

190 191
static int parse_primary(AVExpr **e, Parser *p)
{
192
    AVExpr *d = av_mallocz(sizeof(AVExpr));
193
    char *next = p->s, *s0 = p->s;
194
    int ret, i;
195

196
    if (!d)
197
        return AVERROR(ENOMEM);
198

199
    /* number */
200
    d->value = av_strtod(p->s, &next);
201
    if (next != p->s) {
202
        d->type = e_value;
203
        p->s= next;
204 205
        *e = d;
        return 0;
206
    }
207
    d->value = 1;
208

209
    /* named constants */
210 211
    for (i=0; p->const_names && p->const_names[i]; i++) {
        if (strmatch(p->s, p->const_names[i])) {
212
            p->s+= strlen(p->const_names[i]);
213 214
            d->type = e_const;
            d->a.const_index = i;
215 216
            *e = d;
            return 0;
217 218
        }
    }
219

220
    p->s= strchr(p->s, '(');
221
    if (p->s==NULL) {
222
        av_log(p, AV_LOG_ERROR, "Undefined constant or missing '(' in '%s'\n", s0);
Michael Niedermayer's avatar
Michael Niedermayer committed
223
        p->s= next;
224
        av_expr_free(d);
225
        return AVERROR(EINVAL);
226 227
    }
    p->s++; // "("
228 229
    if (*next == '(') { // special case do-nothing
        av_freep(&d);
230 231
        if ((ret = parse_expr(&d, p)) < 0)
            return ret;
232
        if (p->s[0] != ')') {
233
            av_log(p, AV_LOG_ERROR, "Missing ')' in '%s'\n", s0);
234
            av_expr_free(d);
235
            return AVERROR(EINVAL);
236 237
        }
        p->s++; // ")"
238 239 240 241
        *e = d;
        return 0;
    }
    if ((ret = parse_expr(&(d->param[0]), p)) < 0) {
242
        av_expr_free(d);
243
        return ret;
244
    }
245
    if (p->s[0]== ',') {
246
        p->s++; // ","
247
        parse_expr(&d->param[1], p);
248
    }
249
    if (p->s[0] != ')') {
250
        av_log(p, AV_LOG_ERROR, "Missing ')' or too many args in '%s'\n", s0);
251
        av_expr_free(d);
252
        return AVERROR(EINVAL);
253 254
    }
    p->s++; // ")"
255

256
    d->type = e_func0;
257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279
         if (strmatch(next, "sinh"  )) d->a.func0 = sinh;
    else if (strmatch(next, "cosh"  )) d->a.func0 = cosh;
    else if (strmatch(next, "tanh"  )) d->a.func0 = tanh;
    else if (strmatch(next, "sin"   )) d->a.func0 = sin;
    else if (strmatch(next, "cos"   )) d->a.func0 = cos;
    else if (strmatch(next, "tan"   )) d->a.func0 = tan;
    else if (strmatch(next, "atan"  )) d->a.func0 = atan;
    else if (strmatch(next, "asin"  )) d->a.func0 = asin;
    else if (strmatch(next, "acos"  )) d->a.func0 = acos;
    else if (strmatch(next, "exp"   )) d->a.func0 = exp;
    else if (strmatch(next, "log"   )) d->a.func0 = log;
    else if (strmatch(next, "abs"   )) d->a.func0 = fabs;
    else if (strmatch(next, "squish")) d->type = e_squish;
    else if (strmatch(next, "gauss" )) d->type = e_gauss;
    else if (strmatch(next, "mod"   )) d->type = e_mod;
    else if (strmatch(next, "max"   )) d->type = e_max;
    else if (strmatch(next, "min"   )) d->type = e_min;
    else if (strmatch(next, "eq"    )) d->type = e_eq;
    else if (strmatch(next, "gte"   )) d->type = e_gte;
    else if (strmatch(next, "gt"    )) d->type = e_gt;
    else if (strmatch(next, "lte"   )) { AVExpr *tmp = d->param[1]; d->param[1] = d->param[0]; d->param[0] = tmp; d->type = e_gt; }
    else if (strmatch(next, "lt"    )) { AVExpr *tmp = d->param[1]; d->param[1] = d->param[0]; d->param[0] = tmp; d->type = e_gte; }
    else if (strmatch(next, "ld"    )) d->type = e_ld;
280
    else if (strmatch(next, "isnan" )) d->type = e_isnan;
281 282
    else if (strmatch(next, "st"    )) d->type = e_st;
    else if (strmatch(next, "while" )) d->type = e_while;
283 284 285
    else if (strmatch(next, "floor" )) d->type = e_floor;
    else if (strmatch(next, "ceil"  )) d->type = e_ceil;
    else if (strmatch(next, "trunc" )) d->type = e_trunc;
286
    else {
287 288
        for (i=0; p->func1_names && p->func1_names[i]; i++) {
            if (strmatch(next, p->func1_names[i])) {
289
                d->a.func1 = p->funcs1[i];
290
                d->type = e_func1;
291 292
                *e = d;
                return 0;
293 294 295
            }
        }

296 297
        for (i=0; p->func2_names && p->func2_names[i]; i++) {
            if (strmatch(next, p->func2_names[i])) {
298
                d->a.func2 = p->funcs2[i];
299
                d->type = e_func2;
300 301
                *e = d;
                return 0;
302 303 304
            }
        }

305
        av_log(p, AV_LOG_ERROR, "Unknown function in '%s'\n", s0);
306
        av_expr_free(d);
307
        return AVERROR(EINVAL);
308
    }
309

310 311
    *e = d;
    return 0;
312
}
Michael Niedermayer's avatar
Michael Niedermayer committed
313

314 315 316
static AVExpr *new_eval_expr(int type, int value, AVExpr *p0, AVExpr *p1)
{
    AVExpr *e = av_mallocz(sizeof(AVExpr));
317 318
    if (!e)
        return NULL;
319 320 321 322 323 324 325
    e->type     =type   ;
    e->value    =value  ;
    e->param[0] =p0     ;
    e->param[1] =p1     ;
    return e;
}

326 327
static int parse_pow(AVExpr **e, Parser *p, int *sign)
{
328 329
    *sign= (*p->s == '+') - (*p->s == '-');
    p->s += *sign&1;
330
    return parse_primary(e, p);
331 332
}

333 334 335 336 337 338
static int parse_factor(AVExpr **e, Parser *p)
{
    int sign, sign2, ret;
    AVExpr *e0, *e1, *e2;
    if ((ret = parse_pow(&e0, p, &sign)) < 0)
        return ret;
339
    while(p->s[0]=='^'){
340
        e1 = e0;
341
        p->s++;
342
        if ((ret = parse_pow(&e2, p, &sign2)) < 0) {
343
            av_expr_free(e1);
344 345 346 347
            return ret;
        }
        e0 = new_eval_expr(e_pow, 1, e1, e2);
        if (!e0) {
348 349
            av_expr_free(e1);
            av_expr_free(e2);
350 351 352
            return AVERROR(ENOMEM);
        }
        if (e0->param[1]) e0->param[1]->value *= (sign2|1);
353
    }
354 355 356 357
    if (e0) e0->value *= (sign|1);

    *e = e0;
    return 0;
358 359
}

360 361 362 363 364 365
static int parse_term(AVExpr **e, Parser *p)
{
    int ret;
    AVExpr *e0, *e1, *e2;
    if ((ret = parse_factor(&e0, p)) < 0)
        return ret;
366
    while (p->s[0]=='*' || p->s[0]=='/') {
367
        int c= *p->s++;
368 369
        e1 = e0;
        if ((ret = parse_factor(&e2, p)) < 0) {
370
            av_expr_free(e1);
371 372 373 374
            return ret;
        }
        e0 = new_eval_expr(c == '*' ? e_mul : e_div, 1, e1, e2);
        if (!e0) {
375 376
            av_expr_free(e1);
            av_expr_free(e2);
377 378
            return AVERROR(ENOMEM);
        }
379
    }
380 381
    *e = e0;
    return 0;
382 383
}

384 385 386 387 388 389
static int parse_subexpr(AVExpr **e, Parser *p)
{
    int ret;
    AVExpr *e0, *e1, *e2;
    if ((ret = parse_term(&e0, p)) < 0)
        return ret;
390
    while (*p->s == '+' || *p->s == '-') {
391 392
        e1 = e0;
        if ((ret = parse_term(&e2, p)) < 0) {
393
            av_expr_free(e1);
394 395 396 397
            return ret;
        }
        e0 = new_eval_expr(e_add, 1, e1, e2);
        if (!e0) {
398 399
            av_expr_free(e1);
            av_expr_free(e2);
400 401
            return AVERROR(ENOMEM);
        }
402 403
    };

404 405
    *e = e0;
    return 0;
406 407
}

408 409 410 411
static int parse_expr(AVExpr **e, Parser *p)
{
    int ret;
    AVExpr *e0, *e1, *e2;
412
    if (p->stack_index <= 0) //protect against stack overflows
413
        return AVERROR(EINVAL);
Michael Niedermayer's avatar
Michael Niedermayer committed
414 415
    p->stack_index--;

416 417
    if ((ret = parse_subexpr(&e0, p)) < 0)
        return ret;
418
    while (*p->s == ';') {
419
        p->s++;
420 421
        e1 = e0;
        if ((ret = parse_subexpr(&e2, p)) < 0) {
422
            av_expr_free(e1);
423 424 425 426
            return ret;
        }
        e0 = new_eval_expr(e_last, 1, e1, e2);
        if (!e0) {
427 428
            av_expr_free(e1);
            av_expr_free(e2);
429 430
            return AVERROR(ENOMEM);
        }
431
    };
Michael Niedermayer's avatar
Michael Niedermayer committed
432 433

    p->stack_index++;
434 435
    *e = e0;
    return 0;
436 437
}

438 439
static int verify_expr(AVExpr *e)
{
440 441 442 443 444 445 446
    if (!e) return 0;
    switch (e->type) {
        case e_value:
        case e_const: return 1;
        case e_func0:
        case e_func1:
        case e_squish:
447
        case e_ld:
448
        case e_gauss:
449 450 451 452 453
        case e_isnan:
        case e_floor:
        case e_ceil:
        case e_trunc:
            return verify_expr(e->param[0]);
454 455 456 457
        default: return verify_expr(e->param[0]) && verify_expr(e->param[1]);
    }
}

458
int av_expr_parse(AVExpr **expr, const char *s,
459 460 461
                  const char * const *const_names,
                  const char * const *func1_names, double (* const *funcs1)(void *, double),
                  const char * const *func2_names, double (* const *funcs2)(void *, double, double),
462
                  int log_offset, void *log_ctx)
463
{
464
    Parser p = { 0 };
465
    AVExpr *e = NULL;
466 467
    char *w = av_malloc(strlen(s) + 1);
    char *wp = w;
468
    const char *s0 = s;
469
    int ret = 0;
470 471

    if (!w)
472
        return AVERROR(ENOMEM);
473 474 475 476

    while (*s)
        if (!isspace(*s++)) *wp++ = s[-1];
    *wp++ = 0;
477

478
    p.class      = &class;
Michael Niedermayer's avatar
Michael Niedermayer committed
479
    p.stack_index=100;
480
    p.s= w;
481 482 483 484 485
    p.const_names = const_names;
    p.funcs1      = funcs1;
    p.func1_names = func1_names;
    p.funcs2      = funcs2;
    p.func2_names = func2_names;
486 487
    p.log_offset = log_offset;
    p.log_ctx    = log_ctx;
488

489 490
    if ((ret = parse_expr(&e, &p)) < 0)
        goto end;
491
    if (*p.s) {
Ronald S. Bultje's avatar
Ronald S. Bultje committed
492
        av_expr_free(e);
493 494 495 496
        av_log(&p, AV_LOG_ERROR, "Invalid chars '%s' at the end of expression '%s'\n", p.s, s0);
        ret = AVERROR(EINVAL);
        goto end;
    }
497
    if (!verify_expr(e)) {
498
        av_expr_free(e);
499 500
        ret = AVERROR(EINVAL);
        goto end;
501
    }
502
    *expr = e;
503 504
end:
    av_free(w);
505
    return ret;
506 507
}

508
double av_expr_eval(AVExpr *e, const double *const_values, void *opaque)
509
{
510
    Parser p = { 0 };
511

512
    p.const_values = const_values;
513 514 515 516
    p.opaque     = opaque;
    return eval_expr(&p, e);
}

517
int av_expr_parse_and_eval(double *d, const char *s,
518 519 520
                           const char * const *const_names, const double *const_values,
                           const char * const *func1_names, double (* const *funcs1)(void *, double),
                           const char * const *func2_names, double (* const *funcs2)(void *, double, double),
521
                           void *opaque, int log_offset, void *log_ctx)
522
{
523
    AVExpr *e = NULL;
524
    int ret = av_expr_parse(&e, s, const_names, func1_names, funcs1, func2_names, funcs2, log_offset, log_ctx);
525 526 527 528 529

    if (ret < 0) {
        *d = NAN;
        return ret;
    }
530 531
    *d = av_expr_eval(e, const_values, opaque);
    av_expr_free(e);
532
    return isnan(*d) ? AVERROR(EINVAL) : 0;
533
}
534 535

#ifdef TEST
536
#undef printf
537 538
#include <string.h>

539
static double const_values[] = {
540 541 542 543
    M_PI,
    M_E,
    0
};
544

545
static const char *const_names[] = {
546 547 548 549
    "PI",
    "E",
    0
};
550

551
int main(int argc, char **argv)
552
{
Michael Niedermayer's avatar
Michael Niedermayer committed
553
    int i;
554
    double d;
555 556
    const char **expr, *exprs[] = {
        "",
557
        "1;2",
558 559 560
        "-20",
        "-PI",
        "+PI",
561
        "1+(5-2)^(3-1)+1/2+sin(PI)-max(-2.2,-3.1)",
562
        "80G/80Gi",
563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585
        "1k",
        "1Gi",
        "1gi",
        "1GiFoo",
        "1k+1k",
        "1Gi*3foo",
        "foo",
        "foo(",
        "foo()",
        "foo)",
        "sin",
        "sin(",
        "sin()",
        "sin)",
        "sin 10",
        "sin(1,2,3)",
        "sin(1 )",
        "1",
        "1foo",
        "bar + PI + E + 100f*2 + foo",
        "13k + 12f - foo(1, 2)",
        "1gi",
        "1Gi",
586 587 588 589 590 591 592 593
        "st(0, 123)",
        "st(1, 123); ld(1)",
        /* compute 1+2+...+N */
        "st(0, 1); while(lte(ld(0), 100), st(1, ld(1)+ld(0));st(0, ld(0)+1)); ld(1)",
        /* compute Fib(N) */
        "st(1, 1); st(2, 2); st(0, 1); while(lte(ld(0),10), st(3, ld(1)+ld(2)); st(1, ld(2)); st(2, ld(3)); st(0, ld(0)+1)); ld(3)",
        "while(0, 10)",
        "st(0, 1); while(lte(ld(0),100), st(1, ld(1)+ld(0)); st(0, ld(0)+1))",
594 595
        "isnan(1)",
        "isnan(NAN)",
596 597 598 599 600 601 602
        "floor(NAN)",
        "floor(123.123)",
        "floor(-123.123)",
        "trunc(123.123)",
        "trunc(-123.123)",
        "ceil(123.123)",
        "ceil(-123.123)",
603 604 605 606 607
        NULL
    };

    for (expr = exprs; *expr; expr++) {
        printf("Evaluating '%s'\n", *expr);
608
        av_expr_parse_and_eval(&d, *expr,
609 610 611 612 613
                               const_names, const_values,
                               NULL, NULL, NULL, NULL, NULL, 0, NULL);
        printf("'%s' -> %f\n\n", *expr, d);
    }

614
    av_expr_parse_and_eval(&d, "1+(5-2)^(3-1)+1/2+sin(PI)-max(-2.2,-3.1)",
615 616
                           const_names, const_values,
                           NULL, NULL, NULL, NULL, NULL, 0, NULL);
617
    printf("%f == 12.7\n", d);
618
    av_expr_parse_and_eval(&d, "80G/80Gi",
619
                           const_names, const_values,
620
                           NULL, NULL, NULL, NULL, NULL, 0, NULL);
621
    printf("%f == 0.931322575\n", d);
622

623 624 625
    if (argc > 1 && !strcmp(argv[1], "-t")) {
        for (i = 0; i < 1050; i++) {
            START_TIMER;
626
            av_expr_parse_and_eval(&d, "1+(5-2)^(3-1)+1/2+sin(PI)-max(-2.2,-3.1)",
627 628
                                   const_names, const_values,
                                   NULL, NULL, NULL, NULL, NULL, 0, NULL);
629 630
            STOP_TIMER("av_expr_parse_and_eval");
        }
Michael Niedermayer's avatar
Michael Niedermayer committed
631
    }
632

633
    return 0;
634 635
}
#endif