Merge from default.
This commit is contained in:
commit
232545606d
|
@ -26,6 +26,13 @@ echo "$(echo "$timedout" | wc -w) timed out"
|
|||
echo "$(echo "$failed" | wc -w) failed"
|
||||
echo ""
|
||||
|
||||
if [ "$failed" != "" ]; then
|
||||
echo "Failing test logs:"
|
||||
for t in $failed; do
|
||||
echo $t
|
||||
done
|
||||
exit 1
|
||||
fi
|
||||
if [ "$failed" != "" -o "$timedout" != "" ]; then
|
||||
echo "Test status: SAD FACE (tests are failing)"
|
||||
exit 1
|
||||
|
|
|
@ -168,10 +168,6 @@ register int delim;
|
|||
str->s_str = p = Malloc((unsigned int) ISTRSIZE);
|
||||
for( ; ; ) {
|
||||
LoadChar(ch);
|
||||
if( ch & 0200 ) {
|
||||
fatal("non-ascii '\\%03o' read", ch & 0377);
|
||||
/*NOTREACHED*/
|
||||
}
|
||||
if( class(ch) == STNL ) {
|
||||
lexerror("newline in string");
|
||||
LineNumber++;
|
||||
|
@ -310,11 +306,6 @@ again:
|
|||
LoadChar(ch);
|
||||
if( !options['C'] ) /* -C : cases are different */
|
||||
TO_LOWER(ch);
|
||||
|
||||
if( (ch & 0200) && ch != EOI ) {
|
||||
fatal("non-ascii '\\%03o' read", ch & 0377);
|
||||
/*NOTREACHED*/
|
||||
}
|
||||
}
|
||||
|
||||
switch( class(ch) ) {
|
||||
|
|
|
@ -94,7 +94,7 @@ InitTypes()
|
|||
/* character type
|
||||
*/
|
||||
char_type = standard_type(T_CHAR, 1, (arith) 1);
|
||||
char_type->enm_ncst = 128; /* only 7 bits ASCII characters */
|
||||
char_type->enm_ncst = 256; /* all bytes */
|
||||
|
||||
/* boolean type
|
||||
*/
|
||||
|
|
|
@ -185,7 +185,7 @@ name b
|
|||
to .k
|
||||
program {EM}/lib/ack/em_b
|
||||
mapflag -B* ABC_F={ABC_F?} -B*
|
||||
args -i < -o > -w {p} {ABC_F}
|
||||
args -i < -o > -w {p} {ABC_F?}
|
||||
prep cond
|
||||
rts .b
|
||||
need .b
|
||||
|
|
|
@ -3,11 +3,13 @@
|
|||
.sect .text
|
||||
|
||||
! Set intersection.
|
||||
! Stack: ( b a -- a*b )
|
||||
! With r3 = size of set
|
||||
! Stack: ( b a size -- a*b )
|
||||
|
||||
.define .and
|
||||
.and:
|
||||
lwz r3, 0 (sp) ! r3 = size
|
||||
addi sp, sp, 4
|
||||
|
||||
mr r4, sp ! r4 = ptr to set a
|
||||
add r5, sp, r3 ! r5 = ptr to set b
|
||||
rlwinm r6, r3, 30, 2, 31
|
||||
|
|
|
@ -3,11 +3,13 @@
|
|||
.sect .text
|
||||
|
||||
! Set complement.
|
||||
! Stack: ( a -- ~a )
|
||||
! With r3 = size of set
|
||||
! Stack: ( a size -- ~a )
|
||||
|
||||
.define .com
|
||||
.com:
|
||||
lwz r3, 0 (sp) ! size
|
||||
addi sp, sp, 4
|
||||
|
||||
mr r4, sp ! r4 = pointer to set a
|
||||
rlwinm r5, r3, 30, 2, 31
|
||||
mtspr ctr, r5 ! ctr = r3 / 4
|
||||
|
|
|
@ -3,11 +3,13 @@
|
|||
.sect .text
|
||||
|
||||
! Set union.
|
||||
! Stack: ( b a -- a+b )
|
||||
! With r3 = size of set
|
||||
! Stack: ( b a size -- a+b )
|
||||
|
||||
.define .ior
|
||||
.ior:
|
||||
lwz r3, 0 (sp)
|
||||
addi sp, sp, 4
|
||||
|
||||
mr r4, sp ! r4 = ptr to set a
|
||||
add r5, sp, r3 ! r5 = ptr to set b
|
||||
rlwinm r6, r3, 30, 2, 31
|
||||
|
|
22
mach/powerpc/libem/rck.s
Normal file
22
mach/powerpc/libem/rck.s
Normal file
|
@ -0,0 +1,22 @@
|
|||
#include "powerpc.h"
|
||||
|
||||
.sect .text
|
||||
|
||||
! Bounds check. Traps if the value is out of range.
|
||||
! Stack: ( value descriptor -- value )
|
||||
|
||||
.define .rck
|
||||
.rck:
|
||||
lwz r3, 0 (sp)
|
||||
lwz r4, 4 (sp)
|
||||
addi sp, sp, 4 ! leave value on stack
|
||||
|
||||
lwz r5, 0 (r3)
|
||||
cmp cr0, 0, r4, r5
|
||||
bc IFTRUE, LT, .trap_erange
|
||||
|
||||
lwz r5, 4 (r3)
|
||||
cmp cr0, 0, r4, r5
|
||||
bc IFTRUE, GT, .trap_erange
|
||||
|
||||
bclr ALWAYS, 0, 0
|
|
@ -3,11 +3,14 @@
|
|||
.sect .text
|
||||
|
||||
! Create singleton set.
|
||||
! Stack: ( -- set )
|
||||
! With r3 = size of set, r4 = bit number
|
||||
! Stack: ( bitnumber size -- set )
|
||||
|
||||
.define .set
|
||||
.set:
|
||||
lwz r3, 0 (sp)
|
||||
lwz r4, 4 (sp)
|
||||
addi sp, sp, 8
|
||||
|
||||
rlwinm r7, r3, 30, 2, 31
|
||||
neg r5, r3
|
||||
add sp, sp, r5 ! allocate set
|
||||
|
|
|
@ -3,11 +3,13 @@
|
|||
.sect .text
|
||||
|
||||
! Create empty set.
|
||||
! Stack: ( -- set )
|
||||
! With r3 = size of set
|
||||
! Stack: ( size -- set )
|
||||
|
||||
.define .zer
|
||||
.zer:
|
||||
lwz r3, 0(sp)
|
||||
addi sp, sp, 4
|
||||
|
||||
rlwinm r7, r3, 30, 2, 31
|
||||
addi r4, r0, 0 ! r4 = zero
|
||||
neg r5, r3
|
||||
|
|
|
@ -1476,11 +1476,13 @@ PATTERNS
|
|||
yields %a
|
||||
|
||||
pat and defined($1) /* AND set */
|
||||
with STACK
|
||||
kills ALL
|
||||
gen
|
||||
move {CONST, $1}, R3
|
||||
bl {LABEL, ".and"}
|
||||
leaving
|
||||
loc $1
|
||||
cal ".and"
|
||||
|
||||
pat and !defined($1)
|
||||
leaving
|
||||
cal ".and"
|
||||
|
||||
pat ior $1==4 /* OR word */
|
||||
with REG NOT_R
|
||||
|
@ -1513,18 +1515,14 @@ PATTERNS
|
|||
yields {OR_RC, %2, lo(%1.val)}
|
||||
|
||||
pat ior defined($1) /* OR set */
|
||||
with STACK
|
||||
kills ALL
|
||||
gen
|
||||
move {CONST, $1}, R3
|
||||
bl {LABEL, ".ior"}
|
||||
leaving
|
||||
loc $1
|
||||
cal ".ior"
|
||||
|
||||
/* OR set (variable), used in lang/m2/libm2/LtoUset.e */
|
||||
pat ior !defined($1)
|
||||
with GPR3 STACK
|
||||
kills ALL
|
||||
gen
|
||||
bl {LABEL, ".ior"}
|
||||
leaving
|
||||
cal ".ior"
|
||||
|
||||
pat xor $1==4 /* XOR word */
|
||||
with REG REG
|
||||
|
@ -1573,21 +1571,22 @@ PATTERNS
|
|||
yields {NOT_R, %1}
|
||||
|
||||
pat com defined($1) /* NOT set */
|
||||
with STACK
|
||||
gen
|
||||
move {CONST, $1}, R3
|
||||
bl {LABEL, ".com"}
|
||||
leaving
|
||||
loc $1
|
||||
cal ".com"
|
||||
|
||||
pat com !defined($1)
|
||||
leaving
|
||||
cal ".com"
|
||||
|
||||
pat zer $1==4 /* Push zero */
|
||||
leaving
|
||||
loc 0
|
||||
|
||||
pat zer defined($1) /* Create empty set */
|
||||
with STACK
|
||||
kills ALL
|
||||
gen
|
||||
move {CONST, $1}, R3
|
||||
bl {LABEL, ".zer"}
|
||||
pat zer defined($1) /* Create empty set */
|
||||
leaving
|
||||
loc $1
|
||||
cal ".zer"
|
||||
|
||||
pat sli $1==4 /* Shift left (second << top) */
|
||||
with CONST_ALL GPR
|
||||
|
@ -1665,27 +1664,23 @@ PATTERNS
|
|||
/* Sets */
|
||||
|
||||
pat set defined($1) /* Create singleton set */
|
||||
with GPR4 STACK
|
||||
kills ALL
|
||||
gen
|
||||
move {CONST, $1}, R3
|
||||
bl {LABEL, ".set"}
|
||||
leaving
|
||||
loc $1
|
||||
cal ".set"
|
||||
|
||||
/* Create set (variable), used in lang/m2/libm2/LtoUset.e */
|
||||
pat set !defined($1)
|
||||
with GPR3 GPR4 STACK
|
||||
kills ALL
|
||||
gen
|
||||
bl {LABEL, ".set"}
|
||||
leaving
|
||||
cal ".set"
|
||||
|
||||
pat inn defined($1) /* Test for set bit */
|
||||
with STACK
|
||||
kills ALL
|
||||
uses REG
|
||||
gen
|
||||
li32 %a, {CONST, $1}
|
||||
stwu %a, {GPRINDIRECT, SP, 0-4}
|
||||
bl {LABEL, ".inn"}
|
||||
leaving
|
||||
loc $1
|
||||
cal ".inn"
|
||||
|
||||
pat inn !defined($1)
|
||||
leaving
|
||||
cal ".inn"
|
||||
|
||||
|
||||
/* Boolean resolutions */
|
||||
|
@ -2076,6 +2071,17 @@ PATTERNS
|
|||
loc $1
|
||||
ass 4
|
||||
|
||||
pat lae rck $2==4 /* Range check */
|
||||
with REG
|
||||
uses CR0
|
||||
gen
|
||||
cmpli %a, {CONST, 0}, %1, {CONST, rom($1, 1)}
|
||||
bc IFTRUE, LT, {LABEL, ".trap_erange"}
|
||||
cmpli %a, {CONST, 0}, %1, {CONST, rom($1, 2)}
|
||||
bc IFTRUE, GT, {LABEL, ".trap_erange"}
|
||||
yields %1
|
||||
|
||||
|
||||
|
||||
|
||||
/* Floating point support */
|
||||
|
|
|
@ -519,7 +519,19 @@ static void insn_simple(int opcode)
|
|||
}
|
||||
|
||||
case op_trp: helper_function(".trp"); break;
|
||||
case op_sig: helper_function(".sig"); break;
|
||||
|
||||
case op_sig:
|
||||
{
|
||||
struct ir* value = pop(EM_pointersize);
|
||||
appendir(
|
||||
store(
|
||||
EM_pointersize,
|
||||
new_labelir(".trppc"), 0,
|
||||
value
|
||||
)
|
||||
);
|
||||
break;
|
||||
}
|
||||
|
||||
case op_rtt:
|
||||
{
|
||||
|
@ -528,10 +540,12 @@ static void insn_simple(int opcode)
|
|||
}
|
||||
|
||||
/* FIXME: These instructions are really complex and barely used
|
||||
* (Modula-2 bitset support, I believe). Leave them until later. */
|
||||
* (Modula-2 and Pascal set support, I believe). Leave them until
|
||||
* later. */
|
||||
case op_set: helper_function(".unimplemented_set"); break;
|
||||
case op_ior: helper_function(".unimplemented_ior"); break;
|
||||
|
||||
|
||||
case op_dch:
|
||||
push(
|
||||
new_ir1(
|
||||
|
@ -607,29 +621,53 @@ static void insn_bvalue(int opcode, struct basicblock* leftbb, struct basicblock
|
|||
}
|
||||
}
|
||||
|
||||
static void simple_alu1(int opcode, int size, int irop)
|
||||
static void simple_alu1(int opcode, int size, int irop, const char* fallback)
|
||||
{
|
||||
struct ir* val = pop(size);
|
||||
if (size > (2*EM_wordsize))
|
||||
{
|
||||
if (!fallback)
|
||||
fatal("treebuilder: can't do opcode %s with size %d", em_mnem[opcode - sp_fmnem], size);
|
||||
push(
|
||||
new_wordir(size)
|
||||
);
|
||||
helper_function(fallback);
|
||||
}
|
||||
else
|
||||
{
|
||||
struct ir* val = pop(size);
|
||||
|
||||
push(
|
||||
new_ir1(
|
||||
irop, size,
|
||||
val
|
||||
)
|
||||
);
|
||||
push(
|
||||
new_ir1(
|
||||
irop, size,
|
||||
val
|
||||
)
|
||||
);
|
||||
}
|
||||
}
|
||||
|
||||
static void simple_alu2(int opcode, int size, int irop)
|
||||
static void simple_alu2(int opcode, int size, int irop, const char* fallback)
|
||||
{
|
||||
struct ir* right = pop(size);
|
||||
struct ir* left = pop(size);
|
||||
if (size > (2*EM_wordsize))
|
||||
{
|
||||
if (!fallback)
|
||||
fatal("treebuilder: can't do opcode %s with size %d", em_mnem[opcode - sp_fmnem], size);
|
||||
push(
|
||||
new_wordir(size)
|
||||
);
|
||||
helper_function(fallback);
|
||||
}
|
||||
else
|
||||
{
|
||||
struct ir* right = pop(size);
|
||||
struct ir* left = pop(size);
|
||||
|
||||
push(
|
||||
new_ir2(
|
||||
irop, size,
|
||||
left, right
|
||||
)
|
||||
);
|
||||
push(
|
||||
new_ir2(
|
||||
irop, size,
|
||||
left, right
|
||||
)
|
||||
);
|
||||
}
|
||||
}
|
||||
|
||||
static struct ir* extract_block_refs(struct basicblock* bb)
|
||||
|
@ -708,39 +746,43 @@ static void insn_ivalue(int opcode, arith value)
|
|||
{
|
||||
switch (opcode)
|
||||
{
|
||||
case op_adi: simple_alu2(opcode, value, IR_ADD); break;
|
||||
case op_sbi: simple_alu2(opcode, value, IR_SUB); break;
|
||||
case op_mli: simple_alu2(opcode, value, IR_MUL); break;
|
||||
case op_dvi: simple_alu2(opcode, value, IR_DIV); break;
|
||||
case op_rmi: simple_alu2(opcode, value, IR_MOD); break;
|
||||
case op_sli: simple_alu2(opcode, value, IR_ASL); break;
|
||||
case op_sri: simple_alu2(opcode, value, IR_ASR); break;
|
||||
case op_ngi: simple_alu1(opcode, value, IR_NEG); break;
|
||||
case op_adi: simple_alu2(opcode, value, IR_ADD, NULL); break;
|
||||
case op_sbi: simple_alu2(opcode, value, IR_SUB, NULL); break;
|
||||
case op_mli: simple_alu2(opcode, value, IR_MUL, NULL); break;
|
||||
case op_dvi: simple_alu2(opcode, value, IR_DIV, NULL); break;
|
||||
case op_rmi: simple_alu2(opcode, value, IR_MOD, NULL); break;
|
||||
case op_sli: simple_alu2(opcode, value, IR_ASL, NULL); break;
|
||||
case op_sri: simple_alu2(opcode, value, IR_ASR, NULL); break;
|
||||
case op_ngi: simple_alu1(opcode, value, IR_NEG, NULL); break;
|
||||
|
||||
case op_adu: simple_alu2(opcode, value, IR_ADD); break;
|
||||
case op_sbu: simple_alu2(opcode, value, IR_SUB); break;
|
||||
case op_mlu: simple_alu2(opcode, value, IR_MUL); break;
|
||||
case op_slu: simple_alu2(opcode, value, IR_LSL); break;
|
||||
case op_sru: simple_alu2(opcode, value, IR_LSR); break;
|
||||
case op_rmu: simple_alu2(opcode, value, IR_MODU); break;
|
||||
case op_dvu: simple_alu2(opcode, value, IR_DIVU); break;
|
||||
case op_adu: simple_alu2(opcode, value, IR_ADD, NULL); break;
|
||||
case op_sbu: simple_alu2(opcode, value, IR_SUB, NULL); break;
|
||||
case op_mlu: simple_alu2(opcode, value, IR_MUL, NULL); break;
|
||||
case op_slu: simple_alu2(opcode, value, IR_LSL, NULL); break;
|
||||
case op_sru: simple_alu2(opcode, value, IR_LSR, NULL); break;
|
||||
case op_rmu: simple_alu2(opcode, value, IR_MODU, NULL); break;
|
||||
case op_dvu: simple_alu2(opcode, value, IR_DIVU, NULL); break;
|
||||
|
||||
case op_and: simple_alu2(opcode, value, IR_AND); break;
|
||||
case op_ior: simple_alu2(opcode, value, IR_OR); break;
|
||||
case op_xor: simple_alu2(opcode, value, IR_EOR); break;
|
||||
case op_com: simple_alu1(opcode, value, IR_NOT); break;
|
||||
case op_and: simple_alu2(opcode, value, IR_AND, ".and"); break;
|
||||
case op_ior: simple_alu2(opcode, value, IR_OR, ".ior"); break;
|
||||
case op_xor: simple_alu2(opcode, value, IR_EOR, NULL); break;
|
||||
case op_com: simple_alu1(opcode, value, IR_NOT, ".com"); break;
|
||||
|
||||
case op_adf: simple_alu2(opcode, value, IR_ADDF); break;
|
||||
case op_sbf: simple_alu2(opcode, value, IR_SUBF); break;
|
||||
case op_mlf: simple_alu2(opcode, value, IR_MULF); break;
|
||||
case op_dvf: simple_alu2(opcode, value, IR_DIVF); break;
|
||||
case op_ngf: simple_alu1(opcode, value, IR_NEGF); break;
|
||||
case op_adf: simple_alu2(opcode, value, IR_ADDF, NULL); break;
|
||||
case op_sbf: simple_alu2(opcode, value, IR_SUBF, NULL); break;
|
||||
case op_mlf: simple_alu2(opcode, value, IR_MULF, NULL); break;
|
||||
case op_dvf: simple_alu2(opcode, value, IR_DIVF, NULL); break;
|
||||
case op_ngf: simple_alu1(opcode, value, IR_NEGF, NULL); break;
|
||||
|
||||
case op_cmu: /* fall through */
|
||||
case op_cms: push(tristate_compare(value, IR_COMPAREUI)); break;
|
||||
case op_cmi: push(tristate_compare(value, IR_COMPARESI)); break;
|
||||
case op_cmf: push(tristate_compare(value, IR_COMPAREF)); break;
|
||||
|
||||
case op_rck: helper_function(".rck"); break;
|
||||
case op_set: push(new_wordir(value)); helper_function(".set"); break;
|
||||
case op_inn: push(new_wordir(value)); helper_function(".inn"); break;
|
||||
|
||||
case op_lol:
|
||||
push(
|
||||
load(
|
||||
|
@ -1084,6 +1126,18 @@ static void insn_ivalue(int opcode, arith value)
|
|||
break;
|
||||
}
|
||||
|
||||
case op_zer:
|
||||
{
|
||||
if (value <= EM_wordsize)
|
||||
push(new_constir(value, 0));
|
||||
else
|
||||
{
|
||||
push(new_wordir(value));
|
||||
helper_function(".zer");
|
||||
}
|
||||
break;
|
||||
}
|
||||
|
||||
case op_asp:
|
||||
{
|
||||
switch (value)
|
||||
|
@ -1108,15 +1162,12 @@ static void insn_ivalue(int opcode, arith value)
|
|||
value -= s;
|
||||
}
|
||||
|
||||
if (value != 0)
|
||||
{
|
||||
appendir(
|
||||
new_ir1(
|
||||
IR_STACKADJUST, EM_pointersize,
|
||||
new_wordir(value)
|
||||
)
|
||||
);
|
||||
}
|
||||
appendir(
|
||||
new_ir1(
|
||||
IR_STACKADJUST, EM_pointersize,
|
||||
new_wordir(value)
|
||||
)
|
||||
);
|
||||
break;
|
||||
}
|
||||
break;
|
||||
|
@ -1492,18 +1543,6 @@ static void insn_ivalue(int opcode, arith value)
|
|||
break;
|
||||
}
|
||||
|
||||
/* FIXME: These instructions are really complex and barely used
|
||||
* (Modula-2 bitset support, I believe). Leave them until leter. */
|
||||
case op_inn:
|
||||
{
|
||||
push(
|
||||
new_wordir(value)
|
||||
);
|
||||
|
||||
helper_function(".inn");
|
||||
break;
|
||||
}
|
||||
|
||||
case op_lin:
|
||||
{
|
||||
/* Set line number --- ignore. */
|
||||
|
|
File diff suppressed because it is too large
Load diff
|
@ -37,7 +37,7 @@ void chkstr();
|
|||
string myalloc(size) {
|
||||
register string p;
|
||||
|
||||
p = (string) malloc((unsigned)size);
|
||||
p = (string) calloc((unsigned)size, 1);
|
||||
if (p==0)
|
||||
fatal("Out of memory");
|
||||
return(p);
|
||||
|
|
|
@ -58,7 +58,14 @@ EUNIMPL = 63 ! unimplemented em-instruction called
|
|||
addi r3, r0, EARRAY
|
||||
b .trap
|
||||
|
||||
.define .trap_erange
|
||||
.trap_erange:
|
||||
addi r3, r0, ERANGE
|
||||
b .trap
|
||||
|
||||
.define .trp
|
||||
.define .trap
|
||||
.trp:
|
||||
.trap:
|
||||
cmpi cr0, 0, r3, 15 ! traps >15 can't be ignored
|
||||
bc IFTRUE, LT, 1f
|
||||
|
|
|
@ -54,16 +54,12 @@ EUNIMPL = 63 ! unimplemented em-instruction called
|
|||
.trap_earray:
|
||||
b .trp
|
||||
|
||||
.define .trap_erange
|
||||
.trap_erange:
|
||||
b .trap
|
||||
|
||||
.define .trp
|
||||
.define .trap
|
||||
.trp:
|
||||
.trap:
|
||||
b .trp ! spin forever
|
||||
|
||||
.define .sig
|
||||
.sig:
|
||||
lwz r3, 0(sp)
|
||||
li32 r4, .trppc
|
||||
stw r3, 0(r4)
|
||||
bclr ALWAYS, 0, 0 ! return
|
||||
|
37
tests/plat/pascalsets_p.p
Normal file
37
tests/plat/pascalsets_p.p
Normal file
|
@ -0,0 +1,37 @@
|
|||
#
|
||||
(*$U+ -- enables underscores in identifiers *)
|
||||
|
||||
program pascalsets;
|
||||
|
||||
type
|
||||
charset = set of char;
|
||||
|
||||
var
|
||||
s : charset;
|
||||
i : integer;
|
||||
|
||||
procedure finished;
|
||||
extern;
|
||||
|
||||
procedure fail(line: integer);
|
||||
extern;
|
||||
|
||||
#define ASSERT(cond) \
|
||||
if (not (cond)) then fail(__LINE__)
|
||||
|
||||
begin
|
||||
s := [];
|
||||
for i := 0 to 255 do
|
||||
s := s + [chr(i)];
|
||||
|
||||
i := 99; (* to defeat optimisation *)
|
||||
ASSERT(chr(42) in s);
|
||||
ASSERT(chr(142) in s);
|
||||
ASSERT(chr(i) in s);
|
||||
s := s - [chr(42)];
|
||||
ASSERT(not(chr(42) in s));
|
||||
ASSERT(chr(142) in s);
|
||||
ASSERT(chr(i) in s);
|
||||
|
||||
finished
|
||||
end.
|
Loading…
Reference in a new issue