|
|
1.1 ! root 1: # ! 2: # Copyright (c) 1980 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.4 (Berkeley) 9/5/85 ! 7: # ! 8: # printf & co are here because they are machine dependent ! 9: # ! 10: CFLAGS= ${DEFS} -I../gen ! 11: OBJS= doprnt.o fputs.o fgets.o puts.o gets.o ! 12: SRCS= doprnt.c fputs.c fgets.c puts.c gets.c ! 13: TAGSFILE=tags ! 14: ! 15: .c.o: ! 16: cc -E -DPROF ${CFLAGS} $*.c | as -o $*.o ! 17: -ld -x -r $*.o ! 18: mv a.out profiled/$*.o ! 19: cc -E ${CFLAGS} $*.c | as -o $*.o ! 20: -ld -x -r $*.o ! 21: mv a.out $*.o ! 22: ! 23: stdiolib stdiolib_p: ${OBJS} ! 24: @echo "building profiled stdiolib" ! 25: @cd profiled; ar cru ../stdiolib_p ${OBJS} ! 26: @echo "building normal stdiolib" ! 27: @ar cru stdiolib ${OBJS} ! 28: ! 29: tags: ! 30: ! 31: clean: ! 32: rm -f stdiolib stdiolib_p *.o profiled/*.o tags Makefile.bak ! 33: ! 34: depend: ! 35: for i in ${SRCS}; do \ ! 36: cc -M ${CFLAGS} $$i | awk ' { if ($$1 != prev) \ ! 37: { if (rec != "") print rec; rec = $$0; prev = $$1; } \ ! 38: else { if (length(rec $$2) > 78) { print rec; rec = $$0; } \ ! 39: else rec = rec " " $$2 } } \ ! 40: END { print rec } ' >> makedep; done ! 41: echo '/^# DO NOT DELETE THIS LINE/+2,$$d' >eddep ! 42: echo '$$r makedep' >>eddep ! 43: echo 'w' >>eddep ! 44: cp Makefile Makefile.bak ! 45: ed - Makefile < eddep ! 46: rm eddep makedep ! 47: echo '# DEPENDENCIES MUST END AT END OF FILE' >> Makefile ! 48: echo '# IF YOU PUT STUFF HERE IT WILL GO AWAY' >> Makefile ! 49: echo '# see make depend above' >> Makefile ! 50: ! 51: # DO NOT DELETE THIS LINE -- make depend uses it ! 52: ! 53: doprnt.o: doprnt.c ../gen/DEFS.h ! 54: fputs.o: fputs.c ../gen/DEFS.h ! 55: fgets.o: fgets.c ../gen/DEFS.h ! 56: puts.o: puts.c ../gen/DEFS.h ! 57: gets.o: gets.c ../gen/DEFS.h ! 58: # DEPENDENCIES MUST END AT END OF FILE ! 59: # IF YOU PUT STUFF HERE IT WILL GO AWAY ! 60: # see make depend above
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.