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