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