Debian Codegraph @

gcc/testsuite/gm2/iso/run/pass/lazyunique.mod

raw
1 MODULE lazyunique ; (*!m2iso+gm2*)
2
3 FROM Storage IMPORT ALLOCATE ;
4 FROM libc IMPORT printf, exit ;
5
6 TYPE
7 List = POINTER TO RECORD
8 next : List ;
9 value: INTEGER ;
10 END ;
11
12 Array = ARRAY [0..3] OF INTEGER ;
13
14 CONST
15 Unsorted = Array {0, 2, 1, 1} ;
16
17 VAR
18 head: List ;
19
20
21 PROCEDURE Display ;
22 VAR
23 p: List ;
24 BEGIN
25 p := head^.next ;
26 printf ("\nunique data\n");
27 printf ("===========\n");
28 WHILE p # NIL DO
29 printf ("%d\n", p^.value);
30 p := p^.next
31 END
32 END Display ;
33
34
35 PROCEDURE Add (VAR p: List; val: INTEGER) ;
36 BEGIN
37 NEW (p) ;
38 WITH p^ DO
39 value := val ;
40 next := NIL
41 END
42 END Add ;
43
44
45 PROCEDURE Unique (val: INTEGER) ;
46 VAR
47 p: List ;
48 BEGIN
49 printf ("new value %d\n", val);
50 p := head ;
51 (* The following line may cause an exception accessing next or value. *)
52 WHILE p^.next^.value # val DO
53 p := p^.next
54 END
55 EXCEPT
56 (* Now fixup. Determine the source of the exception and retry. *)
57 IF head = NIL
58 THEN
59 printf ("list was empty, add sentinal\n");
60 Add (head, -1) ;
61 RETRY (* Jump back to the begin statement. *)
62 ELSIF p^.next = NIL
63 THEN
64 printf ("growing the list\n");
65 Add (p^.next, val) ;
66 RETRY (* Jump back to the begin statement. *)
67 ELSE
68 printf ("should never reach here!\n");
69 END
70 END Unique ;
71
72
73 PROCEDURE unique ;
74 VAR
75 i: CARDINAL ;
76 BEGIN
77 FOR i := 0 TO HIGH (Unsorted) DO
78 Unique (Unsorted[i])
79 END ;
80 Display
81 END unique ;
82
83
84 BEGIN
85 head := NIL ;
86 unique
87 END lazyunique.