1 # @(#)Makefile 8.9 (Berkeley) 7/14/94
4 OBJ1
= hash.o hash_bigkey.o hash_buf.o hash_func.o hash_log2.o hash_page.o \
6 OBJ2
= bt_close.o bt_conv.o bt_debug.o bt_delete.o bt_get.o bt_open.o \
7 bt_overflow.o bt_page.o bt_put.o bt_search.o bt_seq.o bt_split.o \
11 OBJ5
= rec_close.o rec_delete.o rec_get.o rec_open.o rec_put.o rec_search.o \
16 ${LIBDB}: ${OBJ1} ${OBJ2} ${OBJ3} ${OBJ4} ${OBJ5} ${MISC}
19 `lorder ${OBJ1} ${OBJ2} ${OBJ3} ${OBJ4} ${OBJ5} ${MISC} | tsort`
23 rm -f
${LIBDB} ${OBJ1} ${OBJ2} ${OBJ3} ${OBJ4} ${OBJ5} ${MISC}
25 CC
= cc -cckr
-D_BSD_COMPAT
27 CL
= ${CC} -c
-D__DBINTERFACE_PRIVATE
${OORG} -I.
-Iinclude
29 hash.o
: ..
/..
/hash
/hash.c
30 ${CL} -I..
/..
/hash ..
/..
/hash
/hash.c
31 hash_bigkey.o
: ..
/..
/hash
/hash_bigkey.c
32 ${CL} -I..
/..
/hash ..
/..
/hash
/hash_bigkey.c
33 hash_buf.o
: ..
/..
/hash
/hash_buf.c
34 ${CL} -I..
/..
/hash ..
/..
/hash
/hash_buf.c
35 hash_func.o
: ..
/..
/hash
/hash_func.c
36 ${CL} -I..
/..
/hash ..
/..
/hash
/hash_func.c
37 hash_log2.o
: ..
/..
/hash
/hash_log2.c
38 ${CL} -I..
/..
/hash ..
/..
/hash
/hash_log2.c
39 hash_page.o
: ..
/..
/hash
/hash_page.c
40 ${CL} -I..
/..
/hash ..
/..
/hash
/hash_page.c
41 hsearch.o
: ..
/..
/hash
/hsearch.c
42 ${CL} -I..
/..
/hash ..
/..
/hash
/hsearch.c
43 ndbm.o
: ..
/..
/hash
/ndbm.c
44 ${CL} -I..
/..
/hash ..
/..
/hash
/ndbm.c
46 bt_close.o
: ..
/..
/btree
/bt_close.c
47 ${CL} -I..
/..
/btree ..
/..
/btree
/bt_close.c
48 bt_conv.o
: ..
/..
/btree
/bt_conv.c
49 ${CL} -I..
/..
/btree ..
/..
/btree
/bt_conv.c
50 bt_debug.o
: ..
/..
/btree
/bt_debug.c
51 ${CL} -I..
/..
/btree ..
/..
/btree
/bt_debug.c
52 bt_delete.o
: ..
/..
/btree
/bt_delete.c
53 ${CL} -I..
/..
/btree ..
/..
/btree
/bt_delete.c
54 bt_get.o
: ..
/..
/btree
/bt_get.c
55 ${CL} -I..
/..
/btree ..
/..
/btree
/bt_get.c
56 bt_open.o
: ..
/..
/btree
/bt_open.c
57 ${CL} -I..
/..
/btree ..
/..
/btree
/bt_open.c
58 bt_overflow.o
: ..
/..
/btree
/bt_overflow.c
59 ${CL} -I..
/..
/btree ..
/..
/btree
/bt_overflow.c
60 bt_page.o
: ..
/..
/btree
/bt_page.c
61 ${CL} -I..
/..
/btree ..
/..
/btree
/bt_page.c
62 bt_put.o
: ..
/..
/btree
/bt_put.c
63 ${CL} -I..
/..
/btree ..
/..
/btree
/bt_put.c
64 bt_search.o
: ..
/..
/btree
/bt_search.c
65 ${CL} -I..
/..
/btree ..
/..
/btree
/bt_search.c
66 bt_seq.o
: ..
/..
/btree
/bt_seq.c
67 ${CL} -I..
/..
/btree ..
/..
/btree
/bt_seq.c
68 bt_split.o
: ..
/..
/btree
/bt_split.c
69 ${CL} -I..
/..
/btree ..
/..
/btree
/bt_split.c
70 bt_stack.o
: ..
/..
/btree
/bt_stack.c
71 ${CL} -I..
/..
/btree ..
/..
/btree
/bt_stack.c
72 bt_utils.o
: ..
/..
/btree
/bt_utils.c
73 ${CL} -I..
/..
/btree ..
/..
/btree
/bt_utils.c
78 mpool.o
: ..
/..
/mpool
/mpool.c
79 ${CL} -I..
/..
/mpool ..
/..
/mpool
/mpool.c
81 rec_close.o
: ..
/..
/recno
/rec_close.c
82 ${CL} -I..
/..
/recno ..
/..
/recno
/rec_close.c
83 rec_delete.o
: ..
/..
/recno
/rec_delete.c
84 ${CL} -I..
/..
/recno ..
/..
/recno
/rec_delete.c
85 rec_get.o
: ..
/..
/recno
/rec_get.c
86 ${CL} -I..
/..
/recno ..
/..
/recno
/rec_get.c
87 rec_open.o
: ..
/..
/recno
/rec_open.c
88 ${CL} -I..
/..
/recno ..
/..
/recno
/rec_open.c
89 rec_put.o
: ..
/..
/recno
/rec_put.c
90 ${CL} -I..
/..
/recno ..
/..
/recno
/rec_put.c
91 rec_search.o
: ..
/..
/recno
/rec_search.c
92 ${CL} -I..
/..
/recno ..
/..
/recno
/rec_search.c
93 rec_seq.o
: ..
/..
/recno
/rec_seq.c
94 ${CL} -I..
/..
/recno ..
/..
/recno
/rec_seq.c
95 rec_utils.o
: ..
/..
/recno
/rec_utils.c
96 ${CL} -I..
/..
/recno ..
/..
/recno
/rec_utils.c
99 ${CC} -DMEMMOVE
-c
-O
-I.
-Iinclude clib
/memmove.c
101 ${CC} -c
-O
-I.
-Iinclude clib
/mktemp.c
103 ${CC} -c
-O
-I.
-Iinclude clib
/snprintf.c