# examples/cookbook/idct Makefile 5/5/2000HOSTCC = accENDIAN=el#	NOTE ON DEBUGGING##	The IDCT algorithm operates in two passes (horizontal and vertical)#	In each pass, 8 1-D IDCT are performed#	To debug the IDCT algorithm, add -DONEPASS. This allows#	the intermediate results to be examined.##	To compare with  reference results, use#		fidct -sep -onepass < <input file>##	A good input file is data/test2d.2. This contains the 8 basis#	vectors ##	This release has greatly expanded example source code. Look#	at the comments in the individual files##	The standard makefile entry checks that running the IDCT#	against the DCT produces the same results check:	-mkdir ref tmp	make clean	make fidct	@for endian in el eb ; \		do \		echo Endian= $${endian}, ... Compiling -- ; \		make ENDIAN=$${endian} compile ; \		for a in input.linear input.rand test2d.2 blksample.1 blksample.2 blksample.3 blksample.4 blksample.5 blksample.6 input.2 ; \			do \			echo -n ... Input $$a "..."  ; \			$(TCS)/bin/tmsim idct.out <data/$$a >tmp/$$a ; \			fidct <data/$$a >ref/$$a; \			echo `cmp -l ref/$$a tmp/$$a | wc -l` Differences;\			done ; \		done#	This entry is used to find out how much cycles are required#	for a single IDCTprofile: compile	$(TCS)/bin/tmsim -statfile idct.stf idct.out <data/input.linear >output.linear	$(TCS)/bin/tmprof idct.stf -nomm idct.out -scale 1 -fcs _idct8x8fix##	This is a 1-D fixed point implementation#one_d.out: one_d.c	$(TCS)/bin/tmcc -$(ENDIAN) -I../tc -target tm1 one_d.c -o one_d.out##	This is a reference DCT implementation. It is provided#	to compare accuracyfidct: fidct.c	$(HOSTCC) fidct.c  -o fidct -lm##	This is a 1-D floating point version of the DCT. This is used#	in initial debuggingone_d.float: one_d.float.c	$(HOSTCC) -I../tc one_d.float.c -o one_d.float -lm##	This program accepts data files with the old shuffle order and#	produces a standard DCT order#shuffle.out: shuffle.c	$(HOSTCC) shuffle.c -o shuffle.out ##	The coefficient generator program is provided with#	the sources. Coefficients are packed as fixed point,#	the msb is the sign, with 14 bits for the fractionmake_coeffs.out: make_coeffs.c	$(HOSTCC) make_coeffs.c -o make_coeffs -lm -lsunmath#	This is the core entry of the 2D DCT. The DCT is an unrolled#	completely algorithm using fixed point arithmetic. For more#	information, refer to Sang Ju Parks article and the article#	in the cookbook, also the references compile: main.c fast_idct.c	$(TCS)/bin/tmcc -I../tc -$(ENDIAN) -target tm1 -o idct.out fast_idct.c main.c##	This entry point ships the DCT implementation in a TAR filetar:	-tar cvf /tmp/idct.tar ./*.[ch] ./data ./Makefileclean:	@-rm *.out *.o idct.stf one_d.floatclobber: clean	@-rm output.linear output.rand