|
|
1.1 root 1: #
2: # Copyright (c) 1987 Regents of the University of California.
3: # All rights reserved. The Berkeley software License Agreement
4: # specifies the terms and conditions for redistribution.
5: #
6: # @(#)Makefile 5.2 (Berkeley) 6/19/87
7: #
8: CFLAGS= -DTRACE -O
9: SRCS= agoto.c aminmax.c aon.c areaclear.c beep.c bitcopy.c cleara.c \
10: clearg.c curon.c dispmsg.c draw.c drawbox.c dumpmat.c \
11: emptyrow.c error.c escseq.c gdefault.c gon.c kon.c line.c mat.c \
12: message.c minmax.c motion.c move.c movecurs.c newmat.c outchar.c \
13: outstr.c printg.c rawchar.c rbon.c rdchar.c readline.c set.c \
14: setmat.c sync.c texton.c ttyinit.c update.c video.c zermat.c \
15: zoomn.c zoomon.c zoomout.c
16: OBJS= agoto.o aminmax.o aon.o areaclear.o beep.o bitcopy.o cleara.o \
17: clearg.o curon.o dispmsg.o draw.o drawbox.o dumpmat.o \
18: emptyrow.o error.o escseq.o gdefault.o gon.o kon.o line.o mat.o \
19: message.o minmax.o motion.o move.o movecurs.o newmat.o outchar.o \
20: outstr.o printg.o rawchar.o rbon.o rdchar.o readline.o set.o \
21: setmat.o sync.o texton.o ttyinit.o update.o video.o zermat.o \
22: zoomn.o zoomon.o zoomout.o
23:
24: all: lib2648.a
25:
26: lib2648.a: ${OBJS}
27: ar cr lib2648.a `lorder ${OBJS} | tsort`
28:
29: clean: FRC
30: rm -f ${OBJS} core lib2648.a
31:
32: depend: FRC
33: mkdep ${CFLAGS} ${SRCS}
34:
35: install: FRC
36: install -o bin -g bin -m 644 lib2648.a ${DESTDIR}/usr/lib/lib2648.a
37: ranlib ${DESTDIR}/usr/lib/lib2648.a
38:
39: lint: FRC
40: lint ${CFLAGS} ${SRCS}
41:
42: tags: FRC
43: ctags ${SRCS}
44:
45: FRC:
46:
47: # DO NOT DELETE THIS LINE -- mkdep uses it.
48: # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY.
49:
50: agoto.o: agoto.c 2648.h /usr/include/stdio.h
51: aminmax.o: aminmax.c bit.h /usr/include/stdio.h
52: aon.o: aon.c 2648.h /usr/include/stdio.h
53: areaclear.o: areaclear.c 2648.h /usr/include/stdio.h
54: beep.o: beep.c 2648.h /usr/include/stdio.h
55: bitcopy.o: bitcopy.c bit.h /usr/include/stdio.h
56: cleara.o: cleara.c 2648.h /usr/include/stdio.h
57: clearg.o: clearg.c 2648.h /usr/include/stdio.h
58: curon.o: curon.c 2648.h /usr/include/stdio.h
59: dispmsg.o: dispmsg.c 2648.h /usr/include/stdio.h
60: draw.o: draw.c 2648.h /usr/include/stdio.h
61: drawbox.o: drawbox.c 2648.h /usr/include/stdio.h
62: dumpmat.o: dumpmat.c bit.h /usr/include/stdio.h
63: emptyrow.o: emptyrow.c bit.h /usr/include/stdio.h
64: error.o: error.c
65: escseq.o: escseq.c 2648.h /usr/include/stdio.h
66: gdefault.o: gdefault.c 2648.h /usr/include/stdio.h
67: gon.o: gon.c 2648.h /usr/include/stdio.h
68: kon.o: kon.c 2648.h /usr/include/stdio.h
69: line.o: line.c 2648.h /usr/include/stdio.h
70: mat.o: mat.c bit.h /usr/include/stdio.h
71: message.o: message.c 2648.h /usr/include/stdio.h
72: minmax.o: minmax.c bit.h /usr/include/stdio.h
73: motion.o: motion.c 2648.h /usr/include/stdio.h
74: move.o: move.c 2648.h /usr/include/stdio.h
75: movecurs.o: movecurs.c 2648.h /usr/include/stdio.h
76: newmat.o: newmat.c bit.h /usr/include/stdio.h
77: outchar.o: outchar.c 2648.h /usr/include/stdio.h
78: outstr.o: outstr.c 2648.h /usr/include/stdio.h
79: printg.o: printg.c 2648.h /usr/include/stdio.h
80: rawchar.o: rawchar.c 2648.h /usr/include/stdio.h
81: rbon.o: rbon.c 2648.h /usr/include/stdio.h
82: rdchar.o: rdchar.c /usr/include/ctype.h
83: readline.o: readline.c 2648.h /usr/include/stdio.h
84: set.o: set.c 2648.h /usr/include/stdio.h
85: setmat.o: setmat.c bit.h /usr/include/stdio.h
86: sync.o: sync.c 2648.h /usr/include/stdio.h
87: texton.o: texton.c 2648.h /usr/include/stdio.h
88: ttyinit.o: ttyinit.c /usr/include/sgtty.h /usr/include/sys/ioctl.h
89: ttyinit.o: /usr/include/sys/ttychars.h /usr/include/sys/ttydev.h 2648.h
90: ttyinit.o: /usr/include/stdio.h
91: update.o: update.c bit.h /usr/include/stdio.h
92: video.o: video.c 2648.h /usr/include/stdio.h
93: zermat.o: zermat.c bit.h /usr/include/stdio.h
94: zoomn.o: zoomn.c 2648.h /usr/include/stdio.h
95: zoomon.o: zoomon.c 2648.h /usr/include/stdio.h
96: zoomout.o: zoomout.c
97:
98: # IF YOU PUT ANYTHING HERE IT WILL GO AWAY
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.