cannam@167: # This Makefile.am specifies a set of codelets, efficient transforms
cannam@167: # of small sizes, that are used as building blocks (kernels) by FFTW
cannam@167: # to build up large transforms, as well as the options for generating
cannam@167: # and compiling them.
cannam@167: 
cannam@167: # You can customize FFTW for special needs, e.g. to handle certain
cannam@167: # sizes more efficiently, by adding new codelets to the lists of those
cannam@167: # included by default.  If you change the list of codelets, any new
cannam@167: # ones you added will be automatically generated when you run the
cannam@167: # bootstrap script (see "Generating your own code" in the FFTW
cannam@167: # manual).
cannam@167: 
cannam@167: ###########################################################################
cannam@167: AM_CPPFLAGS = -I $(top_srcdir)
cannam@167: noinst_LTLIBRARIES = libdft_scalar_codelets.la
cannam@167: 
cannam@167: ###########################################################################
cannam@167: # n1_<n> is a hard-coded FFT of size <n> (base cases of FFT recursion)
cannam@167: N1 = n1_2.c n1_3.c n1_4.c n1_5.c n1_6.c n1_7.c n1_8.c n1_9.c n1_10.c	\
cannam@167: n1_11.c n1_12.c n1_13.c n1_14.c n1_15.c n1_16.c n1_32.c n1_64.c \
cannam@167: n1_20.c n1_25.c # n1_30.c n1_40.c n1_50.c
cannam@167: 
cannam@167: ###########################################################################
cannam@167: # t1_<r> is a "twiddle" FFT of size <r>, implementing a radix-r DIT step
cannam@167: T1 = t1_2.c t1_3.c t1_4.c t1_5.c t1_6.c t1_7.c t1_8.c t1_9.c	\
cannam@167: t1_10.c t1_12.c t1_15.c t1_16.c t1_32.c t1_64.c \
cannam@167: t1_20.c t1_25.c # t1_30.c t1_40.c t1_50.c
cannam@167: 
cannam@167: # t2_<r> is also a twiddle FFT, but instead of using a complete lookup table
cannam@167: # of trig. functions, it partially generates the trig. values on the fly
cannam@167: # (this is faster for large sizes).
cannam@167: T2 = t2_4.c t2_8.c t2_16.c t2_32.c t2_64.c \
cannam@167:      t2_5.c t2_10.c t2_20.c t2_25.c
cannam@167: 
cannam@167: ###########################################################################
cannam@167: # The F (DIF) codelets are used for a kind of in-place transform algorithm,
cannam@167: # but the planner seems to never (or hardly ever) use them on the machines
cannam@167: # we have access to, preferring the Q codelets and the use of buffers
cannam@167: # for sub-transforms.  So, we comment them out, at least for now.
cannam@167: 
cannam@167: # f1_<r> is a "twiddle" FFT of size <r>, implementing a radix-r DIF step
cannam@167: F1 = # f1_2.c f1_3.c f1_4.c f1_5.c f1_6.c f1_7.c f1_8.c f1_9.c f1_10.c f1_12.c f1_15.c f1_16.c f1_32.c f1_64.c
cannam@167: 
cannam@167: # like f1, but partially generates its trig. table on the fly
cannam@167: F2 = # f2_4.c f2_8.c f2_16.c f2_32.c f2_64.c
cannam@167: 
cannam@167: ###########################################################################
cannam@167: # q1_<r> is <r> twiddle FFTs of size <r> (DIF step), where the output is
cannam@167: # transposed.  This is used for in-place transposes in sizes that are
cannam@167: # divisible by <r>^2.  These codelets have size ~ <r>^2, so you should
cannam@167: # probably not use <r> bigger than 8 or so.
cannam@167: Q1 = q1_2.c q1_4.c q1_8.c  q1_3.c q1_5.c q1_6.c
cannam@167: 
cannam@167: ###########################################################################
cannam@167: ALL_CODELETS = $(N1) $(T1) $(T2) $(F1) $(F2) $(Q1)
cannam@167: BUILT_SOURCES= $(ALL_CODELETS) $(CODLIST)
cannam@167: 
cannam@167: libdft_scalar_codelets_la_SOURCES = $(BUILT_SOURCES)
cannam@167: 
cannam@167: SOLVTAB_NAME = X(solvtab_dft_standard)
cannam@167: XRENAME=X
cannam@167: 
cannam@167: # special rules for regenerating codelets.
cannam@167: include $(top_srcdir)/support/Makefile.codelets
cannam@167: 
cannam@167: if MAINTAINER_MODE
cannam@167: FLAGS_N1=$(DFT_FLAGS_COMMON)
cannam@167: FLAGS_T1=$(DFT_FLAGS_COMMON)
cannam@167: FLAGS_T2=$(DFT_FLAGS_COMMON) -twiddle-log3 -precompute-twiddles
cannam@167: FLAGS_F1=$(DFT_FLAGS_COMMON)
cannam@167: FLAGS_F2=$(DFT_FLAGS_COMMON) -twiddle-log3  -precompute-twiddles
cannam@167: FLAGS_Q1=$(DFT_FLAGS_COMMON) -reload-twiddle
cannam@167: FLAGS_Q2=$(DFT_FLAGS_COMMON) -twiddle-log3  -precompute-twiddles
cannam@167: 
cannam@167: n1_%.c:  $(CODELET_DEPS) $(GEN_NOTW)
cannam@167: 	($(PRELUDE_COMMANDS_DFT); $(TWOVERS) $(GEN_NOTW) $(FLAGS_N1) -n $* -name n1_$* -include "dft/scalar/n.h") | $(ADD_DATE) | $(INDENT) >$@
cannam@167: 
cannam@167: t1_%.c:  $(CODELET_DEPS) $(GEN_TWIDDLE)
cannam@167: 	($(PRELUDE_COMMANDS_DFT); $(TWOVERS) $(GEN_TWIDDLE) $(FLAGS_T1) -n $* -name t1_$* -include "dft/scalar/t.h") | $(ADD_DATE) | $(INDENT) >$@
cannam@167: 
cannam@167: t2_%.c:  $(CODELET_DEPS) $(GEN_TWIDDLE)
cannam@167: 	($(PRELUDE_COMMANDS_DFT); $(TWOVERS) $(GEN_TWIDDLE) $(FLAGS_T2) -n $* -name t2_$* -include "dft/scalar/t.h") | $(ADD_DATE) | $(INDENT) >$@
cannam@167: 
cannam@167: f1_%.c:  $(CODELET_DEPS) $(GEN_TWIDDLE)
cannam@167: 	($(PRELUDE_COMMANDS_DFT); $(TWOVERS) $(GEN_TWIDDLE) $(FLAGS_F1) -dif -n $* -name f1_$* -include "dft/scalar/f.h") | $(ADD_DATE) | $(INDENT) >$@
cannam@167: 
cannam@167: f2_%.c:  $(CODELET_DEPS) $(GEN_TWIDDLE)
cannam@167: 	($(PRELUDE_COMMANDS_DFT); $(TWOVERS) $(GEN_TWIDDLE) $(FLAGS_F2) -dif -n $* -name f2_$* -include "dft/scalar/f.h") | $(ADD_DATE) | $(INDENT) >$@
cannam@167: 
cannam@167: q1_%.c:  $(CODELET_DEPS) $(GEN_TWIDSQ)
cannam@167: 	($(PRELUDE_COMMANDS_DFT); $(TWOVERS) $(GEN_TWIDSQ) $(FLAGS_Q1) -dif -n $* -name q1_$* -include "dft/scalar/q.h") | $(ADD_DATE) | $(INDENT) >$@
cannam@167: 
cannam@167: q2_%.c:  $(CODELET_DEPS) $(GEN_TWIDSQ)
cannam@167: 	($(PRELUDE_COMMANDS_DFT); $(TWOVERS) $(GEN_TWIDSQ) $(FLAGS_Q2) -dif -n $* -name q2_$* -include "dft/scalar/q.h") | $(ADD_DATE) | $(INDENT) >$@
cannam@167: 
cannam@167: endif # MAINTAINER_MODE