|
0
|
1 |
# %W% %E%
|
|
|
2 |
|
|
|
3 |
# -------------- no need to change anything below ----------
|
|
|
4 |
|
|
22
|
5 |
TOP=..
|
|
|
6 |
SUBDIRS=
|
|
|
7 |
|
|
0
|
8 |
LIBNAME=libcomp
|
|
|
9 |
LIB=libcomp.$(A)
|
|
|
10 |
|
|
8
|
11 |
STCOPT=$(LIBCOMP_STCOPT)
|
|
|
12 |
|
|
0
|
13 |
all:: $(OBJTARGET)
|
|
|
14 |
|
|
22
|
15 |
objs:: \
|
|
0
|
16 |
Scanner.o \
|
|
22
|
17 |
Parser.o \
|
|
|
18 |
BCompiler.o \
|
|
|
19 |
Explainer.o \
|
|
0
|
20 |
Variable.o \
|
|
|
21 |
ParseNode.o \
|
|
|
22 |
PrimaryNd.o \
|
|
22
|
23 |
VarNode.o \
|
|
|
24 |
SelfNode.o \
|
|
|
25 |
SuperNode.o \
|
|
|
26 |
ConstNode.o \
|
|
0
|
27 |
StatNode.o \
|
|
22
|
28 |
RetNode.o \
|
|
|
29 |
PrimNd.o \
|
|
0
|
30 |
AssignNd.o \
|
|
|
31 |
BlockNode.o \
|
|
22
|
32 |
MessageNd.o \
|
|
0
|
33 |
UnaryNd.o \
|
|
|
34 |
BinaryNd.o \
|
|
|
35 |
CascadeNd.o \
|
|
22
|
36 |
UndefVar.o \
|
|
|
37 |
LazyMethod.o \
|
|
|
38 |
$(EXTRA_LIBCOMP)
|
|
0
|
39 |
|
|
22
|
40 |
auxobjs::
|
|
16
|
41 |
|
|
|
42 |
# only needed for NeXT - assembler dumps core with long name ?!?!
|
|
|
43 |
#
|
|
|
44 |
VarNode.$(O):
|
|
|
45 |
$(STC) -CC="$(CC)" $(STCFLAGS) +shortNames $(CFLAGS) -c $*.st
|
|
|
46 |
|
|
3
|
47 |
install::
|
|
|
48 |
-mkdir $(DESTLIBDIR)
|
|
|
49 |
-$(INSTALL) $(LIBNAME)$(OBJNAME) $(DESTLIBDIR)
|
|
0
|
50 |
|
|
3
|
51 |
qinstall::
|
|
0
|
52 |
-mkdir $(DESTLIBDIR)
|
|
|
53 |
-$(INSTALL) $(LIBNAME)$(OBJNAME) $(DESTLIBDIR)
|
|
|
54 |
|
|
|
55 |
libe: $(LIB)
|
|
|
56 |
|
|
|
57 |
objs:: $(INCLUDE)/stc.h $(INCLUDE)/stcIntern.h
|
|
|
58 |
|
|
|
59 |
cleanjunk::
|
|
|
60 |
-rm -f *.c *.H
|
|
|
61 |
|
|
|
62 |
clean::
|
|
|
63 |
-rm -f *.c *.H
|
|
|
64 |
|
|
|
65 |
clobber::
|
|
|
66 |
-rm -f *.c *.H
|
|
|
67 |
|
|
|
68 |
tar:
|
|
|
69 |
rm -f $(TOP)/DISTRIB/libcomp.tar*
|
|
|
70 |
(cd $(TOP); tar cvf DISTRIB/libcomp.tar \
|
|
|
71 |
libcomp/*.st \
|
|
|
72 |
libcomp/Make.proto \
|
|
|
73 |
libcomp/*.stc)
|
|
|
74 |
compress $(TOP)/DISTRIB/libcomp.tar
|
|
|
75 |
|
|
|
76 |
#
|
|
|
77 |
# next thing I'll build into stc is a makedepend feature for this ...
|
|
|
78 |
#
|
|
|
79 |
|
|
22
|
80 |
I = $(INCLUDE)
|
|
|
81 |
|
|
0
|
82 |
STCHDR=$(I)/stc.h $(I)/stcIntern.h
|
|
|
83 |
OBJECT=$(I)/Object.H $(STCHDR)
|
|
|
84 |
SCANNER=$(I)/Scanner.H $(OBJECT)
|
|
|
85 |
PARSER=$(I)/Parser.H $(SCANNER)
|
|
|
86 |
PARSENODE=$(I)/ParseNode.H $(OBJECT)
|
|
|
87 |
PRIMARYNODE=$(I)/PrimaryNd.H $(PARSENODE)
|
|
|
88 |
MESSAGENODE=$(I)/MessageNd.H $(PARSENODE)
|
|
|
89 |
|
|
|
90 |
ObjFLoader.o: ObjFLoader.st $(OBJECT)
|
|
22
|
91 |
LazyMethod.o: LazyMethod.st $(OBJECT) $(I)/Method.H
|
|
0
|
92 |
UndefVar.o: UndefVar.st $(OBJECT)
|
|
3
|
93 |
Scanner.o: Scanner.st $(OBJECT)
|
|
0
|
94 |
Parser.o: Parser.st $(SCANNER)
|
|
|
95 |
BCompiler.o: BCompiler.st $(PARSER)
|
|
|
96 |
Variable.o: Variable.st $(OBJECT)
|
|
|
97 |
ParseNode.o: ParseNode.st $(OBJECT)
|
|
|
98 |
StatNode.o: StatNode.st $(PARSENODE)
|
|
|
99 |
AssignNd.o: AssignNd.st $(PARSENODE)
|
|
|
100 |
BlockNode.o: BlockNode.st $(PARSENODE)
|
|
|
101 |
PrimaryNd.o: PrimaryNd.st $(PARSENODE)
|
|
16
|
102 |
VarNode.o: VarNode.st $(PRIMARYNODE)
|
|
13
|
103 |
SelfNode.o: SelfNode.st $(PRIMARYNODE)
|
|
0
|
104 |
ConstNode.o: ConstNode.st $(PRIMARYNODE)
|
|
13
|
105 |
VariableNode.o: VariableNode.st $(PRIMARYNODE)
|
|
|
106 |
SuperNode.o: SuperNode.st $(I)/SelfNode.H $(PRIMARYNODE)
|
|
0
|
107 |
MessageNd.o: MessageNd.st $(PARSENODE)
|
|
|
108 |
CascadeNd.o: CascadeNd.st $(MESSAGENODE)
|
|
|
109 |
BinaryNd.o: BinaryNd.st $(MESSAGENODE)
|
|
|
110 |
UnaryNd.o: UnaryNd.st $(MESSAGENODE)
|
|
22
|
111 |
PrimNd.o: PrimNd.st $(PARSENODE) $(I)/StatNode.H
|
|
|
112 |
RetNode.o: RetNode.st $(PARSENODE) $(I)/StatNode.H
|
|
0
|
113 |
|
|
|
114 |
CMethod.o: CMethod.st $(I)/Method.H $(OBJECT)
|
|
|
115 |
MCompiler.o: MCompiler.st $(PARSER)
|
|
3
|
116 |
Explainer.o: Explainer.st $(PARSER)
|