-
-
Notifications
You must be signed in to change notification settings - Fork 597
/
elem.d
3223 lines (2858 loc) · 72.5 KB
/
elem.d
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
/**
* Compiler implementation of the
* $(LINK2 http://www.dlang.org, D programming language).
*
* Copyright: Copyright (C) 1985-1998 by Symantec
* Copyright (C) 2000-2021 by The D Language Foundation, All Rights Reserved
* Authors: $(LINK2 http://www.digitalmars.com, Walter Bright)
* License: $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
* Source: $(LINK2 https://github.com/dlang/dmd/blob/master/src/dmd/backend/elem.d, backend/elem.d)
*/
/* Routines to handle elems. */
module dmd.backend.elem;
version (SCPP)
{
version = COMPILE;
version = SCPP_HTOD;
}
version (HTOD)
{
version = COMPILE;
version = SCPP_HTOD;
}
version (MARS)
{
version = COMPILE;
enum HYDRATE = false;
enum DEHYDRATE = false;
}
version (COMPILE)
{
import core.stdc.stdarg;
import core.stdc.stdio;
import core.stdc.stdlib;
import core.stdc.string;
import dmd.backend.cdef;
import dmd.backend.cc;
import dmd.backend.cgcv;
import dmd.backend.code;
import dmd.backend.code_x86;
import dmd.backend.dlist;
import dmd.backend.dt;
import dmd.backend.dvec;
import dmd.backend.el;
import dmd.backend.evalu8 : el_toldoubled;
import dmd.backend.global;
import dmd.backend.goh;
import dmd.backend.mem;
import dmd.backend.obj;
import dmd.backend.oper;
import dmd.backend.rtlsym;
import dmd.backend.ty;
import dmd.backend.type;
version (SCPP_HTOD)
{
import msgs2;
import parser;
import precomp;
}
version (CRuntime_Microsoft)
{
import dmd.root.longdouble;
}
/+
version (CRuntime_Microsoft) extern (C++)
{
alias real_t = real;
private struct longdouble_soft { real_t r; }
size_t ld_sprint(char* str, int fmt, longdouble_soft x);
}
+/
extern (C++):
nothrow:
@safe:
alias MEM_PH_MALLOC = mem_malloc;
alias MEM_PH_CALLOC = mem_calloc;
alias MEM_PH_FREE = mem_free;
alias MEM_PH_FREEFP = mem_freefp;
alias MEM_PH_STRDUP = mem_strdup;
alias MEM_PH_REALLOC = mem_realloc;
alias MEM_PARF_MALLOC = mem_malloc;
alias MEM_PARF_CALLOC = mem_calloc;
alias MEM_PARF_REALLOC = mem_realloc;
alias MEM_PARF_FREE = mem_free;
alias MEM_PARF_STRDUP = mem_strdup;
int REGSIZE();
version (STATS)
{
private __gshared
{
int elfreed = 0; /* number of freed elems */
int eprm_cnt; /* max # of allocs at any point */
}
}
/*******************************
* Do our own storage allocation of elems.
*/
private __gshared
{
elem *nextfree = null; /* pointer to next free elem */
int elcount = 0; /* number of allocated elems */
int elem_size = elem.sizeof;
debug
int elmax; /* max # of allocs at any point */
}
/////////////////////////////
// Table to gather redundant strings in.
struct STAB
{
Symbol *sym; // symbol that refers to the string
char[] str; // the string
}
private __gshared
{
STAB[16] stable;
int stable_si;
}
/************************
* Initialize el package.
*/
@trusted
void el_init()
{
if (!configv.addlinenumbers)
elem_size = elem.sizeof - Srcpos.sizeof;
}
/*******************************
* Initialize for another run through.
*/
@trusted
void el_reset()
{
stable_si = 0;
for (int i = 0; i < stable.length; i++)
mem_free(stable[i].str.ptr);
memset(stable.ptr,0,stable.sizeof);
}
/************************
* Terminate el package.
*/
@trusted
void el_term()
{
static if (TERMCODE)
{
for (int i = 0; i < stable.length; i++)
mem_free(stable[i].str.ptr);
debug printf("Max # of elems = %d\n",elmax);
if (elcount != 0)
printf("unfreed elems = %d\n",elcount);
while (nextfree)
{
elem *e;
e = nextfree.EV.E1;
mem_ffree(nextfree);
nextfree = e;
}
}
else
{
assert(elcount == 0);
}
}
/***********************
* Allocate an element.
*/
@trusted
elem *el_calloc()
{
elem *e;
elcount++;
if (nextfree)
{
e = nextfree;
nextfree = e.EV.E1;
}
else
e = cast(elem *) mem_fmalloc(elem.sizeof);
version (STATS)
eprm_cnt++;
//MEMCLEAR(e, (*e).sizeof);
memset(e, 0, (*e).sizeof);
debug
{
e.id = elem.IDelem;
if (elcount > elmax)
elmax = elcount;
}
/*printf("el_calloc() = %p\n",e);*/
return e;
}
/***************
* Free element
*/
@trusted
void el_free(elem *e)
{
L1:
if (!e) return;
elem_debug(e);
//printf("el_free(%p)\n",e);
//elem_print(e);
version (SCPP_HTOD)
{
tym_t ty;
if (PARSER)
{
ty = e.ET ? e.ET.Tty : 0;
type_free(e.ET);
}
else if (e.Ecount--)
return; // usage count
}
else
{
if (e.Ecount--)
return; // usage count
}
elcount--;
const op = e.Eoper;
switch (op)
{
case OPconst:
break;
case OPvar:
break;
case OPrelconst:
version (SCPP_HTOD)
if (0 && PARSER && tybasic(ty) == TYmemptr)
el_free(e.EV.ethis);
break;
case OPstring:
case OPasm:
mem_free(e.EV.Vstring);
break;
default:
debug assert(op < OPMAX);
if (!OTleaf(op))
{
if (OTbinary(op))
el_free(e.EV.E2);
elem* en = e.EV.E1;
debug memset(e,0xFF,elem_size);
e.EV.E1 = nextfree;
nextfree = e;
version (STATS)
elfreed++;
e = en;
goto L1;
}
break;
}
debug memset(e,0xFF,elem_size);
e.EV.E1 = nextfree;
nextfree = e;
version (STATS)
elfreed++;
}
version (STATS)
{
/* count number of elems available on free list */
void el_count_free()
{
elem *e;
int count;
for(e=nextfree;e;e=e.EV.E1)
count++;
printf("Requests for elems %d\n",elcount);
printf("Requests to free elems %d\n",elfreed);
printf("Number of elems %d\n",eprm_cnt);
printf("Number of elems currently on free list %d\n",count);
}
}
/*********************
* Combine e1 and e2 with a comma-expression.
* Be careful about either or both being null.
*/
elem * el_combine(elem *e1,elem *e2)
{
if (e1)
{
if (e2)
{
version (SCPP_HTOD)
{
e1 = (PARSER) ? el_bint(OPcomma,e2.ET,e1,e2)
: el_bin(OPcomma,e2.Ety,e1,e2);
}
else
{
e1 = el_bin(OPcomma,e2.Ety,e1,e2);
}
}
}
else
e1 = e2;
return e1;
}
/*********************
* Combine e1 and e2 as parameters to a function.
* Be careful about either or both being null.
*/
elem * el_param(elem *e1,elem *e2)
{
//printf("el_param(%p, %p)\n", e1, e2);
if (e1)
{
if (e2)
{
version (SCPP_HTOD)
{
e1 = (PARSER) ? el_bint(OPparam,tstypes[TYvoid],e1,e2)
: el_bin(OPparam,TYvoid,e1,e2);
}
else
{
e1 = el_bin(OPparam,TYvoid,e1,e2);
}
}
}
else
e1 = e2;
return e1;
}
/*********************************
* Create parameter list, terminated by a null.
*/
@trusted
elem *el_params(elem *e1, ...)
{
elem *e;
va_list ap;
e = null;
va_start(ap, e1);
for (; e1; e1 = va_arg!(elem *)(ap))
{
e = el_param(e, e1);
}
va_end(ap);
return e;
}
/*****************************************
* Do an array of parameters as a balanced
* binary tree.
*/
@trusted
elem *el_params(void **args, int length)
{
if (length == 0)
return null;
if (length == 1)
return cast(elem *)args[0];
int mid = length >> 1;
return el_param(el_params(args, mid),
el_params(args + mid, length - mid));
}
/*****************************************
* Do an array of parameters as a balanced
* binary tree.
*/
@trusted
elem *el_combines(void **args, int length)
{
if (length == 0)
return null;
if (length == 1)
return cast(elem *)args[0];
int mid = length >> 1;
return el_combine(el_combines(args, mid),
el_combines(args + mid, length - mid));
}
/**************************************
* Return number of op nodes
*/
@trusted
size_t el_opN(const elem *e, OPER op)
{
if (e.Eoper == op)
return el_opN(e.EV.E1, op) + el_opN(e.EV.E2, op);
else
return 1;
}
/******************************************
* Fill an array with the ops.
*/
@trusted
void el_opArray(elem ***parray, elem *e, OPER op)
{
if (e.Eoper == op)
{
el_opArray(parray, e.EV.E1, op);
el_opArray(parray, e.EV.E2, op);
}
else
{
**parray = e;
++(*parray);
}
}
@trusted
void el_opFree(elem *e, OPER op)
{
if (e.Eoper == op)
{
el_opFree(e.EV.E1, op);
el_opFree(e.EV.E2, op);
e.EV.E1 = null;
e.EV.E2 = null;
el_free(e);
}
}
/*****************************************
* Do an array of parameters as a tree
*/
@trusted
extern (C) elem *el_opCombine(elem **args, size_t length, OPER op, tym_t ty)
{
if (length == 0)
return null;
if (length == 1)
return args[0];
return el_bin(op, ty, el_opCombine(args, length - 1, op, ty), args[length - 1]);
}
/***************************************
* Return a list of the parameters.
*/
int el_nparams(const elem *e)
{
return cast(int)el_opN(e, OPparam);
}
/******************************************
* Fill an array with the parameters.
*/
@trusted
void el_paramArray(elem ***parray, elem *e)
{
if (e.Eoper == OPparam)
{
el_paramArray(parray, e.EV.E1);
el_paramArray(parray, e.EV.E2);
freenode(e);
}
else
{
**parray = e;
++(*parray);
}
}
/*************************************
* Create a quad word out of two dwords.
*/
elem *el_pair(tym_t tym, elem *lo, elem *hi)
{
static if (0)
{
lo = el_una(OPu32_64, TYullong, lo);
hi = el_una(OPu32_64, TYullong, hi);
hi = el_bin(OPshl, TYullong, hi, el_long(TYint, 32));
return el_bin(OPor, tym, lo, hi);
}
else
{
return el_bin(OPpair, tym, lo, hi);
}
}
/*************************
* Copy an element (not the tree!).
*/
@trusted
void el_copy(elem *to, const elem *from)
{
assert(to && from);
elem_debug(from);
elem_debug(to);
memcpy(to,from,elem_size);
elem_debug(to);
}
/***********************************
* Allocate a temporary, and return temporary elem.
*/
@trusted
elem * el_alloctmp(tym_t ty)
{
version (MARS)
{ }
else
assert(!PARSER);
Symbol *s;
s = symbol_generate(SCauto,type_fake(ty));
symbol_add(s);
s.Sfl = FLauto;
s.Sflags = SFLfree | SFLunambig | GTregcand;
return el_var(s);
}
/********************************
* Select the e1 child of e.
*/
@trusted
elem * el_selecte1(elem *e)
{
elem *e1;
assert(!PARSER);
elem_debug(e);
assert(!OTleaf(e.Eoper));
e1 = e.EV.E1;
elem_debug(e1);
if (e.EV.E2) elem_debug(e.EV.E2);
e.EV.E1 = null; // so e1 won't be freed
if (configv.addlinenumbers)
{
if (e.Esrcpos.Slinnum)
e1.Esrcpos = e.Esrcpos;
}
e1.Ety = e.Ety;
//if (tyaggregate(e1.Ety))
// e1.Enumbytes = e.Enumbytes;
version (MARS)
{
if (!e1.Ejty)
e1.Ejty = e.Ejty;
}
el_free(e);
return e1;
}
/********************************
* Select the e2 child of e.
*/
@trusted
elem * el_selecte2(elem *e)
{
elem *e2;
//printf("el_selecte2(%p)\n",e);
elem_debug(e);
assert(OTbinary(e.Eoper));
if (e.EV.E1)
elem_debug(e.EV.E1);
e2 = e.EV.E2;
elem_debug(e2);
e.EV.E2 = null; // so e2 won't be freed
if (configv.addlinenumbers)
{
if (e.Esrcpos.Slinnum)
e2.Esrcpos = e.Esrcpos;
}
if (PARSER)
el_settype(e2,e.ET);
else
{
e2.Ety = e.Ety;
//if (tyaggregate(e.Ety))
// e2.Enumbytes = e.Enumbytes;
}
el_free(e);
return e2;
}
/*************************
* Create and return a duplicate of e, including its leaves.
* No CSEs.
*/
@trusted
elem * el_copytree(elem *e)
{
elem *d;
if (!e)
return e;
elem_debug(e);
d = el_calloc();
el_copy(d,e);
assert(!e.Ecount);
version (SCPP_HTOD)
{
if (PARSER)
{
type_debug(d.ET);
d.ET.Tcount++;
}
}
if (!OTleaf(e.Eoper))
{
d.EV.E1 = el_copytree(e.EV.E1);
if (OTbinary(e.Eoper))
d.EV.E2 = el_copytree(e.EV.E2);
}
else
{
switch (e.Eoper)
{
case OPstring:
static if (0)
{
if (OPTIMIZER)
{
/* Convert the string to a static symbol and
then just refer to it, because two OPstrings can't
refer to the same string.
*/
el_convstring(e); // convert string to symbol
d.Eoper = OPrelconst;
d.EV.Vsym = e.EV.Vsym;
break;
}
}
static if (0)
{
case OPrelconst:
e.EV.sm.ethis = null;
break;
}
case OPasm:
d.EV.Vstring = cast(char *) mem_malloc(d.EV.Vstrlen);
memcpy(d.EV.Vstring,e.EV.Vstring,e.EV.Vstrlen);
break;
default:
break;
}
}
return d;
}
/*******************************
* Replace (e) with ((stmp = e),stmp)
*/
version (MARS)
{
@trusted
elem *exp2_copytotemp(elem *e)
{
//printf("exp2_copytotemp()\n");
elem_debug(e);
tym_t ty = tybasic(e.Ety);
type *t;
version (MARS)
{
if ((ty == TYstruct || ty == TYarray) && e.ET)
t = e.ET;
else
t = type_fake(ty);
}
else
t = type_fake(ty);
Symbol *stmp = symbol_genauto(t);
elem *eeq = el_bin(OPeq,e.Ety,el_var(stmp),e);
elem *er = el_bin(OPcomma,e.Ety,eeq,el_var(stmp));
if (ty == TYstruct || ty == TYarray)
{
eeq.Eoper = OPstreq;
eeq.ET = e.ET;
eeq.EV.E1.ET = e.ET;
er.ET = e.ET;
er.EV.E2.ET = e.ET;
}
return er;
}
}
/*************************
* Similar to el_copytree(e). But if e has any side effects, it's replaced
* with (tmp = e) and tmp is returned.
*/
@trusted
elem * el_same(elem **pe)
{
elem *e = *pe;
if (e && el_sideeffect(e))
{
*pe = exp2_copytotemp(e); /* convert to ((tmp=e),tmp) */
e = (*pe).EV.E2; /* point at tmp */
}
return el_copytree(e);
}
/*************************
* Thin wrapper of exp2_copytotemp. Different from el_same,
* always makes a temporary.
*/
@trusted
elem *el_copytotmp(elem **pe)
{
//printf("copytotemp()\n");
elem *e = *pe;
if (e)
{
*pe = exp2_copytotemp(e);
e = (*pe).EV.E2;
}
return el_copytree(e);
}
/**************************
* Replace symbol s1 with s2 in tree.
*/
version (SCPP_HTOD)
{
void el_replace_sym(elem *e,const Symbol *s1,Symbol *s2)
{
symbol_debug(s1);
symbol_debug(s2);
while (1)
{
elem_debug(e);
if (!OTleaf(e.Eoper))
{
if (OTbinary(e.Eoper))
el_replace_sym(e.EV.E2,s1,s2);
e = e.EV.E1;
}
else
{
switch (e.Eoper)
{
case OPvar:
case OPrelconst:
if (e.EV.Vsym == s1)
e.EV.Vsym = s2;
break;
default:
break;
}
break;
}
}
}
}
/*************************************
* Does symbol s appear in tree e?
* Returns:
* 1 yes
* 0 no
*/
@trusted
int el_appears(const(elem)* e, const Symbol *s)
{
symbol_debug(s);
while (1)
{
elem_debug(e);
if (!OTleaf(e.Eoper))
{
if (OTbinary(e.Eoper) && el_appears(e.EV.E2,s))
return 1;
e = e.EV.E1;
}
else
{
switch (e.Eoper)
{
case OPvar:
case OPrelconst:
if (e.EV.Vsym == s)
return 1;
break;
default:
break;
}
break;
}
}
return 0;
}
version (MARS)
{
/*****************************************
* Look for symbol that is a base of addressing mode e.
* Returns:
* s symbol used as base
* null couldn't find a base symbol
*/
static if (0)
{
Symbol *el_basesym(elem *e)
{
Symbol *s;
s = null;
while (1)
{
elem_debug(e);
switch (e.Eoper)
{
case OPvar:
s = e.EV.Vsym;
break;
case OPcomma:
e = e.EV.E2;
continue;
case OPind:
s = el_basesym(e.EV.E1);
break;
case OPadd:
s = el_basesym(e.EV.E1);
if (!s)
s = el_basesym(e.EV.E2);
break;
}
break;
}
return s;
}
}
/****************************************
* Does any definition of lvalue ed appear in e?
* Returns:
* true if there is one
*/
@trusted
bool el_anydef(const elem *ed, const(elem)* e)
{
const edop = ed.Eoper;
const s = (edop == OPvar) ? ed.EV.Vsym : null;
while (1)
{
const op = e.Eoper;
if (!OTleaf(op))
{
auto e1 = e.EV.E1;
if (OTdef(op))
{
if (e1.Eoper == OPvar && e1.EV.Vsym == s)
return true;
// This doesn't cover all the cases
if (e1.Eoper == edop && el_match(e1,ed))
return true;
}
if (OTbinary(op) && el_anydef(ed,e.EV.E2))
return true;
e = e1;
}
else
break;
}
return false;
}
}
/************************
* Make a binary operator node.
*/
@trusted
elem* el_bint(OPER op,type *t,elem *e1,elem *e2)
{
elem *e;
/* e2 is null when OPpostinc is built */
assert(op < OPMAX && OTbinary(op) && e1);
assert(PARSER);
e = el_calloc();
if (t)
{
e.ET = t;
type_debug(t);
e.ET.Tcount++;
}
e.Eoper = cast(ubyte)op;
elem_debug(e1);
if (e2)
elem_debug(e2);
e.EV.E1 = e1;
e.EV.E2 = e2;
return e;
}
@trusted
elem* el_bin(OPER op,tym_t ty,elem *e1,elem *e2)
{
static if (0)
{
if (!(op < OPMAX && OTbinary(op) && e1 && e2))
*cast(char *)0=0;
}
assert(op < OPMAX && OTbinary(op) && e1 && e2);
version (MARS) { } else assert(!PARSER);
elem_debug(e1);
elem_debug(e2);
elem* e = el_calloc();
e.Ety = ty;
e.Eoper = cast(ubyte)op;
e.EV.E1 = e1;
e.EV.E2 = e2;
if (op == OPcomma && tyaggregate(ty))
e.ET = e2.ET;
return e;
}
/************************
* Make a unary operator node.
*/
@trusted
elem* el_unat(OPER op,type *t,elem *e1)
{
debug if (!(op < OPMAX && OTunary(op) && e1))
printf("op = x%x, e1 = %p\n",op,e1);
assert(op < OPMAX && OTunary(op) && e1);
assert(PARSER);
elem_debug(e1);
elem* e = el_calloc();
e.Eoper = cast(ubyte)op;