# For SAS-C v5.10 LMK.

ROOT = Sys

C0 = -cus -O                              # cc options
L0 = LC:blink FROM LIB:c.o                # blink leader
L1 = LIBRARY LIB:lc.lib LIB:amiga.lib     # blink libraries
L2 =                                      # blink trailer
LD = $(ROOT):Lint/                        # lint directory
LH = $(ROOT):LC/Compiler_Headers/         # standard includes (for lint)

.c.o:
  LC:lc $(C0) $*

head: head.o
  $(L0) head.o TO head $(L1) $(L2)

sort: sort.o token.o btree.o
  $(L0) sort.o token.o btree.o TO sort $(L1) $(L2)

b_sort: b_sort.o token.o b_tree.o
  $(L0) b_sort.o token.o b_tree.o TO b_sort $(L1) $(L2)

s_sort: s_sort.o s_tree.o
  $(L0) s_sort.o s_tree.o TO s_sort $(L1) $(L2)

strings:  strings.o
  $(L0) strings.o TO strings $(L1) $(L2)

tail: tail.o
  $(L0) tail.o TO tail $(L1) $(L2)

tree: tree.o
  $(L0) tree.o TO tree $(L1) $(L2)

head.o: head.c mlo.h

token.o:  token.c sort.h

sort.o: sort.c sort.h mlo.h

strings.o:  strings.c mlo.h

b_sort.o: sort.c sort.h mlo.h
  LC:lc $(C0) -ob_sort.o -DBALANCED_TREE sort

s_sort.o: sort.c sort.h mlo.h
  LC:lc $(C0) -os_sort.o -DSIMPLE sort

tail.o: tail.c mlo.h

btree.o: btree.c sort.h mlo.h

b_tree.o: btree.c sort.h mlo.h
  LC:lc $(C0) -ob_tree.o -DBALANCED_TREE btree

s_tree.o: btree.c sort.h mlo.h
  LC:lc $(C0) -os_tree.o -DSIMPLE btree

head.lint:  head.c
  $(LD)Lint >head.lint +vm -zero -i$(LH) $(LD)co head

sort.lint:  sort.c token.c btree.c sort.h
  $(LD)Lint >sort.lint +vm -zero -i$(LH) $(LD)co sort token btree

b_sort.lint:  sort.c token.c btree.c sort.h
  $(LD)Lint >b_sort.lint +vm -zero -dBALANCED_TREE -i$(LH) \
  $(LD)co sort token btree

s_sort.lint:  sort.c btree.c sort.h
  $(LD)Lint >s_sort.lint +vm -zero -dSIMPLE -i$(LH) \
  $(LD)co sort btree

strings.lint:  strings.c
  $(LD)Lint >strings.lint +vm -zero -i$(LH) $(LD)co strings

tail.lint:  tail.c
  $(LD)Lint >tail.lint +vm -zero -i$(LH) $(LD)co tail

tree.lint:  tree.c
  $(LD)Lint >tree.lint +vm -zero -i$(LH) $(LD)co tree
