#	@(#)Makefile	8.3 (Berkeley) 9/6/93

LIBDB=	libdb.lib

OBJ1=	hash.obj hash_bigkey.obj hash_buf.obj hash_func.obj hash_log2.obj \
	hash_page.obj hsearch.obj ndbm.obj

OBJ2=	bt_close.obj bt_conv.obj bt_debug.obj bt_delete.obj bt_get.obj \
	bt_open.obj bt_overflow.obj bt_page.obj bt_put.obj bt_search.obj \
	bt_seq.obj bt_split.obj bt_stack.obj bt_utils.obj

OBJ3=	db.obj

OBJ4=	mpool.obj

OBJ5=	rec_close.obj rec_delete.obj rec_get.obj rec_open.obj rec_put.obj \
	rec_search.obj rec_seq.obj rec_utils.obj

MISC=

CC=wcl386 /j

$(LIBDB): $(OBJ1) $(OBJ2) $(OBJ3) $(OBJ4) $(OBJ5) $(MISC)
	xxx
	ar cq $@ \
	    `lorder $(OBJ1) $(OBJ2) $(OBJ3) $(OBJ4) $(OBJ5) $(MISC) | tsort`
	ranlib $@

CL=	$(CC) /c $(DEBUG) /i=. /i=watcom\include

hash.obj: ../../hash/hash.c
	$(CL) /i=../../hash ../../hash/hash.c
hash_bigkey.obj: ../../hash/hash_bigkey.c
	$(CL) /i=../../hash ../../hash/hash_bigkey.c
hash_buf.obj: ../../hash/hash_buf.c
	$(CL) /i=../../hash ../../hash/hash_buf.c
hash_func.obj: ../../hash/hash_func.c
	$(CL) /i=../../hash ../../hash/hash_func.c
hash_log2.obj: ../../hash/hash_log2.c
	$(CL) /i=../../hash ../../hash/hash_log2.c
hash_page.obj: ../../hash/hash_page.c
	$(CL) /i=../../hash ../../hash/hash_page.c
hsearch.obj: ../../hash/hsearch.c
	$(CL) /i=../../hash ../../hash/hsearch.c
ndbm.obj: ../../hash/ndbm.c
	$(CL) /i=../../hash ../../hash/ndbm.c

bt_close.obj: ../../btree/bt_close.c
	$(CL) /i=../../btree ../../btree/bt_close.c
bt_conv.obj: ../../btree/bt_conv.c
	$(CL) /i=../../btree ../../btree/bt_conv.c
bt_debug.obj: ../../btree/bt_debug.c
	$(CL) /i=../../btree ../../btree/bt_debug.c
bt_delete.obj: ../../btree/bt_delete.c
	$(CL) /i=../../btree ../../btree/bt_delete.c
bt_get.obj: ../../btree/bt_get.c
	$(CL) /i=../../btree ../../btree/bt_get.c
bt_open.obj: ../../btree/bt_open.c
	$(CL) /i=../../btree ../../btree/bt_open.c
bt_overflow.obj: ../../btree/bt_overflow.c
	$(CL) /i=../../btree ../../btree/bt_overflow.c
bt_page.obj: ../../btree/bt_page.c
	$(CL) /i=../../btree ../../btree/bt_page.c
bt_put.obj: ../../btree/bt_put.c
	$(CL) /i=../../btree ../../btree/bt_put.c
bt_search.obj: ../../btree/bt_search.c
	$(CL) /i=../../btree ../../btree/bt_search.c
bt_seq.obj: ../../btree/bt_seq.c
	$(CL) /i=../../btree ../../btree/bt_seq.c
bt_split.obj: ../../btree/bt_split.c
	$(CL) /i=../../btree ../../btree/bt_split.c
bt_stack.obj: ../../btree/bt_stack.c
	$(CL) /i=../../btree ../../btree/bt_stack.c
bt_utils.obj: ../../btree/bt_utils.c
	$(CL) /i=../../btree ../../btree/bt_utils.c

db.obj: ../../db/db.c
	$(CL) ../../db/db.c

mpool.obj: ../../mpool/mpool.c
	$(CL) /i=../../mpool ../../mpool/mpool.c

rec_close.obj: ../../recno/rec_close.c
	$(CL) /i=../../recno ../../recno/rec_close.c
rec_delete.obj: ../../recno/rec_delete.c
	$(CL) /i=../../recno ../../recno/rec_delete.c
rec_get.obj: ../../recno/rec_get.c
	$(CL) /i=../../recno ../../recno/rec_get.c
rec_open.obj: ../../recno/rec_open.c
	$(CL) /i=../../recno ../../recno/rec_open.c
rec_put.obj: ../../recno/rec_put.c
	$(CL) /i=../../recno ../../recno/rec_put.c
rec_search.obj: ../../recno/rec_search.c
	$(CL) /i=../../recno ../../recno/rec_search.c
rec_seq.obj: ../../recno/rec_seq.c
	$(CL) /i=../../recno ../../recno/rec_seq.c
rec_utils.obj: ../../recno/rec_utils.c
	$(CL) /i=../../recno ../../recno/rec_utils.c

memmove.obj:
	$(CC) -DMEMMOVE /c $(DEBUG) /i=. /i=include clib/memmove.c
mktemp.obj:
	$(CC) /c $(DEBUG) /i=. /i=include clib/mktemp.c
realloc.obj:
	$(CC) /c $(DEBUG) /i=. /i=include clib/realloc.c
snprintf.obj:
	$(CC) /c $(DEBUG) /i=. /i=include clib/snprintf.c

clean:
	rm -f $(LIBDB) $(OBJ1) $(OBJ2) $(OBJ3) $(OBJ4) $(OBJ5) $(MISC)
