annotate src/fftw-3.3.3/dft/scalar/codelets/Makefile.am @ 23:619f715526df sv_v2.1

Update Vamp plugin SDK to 2.5
author Chris Cannam
date Thu, 09 May 2013 10:52:46 +0100
parents 37bf6b4a2645
children
rev   line source
Chris@10 1 # This Makefile.am specifies a set of codelets, efficient transforms
Chris@10 2 # of small sizes, that are used as building blocks (kernels) by FFTW
Chris@10 3 # to build up large transforms, as well as the options for generating
Chris@10 4 # and compiling them.
Chris@10 5
Chris@10 6 # You can customize FFTW for special needs, e.g. to handle certain
Chris@10 7 # sizes more efficiently, by adding new codelets to the lists of those
Chris@10 8 # included by default. If you change the list of codelets, any new
Chris@10 9 # ones you added will be automatically generated when you run the
Chris@10 10 # bootstrap script (see "Generating your own code" in the FFTW
Chris@10 11 # manual).
Chris@10 12
Chris@10 13 ###########################################################################
Chris@10 14 AM_CPPFLAGS = -I$(top_srcdir)/kernel -I$(top_srcdir)/dft \
Chris@10 15 -I$(top_srcdir)/dft/scalar
Chris@10 16 noinst_LTLIBRARIES = libdft_scalar_codelets.la
Chris@10 17
Chris@10 18 ###########################################################################
Chris@10 19 # n1_<n> is a hard-coded FFT of size <n> (base cases of FFT recursion)
Chris@10 20 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 \
Chris@10 21 n1_11.c n1_12.c n1_13.c n1_14.c n1_15.c n1_16.c n1_32.c n1_64.c \
Chris@10 22 n1_20.c n1_25.c # n1_30.c n1_40.c n1_50.c
Chris@10 23
Chris@10 24 ###########################################################################
Chris@10 25 # t1_<r> is a "twiddle" FFT of size <r>, implementing a radix-r DIT step
Chris@10 26 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 \
Chris@10 27 t1_10.c t1_12.c t1_15.c t1_16.c t1_32.c t1_64.c \
Chris@10 28 t1_20.c t1_25.c # t1_30.c t1_40.c t1_50.c
Chris@10 29
Chris@10 30 # t2_<r> is also a twiddle FFT, but instead of using a complete lookup table
Chris@10 31 # of trig. functions, it partially generates the trig. values on the fly
Chris@10 32 # (this is faster for large sizes).
Chris@10 33 T2 = t2_4.c t2_8.c t2_16.c t2_32.c t2_64.c \
Chris@10 34 t2_5.c t2_10.c t2_20.c t2_25.c
Chris@10 35
Chris@10 36 ###########################################################################
Chris@10 37 # The F (DIF) codelets are used for a kind of in-place transform algorithm,
Chris@10 38 # but the planner seems to never (or hardly ever) use them on the machines
Chris@10 39 # we have access to, preferring the Q codelets and the use of buffers
Chris@10 40 # for sub-transforms. So, we comment them out, at least for now.
Chris@10 41
Chris@10 42 # f1_<r> is a "twiddle" FFT of size <r>, implementing a radix-r DIF step
Chris@10 43 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
Chris@10 44
Chris@10 45 # like f1, but partially generates its trig. table on the fly
Chris@10 46 F2 = # f2_4.c f2_8.c f2_16.c f2_32.c f2_64.c
Chris@10 47
Chris@10 48 ###########################################################################
Chris@10 49 # q1_<r> is <r> twiddle FFTs of size <r> (DIF step), where the output is
Chris@10 50 # transposed. This is used for in-place transposes in sizes that are
Chris@10 51 # divisible by <r>^2. These codelets have size ~ <r>^2, so you should
Chris@10 52 # probably not use <r> bigger than 8 or so.
Chris@10 53 Q1 = q1_2.c q1_4.c q1_8.c q1_3.c q1_5.c q1_6.c
Chris@10 54
Chris@10 55 ###########################################################################
Chris@10 56 ALL_CODELETS = $(N1) $(T1) $(T2) $(F1) $(F2) $(Q1)
Chris@10 57 BUILT_SOURCES= $(ALL_CODELETS) $(CODLIST)
Chris@10 58
Chris@10 59 libdft_scalar_codelets_la_SOURCES = $(BUILT_SOURCES)
Chris@10 60
Chris@10 61 SOLVTAB_NAME = X(solvtab_dft_standard)
Chris@10 62 XRENAME=X
Chris@10 63
Chris@10 64 # special rules for regenerating codelets.
Chris@10 65 include $(top_srcdir)/support/Makefile.codelets
Chris@10 66
Chris@10 67 if MAINTAINER_MODE
Chris@10 68 FLAGS_N1=$(DFT_FLAGS_COMMON)
Chris@10 69 FLAGS_T1=$(DFT_FLAGS_COMMON)
Chris@10 70 FLAGS_T2=$(DFT_FLAGS_COMMON) -twiddle-log3 -precompute-twiddles
Chris@10 71 FLAGS_F1=$(DFT_FLAGS_COMMON)
Chris@10 72 FLAGS_F2=$(DFT_FLAGS_COMMON) -twiddle-log3 -precompute-twiddles
Chris@10 73 FLAGS_Q1=$(DFT_FLAGS_COMMON) -reload-twiddle
Chris@10 74 FLAGS_Q2=$(DFT_FLAGS_COMMON) -twiddle-log3 -precompute-twiddles
Chris@10 75
Chris@10 76 n1_%.c: $(CODELET_DEPS) $(GEN_NOTW)
Chris@10 77 ($(PRELUDE_COMMANDS_DFT); $(TWOVERS) $(GEN_NOTW) $(FLAGS_N1) -n $* -name n1_$* -include "n.h") | $(ADD_DATE) | $(INDENT) >$@
Chris@10 78
Chris@10 79 t1_%.c: $(CODELET_DEPS) $(GEN_TWIDDLE)
Chris@10 80 ($(PRELUDE_COMMANDS_DFT); $(TWOVERS) $(GEN_TWIDDLE) $(FLAGS_T1) -n $* -name t1_$* -include "t.h") | $(ADD_DATE) | $(INDENT) >$@
Chris@10 81
Chris@10 82 t2_%.c: $(CODELET_DEPS) $(GEN_TWIDDLE)
Chris@10 83 ($(PRELUDE_COMMANDS_DFT); $(TWOVERS) $(GEN_TWIDDLE) $(FLAGS_T2) -n $* -name t2_$* -include "t.h") | $(ADD_DATE) | $(INDENT) >$@
Chris@10 84
Chris@10 85 f1_%.c: $(CODELET_DEPS) $(GEN_TWIDDLE)
Chris@10 86 ($(PRELUDE_COMMANDS_DFT); $(TWOVERS) $(GEN_TWIDDLE) $(FLAGS_F1) -dif -n $* -name f1_$* -include "f.h") | $(ADD_DATE) | $(INDENT) >$@
Chris@10 87
Chris@10 88 f2_%.c: $(CODELET_DEPS) $(GEN_TWIDDLE)
Chris@10 89 ($(PRELUDE_COMMANDS_DFT); $(TWOVERS) $(GEN_TWIDDLE) $(FLAGS_F2) -dif -n $* -name f2_$* -include "f.h") | $(ADD_DATE) | $(INDENT) >$@
Chris@10 90
Chris@10 91 q1_%.c: $(CODELET_DEPS) $(GEN_TWIDSQ)
Chris@10 92 ($(PRELUDE_COMMANDS_DFT); $(TWOVERS) $(GEN_TWIDSQ) $(FLAGS_Q1) -dif -n $* -name q1_$* -include "q.h") | $(ADD_DATE) | $(INDENT) >$@
Chris@10 93
Chris@10 94 q2_%.c: $(CODELET_DEPS) $(GEN_TWIDSQ)
Chris@10 95 ($(PRELUDE_COMMANDS_DFT); $(TWOVERS) $(GEN_TWIDSQ) $(FLAGS_Q2) -dif -n $* -name q2_$* -include "q.h") | $(ADD_DATE) | $(INDENT) >$@
Chris@10 96
Chris@10 97 endif # MAINTAINER_MODE