forked from sass/node-sass
/
eval.cpp
1678 lines (1536 loc) · 58 KB
/
eval.cpp
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
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include "sass.hpp"
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <typeinfo>
#include "file.hpp"
#include "eval.hpp"
#include "ast.hpp"
#include "bind.hpp"
#include "util.hpp"
#include "inspect.hpp"
#include "operators.hpp"
#include "environment.hpp"
#include "position.hpp"
#include "sass/values.h"
#include "to_value.hpp"
#include "to_c.hpp"
#include "context.hpp"
#include "backtrace.hpp"
#include "lexer.hpp"
#include "prelexer.hpp"
#include "parser.hpp"
#include "expand.hpp"
#include "color_maps.hpp"
#include "sass_functions.hpp"
namespace Sass {
Eval::Eval(Expand& exp)
: exp(exp),
ctx(exp.ctx),
traces(exp.traces),
force(false),
is_in_comment(false),
is_in_selector_schema(false)
{
bool_true = SASS_MEMORY_NEW(Boolean, "[NA]", true);
bool_false = SASS_MEMORY_NEW(Boolean, "[NA]", false);
}
Eval::~Eval() { }
Env* Eval::environment()
{
return exp.environment();
}
Selector_List_Obj Eval::selector()
{
return exp.selector();
}
Expression_Ptr Eval::operator()(Block_Ptr b)
{
Expression_Ptr val = 0;
for (size_t i = 0, L = b->length(); i < L; ++i) {
val = b->at(i)->perform(this);
if (val) return val;
}
return val;
}
Expression_Ptr Eval::operator()(Assignment_Ptr a)
{
Env* env = exp.environment();
std::string var(a->variable());
if (a->is_global()) {
if (a->is_default()) {
if (env->has_global(var)) {
Expression_Ptr e = Cast<Expression>(env->get_global(var));
if (!e || e->concrete_type() == Expression::NULL_VAL) {
env->set_global(var, a->value()->perform(this));
}
}
else {
env->set_global(var, a->value()->perform(this));
}
}
else {
env->set_global(var, a->value()->perform(this));
}
}
else if (a->is_default()) {
if (env->has_lexical(var)) {
auto cur = env;
while (cur && cur->is_lexical()) {
if (cur->has_local(var)) {
if (AST_Node_Obj node = cur->get_local(var)) {
Expression_Ptr e = Cast<Expression>(node);
if (!e || e->concrete_type() == Expression::NULL_VAL) {
cur->set_local(var, a->value()->perform(this));
}
}
else {
throw std::runtime_error("Env not in sync");
}
return 0;
}
cur = cur->parent();
}
throw std::runtime_error("Env not in sync");
}
else if (env->has_global(var)) {
if (AST_Node_Obj node = env->get_global(var)) {
Expression_Ptr e = Cast<Expression>(node);
if (!e || e->concrete_type() == Expression::NULL_VAL) {
env->set_global(var, a->value()->perform(this));
}
}
}
else if (env->is_lexical()) {
env->set_local(var, a->value()->perform(this));
}
else {
env->set_local(var, a->value()->perform(this));
}
}
else {
env->set_lexical(var, a->value()->perform(this));
}
return 0;
}
Expression_Ptr Eval::operator()(If_Ptr i)
{
Expression_Obj rv = 0;
Env env(exp.environment());
exp.env_stack.push_back(&env);
Expression_Obj cond = i->predicate()->perform(this);
if (!cond->is_false()) {
rv = i->block()->perform(this);
}
else {
Block_Obj alt = i->alternative();
if (alt) rv = alt->perform(this);
}
exp.env_stack.pop_back();
return rv.detach();
}
// For does not create a new env scope
// But iteration vars are reset afterwards
Expression_Ptr Eval::operator()(For_Ptr f)
{
std::string variable(f->variable());
Expression_Obj low = f->lower_bound()->perform(this);
if (low->concrete_type() != Expression::NUMBER) {
traces.push_back(Backtrace(low->pstate()));
throw Exception::TypeMismatch(traces, *low, "integer");
}
Expression_Obj high = f->upper_bound()->perform(this);
if (high->concrete_type() != Expression::NUMBER) {
traces.push_back(Backtrace(high->pstate()));
throw Exception::TypeMismatch(traces, *high, "integer");
}
Number_Obj sass_start = Cast<Number>(low);
Number_Obj sass_end = Cast<Number>(high);
// check if units are valid for sequence
if (sass_start->unit() != sass_end->unit()) {
std::stringstream msg; msg << "Incompatible units: '"
<< sass_end->unit() << "' and '"
<< sass_start->unit() << "'.";
error(msg.str(), low->pstate(), traces);
}
double start = sass_start->value();
double end = sass_end->value();
// only create iterator once in this environment
Env env(environment(), true);
exp.env_stack.push_back(&env);
Block_Obj body = f->block();
Expression_Ptr val = 0;
if (start < end) {
if (f->is_inclusive()) ++end;
for (double i = start;
i < end;
++i) {
Number_Obj it = SASS_MEMORY_NEW(Number, low->pstate(), i, sass_end->unit());
env.set_local(variable, it);
val = body->perform(this);
if (val) break;
}
} else {
if (f->is_inclusive()) --end;
for (double i = start;
i > end;
--i) {
Number_Obj it = SASS_MEMORY_NEW(Number, low->pstate(), i, sass_end->unit());
env.set_local(variable, it);
val = body->perform(this);
if (val) break;
}
}
exp.env_stack.pop_back();
return val;
}
// Eval does not create a new env scope
// But iteration vars are reset afterwards
Expression_Ptr Eval::operator()(Each_Ptr e)
{
std::vector<std::string> variables(e->variables());
Expression_Obj expr = e->list()->perform(this);
Env env(environment(), true);
exp.env_stack.push_back(&env);
List_Obj list = 0;
Map_Ptr map = 0;
if (expr->concrete_type() == Expression::MAP) {
map = Cast<Map>(expr);
}
else if (Selector_List_Ptr ls = Cast<Selector_List>(expr)) {
Listize listize;
Expression_Obj rv = ls->perform(&listize);
list = Cast<List>(rv);
}
else if (expr->concrete_type() != Expression::LIST) {
list = SASS_MEMORY_NEW(List, expr->pstate(), 1, SASS_COMMA);
list->append(expr);
}
else {
list = Cast<List>(expr);
}
Block_Obj body = e->block();
Expression_Obj val = 0;
if (map) {
for (Expression_Obj key : map->keys()) {
Expression_Obj value = map->at(key);
if (variables.size() == 1) {
List_Ptr variable = SASS_MEMORY_NEW(List, map->pstate(), 2, SASS_SPACE);
variable->append(key);
variable->append(value);
env.set_local(variables[0], variable);
} else {
env.set_local(variables[0], key);
env.set_local(variables[1], value);
}
val = body->perform(this);
if (val) break;
}
}
else {
if (list->length() == 1 && Cast<Selector_List>(list)) {
list = Cast<List>(list);
}
for (size_t i = 0, L = list->length(); i < L; ++i) {
Expression_Ptr item = list->at(i);
// unwrap value if the expression is an argument
if (Argument_Ptr arg = Cast<Argument>(item)) item = arg->value();
// check if we got passed a list of args (investigate)
if (List_Ptr scalars = Cast<List>(item)) {
if (variables.size() == 1) {
Expression_Ptr var = scalars;
env.set_local(variables[0], var);
} else {
// XXX: this is never hit via spec tests
for (size_t j = 0, K = variables.size(); j < K; ++j) {
Expression_Ptr res = j >= scalars->length()
? SASS_MEMORY_NEW(Null, expr->pstate())
: scalars->at(j);
env.set_local(variables[j], res);
}
}
} else {
if (variables.size() > 0) {
env.set_local(variables.at(0), item);
for (size_t j = 1, K = variables.size(); j < K; ++j) {
// XXX: this is never hit via spec tests
Expression_Ptr res = SASS_MEMORY_NEW(Null, expr->pstate());
env.set_local(variables[j], res);
}
}
}
val = body->perform(this);
if (val) break;
}
}
exp.env_stack.pop_back();
return val.detach();
}
Expression_Ptr Eval::operator()(While_Ptr w)
{
Expression_Obj pred = w->predicate();
Block_Obj body = w->block();
Env env(environment(), true);
exp.env_stack.push_back(&env);
Expression_Obj cond = pred->perform(this);
while (!cond->is_false()) {
Expression_Obj val = body->perform(this);
if (val) {
exp.env_stack.pop_back();
return val.detach();
}
cond = pred->perform(this);
}
exp.env_stack.pop_back();
return 0;
}
Expression_Ptr Eval::operator()(Return_Ptr r)
{
return r->value()->perform(this);
}
Expression_Ptr Eval::operator()(Warning_Ptr w)
{
Sass_Output_Style outstyle = ctx.c_options.output_style;
ctx.c_options.output_style = NESTED;
Expression_Obj message = w->message()->perform(this);
Env* env = exp.environment();
// try to use generic function
if (env->has("@warn[f]")) {
// add call stack entry
ctx.callee_stack.push_back({
"@warn",
w->pstate().path,
w->pstate().line + 1,
w->pstate().column + 1,
SASS_CALLEE_FUNCTION,
{ env }
});
Definition_Ptr def = Cast<Definition>((*env)["@warn[f]"]);
// Block_Obj body = def->block();
// Native_Function func = def->native_function();
Sass_Function_Entry c_function = def->c_function();
Sass_Function_Fn c_func = sass_function_get_function(c_function);
To_C to_c;
union Sass_Value* c_args = sass_make_list(1, SASS_COMMA, false);
sass_list_set_value(c_args, 0, message->perform(&to_c));
union Sass_Value* c_val = c_func(c_args, c_function, ctx.c_compiler);
ctx.c_options.output_style = outstyle;
ctx.callee_stack.pop_back();
sass_delete_value(c_args);
sass_delete_value(c_val);
return 0;
}
std::string result(unquote(message->to_sass()));
std::cerr << "WARNING: " << result << std::endl;
traces.push_back(Backtrace(w->pstate()));
std::cerr << traces_to_string(traces, " ");
std::cerr << std::endl;
ctx.c_options.output_style = outstyle;
traces.pop_back();
return 0;
}
Expression_Ptr Eval::operator()(Error_Ptr e)
{
Sass_Output_Style outstyle = ctx.c_options.output_style;
ctx.c_options.output_style = NESTED;
Expression_Obj message = e->message()->perform(this);
Env* env = exp.environment();
// try to use generic function
if (env->has("@error[f]")) {
// add call stack entry
ctx.callee_stack.push_back({
"@error",
e->pstate().path,
e->pstate().line + 1,
e->pstate().column + 1,
SASS_CALLEE_FUNCTION,
{ env }
});
Definition_Ptr def = Cast<Definition>((*env)["@error[f]"]);
// Block_Obj body = def->block();
// Native_Function func = def->native_function();
Sass_Function_Entry c_function = def->c_function();
Sass_Function_Fn c_func = sass_function_get_function(c_function);
To_C to_c;
union Sass_Value* c_args = sass_make_list(1, SASS_COMMA, false);
sass_list_set_value(c_args, 0, message->perform(&to_c));
union Sass_Value* c_val = c_func(c_args, c_function, ctx.c_compiler);
ctx.c_options.output_style = outstyle;
ctx.callee_stack.pop_back();
sass_delete_value(c_args);
sass_delete_value(c_val);
return 0;
}
std::string result(unquote(message->to_sass()));
ctx.c_options.output_style = outstyle;
error(result, e->pstate(), traces);
return 0;
}
Expression_Ptr Eval::operator()(Debug_Ptr d)
{
Sass_Output_Style outstyle = ctx.c_options.output_style;
ctx.c_options.output_style = NESTED;
Expression_Obj message = d->value()->perform(this);
Env* env = exp.environment();
// try to use generic function
if (env->has("@debug[f]")) {
// add call stack entry
ctx.callee_stack.push_back({
"@debug",
d->pstate().path,
d->pstate().line + 1,
d->pstate().column + 1,
SASS_CALLEE_FUNCTION,
{ env }
});
Definition_Ptr def = Cast<Definition>((*env)["@debug[f]"]);
// Block_Obj body = def->block();
// Native_Function func = def->native_function();
Sass_Function_Entry c_function = def->c_function();
Sass_Function_Fn c_func = sass_function_get_function(c_function);
To_C to_c;
union Sass_Value* c_args = sass_make_list(1, SASS_COMMA, false);
sass_list_set_value(c_args, 0, message->perform(&to_c));
union Sass_Value* c_val = c_func(c_args, c_function, ctx.c_compiler);
ctx.c_options.output_style = outstyle;
ctx.callee_stack.pop_back();
sass_delete_value(c_args);
sass_delete_value(c_val);
return 0;
}
std::string cwd(ctx.cwd());
std::string result(unquote(message->to_sass()));
std::string abs_path(Sass::File::rel2abs(d->pstate().path, cwd, cwd));
std::string rel_path(Sass::File::abs2rel(d->pstate().path, cwd, cwd));
std::string output_path(Sass::File::path_for_console(rel_path, abs_path, d->pstate().path));
ctx.c_options.output_style = outstyle;
std::cerr << output_path << ":" << d->pstate().line+1 << " DEBUG: " << result;
std::cerr << std::endl;
return 0;
}
Expression_Ptr Eval::operator()(List_Ptr l)
{
// special case for unevaluated map
if (l->separator() == SASS_HASH) {
Map_Obj lm = SASS_MEMORY_NEW(Map,
l->pstate(),
l->length() / 2);
for (size_t i = 0, L = l->length(); i < L; i += 2)
{
Expression_Obj key = (*l)[i+0]->perform(this);
Expression_Obj val = (*l)[i+1]->perform(this);
// make sure the color key never displays its real name
key->is_delayed(true); // verified
*lm << std::make_pair(key, val);
}
if (lm->has_duplicate_key()) {
traces.push_back(Backtrace(l->pstate()));
throw Exception::DuplicateKeyError(traces, *lm, *l);
}
lm->is_interpolant(l->is_interpolant());
return lm->perform(this);
}
// check if we should expand it
if (l->is_expanded()) return l;
// regular case for unevaluated lists
List_Obj ll = SASS_MEMORY_NEW(List,
l->pstate(),
l->length(),
l->separator(),
l->is_arglist(),
l->is_bracketed());
for (size_t i = 0, L = l->length(); i < L; ++i) {
ll->append((*l)[i]->perform(this));
}
ll->is_interpolant(l->is_interpolant());
ll->from_selector(l->from_selector());
ll->is_expanded(true);
return ll.detach();
}
Expression_Ptr Eval::operator()(Map_Ptr m)
{
if (m->is_expanded()) return m;
// make sure we're not starting with duplicate keys.
// the duplicate key state will have been set in the parser phase.
if (m->has_duplicate_key()) {
traces.push_back(Backtrace(m->pstate()));
throw Exception::DuplicateKeyError(traces, *m, *m);
}
Map_Obj mm = SASS_MEMORY_NEW(Map,
m->pstate(),
m->length());
for (auto key : m->keys()) {
Expression_Ptr ex_key = key->perform(this);
Expression_Ptr ex_val = m->at(key);
if (ex_val == NULL) continue;
ex_val = ex_val->perform(this);
*mm << std::make_pair(ex_key, ex_val);
}
// check the evaluated keys aren't duplicates.
if (mm->has_duplicate_key()) {
traces.push_back(Backtrace(m->pstate()));
throw Exception::DuplicateKeyError(traces, *mm, *m);
}
mm->is_expanded(true);
return mm.detach();
}
Expression_Ptr Eval::operator()(Binary_Expression_Ptr b_in)
{
Expression_Obj lhs = b_in->left();
Expression_Obj rhs = b_in->right();
enum Sass_OP op_type = b_in->optype();
if (op_type == Sass_OP::AND) {
// LOCAL_FLAG(force, true);
lhs = lhs->perform(this);
if (!*lhs) return lhs.detach();
return rhs->perform(this);
}
else if (op_type == Sass_OP::OR) {
// LOCAL_FLAG(force, true);
lhs = lhs->perform(this);
if (*lhs) return lhs.detach();
return rhs->perform(this);
}
// Evaluate variables as early o
while (Variable_Ptr l_v = Cast<Variable>(lhs)) {
lhs = operator()(l_v);
}
while (Variable_Ptr r_v = Cast<Variable>(rhs)) {
rhs = operator()(r_v);
}
Binary_Expression_Obj b = b_in;
// Evaluate sub-expressions early on
while (Binary_Expression_Ptr l_b = Cast<Binary_Expression>(lhs)) {
if (!force && l_b->is_delayed()) break;
lhs = operator()(l_b);
}
while (Binary_Expression_Ptr r_b = Cast<Binary_Expression>(rhs)) {
if (!force && r_b->is_delayed()) break;
rhs = operator()(r_b);
}
// don't eval delayed expressions (the '/' when used as a separator)
if (!force && op_type == Sass_OP::DIV && b->is_delayed()) {
b->right(b->right()->perform(this));
b->left(b->left()->perform(this));
return b.detach();
}
// specific types we know are final
// handle them early to avoid overhead
if (Number_Ptr l_n = Cast<Number>(lhs)) {
// lhs is number and rhs is number
if (Number_Ptr r_n = Cast<Number>(rhs)) {
try {
switch (op_type) {
case Sass_OP::EQ: return *l_n == *r_n ? bool_true : bool_false;
case Sass_OP::NEQ: return *l_n == *r_n ? bool_false : bool_true;
case Sass_OP::LT: return *l_n < *r_n ? bool_true : bool_false;
case Sass_OP::GTE: return *l_n < *r_n ? bool_false : bool_true;
case Sass_OP::LTE: return *l_n < *r_n || *l_n == *r_n ? bool_true : bool_false;
case Sass_OP::GT: return *l_n < *r_n || *l_n == *r_n ? bool_false : bool_true;
case Sass_OP::ADD: case Sass_OP::SUB: case Sass_OP::MUL: case Sass_OP::DIV: case Sass_OP::MOD:
return Operators::op_numbers(op_type, *l_n, *r_n, ctx.c_options, b_in->pstate());
default: break;
}
}
catch (Exception::OperationError& err)
{
traces.push_back(Backtrace(b_in->pstate()));
throw Exception::SassValueError(traces, b_in->pstate(), err);
}
}
// lhs is number and rhs is color
else if (Color_Ptr r_c = Cast<Color>(rhs)) {
try {
switch (op_type) {
case Sass_OP::EQ: return *l_n == *r_c ? bool_true : bool_false;
case Sass_OP::NEQ: return *l_n == *r_c ? bool_false : bool_true;
case Sass_OP::LT: return *l_n < *r_c ? bool_true : bool_false;
case Sass_OP::GTE: return *l_n < *r_c ? bool_false : bool_true;
case Sass_OP::LTE: return *l_n < *r_c || *l_n == *r_c ? bool_true : bool_false;
case Sass_OP::GT: return *l_n < *r_c || *l_n == *r_c ? bool_false : bool_true;
case Sass_OP::ADD: case Sass_OP::SUB: case Sass_OP::MUL: case Sass_OP::DIV: case Sass_OP::MOD:
return Operators::op_number_color(op_type, *l_n, *r_c, ctx.c_options, b_in->pstate());
default: break;
}
}
catch (Exception::OperationError& err)
{
traces.push_back(Backtrace(b_in->pstate()));
throw Exception::SassValueError(traces, b_in->pstate(), err);
}
}
}
else if (Color_Ptr l_c = Cast<Color>(lhs)) {
// lhs is color and rhs is color
if (Color_Ptr r_c = Cast<Color>(rhs)) {
try {
switch (op_type) {
case Sass_OP::EQ: return *l_c == *r_c ? bool_true : bool_false;
case Sass_OP::NEQ: return *l_c == *r_c ? bool_false : bool_true;
case Sass_OP::LT: return *l_c < *r_c ? bool_true : bool_false;
case Sass_OP::GTE: return *l_c < *r_c ? bool_false : bool_true;
case Sass_OP::LTE: return *l_c < *r_c || *l_c == *r_c ? bool_true : bool_false;
case Sass_OP::GT: return *l_c < *r_c || *l_c == *r_c ? bool_false : bool_true;
case Sass_OP::ADD: case Sass_OP::SUB: case Sass_OP::MUL: case Sass_OP::DIV: case Sass_OP::MOD:
return Operators::op_colors(op_type, *l_c, *r_c, ctx.c_options, b_in->pstate());
default: break;
}
}
catch (Exception::OperationError& err)
{
traces.push_back(Backtrace(b_in->pstate()));
throw Exception::SassValueError(traces, b_in->pstate(), err);
}
}
// lhs is color and rhs is number
else if (Number_Ptr r_n = Cast<Number>(rhs)) {
try {
switch (op_type) {
case Sass_OP::EQ: return *l_c == *r_n ? bool_true : bool_false;
case Sass_OP::NEQ: return *l_c == *r_n ? bool_false : bool_true;
case Sass_OP::LT: return *l_c < *r_n ? bool_true : bool_false;
case Sass_OP::GTE: return *l_c < *r_n ? bool_false : bool_true;
case Sass_OP::LTE: return *l_c < *r_n || *l_c == *r_n ? bool_true : bool_false;
case Sass_OP::GT: return *l_c < *r_n || *l_c == *r_n ? bool_false : bool_true;
case Sass_OP::ADD: case Sass_OP::SUB: case Sass_OP::MUL: case Sass_OP::DIV: case Sass_OP::MOD:
return Operators::op_color_number(op_type, *l_c, *r_n, ctx.c_options, b_in->pstate());
default: break;
}
}
catch (Exception::OperationError& err)
{
traces.push_back(Backtrace(b_in->pstate()));
throw Exception::SassValueError(traces, b_in->pstate(), err);
}
}
}
String_Schema_Obj ret_schema;
// only the last item will be used to eval the binary expression
if (String_Schema_Ptr s_l = Cast<String_Schema>(b->left())) {
if (!s_l->has_interpolant() && (!s_l->is_right_interpolant())) {
ret_schema = SASS_MEMORY_NEW(String_Schema, b->pstate());
Binary_Expression_Obj bin_ex = SASS_MEMORY_NEW(Binary_Expression, b->pstate(),
b->op(), s_l->last(), b->right());
bin_ex->is_delayed(b->left()->is_delayed() || b->right()->is_delayed()); // unverified
for (size_t i = 0; i < s_l->length() - 1; ++i) {
ret_schema->append(s_l->at(i)->perform(this));
}
ret_schema->append(bin_ex->perform(this));
return ret_schema->perform(this);
}
}
if (String_Schema_Ptr s_r = Cast<String_Schema>(b->right())) {
if (!s_r->has_interpolant() && (!s_r->is_left_interpolant() || op_type == Sass_OP::DIV)) {
ret_schema = SASS_MEMORY_NEW(String_Schema, b->pstate());
Binary_Expression_Obj bin_ex = SASS_MEMORY_NEW(Binary_Expression, b->pstate(),
b->op(), b->left(), s_r->first());
bin_ex->is_delayed(b->left()->is_delayed() || b->right()->is_delayed()); // verified
ret_schema->append(bin_ex->perform(this));
for (size_t i = 1; i < s_r->length(); ++i) {
ret_schema->append(s_r->at(i)->perform(this));
}
return ret_schema->perform(this);
}
}
// fully evaluate their values
if (op_type == Sass_OP::EQ ||
op_type == Sass_OP::NEQ ||
op_type == Sass_OP::GT ||
op_type == Sass_OP::GTE ||
op_type == Sass_OP::LT ||
op_type == Sass_OP::LTE)
{
LOCAL_FLAG(force, true);
lhs->is_expanded(false);
lhs->set_delayed(false);
lhs = lhs->perform(this);
rhs->is_expanded(false);
rhs->set_delayed(false);
rhs = rhs->perform(this);
}
else {
lhs = lhs->perform(this);
}
// not a logical connective, so go ahead and eval the rhs
rhs = rhs->perform(this);
AST_Node_Obj lu = lhs;
AST_Node_Obj ru = rhs;
Expression::Concrete_Type l_type;
Expression::Concrete_Type r_type;
// Is one of the operands an interpolant?
String_Schema_Obj s1 = Cast<String_Schema>(b->left());
String_Schema_Obj s2 = Cast<String_Schema>(b->right());
Binary_Expression_Obj b1 = Cast<Binary_Expression>(b->left());
Binary_Expression_Obj b2 = Cast<Binary_Expression>(b->right());
bool schema_op = false;
bool force_delay = (s2 && s2->is_left_interpolant()) ||
(s1 && s1->is_right_interpolant()) ||
(b1 && b1->is_right_interpolant()) ||
(b2 && b2->is_left_interpolant());
if ((s1 && s1->has_interpolants()) || (s2 && s2->has_interpolants()) || force_delay)
{
if (op_type == Sass_OP::DIV || op_type == Sass_OP::MUL || op_type == Sass_OP::MOD || op_type == Sass_OP::ADD || op_type == Sass_OP::SUB ||
op_type == Sass_OP::EQ) {
// If possible upgrade LHS to a number (for number to string compare)
if (String_Constant_Ptr str = Cast<String_Constant>(lhs)) {
std::string value(str->value());
const char* start = value.c_str();
if (Prelexer::sequence < Prelexer::dimension, Prelexer::end_of_file >(start) != 0) {
lhs = Parser::lexed_dimension(b->pstate(), str->value());
}
}
// If possible upgrade RHS to a number (for string to number compare)
if (String_Constant_Ptr str = Cast<String_Constant>(rhs)) {
std::string value(str->value());
const char* start = value.c_str();
if (Prelexer::sequence < Prelexer::dimension, Prelexer::number >(start) != 0) {
rhs = Parser::lexed_dimension(b->pstate(), str->value());
}
}
}
To_Value to_value(ctx);
Value_Obj v_l = Cast<Value>(lhs->perform(&to_value));
Value_Obj v_r = Cast<Value>(rhs->perform(&to_value));
if (force_delay) {
std::string str("");
str += v_l->to_string(ctx.c_options);
if (b->op().ws_before) str += " ";
str += b->separator();
if (b->op().ws_after) str += " ";
str += v_r->to_string(ctx.c_options);
String_Constant_Ptr val = SASS_MEMORY_NEW(String_Constant, b->pstate(), str);
val->is_interpolant(b->left()->has_interpolant());
return val;
}
}
// see if it's a relational expression
try {
switch(op_type) {
case Sass_OP::EQ: return SASS_MEMORY_NEW(Boolean, b->pstate(), Operators::eq(lhs, rhs));
case Sass_OP::NEQ: return SASS_MEMORY_NEW(Boolean, b->pstate(), Operators::neq(lhs, rhs));
case Sass_OP::GT: return SASS_MEMORY_NEW(Boolean, b->pstate(), Operators::gt(lhs, rhs));
case Sass_OP::GTE: return SASS_MEMORY_NEW(Boolean, b->pstate(), Operators::gte(lhs, rhs));
case Sass_OP::LT: return SASS_MEMORY_NEW(Boolean, b->pstate(), Operators::lt(lhs, rhs));
case Sass_OP::LTE: return SASS_MEMORY_NEW(Boolean, b->pstate(), Operators::lte(lhs, rhs));
default: break;
}
}
catch (Exception::OperationError& err)
{
// throw Exception::Base(b->pstate(), err.what());
traces.push_back(Backtrace(b->pstate()));
throw Exception::SassValueError(traces, b->pstate(), err);
}
l_type = lhs->concrete_type();
r_type = rhs->concrete_type();
// ToDo: throw error in op functions
// ToDo: then catch and re-throw them
Expression_Obj rv;
try {
ParserState pstate(b->pstate());
if (l_type == Expression::NUMBER && r_type == Expression::NUMBER) {
Number_Ptr l_n = Cast<Number>(lhs);
Number_Ptr r_n = Cast<Number>(rhs);
l_n->reduce(); r_n->reduce();
rv = Operators::op_numbers(op_type, *l_n, *r_n, ctx.c_options, pstate);
}
else if (l_type == Expression::NUMBER && r_type == Expression::COLOR) {
Number_Ptr l_n = Cast<Number>(lhs);
Color_Ptr r_c = Cast<Color>(rhs);
rv = Operators::op_number_color(op_type, *l_n, *r_c, ctx.c_options, pstate);
}
else if (l_type == Expression::COLOR && r_type == Expression::NUMBER) {
Color_Ptr l_c = Cast<Color>(lhs);
Number_Ptr r_n = Cast<Number>(rhs);
rv = Operators::op_color_number(op_type, *l_c, *r_n, ctx.c_options, pstate);
}
else if (l_type == Expression::COLOR && r_type == Expression::COLOR) {
Color_Ptr l_c = Cast<Color>(lhs);
Color_Ptr r_c = Cast<Color>(rhs);
rv = Operators::op_colors(op_type, *l_c, *r_c, ctx.c_options, pstate);
}
else {
To_Value to_value(ctx);
// this will leak if perform does not return a value!
Value_Obj v_l = Cast<Value>(lhs->perform(&to_value));
Value_Obj v_r = Cast<Value>(rhs->perform(&to_value));
bool interpolant = b->is_right_interpolant() ||
b->is_left_interpolant() ||
b->is_interpolant();
if (op_type == Sass_OP::SUB) interpolant = false;
// if (op_type == Sass_OP::DIV) interpolant = true;
// check for type violations
if (l_type == Expression::MAP || l_type == Expression::FUNCTION_VAL) {
traces.push_back(Backtrace(v_l->pstate()));
throw Exception::InvalidValue(traces, *v_l);
}
if (r_type == Expression::MAP || l_type == Expression::FUNCTION_VAL) {
traces.push_back(Backtrace(v_r->pstate()));
throw Exception::InvalidValue(traces, *v_r);
}
Value_Ptr ex = Operators::op_strings(b->op(), *v_l, *v_r, ctx.c_options, pstate, !interpolant); // pass true to compress
if (String_Constant_Ptr str = Cast<String_Constant>(ex))
{
if (str->concrete_type() == Expression::STRING)
{
String_Constant_Ptr lstr = Cast<String_Constant>(lhs);
String_Constant_Ptr rstr = Cast<String_Constant>(rhs);
if (op_type != Sass_OP::SUB) {
if (String_Constant_Ptr org = lstr ? lstr : rstr)
{ str->quote_mark(org->quote_mark()); }
}
}
}
ex->is_interpolant(b->is_interpolant());
rv = ex;
}
}
catch (Exception::OperationError& err)
{
traces.push_back(Backtrace(b->pstate()));
// throw Exception::Base(b->pstate(), err.what());
throw Exception::SassValueError(traces, b->pstate(), err);
}
if (rv) {
if (schema_op) {
// XXX: this is never hit via spec tests
(*s2)[0] = rv;
rv = s2->perform(this);
}
}
return rv.detach();
}
Expression_Ptr Eval::operator()(Unary_Expression_Ptr u)
{
Expression_Obj operand = u->operand()->perform(this);
if (u->optype() == Unary_Expression::NOT) {
Boolean_Ptr result = SASS_MEMORY_NEW(Boolean, u->pstate(), (bool)*operand);
result->value(!result->value());
return result;
}
else if (Number_Obj nr = Cast<Number>(operand)) {
// negate value for minus unary expression
if (u->optype() == Unary_Expression::MINUS) {
Number_Obj cpy = SASS_MEMORY_COPY(nr);
cpy->value( - cpy->value() ); // negate value
return cpy.detach(); // return the copy
}
else if (u->optype() == Unary_Expression::SLASH) {
std::string str = '/' + nr->to_string(ctx.c_options);
return SASS_MEMORY_NEW(String_Constant, u->pstate(), str);
}
// nothing for positive
return nr.detach();
}
else {
// Special cases: +/- variables which evaluate to null ouput just +/-,
// but +/- null itself outputs the string
if (operand->concrete_type() == Expression::NULL_VAL && Cast<Variable>(u->operand())) {
u->operand(SASS_MEMORY_NEW(String_Quoted, u->pstate(), ""));
}
// Never apply unary opertions on colors @see #2140
else if (Color_Ptr color = Cast<Color>(operand)) {
// Use the color name if this was eval with one
if (color->disp().length() > 0) {
operand = SASS_MEMORY_NEW(String_Constant, operand->pstate(), color->disp());
u->operand(operand);
}
}
else {
u->operand(operand);
}
return SASS_MEMORY_NEW(String_Quoted,
u->pstate(),
u->inspect());
}
// unreachable
return u;
}
Expression_Ptr Eval::operator()(Function_Call_Ptr c)
{
if (traces.size() > Constants::MaxCallStack) {
// XXX: this is never hit via spec tests
std::ostringstream stm;
stm << "Stack depth exceeded max of " << Constants::MaxCallStack;
error(stm.str(), c->pstate(), traces);
}
std::string name(Util::normalize_underscores(c->name()));
std::string full_name(name + "[f]");
// we make a clone here, need to implement that further
Arguments_Obj args = c->arguments();
Env* env = environment();
if (!env->has(full_name) || (!c->via_call() && Prelexer::re_special_fun(name.c_str()))) {
if (!env->has("*[f]")) {
for (Argument_Obj arg : args->elements()) {
if (List_Obj ls = Cast<List>(arg->value())) {
if (ls->size() == 0) error("() isn't a valid CSS value.", c->pstate(), traces);
}
}
args = Cast<Arguments>(args->perform(this));
Function_Call_Obj lit = SASS_MEMORY_NEW(Function_Call,
c->pstate(),
c->name(),
args);
if (args->has_named_arguments()) {
error("Function " + c->name() + " doesn't support keyword arguments", c->pstate(), traces);
}
String_Quoted_Ptr str = SASS_MEMORY_NEW(String_Quoted,
c->pstate(),
lit->to_string(ctx.c_options));
str->is_interpolant(c->is_interpolant());
return str;
} else {
// call generic function
full_name = "*[f]";
}
}
// further delay for calls
if (full_name != "call[f]") {
args->set_delayed(false); // verified
}
if (full_name != "if[f]") {
args = Cast<Arguments>(args->perform(this));
}
Definition_Ptr def = Cast<Definition>((*env)[full_name]);
if (c->func()) def = c->func()->definition();
if (def->is_overload_stub()) {
std::stringstream ss;
size_t L = args->length();
// account for rest arguments
if (args->has_rest_argument() && args->length() > 0) {
// get the rest arguments list
List_Ptr rest = Cast<List>(args->last()->value());
// arguments before rest argument plus rest
if (rest) L += rest->length() - 1;
}
ss << full_name << L;
full_name = ss.str();
std::string resolved_name(full_name);
if (!env->has(resolved_name)) error("overloaded function `" + std::string(c->name()) + "` given wrong number of arguments", c->pstate(), traces);
def = Cast<Definition>((*env)[resolved_name]);
}
Expression_Obj result = c;
Block_Obj body = def->block();
Native_Function func = def->native_function();
Sass_Function_Entry c_function = def->c_function();
if (c->is_css()) return result.detach();
Parameters_Obj params = def->parameters();