diff --git a/external/external_build.cmake b/external/external_build.cmake index ae8242a..0bb5b6e 100644 --- a/external/external_build.cmake +++ b/external/external_build.cmake @@ -31,12 +31,11 @@ SET(CONFIGURE_CPP_FLAGS "") SET(CONFIGURE_LDFLAGS "") if (ENABLE_SHARP) - SET(SHARP_SOURCE ${CMAKE_SOURCE_DIR}/external/sharp) - SET(DEP_BUILD ${CMAKE_SOURCE_DIR}/external/sharp/auto) + SET(DEP_BUILD ${CMAKE_SOURCE_DIR}/sharp-prefix/src/sharp/libsharp/auto) ExternalProject_Add(sharp - SOURCE_DIR ${SHARP_SOURCE} + URL ${CMAKE_SOURCE_DIR}/external/libsharp-6077806.tar.gz BUILD_IN_SOURCE 1 - CONFIGURE_COMMAND ${SHARP_SOURCE}/configure "CC=${CMAKE_C_COMPILER}" "CXX=${CMAKE_CXX_COMPILER}" --prefix=${DEP_BUILD} + CONFIGURE_COMMAND autoconf && ./configure "CC=${CMAKE_C_COMPILER}" "CXX=${CMAKE_CXX_COMPILER}" --prefix=${DEP_BUILD} BUILD_COMMAND ${CMAKE_MAKE_PROGRAM} INSTALL_COMMAND echo "No install" ) diff --git a/external/libsharp-6077806.tar.gz b/external/libsharp-6077806.tar.gz new file mode 100644 index 0000000..360bef9 Binary files /dev/null and b/external/libsharp-6077806.tar.gz differ diff --git a/external/sharp/COPYING b/external/sharp/COPYING deleted file mode 100644 index d159169..0000000 --- a/external/sharp/COPYING +++ /dev/null @@ -1,339 +0,0 @@ - GNU GENERAL PUBLIC LICENSE - Version 2, June 1991 - - Copyright (C) 1989, 1991 Free Software Foundation, Inc., - 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA - Everyone is permitted to copy and distribute verbatim copies - of this license document, but changing it is not allowed. - - Preamble - - The licenses for most software are designed to take away your -freedom to share and change it. By contrast, the GNU General Public -License is intended to guarantee your freedom to share and change free -software--to make sure the software is free for all its users. This -General Public License applies to most of the Free Software -Foundation's software and to any other program whose authors commit to -using it. (Some other Free Software Foundation software is covered by -the GNU Lesser General Public License instead.) You can apply it to -your programs, too. - - When we speak of free software, we are referring to freedom, not -price. Our General Public Licenses are designed to make sure that you -have the freedom to distribute copies of free software (and charge for -this service if you wish), that you receive source code or can get it -if you want it, that you can change the software or use pieces of it -in new free programs; and that you know you can do these things. - - To protect your rights, we need to make restrictions that forbid -anyone to deny you these rights or to ask you to surrender the rights. -These restrictions translate to certain responsibilities for you if you -distribute copies of the software, or if you modify it. - - For example, if you distribute copies of such a program, whether -gratis or for a fee, you must give the recipients all the rights that -you have. You must make sure that they, too, receive or can get the -source code. And you must show them these terms so they know their -rights. - - We protect your rights with two steps: (1) copyright the software, and -(2) offer you this license which gives you legal permission to copy, -distribute and/or modify the software. - - Also, for each author's protection and ours, we want to make certain -that everyone understands that there is no warranty for this free -software. If the software is modified by someone else and passed on, we -want its recipients to know that what they have is not the original, so -that any problems introduced by others will not reflect on the original -authors' reputations. - - Finally, any free program is threatened constantly by software -patents. We wish to avoid the danger that redistributors of a free -program will individually obtain patent licenses, in effect making the -program proprietary. To prevent this, we have made it clear that any -patent must be licensed for everyone's free use or not licensed at all. - - The precise terms and conditions for copying, distribution and -modification follow. - - GNU GENERAL PUBLIC LICENSE - TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION - - 0. This License applies to any program or other work which contains -a notice placed by the copyright holder saying it may be distributed -under the terms of this General Public License. The "Program", below, -refers to any such program or work, and a "work based on the Program" -means either the Program or any derivative work under copyright law: -that is to say, a work containing the Program or a portion of it, -either verbatim or with modifications and/or translated into another -language. (Hereinafter, translation is included without limitation in -the term "modification".) Each licensee is addressed as "you". - -Activities other than copying, distribution and modification are not -covered by this License; they are outside its scope. The act of -running the Program is not restricted, and the output from the Program -is covered only if its contents constitute a work based on the -Program (independent of having been made by running the Program). -Whether that is true depends on what the Program does. - - 1. You may copy and distribute verbatim copies of the Program's -source code as you receive it, in any medium, provided that you -conspicuously and appropriately publish on each copy an appropriate -copyright notice and disclaimer of warranty; keep intact all the -notices that refer to this License and to the absence of any warranty; -and give any other recipients of the Program a copy of this License -along with the Program. - -You may charge a fee for the physical act of transferring a copy, and -you may at your option offer warranty protection in exchange for a fee. - - 2. You may modify your copy or copies of the Program or any portion -of it, thus forming a work based on the Program, and copy and -distribute such modifications or work under the terms of Section 1 -above, provided that you also meet all of these conditions: - - a) You must cause the modified files to carry prominent notices - stating that you changed the files and the date of any change. - - b) You must cause any work that you distribute or publish, that in - whole or in part contains or is derived from the Program or any - part thereof, to be licensed as a whole at no charge to all third - parties under the terms of this License. - - c) If the modified program normally reads commands interactively - when run, you must cause it, when started running for such - interactive use in the most ordinary way, to print or display an - announcement including an appropriate copyright notice and a - notice that there is no warranty (or else, saying that you provide - a warranty) and that users may redistribute the program under - these conditions, and telling the user how to view a copy of this - License. (Exception: if the Program itself is interactive but - does not normally print such an announcement, your work based on - the Program is not required to print an announcement.) - -These requirements apply to the modified work as a whole. If -identifiable sections of that work are not derived from the Program, -and can be reasonably considered independent and separate works in -themselves, then this License, and its terms, do not apply to those -sections when you distribute them as separate works. But when you -distribute the same sections as part of a whole which is a work based -on the Program, the distribution of the whole must be on the terms of -this License, whose permissions for other licensees extend to the -entire whole, and thus to each and every part regardless of who wrote it. - -Thus, it is not the intent of this section to claim rights or contest -your rights to work written entirely by you; rather, the intent is to -exercise the right to control the distribution of derivative or -collective works based on the Program. - -In addition, mere aggregation of another work not based on the Program -with the Program (or with a work based on the Program) on a volume of -a storage or distribution medium does not bring the other work under -the scope of this License. - - 3. You may copy and distribute the Program (or a work based on it, -under Section 2) in object code or executable form under the terms of -Sections 1 and 2 above provided that you also do one of the following: - - a) Accompany it with the complete corresponding machine-readable - source code, which must be distributed under the terms of Sections - 1 and 2 above on a medium customarily used for software interchange; or, - - b) Accompany it with a written offer, valid for at least three - years, to give any third party, for a charge no more than your - cost of physically performing source distribution, a complete - machine-readable copy of the corresponding source code, to be - distributed under the terms of Sections 1 and 2 above on a medium - customarily used for software interchange; or, - - c) Accompany it with the information you received as to the offer - to distribute corresponding source code. (This alternative is - allowed only for noncommercial distribution and only if you - received the program in object code or executable form with such - an offer, in accord with Subsection b above.) - -The source code for a work means the preferred form of the work for -making modifications to it. For an executable work, complete source -code means all the source code for all modules it contains, plus any -associated interface definition files, plus the scripts used to -control compilation and installation of the executable. However, as a -special exception, the source code distributed need not include -anything that is normally distributed (in either source or binary -form) with the major components (compiler, kernel, and so on) of the -operating system on which the executable runs, unless that component -itself accompanies the executable. - -If distribution of executable or object code is made by offering -access to copy from a designated place, then offering equivalent -access to copy the source code from the same place counts as -distribution of the source code, even though third parties are not -compelled to copy the source along with the object code. - - 4. You may not copy, modify, sublicense, or distribute the Program -except as expressly provided under this License. Any attempt -otherwise to copy, modify, sublicense or distribute the Program is -void, and will automatically terminate your rights under this License. -However, parties who have received copies, or rights, from you under -this License will not have their licenses terminated so long as such -parties remain in full compliance. - - 5. You are not required to accept this License, since you have not -signed it. However, nothing else grants you permission to modify or -distribute the Program or its derivative works. These actions are -prohibited by law if you do not accept this License. Therefore, by -modifying or distributing the Program (or any work based on the -Program), you indicate your acceptance of this License to do so, and -all its terms and conditions for copying, distributing or modifying -the Program or works based on it. - - 6. Each time you redistribute the Program (or any work based on the -Program), the recipient automatically receives a license from the -original licensor to copy, distribute or modify the Program subject to -these terms and conditions. You may not impose any further -restrictions on the recipients' exercise of the rights granted herein. -You are not responsible for enforcing compliance by third parties to -this License. - - 7. If, as a consequence of a court judgment or allegation of patent -infringement or for any other reason (not limited to patent issues), -conditions are imposed on you (whether by court order, agreement or -otherwise) that contradict the conditions of this License, they do not -excuse you from the conditions of this License. If you cannot -distribute so as to satisfy simultaneously your obligations under this -License and any other pertinent obligations, then as a consequence you -may not distribute the Program at all. For example, if a patent -license would not permit royalty-free redistribution of the Program by -all those who receive copies directly or indirectly through you, then -the only way you could satisfy both it and this License would be to -refrain entirely from distribution of the Program. - -If any portion of this section is held invalid or unenforceable under -any particular circumstance, the balance of the section is intended to -apply and the section as a whole is intended to apply in other -circumstances. - -It is not the purpose of this section to induce you to infringe any -patents or other property right claims or to contest validity of any -such claims; this section has the sole purpose of protecting the -integrity of the free software distribution system, which is -implemented by public license practices. Many people have made -generous contributions to the wide range of software distributed -through that system in reliance on consistent application of that -system; it is up to the author/donor to decide if he or she is willing -to distribute software through any other system and a licensee cannot -impose that choice. - -This section is intended to make thoroughly clear what is believed to -be a consequence of the rest of this License. - - 8. If the distribution and/or use of the Program is restricted in -certain countries either by patents or by copyrighted interfaces, the -original copyright holder who places the Program under this License -may add an explicit geographical distribution limitation excluding -those countries, so that distribution is permitted only in or among -countries not thus excluded. In such case, this License incorporates -the limitation as if written in the body of this License. - - 9. The Free Software Foundation may publish revised and/or new versions -of the General Public License from time to time. Such new versions will -be similar in spirit to the present version, but may differ in detail to -address new problems or concerns. - -Each version is given a distinguishing version number. If the Program -specifies a version number of this License which applies to it and "any -later version", you have the option of following the terms and conditions -either of that version or of any later version published by the Free -Software Foundation. If the Program does not specify a version number of -this License, you may choose any version ever published by the Free Software -Foundation. - - 10. If you wish to incorporate parts of the Program into other free -programs whose distribution conditions are different, write to the author -to ask for permission. For software which is copyrighted by the Free -Software Foundation, write to the Free Software Foundation; we sometimes -make exceptions for this. Our decision will be guided by the two goals -of preserving the free status of all derivatives of our free software and -of promoting the sharing and reuse of software generally. - - NO WARRANTY - - 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY -FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN -OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES -PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED -OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF -MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS -TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE -PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, -REPAIR OR CORRECTION. - - 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING -WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR -REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, -INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING -OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED -TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY -YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER -PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE -POSSIBILITY OF SUCH DAMAGES. - - END OF TERMS AND CONDITIONS - - How to Apply These Terms to Your New Programs - - If you develop a new program, and you want it to be of the greatest -possible use to the public, the best way to achieve this is to make it -free software which everyone can redistribute and change under these terms. - - To do so, attach the following notices to the program. It is safest -to attach them to the start of each source file to most effectively -convey the exclusion of warranty; and each file should have at least -the "copyright" line and a pointer to where the full notice is found. - - - Copyright (C) - - This program is free software; you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation; either version 2 of the License, or - (at your option) any later version. - - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. - - You should have received a copy of the GNU General Public License along - with this program; if not, write to the Free Software Foundation, Inc., - 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. - -Also add information on how to contact you by electronic and paper mail. - -If the program is interactive, make it output a short notice like this -when it starts in an interactive mode: - - Gnomovision version 69, Copyright (C) year name of author - Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. - This is free software, and you are welcome to redistribute it - under certain conditions; type `show c' for details. - -The hypothetical commands `show w' and `show c' should show the appropriate -parts of the General Public License. Of course, the commands you use may -be called something other than `show w' and `show c'; they could even be -mouse-clicks or menu items--whatever suits your program. - -You should also get your employer (if you work as a programmer) or your -school, if any, to sign a "copyright disclaimer" for the program, if -necessary. Here is a sample; alter the names: - - Yoyodyne, Inc., hereby disclaims all copyright interest in the program - `Gnomovision' (which makes passes at compilers) written by James Hacker. - - , 1 April 1989 - Ty Coon, President of Vice - -This General Public License does not permit incorporating your program into -proprietary programs. If your program is a subroutine library, you may -consider it more useful to permit linking proprietary applications with the -library. If this is what you want to do, use the GNU Lesser General -Public License instead of this License. diff --git a/external/sharp/Makefile b/external/sharp/Makefile deleted file mode 100644 index 6476fa5..0000000 --- a/external/sharp/Makefile +++ /dev/null @@ -1,78 +0,0 @@ -SHARP_TARGET?=auto -ifndef SHARP_TARGET - SHARP_TARGET:=$(error SHARP_TARGET undefined. Please see README.compilation for help)UNDEFINED -endif - -default: compile_all -SRCROOT:=$(shell pwd) -include $(SRCROOT)/config/config.$(SHARP_TARGET) -include $(SRCROOT)/config/rules.common - -all_hdr:= -all_lib:= -all_cbin:= - -FULL_INCLUDE:= - -include c_utils/planck.make -include libfftpack/planck.make -include libsharp/planck.make -include docsrc/planck.make - -CYTHON_MODULES=python/libsharp/libsharp.so $(if $(MPI_CFLAGS), python/libsharp/libsharp_mpi.so) - -$(all_lib): %: | $(LIBDIR)_mkdir - @echo "# creating library $*" - $(ARCREATE) $@ $^ - -$(all_cbin): %: | $(BINDIR)_mkdir - @echo "# linking C binary $*" - $(CL) -o $@ $^ $(CLFLAGS) - -compile_all: $(all_cbin) hdrcopy - -hdrclean: - @if [ -d $(INCDIR) ]; then rm -rf $(INCDIR)/* ; fi - -hdrcopy: | $(INCDIR)_mkdir - @if [ "$(all_hdr)" ]; then cp -p $(all_hdr) $(INCDIR); fi - -$(notdir $(all_cbin)) : % : $(BINDIR)/% - -test: compile_all - $(BINDIR)/sharp_testsuite acctest && \ - $(BINDIR)/sharp_testsuite test healpix 2048 -1 1024 -1 0 1 && \ - $(BINDIR)/sharp_testsuite test fejer1 2047 -1 -1 4096 2 1 && \ - $(BINDIR)/sharp_testsuite test gauss 2047 -1 -1 4096 0 2 - -perftest: compile_all - $(BINDIR)/sharp_testsuite test healpix 2048 -1 1024 -1 0 1 && \ - $(BINDIR)/sharp_testsuite test gauss 63 -1 -1 128 0 1 && \ - $(BINDIR)/sharp_testsuite test gauss 127 -1 -1 256 0 1 && \ - $(BINDIR)/sharp_testsuite test gauss 255 -1 -1 512 0 1 && \ - $(BINDIR)/sharp_testsuite test gauss 511 -1 -1 1024 0 1 && \ - $(BINDIR)/sharp_testsuite test gauss 1023 -1 -1 2048 0 1 && \ - $(BINDIR)/sharp_testsuite test gauss 2047 -1 -1 4096 0 1 && \ - $(BINDIR)/sharp_testsuite test gauss 4095 -1 -1 8192 0 1 && \ - $(BINDIR)/sharp_testsuite test gauss 8191 -1 -1 16384 0 1 - -%.c: %.c.in -# Only do this if the md5sum changed, in order to avoid Python and Jinja -# dependency when not modifying the c.in file - grep `md5sum $< | cut -d ' ' -f 1` $@ || ./runjinja.py < $< > $@ - -genclean: - rm libsharp/sharp_legendre.c || exit 0 - -$(CYTHON_MODULES): %.so: %.pyx -ifndef PIC_CFLAGS - $(error Python extension must be built using the --enable-pic configure option.) -endif - cython $< - $(CC) $(DEBUG_CFLAGS) $(OPENMP_CFLAGS) $(PIC_CFLAGS) `python-config --cflags` -I$(INCDIR) -o $(<:.pyx=.o) -c $(<:.pyx=.c) - $(CL) -shared $(<:.pyx=.o) $(OPENMP_CFLAGS) $(CYTHON_OBJ) -L$(LIBDIR) -lsharp -lfftpack -lc_utils -L`python-config --prefix`/lib `python-config --ldflags` -o $@ - -python: $(all_lib) hdrcopy $(CYTHON_MODULES) - -pytest: python - cd python && nosetests --nocapture libsharp/tests/test_sht.py diff --git a/external/sharp/README.md b/external/sharp/README.md deleted file mode 100644 index 24652b2..0000000 --- a/external/sharp/README.md +++ /dev/null @@ -1,43 +0,0 @@ -# Libsharp - -*IMPORTANT NOTE*: It appears that the default branch upon cloning from -github.com/dagss/libsharp was an outdated 'dagss' branch instead of -the 'master' branch. To get the latest copy, -please do `git checkout master; git pull`. New clones are no longer affected. - -## Paper - -https://arxiv.org/abs/1303.4945 - -## Compilation - -GNU make is required for compilation. - -Libsharp compilation has been successfully tested with GNU and Intel compilers. -When using gcc, version 4.x is required [1]. -Since libsharp was written in standard C99, other compilers should work fine, -but SSE2/AVX support will most likely be deactivated. - -If you obtained libsharp directly from the git repository, you will also -need a copy of the GNU autotools. In this case, run "autoconf" in libsharp's -main directory before any other steps. -For libsharp releases distributed as a .tar.gz file, this step is not necessary. - -Afterwards, simply run "./configure"; if this fails, please refer to the output -of "./configure --help" for additional hints and, if necessary, provide -additional flags to the configure script. -Once the script finishes successfully, run "make" -(or "gmake"). This should install the compilation products in the -subdirectory "auto/". - -Documentation can be created by the command "(g)make doc". -However this requires the doxygen application to be installed -on your system. -The documentation will be created in the subdirectory doc/. - - -[1] Some versions of the gcc 4.4.x release series contain a bug which causes -the compiler to crash during libsharp compilation. This appears to be fixed -in the gcc 4.4.7 release. It is possible to work around this problem by adding -the compiler flag "-fno-tree-fre" after the other optimization flags - the -configure script should do this automatically. diff --git a/external/sharp/c_utils/c_utils.c b/external/sharp/c_utils/c_utils.c deleted file mode 100644 index 96bd765..0000000 --- a/external/sharp/c_utils/c_utils.c +++ /dev/null @@ -1,81 +0,0 @@ -/* - * This file is part of libc_utils. - * - * libc_utils is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libc_utils is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libc_utils; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libc_utils is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/* - * Convenience functions - * - * Copyright (C) 2008, 2009, 2010, 2011, 2012 Max-Planck-Society - * Author: Martin Reinecke - */ - -#include -#include "c_utils.h" - -void util_fail_ (const char *file, int line, const char *func, const char *msg) - { - fprintf(stderr,"%s, %i (%s):\n%s\n",file,line,func,msg); - exit(1); - } -void util_warn_ (const char *file, int line, const char *func, const char *msg) - { - fprintf(stderr,"%s, %i (%s):\n%s\n",file,line,func,msg); - } - -/* This function tries to avoid allocations with a total size close to a high - power of two (called the "critical stride" here), by adding a few more bytes - if necssary. This lowers the probability that two arrays differ by a multiple - of the critical stride in their starting address, which in turn lowers the - risk of cache line contention. */ -static size_t manipsize(size_t sz) - { - const size_t critical_stride=4096, cacheline=64, overhead=32; - if (sz < (critical_stride/2)) return sz; - if (((sz+overhead)%critical_stride)>(2*cacheline)) return sz; - return sz+2*cacheline; - } - -#ifdef __SSE__ -#include -void *util_malloc_ (size_t sz) - { - void *res; - if (sz==0) return NULL; - res = _mm_malloc(manipsize(sz),16); - UTIL_ASSERT(res,"_mm_malloc() failed"); - return res; - } -void util_free_ (void *ptr) - { if ((ptr)!=NULL) _mm_free(ptr); } -#else -void *util_malloc_ (size_t sz) - { - void *res; - if (sz==0) return NULL; - res = malloc(manipsize(sz)); - UTIL_ASSERT(res,"malloc() failed"); - return res; - } -void util_free_ (void *ptr) - { if ((ptr)!=NULL) free(ptr); } -#endif diff --git a/external/sharp/c_utils/c_utils.h b/external/sharp/c_utils/c_utils.h deleted file mode 100644 index 0503449..0000000 --- a/external/sharp/c_utils/c_utils.h +++ /dev/null @@ -1,147 +0,0 @@ -/* - * This file is part of libc_utils. - * - * libc_utils is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libc_utils is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libc_utils; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libc_utils is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file c_utils.h - * Convenience functions - * - * Copyright (C) 2008, 2009, 2010, 2011 Max-Planck-Society - * \author Martin Reinecke - * \note This file should only be included from .c files, NOT from .h files. - */ - -#ifndef PLANCK_C_UTILS_H -#define PLANCK_C_UTILS_H - -#include -#include -#include - -#ifdef __cplusplus -extern "C" { -#endif - -void util_fail_ (const char *file, int line, const char *func, const char *msg); -void util_warn_ (const char *file, int line, const char *func, const char *msg); -void *util_malloc_ (size_t sz); -void util_free_ (void *ptr); - -#if defined (__GNUC__) -#define UTIL_FUNC_NAME__ __func__ -#else -#define UTIL_FUNC_NAME__ "unknown" -#endif - -/*! \def UTIL_ASSERT(cond,msg) - If \a cond is false, print an error message containing function name, - source file name and line number of the call, as well as \a msg; - then exit the program with an error status. */ -#define UTIL_ASSERT(cond,msg) \ - if(!(cond)) util_fail_(__FILE__,__LINE__,UTIL_FUNC_NAME__,msg) -/*! \def UTIL_WARN(cond,msg) - If \a cond is false, print an warning containing function name, - source file name and line number of the call, as well as \a msg. */ -#define UTIL_WARN(cond,msg) \ - if(!(cond)) util_warn_(__FILE__,__LINE__,UTIL_FUNC_NAME__,msg) -/*! \def UTIL_FAIL(msg) - Print an error message containing function name, - source file name and line number of the call, as well as \a msg; - then exit the program with an error status. */ -#define UTIL_FAIL(msg) \ - util_fail_(__FILE__,__LINE__,UTIL_FUNC_NAME__,msg) - -/*! \def ALLOC(ptr,type,num) - Allocate space for \a num objects of type \a type. Make sure that the - allocation succeeded, else stop the program with an error. Return the - resulting pointer in \a ptr. */ -#define ALLOC(ptr,type,num) \ - do { (ptr)=(type *)util_malloc_((num)*sizeof(type)); } while (0) -/*! \def RALLOC(type,num) - Allocate space for \a num objects of type \a type. Make sure that the - allocation succeeded, else stop the program with an error. Cast the - resulting pointer to \a (type*). */ -#define RALLOC(type,num) \ - ((type *)util_malloc_((num)*sizeof(type))) -/*! \def DEALLOC(ptr) - Deallocate \a ptr. It must have been allocated using \a ALLOC or - \a RALLOC. */ -#define DEALLOC(ptr) \ - do { util_free_(ptr); (ptr)=NULL; } while(0) -#define RESIZE(ptr,type,num) \ - do { util_free_(ptr); ALLOC(ptr,type,num); } while(0) -#define GROW(ptr,type,sz_old,sz_new) \ - do { \ - if ((sz_new)>(sz_old)) \ - { RESIZE(ptr,type,2*(sz_new));sz_old=2*(sz_new); } \ - } while(0) -/*! \def SET_ARRAY(ptr,i1,i2,val) - Set the entries \a ptr[i1] ... \a ptr[i2-1] to \a val. */ -#define SET_ARRAY(ptr,i1,i2,val) \ - do { \ - ptrdiff_t cnt_; \ - for (cnt_=(i1);cnt_<(i2);++cnt_) (ptr)[cnt_]=(val); \ - } while(0) -/*! \def COPY_ARRAY(src,dest,i1,i2) - Copy the entries \a src[i1] ... \a src[i2-1] to - \a dest[i1] ... \a dest[i2-1]. */ -#define COPY_ARRAY(src,dest,i1,i2) \ - do { \ - ptrdiff_t cnt_; \ - for (cnt_=(i1);cnt_<(i2);++cnt_) (dest)[cnt_]=(src)[cnt_]; \ - } while(0) - -#define ALLOC2D(ptr,type,num1,num2) \ - do { \ - size_t cnt_, num1_=(num1), num2_=(num2); \ - ALLOC((ptr),type *,num1_); \ - ALLOC((ptr)[0],type,num1_*num2_); \ - for (cnt_=1; cnt_(b)) ? (a) : (b)) -#define IMIN(a,b) \ - (((a)<(b)) ? (a) : (b)) - -#define SWAP(a,b,type) \ - do { type tmp_=(a); (a)=(b); (b)=tmp_; } while(0) - -#define CHECK_STACK_ALIGN(align) \ - do { \ - double foo; \ - UTIL_WARN((((size_t)(&foo))&(align-1))==0, \ - "WARNING: stack not sufficiently aligned!"); \ - } while(0) - -#ifdef __cplusplus -} -#endif - -#endif diff --git a/external/sharp/c_utils/memusage.c b/external/sharp/c_utils/memusage.c deleted file mode 100644 index a1c25c0..0000000 --- a/external/sharp/c_utils/memusage.c +++ /dev/null @@ -1,68 +0,0 @@ -/* - * This file is part of libc_utils. - * - * libc_utils is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libc_utils is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libc_utils; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libc_utils is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/* - * Functionality for measuring memory consumption - * - * Copyright (C) 2012 Max-Planck-Society - * Author: Martin Reinecke - */ - -#include -#include -#include "memusage.h" - -double residentSetSize(void) - { - FILE *statm = fopen("/proc/self/statm","r"); - double res; - if (!statm) return -1.0; - if (fscanf(statm,"%*f %lf",&res)) - { fclose(statm); return -1.0; } - fclose(statm); - return (res*4096); - } - -double VmHWM(void) - { - char word[1024]; - FILE *f = fopen("/proc/self/status", "r"); - double res; - if (!f) return -1.0; - while(1) - { - if (fscanf (f,"%1023s",word)<0) - { fclose(f); return -1.0; } - if (!strncmp(word, "VmHWM:", 6)) - { - if (fscanf(f,"%lf%2s",&res,word)<0) - { fclose(f); return -1.0; } - if (strncmp(word, "kB", 2)) - { fclose(f); return -1.0; } - res *=1024; - fclose(f); - return res; - } - } - } diff --git a/external/sharp/c_utils/memusage.h b/external/sharp/c_utils/memusage.h deleted file mode 100644 index fa0ac43..0000000 --- a/external/sharp/c_utils/memusage.h +++ /dev/null @@ -1,51 +0,0 @@ -/* - * This file is part of libc_utils. - * - * libc_utils is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libc_utils is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libc_utils; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libc_utils is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file memusage.h - * Functionality for measuring memory consumption - * - * Copyright (C) 2012 Max-Planck-Society - * \author Martin Reinecke - */ - -#ifndef PLANCK_MEMUSAGE_H -#define PLANCK_MEMUSAGE_H - -#ifdef __cplusplus -extern "C" { -#endif - -/*! Returns the current resident set size in bytes. - \note Currently only supported on Linux. Returns -1 if unsupported. */ -double residentSetSize(void); - -/*! Returns the high water mark of the resident set size in bytes. - \note Currently only supported on Linux. Returns -1 if unsupported. */ -double VmHWM(void); - -#ifdef __cplusplus -} -#endif - -#endif diff --git a/external/sharp/c_utils/planck.make b/external/sharp/c_utils/planck.make deleted file mode 100644 index 4f0ccb1..0000000 --- a/external/sharp/c_utils/planck.make +++ /dev/null @@ -1,18 +0,0 @@ -PKG:=c_utils - -SD:=$(SRCROOT)/$(PKG) -OD:=$(BLDROOT)/$(PKG) - -FULL_INCLUDE+= -I$(SD) - -HDR_$(PKG):=$(SD)/*.h -LIB_$(PKG):=$(LIBDIR)/libc_utils.a - -OBJ:=c_utils.o walltime_c.o memusage.o -OBJ:=$(OBJ:%=$(OD)/%) - -$(OBJ): $(HDR_$(PKG)) | $(OD)_mkdir -$(LIB_$(PKG)): $(OBJ) - -all_hdr+=$(HDR_$(PKG)) -all_lib+=$(LIB_$(PKG)) diff --git a/external/sharp/c_utils/walltime_c.c b/external/sharp/c_utils/walltime_c.c deleted file mode 100644 index c9dce3a..0000000 --- a/external/sharp/c_utils/walltime_c.c +++ /dev/null @@ -1,54 +0,0 @@ -/* - * This file is part of libc_utils. - * - * libc_utils is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libc_utils is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libc_utils; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libc_utils is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/* - * Functionality for reading wall clock time - * - * Copyright (C) 2010, 2011 Max-Planck-Society - * Author: Martin Reinecke - */ - -#if defined (_OPENMP) -#include -#elif defined (USE_MPI) -#include "mpi.h" -#else -#include -#include -#endif - -#include "walltime_c.h" - -double wallTime(void) - { -#if defined (_OPENMP) - return omp_get_wtime(); -#elif defined (USE_MPI) - return MPI_Wtime(); -#else - struct timeval t; - gettimeofday(&t, NULL); - return t.tv_sec + 1e-6*t.tv_usec; -#endif - } diff --git a/external/sharp/c_utils/walltime_c.h b/external/sharp/c_utils/walltime_c.h deleted file mode 100644 index c291f17..0000000 --- a/external/sharp/c_utils/walltime_c.h +++ /dev/null @@ -1,54 +0,0 @@ -/* - * This file is part of libc_utils. - * - * libc_utils is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libc_utils is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libc_utils; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libc_utils is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file walltime_c.h - * Functionality for reading wall clock time - * - * Copyright (C) 2010 Max-Planck-Society - * \author Martin Reinecke - */ - -#ifndef PLANCK_WALLTIME_C_H -#define PLANCK_WALLTIME_C_H - -#ifdef __cplusplus -extern "C" { -#endif - -/*! Returns an approximation of the current wall time (in seconds). - The first available of the following timers will be used: -
    -
  • \a omp_get_wtime(), if OpenMP is available -
  • \a MPI_Wtime(), if MPI is available -
  • \a gettimeofday() otherwise -
- \note Only useful for measuring time differences. - \note This function has an execution time between 10 and 100 nanoseconds. */ -double wallTime(void); - -#ifdef __cplusplus -} -#endif - -#endif diff --git a/external/sharp/config/config.auto.in b/external/sharp/config/config.auto.in deleted file mode 100644 index 841cec0..0000000 --- a/external/sharp/config/config.auto.in +++ /dev/null @@ -1,12 +0,0 @@ -@SILENT_RULE@ - -CC=@CC@ -CL=@CC@ -CCFLAGS_NO_C=@CCFLAGS_NO_C@ -CCFLAGS=$(CCFLAGS_NO_C) -c -CLFLAGS=-L. -L$(LIBDIR) @LDCCFLAGS@ -lm -DEBUG_CFLAGS=@DEBUG_CFLAGS@ -MPI_CFLAGS=@MPI_CFLAGS@ -OPENMP_CFLAGS=@OPENMP_CFLAGS@ -PIC_CFLAGS=@PIC_CFLAGS@ -ARCREATE=@ARCREATE@ diff --git a/external/sharp/config/rules.common b/external/sharp/config/rules.common deleted file mode 100644 index bac2a2c..0000000 --- a/external/sharp/config/rules.common +++ /dev/null @@ -1,33 +0,0 @@ -BLDROOT = $(SRCROOT)/build.$(SHARP_TARGET) -PREFIX = $(SRCROOT)/$(SHARP_TARGET) -BINDIR = $(PREFIX)/bin -INCDIR = $(PREFIX)/include -LIBDIR = $(PREFIX)/lib -DOCDIR = $(SRCROOT)/doc -PYTHONDIR = $(SRCROOT)/python/libsharp - -# do not use any suffix rules -.SUFFIXES: -# do not use any default rules -.DEFAULT: - -echo_config: - @echo using configuration \'$(SHARP_TARGET)\' - -$(BLDROOT)/%.o : $(SRCROOT)/%.c | echo_config - @echo "# compiling $*.c" - cd $(@D) && $(CC) $(FULL_INCLUDE) -I$(BLDROOT) $(CCFLAGS) $< - -$(BLDROOT)/%.o : $(SRCROOT)/%.cc | echo_config - @echo "# compiling $*.cc" - cd $(@D) && $(CXX) $(FULL_INCLUDE) -I$(BLDROOT) $(CXXCFLAGS) $< - -%_mkdir: - @if [ ! -d $* ]; then mkdir -p $* ; fi - -clean: - rm -rf $(BLDROOT) $(PREFIX) $(DOCDIR) autom4te.cache/ config.log config.status - rm -rf $(PYTHONDIR)/*.c $(PYTHONDIR)/*.o $(PYTHONDIR)/*.so - -distclean: clean - rm -f config/config.auto diff --git a/external/sharp/configure b/external/sharp/configure deleted file mode 100755 index 58122b4..0000000 --- a/external/sharp/configure +++ /dev/null @@ -1,3984 +0,0 @@ -#! /bin/sh -# Guess values for system-dependent variables and create Makefiles. -# Generated by GNU Autoconf 2.69. -# -# -# Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc. -# -# -# This configure script is free software; the Free Software Foundation -# gives unlimited permission to copy, distribute and modify it. -## -------------------- ## -## M4sh Initialization. ## -## -------------------- ## - -# Be more Bourne compatible -DUALCASE=1; export DUALCASE # for MKS sh -if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : - emulate sh - NULLCMD=: - # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which - # is contrary to our usage. Disable this feature. - alias -g '${1+"$@"}'='"$@"' - setopt NO_GLOB_SUBST -else - case `(set -o) 2>/dev/null` in #( - *posix*) : - set -o posix ;; #( - *) : - ;; -esac -fi - - -as_nl=' -' -export as_nl -# Printing a long string crashes Solaris 7 /usr/bin/printf. -as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' -as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo -as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo -# Prefer a ksh shell builtin over an external printf program on Solaris, -# but without wasting forks for bash or zsh. -if test -z "$BASH_VERSION$ZSH_VERSION" \ - && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then - as_echo='print -r --' - as_echo_n='print -rn --' -elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then - as_echo='printf %s\n' - as_echo_n='printf %s' -else - if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then - as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' - as_echo_n='/usr/ucb/echo -n' - else - as_echo_body='eval expr "X$1" : "X\\(.*\\)"' - as_echo_n_body='eval - arg=$1; - case $arg in #( - *"$as_nl"*) - expr "X$arg" : "X\\(.*\\)$as_nl"; - arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; - esac; - expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" - ' - export as_echo_n_body - as_echo_n='sh -c $as_echo_n_body as_echo' - fi - export as_echo_body - as_echo='sh -c $as_echo_body as_echo' -fi - -# The user is always right. -if test "${PATH_SEPARATOR+set}" != set; then - PATH_SEPARATOR=: - (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { - (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || - PATH_SEPARATOR=';' - } -fi - - -# IFS -# We need space, tab and new line, in precisely that order. Quoting is -# there to prevent editors from complaining about space-tab. -# (If _AS_PATH_WALK were called with IFS unset, it would disable word -# splitting by setting IFS to empty value.) -IFS=" "" $as_nl" - -# Find who we are. Look in the path if we contain no directory separator. -as_myself= -case $0 in #(( - *[\\/]* ) as_myself=$0 ;; - *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR -for as_dir in $PATH -do - IFS=$as_save_IFS - test -z "$as_dir" && as_dir=. - test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break - done -IFS=$as_save_IFS - - ;; -esac -# We did not find ourselves, most probably we were run as `sh COMMAND' -# in which case we are not to be found in the path. -if test "x$as_myself" = x; then - as_myself=$0 -fi -if test ! -f "$as_myself"; then - $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 - exit 1 -fi - -# Unset variables that we do not need and which cause bugs (e.g. in -# pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" -# suppresses any "Segmentation fault" message there. '((' could -# trigger a bug in pdksh 5.2.14. -for as_var in BASH_ENV ENV MAIL MAILPATH -do eval test x\${$as_var+set} = xset \ - && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : -done -PS1='$ ' -PS2='> ' -PS4='+ ' - -# NLS nuisances. -LC_ALL=C -export LC_ALL -LANGUAGE=C -export LANGUAGE - -# CDPATH. -(unset CDPATH) >/dev/null 2>&1 && unset CDPATH - -# Use a proper internal environment variable to ensure we don't fall - # into an infinite loop, continuously re-executing ourselves. - if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then - _as_can_reexec=no; export _as_can_reexec; - # We cannot yet assume a decent shell, so we have to provide a -# neutralization value for shells without unset; and this also -# works around shells that cannot unset nonexistent variables. -# Preserve -v and -x to the replacement shell. -BASH_ENV=/dev/null -ENV=/dev/null -(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV -case $- in # (((( - *v*x* | *x*v* ) as_opts=-vx ;; - *v* ) as_opts=-v ;; - *x* ) as_opts=-x ;; - * ) as_opts= ;; -esac -exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"} -# Admittedly, this is quite paranoid, since all the known shells bail -# out after a failed `exec'. -$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 -as_fn_exit 255 - fi - # We don't want this to propagate to other subprocesses. - { _as_can_reexec=; unset _as_can_reexec;} -if test "x$CONFIG_SHELL" = x; then - as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then : - emulate sh - NULLCMD=: - # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which - # is contrary to our usage. Disable this feature. - alias -g '\${1+\"\$@\"}'='\"\$@\"' - setopt NO_GLOB_SUBST -else - case \`(set -o) 2>/dev/null\` in #( - *posix*) : - set -o posix ;; #( - *) : - ;; -esac -fi -" - as_required="as_fn_return () { (exit \$1); } -as_fn_success () { as_fn_return 0; } -as_fn_failure () { as_fn_return 1; } -as_fn_ret_success () { return 0; } -as_fn_ret_failure () { return 1; } - -exitcode=0 -as_fn_success || { exitcode=1; echo as_fn_success failed.; } -as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; } -as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; } -as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; } -if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then : - -else - exitcode=1; echo positional parameters were not saved. -fi -test x\$exitcode = x0 || exit 1 -test -x / || exit 1" - as_suggested=" as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO - as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO - eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" && - test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1" - if (eval "$as_required") 2>/dev/null; then : - as_have_required=yes -else - as_have_required=no -fi - if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then : - -else - as_save_IFS=$IFS; IFS=$PATH_SEPARATOR -as_found=false -for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH -do - IFS=$as_save_IFS - test -z "$as_dir" && as_dir=. - as_found=: - case $as_dir in #( - /*) - for as_base in sh bash ksh sh5; do - # Try only shells that exist, to save several forks. - as_shell=$as_dir/$as_base - if { test -f "$as_shell" || test -f "$as_shell.exe"; } && - { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then : - CONFIG_SHELL=$as_shell as_have_required=yes - if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then : - break 2 -fi -fi - done;; - esac - as_found=false -done -$as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } && - { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then : - CONFIG_SHELL=$SHELL as_have_required=yes -fi; } -IFS=$as_save_IFS - - - if test "x$CONFIG_SHELL" != x; then : - export CONFIG_SHELL - # We cannot yet assume a decent shell, so we have to provide a -# neutralization value for shells without unset; and this also -# works around shells that cannot unset nonexistent variables. -# Preserve -v and -x to the replacement shell. -BASH_ENV=/dev/null -ENV=/dev/null -(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV -case $- in # (((( - *v*x* | *x*v* ) as_opts=-vx ;; - *v* ) as_opts=-v ;; - *x* ) as_opts=-x ;; - * ) as_opts= ;; -esac -exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"} -# Admittedly, this is quite paranoid, since all the known shells bail -# out after a failed `exec'. -$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 -exit 255 -fi - - if test x$as_have_required = xno; then : - $as_echo "$0: This script requires a shell more modern than all" - $as_echo "$0: the shells that I found on your system." - if test x${ZSH_VERSION+set} = xset ; then - $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should" - $as_echo "$0: be upgraded to zsh 4.3.4 or later." - else - $as_echo "$0: Please tell bug-autoconf@gnu.org about your system, -$0: including any error possibly output before this -$0: message. Then install a modern shell, or manually run -$0: the script under such a shell if you do have one." - fi - exit 1 -fi -fi -fi -SHELL=${CONFIG_SHELL-/bin/sh} -export SHELL -# Unset more variables known to interfere with behavior of common tools. -CLICOLOR_FORCE= GREP_OPTIONS= -unset CLICOLOR_FORCE GREP_OPTIONS - -## --------------------- ## -## M4sh Shell Functions. ## -## --------------------- ## -# as_fn_unset VAR -# --------------- -# Portably unset VAR. -as_fn_unset () -{ - { eval $1=; unset $1;} -} -as_unset=as_fn_unset - -# as_fn_set_status STATUS -# ----------------------- -# Set $? to STATUS, without forking. -as_fn_set_status () -{ - return $1 -} # as_fn_set_status - -# as_fn_exit STATUS -# ----------------- -# Exit the shell with STATUS, even in a "trap 0" or "set -e" context. -as_fn_exit () -{ - set +e - as_fn_set_status $1 - exit $1 -} # as_fn_exit - -# as_fn_mkdir_p -# ------------- -# Create "$as_dir" as a directory, including parents if necessary. -as_fn_mkdir_p () -{ - - case $as_dir in #( - -*) as_dir=./$as_dir;; - esac - test -d "$as_dir" || eval $as_mkdir_p || { - as_dirs= - while :; do - case $as_dir in #( - *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( - *) as_qdir=$as_dir;; - esac - as_dirs="'$as_qdir' $as_dirs" - as_dir=`$as_dirname -- "$as_dir" || -$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ - X"$as_dir" : 'X\(//\)[^/]' \| \ - X"$as_dir" : 'X\(//\)$' \| \ - X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || -$as_echo X"$as_dir" | - sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ - s//\1/ - q - } - /^X\(\/\/\)[^/].*/{ - s//\1/ - q - } - /^X\(\/\/\)$/{ - s//\1/ - q - } - /^X\(\/\).*/{ - s//\1/ - q - } - s/.*/./; q'` - test -d "$as_dir" && break - done - test -z "$as_dirs" || eval "mkdir $as_dirs" - } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" - - -} # as_fn_mkdir_p - -# as_fn_executable_p FILE -# ----------------------- -# Test if FILE is an executable regular file. -as_fn_executable_p () -{ - test -f "$1" && test -x "$1" -} # as_fn_executable_p -# as_fn_append VAR VALUE -# ---------------------- -# Append the text in VALUE to the end of the definition contained in VAR. Take -# advantage of any shell optimizations that allow amortized linear growth over -# repeated appends, instead of the typical quadratic growth present in naive -# implementations. -if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : - eval 'as_fn_append () - { - eval $1+=\$2 - }' -else - as_fn_append () - { - eval $1=\$$1\$2 - } -fi # as_fn_append - -# as_fn_arith ARG... -# ------------------ -# Perform arithmetic evaluation on the ARGs, and store the result in the -# global $as_val. Take advantage of shells that can avoid forks. The arguments -# must be portable across $(()) and expr. -if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : - eval 'as_fn_arith () - { - as_val=$(( $* )) - }' -else - as_fn_arith () - { - as_val=`expr "$@" || test $? -eq 1` - } -fi # as_fn_arith - - -# as_fn_error STATUS ERROR [LINENO LOG_FD] -# ---------------------------------------- -# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are -# provided, also output the error to LOG_FD, referencing LINENO. Then exit the -# script with STATUS, using 1 if that was 0. -as_fn_error () -{ - as_status=$1; test $as_status -eq 0 && as_status=1 - if test "$4"; then - as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack - $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 - fi - $as_echo "$as_me: error: $2" >&2 - as_fn_exit $as_status -} # as_fn_error - -if expr a : '\(a\)' >/dev/null 2>&1 && - test "X`expr 00001 : '.*\(...\)'`" = X001; then - as_expr=expr -else - as_expr=false -fi - -if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then - as_basename=basename -else - as_basename=false -fi - -if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then - as_dirname=dirname -else - as_dirname=false -fi - -as_me=`$as_basename -- "$0" || -$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ - X"$0" : 'X\(//\)$' \| \ - X"$0" : 'X\(/\)' \| . 2>/dev/null || -$as_echo X/"$0" | - sed '/^.*\/\([^/][^/]*\)\/*$/{ - s//\1/ - q - } - /^X\/\(\/\/\)$/{ - s//\1/ - q - } - /^X\/\(\/\).*/{ - s//\1/ - q - } - s/.*/./; q'` - -# Avoid depending upon Character Ranges. -as_cr_letters='abcdefghijklmnopqrstuvwxyz' -as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' -as_cr_Letters=$as_cr_letters$as_cr_LETTERS -as_cr_digits='0123456789' -as_cr_alnum=$as_cr_Letters$as_cr_digits - - - as_lineno_1=$LINENO as_lineno_1a=$LINENO - as_lineno_2=$LINENO as_lineno_2a=$LINENO - eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" && - test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || { - # Blame Lee E. McMahon (1931-1989) for sed's syntax. :-) - sed -n ' - p - /[$]LINENO/= - ' <$as_myself | - sed ' - s/[$]LINENO.*/&-/ - t lineno - b - :lineno - N - :loop - s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/ - t loop - s/-\n.*// - ' >$as_me.lineno && - chmod +x "$as_me.lineno" || - { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; } - - # If we had to re-execute with $CONFIG_SHELL, we're ensured to have - # already done that, so ensure we don't try to do so again and fall - # in an infinite loop. This has already happened in practice. - _as_can_reexec=no; export _as_can_reexec - # Don't try to exec as it changes $[0], causing all sort of problems - # (the dirname of $[0] is not the place where we might find the - # original and so on. Autoconf is especially sensitive to this). - . "./$as_me.lineno" - # Exit status is that of the last command. - exit -} - -ECHO_C= ECHO_N= ECHO_T= -case `echo -n x` in #((((( --n*) - case `echo 'xy\c'` in - *c*) ECHO_T=' ';; # ECHO_T is single tab character. - xy) ECHO_C='\c';; - *) echo `echo ksh88 bug on AIX 6.1` > /dev/null - ECHO_T=' ';; - esac;; -*) - ECHO_N='-n';; -esac - -rm -f conf$$ conf$$.exe conf$$.file -if test -d conf$$.dir; then - rm -f conf$$.dir/conf$$.file -else - rm -f conf$$.dir - mkdir conf$$.dir 2>/dev/null -fi -if (echo >conf$$.file) 2>/dev/null; then - if ln -s conf$$.file conf$$ 2>/dev/null; then - as_ln_s='ln -s' - # ... but there are two gotchas: - # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. - # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. - # In both cases, we have to default to `cp -pR'. - ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || - as_ln_s='cp -pR' - elif ln conf$$.file conf$$ 2>/dev/null; then - as_ln_s=ln - else - as_ln_s='cp -pR' - fi -else - as_ln_s='cp -pR' -fi -rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file -rmdir conf$$.dir 2>/dev/null - -if mkdir -p . 2>/dev/null; then - as_mkdir_p='mkdir -p "$as_dir"' -else - test -d ./-p && rmdir ./-p - as_mkdir_p=false -fi - -as_test_x='test -x' -as_executable_p=as_fn_executable_p - -# Sed expression to map a string onto a valid CPP name. -as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" - -# Sed expression to map a string onto a valid variable name. -as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" - - -test -n "$DJDIR" || exec 7<&0 &1 - -# Name of the host. -# hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status, -# so uname gets run too. -ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q` - -# -# Initializations. -# -ac_default_prefix=/usr/local -ac_clean_files= -ac_config_libobj_dir=. -LIBOBJS= -cross_compiling=no -subdirs= -MFLAGS= -MAKEFLAGS= - -# Identity of this package. -PACKAGE_NAME= -PACKAGE_TARNAME= -PACKAGE_VERSION= -PACKAGE_STRING= -PACKAGE_BUGREPORT= -PACKAGE_URL= - -ac_unique_file="config/config.auto.in" -ac_subst_vars='LTLIBOBJS -LIBOBJS -ARCREATE -PIC_CFLAGS -MPI_CFLAGS -DEBUG_CFLAGS -LDCCFLAGS -CCFLAGS_NO_C -SILENT_RULE -GCCVERSION -OPENMP_CFLAGS -OBJEXT -EXEEXT -ac_ct_CC -CPPFLAGS -LDFLAGS -CFLAGS -CC -uname_found -target_alias -host_alias -build_alias -LIBS -ECHO_T -ECHO_N -ECHO_C -DEFS -mandir -localedir -libdir -psdir -pdfdir -dvidir -htmldir -infodir -docdir -oldincludedir -includedir -localstatedir -sharedstatedir -sysconfdir -datadir -datarootdir -libexecdir -sbindir -bindir -program_transform_name -prefix -exec_prefix -PACKAGE_URL -PACKAGE_BUGREPORT -PACKAGE_STRING -PACKAGE_VERSION -PACKAGE_TARNAME -PACKAGE_NAME -PATH_SEPARATOR -SHELL' -ac_subst_files='' -ac_user_opts=' -enable_option_checking -enable_openmp -enable_noisy_make -enable_mpi -enable_debug -enable_pic -' - ac_precious_vars='build_alias -host_alias -target_alias -CC -CFLAGS -LDFLAGS -LIBS -CPPFLAGS' - - -# Initialize some variables set by options. -ac_init_help= -ac_init_version=false -ac_unrecognized_opts= -ac_unrecognized_sep= -# The variables have the same names as the options, with -# dashes changed to underlines. -cache_file=/dev/null -exec_prefix=NONE -no_create= -no_recursion= -prefix=NONE -program_prefix=NONE -program_suffix=NONE -program_transform_name=s,x,x, -silent= -site= -srcdir= -verbose= -x_includes=NONE -x_libraries=NONE - -# Installation directory options. -# These are left unexpanded so users can "make install exec_prefix=/foo" -# and all the variables that are supposed to be based on exec_prefix -# by default will actually change. -# Use braces instead of parens because sh, perl, etc. also accept them. -# (The list follows the same order as the GNU Coding Standards.) -bindir='${exec_prefix}/bin' -sbindir='${exec_prefix}/sbin' -libexecdir='${exec_prefix}/libexec' -datarootdir='${prefix}/share' -datadir='${datarootdir}' -sysconfdir='${prefix}/etc' -sharedstatedir='${prefix}/com' -localstatedir='${prefix}/var' -includedir='${prefix}/include' -oldincludedir='/usr/include' -docdir='${datarootdir}/doc/${PACKAGE}' -infodir='${datarootdir}/info' -htmldir='${docdir}' -dvidir='${docdir}' -pdfdir='${docdir}' -psdir='${docdir}' -libdir='${exec_prefix}/lib' -localedir='${datarootdir}/locale' -mandir='${datarootdir}/man' - -ac_prev= -ac_dashdash= -for ac_option -do - # If the previous option needs an argument, assign it. - if test -n "$ac_prev"; then - eval $ac_prev=\$ac_option - ac_prev= - continue - fi - - case $ac_option in - *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;; - *=) ac_optarg= ;; - *) ac_optarg=yes ;; - esac - - # Accept the important Cygnus configure options, so we can diagnose typos. - - case $ac_dashdash$ac_option in - --) - ac_dashdash=yes ;; - - -bindir | --bindir | --bindi | --bind | --bin | --bi) - ac_prev=bindir ;; - -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*) - bindir=$ac_optarg ;; - - -build | --build | --buil | --bui | --bu) - ac_prev=build_alias ;; - -build=* | --build=* | --buil=* | --bui=* | --bu=*) - build_alias=$ac_optarg ;; - - -cache-file | --cache-file | --cache-fil | --cache-fi \ - | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) - ac_prev=cache_file ;; - -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ - | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*) - cache_file=$ac_optarg ;; - - --config-cache | -C) - cache_file=config.cache ;; - - -datadir | --datadir | --datadi | --datad) - ac_prev=datadir ;; - -datadir=* | --datadir=* | --datadi=* | --datad=*) - datadir=$ac_optarg ;; - - -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \ - | --dataroo | --dataro | --datar) - ac_prev=datarootdir ;; - -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \ - | --dataroot=* | --dataroo=* | --dataro=* | --datar=*) - datarootdir=$ac_optarg ;; - - -disable-* | --disable-*) - ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'` - # Reject names that are not valid shell variable names. - expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && - as_fn_error $? "invalid feature name: $ac_useropt" - ac_useropt_orig=$ac_useropt - ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` - case $ac_user_opts in - *" -"enable_$ac_useropt" -"*) ;; - *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig" - ac_unrecognized_sep=', ';; - esac - eval enable_$ac_useropt=no ;; - - -docdir | --docdir | --docdi | --doc | --do) - ac_prev=docdir ;; - -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*) - docdir=$ac_optarg ;; - - -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv) - ac_prev=dvidir ;; - -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*) - dvidir=$ac_optarg ;; - - -enable-* | --enable-*) - ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'` - # Reject names that are not valid shell variable names. - expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && - as_fn_error $? "invalid feature name: $ac_useropt" - ac_useropt_orig=$ac_useropt - ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` - case $ac_user_opts in - *" -"enable_$ac_useropt" -"*) ;; - *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig" - ac_unrecognized_sep=', ';; - esac - eval enable_$ac_useropt=\$ac_optarg ;; - - -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \ - | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \ - | --exec | --exe | --ex) - ac_prev=exec_prefix ;; - -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \ - | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \ - | --exec=* | --exe=* | --ex=*) - exec_prefix=$ac_optarg ;; - - -gas | --gas | --ga | --g) - # Obsolete; use --with-gas. - with_gas=yes ;; - - -help | --help | --hel | --he | -h) - ac_init_help=long ;; - -help=r* | --help=r* | --hel=r* | --he=r* | -hr*) - ac_init_help=recursive ;; - -help=s* | --help=s* | --hel=s* | --he=s* | -hs*) - ac_init_help=short ;; - - -host | --host | --hos | --ho) - ac_prev=host_alias ;; - -host=* | --host=* | --hos=* | --ho=*) - host_alias=$ac_optarg ;; - - -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht) - ac_prev=htmldir ;; - -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \ - | --ht=*) - htmldir=$ac_optarg ;; - - -includedir | --includedir | --includedi | --included | --include \ - | --includ | --inclu | --incl | --inc) - ac_prev=includedir ;; - -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \ - | --includ=* | --inclu=* | --incl=* | --inc=*) - includedir=$ac_optarg ;; - - -infodir | --infodir | --infodi | --infod | --info | --inf) - ac_prev=infodir ;; - -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*) - infodir=$ac_optarg ;; - - -libdir | --libdir | --libdi | --libd) - ac_prev=libdir ;; - -libdir=* | --libdir=* | --libdi=* | --libd=*) - libdir=$ac_optarg ;; - - -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \ - | --libexe | --libex | --libe) - ac_prev=libexecdir ;; - -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \ - | --libexe=* | --libex=* | --libe=*) - libexecdir=$ac_optarg ;; - - -localedir | --localedir | --localedi | --localed | --locale) - ac_prev=localedir ;; - -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*) - localedir=$ac_optarg ;; - - -localstatedir | --localstatedir | --localstatedi | --localstated \ - | --localstate | --localstat | --localsta | --localst | --locals) - ac_prev=localstatedir ;; - -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \ - | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*) - localstatedir=$ac_optarg ;; - - -mandir | --mandir | --mandi | --mand | --man | --ma | --m) - ac_prev=mandir ;; - -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*) - mandir=$ac_optarg ;; - - -nfp | --nfp | --nf) - # Obsolete; use --without-fp. - with_fp=no ;; - - -no-create | --no-create | --no-creat | --no-crea | --no-cre \ - | --no-cr | --no-c | -n) - no_create=yes ;; - - -no-recursion | --no-recursion | --no-recursio | --no-recursi \ - | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) - no_recursion=yes ;; - - -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \ - | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \ - | --oldin | --oldi | --old | --ol | --o) - ac_prev=oldincludedir ;; - -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \ - | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \ - | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*) - oldincludedir=$ac_optarg ;; - - -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) - ac_prev=prefix ;; - -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) - prefix=$ac_optarg ;; - - -program-prefix | --program-prefix | --program-prefi | --program-pref \ - | --program-pre | --program-pr | --program-p) - ac_prev=program_prefix ;; - -program-prefix=* | --program-prefix=* | --program-prefi=* \ - | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*) - program_prefix=$ac_optarg ;; - - -program-suffix | --program-suffix | --program-suffi | --program-suff \ - | --program-suf | --program-su | --program-s) - ac_prev=program_suffix ;; - -program-suffix=* | --program-suffix=* | --program-suffi=* \ - | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*) - program_suffix=$ac_optarg ;; - - -program-transform-name | --program-transform-name \ - | --program-transform-nam | --program-transform-na \ - | --program-transform-n | --program-transform- \ - | --program-transform | --program-transfor \ - | --program-transfo | --program-transf \ - | --program-trans | --program-tran \ - | --progr-tra | --program-tr | --program-t) - ac_prev=program_transform_name ;; - -program-transform-name=* | --program-transform-name=* \ - | --program-transform-nam=* | --program-transform-na=* \ - | --program-transform-n=* | --program-transform-=* \ - | --program-transform=* | --program-transfor=* \ - | --program-transfo=* | --program-transf=* \ - | --program-trans=* | --program-tran=* \ - | --progr-tra=* | --program-tr=* | --program-t=*) - program_transform_name=$ac_optarg ;; - - -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd) - ac_prev=pdfdir ;; - -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*) - pdfdir=$ac_optarg ;; - - -psdir | --psdir | --psdi | --psd | --ps) - ac_prev=psdir ;; - -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*) - psdir=$ac_optarg ;; - - -q | -quiet | --quiet | --quie | --qui | --qu | --q \ - | -silent | --silent | --silen | --sile | --sil) - silent=yes ;; - - -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb) - ac_prev=sbindir ;; - -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \ - | --sbi=* | --sb=*) - sbindir=$ac_optarg ;; - - -sharedstatedir | --sharedstatedir | --sharedstatedi \ - | --sharedstated | --sharedstate | --sharedstat | --sharedsta \ - | --sharedst | --shareds | --shared | --share | --shar \ - | --sha | --sh) - ac_prev=sharedstatedir ;; - -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \ - | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \ - | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \ - | --sha=* | --sh=*) - sharedstatedir=$ac_optarg ;; - - -site | --site | --sit) - ac_prev=site ;; - -site=* | --site=* | --sit=*) - site=$ac_optarg ;; - - -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) - ac_prev=srcdir ;; - -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) - srcdir=$ac_optarg ;; - - -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \ - | --syscon | --sysco | --sysc | --sys | --sy) - ac_prev=sysconfdir ;; - -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \ - | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*) - sysconfdir=$ac_optarg ;; - - -target | --target | --targe | --targ | --tar | --ta | --t) - ac_prev=target_alias ;; - -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) - target_alias=$ac_optarg ;; - - -v | -verbose | --verbose | --verbos | --verbo | --verb) - verbose=yes ;; - - -version | --version | --versio | --versi | --vers | -V) - ac_init_version=: ;; - - -with-* | --with-*) - ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'` - # Reject names that are not valid shell variable names. - expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && - as_fn_error $? "invalid package name: $ac_useropt" - ac_useropt_orig=$ac_useropt - ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` - case $ac_user_opts in - *" -"with_$ac_useropt" -"*) ;; - *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig" - ac_unrecognized_sep=', ';; - esac - eval with_$ac_useropt=\$ac_optarg ;; - - -without-* | --without-*) - ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'` - # Reject names that are not valid shell variable names. - expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && - as_fn_error $? "invalid package name: $ac_useropt" - ac_useropt_orig=$ac_useropt - ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` - case $ac_user_opts in - *" -"with_$ac_useropt" -"*) ;; - *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig" - ac_unrecognized_sep=', ';; - esac - eval with_$ac_useropt=no ;; - - --x) - # Obsolete; use --with-x. - with_x=yes ;; - - -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \ - | --x-incl | --x-inc | --x-in | --x-i) - ac_prev=x_includes ;; - -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \ - | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*) - x_includes=$ac_optarg ;; - - -x-libraries | --x-libraries | --x-librarie | --x-librari \ - | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l) - ac_prev=x_libraries ;; - -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \ - | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*) - x_libraries=$ac_optarg ;; - - -*) as_fn_error $? "unrecognized option: \`$ac_option' -Try \`$0 --help' for more information" - ;; - - *=*) - ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='` - # Reject names that are not valid shell variable names. - case $ac_envvar in #( - '' | [0-9]* | *[!_$as_cr_alnum]* ) - as_fn_error $? "invalid variable name: \`$ac_envvar'" ;; - esac - eval $ac_envvar=\$ac_optarg - export $ac_envvar ;; - - *) - # FIXME: should be removed in autoconf 3.0. - $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2 - expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null && - $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2 - : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}" - ;; - - esac -done - -if test -n "$ac_prev"; then - ac_option=--`echo $ac_prev | sed 's/_/-/g'` - as_fn_error $? "missing argument to $ac_option" -fi - -if test -n "$ac_unrecognized_opts"; then - case $enable_option_checking in - no) ;; - fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;; - *) $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;; - esac -fi - -# Check all directory arguments for consistency. -for ac_var in exec_prefix prefix bindir sbindir libexecdir datarootdir \ - datadir sysconfdir sharedstatedir localstatedir includedir \ - oldincludedir docdir infodir htmldir dvidir pdfdir psdir \ - libdir localedir mandir -do - eval ac_val=\$$ac_var - # Remove trailing slashes. - case $ac_val in - */ ) - ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'` - eval $ac_var=\$ac_val;; - esac - # Be sure to have absolute directory names. - case $ac_val in - [\\/$]* | ?:[\\/]* ) continue;; - NONE | '' ) case $ac_var in *prefix ) continue;; esac;; - esac - as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val" -done - -# There might be people who depend on the old broken behavior: `$host' -# used to hold the argument of --host etc. -# FIXME: To remove some day. -build=$build_alias -host=$host_alias -target=$target_alias - -# FIXME: To remove some day. -if test "x$host_alias" != x; then - if test "x$build_alias" = x; then - cross_compiling=maybe - elif test "x$build_alias" != "x$host_alias"; then - cross_compiling=yes - fi -fi - -ac_tool_prefix= -test -n "$host_alias" && ac_tool_prefix=$host_alias- - -test "$silent" = yes && exec 6>/dev/null - - -ac_pwd=`pwd` && test -n "$ac_pwd" && -ac_ls_di=`ls -di .` && -ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` || - as_fn_error $? "working directory cannot be determined" -test "X$ac_ls_di" = "X$ac_pwd_ls_di" || - as_fn_error $? "pwd does not report name of working directory" - - -# Find the source files, if location was not specified. -if test -z "$srcdir"; then - ac_srcdir_defaulted=yes - # Try the directory containing this script, then the parent directory. - ac_confdir=`$as_dirname -- "$as_myself" || -$as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ - X"$as_myself" : 'X\(//\)[^/]' \| \ - X"$as_myself" : 'X\(//\)$' \| \ - X"$as_myself" : 'X\(/\)' \| . 2>/dev/null || -$as_echo X"$as_myself" | - sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ - s//\1/ - q - } - /^X\(\/\/\)[^/].*/{ - s//\1/ - q - } - /^X\(\/\/\)$/{ - s//\1/ - q - } - /^X\(\/\).*/{ - s//\1/ - q - } - s/.*/./; q'` - srcdir=$ac_confdir - if test ! -r "$srcdir/$ac_unique_file"; then - srcdir=.. - fi -else - ac_srcdir_defaulted=no -fi -if test ! -r "$srcdir/$ac_unique_file"; then - test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .." - as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir" -fi -ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work" -ac_abs_confdir=`( - cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg" - pwd)` -# When building in place, set srcdir=. -if test "$ac_abs_confdir" = "$ac_pwd"; then - srcdir=. -fi -# Remove unnecessary trailing slashes from srcdir. -# Double slashes in file names in object file debugging info -# mess up M-x gdb in Emacs. -case $srcdir in -*/) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;; -esac -for ac_var in $ac_precious_vars; do - eval ac_env_${ac_var}_set=\${${ac_var}+set} - eval ac_env_${ac_var}_value=\$${ac_var} - eval ac_cv_env_${ac_var}_set=\${${ac_var}+set} - eval ac_cv_env_${ac_var}_value=\$${ac_var} -done - -# -# Report the --help message. -# -if test "$ac_init_help" = "long"; then - # Omit some internal or obsolete options to make the list less imposing. - # This message is too long to be a string in the A/UX 3.1 sh. - cat <<_ACEOF -\`configure' configures this package to adapt to many kinds of systems. - -Usage: $0 [OPTION]... [VAR=VALUE]... - -To assign environment variables (e.g., CC, CFLAGS...), specify them as -VAR=VALUE. See below for descriptions of some of the useful variables. - -Defaults for the options are specified in brackets. - -Configuration: - -h, --help display this help and exit - --help=short display options specific to this package - --help=recursive display the short help of all the included packages - -V, --version display version information and exit - -q, --quiet, --silent do not print \`checking ...' messages - --cache-file=FILE cache test results in FILE [disabled] - -C, --config-cache alias for \`--cache-file=config.cache' - -n, --no-create do not create output files - --srcdir=DIR find the sources in DIR [configure dir or \`..'] - -Installation directories: - --prefix=PREFIX install architecture-independent files in PREFIX - [$ac_default_prefix] - --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX - [PREFIX] - -By default, \`make install' will install all the files in -\`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify -an installation prefix other than \`$ac_default_prefix' using \`--prefix', -for instance \`--prefix=\$HOME'. - -For better control, use the options below. - -Fine tuning of the installation directories: - --bindir=DIR user executables [EPREFIX/bin] - --sbindir=DIR system admin executables [EPREFIX/sbin] - --libexecdir=DIR program executables [EPREFIX/libexec] - --sysconfdir=DIR read-only single-machine data [PREFIX/etc] - --sharedstatedir=DIR modifiable architecture-independent data [PREFIX/com] - --localstatedir=DIR modifiable single-machine data [PREFIX/var] - --libdir=DIR object code libraries [EPREFIX/lib] - --includedir=DIR C header files [PREFIX/include] - --oldincludedir=DIR C header files for non-gcc [/usr/include] - --datarootdir=DIR read-only arch.-independent data root [PREFIX/share] - --datadir=DIR read-only architecture-independent data [DATAROOTDIR] - --infodir=DIR info documentation [DATAROOTDIR/info] - --localedir=DIR locale-dependent data [DATAROOTDIR/locale] - --mandir=DIR man documentation [DATAROOTDIR/man] - --docdir=DIR documentation root [DATAROOTDIR/doc/PACKAGE] - --htmldir=DIR html documentation [DOCDIR] - --dvidir=DIR dvi documentation [DOCDIR] - --pdfdir=DIR pdf documentation [DOCDIR] - --psdir=DIR ps documentation [DOCDIR] -_ACEOF - - cat <<\_ACEOF -_ACEOF -fi - -if test -n "$ac_init_help"; then - - cat <<\_ACEOF - -Optional Features: - --disable-option-checking ignore unrecognized --enable/--with options - --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) - --enable-FEATURE[=ARG] include FEATURE [ARG=yes] - --disable-openmp do not use OpenMP - --enable-noisy-make enable detailed make output - --enable-mpi enable generation of MPI-parallel code - --enable-debug enable generation of debugging symbols - --enable-pic enable generation of position independent code - -Some influential environment variables: - CC C compiler command - CFLAGS C compiler flags - LDFLAGS linker flags, e.g. -L if you have libraries in a - nonstandard directory - LIBS libraries to pass to the linker, e.g. -l - CPPFLAGS (Objective) C/C++ preprocessor flags, e.g. -I if - you have headers in a nonstandard directory - -Use these variables to override the choices made by `configure' or to help -it to find libraries and programs with nonstandard names/locations. - -Report bugs to the package provider. -_ACEOF -ac_status=$? -fi - -if test "$ac_init_help" = "recursive"; then - # If there are subdirs, report their specific --help. - for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue - test -d "$ac_dir" || - { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } || - continue - ac_builddir=. - -case "$ac_dir" in -.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; -*) - ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` - # A ".." for each directory in $ac_dir_suffix. - ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` - case $ac_top_builddir_sub in - "") ac_top_builddir_sub=. ac_top_build_prefix= ;; - *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; - esac ;; -esac -ac_abs_top_builddir=$ac_pwd -ac_abs_builddir=$ac_pwd$ac_dir_suffix -# for backward compatibility: -ac_top_builddir=$ac_top_build_prefix - -case $srcdir in - .) # We are building in place. - ac_srcdir=. - ac_top_srcdir=$ac_top_builddir_sub - ac_abs_top_srcdir=$ac_pwd ;; - [\\/]* | ?:[\\/]* ) # Absolute name. - ac_srcdir=$srcdir$ac_dir_suffix; - ac_top_srcdir=$srcdir - ac_abs_top_srcdir=$srcdir ;; - *) # Relative name. - ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix - ac_top_srcdir=$ac_top_build_prefix$srcdir - ac_abs_top_srcdir=$ac_pwd/$srcdir ;; -esac -ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix - - cd "$ac_dir" || { ac_status=$?; continue; } - # Check for guested configure. - if test -f "$ac_srcdir/configure.gnu"; then - echo && - $SHELL "$ac_srcdir/configure.gnu" --help=recursive - elif test -f "$ac_srcdir/configure"; then - echo && - $SHELL "$ac_srcdir/configure" --help=recursive - else - $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2 - fi || ac_status=$? - cd "$ac_pwd" || { ac_status=$?; break; } - done -fi - -test -n "$ac_init_help" && exit $ac_status -if $ac_init_version; then - cat <<\_ACEOF -configure -generated by GNU Autoconf 2.69 - -Copyright (C) 2012 Free Software Foundation, Inc. -This configure script is free software; the Free Software Foundation -gives unlimited permission to copy, distribute and modify it. -_ACEOF - exit -fi - -## ------------------------ ## -## Autoconf initialization. ## -## ------------------------ ## - -# ac_fn_c_try_compile LINENO -# -------------------------- -# Try to compile conftest.$ac_ext, and return whether this succeeded. -ac_fn_c_try_compile () -{ - as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack - rm -f conftest.$ac_objext - if { { ac_try="$ac_compile" -case "(($ac_try" in - *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; - *) ac_try_echo=$ac_try;; -esac -eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" -$as_echo "$ac_try_echo"; } >&5 - (eval "$ac_compile") 2>conftest.err - ac_status=$? - if test -s conftest.err; then - grep -v '^ *+' conftest.err >conftest.er1 - cat conftest.er1 >&5 - mv -f conftest.er1 conftest.err - fi - $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 - test $ac_status = 0; } && { - test -z "$ac_c_werror_flag" || - test ! -s conftest.err - } && test -s conftest.$ac_objext; then : - ac_retval=0 -else - $as_echo "$as_me: failed program was:" >&5 -sed 's/^/| /' conftest.$ac_ext >&5 - - ac_retval=1 -fi - eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno - as_fn_set_status $ac_retval - -} # ac_fn_c_try_compile - -# ac_fn_c_try_link LINENO -# ----------------------- -# Try to link conftest.$ac_ext, and return whether this succeeded. -ac_fn_c_try_link () -{ - as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack - rm -f conftest.$ac_objext conftest$ac_exeext - if { { ac_try="$ac_link" -case "(($ac_try" in - *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; - *) ac_try_echo=$ac_try;; -esac -eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" -$as_echo "$ac_try_echo"; } >&5 - (eval "$ac_link") 2>conftest.err - ac_status=$? - if test -s conftest.err; then - grep -v '^ *+' conftest.err >conftest.er1 - cat conftest.er1 >&5 - mv -f conftest.er1 conftest.err - fi - $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 - test $ac_status = 0; } && { - test -z "$ac_c_werror_flag" || - test ! -s conftest.err - } && test -s conftest$ac_exeext && { - test "$cross_compiling" = yes || - test -x conftest$ac_exeext - }; then : - ac_retval=0 -else - $as_echo "$as_me: failed program was:" >&5 -sed 's/^/| /' conftest.$ac_ext >&5 - - ac_retval=1 -fi - # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information - # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would - # interfere with the next link command; also delete a directory that is - # left behind by Apple's compiler. We do this before executing the actions. - rm -rf conftest.dSYM conftest_ipa8_conftest.oo - eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno - as_fn_set_status $ac_retval - -} # ac_fn_c_try_link -cat >config.log <<_ACEOF -This file contains any messages produced by compilers while -running configure, to aid debugging if configure makes a mistake. - -It was created by $as_me, which was -generated by GNU Autoconf 2.69. Invocation command line was - - $ $0 $@ - -_ACEOF -exec 5>>config.log -{ -cat <<_ASUNAME -## --------- ## -## Platform. ## -## --------- ## - -hostname = `(hostname || uname -n) 2>/dev/null | sed 1q` -uname -m = `(uname -m) 2>/dev/null || echo unknown` -uname -r = `(uname -r) 2>/dev/null || echo unknown` -uname -s = `(uname -s) 2>/dev/null || echo unknown` -uname -v = `(uname -v) 2>/dev/null || echo unknown` - -/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown` -/bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown` - -/bin/arch = `(/bin/arch) 2>/dev/null || echo unknown` -/usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown` -/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown` -/usr/bin/hostinfo = `(/usr/bin/hostinfo) 2>/dev/null || echo unknown` -/bin/machine = `(/bin/machine) 2>/dev/null || echo unknown` -/usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown` -/bin/universe = `(/bin/universe) 2>/dev/null || echo unknown` - -_ASUNAME - -as_save_IFS=$IFS; IFS=$PATH_SEPARATOR -for as_dir in $PATH -do - IFS=$as_save_IFS - test -z "$as_dir" && as_dir=. - $as_echo "PATH: $as_dir" - done -IFS=$as_save_IFS - -} >&5 - -cat >&5 <<_ACEOF - - -## ----------- ## -## Core tests. ## -## ----------- ## - -_ACEOF - - -# Keep a trace of the command line. -# Strip out --no-create and --no-recursion so they do not pile up. -# Strip out --silent because we don't want to record it for future runs. -# Also quote any args containing shell meta-characters. -# Make two passes to allow for proper duplicate-argument suppression. -ac_configure_args= -ac_configure_args0= -ac_configure_args1= -ac_must_keep_next=false -for ac_pass in 1 2 -do - for ac_arg - do - case $ac_arg in - -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;; - -q | -quiet | --quiet | --quie | --qui | --qu | --q \ - | -silent | --silent | --silen | --sile | --sil) - continue ;; - *\'*) - ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; - esac - case $ac_pass in - 1) as_fn_append ac_configure_args0 " '$ac_arg'" ;; - 2) - as_fn_append ac_configure_args1 " '$ac_arg'" - if test $ac_must_keep_next = true; then - ac_must_keep_next=false # Got value, back to normal. - else - case $ac_arg in - *=* | --config-cache | -C | -disable-* | --disable-* \ - | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \ - | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \ - | -with-* | --with-* | -without-* | --without-* | --x) - case "$ac_configure_args0 " in - "$ac_configure_args1"*" '$ac_arg' "* ) continue ;; - esac - ;; - -* ) ac_must_keep_next=true ;; - esac - fi - as_fn_append ac_configure_args " '$ac_arg'" - ;; - esac - done -done -{ ac_configure_args0=; unset ac_configure_args0;} -{ ac_configure_args1=; unset ac_configure_args1;} - -# When interrupted or exit'd, cleanup temporary files, and complete -# config.log. We remove comments because anyway the quotes in there -# would cause problems or look ugly. -# WARNING: Use '\'' to represent an apostrophe within the trap. -# WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug. -trap 'exit_status=$? - # Save into config.log some information that might help in debugging. - { - echo - - $as_echo "## ---------------- ## -## Cache variables. ## -## ---------------- ##" - echo - # The following way of writing the cache mishandles newlines in values, -( - for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do - eval ac_val=\$$ac_var - case $ac_val in #( - *${as_nl}*) - case $ac_var in #( - *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 -$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; - esac - case $ac_var in #( - _ | IFS | as_nl) ;; #( - BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( - *) { eval $ac_var=; unset $ac_var;} ;; - esac ;; - esac - done - (set) 2>&1 | - case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #( - *${as_nl}ac_space=\ *) - sed -n \ - "s/'\''/'\''\\\\'\'''\''/g; - s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p" - ;; #( - *) - sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" - ;; - esac | - sort -) - echo - - $as_echo "## ----------------- ## -## Output variables. ## -## ----------------- ##" - echo - for ac_var in $ac_subst_vars - do - eval ac_val=\$$ac_var - case $ac_val in - *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; - esac - $as_echo "$ac_var='\''$ac_val'\''" - done | sort - echo - - if test -n "$ac_subst_files"; then - $as_echo "## ------------------- ## -## File substitutions. ## -## ------------------- ##" - echo - for ac_var in $ac_subst_files - do - eval ac_val=\$$ac_var - case $ac_val in - *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; - esac - $as_echo "$ac_var='\''$ac_val'\''" - done | sort - echo - fi - - if test -s confdefs.h; then - $as_echo "## ----------- ## -## confdefs.h. ## -## ----------- ##" - echo - cat confdefs.h - echo - fi - test "$ac_signal" != 0 && - $as_echo "$as_me: caught signal $ac_signal" - $as_echo "$as_me: exit $exit_status" - } >&5 - rm -f core *.core core.conftest.* && - rm -f -r conftest* confdefs* conf$$* $ac_clean_files && - exit $exit_status -' 0 -for ac_signal in 1 2 13 15; do - trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal -done -ac_signal=0 - -# confdefs.h avoids OS command line length limits that DEFS can exceed. -rm -f -r conftest* confdefs.h - -$as_echo "/* confdefs.h */" > confdefs.h - -# Predefined preprocessor variables. - -cat >>confdefs.h <<_ACEOF -#define PACKAGE_NAME "$PACKAGE_NAME" -_ACEOF - -cat >>confdefs.h <<_ACEOF -#define PACKAGE_TARNAME "$PACKAGE_TARNAME" -_ACEOF - -cat >>confdefs.h <<_ACEOF -#define PACKAGE_VERSION "$PACKAGE_VERSION" -_ACEOF - -cat >>confdefs.h <<_ACEOF -#define PACKAGE_STRING "$PACKAGE_STRING" -_ACEOF - -cat >>confdefs.h <<_ACEOF -#define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT" -_ACEOF - -cat >>confdefs.h <<_ACEOF -#define PACKAGE_URL "$PACKAGE_URL" -_ACEOF - - -# Let the site file select an alternate cache file if it wants to. -# Prefer an explicitly selected file to automatically selected ones. -ac_site_file1=NONE -ac_site_file2=NONE -if test -n "$CONFIG_SITE"; then - # We do not want a PATH search for config.site. - case $CONFIG_SITE in #(( - -*) ac_site_file1=./$CONFIG_SITE;; - */*) ac_site_file1=$CONFIG_SITE;; - *) ac_site_file1=./$CONFIG_SITE;; - esac -elif test "x$prefix" != xNONE; then - ac_site_file1=$prefix/share/config.site - ac_site_file2=$prefix/etc/config.site -else - ac_site_file1=$ac_default_prefix/share/config.site - ac_site_file2=$ac_default_prefix/etc/config.site -fi -for ac_site_file in "$ac_site_file1" "$ac_site_file2" -do - test "x$ac_site_file" = xNONE && continue - if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then - { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5 -$as_echo "$as_me: loading site script $ac_site_file" >&6;} - sed 's/^/| /' "$ac_site_file" >&5 - . "$ac_site_file" \ - || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 -$as_echo "$as_me: error: in \`$ac_pwd':" >&2;} -as_fn_error $? "failed to load site script $ac_site_file -See \`config.log' for more details" "$LINENO" 5; } - fi -done - -if test -r "$cache_file"; then - # Some versions of bash will fail to source /dev/null (special files - # actually), so we avoid doing that. DJGPP emulates it as a regular file. - if test /dev/null != "$cache_file" && test -f "$cache_file"; then - { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5 -$as_echo "$as_me: loading cache $cache_file" >&6;} - case $cache_file in - [\\/]* | ?:[\\/]* ) . "$cache_file";; - *) . "./$cache_file";; - esac - fi -else - { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5 -$as_echo "$as_me: creating cache $cache_file" >&6;} - >$cache_file -fi - -# Check that the precious variables saved in the cache have kept the same -# value. -ac_cache_corrupted=false -for ac_var in $ac_precious_vars; do - eval ac_old_set=\$ac_cv_env_${ac_var}_set - eval ac_new_set=\$ac_env_${ac_var}_set - eval ac_old_val=\$ac_cv_env_${ac_var}_value - eval ac_new_val=\$ac_env_${ac_var}_value - case $ac_old_set,$ac_new_set in - set,) - { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5 -$as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;} - ac_cache_corrupted=: ;; - ,set) - { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5 -$as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;} - ac_cache_corrupted=: ;; - ,);; - *) - if test "x$ac_old_val" != "x$ac_new_val"; then - # differences in whitespace do not lead to failure. - ac_old_val_w=`echo x $ac_old_val` - ac_new_val_w=`echo x $ac_new_val` - if test "$ac_old_val_w" != "$ac_new_val_w"; then - { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5 -$as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;} - ac_cache_corrupted=: - else - { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5 -$as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;} - eval $ac_var=\$ac_old_val - fi - { $as_echo "$as_me:${as_lineno-$LINENO}: former value: \`$ac_old_val'" >&5 -$as_echo "$as_me: former value: \`$ac_old_val'" >&2;} - { $as_echo "$as_me:${as_lineno-$LINENO}: current value: \`$ac_new_val'" >&5 -$as_echo "$as_me: current value: \`$ac_new_val'" >&2;} - fi;; - esac - # Pass precious variables to config.status. - if test "$ac_new_set" = set; then - case $ac_new_val in - *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;; - *) ac_arg=$ac_var=$ac_new_val ;; - esac - case " $ac_configure_args " in - *" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy. - *) as_fn_append ac_configure_args " '$ac_arg'" ;; - esac - fi -done -if $ac_cache_corrupted; then - { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 -$as_echo "$as_me: error: in \`$ac_pwd':" >&2;} - { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5 -$as_echo "$as_me: error: changes in the environment can compromise the build" >&2;} - as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5 -fi -## -------------------- ## -## Main body of script. ## -## -------------------- ## - -ac_ext=c -ac_cpp='$CPP $CPPFLAGS' -ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' -ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' -ac_compiler_gnu=$ac_cv_c_compiler_gnu - - - -# Extract the first word of "uname", so it can be a program name with args. -set dummy uname; ac_word=$2 -{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 -$as_echo_n "checking for $ac_word... " >&6; } -if ${ac_cv_prog_uname_found+:} false; then : - $as_echo_n "(cached) " >&6 -else - if test -n "$uname_found"; then - ac_cv_prog_uname_found="$uname_found" # Let the user override the test. -else -as_save_IFS=$IFS; IFS=$PATH_SEPARATOR -for as_dir in $PATH -do - IFS=$as_save_IFS - test -z "$as_dir" && as_dir=. - for ac_exec_ext in '' $ac_executable_extensions; do - if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then - ac_cv_prog_uname_found="1" - $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 - break 2 - fi -done - done -IFS=$as_save_IFS - - test -z "$ac_cv_prog_uname_found" && ac_cv_prog_uname_found="0" -fi -fi -uname_found=$ac_cv_prog_uname_found -if test -n "$uname_found"; then - { $as_echo "$as_me:${as_lineno-$LINENO}: result: $uname_found" >&5 -$as_echo "$uname_found" >&6; } -else - { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 -$as_echo "no" >&6; } -fi - - -if test $uname_found -eq 0 ; then - echo "No uname found; setting system type to unknown." - system="unknown" -else - system=`uname -s`-`uname -r` -fi -ac_ext=c -ac_cpp='$CPP $CPPFLAGS' -ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' -ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' -ac_compiler_gnu=$ac_cv_c_compiler_gnu - - -ac_ext=c -ac_cpp='$CPP $CPPFLAGS' -ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' -ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' -ac_compiler_gnu=$ac_cv_c_compiler_gnu -if test -n "$ac_tool_prefix"; then - # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args. -set dummy ${ac_tool_prefix}gcc; ac_word=$2 -{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 -$as_echo_n "checking for $ac_word... " >&6; } -if ${ac_cv_prog_CC+:} false; then : - $as_echo_n "(cached) " >&6 -else - if test -n "$CC"; then - ac_cv_prog_CC="$CC" # Let the user override the test. -else -as_save_IFS=$IFS; IFS=$PATH_SEPARATOR -for as_dir in $PATH -do - IFS=$as_save_IFS - test -z "$as_dir" && as_dir=. - for ac_exec_ext in '' $ac_executable_extensions; do - if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then - ac_cv_prog_CC="${ac_tool_prefix}gcc" - $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 - break 2 - fi -done - done -IFS=$as_save_IFS - -fi -fi -CC=$ac_cv_prog_CC -if test -n "$CC"; then - { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 -$as_echo "$CC" >&6; } -else - { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 -$as_echo "no" >&6; } -fi - - -fi -if test -z "$ac_cv_prog_CC"; then - ac_ct_CC=$CC - # Extract the first word of "gcc", so it can be a program name with args. -set dummy gcc; ac_word=$2 -{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 -$as_echo_n "checking for $ac_word... " >&6; } -if ${ac_cv_prog_ac_ct_CC+:} false; then : - $as_echo_n "(cached) " >&6 -else - if test -n "$ac_ct_CC"; then - ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. -else -as_save_IFS=$IFS; IFS=$PATH_SEPARATOR -for as_dir in $PATH -do - IFS=$as_save_IFS - test -z "$as_dir" && as_dir=. - for ac_exec_ext in '' $ac_executable_extensions; do - if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then - ac_cv_prog_ac_ct_CC="gcc" - $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 - break 2 - fi -done - done -IFS=$as_save_IFS - -fi -fi -ac_ct_CC=$ac_cv_prog_ac_ct_CC -if test -n "$ac_ct_CC"; then - { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 -$as_echo "$ac_ct_CC" >&6; } -else - { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 -$as_echo "no" >&6; } -fi - - if test "x$ac_ct_CC" = x; then - CC="" - else - case $cross_compiling:$ac_tool_warned in -yes:) -{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 -$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} -ac_tool_warned=yes ;; -esac - CC=$ac_ct_CC - fi -else - CC="$ac_cv_prog_CC" -fi - -if test -z "$CC"; then - if test -n "$ac_tool_prefix"; then - # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args. -set dummy ${ac_tool_prefix}cc; ac_word=$2 -{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 -$as_echo_n "checking for $ac_word... " >&6; } -if ${ac_cv_prog_CC+:} false; then : - $as_echo_n "(cached) " >&6 -else - if test -n "$CC"; then - ac_cv_prog_CC="$CC" # Let the user override the test. -else -as_save_IFS=$IFS; IFS=$PATH_SEPARATOR -for as_dir in $PATH -do - IFS=$as_save_IFS - test -z "$as_dir" && as_dir=. - for ac_exec_ext in '' $ac_executable_extensions; do - if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then - ac_cv_prog_CC="${ac_tool_prefix}cc" - $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 - break 2 - fi -done - done -IFS=$as_save_IFS - -fi -fi -CC=$ac_cv_prog_CC -if test -n "$CC"; then - { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 -$as_echo "$CC" >&6; } -else - { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 -$as_echo "no" >&6; } -fi - - - fi -fi -if test -z "$CC"; then - # Extract the first word of "cc", so it can be a program name with args. -set dummy cc; ac_word=$2 -{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 -$as_echo_n "checking for $ac_word... " >&6; } -if ${ac_cv_prog_CC+:} false; then : - $as_echo_n "(cached) " >&6 -else - if test -n "$CC"; then - ac_cv_prog_CC="$CC" # Let the user override the test. -else - ac_prog_rejected=no -as_save_IFS=$IFS; IFS=$PATH_SEPARATOR -for as_dir in $PATH -do - IFS=$as_save_IFS - test -z "$as_dir" && as_dir=. - for ac_exec_ext in '' $ac_executable_extensions; do - if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then - if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then - ac_prog_rejected=yes - continue - fi - ac_cv_prog_CC="cc" - $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 - break 2 - fi -done - done -IFS=$as_save_IFS - -if test $ac_prog_rejected = yes; then - # We found a bogon in the path, so make sure we never use it. - set dummy $ac_cv_prog_CC - shift - if test $# != 0; then - # We chose a different compiler from the bogus one. - # However, it has the same basename, so the bogon will be chosen - # first if we set CC to just the basename; use the full file name. - shift - ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@" - fi -fi -fi -fi -CC=$ac_cv_prog_CC -if test -n "$CC"; then - { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 -$as_echo "$CC" >&6; } -else - { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 -$as_echo "no" >&6; } -fi - - -fi -if test -z "$CC"; then - if test -n "$ac_tool_prefix"; then - for ac_prog in cl.exe - do - # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. -set dummy $ac_tool_prefix$ac_prog; ac_word=$2 -{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 -$as_echo_n "checking for $ac_word... " >&6; } -if ${ac_cv_prog_CC+:} false; then : - $as_echo_n "(cached) " >&6 -else - if test -n "$CC"; then - ac_cv_prog_CC="$CC" # Let the user override the test. -else -as_save_IFS=$IFS; IFS=$PATH_SEPARATOR -for as_dir in $PATH -do - IFS=$as_save_IFS - test -z "$as_dir" && as_dir=. - for ac_exec_ext in '' $ac_executable_extensions; do - if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then - ac_cv_prog_CC="$ac_tool_prefix$ac_prog" - $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 - break 2 - fi -done - done -IFS=$as_save_IFS - -fi -fi -CC=$ac_cv_prog_CC -if test -n "$CC"; then - { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 -$as_echo "$CC" >&6; } -else - { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 -$as_echo "no" >&6; } -fi - - - test -n "$CC" && break - done -fi -if test -z "$CC"; then - ac_ct_CC=$CC - for ac_prog in cl.exe -do - # Extract the first word of "$ac_prog", so it can be a program name with args. -set dummy $ac_prog; ac_word=$2 -{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 -$as_echo_n "checking for $ac_word... " >&6; } -if ${ac_cv_prog_ac_ct_CC+:} false; then : - $as_echo_n "(cached) " >&6 -else - if test -n "$ac_ct_CC"; then - ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. -else -as_save_IFS=$IFS; IFS=$PATH_SEPARATOR -for as_dir in $PATH -do - IFS=$as_save_IFS - test -z "$as_dir" && as_dir=. - for ac_exec_ext in '' $ac_executable_extensions; do - if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then - ac_cv_prog_ac_ct_CC="$ac_prog" - $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 - break 2 - fi -done - done -IFS=$as_save_IFS - -fi -fi -ac_ct_CC=$ac_cv_prog_ac_ct_CC -if test -n "$ac_ct_CC"; then - { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 -$as_echo "$ac_ct_CC" >&6; } -else - { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 -$as_echo "no" >&6; } -fi - - - test -n "$ac_ct_CC" && break -done - - if test "x$ac_ct_CC" = x; then - CC="" - else - case $cross_compiling:$ac_tool_warned in -yes:) -{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 -$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} -ac_tool_warned=yes ;; -esac - CC=$ac_ct_CC - fi -fi - -fi - - -test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 -$as_echo "$as_me: error: in \`$ac_pwd':" >&2;} -as_fn_error $? "no acceptable C compiler found in \$PATH -See \`config.log' for more details" "$LINENO" 5; } - -# Provide some information about the compiler. -$as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5 -set X $ac_compile -ac_compiler=$2 -for ac_option in --version -v -V -qversion; do - { { ac_try="$ac_compiler $ac_option >&5" -case "(($ac_try" in - *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; - *) ac_try_echo=$ac_try;; -esac -eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" -$as_echo "$ac_try_echo"; } >&5 - (eval "$ac_compiler $ac_option >&5") 2>conftest.err - ac_status=$? - if test -s conftest.err; then - sed '10a\ -... rest of stderr output deleted ... - 10q' conftest.err >conftest.er1 - cat conftest.er1 >&5 - fi - rm -f conftest.er1 conftest.err - $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 - test $ac_status = 0; } -done - -cat confdefs.h - <<_ACEOF >conftest.$ac_ext -/* end confdefs.h. */ - -int -main () -{ - - ; - return 0; -} -_ACEOF -ac_clean_files_save=$ac_clean_files -ac_clean_files="$ac_clean_files a.out a.out.dSYM a.exe b.out" -# Try to create an executable without -o first, disregard a.out. -# It will help us diagnose broken compilers, and finding out an intuition -# of exeext. -{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler works" >&5 -$as_echo_n "checking whether the C compiler works... " >&6; } -ac_link_default=`$as_echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'` - -# The possible output files: -ac_files="a.out conftest.exe conftest a.exe a_out.exe b.out conftest.*" - -ac_rmfiles= -for ac_file in $ac_files -do - case $ac_file in - *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; - * ) ac_rmfiles="$ac_rmfiles $ac_file";; - esac -done -rm -f $ac_rmfiles - -if { { ac_try="$ac_link_default" -case "(($ac_try" in - *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; - *) ac_try_echo=$ac_try;; -esac -eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" -$as_echo "$ac_try_echo"; } >&5 - (eval "$ac_link_default") 2>&5 - ac_status=$? - $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 - test $ac_status = 0; }; then : - # Autoconf-2.13 could set the ac_cv_exeext variable to `no'. -# So ignore a value of `no', otherwise this would lead to `EXEEXT = no' -# in a Makefile. We should not override ac_cv_exeext if it was cached, -# so that the user can short-circuit this test for compilers unknown to -# Autoconf. -for ac_file in $ac_files '' -do - test -f "$ac_file" || continue - case $ac_file in - *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) - ;; - [ab].out ) - # We found the default executable, but exeext='' is most - # certainly right. - break;; - *.* ) - if test "${ac_cv_exeext+set}" = set && test "$ac_cv_exeext" != no; - then :; else - ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` - fi - # We set ac_cv_exeext here because the later test for it is not - # safe: cross compilers may not add the suffix if given an `-o' - # argument, so we may need to know it at that point already. - # Even if this section looks crufty: it has the advantage of - # actually working. - break;; - * ) - break;; - esac -done -test "$ac_cv_exeext" = no && ac_cv_exeext= - -else - ac_file='' -fi -if test -z "$ac_file"; then : - { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 -$as_echo "no" >&6; } -$as_echo "$as_me: failed program was:" >&5 -sed 's/^/| /' conftest.$ac_ext >&5 - -{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 -$as_echo "$as_me: error: in \`$ac_pwd':" >&2;} -as_fn_error 77 "C compiler cannot create executables -See \`config.log' for more details" "$LINENO" 5; } -else - { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 -$as_echo "yes" >&6; } -fi -{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler default output file name" >&5 -$as_echo_n "checking for C compiler default output file name... " >&6; } -{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_file" >&5 -$as_echo "$ac_file" >&6; } -ac_exeext=$ac_cv_exeext - -rm -f -r a.out a.out.dSYM a.exe conftest$ac_cv_exeext b.out -ac_clean_files=$ac_clean_files_save -{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of executables" >&5 -$as_echo_n "checking for suffix of executables... " >&6; } -if { { ac_try="$ac_link" -case "(($ac_try" in - *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; - *) ac_try_echo=$ac_try;; -esac -eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" -$as_echo "$ac_try_echo"; } >&5 - (eval "$ac_link") 2>&5 - ac_status=$? - $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 - test $ac_status = 0; }; then : - # If both `conftest.exe' and `conftest' are `present' (well, observable) -# catch `conftest.exe'. For instance with Cygwin, `ls conftest' will -# work properly (i.e., refer to `conftest.exe'), while it won't with -# `rm'. -for ac_file in conftest.exe conftest conftest.*; do - test -f "$ac_file" || continue - case $ac_file in - *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; - *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` - break;; - * ) break;; - esac -done -else - { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 -$as_echo "$as_me: error: in \`$ac_pwd':" >&2;} -as_fn_error $? "cannot compute suffix of executables: cannot compile and link -See \`config.log' for more details" "$LINENO" 5; } -fi -rm -f conftest conftest$ac_cv_exeext -{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_exeext" >&5 -$as_echo "$ac_cv_exeext" >&6; } - -rm -f conftest.$ac_ext -EXEEXT=$ac_cv_exeext -ac_exeext=$EXEEXT -cat confdefs.h - <<_ACEOF >conftest.$ac_ext -/* end confdefs.h. */ -#include -int -main () -{ -FILE *f = fopen ("conftest.out", "w"); - return ferror (f) || fclose (f) != 0; - - ; - return 0; -} -_ACEOF -ac_clean_files="$ac_clean_files conftest.out" -# Check that the compiler produces executables we can run. If not, either -# the compiler is broken, or we cross compile. -{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are cross compiling" >&5 -$as_echo_n "checking whether we are cross compiling... " >&6; } -if test "$cross_compiling" != yes; then - { { ac_try="$ac_link" -case "(($ac_try" in - *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; - *) ac_try_echo=$ac_try;; -esac -eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" -$as_echo "$ac_try_echo"; } >&5 - (eval "$ac_link") 2>&5 - ac_status=$? - $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 - test $ac_status = 0; } - if { ac_try='./conftest$ac_cv_exeext' - { { case "(($ac_try" in - *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; - *) ac_try_echo=$ac_try;; -esac -eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" -$as_echo "$ac_try_echo"; } >&5 - (eval "$ac_try") 2>&5 - ac_status=$? - $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 - test $ac_status = 0; }; }; then - cross_compiling=no - else - if test "$cross_compiling" = maybe; then - cross_compiling=yes - else - { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 -$as_echo "$as_me: error: in \`$ac_pwd':" >&2;} -as_fn_error $? "cannot run C compiled programs. -If you meant to cross compile, use \`--host'. -See \`config.log' for more details" "$LINENO" 5; } - fi - fi -fi -{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $cross_compiling" >&5 -$as_echo "$cross_compiling" >&6; } - -rm -f conftest.$ac_ext conftest$ac_cv_exeext conftest.out -ac_clean_files=$ac_clean_files_save -{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of object files" >&5 -$as_echo_n "checking for suffix of object files... " >&6; } -if ${ac_cv_objext+:} false; then : - $as_echo_n "(cached) " >&6 -else - cat confdefs.h - <<_ACEOF >conftest.$ac_ext -/* end confdefs.h. */ - -int -main () -{ - - ; - return 0; -} -_ACEOF -rm -f conftest.o conftest.obj -if { { ac_try="$ac_compile" -case "(($ac_try" in - *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; - *) ac_try_echo=$ac_try;; -esac -eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" -$as_echo "$ac_try_echo"; } >&5 - (eval "$ac_compile") 2>&5 - ac_status=$? - $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 - test $ac_status = 0; }; then : - for ac_file in conftest.o conftest.obj conftest.*; do - test -f "$ac_file" || continue; - case $ac_file in - *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM ) ;; - *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'` - break;; - esac -done -else - $as_echo "$as_me: failed program was:" >&5 -sed 's/^/| /' conftest.$ac_ext >&5 - -{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 -$as_echo "$as_me: error: in \`$ac_pwd':" >&2;} -as_fn_error $? "cannot compute suffix of object files: cannot compile -See \`config.log' for more details" "$LINENO" 5; } -fi -rm -f conftest.$ac_cv_objext conftest.$ac_ext -fi -{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_objext" >&5 -$as_echo "$ac_cv_objext" >&6; } -OBJEXT=$ac_cv_objext -ac_objext=$OBJEXT -{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5 -$as_echo_n "checking whether we are using the GNU C compiler... " >&6; } -if ${ac_cv_c_compiler_gnu+:} false; then : - $as_echo_n "(cached) " >&6 -else - cat confdefs.h - <<_ACEOF >conftest.$ac_ext -/* end confdefs.h. */ - -int -main () -{ -#ifndef __GNUC__ - choke me -#endif - - ; - return 0; -} -_ACEOF -if ac_fn_c_try_compile "$LINENO"; then : - ac_compiler_gnu=yes -else - ac_compiler_gnu=no -fi -rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext -ac_cv_c_compiler_gnu=$ac_compiler_gnu - -fi -{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5 -$as_echo "$ac_cv_c_compiler_gnu" >&6; } -if test $ac_compiler_gnu = yes; then - GCC=yes -else - GCC= -fi -ac_test_CFLAGS=${CFLAGS+set} -ac_save_CFLAGS=$CFLAGS -{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5 -$as_echo_n "checking whether $CC accepts -g... " >&6; } -if ${ac_cv_prog_cc_g+:} false; then : - $as_echo_n "(cached) " >&6 -else - ac_save_c_werror_flag=$ac_c_werror_flag - ac_c_werror_flag=yes - ac_cv_prog_cc_g=no - CFLAGS="-g" - cat confdefs.h - <<_ACEOF >conftest.$ac_ext -/* end confdefs.h. */ - -int -main () -{ - - ; - return 0; -} -_ACEOF -if ac_fn_c_try_compile "$LINENO"; then : - ac_cv_prog_cc_g=yes -else - CFLAGS="" - cat confdefs.h - <<_ACEOF >conftest.$ac_ext -/* end confdefs.h. */ - -int -main () -{ - - ; - return 0; -} -_ACEOF -if ac_fn_c_try_compile "$LINENO"; then : - -else - ac_c_werror_flag=$ac_save_c_werror_flag - CFLAGS="-g" - cat confdefs.h - <<_ACEOF >conftest.$ac_ext -/* end confdefs.h. */ - -int -main () -{ - - ; - return 0; -} -_ACEOF -if ac_fn_c_try_compile "$LINENO"; then : - ac_cv_prog_cc_g=yes -fi -rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext -fi -rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext -fi -rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext - ac_c_werror_flag=$ac_save_c_werror_flag -fi -{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5 -$as_echo "$ac_cv_prog_cc_g" >&6; } -if test "$ac_test_CFLAGS" = set; then - CFLAGS=$ac_save_CFLAGS -elif test $ac_cv_prog_cc_g = yes; then - if test "$GCC" = yes; then - CFLAGS="-g -O2" - else - CFLAGS="-g" - fi -else - if test "$GCC" = yes; then - CFLAGS="-O2" - else - CFLAGS= - fi -fi -{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89" >&5 -$as_echo_n "checking for $CC option to accept ISO C89... " >&6; } -if ${ac_cv_prog_cc_c89+:} false; then : - $as_echo_n "(cached) " >&6 -else - ac_cv_prog_cc_c89=no -ac_save_CC=$CC -cat confdefs.h - <<_ACEOF >conftest.$ac_ext -/* end confdefs.h. */ -#include -#include -struct stat; -/* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ -struct buf { int x; }; -FILE * (*rcsopen) (struct buf *, struct stat *, int); -static char *e (p, i) - char **p; - int i; -{ - return p[i]; -} -static char *f (char * (*g) (char **, int), char **p, ...) -{ - char *s; - va_list v; - va_start (v,p); - s = g (p, va_arg (v,int)); - va_end (v); - return s; -} - -/* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has - function prototypes and stuff, but not '\xHH' hex character constants. - These don't provoke an error unfortunately, instead are silently treated - as 'x'. The following induces an error, until -std is added to get - proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an - array size at least. It's necessary to write '\x00'==0 to get something - that's true only with -std. */ -int osf4_cc_array ['\x00' == 0 ? 1 : -1]; - -/* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters - inside strings and character constants. */ -#define FOO(x) 'x' -int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1]; - -int test (int i, double x); -struct s1 {int (*f) (int a);}; -struct s2 {int (*f) (double a);}; -int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); -int argc; -char **argv; -int -main () -{ -return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; - ; - return 0; -} -_ACEOF -for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \ - -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" -do - CC="$ac_save_CC $ac_arg" - if ac_fn_c_try_compile "$LINENO"; then : - ac_cv_prog_cc_c89=$ac_arg -fi -rm -f core conftest.err conftest.$ac_objext - test "x$ac_cv_prog_cc_c89" != "xno" && break -done -rm -f conftest.$ac_ext -CC=$ac_save_CC - -fi -# AC_CACHE_VAL -case "x$ac_cv_prog_cc_c89" in - x) - { $as_echo "$as_me:${as_lineno-$LINENO}: result: none needed" >&5 -$as_echo "none needed" >&6; } ;; - xno) - { $as_echo "$as_me:${as_lineno-$LINENO}: result: unsupported" >&5 -$as_echo "unsupported" >&6; } ;; - *) - CC="$CC $ac_cv_prog_cc_c89" - { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89" >&5 -$as_echo "$ac_cv_prog_cc_c89" >&6; } ;; -esac -if test "x$ac_cv_prog_cc_c89" != xno; then : - -fi - -ac_ext=c -ac_cpp='$CPP $CPPFLAGS' -ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' -ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' -ac_compiler_gnu=$ac_cv_c_compiler_gnu - - -cat confdefs.h - <<_ACEOF >conftest.$ac_ext -/* end confdefs.h. */ - -int -main () -{ -#ifndef __INTEL_COMPILER -choke me -#endif - ; - return 0; -} -_ACEOF -if ac_fn_c_try_compile "$LINENO"; then : - ICC=yes -else - ICC=no -fi -rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext - -if test $ICC = yes; then GCC=no; fi -CCTYPE=unknown -if test $GCC = yes; then CCTYPE=gcc; fi -if test $ICC = yes; then CCTYPE=icc; fi - - OPENMP_CFLAGS= - # Check whether --enable-openmp was given. -if test "${enable_openmp+set}" = set; then : - enableval=$enable_openmp; -fi - - if test "$enable_openmp" != no; then - { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to support OpenMP" >&5 -$as_echo_n "checking for $CC option to support OpenMP... " >&6; } -if ${ac_cv_prog_c_openmp+:} false; then : - $as_echo_n "(cached) " >&6 -else - cat confdefs.h - <<_ACEOF >conftest.$ac_ext -/* end confdefs.h. */ - -#ifndef _OPENMP - choke me -#endif -#include -int main () { return omp_get_num_threads (); } - -_ACEOF -if ac_fn_c_try_link "$LINENO"; then : - ac_cv_prog_c_openmp='none needed' -else - ac_cv_prog_c_openmp='unsupported' - for ac_option in -fopenmp -xopenmp -openmp -mp -omp -qsmp=omp -homp \ - -Popenmp --openmp; do - ac_save_CFLAGS=$CFLAGS - CFLAGS="$CFLAGS $ac_option" - cat confdefs.h - <<_ACEOF >conftest.$ac_ext -/* end confdefs.h. */ - -#ifndef _OPENMP - choke me -#endif -#include -int main () { return omp_get_num_threads (); } - -_ACEOF -if ac_fn_c_try_link "$LINENO"; then : - ac_cv_prog_c_openmp=$ac_option -fi -rm -f core conftest.err conftest.$ac_objext \ - conftest$ac_exeext conftest.$ac_ext - CFLAGS=$ac_save_CFLAGS - if test "$ac_cv_prog_c_openmp" != unsupported; then - break - fi - done -fi -rm -f core conftest.err conftest.$ac_objext \ - conftest$ac_exeext conftest.$ac_ext -fi -{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_c_openmp" >&5 -$as_echo "$ac_cv_prog_c_openmp" >&6; } - case $ac_cv_prog_c_openmp in #( - "none needed" | unsupported) - ;; #( - *) - OPENMP_CFLAGS=$ac_cv_prog_c_openmp ;; - esac - fi - - - -SILENT_RULE=".SILENT:" -# Check whether --enable-noisy-make was given. -if test "${enable_noisy_make+set}" = set; then : - enableval=$enable_noisy_make; if test "$enableval" = yes; then - SILENT_RULE="" - fi -fi - - -ENABLE_MPI=no -# Check whether --enable-mpi was given. -if test "${enable_mpi+set}" = set; then : - enableval=$enable_mpi; if test "$enableval" = yes; then - ENABLE_MPI=yes - fi -fi - - -ENABLE_DEBUG=no -# Check whether --enable-debug was given. -if test "${enable_debug+set}" = set; then : - enableval=$enable_debug; if test "$enableval" = yes; then - ENABLE_DEBUG=yes - fi -fi - - -ENABLE_PIC=no -# Check whether --enable-pic was given. -if test "${enable_pic+set}" = set; then : - enableval=$enable_pic; if test "$enableval" = yes; then - ENABLE_PIC=yes - fi -fi - - -case $CCTYPE in - gcc) - CCFLAGS="-O3 -fno-tree-vectorize -ffast-math -fomit-frame-pointer -std=c99 -pedantic -Wextra -Wall -Wno-unknown-pragmas -Wshadow -Wmissing-prototypes -Wfatal-errors" - GCCVERSION="`$CC -dumpversion 2>&1`" - echo "Using gcc version $GCCVERSION" - - - gcc43=`echo $GCCVERSION | grep -c '^4\.[3456789]'` - gcc44=`echo $GCCVERSION | grep -c '^4\.4'` - - if test $gcc43 -gt 0; then - CCFLAGS="$CCFLAGS -march=native" - fi - if test $gcc44 -gt 0; then - CCFLAGS="$CCFLAGS -fno-tree-fre" - fi - ;; - icc) - CCFLAGS="-O3 -xHOST -std=c99 -ip -Wbrief -Wall -vec-report0 -openmp-report0 -wd383,981,1419,1572" - ;; - *) - CCFLAGS="-O2" - # Don't do anything now - ;; -esac - -case $system in - Darwin-*) - ARCREATE="libtool -static -o" - ;; - *) - ARCREATE="ar cr" - ;; -esac - -if test $ENABLE_DEBUG = yes; then - DEBUG_CFLAGS="-g" -fi - -if test $ENABLE_PIC = yes; then - PIC_CFLAGS="-fPIC" -fi - -if test $ENABLE_MPI = yes; then - MPI_CFLAGS="-DUSE_MPI" -fi - -CCFLAGS="$CCFLAGS $DEBUG_CFLAGS $OPENMP_CFLAGS $PIC_CFLAGS $MPI_CFLAGS" - -CCFLAGS_NO_C="$CCFLAGS $CPPFLAGS" - -LDCCFLAGS="$LDFLAGS $CCFLAGS" - - - - - - - - - - - -ac_config_files="$ac_config_files config/config.auto" - -cat >confcache <<\_ACEOF -# This file is a shell script that caches the results of configure -# tests run on this system so they can be shared between configure -# scripts and configure runs, see configure's option --config-cache. -# It is not useful on other systems. If it contains results you don't -# want to keep, you may remove or edit it. -# -# config.status only pays attention to the cache file if you give it -# the --recheck option to rerun configure. -# -# `ac_cv_env_foo' variables (set or unset) will be overridden when -# loading this file, other *unset* `ac_cv_foo' will be assigned the -# following values. - -_ACEOF - -# The following way of writing the cache mishandles newlines in values, -# but we know of no workaround that is simple, portable, and efficient. -# So, we kill variables containing newlines. -# Ultrix sh set writes to stderr and can't be redirected directly, -# and sets the high bit in the cache file unless we assign to the vars. -( - for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do - eval ac_val=\$$ac_var - case $ac_val in #( - *${as_nl}*) - case $ac_var in #( - *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 -$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; - esac - case $ac_var in #( - _ | IFS | as_nl) ;; #( - BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( - *) { eval $ac_var=; unset $ac_var;} ;; - esac ;; - esac - done - - (set) 2>&1 | - case $as_nl`(ac_space=' '; set) 2>&1` in #( - *${as_nl}ac_space=\ *) - # `set' does not quote correctly, so add quotes: double-quote - # substitution turns \\\\ into \\, and sed turns \\ into \. - sed -n \ - "s/'/'\\\\''/g; - s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" - ;; #( - *) - # `set' quotes correctly as required by POSIX, so do not add quotes. - sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" - ;; - esac | - sort -) | - sed ' - /^ac_cv_env_/b end - t clear - :clear - s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ - t end - s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ - :end' >>confcache -if diff "$cache_file" confcache >/dev/null 2>&1; then :; else - if test -w "$cache_file"; then - if test "x$cache_file" != "x/dev/null"; then - { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5 -$as_echo "$as_me: updating cache $cache_file" >&6;} - if test ! -f "$cache_file" || test -h "$cache_file"; then - cat confcache >"$cache_file" - else - case $cache_file in #( - */* | ?:*) - mv -f confcache "$cache_file"$$ && - mv -f "$cache_file"$$ "$cache_file" ;; #( - *) - mv -f confcache "$cache_file" ;; - esac - fi - fi - else - { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5 -$as_echo "$as_me: not updating unwritable cache $cache_file" >&6;} - fi -fi -rm -f confcache - -test "x$prefix" = xNONE && prefix=$ac_default_prefix -# Let make expand exec_prefix. -test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' - -# Transform confdefs.h into DEFS. -# Protect against shell expansion while executing Makefile rules. -# Protect against Makefile macro expansion. -# -# If the first sed substitution is executed (which looks for macros that -# take arguments), then branch to the quote section. Otherwise, -# look for a macro that doesn't take arguments. -ac_script=' -:mline -/\\$/{ - N - s,\\\n,, - b mline -} -t clear -:clear -s/^[ ]*#[ ]*define[ ][ ]*\([^ (][^ (]*([^)]*)\)[ ]*\(.*\)/-D\1=\2/g -t quote -s/^[ ]*#[ ]*define[ ][ ]*\([^ ][^ ]*\)[ ]*\(.*\)/-D\1=\2/g -t quote -b any -:quote -s/[ `~#$^&*(){}\\|;'\''"<>?]/\\&/g -s/\[/\\&/g -s/\]/\\&/g -s/\$/$$/g -H -:any -${ - g - s/^\n// - s/\n/ /g - p -} -' -DEFS=`sed -n "$ac_script" confdefs.h` - - -ac_libobjs= -ac_ltlibobjs= -U= -for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue - # 1. Remove the extension, and $U if already installed. - ac_script='s/\$U\././;s/\.o$//;s/\.obj$//' - ac_i=`$as_echo "$ac_i" | sed "$ac_script"` - # 2. Prepend LIBOBJDIR. When used with automake>=1.10 LIBOBJDIR - # will be set to the directory where LIBOBJS objects are built. - as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext" - as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo' -done -LIBOBJS=$ac_libobjs - -LTLIBOBJS=$ac_ltlibobjs - - - -: "${CONFIG_STATUS=./config.status}" -ac_write_fail=0 -ac_clean_files_save=$ac_clean_files -ac_clean_files="$ac_clean_files $CONFIG_STATUS" -{ $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5 -$as_echo "$as_me: creating $CONFIG_STATUS" >&6;} -as_write_fail=0 -cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1 -#! $SHELL -# Generated by $as_me. -# Run this file to recreate the current configuration. -# Compiler output produced by configure, useful for debugging -# configure, is in config.log if it exists. - -debug=false -ac_cs_recheck=false -ac_cs_silent=false - -SHELL=\${CONFIG_SHELL-$SHELL} -export SHELL -_ASEOF -cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1 -## -------------------- ## -## M4sh Initialization. ## -## -------------------- ## - -# Be more Bourne compatible -DUALCASE=1; export DUALCASE # for MKS sh -if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : - emulate sh - NULLCMD=: - # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which - # is contrary to our usage. Disable this feature. - alias -g '${1+"$@"}'='"$@"' - setopt NO_GLOB_SUBST -else - case `(set -o) 2>/dev/null` in #( - *posix*) : - set -o posix ;; #( - *) : - ;; -esac -fi - - -as_nl=' -' -export as_nl -# Printing a long string crashes Solaris 7 /usr/bin/printf. -as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' -as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo -as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo -# Prefer a ksh shell builtin over an external printf program on Solaris, -# but without wasting forks for bash or zsh. -if test -z "$BASH_VERSION$ZSH_VERSION" \ - && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then - as_echo='print -r --' - as_echo_n='print -rn --' -elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then - as_echo='printf %s\n' - as_echo_n='printf %s' -else - if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then - as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' - as_echo_n='/usr/ucb/echo -n' - else - as_echo_body='eval expr "X$1" : "X\\(.*\\)"' - as_echo_n_body='eval - arg=$1; - case $arg in #( - *"$as_nl"*) - expr "X$arg" : "X\\(.*\\)$as_nl"; - arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; - esac; - expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" - ' - export as_echo_n_body - as_echo_n='sh -c $as_echo_n_body as_echo' - fi - export as_echo_body - as_echo='sh -c $as_echo_body as_echo' -fi - -# The user is always right. -if test "${PATH_SEPARATOR+set}" != set; then - PATH_SEPARATOR=: - (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { - (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || - PATH_SEPARATOR=';' - } -fi - - -# IFS -# We need space, tab and new line, in precisely that order. Quoting is -# there to prevent editors from complaining about space-tab. -# (If _AS_PATH_WALK were called with IFS unset, it would disable word -# splitting by setting IFS to empty value.) -IFS=" "" $as_nl" - -# Find who we are. Look in the path if we contain no directory separator. -as_myself= -case $0 in #(( - *[\\/]* ) as_myself=$0 ;; - *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR -for as_dir in $PATH -do - IFS=$as_save_IFS - test -z "$as_dir" && as_dir=. - test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break - done -IFS=$as_save_IFS - - ;; -esac -# We did not find ourselves, most probably we were run as `sh COMMAND' -# in which case we are not to be found in the path. -if test "x$as_myself" = x; then - as_myself=$0 -fi -if test ! -f "$as_myself"; then - $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 - exit 1 -fi - -# Unset variables that we do not need and which cause bugs (e.g. in -# pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" -# suppresses any "Segmentation fault" message there. '((' could -# trigger a bug in pdksh 5.2.14. -for as_var in BASH_ENV ENV MAIL MAILPATH -do eval test x\${$as_var+set} = xset \ - && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : -done -PS1='$ ' -PS2='> ' -PS4='+ ' - -# NLS nuisances. -LC_ALL=C -export LC_ALL -LANGUAGE=C -export LANGUAGE - -# CDPATH. -(unset CDPATH) >/dev/null 2>&1 && unset CDPATH - - -# as_fn_error STATUS ERROR [LINENO LOG_FD] -# ---------------------------------------- -# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are -# provided, also output the error to LOG_FD, referencing LINENO. Then exit the -# script with STATUS, using 1 if that was 0. -as_fn_error () -{ - as_status=$1; test $as_status -eq 0 && as_status=1 - if test "$4"; then - as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack - $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 - fi - $as_echo "$as_me: error: $2" >&2 - as_fn_exit $as_status -} # as_fn_error - - -# as_fn_set_status STATUS -# ----------------------- -# Set $? to STATUS, without forking. -as_fn_set_status () -{ - return $1 -} # as_fn_set_status - -# as_fn_exit STATUS -# ----------------- -# Exit the shell with STATUS, even in a "trap 0" or "set -e" context. -as_fn_exit () -{ - set +e - as_fn_set_status $1 - exit $1 -} # as_fn_exit - -# as_fn_unset VAR -# --------------- -# Portably unset VAR. -as_fn_unset () -{ - { eval $1=; unset $1;} -} -as_unset=as_fn_unset -# as_fn_append VAR VALUE -# ---------------------- -# Append the text in VALUE to the end of the definition contained in VAR. Take -# advantage of any shell optimizations that allow amortized linear growth over -# repeated appends, instead of the typical quadratic growth present in naive -# implementations. -if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : - eval 'as_fn_append () - { - eval $1+=\$2 - }' -else - as_fn_append () - { - eval $1=\$$1\$2 - } -fi # as_fn_append - -# as_fn_arith ARG... -# ------------------ -# Perform arithmetic evaluation on the ARGs, and store the result in the -# global $as_val. Take advantage of shells that can avoid forks. The arguments -# must be portable across $(()) and expr. -if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : - eval 'as_fn_arith () - { - as_val=$(( $* )) - }' -else - as_fn_arith () - { - as_val=`expr "$@" || test $? -eq 1` - } -fi # as_fn_arith - - -if expr a : '\(a\)' >/dev/null 2>&1 && - test "X`expr 00001 : '.*\(...\)'`" = X001; then - as_expr=expr -else - as_expr=false -fi - -if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then - as_basename=basename -else - as_basename=false -fi - -if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then - as_dirname=dirname -else - as_dirname=false -fi - -as_me=`$as_basename -- "$0" || -$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ - X"$0" : 'X\(//\)$' \| \ - X"$0" : 'X\(/\)' \| . 2>/dev/null || -$as_echo X/"$0" | - sed '/^.*\/\([^/][^/]*\)\/*$/{ - s//\1/ - q - } - /^X\/\(\/\/\)$/{ - s//\1/ - q - } - /^X\/\(\/\).*/{ - s//\1/ - q - } - s/.*/./; q'` - -# Avoid depending upon Character Ranges. -as_cr_letters='abcdefghijklmnopqrstuvwxyz' -as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' -as_cr_Letters=$as_cr_letters$as_cr_LETTERS -as_cr_digits='0123456789' -as_cr_alnum=$as_cr_Letters$as_cr_digits - -ECHO_C= ECHO_N= ECHO_T= -case `echo -n x` in #((((( --n*) - case `echo 'xy\c'` in - *c*) ECHO_T=' ';; # ECHO_T is single tab character. - xy) ECHO_C='\c';; - *) echo `echo ksh88 bug on AIX 6.1` > /dev/null - ECHO_T=' ';; - esac;; -*) - ECHO_N='-n';; -esac - -rm -f conf$$ conf$$.exe conf$$.file -if test -d conf$$.dir; then - rm -f conf$$.dir/conf$$.file -else - rm -f conf$$.dir - mkdir conf$$.dir 2>/dev/null -fi -if (echo >conf$$.file) 2>/dev/null; then - if ln -s conf$$.file conf$$ 2>/dev/null; then - as_ln_s='ln -s' - # ... but there are two gotchas: - # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. - # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. - # In both cases, we have to default to `cp -pR'. - ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || - as_ln_s='cp -pR' - elif ln conf$$.file conf$$ 2>/dev/null; then - as_ln_s=ln - else - as_ln_s='cp -pR' - fi -else - as_ln_s='cp -pR' -fi -rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file -rmdir conf$$.dir 2>/dev/null - - -# as_fn_mkdir_p -# ------------- -# Create "$as_dir" as a directory, including parents if necessary. -as_fn_mkdir_p () -{ - - case $as_dir in #( - -*) as_dir=./$as_dir;; - esac - test -d "$as_dir" || eval $as_mkdir_p || { - as_dirs= - while :; do - case $as_dir in #( - *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( - *) as_qdir=$as_dir;; - esac - as_dirs="'$as_qdir' $as_dirs" - as_dir=`$as_dirname -- "$as_dir" || -$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ - X"$as_dir" : 'X\(//\)[^/]' \| \ - X"$as_dir" : 'X\(//\)$' \| \ - X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || -$as_echo X"$as_dir" | - sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ - s//\1/ - q - } - /^X\(\/\/\)[^/].*/{ - s//\1/ - q - } - /^X\(\/\/\)$/{ - s//\1/ - q - } - /^X\(\/\).*/{ - s//\1/ - q - } - s/.*/./; q'` - test -d "$as_dir" && break - done - test -z "$as_dirs" || eval "mkdir $as_dirs" - } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" - - -} # as_fn_mkdir_p -if mkdir -p . 2>/dev/null; then - as_mkdir_p='mkdir -p "$as_dir"' -else - test -d ./-p && rmdir ./-p - as_mkdir_p=false -fi - - -# as_fn_executable_p FILE -# ----------------------- -# Test if FILE is an executable regular file. -as_fn_executable_p () -{ - test -f "$1" && test -x "$1" -} # as_fn_executable_p -as_test_x='test -x' -as_executable_p=as_fn_executable_p - -# Sed expression to map a string onto a valid CPP name. -as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" - -# Sed expression to map a string onto a valid variable name. -as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" - - -exec 6>&1 -## ----------------------------------- ## -## Main body of $CONFIG_STATUS script. ## -## ----------------------------------- ## -_ASEOF -test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1 - -cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 -# Save the log message, to keep $0 and so on meaningful, and to -# report actual input values of CONFIG_FILES etc. instead of their -# values after options handling. -ac_log=" -This file was extended by $as_me, which was -generated by GNU Autoconf 2.69. Invocation command line was - - CONFIG_FILES = $CONFIG_FILES - CONFIG_HEADERS = $CONFIG_HEADERS - CONFIG_LINKS = $CONFIG_LINKS - CONFIG_COMMANDS = $CONFIG_COMMANDS - $ $0 $@ - -on `(hostname || uname -n) 2>/dev/null | sed 1q` -" - -_ACEOF - -case $ac_config_files in *" -"*) set x $ac_config_files; shift; ac_config_files=$*;; -esac - - - -cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 -# Files that config.status was made for. -config_files="$ac_config_files" - -_ACEOF - -cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 -ac_cs_usage="\ -\`$as_me' instantiates files and other configuration actions -from templates according to the current configuration. Unless the files -and actions are specified as TAGs, all are instantiated by default. - -Usage: $0 [OPTION]... [TAG]... - - -h, --help print this help, then exit - -V, --version print version number and configuration settings, then exit - --config print configuration, then exit - -q, --quiet, --silent - do not print progress messages - -d, --debug don't remove temporary files - --recheck update $as_me by reconfiguring in the same conditions - --file=FILE[:TEMPLATE] - instantiate the configuration file FILE - -Configuration files: -$config_files - -Report bugs to the package provider." - -_ACEOF -cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 -ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`" -ac_cs_version="\\ -config.status -configured by $0, generated by GNU Autoconf 2.69, - with options \\"\$ac_cs_config\\" - -Copyright (C) 2012 Free Software Foundation, Inc. -This config.status script is free software; the Free Software Foundation -gives unlimited permission to copy, distribute and modify it." - -ac_pwd='$ac_pwd' -srcdir='$srcdir' -test -n "\$AWK" || AWK=awk -_ACEOF - -cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 -# The default lists apply if the user does not specify any file. -ac_need_defaults=: -while test $# != 0 -do - case $1 in - --*=?*) - ac_option=`expr "X$1" : 'X\([^=]*\)='` - ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'` - ac_shift=: - ;; - --*=) - ac_option=`expr "X$1" : 'X\([^=]*\)='` - ac_optarg= - ac_shift=: - ;; - *) - ac_option=$1 - ac_optarg=$2 - ac_shift=shift - ;; - esac - - case $ac_option in - # Handling of the options. - -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) - ac_cs_recheck=: ;; - --version | --versio | --versi | --vers | --ver | --ve | --v | -V ) - $as_echo "$ac_cs_version"; exit ;; - --config | --confi | --conf | --con | --co | --c ) - $as_echo "$ac_cs_config"; exit ;; - --debug | --debu | --deb | --de | --d | -d ) - debug=: ;; - --file | --fil | --fi | --f ) - $ac_shift - case $ac_optarg in - *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; - '') as_fn_error $? "missing file argument" ;; - esac - as_fn_append CONFIG_FILES " '$ac_optarg'" - ac_need_defaults=false;; - --he | --h | --help | --hel | -h ) - $as_echo "$ac_cs_usage"; exit ;; - -q | -quiet | --quiet | --quie | --qui | --qu | --q \ - | -silent | --silent | --silen | --sile | --sil | --si | --s) - ac_cs_silent=: ;; - - # This is an error. - -*) as_fn_error $? "unrecognized option: \`$1' -Try \`$0 --help' for more information." ;; - - *) as_fn_append ac_config_targets " $1" - ac_need_defaults=false ;; - - esac - shift -done - -ac_configure_extra_args= - -if $ac_cs_silent; then - exec 6>/dev/null - ac_configure_extra_args="$ac_configure_extra_args --silent" -fi - -_ACEOF -cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 -if \$ac_cs_recheck; then - set X $SHELL '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion - shift - \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6 - CONFIG_SHELL='$SHELL' - export CONFIG_SHELL - exec "\$@" -fi - -_ACEOF -cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 -exec 5>>config.log -{ - echo - sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX -## Running $as_me. ## -_ASBOX - $as_echo "$ac_log" -} >&5 - -_ACEOF -cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 -_ACEOF - -cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 - -# Handling of arguments. -for ac_config_target in $ac_config_targets -do - case $ac_config_target in - "config/config.auto") CONFIG_FILES="$CONFIG_FILES config/config.auto" ;; - - *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;; - esac -done - - -# If the user did not use the arguments to specify the items to instantiate, -# then the envvar interface is used. Set only those that are not. -# We use the long form for the default assignment because of an extremely -# bizarre bug on SunOS 4.1.3. -if $ac_need_defaults; then - test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files -fi - -# Have a temporary directory for convenience. Make it in the build tree -# simply because there is no reason against having it here, and in addition, -# creating and moving files from /tmp can sometimes cause problems. -# Hook for its removal unless debugging. -# Note that there is a small window in which the directory will not be cleaned: -# after its creation but before its name has been assigned to `$tmp'. -$debug || -{ - tmp= ac_tmp= - trap 'exit_status=$? - : "${ac_tmp:=$tmp}" - { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status -' 0 - trap 'as_fn_exit 1' 1 2 13 15 -} -# Create a (secure) tmp directory for tmp files. - -{ - tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` && - test -d "$tmp" -} || -{ - tmp=./conf$$-$RANDOM - (umask 077 && mkdir "$tmp") -} || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5 -ac_tmp=$tmp - -# Set up the scripts for CONFIG_FILES section. -# No need to generate them if there are no CONFIG_FILES. -# This happens for instance with `./config.status config.h'. -if test -n "$CONFIG_FILES"; then - - -ac_cr=`echo X | tr X '\015'` -# On cygwin, bash can eat \r inside `` if the user requested igncr. -# But we know of no other shell where ac_cr would be empty at this -# point, so we can use a bashism as a fallback. -if test "x$ac_cr" = x; then - eval ac_cr=\$\'\\r\' -fi -ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' /dev/null` -if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then - ac_cs_awk_cr='\\r' -else - ac_cs_awk_cr=$ac_cr -fi - -echo 'BEGIN {' >"$ac_tmp/subs1.awk" && -_ACEOF - - -{ - echo "cat >conf$$subs.awk <<_ACEOF" && - echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' && - echo "_ACEOF" -} >conf$$subs.sh || - as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 -ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'` -ac_delim='%!_!# ' -for ac_last_try in false false false false false :; do - . ./conf$$subs.sh || - as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 - - ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X` - if test $ac_delim_n = $ac_delim_num; then - break - elif $ac_last_try; then - as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 - else - ac_delim="$ac_delim!$ac_delim _$ac_delim!! " - fi -done -rm -f conf$$subs.sh - -cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 -cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK && -_ACEOF -sed -n ' -h -s/^/S["/; s/!.*/"]=/ -p -g -s/^[^!]*!// -:repl -t repl -s/'"$ac_delim"'$// -t delim -:nl -h -s/\(.\{148\}\)..*/\1/ -t more1 -s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/ -p -n -b repl -:more1 -s/["\\]/\\&/g; s/^/"/; s/$/"\\/ -p -g -s/.\{148\}// -t nl -:delim -h -s/\(.\{148\}\)..*/\1/ -t more2 -s/["\\]/\\&/g; s/^/"/; s/$/"/ -p -b -:more2 -s/["\\]/\\&/g; s/^/"/; s/$/"\\/ -p -g -s/.\{148\}// -t delim -' >$CONFIG_STATUS || ac_write_fail=1 -rm -f conf$$subs.awk -cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 -_ACAWK -cat >>"\$ac_tmp/subs1.awk" <<_ACAWK && - for (key in S) S_is_set[key] = 1 - FS = "" - -} -{ - line = $ 0 - nfields = split(line, field, "@") - substed = 0 - len = length(field[1]) - for (i = 2; i < nfields; i++) { - key = field[i] - keylen = length(key) - if (S_is_set[key]) { - value = S[key] - line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3) - len += length(value) + length(field[++i]) - substed = 1 - } else - len += 1 + keylen - } - - print line -} - -_ACAWK -_ACEOF -cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 -if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then - sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g" -else - cat -fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \ - || as_fn_error $? "could not setup config files machinery" "$LINENO" 5 -_ACEOF - -# VPATH may cause trouble with some makes, so we remove sole $(srcdir), -# ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and -# trailing colons and then remove the whole line if VPATH becomes empty -# (actually we leave an empty line to preserve line numbers). -if test "x$srcdir" = x.; then - ac_vpsub='/^[ ]*VPATH[ ]*=[ ]*/{ -h -s/// -s/^/:/ -s/[ ]*$/:/ -s/:\$(srcdir):/:/g -s/:\${srcdir}:/:/g -s/:@srcdir@:/:/g -s/^:*// -s/:*$// -x -s/\(=[ ]*\).*/\1/ -G -s/\n// -s/^[^=]*=[ ]*$// -}' -fi - -cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 -fi # test -n "$CONFIG_FILES" - - -eval set X " :F $CONFIG_FILES " -shift -for ac_tag -do - case $ac_tag in - :[FHLC]) ac_mode=$ac_tag; continue;; - esac - case $ac_mode$ac_tag in - :[FHL]*:*);; - :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;; - :[FH]-) ac_tag=-:-;; - :[FH]*) ac_tag=$ac_tag:$ac_tag.in;; - esac - ac_save_IFS=$IFS - IFS=: - set x $ac_tag - IFS=$ac_save_IFS - shift - ac_file=$1 - shift - - case $ac_mode in - :L) ac_source=$1;; - :[FH]) - ac_file_inputs= - for ac_f - do - case $ac_f in - -) ac_f="$ac_tmp/stdin";; - *) # Look for the file first in the build tree, then in the source tree - # (if the path is not absolute). The absolute path cannot be DOS-style, - # because $ac_f cannot contain `:'. - test -f "$ac_f" || - case $ac_f in - [\\/$]*) false;; - *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";; - esac || - as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;; - esac - case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac - as_fn_append ac_file_inputs " '$ac_f'" - done - - # Let's still pretend it is `configure' which instantiates (i.e., don't - # use $as_me), people would be surprised to read: - # /* config.h. Generated by config.status. */ - configure_input='Generated from '` - $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g' - `' by configure.' - if test x"$ac_file" != x-; then - configure_input="$ac_file. $configure_input" - { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5 -$as_echo "$as_me: creating $ac_file" >&6;} - fi - # Neutralize special characters interpreted by sed in replacement strings. - case $configure_input in #( - *\&* | *\|* | *\\* ) - ac_sed_conf_input=`$as_echo "$configure_input" | - sed 's/[\\\\&|]/\\\\&/g'`;; #( - *) ac_sed_conf_input=$configure_input;; - esac - - case $ac_tag in - *:-:* | *:-) cat >"$ac_tmp/stdin" \ - || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;; - esac - ;; - esac - - ac_dir=`$as_dirname -- "$ac_file" || -$as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ - X"$ac_file" : 'X\(//\)[^/]' \| \ - X"$ac_file" : 'X\(//\)$' \| \ - X"$ac_file" : 'X\(/\)' \| . 2>/dev/null || -$as_echo X"$ac_file" | - sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ - s//\1/ - q - } - /^X\(\/\/\)[^/].*/{ - s//\1/ - q - } - /^X\(\/\/\)$/{ - s//\1/ - q - } - /^X\(\/\).*/{ - s//\1/ - q - } - s/.*/./; q'` - as_dir="$ac_dir"; as_fn_mkdir_p - ac_builddir=. - -case "$ac_dir" in -.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; -*) - ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` - # A ".." for each directory in $ac_dir_suffix. - ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` - case $ac_top_builddir_sub in - "") ac_top_builddir_sub=. ac_top_build_prefix= ;; - *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; - esac ;; -esac -ac_abs_top_builddir=$ac_pwd -ac_abs_builddir=$ac_pwd$ac_dir_suffix -# for backward compatibility: -ac_top_builddir=$ac_top_build_prefix - -case $srcdir in - .) # We are building in place. - ac_srcdir=. - ac_top_srcdir=$ac_top_builddir_sub - ac_abs_top_srcdir=$ac_pwd ;; - [\\/]* | ?:[\\/]* ) # Absolute name. - ac_srcdir=$srcdir$ac_dir_suffix; - ac_top_srcdir=$srcdir - ac_abs_top_srcdir=$srcdir ;; - *) # Relative name. - ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix - ac_top_srcdir=$ac_top_build_prefix$srcdir - ac_abs_top_srcdir=$ac_pwd/$srcdir ;; -esac -ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix - - - case $ac_mode in - :F) - # - # CONFIG_FILE - # - -_ACEOF - -cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 -# If the template does not know about datarootdir, expand it. -# FIXME: This hack should be removed a few years after 2.60. -ac_datarootdir_hack=; ac_datarootdir_seen= -ac_sed_dataroot=' -/datarootdir/ { - p - q -} -/@datadir@/p -/@docdir@/p -/@infodir@/p -/@localedir@/p -/@mandir@/p' -case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in -*datarootdir*) ac_datarootdir_seen=yes;; -*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*) - { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5 -$as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;} -_ACEOF -cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 - ac_datarootdir_hack=' - s&@datadir@&$datadir&g - s&@docdir@&$docdir&g - s&@infodir@&$infodir&g - s&@localedir@&$localedir&g - s&@mandir@&$mandir&g - s&\\\${datarootdir}&$datarootdir&g' ;; -esac -_ACEOF - -# Neutralize VPATH when `$srcdir' = `.'. -# Shell code in configure.ac might set extrasub. -# FIXME: do we really want to maintain this feature? -cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 -ac_sed_extra="$ac_vpsub -$extrasub -_ACEOF -cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 -:t -/@[a-zA-Z_][a-zA-Z_0-9]*@/!b -s|@configure_input@|$ac_sed_conf_input|;t t -s&@top_builddir@&$ac_top_builddir_sub&;t t -s&@top_build_prefix@&$ac_top_build_prefix&;t t -s&@srcdir@&$ac_srcdir&;t t -s&@abs_srcdir@&$ac_abs_srcdir&;t t -s&@top_srcdir@&$ac_top_srcdir&;t t -s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t -s&@builddir@&$ac_builddir&;t t -s&@abs_builddir@&$ac_abs_builddir&;t t -s&@abs_top_builddir@&$ac_abs_top_builddir&;t t -$ac_datarootdir_hack -" -eval sed \"\$ac_sed_extra\" "$ac_file_inputs" | $AWK -f "$ac_tmp/subs.awk" \ - >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5 - -test -z "$ac_datarootdir_hack$ac_datarootdir_seen" && - { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } && - { ac_out=`sed -n '/^[ ]*datarootdir[ ]*:*=/p' \ - "$ac_tmp/out"`; test -z "$ac_out"; } && - { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir' -which seems to be undefined. Please make sure it is defined" >&5 -$as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir' -which seems to be undefined. Please make sure it is defined" >&2;} - - rm -f "$ac_tmp/stdin" - case $ac_file in - -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";; - *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";; - esac \ - || as_fn_error $? "could not create $ac_file" "$LINENO" 5 - ;; - - - - esac - -done # for ac_tag - - -as_fn_exit 0 -_ACEOF -ac_clean_files=$ac_clean_files_save - -test $ac_write_fail = 0 || - as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5 - - -# configure is writing to config.log, and then calls config.status. -# config.status does its own redirection, appending to config.log. -# Unfortunately, on DOS this fails, as config.log is still kept open -# by configure, so config.status won't be able to write to it; its -# output is simply discarded. So we exec the FD to /dev/null, -# effectively closing config.log, so it can be properly (re)opened and -# appended to by config.status. When coming back to configure, we -# need to make the FD available again. -if test "$no_create" != yes; then - ac_cs_success=: - ac_config_status_args= - test "$silent" = yes && - ac_config_status_args="$ac_config_status_args --quiet" - exec 5>/dev/null - $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false - exec 5>>config.log - # Use ||, not &&, to avoid exiting from the if with $? = 1, which - # would make configure fail if this is the last instruction. - $ac_cs_success || as_fn_exit 1 -fi -if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then - { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5 -$as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;} -fi - diff --git a/external/sharp/configure.ac b/external/sharp/configure.ac deleted file mode 100644 index 79b435e..0000000 --- a/external/sharp/configure.ac +++ /dev/null @@ -1,113 +0,0 @@ -AC_INIT(config/config.auto.in) - -AC_CHECK_PROG([uname_found],[uname],[1],[0]) -if test $uname_found -eq 0 ; then - echo "No uname found; setting system type to unknown." - system="unknown" -else - system=`uname -s`-`uname -r` -fi -AC_LANG([C]) - -AC_TRY_COMPILE([], [@%:@ifndef __INTEL_COMPILER -choke me -@%:@endif], [ICC=[yes]], [ICC=[no]]) - -if test $ICC = yes; then GCC=no; fi -CCTYPE=unknown -if test $GCC = yes; then CCTYPE=gcc; fi -if test $ICC = yes; then CCTYPE=icc; fi -AC_OPENMP - -SILENT_RULE=".SILENT:" -AC_ARG_ENABLE(noisy-make, - [ --enable-noisy-make enable detailed make output], - [if test "$enableval" = yes; then - SILENT_RULE="" - fi]) - -ENABLE_MPI=no -AC_ARG_ENABLE(mpi, - [ --enable-mpi enable generation of MPI-parallel code], - [if test "$enableval" = yes; then - ENABLE_MPI=yes - fi]) - -ENABLE_DEBUG=no -AC_ARG_ENABLE(debug, - [ --enable-debug enable generation of debugging symbols], - [if test "$enableval" = yes; then - ENABLE_DEBUG=yes - fi]) - -ENABLE_PIC=no -AC_ARG_ENABLE(pic, - [ --enable-pic enable generation of position independent code], - [if test "$enableval" = yes; then - ENABLE_PIC=yes - fi]) - -case $CCTYPE in - gcc) - CCFLAGS="-O3 -fno-tree-vectorize -ffast-math -fomit-frame-pointer -std=c99 -pedantic -Wextra -Wall -Wno-unknown-pragmas -Wshadow -Wmissing-prototypes -Wfatal-errors" - GCCVERSION="`$CC -dumpversion 2>&1`" - echo "Using gcc version $GCCVERSION" - AC_SUBST(GCCVERSION) - changequote(,) - gcc43=`echo $GCCVERSION | grep -c '^4\.[3456789]'` - gcc44=`echo $GCCVERSION | grep -c '^4\.4'` - changequote([,]) - if test $gcc43 -gt 0; then - CCFLAGS="$CCFLAGS -march=native" - fi - if test $gcc44 -gt 0; then - CCFLAGS="$CCFLAGS -fno-tree-fre" - fi - ;; - icc) - CCFLAGS="-O3 -xHOST -std=c99 -ip -Wbrief -Wall -vec-report0 -openmp-report0 -wd383,981,1419,1572" - ;; - *) - CCFLAGS="-O2" - # Don't do anything now - ;; -esac - -case $system in - Darwin-*) - ARCREATE="libtool -static -o" - ;; - *) - ARCREATE="ar cr" - ;; -esac - -if test $ENABLE_DEBUG = yes; then - DEBUG_CFLAGS="-g" -fi - -if test $ENABLE_PIC = yes; then - PIC_CFLAGS="-fPIC" -fi - -if test $ENABLE_MPI = yes; then - MPI_CFLAGS="-DUSE_MPI" -fi - -CCFLAGS="$CCFLAGS $DEBUG_CFLAGS $OPENMP_CFLAGS $PIC_CFLAGS $MPI_CFLAGS" - -CCFLAGS_NO_C="$CCFLAGS $CPPFLAGS" - -LDCCFLAGS="$LDFLAGS $CCFLAGS" - -AC_SUBST(SILENT_RULE) -AC_SUBST(CC) -AC_SUBST(CCFLAGS_NO_C) -AC_SUBST(LDCCFLAGS) -AC_SUBST(DEBUG_CFLAGS) -AC_SUBST(MPI_CFLAGS) -AC_SUBST(OPENMP_CFLAGS) -AC_SUBST(PIC_CFLAGS) -AC_SUBST(ARCREATE) - -AC_OUTPUT(config/config.auto) diff --git a/external/sharp/docsrc/c_utils.dox b/external/sharp/docsrc/c_utils.dox deleted file mode 100644 index daf432f..0000000 --- a/external/sharp/docsrc/c_utils.dox +++ /dev/null @@ -1,290 +0,0 @@ -# Doxyfile 1.8.1 - -#--------------------------------------------------------------------------- -# Project related configuration options -#--------------------------------------------------------------------------- -DOXYFILE_ENCODING = UTF-8 -PROJECT_NAME = "LevelS C support library" -PROJECT_NUMBER = 0.1 -PROJECT_BRIEF = -PROJECT_LOGO = -OUTPUT_DIRECTORY = . -CREATE_SUBDIRS = NO -OUTPUT_LANGUAGE = English -BRIEF_MEMBER_DESC = NO -REPEAT_BRIEF = YES -ABBREVIATE_BRIEF = -ALWAYS_DETAILED_SEC = NO -INLINE_INHERITED_MEMB = NO -FULL_PATH_NAMES = NO -STRIP_FROM_PATH = -STRIP_FROM_INC_PATH = -SHORT_NAMES = NO -JAVADOC_AUTOBRIEF = NO -QT_AUTOBRIEF = NO -MULTILINE_CPP_IS_BRIEF = NO -INHERIT_DOCS = YES -SEPARATE_MEMBER_PAGES = NO -TAB_SIZE = 8 -ALIASES = -TCL_SUBST = -OPTIMIZE_OUTPUT_FOR_C = YES -OPTIMIZE_OUTPUT_JAVA = NO -OPTIMIZE_FOR_FORTRAN = NO -OPTIMIZE_OUTPUT_VHDL = NO -EXTENSION_MAPPING = -MARKDOWN_SUPPORT = YES -BUILTIN_STL_SUPPORT = NO -CPP_CLI_SUPPORT = NO -SIP_SUPPORT = NO -IDL_PROPERTY_SUPPORT = YES -DISTRIBUTE_GROUP_DOC = NO -SUBGROUPING = YES -INLINE_GROUPED_CLASSES = NO -INLINE_SIMPLE_STRUCTS = NO -TYPEDEF_HIDES_STRUCT = NO -SYMBOL_CACHE_SIZE = 0 -LOOKUP_CACHE_SIZE = 0 -#--------------------------------------------------------------------------- -# Build related configuration options -#--------------------------------------------------------------------------- -EXTRACT_ALL = NO -EXTRACT_PRIVATE = NO -EXTRACT_PACKAGE = NO -EXTRACT_STATIC = NO -EXTRACT_LOCAL_CLASSES = YES -EXTRACT_LOCAL_METHODS = NO -EXTRACT_ANON_NSPACES = NO -HIDE_UNDOC_MEMBERS = YES -HIDE_UNDOC_CLASSES = YES -HIDE_FRIEND_COMPOUNDS = YES -HIDE_IN_BODY_DOCS = NO -INTERNAL_DOCS = NO -CASE_SENSE_NAMES = YES -HIDE_SCOPE_NAMES = NO -SHOW_INCLUDE_FILES = YES -FORCE_LOCAL_INCLUDES = NO -INLINE_INFO = YES -SORT_MEMBER_DOCS = NO -SORT_BRIEF_DOCS = NO -SORT_MEMBERS_CTORS_1ST = NO -SORT_GROUP_NAMES = NO -SORT_BY_SCOPE_NAME = NO -STRICT_PROTO_MATCHING = NO -GENERATE_TODOLIST = YES -GENERATE_TESTLIST = YES -GENERATE_BUGLIST = YES -GENERATE_DEPRECATEDLIST= YES -ENABLED_SECTIONS = -MAX_INITIALIZER_LINES = 30 -SHOW_USED_FILES = YES -SHOW_FILES = YES -SHOW_NAMESPACES = YES -FILE_VERSION_FILTER = -LAYOUT_FILE = -CITE_BIB_FILES = -#--------------------------------------------------------------------------- -# configuration options related to warning and progress messages -#--------------------------------------------------------------------------- -QUIET = YES -WARNINGS = YES -WARN_IF_UNDOCUMENTED = YES -WARN_IF_DOC_ERROR = YES -WARN_NO_PARAMDOC = NO -WARN_FORMAT = "$file:$line: $text" -WARN_LOGFILE = -#--------------------------------------------------------------------------- -# configuration options related to the input files -#--------------------------------------------------------------------------- -INPUT = ../c_utils -INPUT_ENCODING = UTF-8 -FILE_PATTERNS = *.h \ - *.c \ - *.dox -RECURSIVE = YES -EXCLUDE = -EXCLUDE_SYMLINKS = NO -EXCLUDE_PATTERNS = -EXCLUDE_SYMBOLS = -EXAMPLE_PATH = -EXAMPLE_PATTERNS = -EXAMPLE_RECURSIVE = NO -IMAGE_PATH = -INPUT_FILTER = -FILTER_PATTERNS = -FILTER_SOURCE_FILES = NO -FILTER_SOURCE_PATTERNS = -#--------------------------------------------------------------------------- -# configuration options related to source browsing -#--------------------------------------------------------------------------- -SOURCE_BROWSER = YES -INLINE_SOURCES = NO -STRIP_CODE_COMMENTS = NO -REFERENCED_BY_RELATION = NO -REFERENCES_RELATION = NO -REFERENCES_LINK_SOURCE = YES -USE_HTAGS = NO -VERBATIM_HEADERS = YES -#--------------------------------------------------------------------------- -# configuration options related to the alphabetical class index -#--------------------------------------------------------------------------- -ALPHABETICAL_INDEX = YES -COLS_IN_ALPHA_INDEX = 5 -IGNORE_PREFIX = -#--------------------------------------------------------------------------- -# configuration options related to the HTML output -#--------------------------------------------------------------------------- -GENERATE_HTML = YES -HTML_OUTPUT = htmldoc -HTML_FILE_EXTENSION = .html -HTML_HEADER = -HTML_FOOTER = footer.html -HTML_STYLESHEET = -HTML_EXTRA_FILES = -HTML_COLORSTYLE_HUE = 220 -HTML_COLORSTYLE_SAT = 100 -HTML_COLORSTYLE_GAMMA = 80 -HTML_TIMESTAMP = YES -HTML_DYNAMIC_SECTIONS = NO -HTML_INDEX_NUM_ENTRIES = 100 -GENERATE_DOCSET = NO -DOCSET_FEEDNAME = "Doxygen generated docs" -DOCSET_BUNDLE_ID = org.doxygen.Project -DOCSET_PUBLISHER_ID = org.doxygen.Publisher -DOCSET_PUBLISHER_NAME = Publisher -GENERATE_HTMLHELP = NO -CHM_FILE = -HHC_LOCATION = -GENERATE_CHI = NO -CHM_INDEX_ENCODING = -BINARY_TOC = NO -TOC_EXPAND = NO -GENERATE_QHP = NO -QCH_FILE = -QHP_NAMESPACE = org.doxygen.Project -QHP_VIRTUAL_FOLDER = doc -QHP_CUST_FILTER_NAME = -QHP_CUST_FILTER_ATTRS = -QHP_SECT_FILTER_ATTRS = -QHG_LOCATION = -GENERATE_ECLIPSEHELP = NO -ECLIPSE_DOC_ID = org.doxygen.Project -DISABLE_INDEX = NO -GENERATE_TREEVIEW = NO -ENUM_VALUES_PER_LINE = 4 -TREEVIEW_WIDTH = 250 -EXT_LINKS_IN_WINDOW = NO -FORMULA_FONTSIZE = 10 -FORMULA_TRANSPARENT = YES -USE_MATHJAX = NO -MATHJAX_RELPATH = http://cdn.mathjax.org/mathjax/latest -MATHJAX_EXTENSIONS = -SEARCHENGINE = NO -SERVER_BASED_SEARCH = NO -#--------------------------------------------------------------------------- -# configuration options related to the LaTeX output -#--------------------------------------------------------------------------- -GENERATE_LATEX = NO -LATEX_OUTPUT = latex -LATEX_CMD_NAME = latex -MAKEINDEX_CMD_NAME = makeindex -COMPACT_LATEX = YES -PAPER_TYPE = a4wide -EXTRA_PACKAGES = -LATEX_HEADER = -LATEX_FOOTER = -PDF_HYPERLINKS = YES -USE_PDFLATEX = YES -LATEX_BATCHMODE = NO -LATEX_HIDE_INDICES = NO -LATEX_SOURCE_CODE = NO -LATEX_BIB_STYLE = plain -#--------------------------------------------------------------------------- -# configuration options related to the RTF output -#--------------------------------------------------------------------------- -GENERATE_RTF = NO -RTF_OUTPUT = rtf -COMPACT_RTF = NO -RTF_HYPERLINKS = NO -RTF_STYLESHEET_FILE = -RTF_EXTENSIONS_FILE = -#--------------------------------------------------------------------------- -# configuration options related to the man page output -#--------------------------------------------------------------------------- -GENERATE_MAN = NO -MAN_OUTPUT = man -MAN_EXTENSION = .3 -MAN_LINKS = NO -#--------------------------------------------------------------------------- -# configuration options related to the XML output -#--------------------------------------------------------------------------- -GENERATE_XML = NO -XML_OUTPUT = xml -XML_SCHEMA = -XML_DTD = -XML_PROGRAMLISTING = YES -#--------------------------------------------------------------------------- -# configuration options for the AutoGen Definitions output -#--------------------------------------------------------------------------- -GENERATE_AUTOGEN_DEF = NO -#--------------------------------------------------------------------------- -# configuration options related to the Perl module output -#--------------------------------------------------------------------------- -GENERATE_PERLMOD = NO -PERLMOD_LATEX = NO -PERLMOD_PRETTY = YES -PERLMOD_MAKEVAR_PREFIX = -#--------------------------------------------------------------------------- -# Configuration options related to the preprocessor -#--------------------------------------------------------------------------- -ENABLE_PREPROCESSING = YES -MACRO_EXPANSION = NO -EXPAND_ONLY_PREDEF = NO -SEARCH_INCLUDES = YES -INCLUDE_PATH = -INCLUDE_FILE_PATTERNS = -PREDEFINED = -EXPAND_AS_DEFINED = -SKIP_FUNCTION_MACROS = YES -#--------------------------------------------------------------------------- -# Configuration::additions related to external references -#--------------------------------------------------------------------------- -TAGFILES = -GENERATE_TAGFILE = c_utils.tag -ALLEXTERNALS = NO -EXTERNAL_GROUPS = YES -PERL_PATH = /usr/bin/perl -#--------------------------------------------------------------------------- -# Configuration options related to the dot tool -#--------------------------------------------------------------------------- -CLASS_DIAGRAMS = YES -MSCGEN_PATH = -HIDE_UNDOC_RELATIONS = YES -HAVE_DOT = NO -DOT_NUM_THREADS = 0 -DOT_FONTNAME = FreeSans -DOT_FONTSIZE = 10 -DOT_FONTPATH = -CLASS_GRAPH = YES -COLLABORATION_GRAPH = YES -GROUP_GRAPHS = YES -UML_LOOK = NO -UML_LIMIT_NUM_FIELDS = 10 -TEMPLATE_RELATIONS = YES -INCLUDE_GRAPH = NO -INCLUDED_BY_GRAPH = NO -CALL_GRAPH = NO -CALLER_GRAPH = NO -GRAPHICAL_HIERARCHY = NO -DIRECTORY_GRAPH = YES -DOT_IMAGE_FORMAT = png -INTERACTIVE_SVG = NO -DOT_PATH = -DOTFILE_DIRS = -MSCFILE_DIRS = -DOT_GRAPH_MAX_NODES = 50 -MAX_DOT_GRAPH_DEPTH = 0 -DOT_TRANSPARENT = NO -DOT_MULTI_TARGETS = NO -GENERATE_LEGEND = YES -DOT_CLEANUP = YES diff --git a/external/sharp/docsrc/footer.html b/external/sharp/docsrc/footer.html deleted file mode 100644 index 6f5dbf0..0000000 --- a/external/sharp/docsrc/footer.html +++ /dev/null @@ -1,5 +0,0 @@ -
-Generated on $datetime for $projectname -
- - diff --git a/external/sharp/docsrc/index_code.html b/external/sharp/docsrc/index_code.html deleted file mode 100644 index d8a001d..0000000 --- a/external/sharp/docsrc/index_code.html +++ /dev/null @@ -1,15 +0,0 @@ - - -Libsharp source code documentation - -

Libsharp source code documentation

- -

C interfaces

- - - - diff --git a/external/sharp/docsrc/libfftpack.dox b/external/sharp/docsrc/libfftpack.dox deleted file mode 100644 index 7ff2c23..0000000 --- a/external/sharp/docsrc/libfftpack.dox +++ /dev/null @@ -1,290 +0,0 @@ -# Doxyfile 1.8.1 - -#--------------------------------------------------------------------------- -# Project related configuration options -#--------------------------------------------------------------------------- -DOXYFILE_ENCODING = UTF-8 -PROJECT_NAME = "LevelS FFT library" -PROJECT_NUMBER = 0.1 -PROJECT_BRIEF = -PROJECT_LOGO = -OUTPUT_DIRECTORY = . -CREATE_SUBDIRS = NO -OUTPUT_LANGUAGE = English -BRIEF_MEMBER_DESC = NO -REPEAT_BRIEF = YES -ABBREVIATE_BRIEF = -ALWAYS_DETAILED_SEC = NO -INLINE_INHERITED_MEMB = NO -FULL_PATH_NAMES = NO -STRIP_FROM_PATH = -STRIP_FROM_INC_PATH = -SHORT_NAMES = NO -JAVADOC_AUTOBRIEF = NO -QT_AUTOBRIEF = NO -MULTILINE_CPP_IS_BRIEF = NO -INHERIT_DOCS = YES -SEPARATE_MEMBER_PAGES = NO -TAB_SIZE = 8 -ALIASES = -TCL_SUBST = -OPTIMIZE_OUTPUT_FOR_C = YES -OPTIMIZE_OUTPUT_JAVA = NO -OPTIMIZE_FOR_FORTRAN = NO -OPTIMIZE_OUTPUT_VHDL = NO -EXTENSION_MAPPING = -MARKDOWN_SUPPORT = YES -BUILTIN_STL_SUPPORT = NO -CPP_CLI_SUPPORT = NO -SIP_SUPPORT = NO -IDL_PROPERTY_SUPPORT = YES -DISTRIBUTE_GROUP_DOC = NO -SUBGROUPING = YES -INLINE_GROUPED_CLASSES = NO -INLINE_SIMPLE_STRUCTS = NO -TYPEDEF_HIDES_STRUCT = NO -SYMBOL_CACHE_SIZE = 0 -LOOKUP_CACHE_SIZE = 0 -#--------------------------------------------------------------------------- -# Build related configuration options -#--------------------------------------------------------------------------- -EXTRACT_ALL = NO -EXTRACT_PRIVATE = NO -EXTRACT_PACKAGE = NO -EXTRACT_STATIC = NO -EXTRACT_LOCAL_CLASSES = YES -EXTRACT_LOCAL_METHODS = NO -EXTRACT_ANON_NSPACES = NO -HIDE_UNDOC_MEMBERS = YES -HIDE_UNDOC_CLASSES = YES -HIDE_FRIEND_COMPOUNDS = YES -HIDE_IN_BODY_DOCS = NO -INTERNAL_DOCS = NO -CASE_SENSE_NAMES = YES -HIDE_SCOPE_NAMES = NO -SHOW_INCLUDE_FILES = YES -FORCE_LOCAL_INCLUDES = NO -INLINE_INFO = YES -SORT_MEMBER_DOCS = NO -SORT_BRIEF_DOCS = NO -SORT_MEMBERS_CTORS_1ST = NO -SORT_GROUP_NAMES = NO -SORT_BY_SCOPE_NAME = NO -STRICT_PROTO_MATCHING = NO -GENERATE_TODOLIST = YES -GENERATE_TESTLIST = YES -GENERATE_BUGLIST = YES -GENERATE_DEPRECATEDLIST= YES -ENABLED_SECTIONS = -MAX_INITIALIZER_LINES = 30 -SHOW_USED_FILES = YES -SHOW_FILES = YES -SHOW_NAMESPACES = YES -FILE_VERSION_FILTER = -LAYOUT_FILE = -CITE_BIB_FILES = -#--------------------------------------------------------------------------- -# configuration options related to warning and progress messages -#--------------------------------------------------------------------------- -QUIET = YES -WARNINGS = YES -WARN_IF_UNDOCUMENTED = YES -WARN_IF_DOC_ERROR = YES -WARN_NO_PARAMDOC = NO -WARN_FORMAT = "$file:$line: $text" -WARN_LOGFILE = -#--------------------------------------------------------------------------- -# configuration options related to the input files -#--------------------------------------------------------------------------- -INPUT = ../libfftpack -INPUT_ENCODING = UTF-8 -FILE_PATTERNS = *.h \ - *.c \ - *.dox -RECURSIVE = YES -EXCLUDE = -EXCLUDE_SYMLINKS = NO -EXCLUDE_PATTERNS = -EXCLUDE_SYMBOLS = -EXAMPLE_PATH = -EXAMPLE_PATTERNS = -EXAMPLE_RECURSIVE = NO -IMAGE_PATH = -INPUT_FILTER = -FILTER_PATTERNS = -FILTER_SOURCE_FILES = NO -FILTER_SOURCE_PATTERNS = -#--------------------------------------------------------------------------- -# configuration options related to source browsing -#--------------------------------------------------------------------------- -SOURCE_BROWSER = YES -INLINE_SOURCES = NO -STRIP_CODE_COMMENTS = NO -REFERENCED_BY_RELATION = NO -REFERENCES_RELATION = NO -REFERENCES_LINK_SOURCE = YES -USE_HTAGS = NO -VERBATIM_HEADERS = YES -#--------------------------------------------------------------------------- -# configuration options related to the alphabetical class index -#--------------------------------------------------------------------------- -ALPHABETICAL_INDEX = YES -COLS_IN_ALPHA_INDEX = 5 -IGNORE_PREFIX = -#--------------------------------------------------------------------------- -# configuration options related to the HTML output -#--------------------------------------------------------------------------- -GENERATE_HTML = YES -HTML_OUTPUT = htmldoc -HTML_FILE_EXTENSION = .html -HTML_HEADER = -HTML_FOOTER = footer.html -HTML_STYLESHEET = -HTML_EXTRA_FILES = -HTML_COLORSTYLE_HUE = 220 -HTML_COLORSTYLE_SAT = 100 -HTML_COLORSTYLE_GAMMA = 80 -HTML_TIMESTAMP = YES -HTML_DYNAMIC_SECTIONS = NO -HTML_INDEX_NUM_ENTRIES = 100 -GENERATE_DOCSET = NO -DOCSET_FEEDNAME = "Doxygen generated docs" -DOCSET_BUNDLE_ID = org.doxygen.Project -DOCSET_PUBLISHER_ID = org.doxygen.Publisher -DOCSET_PUBLISHER_NAME = Publisher -GENERATE_HTMLHELP = NO -CHM_FILE = -HHC_LOCATION = -GENERATE_CHI = NO -CHM_INDEX_ENCODING = -BINARY_TOC = NO -TOC_EXPAND = NO -GENERATE_QHP = NO -QCH_FILE = -QHP_NAMESPACE = org.doxygen.Project -QHP_VIRTUAL_FOLDER = doc -QHP_CUST_FILTER_NAME = -QHP_CUST_FILTER_ATTRS = -QHP_SECT_FILTER_ATTRS = -QHG_LOCATION = -GENERATE_ECLIPSEHELP = NO -ECLIPSE_DOC_ID = org.doxygen.Project -DISABLE_INDEX = NO -GENERATE_TREEVIEW = NO -ENUM_VALUES_PER_LINE = 4 -TREEVIEW_WIDTH = 250 -EXT_LINKS_IN_WINDOW = NO -FORMULA_FONTSIZE = 10 -FORMULA_TRANSPARENT = YES -USE_MATHJAX = NO -MATHJAX_RELPATH = http://cdn.mathjax.org/mathjax/latest -MATHJAX_EXTENSIONS = -SEARCHENGINE = NO -SERVER_BASED_SEARCH = NO -#--------------------------------------------------------------------------- -# configuration options related to the LaTeX output -#--------------------------------------------------------------------------- -GENERATE_LATEX = NO -LATEX_OUTPUT = latex -LATEX_CMD_NAME = latex -MAKEINDEX_CMD_NAME = makeindex -COMPACT_LATEX = YES -PAPER_TYPE = a4wide -EXTRA_PACKAGES = -LATEX_HEADER = -LATEX_FOOTER = -PDF_HYPERLINKS = YES -USE_PDFLATEX = YES -LATEX_BATCHMODE = NO -LATEX_HIDE_INDICES = NO -LATEX_SOURCE_CODE = NO -LATEX_BIB_STYLE = plain -#--------------------------------------------------------------------------- -# configuration options related to the RTF output -#--------------------------------------------------------------------------- -GENERATE_RTF = NO -RTF_OUTPUT = rtf -COMPACT_RTF = NO -RTF_HYPERLINKS = NO -RTF_STYLESHEET_FILE = -RTF_EXTENSIONS_FILE = -#--------------------------------------------------------------------------- -# configuration options related to the man page output -#--------------------------------------------------------------------------- -GENERATE_MAN = NO -MAN_OUTPUT = man -MAN_EXTENSION = .3 -MAN_LINKS = NO -#--------------------------------------------------------------------------- -# configuration options related to the XML output -#--------------------------------------------------------------------------- -GENERATE_XML = NO -XML_OUTPUT = xml -XML_SCHEMA = -XML_DTD = -XML_PROGRAMLISTING = YES -#--------------------------------------------------------------------------- -# configuration options for the AutoGen Definitions output -#--------------------------------------------------------------------------- -GENERATE_AUTOGEN_DEF = NO -#--------------------------------------------------------------------------- -# configuration options related to the Perl module output -#--------------------------------------------------------------------------- -GENERATE_PERLMOD = NO -PERLMOD_LATEX = NO -PERLMOD_PRETTY = YES -PERLMOD_MAKEVAR_PREFIX = -#--------------------------------------------------------------------------- -# Configuration options related to the preprocessor -#--------------------------------------------------------------------------- -ENABLE_PREPROCESSING = YES -MACRO_EXPANSION = NO -EXPAND_ONLY_PREDEF = NO -SEARCH_INCLUDES = YES -INCLUDE_PATH = -INCLUDE_FILE_PATTERNS = -PREDEFINED = -EXPAND_AS_DEFINED = -SKIP_FUNCTION_MACROS = YES -#--------------------------------------------------------------------------- -# Configuration::additions related to external references -#--------------------------------------------------------------------------- -TAGFILES = c_utils.tag=../c_utils -GENERATE_TAGFILE = libfftpack.tag -ALLEXTERNALS = NO -EXTERNAL_GROUPS = YES -PERL_PATH = /usr/bin/perl -#--------------------------------------------------------------------------- -# Configuration options related to the dot tool -#--------------------------------------------------------------------------- -CLASS_DIAGRAMS = YES -MSCGEN_PATH = -HIDE_UNDOC_RELATIONS = YES -HAVE_DOT = NO -DOT_NUM_THREADS = 0 -DOT_FONTNAME = FreeSans -DOT_FONTSIZE = 10 -DOT_FONTPATH = -CLASS_GRAPH = YES -COLLABORATION_GRAPH = YES -GROUP_GRAPHS = YES -UML_LOOK = NO -UML_LIMIT_NUM_FIELDS = 10 -TEMPLATE_RELATIONS = YES -INCLUDE_GRAPH = NO -INCLUDED_BY_GRAPH = NO -CALL_GRAPH = NO -CALLER_GRAPH = NO -GRAPHICAL_HIERARCHY = NO -DIRECTORY_GRAPH = YES -DOT_IMAGE_FORMAT = png -INTERACTIVE_SVG = NO -DOT_PATH = -DOTFILE_DIRS = -MSCFILE_DIRS = -DOT_GRAPH_MAX_NODES = 50 -MAX_DOT_GRAPH_DEPTH = 0 -DOT_TRANSPARENT = NO -DOT_MULTI_TARGETS = NO -GENERATE_LEGEND = YES -DOT_CLEANUP = YES diff --git a/external/sharp/docsrc/libsharp.dox b/external/sharp/docsrc/libsharp.dox deleted file mode 100644 index b476ab4..0000000 --- a/external/sharp/docsrc/libsharp.dox +++ /dev/null @@ -1,291 +0,0 @@ -# Doxyfile 1.8.1 - -#--------------------------------------------------------------------------- -# Project related configuration options -#--------------------------------------------------------------------------- -DOXYFILE_ENCODING = UTF-8 -PROJECT_NAME = "LevelS SHT library" -PROJECT_NUMBER = 0.1 -PROJECT_BRIEF = -PROJECT_LOGO = -OUTPUT_DIRECTORY = . -CREATE_SUBDIRS = NO -OUTPUT_LANGUAGE = English -BRIEF_MEMBER_DESC = NO -REPEAT_BRIEF = YES -ABBREVIATE_BRIEF = -ALWAYS_DETAILED_SEC = NO -INLINE_INHERITED_MEMB = NO -FULL_PATH_NAMES = NO -STRIP_FROM_PATH = -STRIP_FROM_INC_PATH = -SHORT_NAMES = NO -JAVADOC_AUTOBRIEF = NO -QT_AUTOBRIEF = NO -MULTILINE_CPP_IS_BRIEF = NO -INHERIT_DOCS = YES -SEPARATE_MEMBER_PAGES = NO -TAB_SIZE = 8 -ALIASES = -TCL_SUBST = -OPTIMIZE_OUTPUT_FOR_C = YES -OPTIMIZE_OUTPUT_JAVA = NO -OPTIMIZE_FOR_FORTRAN = NO -OPTIMIZE_OUTPUT_VHDL = NO -EXTENSION_MAPPING = -MARKDOWN_SUPPORT = YES -BUILTIN_STL_SUPPORT = NO -CPP_CLI_SUPPORT = NO -SIP_SUPPORT = NO -IDL_PROPERTY_SUPPORT = YES -DISTRIBUTE_GROUP_DOC = NO -SUBGROUPING = YES -INLINE_GROUPED_CLASSES = NO -INLINE_SIMPLE_STRUCTS = NO -TYPEDEF_HIDES_STRUCT = NO -SYMBOL_CACHE_SIZE = 0 -LOOKUP_CACHE_SIZE = 0 -#--------------------------------------------------------------------------- -# Build related configuration options -#--------------------------------------------------------------------------- -EXTRACT_ALL = NO -EXTRACT_PRIVATE = NO -EXTRACT_PACKAGE = NO -EXTRACT_STATIC = NO -EXTRACT_LOCAL_CLASSES = YES -EXTRACT_LOCAL_METHODS = NO -EXTRACT_ANON_NSPACES = NO -HIDE_UNDOC_MEMBERS = YES -HIDE_UNDOC_CLASSES = YES -HIDE_FRIEND_COMPOUNDS = YES -HIDE_IN_BODY_DOCS = NO -INTERNAL_DOCS = NO -CASE_SENSE_NAMES = YES -HIDE_SCOPE_NAMES = NO -SHOW_INCLUDE_FILES = YES -FORCE_LOCAL_INCLUDES = NO -INLINE_INFO = YES -SORT_MEMBER_DOCS = NO -SORT_BRIEF_DOCS = NO -SORT_MEMBERS_CTORS_1ST = NO -SORT_GROUP_NAMES = NO -SORT_BY_SCOPE_NAME = NO -STRICT_PROTO_MATCHING = NO -GENERATE_TODOLIST = YES -GENERATE_TESTLIST = YES -GENERATE_BUGLIST = YES -GENERATE_DEPRECATEDLIST= YES -ENABLED_SECTIONS = -MAX_INITIALIZER_LINES = 30 -SHOW_USED_FILES = YES -SHOW_FILES = YES -SHOW_NAMESPACES = YES -FILE_VERSION_FILTER = -LAYOUT_FILE = -CITE_BIB_FILES = -#--------------------------------------------------------------------------- -# configuration options related to warning and progress messages -#--------------------------------------------------------------------------- -QUIET = YES -WARNINGS = YES -WARN_IF_UNDOCUMENTED = YES -WARN_IF_DOC_ERROR = YES -WARN_NO_PARAMDOC = NO -WARN_FORMAT = "$file:$line: $text" -WARN_LOGFILE = -#--------------------------------------------------------------------------- -# configuration options related to the input files -#--------------------------------------------------------------------------- -INPUT = ../libsharp -INPUT_ENCODING = UTF-8 -FILE_PATTERNS = *.h \ - *.c \ - *.dox -RECURSIVE = YES -EXCLUDE = -EXCLUDE_SYMLINKS = NO -EXCLUDE_PATTERNS = -EXCLUDE_SYMBOLS = -EXAMPLE_PATH = -EXAMPLE_PATTERNS = -EXAMPLE_RECURSIVE = NO -IMAGE_PATH = -INPUT_FILTER = -FILTER_PATTERNS = -FILTER_SOURCE_FILES = NO -FILTER_SOURCE_PATTERNS = -#--------------------------------------------------------------------------- -# configuration options related to source browsing -#--------------------------------------------------------------------------- -SOURCE_BROWSER = YES -INLINE_SOURCES = NO -STRIP_CODE_COMMENTS = NO -REFERENCED_BY_RELATION = NO -REFERENCES_RELATION = NO -REFERENCES_LINK_SOURCE = YES -USE_HTAGS = NO -VERBATIM_HEADERS = YES -#--------------------------------------------------------------------------- -# configuration options related to the alphabetical class index -#--------------------------------------------------------------------------- -ALPHABETICAL_INDEX = YES -COLS_IN_ALPHA_INDEX = 5 -IGNORE_PREFIX = -#--------------------------------------------------------------------------- -# configuration options related to the HTML output -#--------------------------------------------------------------------------- -GENERATE_HTML = YES -HTML_OUTPUT = htmldoc -HTML_FILE_EXTENSION = .html -HTML_HEADER = -HTML_FOOTER = footer.html -HTML_STYLESHEET = -HTML_EXTRA_FILES = -HTML_COLORSTYLE_HUE = 220 -HTML_COLORSTYLE_SAT = 100 -HTML_COLORSTYLE_GAMMA = 80 -HTML_TIMESTAMP = YES -HTML_DYNAMIC_SECTIONS = NO -HTML_INDEX_NUM_ENTRIES = 100 -GENERATE_DOCSET = NO -DOCSET_FEEDNAME = "Doxygen generated docs" -DOCSET_BUNDLE_ID = org.doxygen.Project -DOCSET_PUBLISHER_ID = org.doxygen.Publisher -DOCSET_PUBLISHER_NAME = Publisher -GENERATE_HTMLHELP = NO -CHM_FILE = -HHC_LOCATION = -GENERATE_CHI = NO -CHM_INDEX_ENCODING = -BINARY_TOC = NO -TOC_EXPAND = NO -GENERATE_QHP = NO -QCH_FILE = -QHP_NAMESPACE = org.doxygen.Project -QHP_VIRTUAL_FOLDER = doc -QHP_CUST_FILTER_NAME = -QHP_CUST_FILTER_ATTRS = -QHP_SECT_FILTER_ATTRS = -QHG_LOCATION = -GENERATE_ECLIPSEHELP = NO -ECLIPSE_DOC_ID = org.doxygen.Project -DISABLE_INDEX = NO -GENERATE_TREEVIEW = NO -ENUM_VALUES_PER_LINE = 4 -TREEVIEW_WIDTH = 250 -EXT_LINKS_IN_WINDOW = NO -FORMULA_FONTSIZE = 10 -FORMULA_TRANSPARENT = YES -USE_MATHJAX = NO -MATHJAX_RELPATH = http://cdn.mathjax.org/mathjax/latest -MATHJAX_EXTENSIONS = -SEARCHENGINE = NO -SERVER_BASED_SEARCH = NO -#--------------------------------------------------------------------------- -# configuration options related to the LaTeX output -#--------------------------------------------------------------------------- -GENERATE_LATEX = NO -LATEX_OUTPUT = latex -LATEX_CMD_NAME = latex -MAKEINDEX_CMD_NAME = makeindex -COMPACT_LATEX = YES -PAPER_TYPE = a4wide -EXTRA_PACKAGES = -LATEX_HEADER = -LATEX_FOOTER = -PDF_HYPERLINKS = YES -USE_PDFLATEX = YES -LATEX_BATCHMODE = NO -LATEX_HIDE_INDICES = NO -LATEX_SOURCE_CODE = NO -LATEX_BIB_STYLE = plain -#--------------------------------------------------------------------------- -# configuration options related to the RTF output -#--------------------------------------------------------------------------- -GENERATE_RTF = NO -RTF_OUTPUT = rtf -COMPACT_RTF = NO -RTF_HYPERLINKS = NO -RTF_STYLESHEET_FILE = -RTF_EXTENSIONS_FILE = -#--------------------------------------------------------------------------- -# configuration options related to the man page output -#--------------------------------------------------------------------------- -GENERATE_MAN = NO -MAN_OUTPUT = man -MAN_EXTENSION = .3 -MAN_LINKS = NO -#--------------------------------------------------------------------------- -# configuration options related to the XML output -#--------------------------------------------------------------------------- -GENERATE_XML = NO -XML_OUTPUT = xml -XML_SCHEMA = -XML_DTD = -XML_PROGRAMLISTING = YES -#--------------------------------------------------------------------------- -# configuration options for the AutoGen Definitions output -#--------------------------------------------------------------------------- -GENERATE_AUTOGEN_DEF = NO -#--------------------------------------------------------------------------- -# configuration options related to the Perl module output -#--------------------------------------------------------------------------- -GENERATE_PERLMOD = NO -PERLMOD_LATEX = NO -PERLMOD_PRETTY = YES -PERLMOD_MAKEVAR_PREFIX = -#--------------------------------------------------------------------------- -# Configuration options related to the preprocessor -#--------------------------------------------------------------------------- -ENABLE_PREPROCESSING = YES -MACRO_EXPANSION = NO -EXPAND_ONLY_PREDEF = NO -SEARCH_INCLUDES = YES -INCLUDE_PATH = -INCLUDE_FILE_PATTERNS = -PREDEFINED = -EXPAND_AS_DEFINED = -SKIP_FUNCTION_MACROS = YES -#--------------------------------------------------------------------------- -# Configuration::additions related to external references -#--------------------------------------------------------------------------- -TAGFILES = libfftpack.tag=../libfftpack \ - c_utils.tag=../c_utils -GENERATE_TAGFILE = libsharp.tag -ALLEXTERNALS = NO -EXTERNAL_GROUPS = YES -PERL_PATH = /usr/bin/perl -#--------------------------------------------------------------------------- -# Configuration options related to the dot tool -#--------------------------------------------------------------------------- -CLASS_DIAGRAMS = YES -MSCGEN_PATH = -HIDE_UNDOC_RELATIONS = YES -HAVE_DOT = NO -DOT_NUM_THREADS = 0 -DOT_FONTNAME = FreeSans -DOT_FONTSIZE = 10 -DOT_FONTPATH = -CLASS_GRAPH = YES -COLLABORATION_GRAPH = YES -GROUP_GRAPHS = YES -UML_LOOK = NO -UML_LIMIT_NUM_FIELDS = 10 -TEMPLATE_RELATIONS = YES -INCLUDE_GRAPH = NO -INCLUDED_BY_GRAPH = NO -CALL_GRAPH = NO -CALLER_GRAPH = NO -GRAPHICAL_HIERARCHY = NO -DIRECTORY_GRAPH = YES -DOT_IMAGE_FORMAT = png -INTERACTIVE_SVG = NO -DOT_PATH = -DOTFILE_DIRS = -MSCFILE_DIRS = -DOT_GRAPH_MAX_NODES = 50 -MAX_DOT_GRAPH_DEPTH = 0 -DOT_TRANSPARENT = NO -DOT_MULTI_TARGETS = NO -GENERATE_LEGEND = YES -DOT_CLEANUP = YES diff --git a/external/sharp/docsrc/planck.make b/external/sharp/docsrc/planck.make deleted file mode 100644 index 0d0a462..0000000 --- a/external/sharp/docsrc/planck.make +++ /dev/null @@ -1,20 +0,0 @@ -PKG:=docsrc - -docsrc_idx: $(DOCDIR)_mkdir - cp $(SRCROOT)/docsrc/index_code.html $(DOCDIR)/index.html - -docsrc_code_doc: $(DOCDIR)_mkdir docsrc_idx - cd $(SRCROOT)/docsrc; \ - for i in c_utils libfftpack libsharp; do \ - doxygen $${i}.dox; \ - rm -rf $(DOCDIR)/$${i}; mv htmldoc $(DOCDIR)/$${i}; \ - done; \ - rm *.tag; - -docsrc_clean: - cd $(SRCROOT)/docsrc; \ - rm -f *.tag - cd $(SRCROOT)/docsrc; \ - rm -rf htmldoc - -doc: docsrc_code_doc diff --git a/external/sharp/fortran/sharp.f90 b/external/sharp/fortran/sharp.f90 deleted file mode 100644 index 36a1d11..0000000 --- a/external/sharp/fortran/sharp.f90 +++ /dev/null @@ -1,286 +0,0 @@ -module sharp - use iso_c_binding - implicit none - ! alm_info flags - integer, parameter :: SHARP_PACKED = 1 - - ! sharp job types - enum, bind(c) - enumerator :: SHARP_YtW = 0 - enumerator :: SHARP_Y = 1 - enumerator :: SHARP_Yt = 2 - enumerator :: SHARP_WY = 3 - enumerator :: SHARP_ALM2MAP_DERIV1 = 4 - end enum - - ! sharp job flags - integer, parameter :: SHARP_DP = ISHFT(1, 4) - integer, parameter :: SHARP_ADD = ISHFT(1, 5) - integer, parameter :: SHARP_REAL_HARMONICS = ISHFT(1, 6) - integer, parameter :: SHARP_NO_FFT = ISHFT(1, 7) - - type sharp_geom_info - type(c_ptr) :: handle - integer(c_intptr_t) :: n_local - end type sharp_geom_info - - type sharp_alm_info - type(c_ptr) :: handle - integer(c_intptr_t) :: n_local - end type sharp_alm_info - - interface - - ! alm_info - subroutine sharp_make_general_alm_info( & - lmax, nm, stride, mval, mvstart, flags, alm_info) bind(c) - use iso_c_binding - integer(c_int), value, intent(in) :: lmax, nm, stride, flags - integer(c_int), intent(in) :: mval(nm) - integer(c_intptr_t), intent(in) :: mvstart(nm) - type(c_ptr), intent(out) :: alm_info - end subroutine sharp_make_general_alm_info - - subroutine c_sharp_make_mmajor_real_packed_alm_info( & - lmax, stride, nm, ms, alm_info) bind(c, name='sharp_make_mmajor_real_packed_alm_info') - use iso_c_binding - integer(c_int), value, intent(in) :: lmax, nm, stride - integer(c_int), intent(in), optional :: ms(nm) - type(c_ptr), intent(out) :: alm_info - end subroutine c_sharp_make_mmajor_real_packed_alm_info - - function c_sharp_alm_count(alm_info) bind(c, name='sharp_alm_count') - use iso_c_binding - integer(c_intptr_t) :: c_sharp_alm_count - type(c_ptr), value, intent(in) :: alm_info - end function c_sharp_alm_count - - subroutine c_sharp_destroy_alm_info(alm_info) bind(c, name='sharp_destroy_alm_info') - use iso_c_binding - type(c_ptr), value :: alm_info - end subroutine c_sharp_destroy_alm_info - - ! geom_info - subroutine sharp_make_subset_healpix_geom_info ( & - nside, stride, nrings, rings, weight, geom_info) bind(c) - use iso_c_binding - integer(c_int), value, intent(in) :: nside, stride, nrings - integer(c_int), intent(in), optional :: rings(nrings) - real(c_double), intent(in), optional :: weight(2 * nside) - type(c_ptr), intent(out) :: geom_info - end subroutine sharp_make_subset_healpix_geom_info - - subroutine c_sharp_destroy_geom_info(geom_info) bind(c, name='sharp_destroy_geom_info') - use iso_c_binding - type(c_ptr), value :: geom_info - end subroutine c_sharp_destroy_geom_info - - function c_sharp_map_size(info) bind(c, name='sharp_map_size') - use iso_c_binding - integer(c_intptr_t) :: c_sharp_map_size - type(c_ptr), value :: info - end function c_sharp_map_size - - - ! execute - subroutine c_sharp_execute(type, spin, alm, map, geom_info, alm_info, ntrans, & - flags, time, opcnt) bind(c, name='sharp_execute') - use iso_c_binding - integer(c_int), value :: type, spin, ntrans, flags - type(c_ptr), value :: alm_info, geom_info - real(c_double), intent(out), optional :: time - integer(c_long_long), intent(out), optional :: opcnt - type(c_ptr), intent(in) :: alm(*), map(*) - end subroutine c_sharp_execute - - subroutine c_sharp_execute_mpi(comm, type, spin, alm, map, geom_info, alm_info, ntrans, & - flags, time, opcnt) bind(c, name='sharp_execute_mpi_fortran') - use iso_c_binding - integer(c_int), value :: comm, type, spin, ntrans, flags - type(c_ptr), value :: alm_info, geom_info - real(c_double), intent(out), optional :: time - integer(c_long_long), intent(out), optional :: opcnt - type(c_ptr), intent(in) :: alm(*), map(*) - end subroutine c_sharp_execute_mpi - - ! Legendre transforms - subroutine c_sharp_legendre_transform(bl, recfac, lmax, x, out, nx) & - bind(c, name='sharp_legendre_transform') - use iso_c_binding - integer(c_intptr_t), value :: lmax, nx - real(c_double) :: bl(lmax + 1), x(nx), out(nx) - real(c_double), optional :: recfac(lmax + 1) - end subroutine c_sharp_legendre_transform - - subroutine c_sharp_legendre_transform_s(bl, recfac, lmax, x, out, nx) & - bind(c, name='sharp_legendre_transform_s') - use iso_c_binding - integer(c_intptr_t), value :: lmax, nx - real(c_float) :: bl(lmax + 1), x(nx), out(nx) - real(c_float), optional :: recfac(lmax + 1) - end subroutine c_sharp_legendre_transform_s - end interface - - interface sharp_execute - module procedure sharp_execute_d - end interface - - interface sharp_legendre_transform - module procedure sharp_legendre_transform_d, sharp_legendre_transform_s - end interface sharp_legendre_transform - -contains - ! alm info - - ! if ms is not passed, we default to using m=0..lmax. - subroutine sharp_make_mmajor_real_packed_alm_info(lmax, ms, alm_info) - use iso_c_binding - integer(c_int), value, intent(in) :: lmax - integer(c_int), intent(in), optional :: ms(:) - type(sharp_alm_info), intent(out) :: alm_info - !-- - integer(c_int), allocatable :: ms_copy(:) - integer(c_int) :: nm - - if (present(ms)) then - nm = size(ms) - allocate(ms_copy(nm)) - ms_copy = ms - call c_sharp_make_mmajor_real_packed_alm_info(lmax, 1, nm, ms_copy, alm_info=alm_info%handle) - deallocate(ms_copy) - else - call c_sharp_make_mmajor_real_packed_alm_info(lmax, 1, lmax + 1, alm_info=alm_info%handle) - end if - alm_info%n_local = c_sharp_alm_count(alm_info%handle) - end subroutine sharp_make_mmajor_real_packed_alm_info - - subroutine sharp_destroy_alm_info(alm_info) - use iso_c_binding - type(sharp_alm_info), intent(inout) :: alm_info - call c_sharp_destroy_alm_info(alm_info%handle) - alm_info%handle = c_null_ptr - end subroutine sharp_destroy_alm_info - - - ! geom info - subroutine sharp_make_healpix_geom_info(nside, rings, weight, geom_info) - integer(c_int), value :: nside - integer(c_int), optional :: rings(:) - real(c_double), intent(in), optional :: weight(2 * nside) - type(sharp_geom_info), intent(out) :: geom_info - !-- - integer(c_int) :: nrings - integer(c_int), allocatable :: rings_copy(:) - - if (present(rings)) then - nrings = size(rings) - allocate(rings_copy(nrings)) - rings_copy = rings - call sharp_make_subset_healpix_geom_info(nside, 1, nrings, rings_copy, & - weight, geom_info%handle) - deallocate(rings_copy) - else - call sharp_make_subset_healpix_geom_info(nside, 1, nrings=4 * nside - 1, & - weight=weight, geom_info=geom_info%handle) - end if - geom_info%n_local = c_sharp_map_size(geom_info%handle) - end subroutine sharp_make_healpix_geom_info - - subroutine sharp_destroy_geom_info(geom_info) - use iso_c_binding - type(sharp_geom_info), intent(inout) :: geom_info - call c_sharp_destroy_geom_info(geom_info%handle) - geom_info%handle = c_null_ptr - end subroutine sharp_destroy_geom_info - - - ! Currently the only mode supported is stacked (not interleaved) maps. - ! - ! Note that passing the exact dimension of alm/map is necesarry, it - ! prevents the caller from doing too crazy slicing prior to pass array - ! in... - ! - ! Usage: - ! - ! The alm array must have shape exactly alm(alm_info%n_local, nmaps) - ! The maps array must have shape exactly map(map_info%n_local, nmaps). - subroutine sharp_execute_d(type, spin, nmaps, alm, alm_info, map, geom_info, & - add, time, opcnt, comm) - use iso_c_binding - use mpi - implicit none - integer(c_int), value :: type, spin, nmaps - integer(c_int), optional :: comm - logical, value, optional :: add ! should add instead of replace out - - type(sharp_alm_info) :: alm_info - type(sharp_geom_info) :: geom_info - real(c_double), intent(out), optional :: time - integer(c_long_long), intent(out), optional :: opcnt - real(c_double), target, intent(inout) :: alm(0:alm_info%n_local - 1, 1:nmaps) - real(c_double), target, intent(inout) :: map(0:geom_info%n_local - 1, 1:nmaps) - !-- - integer(c_int) :: mod_flags, ntrans, k - type(c_ptr), target :: alm_ptr(nmaps) - type(c_ptr), target :: map_ptr(nmaps) - - mod_flags = SHARP_DP - if (present(add) .and. add) then - mod_flags = or(mod_flags, SHARP_ADD) - end if - - if (spin == 0) then - ntrans = nmaps - else - ntrans = nmaps / 2 - end if - - ! Set up pointer table to access maps - alm_ptr(:) = c_null_ptr - map_ptr(:) = c_null_ptr - do k = 1, nmaps - if (alm_info%n_local > 0) alm_ptr(k) = c_loc(alm(0, k)) - if (geom_info%n_local > 0) map_ptr(k) = c_loc(map(0, k)) - end do - - if (present(comm)) then - call c_sharp_execute_mpi(comm, type, spin, alm_ptr, map_ptr, & - geom_info=geom_info%handle, & - alm_info=alm_info%handle, & - ntrans=ntrans, & - flags=mod_flags, & - time=time, & - opcnt=opcnt) - else - call c_sharp_execute(type, spin, alm_ptr, map_ptr, & - geom_info=geom_info%handle, & - alm_info=alm_info%handle, & - ntrans=ntrans, & - flags=mod_flags, & - time=time, & - opcnt=opcnt) - end if - end subroutine sharp_execute_d - - subroutine sharp_legendre_transform_d(bl, x, out) - use iso_c_binding - real(c_double) :: bl(:) - real(c_double) :: x(:), out(size(x)) - !-- - integer(c_intptr_t) :: lmax, nx - call c_sharp_legendre_transform(bl, lmax=int(size(bl) - 1, c_intptr_t), & - x=x, out=out, nx=int(size(x), c_intptr_t)) - end subroutine sharp_legendre_transform_d - - subroutine sharp_legendre_transform_s(bl, x, out) - use iso_c_binding - real(c_float) :: bl(:) - real(c_float) :: x(:), out(size(x)) - !-- - integer(c_intptr_t) :: lmax, nx - call c_sharp_legendre_transform_s(bl, lmax=int(size(bl) - 1, c_intptr_t), & - x=x, out=out, nx=int(size(x), c_intptr_t)) - end subroutine sharp_legendre_transform_s - - -end module diff --git a/external/sharp/fortran/test_sharp.f90 b/external/sharp/fortran/test_sharp.f90 deleted file mode 100644 index 0b7cce2..0000000 --- a/external/sharp/fortran/test_sharp.f90 +++ /dev/null @@ -1,84 +0,0 @@ -program test_sharp - use mpi - use sharp - use iso_c_binding, only : c_ptr, c_double - implicit none - - integer, parameter :: lmax = 2, nside = 2 - type(sharp_alm_info) :: alm_info - type(sharp_geom_info) :: geom_info - - real(c_double), dimension(0:(lmax + 1)**2 - 1, 1:1) :: alm - real(c_double), dimension(0:12*nside**2 - 1, 1:1) :: map - - integer(c_int), dimension(1:lmax + 1) :: ms - integer(c_int), dimension(1:4 * nside - 1) :: rings - integer(c_int) :: nm, m, nrings, iring - integer :: nodecount, rank, ierr - - call MPI_Init(ierr) - call MPI_Comm_size(MPI_COMM_WORLD, nodecount, ierr) - call MPI_Comm_rank(MPI_COMM_WORLD, rank, ierr) - - nm = 0 - do m = rank, lmax, nodecount - nm = nm + 1 - ms(nm) = m - end do - - nrings = 0 - do iring = rank + 1, 4 * nside - 1, nodecount - nrings = nrings + 1 - rings(nrings) = iring - end do - - alm = 0 - map = 0 - if (rank == 0) then - alm(0, 1) = 1 - end if - - print *, ms(1:nm) - call sharp_make_mmajor_real_packed_alm_info(lmax, ms=ms(1:nm), alm_info=alm_info) - print *, 'alm_info%n_local', alm_info%n_local - call sharp_make_healpix_geom_info(nside, rings=rings(1:nrings), geom_info=geom_info) - print *, 'geom_info%n_local', geom_info%n_local - print *, 'execute' - call sharp_execute(SHARP_Y, 0, 1, alm, alm_info, map, geom_info, comm=MPI_COMM_WORLD) - - print *, alm - print *, map - - call sharp_destroy_alm_info(alm_info) - call sharp_destroy_geom_info(geom_info) - print *, 'DONE' - call MPI_Finalize(ierr) - - print *, 'LEGENDRE TRANSFORMS' - - call test_legendre_transforms() - -contains - subroutine test_legendre_transforms() - integer, parameter :: lmax = 20, nx=10 - real(c_double) :: bl(0:lmax) - real(c_double) :: x(nx), out(nx) - real(c_float) :: out_s(nx) - !-- - integer :: l, i - - do l = 0, lmax - bl(l) = 1.0 / real(l + 1, c_double) - end do - do i = 1, nx - x(i) = 1 / real(i, c_double) - end do - out = 0 - call sharp_legendre_transform(bl, x, out) - print *, out - call sharp_legendre_transform(real(bl, c_float), real(x, c_float), out_s) - print *, out_s - end subroutine test_legendre_transforms - - -end program test_sharp diff --git a/external/sharp/libfftpack/README b/external/sharp/libfftpack/README deleted file mode 100644 index 2c7e7cb..0000000 --- a/external/sharp/libfftpack/README +++ /dev/null @@ -1,34 +0,0 @@ -ls_fft description: - -This package is intended to calculate one-dimensional real or complex FFTs -with high accuracy and good efficiency even for lengths containing large -prime factors. -The code is written in C, but a Fortran wrapper exists as well. - -Before any FFT is executed, a plan must be generated for it. Plan creation -is designed to be fast, so that there is no significant overhead if the -plan is only used once or a few times. - -The main component of the code is based on Paul N. Swarztrauber's FFTPACK in the -double precision incarnation by Hugh C. Pumphrey -(http://www.netlib.org/fftpack/dp.tgz). - -I replaced the iterative sine and cosine calculations in radfg() and radbg() -by an exact calculation, which slightly improves the transform accuracy for -real FFTs with lengths containing large prime factors. - -Since FFTPACK becomes quite slow for FFT lengths with large prime factors -(in the worst case of prime lengths it reaches O(n*n) complexity), I -implemented Bluestein's algorithm, which computes a FFT of length n by -several FFTs of length n2>=2*n-1 and a convolution. Since n2 can be chosen -to be highly composite, this algorithm is more efficient if n has large -prime factors. The longer FFTs themselves are then computed using the FFTPACK -routines. -Bluestein's algorithm was implemented according to the description at -http://en.wikipedia.org/wiki/Bluestein's_FFT_algorithm. - -Thread-safety: -All routines can be called concurrently; all information needed by ls_fft -is stored in the plan variable. However, using the same plan variable on -multiple threads simultaneously is not supported and will lead to data -corruption. diff --git a/external/sharp/libfftpack/bluestein.c b/external/sharp/libfftpack/bluestein.c deleted file mode 100644 index 2e2005c..0000000 --- a/external/sharp/libfftpack/bluestein.c +++ /dev/null @@ -1,173 +0,0 @@ -/* - * This file is part of libfftpack. - * - * libfftpack is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libfftpack is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libfftpack; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libfftpack is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/* - * Copyright (C) 2005, 2006, 2007, 2008 Max-Planck-Society - * \author Martin Reinecke - */ - -#include -#include -#include "fftpack.h" -#include "bluestein.h" - -/* returns the sum of all prime factors of n */ -size_t prime_factor_sum (size_t n) - { - size_t result=0,x,limit,tmp; - while (((tmp=(n>>1))<<1)==n) - { result+=2; n=tmp; } - - limit=(size_t)sqrt(n+0.01); - for (x=3; x<=limit; x+=2) - while ((tmp=(n/x))*x==n) - { - result+=x; - n=tmp; - limit=(size_t)sqrt(n+0.01); - } - if (n>1) result+=n; - - return result; - } - -/* returns the smallest composite of 2, 3 and 5 which is >= n */ -static size_t good_size(size_t n) - { - size_t f2, f23, f235, bestfac=2*n; - if (n<=6) return n; - - for (f2=1; f2=n) bestfac=f235; - return bestfac; - } - -void bluestein_i (size_t n, double **tstorage, size_t *worksize) - { - static const double pi=3.14159265358979323846; - size_t n2=good_size(n*2-1); - size_t m, coeff; - double angle, xn2; - double *bk, *bkf, *work; - double pibyn=pi/n; - *worksize=2+2*n+8*n2+16; - *tstorage = RALLOC(double,2+2*n+8*n2+16); - ((size_t *)(*tstorage))[0]=n2; - bk = *tstorage+2; - bkf = *tstorage+2+2*n; - work= *tstorage+2+2*(n+n2); - -/* initialize b_k */ - bk[0] = 1; - bk[1] = 0; - - coeff=0; - for (m=1; m=2*n) coeff-=2*n; - angle = pibyn*coeff; - bk[2*m] = cos(angle); - bk[2*m+1] = sin(angle); - } - -/* initialize the zero-padded, Fourier transformed b_k. Add normalisation. */ - xn2 = 1./n2; - bkf[0] = bk[0]*xn2; - bkf[1] = bk[1]*xn2; - for (m=2; m<2*n; m+=2) - { - bkf[m] = bkf[2*n2-m] = bk[m] *xn2; - bkf[m+1] = bkf[2*n2-m+1] = bk[m+1] *xn2; - } - for (m=2*n;m<=(2*n2-2*n+1);++m) - bkf[m]=0.; - cffti (n2,work); - cfftf (n2,bkf,work); - } - -void bluestein (size_t n, double *data, double *tstorage, int isign) - { - size_t n2=*((size_t *)tstorage); - size_t m; - double *bk, *bkf, *akf, *work; - bk = tstorage+2; - bkf = tstorage+2+2*n; - work= tstorage+2+2*(n+n2); - akf = tstorage+2+2*n+6*n2+16; - -/* initialize a_k and FFT it */ - if (isign>0) - for (m=0; m<2*n; m+=2) - { - akf[m] = data[m]*bk[m] - data[m+1]*bk[m+1]; - akf[m+1] = data[m]*bk[m+1] + data[m+1]*bk[m]; - } - else - for (m=0; m<2*n; m+=2) - { - akf[m] = data[m]*bk[m] + data[m+1]*bk[m+1]; - akf[m+1] =-data[m]*bk[m+1] + data[m+1]*bk[m]; - } - for (m=2*n; m<2*n2; ++m) - akf[m]=0; - - cfftf (n2,akf,work); - -/* do the convolution */ - if (isign>0) - for (m=0; m<2*n2; m+=2) - { - double im = -akf[m]*bkf[m+1] + akf[m+1]*bkf[m]; - akf[m ] = akf[m]*bkf[m] + akf[m+1]*bkf[m+1]; - akf[m+1] = im; - } - else - for (m=0; m<2*n2; m+=2) - { - double im = akf[m]*bkf[m+1] + akf[m+1]*bkf[m]; - akf[m ] = akf[m]*bkf[m] - akf[m+1]*bkf[m+1]; - akf[m+1] = im; - } - - -/* inverse FFT */ - cfftb (n2,akf,work); - -/* multiply by b_k* */ - if (isign>0) - for (m=0; m<2*n; m+=2) - { - data[m] = bk[m] *akf[m] - bk[m+1]*akf[m+1]; - data[m+1] = bk[m+1]*akf[m] + bk[m] *akf[m+1]; - } - else - for (m=0; m<2*n; m+=2) - { - data[m] = bk[m] *akf[m] + bk[m+1]*akf[m+1]; - data[m+1] =-bk[m+1]*akf[m] + bk[m] *akf[m+1]; - } - } diff --git a/external/sharp/libfftpack/bluestein.h b/external/sharp/libfftpack/bluestein.h deleted file mode 100644 index 91e5b28..0000000 --- a/external/sharp/libfftpack/bluestein.h +++ /dev/null @@ -1,48 +0,0 @@ -/* - * This file is part of libfftpack. - * - * libfftpack is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libfftpack is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libfftpack; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libfftpack is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/* - * Copyright (C) 2005 Max-Planck-Society - * \author Martin Reinecke - */ - -#ifndef PLANCK_BLUESTEIN_H -#define PLANCK_BLUESTEIN_H - -#include "c_utils.h" - -#ifdef __cplusplus -extern "C" { -#endif - -size_t prime_factor_sum (size_t n); - -void bluestein_i (size_t n, double **tstorage, size_t *worksize); -void bluestein (size_t n, double *data, double *tstorage, int isign); - -#ifdef __cplusplus -} -#endif - -#endif diff --git a/external/sharp/libfftpack/fftpack.c b/external/sharp/libfftpack/fftpack.c deleted file mode 100644 index 6d09d06..0000000 --- a/external/sharp/libfftpack/fftpack.c +++ /dev/null @@ -1,833 +0,0 @@ -/* - * This file is part of libfftpack. - * - * libfftpack is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libfftpack is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libfftpack; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libfftpack is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/* - fftpack.c : A set of FFT routines in C. - Algorithmically based on Fortran-77 FFTPACK by Paul N. Swarztrauber - (Version 4, 1985). - - C port by Martin Reinecke (2010) - */ - -#include -#include -#include -#include "fftpack.h" - -#define WA(x,i) wa[(i)+(x)*ido] -#define CH(a,b,c) ch[(a)+ido*((b)+l1*(c))] -#define CC(a,b,c) cc[(a)+ido*((b)+cdim*(c))] -#define PM(a,b,c,d) { a=c+d; b=c-d; } -#define PMC(a,b,c,d) { a.r=c.r+d.r; a.i=c.i+d.i; b.r=c.r-d.r; b.i=c.i-d.i; } -#define ADDC(a,b,c) { a.r=b.r+c.r; a.i=b.i+c.i; } -#define SCALEC(a,b) { a.r*=b; a.i*=b; } -#define CONJFLIPC(a) { double tmp_=a.r; a.r=-a.i; a.i=tmp_; } -/* (a+ib) = conj(c+id) * (e+if) */ -#define MULPM(a,b,c,d,e,f) { a=c*e+d*f; b=c*f-d*e; } - -typedef struct { - double r,i; -} cmplx; - -#define CONCAT(a,b) a ## b - -#define X(arg) CONCAT(passb,arg) -#define BACKWARD -#include "fftpack_inc.c" -#undef BACKWARD -#undef X - -#define X(arg) CONCAT(passf,arg) -#include "fftpack_inc.c" -#undef X - -#undef CC -#undef CH -#define CC(a,b,c) cc[(a)+ido*((b)+l1*(c))] -#define CH(a,b,c) ch[(a)+ido*((b)+cdim*(c))] - -static void radf2 (size_t ido, size_t l1, const double *cc, double *ch, - const double *wa) - { - const size_t cdim=2; - size_t i, k, ic; - double ti2, tr2; - - for (k=0; k=2*ip) aidx-=2*ip; - ar2=csarr[aidx]; - ai2=csarr[aidx+1]; - for(ik=0; ik=2*ip) aidx-=2*ip; - ar2=csarr[aidx]; - ai2=csarr[aidx+1]; - for(ik=0; ik0) ? passb4(ido, l1, p1, p2, wa+iw) - : passf4(ido, l1, p1, p2, wa+iw); - else if(ip==2) - (isign>0) ? passb2(ido, l1, p1, p2, wa+iw) - : passf2(ido, l1, p1, p2, wa+iw); - else if(ip==3) - (isign>0) ? passb3(ido, l1, p1, p2, wa+iw) - : passf3(ido, l1, p1, p2, wa+iw); - else if(ip==5) - (isign>0) ? passb5(ido, l1, p1, p2, wa+iw) - : passf5(ido, l1, p1, p2, wa+iw); - else if(ip==6) - (isign>0) ? passb6(ido, l1, p1, p2, wa+iw) - : passf6(ido, l1, p1, p2, wa+iw); - else - (isign>0) ? passbg(ido, ip, l1, p1, p2, wa+iw) - : passfg(ido, ip, l1, p1, p2, wa+iw); - SWAP(p1,p2,cmplx *); - l1=l2; - iw+=(ip-1)*ido; - } - if (p1!=c) - memcpy (c,p1,n*sizeof(cmplx)); - } - -void cfftf(size_t n, double c[], double wsave[]) - { - if (n!=1) - cfft1(n, (cmplx*)c, (cmplx*)wsave, (cmplx*)(wsave+2*n), - (size_t*)(wsave+4*n),-1); - } - -void cfftb(size_t n, double c[], double wsave[]) - { - if (n!=1) - cfft1(n, (cmplx*)c, (cmplx*)wsave, (cmplx*)(wsave+2*n), - (size_t*)(wsave+4*n),+1); - } - -static void factorize (size_t n, const size_t *pf, size_t npf, size_t *ifac) - { - size_t nl=n, nf=0, ntry=0, j=0, i; - -startloop: - j++; - ntry = (j<=npf) ? pf[j-1] : ntry+2; - do - { - size_t nq=nl / ntry; - size_t nr=nl-ntry*nq; - if (nr!=0) - goto startloop; - nf++; - ifac[nf+1]=ntry; - nl=nq; - if ((ntry==2) && (nf!=1)) - { - for (i=nf+1; i>2; --i) - ifac[i]=ifac[i-1]; - ifac[2]=2; - } - } - while(nl!=1); - ifac[0]=n; - ifac[1]=nf; - } - -static void cffti1(size_t n, double wa[], size_t ifac[]) - { - static const size_t ntryh[5]={4,6,3,2,5}; - static const double twopi=6.28318530717958647692; - size_t j, k, fi; - - double argh=twopi/n; - size_t i=0, l1=1; - factorize (n,ntryh,5,ifac); - for(k=1; k<=ifac[1]; k++) - { - size_t ip=ifac[k+1]; - size_t ido=n/(l1*ip); - for(j=1; j6) - { - wa[is ]=wa[i ]; - wa[is+1]=wa[i+1]; - } - } - l1*=ip; - } - } - -void cffti(size_t n, double wsave[]) - { if (n!=1) cffti1(n, wsave+2*n,(size_t*)(wsave+4*n)); } - - -/*---------------------------------------------------------------------- - rfftf1, rfftb1, rfftf, rfftb, rffti1, rffti. Real FFTs. - ----------------------------------------------------------------------*/ - -static void rfftf1(size_t n, double c[], double ch[], const double wa[], - const size_t ifac[]) - { - size_t k1, l1=n, nf=ifac[1], iw=n-1; - double *p1=ch, *p2=c; - - for(k1=1; k1<=nf;++k1) - { - size_t ip=ifac[nf-k1+2]; - size_t ido=n / l1; - l1 /= ip; - iw-=(ip-1)*ido; - SWAP (p1,p2,double *); - if(ip==4) - radf4(ido, l1, p1, p2, wa+iw); - else if(ip==2) - radf2(ido, l1, p1, p2, wa+iw); - else if(ip==3) - radf3(ido, l1, p1, p2, wa+iw); - else if(ip==5) - radf5(ido, l1, p1, p2, wa+iw); - else - { - if (ido==1) - SWAP (p1,p2,double *); - radfg(ido, ip, l1, ido*l1, p1, p2, wa+iw); - SWAP (p1,p2,double *); - } - } - if (p1==c) - memcpy (c,ch,n*sizeof(double)); - } - -static void rfftb1(size_t n, double c[], double ch[], const double wa[], - const size_t ifac[]) - { - size_t k1, l1=1, nf=ifac[1], iw=0; - double *p1=c, *p2=ch; - - for(k1=1; k1<=nf; k1++) - { - size_t ip = ifac[k1+1], - ido= n/(ip*l1); - if(ip==4) - radb4(ido, l1, p1, p2, wa+iw); - else if(ip==2) - radb2(ido, l1, p1, p2, wa+iw); - else if(ip==3) - radb3(ido, l1, p1, p2, wa+iw); - else if(ip==5) - radb5(ido, l1, p1, p2, wa+iw); - else - { - radbg(ido, ip, l1, ido*l1, p1, p2, wa+iw); - if (ido!=1) - SWAP (p1,p2,double *); - } - SWAP (p1,p2,double *); - l1*=ip; - iw+=(ip-1)*ido; - } - if (p1!=c) - memcpy (c,ch,n*sizeof(double)); - } - -void rfftf(size_t n, double r[], double wsave[]) - { if(n!=1) rfftf1(n, r, wsave, wsave+n,(size_t*)(wsave+2*n)); } - -void rfftb(size_t n, double r[], double wsave[]) - { if(n!=1) rfftb1(n, r, wsave, wsave+n,(size_t*)(wsave+2*n)); } - -static void rffti1(size_t n, double wa[], size_t ifac[]) - { - static const size_t ntryh[4]={4,2,3,5}; - static const double twopi=6.28318530717958647692; - size_t i, j, k, fi; - - double argh=twopi/n; - size_t is=0, l1=1; - factorize (n,ntryh,4,ifac); - for (k=1; kip) iang-=ip; - abr.r += ccl[l ].r*wal[iang].r; - abr.i += ccl[l ].i*wal[iang].r; - abi.r += ccl[lc].r*wal[iang].i; - abi.i += ccl[lc].i*wal[iang].i; - } -#ifndef BACKWARD - { abi.i=-abi.i; abi.r=-abi.r; } -#endif - CONJFLIPC(abi) - PMC(CH(i,k,j),CH(i,k,jc),abr,abi) - } - } - - DEALLOC(tarr); - - if (ido==1) return; - - for (j=1; j -
  • \ref fftgroup "Programming interface" - - */ diff --git a/external/sharp/libfftpack/ls_fft.c b/external/sharp/libfftpack/ls_fft.c deleted file mode 100644 index b1c0c96..0000000 --- a/external/sharp/libfftpack/ls_fft.c +++ /dev/null @@ -1,291 +0,0 @@ -/* - * This file is part of libfftpack. - * - * libfftpack is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libfftpack is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libfftpack; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libfftpack is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/* - * Copyright (C) 2005 Max-Planck-Society - * \author Martin Reinecke - */ - -#include -#include -#include -#include "bluestein.h" -#include "fftpack.h" -#include "ls_fft.h" - -complex_plan make_complex_plan (size_t length) - { - complex_plan plan = RALLOC(complex_plan_i,1); - size_t pfsum = prime_factor_sum(length); - double comp1 = (double)(length*pfsum); - double comp2 = 2*3*length*log(3.*length); - comp2*=3.; /* fudge factor that appears to give good overall performance */ - plan->length=length; - plan->bluestein = (comp2bluestein) - bluestein_i (length,&(plan->work),&(plan->worksize)); - else - { - plan->worksize=4*length+15; - plan->work=RALLOC(double,4*length+15); - cffti(length, plan->work); - } - return plan; - } - -complex_plan copy_complex_plan (complex_plan plan) - { - if (!plan) return NULL; - { - complex_plan newplan = RALLOC(complex_plan_i,1); - *newplan = *plan; - newplan->work=RALLOC(double,newplan->worksize); - memcpy(newplan->work,plan->work,sizeof(double)*newplan->worksize); - return newplan; - } - } - -void kill_complex_plan (complex_plan plan) - { - DEALLOC(plan->work); - DEALLOC(plan); - } - -void complex_plan_forward (complex_plan plan, double *data) - { - if (plan->bluestein) - bluestein (plan->length, data, plan->work, -1); - else - cfftf (plan->length, data, plan->work); - } - -void complex_plan_backward (complex_plan plan, double *data) - { - if (plan->bluestein) - bluestein (plan->length, data, plan->work, 1); - else - cfftb (plan->length, data, plan->work); - } - - -real_plan make_real_plan (size_t length) - { - real_plan plan = RALLOC(real_plan_i,1); - size_t pfsum = prime_factor_sum(length); - double comp1 = .5*length*pfsum; - double comp2 = 2*3*length*log(3.*length); - comp2*=3; /* fudge factor that appears to give good overall performance */ - plan->length=length; - plan->bluestein = (comp2bluestein) - bluestein_i (length,&(plan->work),&(plan->worksize)); - else - { - plan->worksize=2*length+15; - plan->work=RALLOC(double,2*length+15); - rffti(length, plan->work); - } - return plan; - } - -real_plan copy_real_plan (real_plan plan) - { - if (!plan) return NULL; - { - real_plan newplan = RALLOC(real_plan_i,1); - *newplan = *plan; - newplan->work=RALLOC(double,newplan->worksize); - memcpy(newplan->work,plan->work,sizeof(double)*newplan->worksize); - return newplan; - } - } - -void kill_real_plan (real_plan plan) - { - DEALLOC(plan->work); - DEALLOC(plan); - } - -void real_plan_forward_fftpack (real_plan plan, double *data) - { - if (plan->bluestein) - { - size_t m; - size_t n=plan->length; - double *tmp = RALLOC(double,2*n); - for (m=0; mwork,-1); - data[0] = tmp[0]; - memcpy (data+1, tmp+2, (n-1)*sizeof(double)); - DEALLOC(tmp); - } - else - rfftf (plan->length, data, plan->work); - } - -static void fftpack2halfcomplex (double *data, size_t n) - { - size_t m; - double *tmp = RALLOC(double,n); - tmp[0]=data[0]; - for (m=1; m<(n+1)/2; ++m) - { - tmp[m]=data[2*m-1]; - tmp[n-m]=data[2*m]; - } - if (!(n&1)) - tmp[n/2]=data[n-1]; - memcpy (data,tmp,n*sizeof(double)); - DEALLOC(tmp); - } - -static void halfcomplex2fftpack (double *data, size_t n) - { - size_t m; - double *tmp = RALLOC(double,n); - tmp[0]=data[0]; - for (m=1; m<(n+1)/2; ++m) - { - tmp[2*m-1]=data[m]; - tmp[2*m]=data[n-m]; - } - if (!(n&1)) - tmp[n-1]=data[n/2]; - memcpy (data,tmp,n*sizeof(double)); - DEALLOC(tmp); - } - -void real_plan_forward_fftw (real_plan plan, double *data) - { - real_plan_forward_fftpack (plan, data); - fftpack2halfcomplex (data,plan->length); - } - -void real_plan_backward_fftpack (real_plan plan, double *data) - { - if (plan->bluestein) - { - size_t m; - size_t n=plan->length; - double *tmp = RALLOC(double,2*n); - tmp[0]=data[0]; - tmp[1]=0.; - memcpy (tmp+2,data+1, (n-1)*sizeof(double)); - if ((n&1)==0) tmp[n+1]=0.; - for (m=2; mwork, 1); - for (m=0; mlength, data, plan->work); - } - -void real_plan_backward_fftw (real_plan plan, double *data) - { - halfcomplex2fftpack (data,plan->length); - real_plan_backward_fftpack (plan, data); - } - -void real_plan_forward_c (real_plan plan, double *data) - { - size_t m; - size_t n=plan->length; - - if (plan->bluestein) - { - for (m=1; m<2*n; m+=2) - data[m]=0; - bluestein (plan->length, data, plan->work, -1); - data[1]=0; - for (m=2; mwork); - data[0] = data[1]; - data[1] = 0; - for (m=2; mlength; - - if (plan->bluestein) - { - size_t m; - data[1]=0; - for (m=2; mlength, data, plan->work, 1); - for (m=1; m<2*n; m+=2) - data[m]=0; - } - else - { - ptrdiff_t m; - data[1] = data[0]; - rfftb (n, data+1, plan->work); - for (m=n-1; m>=0; --m) - { - data[2*m] = data[m+1]; - data[2*m+1] = 0.; - } - } - } diff --git a/external/sharp/libfftpack/ls_fft.h b/external/sharp/libfftpack/ls_fft.h deleted file mode 100644 index 2d555eb..0000000 --- a/external/sharp/libfftpack/ls_fft.h +++ /dev/null @@ -1,161 +0,0 @@ -/* - * This file is part of libfftpack. - * - * libfftpack is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libfftpack is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libfftpack; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libfftpack is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file ls_fft.h - * Interface for the LevelS FFT package. - * - * Copyright (C) 2004 Max-Planck-Society - * \author Martin Reinecke - */ - -#ifndef PLANCK_LS_FFT_H -#define PLANCK_LS_FFT_H - -#include "c_utils.h" - -#ifdef __cplusplus -extern "C" { -#endif - -/*!\defgroup fftgroup FFT interface -This package is intended to calculate one-dimensional real or complex FFTs -with high accuracy and good efficiency even for lengths containing large -prime factors. -The code is written in C, but a Fortran wrapper exists as well. - -Before any FFT is executed, a plan must be generated for it. Plan creation -is designed to be fast, so that there is no significant overhead if the -plan is only used once or a few times. - -The main component of the code is based on Paul N. Swarztrauber's FFTPACK in the -double precision incarnation by Hugh C. Pumphrey -(http://www.netlib.org/fftpack/dp.tgz). - -I replaced the iterative sine and cosine calculations in radfg() and radbg() -by an exact calculation, which slightly improves the transform accuracy for -real FFTs with lengths containing large prime factors. - -Since FFTPACK becomes quite slow for FFT lengths with large prime factors -(in the worst case of prime lengths it reaches \f$\mathcal{O}(n^2)\f$ -complexity), I implemented Bluestein's algorithm, which computes a FFT of length -\f$n\f$ by several FFTs of length \f$n_2\ge 2n-1\f$ and a convolution. Since -\f$n_2\f$ can be chosen to be highly composite, this algorithm is more efficient -if \f$n\f$ has large prime factors. The longer FFTs themselves are then computed -using the FFTPACK routines. -Bluestein's algorithm was implemented according to the description on Wikipedia -( -http://en.wikipedia.org/wiki/Bluestein%27s_FFT_algorithm). - -\b Thread-safety: -All routines can be called concurrently; all information needed by -ls_fft is stored in the plan variable. However, using the same plan -variable on multiple threads simultaneously is not supported and will lead to -data corruption. -*/ -/*! \{ */ - -typedef struct - { - double *work; - size_t length, worksize; - int bluestein; - } complex_plan_i; - -/*! The opaque handle type for complex-FFT plans. */ -typedef complex_plan_i * complex_plan; - -/*! Returns a plan for a complex FFT with \a length elements. */ -complex_plan make_complex_plan (size_t length); -/*! Constructs a copy of \a plan. */ -complex_plan copy_complex_plan (complex_plan plan); -/*! Destroys a plan for a complex FFT. */ -void kill_complex_plan (complex_plan plan); -/*! Computes a complex forward FFT on \a data, using \a plan. - \a Data has the form r0, i0, r1, i1, ..., - r[length-1], i[length-1]. */ -void complex_plan_forward (complex_plan plan, double *data); -/*! Computes a complex backward FFT on \a data, using \a plan. - \a Data has the form r0, i0, r1, i1, ..., - r[length-1], i[length-1]. */ -void complex_plan_backward (complex_plan plan, double *data); - -typedef struct - { - double *work; - size_t length, worksize; - int bluestein; - } real_plan_i; - -/*! The opaque handle type for real-FFT plans. */ -typedef real_plan_i * real_plan; - -/*! Returns a plan for a real FFT with \a length elements. */ -real_plan make_real_plan (size_t length); -/*! Constructs a copy of \a plan. */ -real_plan copy_real_plan (real_plan plan); -/*! Destroys a plan for a real FFT. */ -void kill_real_plan (real_plan plan); -/*! Computes a real forward FFT on \a data, using \a plan - and assuming the FFTPACK storage scheme: - - on entry, \a data has the form r0, r1, ..., r[length-1]; - - on exit, it has the form r0, r1, i1, r2, i2, ... - (a total of \a length values). */ -void real_plan_forward_fftpack (real_plan plan, double *data); -/*! Computes a real backward FFT on \a data, using \a plan - and assuming the FFTPACK storage scheme: - - on entry, \a data has the form r0, r1, i1, r2, i2, ... - (a total of \a length values); - - on exit, it has the form r0, r1, ..., r[length-1]. */ -void real_plan_backward_fftpack (real_plan plan, double *data); -/*! Computes a real forward FFT on \a data, using \a plan - and assuming the FFTW halfcomplex storage scheme: - - on entry, \a data has the form r0, r1, ..., r[length-1]; - - on exit, it has the form r0, r1, r2, ..., i2, i1. */ -void real_plan_forward_fftw (real_plan plan, double *data); -/*! Computes a real backward FFT on \a data, using \a plan - and assuming the FFTW halfcomplex storage scheme: - - on entry, \a data has the form r0, r1, r2, ..., i2, i1. - - on exit, it has the form r0, r1, ..., r[length-1]. */ -void real_plan_backward_fftw (real_plan plan, double *data); -/*! Computes a real forward FFT on \a data, using \a plan - and assuming a full-complex storage scheme: - - on entry, \a data has the form r0, [ignored], r1, [ignored], ..., - r[length-1], [ignored]; - - on exit, it has the form r0, i0, r1, i1, ..., - r[length-1], i[length-1]. */ -void real_plan_forward_c (real_plan plan, double *data); -/*! Computes a real backward FFT on \a data, using \a plan - and assuming a full-complex storage scheme: - - on entry, \a data has the form r0, i0, r1, i1, ..., - r[length-1], i[length-1]; - - on exit, it has the form r0, 0, r1, 0, ..., r[length-1], 0. */ -void real_plan_backward_c (real_plan plan, double *data); - -/*! \} */ - -#ifdef __cplusplus -} -#endif - -#endif diff --git a/external/sharp/libfftpack/planck.make b/external/sharp/libfftpack/planck.make deleted file mode 100644 index c171367..0000000 --- a/external/sharp/libfftpack/planck.make +++ /dev/null @@ -1,21 +0,0 @@ -PKG:=libfftpack - -SD:=$(SRCROOT)/$(PKG) -OD:=$(BLDROOT)/$(PKG) - -FULL_INCLUDE+= -I$(SD) - -HDR_$(PKG):=$(SD)/*.h -LIB_$(PKG):=$(LIBDIR)/libfftpack.a -OBJ:=fftpack.o bluestein.o ls_fft.o -OBJ:=$(OBJ:%=$(OD)/%) - -ODEP:=$(HDR_$(PKG)) $(HDR_c_utils) - -$(OD)/fftpack.o: $(SD)/fftpack_inc.c - -$(OBJ): $(ODEP) | $(OD)_mkdir -$(LIB_$(PKG)): $(OBJ) - -all_hdr+=$(HDR_$(PKG)) -all_lib+=$(LIB_$(PKG)) diff --git a/external/sharp/libsharp/libsharp.dox b/external/sharp/libsharp/libsharp.dox deleted file mode 100644 index 4c441f1..0000000 --- a/external/sharp/libsharp/libsharp.dox +++ /dev/null @@ -1,85 +0,0 @@ -/*! \mainpage libsharp documentation - - */ - -/*! \page introduction Introduction to libsharp - - "SHARP" is an acronym for Spherical HARmonic Package. - All user-visible data types and functions in this library start with - the prefix "sharp_" to avoid pollution of the global C namespace. - - libsharp's main functionality is the conversion between maps - on the sphere and spherical harmonic coefficients (or a_lm). - A map is defined as a set of rings, which in turn consist of - individual pixels that -
      -
    • all have the same colatitude and
      • -
    • are uniformly spaced in azimuthal direction.
      • -
    - Consequently, a ring is completely defined by -
      -
    • its colatitute (in radians)
      • -
    • the number of pixels it contains
      • -
    • the azimuth (in radians) of the first pixel in the ring
      • -
    • the weight that must be multiplied to every pixel during a map - analysis (typically the solid angle of a pixel in the ring)
      • -
    • the offset of the first ring pixel in the map array
      • -
    • the stride between consecutive pixels in the ring.
      • -
    - The map array is a one-dimensional array of type float or - double, which contains the values of all map pixels. It is assumed - that the pixels of every ring are stored inside this array in order of - increasing azimuth and with the specified stride. Note however that the rings - themselves can be stored in any order inside the array. - - The a_lm array is a one-dimensional array of type complex float or - complex double, which contains all spherical harmonic coefficients - for a full or partial set of m quantum numbers with 0<=m<=mmax and m<=l<=lmax. - There is only one constraint on the internal structure of the array, which is: - - Index[a_l+1,m] = Index[a_l,m] + stride - - That means that coefficients with identical m but different l - can be interpreted as a one-dimensional array in l with a unique - stride. - - Several functions are provided for efficient index computation in this array; - they are documented \ref almgroup "here". - - Information about a pixelisation of the sphere is stored in objects of - type sharp_geom_info. It is possible to create such an object for any - supported pixelisation by using the function sharp_make_geometry_info(); - however, several easier-to-use functions are \ref geominfogroup "supplied" - for generating often-used pixelisations like ECP grids, Gaussian grids, - and Healpix grids. - - Currently, libsharp supports the following kinds of transforms: -
      -
    • scalar a_lm to map
      • -
    • scalar map to a_lm
      • - -
    • spin a_lm to map
      • -
    • spin map to a_lm
      • -
    • scalar a_lm to maps of first derivatives
      • -
    - - libsharp supports shared-memory parallelisation via OpenMP; this feature will - be automatically enabled if the compiler supports it. - - Libsharp will also make use of SSE2 and AVX instructions when compiled for a - platform known to support them. - - Support for MPI-parallel transforms is also available; in this mode, - every MPI task must provide a unique subset of the map and a_lm coefficients. - - The spherical harmonic transforms can be executed on double-precision and - single-precision maps and a_lm, but for accuracy reasons the computations - will always be performed in double precision. As a consequence, - single-precision transforms will most likely not be faster than their - double-precision counterparts, but they will require significantly less - memory. -*/ diff --git a/external/sharp/libsharp/planck.make b/external/sharp/libsharp/planck.make deleted file mode 100644 index 8bbd7e1..0000000 --- a/external/sharp/libsharp/planck.make +++ /dev/null @@ -1,29 +0,0 @@ -PKG:=libsharp - -SD:=$(SRCROOT)/$(PKG) -OD:=$(BLDROOT)/$(PKG) - -FULL_INCLUDE+= -I$(SD) - -HDR_$(PKG):=$(SD)/*.h -LIB_$(PKG):=$(LIBDIR)/libsharp.a -BIN:=sharp_testsuite -LIBOBJ:=sharp_ylmgen_c.o sharp.o sharp_announce.o sharp_geomhelpers.o sharp_almhelpers.o sharp_core.o sharp_legendre.o sharp_legendre_roots.o -ALLOBJ:=$(LIBOBJ) sharp_testsuite.o -LIBOBJ:=$(LIBOBJ:%=$(OD)/%) -ALLOBJ:=$(ALLOBJ:%=$(OD)/%) - -ODEP:=$(HDR_$(PKG)) $(HDR_libfftpack) $(HDR_c_utils) -$(OD)/sharp_core.o: $(SD)/sharp_core_inchelper.c $(SD)/sharp_core_inc.c $(SD)/sharp_core_inc2.c -$(OD)/sharp.o: $(SD)/sharp_mpi.c -BDEP:=$(LIB_$(PKG)) $(LIB_libfftpack) $(LIB_c_utils) - -$(LIB_$(PKG)): $(LIBOBJ) - -$(ALLOBJ): $(ODEP) | $(OD)_mkdir -BIN:=$(BIN:%=$(BINDIR)/%) -$(BIN): $(BINDIR)/% : $(OD)/%.o $(BDEP) - -all_hdr+=$(HDR_$(PKG)) -all_lib+=$(LIB_$(PKG)) -all_cbin+=$(BIN) diff --git a/external/sharp/libsharp/sharp.c b/external/sharp/libsharp/sharp.c deleted file mode 100644 index 1eb8857..0000000 --- a/external/sharp/libsharp/sharp.c +++ /dev/null @@ -1,1020 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp.c - * Spherical transform library - * - * Copyright (C) 2006-2013 Max-Planck-Society - * \author Martin Reinecke \author Dag Sverre Seljebotn - */ - -#include -#include "ls_fft.h" -#include "sharp_ylmgen_c.h" -#include "sharp_internal.h" -#include "c_utils.h" -#include "sharp_core.h" -#include "sharp_vecutil.h" -#include "walltime_c.h" -#include "sharp_almhelpers.h" -#include "sharp_geomhelpers.h" - -typedef complex double dcmplx; -typedef complex float fcmplx; - -static const double sqrt_one_half = 0.707106781186547572737310929369; -static const double sqrt_two = 1.414213562373095145474621858739; - -static int chunksize_min=500, nchunks_max=10; - -static void get_chunk_info (int ndata, int nmult, int *nchunks, int *chunksize) - { - *chunksize = (ndata+nchunks_max-1)/nchunks_max; - if (*chunksize>=chunksize_min) // use max number of chunks - *chunksize = ((*chunksize+nmult-1)/nmult)*nmult; - else // need to adjust chunksize and nchunks - { - *nchunks = (ndata+chunksize_min-1)/chunksize_min; - *chunksize = (ndata+(*nchunks)-1)/(*nchunks); - if (*nchunks>1) - *chunksize = ((*chunksize+nmult-1)/nmult)*nmult; - } - *nchunks = (ndata+(*chunksize)-1)/(*chunksize); - } - -int sharp_get_mlim (int lmax, int spin, double sth, double cth) - { - double ofs=lmax*0.01; - if (ofs<100.) ofs=100.; - double b = -2*spin*fabs(cth); - double t1 = lmax*sth+ofs; - double c = (double)spin*spin-t1*t1; - double discr = b*b-4*c; - if (discr<=0) return lmax; - double res=(-b+sqrt(discr))/2.; - if (res>lmax) res=lmax; - return (int)(res+0.5); - } - -typedef struct - { - double phi0_; - dcmplx *shiftarr; - int s_shift; - real_plan plan; - int norot; - } ringhelper; - -static void ringhelper_init (ringhelper *self) - { - static ringhelper rh_null = { 0, NULL, 0, NULL, 0 }; - *self = rh_null; - } - -static void ringhelper_destroy (ringhelper *self) - { - if (self->plan) kill_real_plan(self->plan); - DEALLOC(self->shiftarr); - ringhelper_init(self); - } - -static void ringhelper_update (ringhelper *self, int nph, int mmax, double phi0) - { - self->norot = (fabs(phi0)<1e-14); - if (!(self->norot)) - if ((mmax!=self->s_shift-1) || (!FAPPROX(phi0,self->phi0_,1e-12))) - { - RESIZE (self->shiftarr,dcmplx,mmax+1); - self->s_shift = mmax+1; - self->phi0_ = phi0; - for (int m=0; m<=mmax; ++m) - self->shiftarr[m] = cos(m*phi0) + _Complex_I*sin(m*phi0); - } - if (!self->plan) self->plan=make_real_plan(nph); - if (nph!=(int)self->plan->length) - { - kill_real_plan(self->plan); - self->plan=make_real_plan(nph); - } - } - -static int ringinfo_compare (const void *xa, const void *xb) - { - const sharp_ringinfo *a=xa, *b=xb; - return (a->sth < b->sth) ? -1 : (a->sth > b->sth) ? 1 : 0; - } -static int ringpair_compare (const void *xa, const void *xb) - { - const sharp_ringpair *a=xa, *b=xb; - if (a->r1.nph==b->r1.nph) - return (a->r1.phi0 < b->r1.phi0) ? -1 : - ((a->r1.phi0 > b->r1.phi0) ? 1 : - (a->r1.cth>b->r1.cth ? -1 : 1)); - return (a->r1.nphr1.nph) ? -1 : 1; - } - -void sharp_make_general_alm_info (int lmax, int nm, int stride, const int *mval, - const ptrdiff_t *mstart, int flags, sharp_alm_info **alm_info) - { - sharp_alm_info *info = RALLOC(sharp_alm_info,1); - info->lmax = lmax; - info->nm = nm; - info->mval = RALLOC(int,nm); - info->mvstart = RALLOC(ptrdiff_t,nm); - info->stride = stride; - info->flags = flags; - for (int mi=0; mimval[mi] = mval[mi]; - info->mvstart[mi] = mstart[mi]; - } - *alm_info = info; - } - -void sharp_make_alm_info (int lmax, int mmax, int stride, - const ptrdiff_t *mstart, sharp_alm_info **alm_info) - { - int *mval=RALLOC(int,mmax+1); - for (int i=0; i<=mmax; ++i) - mval[i]=i; - sharp_make_general_alm_info (lmax, mmax+1, stride, mval, mstart, 0, alm_info); - DEALLOC(mval); - } - -ptrdiff_t sharp_alm_index (const sharp_alm_info *self, int l, int mi) - { - UTIL_ASSERT(!(self->flags & SHARP_PACKED), - "sharp_alm_index not applicable with SHARP_PACKED alms"); - return self->mvstart[mi]+self->stride*l; - } - -ptrdiff_t sharp_alm_count(const sharp_alm_info *self) - { - ptrdiff_t result=0; - for (int im=0; im!=self->nm; ++im) - { - int m=self->mval[im]; - ptrdiff_t x=(self->lmax + 1 - m); - if ((m!=0)&&((self->flags&SHARP_PACKED)!=0)) result+=2*x; - else result+=x; - } - return result; - } - -void sharp_destroy_alm_info (sharp_alm_info *info) - { - DEALLOC (info->mval); - DEALLOC (info->mvstart); - DEALLOC (info); - } - -void sharp_make_geom_info (int nrings, const int *nph, const ptrdiff_t *ofs, - const int *stride, const double *phi0, const double *theta, - const double *wgt, sharp_geom_info **geom_info) - { - sharp_geom_info *info = RALLOC(sharp_geom_info,1); - sharp_ringinfo *infos = RALLOC(sharp_ringinfo,nrings); - - int pos=0; - info->pair=RALLOC(sharp_ringpair,nrings); - info->npairs=0; - info->nphmax=0; - *geom_info = info; - - for (int m=0; mnphmaxnphmax=nph[m]; - } - qsort(infos,nrings,sizeof(sharp_ringinfo),ringinfo_compare); - while (pospair[info->npairs].r1=infos[pos]; - if ((pos0) // make sure northern ring is in r1 - info->pair[info->npairs].r2=infos[pos+1]; - else - { - info->pair[info->npairs].r1=infos[pos+1]; - info->pair[info->npairs].r2=infos[pos]; - } - ++pos; - } - else - info->pair[info->npairs].r2.nph=-1; - ++pos; - ++info->npairs; - } - DEALLOC(infos); - - qsort(info->pair,info->npairs,sizeof(sharp_ringpair),ringpair_compare); - } - -ptrdiff_t sharp_map_size(const sharp_geom_info *info) - { - ptrdiff_t result = 0; - for (int m=0; mnpairs; ++m) - { - result+=info->pair[m].r1.nph; - result+=(info->pair[m].r2.nph>=0) ? (info->pair[m].r2.nph) : 0; - } - return result; - } - -void sharp_destroy_geom_info (sharp_geom_info *geom_info) - { - DEALLOC (geom_info->pair); - DEALLOC (geom_info); - } - -/* This currently requires all m values from 0 to nm-1 to be present. - It might be worthwhile to relax this criterion such that holes in the m - distribution are permissible. */ -static int sharp_get_mmax (int *mval, int nm) - { - int *mcheck=RALLOC(int,nm); - SET_ARRAY(mcheck,0,nm,0); - for (int i=0; i=0) && (m_curnph; - - ringhelper_update (self, nph, mmax, info->phi0); - - double wgt = (flags&SHARP_USE_WEIGHTS) ? info->weight : 1.; - if (flags&SHARP_REAL_HARMONICS) - wgt *= sqrt_one_half; - - if (nph>=2*mmax+1) - { - for (int m=0; m<=mmax; ++m) - { - dcmplx tmp = phase[m*pstride]*wgt; - if(!self->norot) tmp*=self->shiftarr[m]; - data[2*m]=creal(tmp); - data[2*m+1]=cimag(tmp); - } - for (int m=2*(mmax+1); mnorot) tmp*=self->shiftarr[m]; - if (idx1<(nph+2)/2) - { - data[2*idx1]+=creal(tmp); - data[2*idx1+1]+=cimag(tmp); - } - if (idx2<(nph+2)/2) - { - data[2*idx2]+=creal(tmp); - data[2*idx2+1]-=cimag(tmp); - } - if (++idx1>=nph) idx1=0; - if (--idx2<0) idx2=nph-1; - } - } - data[1]=data[0]; - real_plan_backward_fftpack (self->plan, &(data[1])); - } - -static void ringhelper_ring2phase (ringhelper *self, - const sharp_ringinfo *info, double *data, int mmax, dcmplx *phase, - int pstride, int flags) - { - int nph = info->nph; -#if 1 - int maxidx = mmax; /* Enable this for traditional Healpix compatibility */ -#else - int maxidx = IMIN(nph-1,mmax); -#endif - - ringhelper_update (self, nph, mmax, -info->phi0); - double wgt = (flags&SHARP_USE_WEIGHTS) ? info->weight : 1; - if (flags&SHARP_REAL_HARMONICS) - wgt *= sqrt_two; - - real_plan_forward_fftpack (self->plan, &(data[1])); - data[0]=data[1]; - data[1]=data[nph+1]=0.; - - if (maxidx<=nph/2) - { - if (self->norot) - for (int m=0; m<=maxidx; ++m) - phase[m*pstride] = (data[2*m] + _Complex_I*data[2*m+1]) * wgt; - else - for (int m=0; m<=maxidx; ++m) - phase[m*pstride] = - (data[2*m] + _Complex_I*data[2*m+1]) * self->shiftarr[m] * wgt; - } - else - { - for (int m=0; m<=maxidx; ++m) - { - int idx=m%nph; - dcmplx val; - if (idx<(nph-idx)) - val = (data[2*idx] + _Complex_I*data[2*idx+1]) * wgt; - else - val = (data[2*(nph-idx)] - _Complex_I*data[2*(nph-idx)+1]) * wgt; - if (!self->norot) - val *= self->shiftarr[m]; - phase[m*pstride]=val; - } - } - - for (int m=maxidx+1;m<=mmax; ++m) - phase[m*pstride]=0.; - } - -static void fill_map (const sharp_geom_info *ginfo, void *map, double value, - int flags) - { - if (flags & SHARP_NO_FFT) - { - for (int j=0;jnpairs;++j) - { - if (flags&SHARP_DP) - { - for (ptrdiff_t i=0;ipair[j].r1.nph;++i) - ((dcmplx *)map)[ginfo->pair[j].r1.ofs+i*ginfo->pair[j].r1.stride] - =value; - for (ptrdiff_t i=0;ipair[j].r2.nph;++i) - ((dcmplx *)map)[ginfo->pair[j].r2.ofs+i*ginfo->pair[j].r2.stride] - =value; - } - else - { - for (ptrdiff_t i=0;ipair[j].r1.nph;++i) - ((fcmplx *)map)[ginfo->pair[j].r1.ofs+i*ginfo->pair[j].r1.stride] - =(float)value; - for (ptrdiff_t i=0;ipair[j].r2.nph;++i) - ((fcmplx *)map)[ginfo->pair[j].r2.ofs+i*ginfo->pair[j].r2.stride] - =(float)value; - } - } - } - else - { - for (int j=0;jnpairs;++j) - { - if (flags&SHARP_DP) - { - for (ptrdiff_t i=0;ipair[j].r1.nph;++i) - ((double *)map)[ginfo->pair[j].r1.ofs+i*ginfo->pair[j].r1.stride] - =value; - for (ptrdiff_t i=0;ipair[j].r2.nph;++i) - ((double *)map)[ginfo->pair[j].r2.ofs+i*ginfo->pair[j].r2.stride] - =value; - } - else - { - for (ptrdiff_t i=0;ipair[j].r1.nph;++i) - ((float *)map)[ginfo->pair[j].r1.ofs+i*ginfo->pair[j].r1.stride] - =(float)value; - for (ptrdiff_t i=0;ipair[j].r2.nph;++i) - ((float *)map)[ginfo->pair[j].r2.ofs+i*ginfo->pair[j].r2.stride] - =(float)value; - } - } - } - } - -static void clear_alm (const sharp_alm_info *ainfo, void *alm, int flags) - { -#define CLEARLOOP(real_t,body) \ - { \ - real_t *talm = (real_t *)alm; \ - for (int l=m;l<=ainfo->lmax;++l) \ - body \ - } - - for (int mi=0;minm;++mi) - { - int m=ainfo->mval[mi]; - ptrdiff_t mvstart = ainfo->mvstart[mi]; - ptrdiff_t stride = ainfo->stride; - if (!(ainfo->flags&SHARP_PACKED)) - mvstart*=2; - if ((ainfo->flags&SHARP_PACKED)&&(m==0)) - { - if (flags&SHARP_DP) - CLEARLOOP(double, talm[mvstart+l*stride] = 0.;) - else - CLEARLOOP(float, talm[mvstart+l*stride] = 0.;) - } - else - { - stride*=2; - if (flags&SHARP_DP) - CLEARLOOP(double,talm[mvstart+l*stride]=talm[mvstart+l*stride+1]=0.;) - else - CLEARLOOP(float,talm[mvstart+l*stride]=talm[mvstart+l*stride+1]=0.;) - } - -#undef CLEARLOOP - } - } - -static void init_output (sharp_job *job) - { - if (job->flags&SHARP_ADD) return; - if (job->type == SHARP_MAP2ALM) - for (int i=0; intrans*job->nalm; ++i) - clear_alm (job->ainfo,job->alm[i],job->flags); - else - for (int i=0; intrans*job->nmaps; ++i) - fill_map (job->ginfo,job->map[i],0.,job->flags); - } - -static void alloc_phase (sharp_job *job, int nm, int ntheta) - { - if (job->type==SHARP_MAP2ALM) - { - if ((nm&1023)==0) nm+=3; // hack to avoid critical strides - job->s_m=2*job->ntrans*job->nmaps; - job->s_th=job->s_m*nm; - } - else - { - if ((ntheta&1023)==0) ntheta+=3; // hack to avoid critical strides - job->s_th=2*job->ntrans*job->nmaps; - job->s_m=job->s_th*ntheta; - } - job->phase=RALLOC(dcmplx,2*job->ntrans*job->nmaps*nm*ntheta); - } - -static void dealloc_phase (sharp_job *job) - { DEALLOC(job->phase); } - -static void alloc_almtmp (sharp_job *job, int lmax) - { job->almtmp=RALLOC(dcmplx,job->ntrans*job->nalm*(lmax+1)); } - -static void dealloc_almtmp (sharp_job *job) - { DEALLOC(job->almtmp); } - -static void alm2almtmp (sharp_job *job, int lmax, int mi) - { - -#define COPY_LOOP(real_t, source_t, expr_of_x) \ - for (int l=job->ainfo->mval[mi]; l<=lmax; ++l) \ - for (int i=0; intrans*job->nalm; ++i) \ - { \ - source_t x = *(source_t *)(((real_t *)job->alm[i])+ofs+l*stride); \ - job->almtmp[job->ntrans*job->nalm*l+i] = expr_of_x; \ - } - - if (job->type!=SHARP_MAP2ALM) - { - ptrdiff_t ofs=job->ainfo->mvstart[mi]; - int stride=job->ainfo->stride; - int m=job->ainfo->mval[mi]; - /* in the case of SHARP_REAL_HARMONICS, phase2ring scales all the - coefficients by sqrt_one_half; here we must compensate to avoid scaling - m=0 */ - double norm_m0=(job->flags&SHARP_REAL_HARMONICS) ? sqrt_two : 1.; - if (!(job->ainfo->flags&SHARP_PACKED)) - ofs *= 2; - if (!((job->ainfo->flags&SHARP_PACKED)&&(m==0))) - stride *= 2; - if (job->spin==0) - { - if (m==0) - { - if (job->flags&SHARP_DP) - COPY_LOOP(double, double, x*norm_m0) - else - COPY_LOOP(float, float, x*norm_m0) - } - else - { - if (job->flags&SHARP_DP) - COPY_LOOP(double, dcmplx, x) - else - COPY_LOOP(float, fcmplx, x) - } - } - else - { - if (m==0) - { - if (job->flags&SHARP_DP) - COPY_LOOP(double, double, x*job->norm_l[l]*norm_m0) - else - COPY_LOOP(float, float, x*job->norm_l[l]*norm_m0) - } - else - { - if (job->flags&SHARP_DP) - COPY_LOOP(double, dcmplx, x*job->norm_l[l]) - else - COPY_LOOP(float, fcmplx, x*job->norm_l[l]) - } - } - } - else - SET_ARRAY(job->almtmp,job->ntrans*job->nalm*job->ainfo->mval[mi], - job->ntrans*job->nalm*(lmax+1),0.); - -#undef COPY_LOOP - } - -static void almtmp2alm (sharp_job *job, int lmax, int mi) - { - -#define COPY_LOOP(real_t, target_t, expr_of_x) \ - for (int l=job->ainfo->mval[mi]; l<=lmax; ++l) \ - for (int i=0; intrans*job->nalm; ++i) \ - { \ - dcmplx x = job->almtmp[job->ntrans*job->nalm*l+i]; \ - *(target_t *)(((real_t *)job->alm[i])+ofs+l*stride) += expr_of_x; \ - } - - if (job->type != SHARP_MAP2ALM) return; - ptrdiff_t ofs=job->ainfo->mvstart[mi]; - int stride=job->ainfo->stride; - int m=job->ainfo->mval[mi]; - /* in the case of SHARP_REAL_HARMONICS, ring2phase scales all the - coefficients by sqrt_two; here we must compensate to avoid scaling - m=0 */ - double norm_m0=(job->flags&SHARP_REAL_HARMONICS) ? sqrt_one_half : 1.; - if (!(job->ainfo->flags&SHARP_PACKED)) - ofs *= 2; - if (!((job->ainfo->flags&SHARP_PACKED)&&(m==0))) - stride *= 2; - if (job->spin==0) - { - if (m==0) - { - if (job->flags&SHARP_DP) - COPY_LOOP(double, double, creal(x)*norm_m0) - else - COPY_LOOP(float, float, crealf(x)*norm_m0) - } - else - { - if (job->flags&SHARP_DP) - COPY_LOOP(double, dcmplx, x) - else - COPY_LOOP(float, fcmplx, (fcmplx)x) - } - } - else - { - if (m==0) - { - if (job->flags&SHARP_DP) - COPY_LOOP(double, double, creal(x)*job->norm_l[l]*norm_m0) - else - COPY_LOOP(float, fcmplx, (float)(creal(x)*job->norm_l[l]*norm_m0)) - } - else - { - if (job->flags&SHARP_DP) - COPY_LOOP(double, dcmplx, x*job->norm_l[l]) - else - COPY_LOOP(float, fcmplx, (fcmplx)(x*job->norm_l[l])) - } - } - -#undef COPY_LOOP - } - -static void ringtmp2ring (sharp_job *job, sharp_ringinfo *ri, double *ringtmp, - int rstride) - { - double **dmap = (double **)job->map; - float **fmap = (float **)job->map; - for (int i=0; intrans*job->nmaps; ++i) - for (int m=0; mnph; ++m) - if (job->flags & SHARP_DP) - dmap[i][ri->ofs+m*ri->stride] += ringtmp[i*rstride+m+1]; - else - fmap[i][ri->ofs+m*ri->stride] += (float)ringtmp[i*rstride+m+1]; - } - -static void ring2ringtmp (sharp_job *job, sharp_ringinfo *ri, double *ringtmp, - int rstride) - { - for (int i=0; intrans*job->nmaps; ++i) - for (int m=0; mnph; ++m) - ringtmp[i*rstride+m+1] = (job->flags & SHARP_DP) ? - ((double *)(job->map[i]))[ri->ofs+m*ri->stride] : - ((float *)(job->map[i]))[ri->ofs+m*ri->stride]; - } - -static void ring2phase_direct (sharp_job *job, sharp_ringinfo *ri, int mmax, - dcmplx *phase) - { - if (ri->nph<0) - { - for (int i=0; intrans*job->nmaps; ++i) - for (int m=0; m<=mmax; ++m) - phase[2*i+job->s_m*m]=0.; - } - else - { - UTIL_ASSERT(ri->nph==mmax+1,"bad ring size"); - double wgt = (job->flags&SHARP_USE_WEIGHTS) ? (ri->nph*ri->weight) : 1.; - if (job->flags&SHARP_REAL_HARMONICS) - wgt *= sqrt_two; - for (int i=0; intrans*job->nmaps; ++i) - for (int m=0; m<=mmax; ++m) - phase[2*i+job->s_m*m]= (job->flags & SHARP_DP) ? - ((dcmplx *)(job->map[i]))[ri->ofs+m*ri->stride]*wgt : - ((fcmplx *)(job->map[i]))[ri->ofs+m*ri->stride]*wgt; - } - } -static void phase2ring_direct (sharp_job *job, sharp_ringinfo *ri, int mmax, - dcmplx *phase) - { - if (ri->nph<0) return; - UTIL_ASSERT(ri->nph==mmax+1,"bad ring size"); - dcmplx **dmap = (dcmplx **)job->map; - fcmplx **fmap = (fcmplx **)job->map; - double wgt = (job->flags&SHARP_USE_WEIGHTS) ? (ri->nph*ri->weight) : 1.; - if (job->flags&SHARP_REAL_HARMONICS) - wgt *= sqrt_one_half; - for (int i=0; intrans*job->nmaps; ++i) - for (int m=0; m<=mmax; ++m) - if (job->flags & SHARP_DP) - dmap[i][ri->ofs+m*ri->stride] += wgt*phase[2*i+job->s_m*m]; - else - fmap[i][ri->ofs+m*ri->stride] += (fcmplx)(wgt*phase[2*i+job->s_m*m]); - } - -//FIXME: set phase to zero if not SHARP_MAP2ALM? -static void map2phase (sharp_job *job, int mmax, int llim, int ulim) - { - if (job->type != SHARP_MAP2ALM) return; - int pstride = job->s_m; - if (job->flags & SHARP_NO_FFT) - { - for (int ith=llim; iths_th*(ith-llim); - ring2phase_direct(job,&(job->ginfo->pair[ith].r1),mmax, - &(job->phase[dim2])); - ring2phase_direct(job,&(job->ginfo->pair[ith].r2),mmax, - &(job->phase[dim2+1])); - } - } - else - { -#pragma omp parallel if ((job->flags&SHARP_NO_OPENMP)==0) -{ - ringhelper helper; - ringhelper_init(&helper); - int rstride=job->ginfo->nphmax+2; - double *ringtmp=RALLOC(double,job->ntrans*job->nmaps*rstride); -#pragma omp for schedule(dynamic,1) - for (int ith=llim; iths_th*(ith-llim); - ring2ringtmp(job,&(job->ginfo->pair[ith].r1),ringtmp,rstride); - for (int i=0; intrans*job->nmaps; ++i) - ringhelper_ring2phase (&helper,&(job->ginfo->pair[ith].r1), - &ringtmp[i*rstride],mmax,&job->phase[dim2+2*i],pstride,job->flags); - if (job->ginfo->pair[ith].r2.nph>0) - { - ring2ringtmp(job,&(job->ginfo->pair[ith].r2),ringtmp,rstride); - for (int i=0; intrans*job->nmaps; ++i) - ringhelper_ring2phase (&helper,&(job->ginfo->pair[ith].r2), - &ringtmp[i*rstride],mmax,&job->phase[dim2+2*i+1],pstride,job->flags); - } - } - DEALLOC(ringtmp); - ringhelper_destroy(&helper); -} /* end of parallel region */ - } - } - -static void phase2map (sharp_job *job, int mmax, int llim, int ulim) - { - if (job->type == SHARP_MAP2ALM) return; - int pstride = job->s_m; - if (job->flags & SHARP_NO_FFT) - { - for (int ith=llim; iths_th*(ith-llim); - phase2ring_direct(job,&(job->ginfo->pair[ith].r1),mmax, - &(job->phase[dim2])); - phase2ring_direct(job,&(job->ginfo->pair[ith].r2),mmax, - &(job->phase[dim2+1])); - } - } - else - { -#pragma omp parallel if ((job->flags&SHARP_NO_OPENMP)==0) -{ - ringhelper helper; - ringhelper_init(&helper); - int rstride=job->ginfo->nphmax+2; - double *ringtmp=RALLOC(double,job->ntrans*job->nmaps*rstride); -#pragma omp for schedule(dynamic,1) - for (int ith=llim; iths_th*(ith-llim); - for (int i=0; intrans*job->nmaps; ++i) - ringhelper_phase2ring (&helper,&(job->ginfo->pair[ith].r1), - &ringtmp[i*rstride],mmax,&job->phase[dim2+2*i],pstride,job->flags); - ringtmp2ring(job,&(job->ginfo->pair[ith].r1),ringtmp,rstride); - if (job->ginfo->pair[ith].r2.nph>0) - { - for (int i=0; intrans*job->nmaps; ++i) - ringhelper_phase2ring (&helper,&(job->ginfo->pair[ith].r2), - &ringtmp[i*rstride],mmax,&job->phase[dim2+2*i+1],pstride,job->flags); - ringtmp2ring(job,&(job->ginfo->pair[ith].r2),ringtmp,rstride); - } - } - DEALLOC(ringtmp); - ringhelper_destroy(&helper); -} /* end of parallel region */ - } - } - -static void sharp_execute_job (sharp_job *job) - { - double timer=wallTime(); - job->opcnt=0; - int lmax = job->ainfo->lmax, - mmax=sharp_get_mmax(job->ainfo->mval, job->ainfo->nm); - - job->norm_l = (job->type==SHARP_ALM2MAP_DERIV1) ? - sharp_Ylmgen_get_d1norm (lmax) : - sharp_Ylmgen_get_norm (lmax, job->spin); - -/* clear output arrays if requested */ - init_output (job); - - int nchunks, chunksize; - get_chunk_info(job->ginfo->npairs,(job->flags&SHARP_NVMAX)*VLEN,&nchunks, - &chunksize); - alloc_phase (job,mmax+1,chunksize); - -/* chunk loop */ - for (int chunk=0; chunkginfo->npairs); - int *ispair = RALLOC(int,ulim-llim); - int *mlim = RALLOC(int,ulim-llim); - double *cth = RALLOC(double,ulim-llim), *sth = RALLOC(double,ulim-llim); - for (int i=0; iginfo->pair[i+llim].r2.nph>0; - cth[i] = job->ginfo->pair[i+llim].r1.cth; - sth[i] = job->ginfo->pair[i+llim].r1.sth; - mlim[i] = sharp_get_mlim(lmax, job->spin, sth[i], cth[i]); - } - -/* map->phase where necessary */ - map2phase (job, mmax, llim, ulim); - -#pragma omp parallel if ((job->flags&SHARP_NO_OPENMP)==0) -{ - sharp_job ljob = *job; - ljob.opcnt=0; - sharp_Ylmgen_C generator; - sharp_Ylmgen_init (&generator,lmax,mmax,ljob.spin); - alloc_almtmp(&ljob,lmax); - -#pragma omp for schedule(dynamic,1) - for (int mi=0; miainfo->nm; ++mi) - { -/* alm->alm_tmp where necessary */ - alm2almtmp (&ljob, lmax, mi); - - inner_loop (&ljob, ispair, cth, sth, llim, ulim, &generator, mi, mlim); - -/* alm_tmp->alm where necessary */ - almtmp2alm (&ljob, lmax, mi); - } - - sharp_Ylmgen_destroy(&generator); - dealloc_almtmp(&ljob); - -#pragma omp critical - job->opcnt+=ljob.opcnt; -} /* end of parallel region */ - -/* phase->map where necessary */ - phase2map (job, mmax, llim, ulim); - - DEALLOC(ispair); - DEALLOC(mlim); - DEALLOC(cth); - DEALLOC(sth); - } /* end of chunk loop */ - - DEALLOC(job->norm_l); - dealloc_phase (job); - job->time=wallTime()-timer; - } - -static void sharp_build_job_common (sharp_job *job, sharp_jobtype type, - int spin, void *alm, void *map, const sharp_geom_info *geom_info, - const sharp_alm_info *alm_info, int ntrans, int flags) - { - UTIL_ASSERT((ntrans>0)&&(ntrans<=SHARP_MAXTRANS), - "bad number of simultaneous transforms"); - if (type==SHARP_ALM2MAP_DERIV1) spin=1; - if (type==SHARP_MAP2ALM) flags|=SHARP_USE_WEIGHTS; - if (type==SHARP_Yt) type=SHARP_MAP2ALM; - if (type==SHARP_WY) { type=SHARP_ALM2MAP; flags|=SHARP_USE_WEIGHTS; } - - UTIL_ASSERT((spin>=0)&&(spin<=alm_info->lmax), "bad spin"); - job->type = type; - job->spin = spin; - job->norm_l = NULL; - job->nmaps = (type==SHARP_ALM2MAP_DERIV1) ? 2 : ((spin>0) ? 2 : 1); - job->nalm = (type==SHARP_ALM2MAP_DERIV1) ? 1 : ((spin>0) ? 2 : 1); - job->ginfo = geom_info; - job->ainfo = alm_info; - job->flags = flags; - if ((job->flags&SHARP_NVMAX)==0) - job->flags|=sharp_nv_oracle (type, spin, ntrans); - if (alm_info->flags&SHARP_REAL_HARMONICS) - job->flags|=SHARP_REAL_HARMONICS; - job->time = 0.; - job->opcnt = 0; - job->ntrans = ntrans; - job->alm=alm; - job->map=map; - } - -void sharp_execute (sharp_jobtype type, int spin, void *alm, void *map, - const sharp_geom_info *geom_info, const sharp_alm_info *alm_info, int ntrans, - int flags, double *time, unsigned long long *opcnt) - { - sharp_job job; - sharp_build_job_common (&job, type, spin, alm, map, geom_info, alm_info, - ntrans, flags); - - sharp_execute_job (&job); - if (time!=NULL) *time = job.time; - if (opcnt!=NULL) *opcnt = job.opcnt; - } - -void sharp_set_chunksize_min(int new_chunksize_min) - { chunksize_min=new_chunksize_min; } -void sharp_set_nchunks_max(int new_nchunks_max) - { nchunks_max=new_nchunks_max; } - -int sharp_get_nv_max (void) -{ return 6; } - -static int sharp_oracle (sharp_jobtype type, int spin, int ntrans) - { - int lmax=511; - int mmax=(lmax+1)/2; - int nrings=(lmax+1)/4; - int ppring=1; - - spin = (spin!=0) ? 2 : 0; - - ptrdiff_t npix=(ptrdiff_t)nrings*ppring; - sharp_geom_info *tinfo; - sharp_make_gauss_geom_info (nrings, ppring, 0., 1, ppring, &tinfo); - - ptrdiff_t nalms = ((mmax+1)*(mmax+2))/2 + (mmax+1)*(lmax-mmax); - int ncomp = ntrans*((spin==0) ? 1 : 2); - - double **map; - ALLOC2D(map,double,ncomp,npix); - SET_ARRAY(map[0],0,npix*ncomp,0.); - - sharp_alm_info *alms; - sharp_make_triangular_alm_info(lmax,mmax,1,&alms); - - dcmplx **alm; - ALLOC2D(alm,dcmplx,ncomp,nalms); - SET_ARRAY(alm[0],0,nalms*ncomp,0.); - - double time=1e30; - int nvbest=-1; - - for (int nv=1; nv<=sharp_get_nv_max(); ++nv) - { - double time_acc=0.; - double jtime; - int ntries=0; - do - { - sharp_execute(type,spin,&alm[0],&map[0],tinfo,alms,ntrans, - nv|SHARP_DP|SHARP_NO_OPENMP,&jtime,NULL); - - if (jtime0),"bad number of simultaneous transforms"); - UTIL_ASSERT(spin>=0, "bad spin"); - ntrans=IMIN(ntrans,maxtr); - - if (nv_opt[ntrans-1][spin!=0][type]==0) - nv_opt[ntrans-1][spin!=0][type]=sharp_oracle(type,spin,ntrans); - return nv_opt[ntrans-1][spin!=0][type]; - } - -#ifdef USE_MPI -#include "sharp_mpi.c" - -int sharp_execute_mpi_maybe (void *pcomm, sharp_jobtype type, int spin, - void *alm, void *map, const sharp_geom_info *geom_info, - const sharp_alm_info *alm_info, int ntrans, int flags, double *time, - unsigned long long *opcnt) - { - MPI_Comm comm = *(MPI_Comm*)pcomm; - sharp_execute_mpi((MPI_Comm)comm, type, spin, alm, map, geom_info, alm_info, ntrans, - flags, time, opcnt); - return 0; - } - -#else - -int sharp_execute_mpi_maybe (void *pcomm, sharp_jobtype type, int spin, - void *alm, void *map, const sharp_geom_info *geom_info, - const sharp_alm_info *alm_info, int ntrans, int flags, double *time, - unsigned long long *opcnt) - { - /* Suppress unused warning: */ - (void)pcomm; (void)type; (void)spin; (void)alm; (void)map; (void)geom_info; - (void)alm_info; (void)ntrans; (void)flags; (void)time; (void)opcnt; - return SHARP_ERROR_NO_MPI; - } - -#endif diff --git a/external/sharp/libsharp/sharp.h b/external/sharp/libsharp/sharp.h deleted file mode 100644 index 4497dd4..0000000 --- a/external/sharp/libsharp/sharp.h +++ /dev/null @@ -1,45 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp.h - * Interface for the spherical transform library. - * - * Copyright (C) 2006-2012 Max-Planck-Society - * \author Martin Reinecke - */ - -#ifndef PLANCK_SHARP_H -#define PLANCK_SHARP_H - -#ifdef __cplusplus -#error This header file cannot be included from C++, only from C -#endif - -#include - -#include "sharp_lowlevel.h" -#include "sharp_legendre.h" -#include "sharp_legendre_roots.h" - -#endif diff --git a/external/sharp/libsharp/sharp_almhelpers.c b/external/sharp/libsharp/sharp_almhelpers.c deleted file mode 100644 index 6a98309..0000000 --- a/external/sharp/libsharp/sharp_almhelpers.c +++ /dev/null @@ -1,94 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp_almhelpers.c - * Spherical transform library - * - * Copyright (C) 2008-2013 Max-Planck-Society - * \author Martin Reinecke - */ - -#include "sharp_almhelpers.h" -#include "c_utils.h" - -void sharp_make_triangular_alm_info (int lmax, int mmax, int stride, - sharp_alm_info **alm_info) - { - sharp_alm_info *info = RALLOC(sharp_alm_info,1); - info->lmax = lmax; - info->nm = mmax+1; - info->mval = RALLOC(int,mmax+1); - info->mvstart = RALLOC(ptrdiff_t,mmax+1); - info->stride = stride; - info->flags = 0; - ptrdiff_t tval = 2*lmax+1; - for (ptrdiff_t m=0; m<=mmax; ++m) - { - info->mval[m] = m; - info->mvstart[m] = stride*((m*(tval-m))>>1); - } - *alm_info = info; - } - -void sharp_make_rectangular_alm_info (int lmax, int mmax, int stride, - sharp_alm_info **alm_info) - { - sharp_alm_info *info = RALLOC(sharp_alm_info,1); - info->lmax = lmax; - info->nm = mmax+1; - info->mval = RALLOC(int,mmax+1); - info->mvstart = RALLOC(ptrdiff_t,mmax+1); - info->stride = stride; - info->flags = 0; - for (ptrdiff_t m=0; m<=mmax; ++m) - { - info->mval[m] = m; - info->mvstart[m] = stride*m*(lmax+1); - } - *alm_info = info; - } - -void sharp_make_mmajor_real_packed_alm_info (int lmax, int stride, - int nm, const int *ms, sharp_alm_info **alm_info) - { - ptrdiff_t idx; - int f; - sharp_alm_info *info = RALLOC(sharp_alm_info,1); - info->lmax = lmax; - info->nm = nm; - info->mval = RALLOC(int,nm); - info->mvstart = RALLOC(ptrdiff_t,nm); - info->stride = stride; - info->flags = SHARP_PACKED | SHARP_REAL_HARMONICS; - idx = 0; /* tracks the number of 'consumed' elements so far; need to correct by m */ - for (int im=0; im!=nm; ++im) - { - int m=(ms==NULL)?im:ms[im]; - f = (m==0) ? 1 : 2; - info->mval[im] = m; - info->mvstart[im] = stride * (idx - f * m); - idx += f * (lmax + 1 - m); - } - *alm_info = info; - } diff --git a/external/sharp/libsharp/sharp_almhelpers.h b/external/sharp/libsharp/sharp_almhelpers.h deleted file mode 100644 index 3bff317..0000000 --- a/external/sharp/libsharp/sharp_almhelpers.h +++ /dev/null @@ -1,65 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp_almhelpers.h - * SHARP helper function for the creation of a_lm data structures - * - * Copyright (C) 2008-2011 Max-Planck-Society - * \author Martin Reinecke - */ - -#ifndef PLANCK_SHARP_ALMHELPERS_H -#define PLANCK_SHARP_ALMHELPERS_H - -#include "sharp_lowlevel.h" - -#ifdef __cplusplus -extern "C" { -#endif - -/*! Initialises an a_lm data structure according to the scheme used by - Healpix_cxx. - \ingroup almgroup */ -void sharp_make_triangular_alm_info (int lmax, int mmax, int stride, - sharp_alm_info **alm_info); - -/*! Initialises an a_lm data structure according to the scheme used by - Fortran Healpix - \ingroup almgroup */ -void sharp_make_rectangular_alm_info (int lmax, int mmax, int stride, - sharp_alm_info **alm_info); - -/*! Initialises alm_info for mmajor, real, packed spherical harmonics. - Pass \a mmax + 1 to nm and NULL to \a ms in order to use everything; - otherwise you can pick a subset of m to process (should only be used - for MPI parallelization). - \ingroup almgroup */ -void sharp_make_mmajor_real_packed_alm_info (int lmax, int stride, - int nm, const int *ms, sharp_alm_info **alm_info); - -#ifdef __cplusplus -} -#endif - -#endif diff --git a/external/sharp/libsharp/sharp_announce.c b/external/sharp/libsharp/sharp_announce.c deleted file mode 100644 index bc6ee50..0000000 --- a/external/sharp/libsharp/sharp_announce.c +++ /dev/null @@ -1,98 +0,0 @@ -/* - * This file is part of libc_utils. - * - * libc_utils is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libc_utils is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libc_utils; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libc_utils is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp_announce.c - * Banner for module startup - * - * Copyright (C) 2012 Max-Planck-Society - * \author Martin Reinecke - */ - -#include -#include -#include -#ifdef _OPENMP -#include -#endif -#ifdef USE_MPI -#include -#endif - -#include "sharp_announce.h" -#include "sharp_vecutil.h" - -static void OpenMP_status(void) - { -#ifndef _OPENMP - printf("OpenMP: not supported by this binary\n"); -#else - int threads = omp_get_max_threads(); - if (threads>1) - printf("OpenMP active: max. %d threads.\n",threads); - else - printf("OpenMP active, but running with 1 thread only.\n"); -#endif - } - -static void MPI_status(void) - { -#ifndef USE_MPI - printf("MPI: not supported by this binary\n"); -#else - int tasks; - MPI_Comm_size(MPI_COMM_WORLD,&tasks); - if (tasks>1) - printf("MPI active with %d tasks.\n",tasks); - else - printf("MPI active, but running with 1 task only.\n"); -#endif - } - -static void vecmath_status(void) - { printf("Supported vector length: %d\n",VLEN); } - -void sharp_announce (const char *name) - { - size_t m, nlen=strlen(name); - printf("\n+-"); - for (m=0; m -#include -#include "sharp_vecsupport.h" - -#define UNSAFE_CODE - -#if (VLEN==1) - -static inline complex double vhsum_cmplx(Tv a, Tv b) - { return a+_Complex_I*b; } - -static inline void vhsum_cmplx2 (Tv a, Tv b, Tv c, Tv d, - complex double * restrict c1, complex double * restrict c2) - { *c1 += a+_Complex_I*b; *c2 += c+_Complex_I*d; } - -#endif - -#if (VLEN==2) - -static inline complex double vhsum_cmplx (Tv a, Tv b) - { -#if defined(__SSE3__) - Tv tmp = _mm_hadd_pd(a,b); -#else - Tv tmp = vadd(_mm_shuffle_pd(a,b,_MM_SHUFFLE2(0,1)), - _mm_shuffle_pd(a,b,_MM_SHUFFLE2(1,0))); -#endif - union {Tv v; complex double c; } u; - u.v=tmp; return u.c; - } - -static inline void vhsum_cmplx2 (Tv a, Tv b, Tv c, - Tv d, complex double * restrict c1, complex double * restrict c2) - { -#ifdef UNSAFE_CODE -#if defined(__SSE3__) - vaddeq(*((__m128d *)c1),_mm_hadd_pd(a,b)); - vaddeq(*((__m128d *)c2),_mm_hadd_pd(c,d)); -#else - vaddeq(*((__m128d *)c1),vadd(_mm_shuffle_pd(a,b,_MM_SHUFFLE2(0,1)), - _mm_shuffle_pd(a,b,_MM_SHUFFLE2(1,0)))); - vaddeq(*((__m128d *)c2),vadd(_mm_shuffle_pd(c,d,_MM_SHUFFLE2(0,1)), - _mm_shuffle_pd(c,d,_MM_SHUFFLE2(1,0)))); -#endif -#else - union {Tv v; complex double c; } u1, u2; -#if defined(__SSE3__) - u1.v = _mm_hadd_pd(a,b); u2.v=_mm_hadd_pd(c,d); -#else - u1.v = vadd(_mm_shuffle_pd(a,b,_MM_SHUFFLE2(0,1)), - _mm_shuffle_pd(a,b,_MM_SHUFFLE2(1,0))); - u2.v = vadd(_mm_shuffle_pd(c,d,_MM_SHUFFLE2(0,1)), - _mm_shuffle_pd(c,d,_MM_SHUFFLE2(1,0))); -#endif - *c1+=u1.c; *c2+=u2.c; -#endif - } - -#endif - -#if (VLEN==4) - -static inline complex double vhsum_cmplx (Tv a, Tv b) - { - Tv tmp=_mm256_hadd_pd(a,b); - Tv tmp2=_mm256_permute2f128_pd(tmp,tmp,1); - tmp=_mm256_add_pd(tmp,tmp2); -#ifdef UNSAFE_CODE - complex double ret; - *((__m128d *)&ret)=_mm256_extractf128_pd(tmp, 0); - return ret; -#else - union {Tv v; complex double c[2]; } u; - u.v=tmp; return u.c[0]; -#endif - } - -static inline void vhsum_cmplx2 (Tv a, Tv b, Tv c, Tv d, - complex double * restrict c1, complex double * restrict c2) - { - Tv tmp1=_mm256_hadd_pd(a,b), tmp2=_mm256_hadd_pd(c,d); - Tv tmp3=_mm256_permute2f128_pd(tmp1,tmp2,49), - tmp4=_mm256_permute2f128_pd(tmp1,tmp2,32); - tmp1=vadd(tmp3,tmp4); -#ifdef UNSAFE_CODE - *((__m128d *)c1)=_mm_add_pd(*((__m128d *)c1),_mm256_extractf128_pd(tmp1, 0)); - *((__m128d *)c2)=_mm_add_pd(*((__m128d *)c2),_mm256_extractf128_pd(tmp1, 1)); -#else - union {Tv v; complex double c[2]; } u; - u.v=tmp1; - *c1+=u.c[0]; *c2+=u.c[1]; -#endif - } - -#endif - -#if (VLEN==8) - -static inline complex double vhsum_cmplx(Tv a, Tv b) - { return _mm512_reduce_add_pd(a)+_Complex_I*_mm512_reduce_add_pd(b); } - -static inline void vhsum_cmplx2 (Tv a, Tv b, Tv c, Tv d, - complex double * restrict c1, complex double * restrict c2) - { - *c1 += _mm512_reduce_add_pd(a)+_Complex_I*_mm512_reduce_add_pd(b); - *c2 += _mm512_reduce_add_pd(c)+_Complex_I*_mm512_reduce_add_pd(d); - } - -#endif - -#endif diff --git a/external/sharp/libsharp/sharp_core.c b/external/sharp/libsharp/sharp_core.c deleted file mode 100644 index 7cd2f17..0000000 --- a/external/sharp/libsharp/sharp_core.c +++ /dev/null @@ -1,240 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp_core.c - * Computational core - * - * Copyright (C) 2012-2013 Max-Planck-Society - * \author Martin Reinecke - */ - -#include -#include -#include -#include "sharp_vecsupport.h" -#include "sharp_complex_hacks.h" -#include "sharp_ylmgen_c.h" -#include "sharp.h" -#include "sharp_core.h" -#include "c_utils.h" - -typedef complex double dcmplx; - -// must be in the range [0;6] -#define MAXJOB_SPECIAL 2 - -#define XCONCAT2(a,b) a##_##b -#define CONCAT2(a,b) XCONCAT2(a,b) -#define XCONCAT3(a,b,c) a##_##b##_##c -#define CONCAT3(a,b,c) XCONCAT3(a,b,c) - -#define nvec 1 -#include "sharp_core_inchelper.c" -#undef nvec - -#define nvec 2 -#include "sharp_core_inchelper.c" -#undef nvec - -#define nvec 3 -#include "sharp_core_inchelper.c" -#undef nvec - -#define nvec 4 -#include "sharp_core_inchelper.c" -#undef nvec - -#define nvec 5 -#include "sharp_core_inchelper.c" -#undef nvec - -#define nvec 6 -#include "sharp_core_inchelper.c" -#undef nvec - -void inner_loop (sharp_job *job, const int *ispair,const double *cth, - const double *sth, int llim, int ulim, sharp_Ylmgen_C *gen, int mi, - const int *mlim) - { - int njobs=job->ntrans, nv=job->flags&SHARP_NVMAX; - if (njobs<=MAXJOB_SPECIAL) - { - switch (njobs*16+nv) - { -#if ((MAXJOB_SPECIAL>=1)&&(SHARP_MAXTRANS>=1)) - case 0x11: - CONCAT3(inner_loop,1,1) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x12: - CONCAT3(inner_loop,2,1) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x13: - CONCAT3(inner_loop,3,1) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x14: - CONCAT3(inner_loop,4,1) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x15: - CONCAT3(inner_loop,5,1) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x16: - CONCAT3(inner_loop,6,1) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; -#endif -#if ((MAXJOB_SPECIAL>=2)&&(SHARP_MAXTRANS>=2)) - case 0x21: - CONCAT3(inner_loop,1,2) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x22: - CONCAT3(inner_loop,2,2) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x23: - CONCAT3(inner_loop,3,2) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x24: - CONCAT3(inner_loop,4,2) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x25: - CONCAT3(inner_loop,5,2) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x26: - CONCAT3(inner_loop,6,2) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; -#endif -#if ((MAXJOB_SPECIAL>=3)&&(SHARP_MAXTRANS>=3)) - case 0x31: - CONCAT3(inner_loop,1,3) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x32: - CONCAT3(inner_loop,2,3) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x33: - CONCAT3(inner_loop,3,3) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x34: - CONCAT3(inner_loop,4,3) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x35: - CONCAT3(inner_loop,5,3) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x36: - CONCAT3(inner_loop,6,3) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; -#endif -#if ((MAXJOB_SPECIAL>=4)&&(SHARP_MAXTRANS>=4)) - case 0x41: - CONCAT3(inner_loop,1,4) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x42: - CONCAT3(inner_loop,2,4) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x43: - CONCAT3(inner_loop,3,4) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x44: - CONCAT3(inner_loop,4,4) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x45: - CONCAT3(inner_loop,5,4) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x46: - CONCAT3(inner_loop,6,4) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; -#endif -#if ((MAXJOB_SPECIAL>=5)&&(SHARP_MAXTRANS>=5)) - case 0x51: - CONCAT3(inner_loop,1,5) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x52: - CONCAT3(inner_loop,2,5) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x53: - CONCAT3(inner_loop,3,5) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x54: - CONCAT3(inner_loop,4,5) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x55: - CONCAT3(inner_loop,5,5) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x56: - CONCAT3(inner_loop,6,5) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; -#endif -#if ((MAXJOB_SPECIAL>=6)&&(SHARP_MAXTRANS>=6)) - case 0x61: - CONCAT3(inner_loop,1,6) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x62: - CONCAT3(inner_loop,2,6) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x63: - CONCAT3(inner_loop,3,6) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x64: - CONCAT3(inner_loop,4,6) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x65: - CONCAT3(inner_loop,5,6) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; - case 0x66: - CONCAT3(inner_loop,6,6) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); - return; -#endif - } - } -#if (SHARP_MAXTRANS>MAXJOB_SPECIAL) - else - { - switch (nv) - { - case 1: - CONCAT2(inner_loop,1) - (job, ispair,cth,sth,llim,ulim,gen,mi,mlim,job->ntrans); - return; - case 2: - CONCAT2(inner_loop,2) - (job, ispair,cth,sth,llim,ulim,gen,mi,mlim,job->ntrans); - return; - case 3: - CONCAT2(inner_loop,3) - (job, ispair,cth,sth,llim,ulim,gen,mi,mlim,job->ntrans); - return; - case 4: - CONCAT2(inner_loop,4) - (job, ispair,cth,sth,llim,ulim,gen,mi,mlim,job->ntrans); - return; - case 5: - CONCAT2(inner_loop,5) - (job, ispair,cth,sth,llim,ulim,gen,mi,mlim,job->ntrans); - return; - case 6: - CONCAT2(inner_loop,6) - (job, ispair,cth,sth,llim,ulim,gen,mi,mlim,job->ntrans); - return; - } - } -#endif - UTIL_FAIL("Incorrect vector parameters"); - } diff --git a/external/sharp/libsharp/sharp_core.h b/external/sharp/libsharp/sharp_core.h deleted file mode 100644 index 1e86488..0000000 --- a/external/sharp/libsharp/sharp_core.h +++ /dev/null @@ -1,50 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp_core.h - * Interface for the computational core - * - * Copyright (C) 2012-2013 Max-Planck-Society - * \author Martin Reinecke - */ - -#ifndef PLANCK_SHARP_CORE_H -#define PLANCK_SHARP_CORE_H - -#include "sharp_internal.h" -#include "sharp_ylmgen_c.h" - -#ifdef __cplusplus -extern "C" { -#endif - -void inner_loop (sharp_job *job, const int *ispair,const double *cth, - const double *sth, int llim, int ulim, sharp_Ylmgen_C *gen, int mi, - const int *mlim); - -#ifdef __cplusplus -} -#endif - -#endif diff --git a/external/sharp/libsharp/sharp_core_inc.c b/external/sharp/libsharp/sharp_core_inc.c deleted file mode 100644 index 747658c..0000000 --- a/external/sharp/libsharp/sharp_core_inc.c +++ /dev/null @@ -1,293 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp_core_inc.c - * Type-dependent code for the computational core - * - * Copyright (C) 2012 Max-Planck-Society - * \author Martin Reinecke - */ - -typedef struct - { Tv v[nvec]; } Tb; - -typedef union - { Tb b; double s[VLEN*nvec]; } Y(Tbu); - -typedef struct - { Tb r, i; } Y(Tbri); - -typedef struct - { Tb qr, qi, ur, ui; } Y(Tbqu); - -typedef struct - { double r[VLEN*nvec], i[VLEN*nvec]; } Y(Tsri); - -typedef struct - { double qr[VLEN*nvec],qi[VLEN*nvec],ur[VLEN*nvec],ui[VLEN*nvec]; } Y(Tsqu); - -typedef union - { Y(Tbri) b; Y(Tsri)s; } Y(Tburi); - -typedef union - { Y(Tbqu) b; Y(Tsqu)s; } Y(Tbuqu); - -static inline Tb Y(Tbconst)(double val) - { - Tv v=vload(val); - Tb res; - for (int i=0; iv[i],v); } - -static inline Tb Y(Tbprod)(Tb a, Tb b) - { Tb r; for (int i=0; iv[i],b.v[i]); } - -static void Y(Tbnormalize) (Tb * restrict val, Tb * restrict scale, - double maxval) - { - const Tv vfsmall=vload(sharp_fsmall), vfbig=vload(sharp_fbig); - const Tv vfmin=vload(sharp_fsmall*maxval), vfmax=vload(maxval); - for (int i=0;iv[i]),vfmax); - while (vanyTrue(mask)) - { - vmuleq_mask(mask,val->v[i],vfsmall); - vaddeq_mask(mask,scale->v[i],vone); - mask = vgt(vabs(val->v[i]),vfmax); - } - mask = vand_mask(vlt(vabs(val->v[i]),vfmin),vne(val->v[i],vzero)); - while (vanyTrue(mask)) - { - vmuleq_mask(mask,val->v[i],vfbig); - vsubeq_mask(mask,scale->v[i],vone); - mask = vand_mask(vlt(vabs(val->v[i]),vfmin),vne(val->v[i],vzero)); - } - } - } - -static void Y(mypow) (Tb val, int npow, Tb * restrict resd, - Tb * restrict ress) - { - Tb scale=Y(Tbconst)(0.), scaleint=Y(Tbconst)(0.), res=Y(Tbconst)(1.); - - Y(Tbnormalize)(&val,&scaleint,sharp_fbighalf); - - do - { - if (npow&1) - { - for (int i=0; i>=1); - - *resd=res; - *ress=scale; - } - -static inline int Y(rescale) (Tb * restrict lam1, Tb * restrict lam2, - Tb * restrict scale) - { - int did_scale=0; - for (int i=0;iv[i]),vload(sharp_ftol)); - if (vanyTrue(mask)) - { - did_scale=1; - vmuleq_mask(mask,lam1->v[i],vload(sharp_fsmall)); - vmuleq_mask(mask,lam2->v[i],vload(sharp_fsmall)); - vaddeq_mask(mask,scale->v[i],vone); - } - } - return did_scale; - } - -static inline int Y(TballLt)(Tb a,double b) - { - Tv vb=vload(b); - Tm res=vlt(a.v[0],vb); - for (int i=1; im; - Tb lam_1=Y(Tbconst)(0.), lam_2, scale; - Y(mypow) (sth,l,&lam_2,&scale); - Y(Tbmuleq1) (&lam_2,(gen->m&1) ? -gen->mfac[gen->m]:gen->mfac[gen->m]); - Y(Tbnormalize)(&lam_2,&scale,sharp_ftol); - - int below_limit = Y(TballLt)(scale,sharp_limscale); - while (below_limit) - { - if (l+2>gen->lmax) {*l_=gen->lmax+1;return;} - Tv r0=vload(gen->rf[l].f[0]),r1=vload(gen->rf[l].f[1]); - for (int i=0; irf[l+1].f[0]); r1=vload(gen->rf[l+1].f[1]); - for (int i=0; iv[i] = vsub(vmul(vsub(cth.v[i],fx1),vmul(fx0,ryp->v[i])), - vmul(fx2,rxp->v[i])); - rxm->v[i] = vsub(vmul(vadd(cth.v[i],fx1),vmul(fx0,rym->v[i])), - vmul(fx2,rxm->v[i])); - } - } - -static void Y(iter_to_ieee_spin) (const Tb cth, const Tb sth, int *l_, - Tb * rec1p_, Tb * rec1m_, Tb * rec2p_, Tb * rec2m_, - Tb * scalep_, Tb * scalem_, const sharp_Ylmgen_C * restrict gen) - { - const sharp_ylmgen_dbl3 * restrict fx = gen->fx; - Tb cth2, sth2; - for (int i=0; icosPow,&ccp,&ccps); Y(mypow)(sth2,gen->sinPow,&ssp,&ssps); - Y(mypow)(cth2,gen->sinPow,&csp,&csps); Y(mypow)(sth2,gen->cosPow,&scp,&scps); - - Tb rec2p, rec2m, scalep, scalem; - Tb rec1p=Y(Tbconst)(0.), rec1m=Y(Tbconst)(0.); - Tv prefac=vload(gen->prefac[gen->m]), - prescale=vload(gen->fscale[gen->m]); - for (int i=0; ipreMinus_p) - rec2p.v[i]=vneg(rec2p.v[i]); - if (gen->preMinus_m) - rec2m.v[i]=vneg(rec2m.v[i]); - if (gen->s&1) - rec2p.v[i]=vneg(rec2p.v[i]); - } - Y(Tbnormalize)(&rec2m,&scalem,sharp_ftol); - Y(Tbnormalize)(&rec2p,&scalep,sharp_ftol); - - int l=gen->mhi; - - int below_limit = Y(TballLt)(scalep,sharp_limscale) - && Y(TballLt)(scalem,sharp_limscale); - while (below_limit) - { - if (l+2>gen->lmax) {*l_=gen->lmax+1;return;} - Y(rec_step)(&rec1p,&rec1m,&rec2p,&rec2m,cth,fx[l+1]); - Y(rec_step)(&rec2p,&rec2m,&rec1p,&rec1m,cth,fx[l+2]); - if (Y(rescale)(&rec1p,&rec2p,&scalep) | Y(rescale)(&rec1m,&rec2m,&scalem)) - below_limit = Y(TballLt)(scalep,sharp_limscale) - && Y(TballLt)(scalem,sharp_limscale); - l+=2; - } - - *l_=l; - *rec1p_=rec1p; *rec2p_=rec2p; *scalep_=scalep; - *rec1m_=rec1m; *rec2m_=rec2m; *scalem_=scalem; - } diff --git a/external/sharp/libsharp/sharp_core_inc2.c b/external/sharp/libsharp/sharp_core_inc2.c deleted file mode 100644 index 5c9b4ab..0000000 --- a/external/sharp/libsharp/sharp_core_inc2.c +++ /dev/null @@ -1,803 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp_core_inc2.c - * Type-dependent code for the computational core - * - * Copyright (C) 2012-2013 Max-Planck-Society - * \author Martin Reinecke - */ - -static void Z(alm2map_kernel) (const Tb cth, Y(Tbri) * restrict p1, - Y(Tbri) * restrict p2, Tb lam_1, Tb lam_2, - const sharp_ylmgen_dbl2 * restrict rf, const dcmplx * restrict alm, - int l, int lmax NJ1) - { -if (njobs>1) - { - while (llmax; - Tb lam_1,lam_2,scale; - Y(iter_to_ieee) (sth,cth,&l,&lam_1,&lam_2,&scale,gen); - job->opcnt += (l-gen->m) * 4*VLEN*nvec; - if (l>lmax) return; - job->opcnt += (lmax+1-l) * (4+4*njobs)*VLEN*nvec; - - Tb corfac; - Y(getCorfac)(scale,&corfac,gen->cf); - const sharp_ylmgen_dbl2 * restrict rf = gen->rf; - const dcmplx * restrict alm=job->almtmp; - int full_ieee = Y(TballGe)(scale,sharp_minscale); - while (!full_ieee) - { - for (int j=0; jlmax) break; - Tv r0=vload(rf[l-1].f[0]),r1=vload(rf[l-1].f[1]); - for (int i=0; ilmax) break; - r0=vload(rf[l-1].f[0]); r1=vload(rf[l-1].f[1]); - for (int i=0; icf); - full_ieee = Y(TballGe)(scale,sharp_minscale); - } - } - if (l>lmax) return; - - Y(Tbmuleq)(&lam_1,corfac); Y(Tbmuleq)(&lam_2,corfac); - Z(alm2map_kernel) (cth, p1, p2, lam_1, lam_2, rf, alm, l, lmax NJ2); - } - -static void Z(calc_map2alm) (const Tb cth, const Tb sth, - const sharp_Ylmgen_C *gen, sharp_job *job, const Y(Tbri) * restrict p1, - const Y(Tbri) * restrict p2 NJ1) - { - int lmax=gen->lmax; - Tb lam_1,lam_2,scale; - int l=gen->m; - Y(iter_to_ieee) (sth,cth,&l,&lam_1,&lam_2,&scale,gen); - job->opcnt += (l-gen->m) * 4*VLEN*nvec; - if (l>lmax) return; - job->opcnt += (lmax+1-l) * (4+4*njobs)*VLEN*nvec; - - const sharp_ylmgen_dbl2 * restrict rf = gen->rf; - Tb corfac; - Y(getCorfac)(scale,&corfac,gen->cf); - dcmplx * restrict alm=job->almtmp; - int full_ieee = Y(TballGe)(scale,sharp_minscale); - while (!full_ieee) - { - for (int j=0; jlmax) return; - Tv r0=vload(rf[l-1].f[0]),r1=vload(rf[l-1].f[1]); - for (int i=0; ilmax) return; - r0=vload(rf[l-1].f[0]); r1=vload(rf[l-1].f[1]); - for (int i=0; icf); - full_ieee = Y(TballGe)(scale,sharp_minscale); - } - } - - Y(Tbmuleq)(&lam_1,corfac); Y(Tbmuleq)(&lam_2,corfac); - Z(map2alm_kernel) (cth, p1, p2, lam_1, lam_2, rf, alm, l, lmax NJ2); - } - -static inline void Z(saddstep) (Y(Tbqu) * restrict px, Y(Tbqu) * restrict py, - const Tb rxp, const Tb rxm, const dcmplx * restrict alm NJ1) - { - for (int j=0; jv[i],rxm->v[i]); - vfmaeq(agr,px[j].qr.v[i],lw); - vfmaeq(agi,px[j].qi.v[i],lw); - vfmaeq(acr,px[j].ur.v[i],lw); - vfmaeq(aci,px[j].ui.v[i],lw); - } - for (int i=0; iv[i],rxp->v[i]); - vfmseq(agr,py[j].ui.v[i],lx); - vfmaeq(agi,py[j].ur.v[i],lx); - vfmaeq(acr,py[j].qi.v[i],lx); - vfmseq(aci,py[j].qr.v[i],lx); - } - vhsum_cmplx2(agr,agi,acr,aci,&alm[2*j],&alm[2*j+1]); - } - } - -static void Z(alm2map_spin_kernel) (Tb cth, Y(Tbqu) * restrict p1, - Y(Tbqu) * restrict p2, Tb rec1p, Tb rec1m, Tb rec2p, Tb rec2m, - const sharp_ylmgen_dbl3 * restrict fx, const dcmplx * restrict alm, int l, - int lmax NJ1) - { - while (llmax; - Tb rec1p, rec1m, rec2p, rec2m, scalem, scalep; - Y(iter_to_ieee_spin) - (cth,sth,&l,&rec1p,&rec1m,&rec2p,&rec2m,&scalep,&scalem,gen); - job->opcnt += (l-gen->m) * 10*VLEN*nvec; - if (l>lmax) return; - job->opcnt += (lmax+1-l) * (12+16*njobs)*VLEN*nvec; - - const sharp_ylmgen_dbl3 * restrict fx = gen->fx; - Tb corfacp,corfacm; - Y(getCorfac)(scalep,&corfacp,gen->cf); - Y(getCorfac)(scalem,&corfacm,gen->cf); - const dcmplx * restrict alm=job->almtmp; - int full_ieee = Y(TballGe)(scalep,sharp_minscale) - && Y(TballGe)(scalem,sharp_minscale); - while (!full_ieee) - { - Z(saddstep)(p1, p2, Y(Tbprod)(rec2p,corfacp), Y(Tbprod)(rec2m,corfacm), - &alm[2*njobs*l] NJ2); - if (++l>lmax) break; - Y(rec_step)(&rec1p,&rec1m,&rec2p,&rec2m,cth,fx[l]); - Z(saddstep)(p2, p1, Y(Tbprod)(rec1p,corfacp), Y(Tbprod)(rec1m,corfacm), - &alm[2*njobs*l] NJ2); - if (++l>lmax) break; - Y(rec_step)(&rec2p,&rec2m,&rec1p,&rec1m,cth,fx[l]); - if (Y(rescale)(&rec1p,&rec2p,&scalep) | Y(rescale)(&rec1m,&rec2m,&scalem)) - { - Y(getCorfac)(scalep,&corfacp,gen->cf); - Y(getCorfac)(scalem,&corfacm,gen->cf); - full_ieee = Y(TballGe)(scalep,sharp_minscale) - && Y(TballGe)(scalem,sharp_minscale); - } - } - - if (l>lmax) return; - - Y(Tbmuleq)(&rec1p,corfacp); Y(Tbmuleq)(&rec2p,corfacp); - Y(Tbmuleq)(&rec1m,corfacm); Y(Tbmuleq)(&rec2m,corfacm); - Z(alm2map_spin_kernel) (cth, p1, p2, rec1p, rec1m, rec2p, rec2m, fx, alm, l, - lmax NJ2); - } - -static void Z(calc_map2alm_spin) (Tb cth, Tb sth, - const sharp_Ylmgen_C * restrict gen, sharp_job *job, - const Y(Tbqu) * restrict p1, const Y(Tbqu) * restrict p2 NJ1) - { - int l, lmax=gen->lmax; - Tb rec1p, rec1m, rec2p, rec2m, scalem, scalep; - Y(iter_to_ieee_spin) - (cth,sth,&l,&rec1p,&rec1m,&rec2p,&rec2m,&scalep,&scalem,gen); - job->opcnt += (l-gen->m) * 10*VLEN*nvec; - if (l>lmax) return; - job->opcnt += (lmax+1-l) * (12+16*njobs)*VLEN*nvec; - - const sharp_ylmgen_dbl3 * restrict fx = gen->fx; - Tb corfacp,corfacm; - Y(getCorfac)(scalep,&corfacp,gen->cf); - Y(getCorfac)(scalem,&corfacm,gen->cf); - dcmplx * restrict alm=job->almtmp; - int full_ieee = Y(TballGe)(scalep,sharp_minscale) - && Y(TballGe)(scalem,sharp_minscale); - while (!full_ieee) - { - Tb t1=Y(Tbprod)(rec2p,corfacp), t2=Y(Tbprod)(rec2m,corfacm); - Z(saddstep2)(p1, p2, &t1, &t2, &alm[2*njobs*l] NJ2); - if (++l>lmax) return; - Y(rec_step)(&rec1p,&rec1m,&rec2p,&rec2m,cth,fx[l]); - t1=Y(Tbprod)(rec1p,corfacp); t2=Y(Tbprod)(rec1m,corfacm); - Z(saddstep2)(p2, p1, &t1, &t2, &alm[2*njobs*l] NJ2); - if (++l>lmax) return; - Y(rec_step)(&rec2p,&rec2m,&rec1p,&rec1m,cth,fx[l]); - if (Y(rescale)(&rec1p,&rec2p,&scalep) | Y(rescale)(&rec1m,&rec2m,&scalem)) - { - Y(getCorfac)(scalep,&corfacp,gen->cf); - Y(getCorfac)(scalem,&corfacm,gen->cf); - full_ieee = Y(TballGe)(scalep,sharp_minscale) - && Y(TballGe)(scalem,sharp_minscale); - } - } - - Y(Tbmuleq)(&rec1p,corfacp); Y(Tbmuleq)(&rec2p,corfacp); - Y(Tbmuleq)(&rec1m,corfacm); Y(Tbmuleq)(&rec2m,corfacm); - Z(map2alm_spin_kernel)(cth,p1,p2,rec1p,rec1m,rec2p,rec2m,fx,alm,l,lmax NJ2); - } - -static inline void Z(saddstep_d) (Y(Tbqu) * restrict px, Y(Tbqu) * restrict py, - const Tb rxp, const Tb rxm, const dcmplx * restrict alm NJ1) - { - for (int j=0; jlmax; - Tb rec1p, rec1m, rec2p, rec2m, scalem, scalep; - Y(iter_to_ieee_spin) - (cth,sth,&l,&rec1p,&rec1m,&rec2p,&rec2m,&scalep,&scalem,gen); - job->opcnt += (l-gen->m) * 10*VLEN*nvec; - if (l>lmax) return; - job->opcnt += (lmax+1-l) * (12+8*njobs)*VLEN*nvec; - - const sharp_ylmgen_dbl3 * restrict fx = gen->fx; - Tb corfacp,corfacm; - Y(getCorfac)(scalep,&corfacp,gen->cf); - Y(getCorfac)(scalem,&corfacm,gen->cf); - const dcmplx * restrict alm=job->almtmp; - int full_ieee = Y(TballGe)(scalep,sharp_minscale) - && Y(TballGe)(scalem,sharp_minscale); - while (!full_ieee) - { - Z(saddstep_d)(p1, p2, Y(Tbprod)(rec2p,corfacp), Y(Tbprod)(rec2m,corfacm), - &alm[njobs*l] NJ2); - if (++l>lmax) break; - Y(rec_step)(&rec1p,&rec1m,&rec2p,&rec2m,cth,fx[l]); - Z(saddstep_d)(p2, p1, Y(Tbprod)(rec1p,corfacp), Y(Tbprod)(rec1m,corfacm), - &alm[njobs*l] NJ2); - if (++l>lmax) break; - Y(rec_step)(&rec2p,&rec2m,&rec1p,&rec1m,cth,fx[l]); - if (Y(rescale)(&rec1p,&rec2p,&scalep) | Y(rescale)(&rec1m,&rec2m,&scalem)) - { - Y(getCorfac)(scalep,&corfacp,gen->cf); - Y(getCorfac)(scalem,&corfacm,gen->cf); - full_ieee = Y(TballGe)(scalep,sharp_minscale) - && Y(TballGe)(scalem,sharp_minscale); - } - } - - if (l>lmax) return; - - Y(Tbmuleq)(&rec1p,corfacp); Y(Tbmuleq)(&rec2p,corfacp); - Y(Tbmuleq)(&rec1m,corfacm); Y(Tbmuleq)(&rec2m,corfacm); - Z(alm2map_deriv1_kernel) (cth, p1, p2, rec1p, rec1m, rec2p, rec2m, fx, alm, l, - lmax NJ2); - } - - -#define VZERO(var) do { memset(&(var),0,sizeof(var)); } while(0) - -static void Z(inner_loop) (sharp_job *job, const int *ispair, - const double *cth_, const double *sth_, int llim, int ulim, - sharp_Ylmgen_C *gen, int mi, const int *mlim NJ1) - { - const int nval=nvec*VLEN; - const int m = job->ainfo->mval[mi]; - sharp_Ylmgen_prepare (gen, m); - - switch (job->type) - { - case SHARP_ALM2MAP: - case SHARP_ALM2MAP_DERIV1: - { - if (job->spin==0) - { - for (int ith=0; ith=ulim-llim) itot=ulim-llim-1; - if (mlim[itot]>=m) skip=0; - cth.s[i]=cth_[itot]; sth.s[i]=sth_[itot]; - } - if (!skip) - Z(calc_alm2map) (cth.b,sth.b,gen,job,&p1[0].b,&p2[0].b NJ2); - - for (int i=0; is_th + mi*job->s_m + 2*j; - complex double r1 = p1[j].s.r[i] + p1[j].s.i[i]*_Complex_I, - r2 = p2[j].s.r[i] + p2[j].s.i[i]*_Complex_I; - job->phase[phas_idx] = r1+r2; - if (ispair[itot]) - job->phase[phas_idx+1] = r1-r2; - } - } - } - } - } - else - { - for (int ith=0; ith=ulim-llim) itot=ulim-llim-1; - if (mlim[itot]>=m) skip=0; - cth.s[i]=cth_[itot]; sth.s[i]=sth_[itot]; - } - if (!skip) - (job->type==SHARP_ALM2MAP) ? - Z(calc_alm2map_spin ) - (cth.b,sth.b,gen,job,&p1[0].b,&p2[0].b NJ2) : - Z(calc_alm2map_deriv1) - (cth.b,sth.b,gen,job,&p1[0].b,&p2[0].b NJ2); - - for (int i=0; is_th + mi*job->s_m + 4*j; - complex double q1 = p1[j].s.qr[i] + p1[j].s.qi[i]*_Complex_I, - q2 = p2[j].s.qr[i] + p2[j].s.qi[i]*_Complex_I, - u1 = p1[j].s.ur[i] + p1[j].s.ui[i]*_Complex_I, - u2 = p2[j].s.ur[i] + p2[j].s.ui[i]*_Complex_I; - job->phase[phas_idx] = q1+q2; - job->phase[phas_idx+2] = u1+u2; - if (ispair[itot]) - { - dcmplx *phQ = &(job->phase[phas_idx+1]), - *phU = &(job->phase[phas_idx+3]); - *phQ = q1-q2; - *phU = u1-u2; - if ((gen->mhi-gen->m+gen->s)&1) - { *phQ=-(*phQ); *phU=-(*phU); } - } - } - } - } - } - } - break; - } - case SHARP_MAP2ALM: - { - if (job->spin==0) - { - for (int ith=0; ith=ulim-llim) itot=ulim-llim-1; - if (mlim[itot]>=m) skip=0; - cth.s[i]=cth_[itot]; sth.s[i]=sth_[itot]; - if ((i+ith=m)) - { - for (int j=0; js_th + mi*job->s_m + 2*j; - dcmplx ph1=job->phase[phas_idx]; - dcmplx ph2=ispair[itot] ? job->phase[phas_idx+1] : 0.; - p1[j].s.r[i]=creal(ph1+ph2); p1[j].s.i[i]=cimag(ph1+ph2); - p2[j].s.r[i]=creal(ph1-ph2); p2[j].s.i[i]=cimag(ph1-ph2); - } - } - } - if (!skip) - Z(calc_map2alm)(cth.b,sth.b,gen,job,&p1[0].b,&p2[0].b NJ2); - } - } - else - { - for (int ith=0; ith=ulim-llim) itot=ulim-llim-1; - if (mlim[itot]>=m) skip=0; - cth.s[i]=cth_[itot]; sth.s[i]=sth_[itot]; - if (i+iths_th + mi*job->s_m + 4*j; - dcmplx p1Q=job->phase[phas_idx], - p1U=job->phase[phas_idx+2], - p2Q=ispair[itot] ? job->phase[phas_idx+1]:0., - p2U=ispair[itot] ? job->phase[phas_idx+3]:0.; - if ((gen->mhi-gen->m+gen->s)&1) - { p2Q=-p2Q; p2U=-p2U; } - p1[j].s.qr[i]=creal(p1Q+p2Q); p1[j].s.qi[i]=cimag(p1Q+p2Q); - p1[j].s.ur[i]=creal(p1U+p2U); p1[j].s.ui[i]=cimag(p1U+p2U); - p2[j].s.qr[i]=creal(p1Q-p2Q); p2[j].s.qi[i]=cimag(p1Q-p2Q); - p2[j].s.ur[i]=creal(p1U-p2U); p2[j].s.ui[i]=cimag(p1U-p2U); - } - } - } - if (!skip) - Z(calc_map2alm_spin) (cth.b,sth.b,gen,job,&p1[0].b,&p2[0].b NJ2); - } - } - break; - } - default: - { - UTIL_FAIL("must not happen"); - break; - } - } - } - -#undef VZERO diff --git a/external/sharp/libsharp/sharp_core_inchelper.c b/external/sharp/libsharp/sharp_core_inchelper.c deleted file mode 100644 index 89d79cd..0000000 --- a/external/sharp/libsharp/sharp_core_inchelper.c +++ /dev/null @@ -1,70 +0,0 @@ -#define Tb CONCAT2(Tb,nvec) -#define Y(arg) CONCAT2(arg,nvec) -#include "sharp_core_inc.c" - -#if (SHARP_MAXTRANS>MAXJOB_SPECIAL) -#define NJ1 , int njobs -#define NJ2 , njobs -#define Z(arg) CONCAT2(arg,nvec) -#include "sharp_core_inc2.c" -#undef Z -#undef NJ1 -#undef NJ2 -#endif - -#define NJ1 -#define NJ2 - -#if ((MAXJOB_SPECIAL>=1)&&(SHARP_MAXTRANS>=1)) -#define njobs 1 -#define Z(arg) CONCAT3(arg,nvec,njobs) -#include "sharp_core_inc2.c" -#undef Z -#undef njobs -#endif - -#if ((MAXJOB_SPECIAL>=2)&&(SHARP_MAXTRANS>=2)) -#define njobs 2 -#define Z(arg) CONCAT3(arg,nvec,njobs) -#include "sharp_core_inc2.c" -#undef Z -#undef njobs -#endif - -#if ((MAXJOB_SPECIAL>=3)&&(SHARP_MAXTRANS>=3)) -#define njobs 3 -#define Z(arg) CONCAT3(arg,nvec,njobs) -#include "sharp_core_inc2.c" -#undef Z -#undef njobs -#endif - -#if ((MAXJOB_SPECIAL>=4)&&(SHARP_MAXTRANS>=4)) -#define njobs 4 -#define Z(arg) CONCAT3(arg,nvec,njobs) -#include "sharp_core_inc2.c" -#undef Z -#undef njobs -#endif - -#if ((MAXJOB_SPECIAL>=5)&&(SHARP_MAXTRANS>=5)) -#define njobs 5 -#define Z(arg) CONCAT3(arg,nvec,njobs) -#include "sharp_core_inc2.c" -#undef Z -#undef njobs -#endif - -#if ((MAXJOB_SPECIAL>=6)&&(SHARP_MAXTRANS>=6)) -#define njobs 6 -#define Z(arg) CONCAT3(arg,nvec,njobs) -#include "sharp_core_inc2.c" -#undef Z -#undef njobs -#endif - -#undef NJ1 -#undef NJ2 - -#undef Y -#undef Tb diff --git a/external/sharp/libsharp/sharp_cxx.h b/external/sharp/libsharp/sharp_cxx.h deleted file mode 100644 index f8b2365..0000000 --- a/external/sharp/libsharp/sharp_cxx.h +++ /dev/null @@ -1,154 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp_cxx.h - * Spherical transform library - * - * Copyright (C) 2012-2015 Max-Planck-Society - * \author Martin Reinecke - */ - -#ifndef PLANCK_SHARP_CXX_H -#define PLANCK_SHARP_CXX_H - -#include "sharp_lowlevel.h" -#include "sharp_geomhelpers.h" -#include "sharp_almhelpers.h" - -class sharp_base - { - protected: - sharp_alm_info *ainfo; - sharp_geom_info *ginfo; - - public: - sharp_base() - : ainfo(0), ginfo(0) {} - ~sharp_base() - { - sharp_destroy_geom_info(ginfo); - sharp_destroy_alm_info(ainfo); - } - - void set_general_geometry (int nrings, const int *nph, const ptrdiff_t *ofs, - const int *stride, const double *phi0, const double *theta, - const double *wgt) - { - if (ginfo) sharp_destroy_geom_info(ginfo); - sharp_make_geom_info (nrings, nph, ofs, stride, phi0, theta, wgt, &ginfo); - } - - void set_ECP_geometry (int nrings, int nphi) - { - if (ginfo) sharp_destroy_geom_info(ginfo); - sharp_make_ecp_geom_info (nrings, nphi, 0., 1, nphi, &ginfo); - } - - void set_Gauss_geometry (int nrings, int nphi) - { - if (ginfo) sharp_destroy_geom_info(ginfo); - sharp_make_gauss_geom_info (nrings, nphi, 0., 1, nphi, &ginfo); - } - - void set_Healpix_geometry (int nside) - { - if (ginfo) sharp_destroy_geom_info(ginfo); - sharp_make_healpix_geom_info (nside, 1, &ginfo); - } - - void set_weighted_Healpix_geometry (int nside, const double *weight) - { - if (ginfo) sharp_destroy_geom_info(ginfo); - sharp_make_weighted_healpix_geom_info (nside, 1, weight, &ginfo); - } - - void set_triangular_alm_info (int lmax, int mmax) - { - if (ainfo) sharp_destroy_alm_info(ainfo); - sharp_make_triangular_alm_info (lmax, mmax, 1, &ainfo); - } - - const sharp_geom_info* get_geom_info() const { return ginfo; } - const sharp_alm_info* get_alm_info() const { return ainfo; } - }; - -template struct cxxjobhelper__ {}; - -template<> struct cxxjobhelper__ - { enum {val=SHARP_DP}; }; - -template<> struct cxxjobhelper__ - { enum {val=0}; }; - - -template class sharp_cxxjob: public sharp_base - { - private: - static void *conv (T *ptr) - { return reinterpret_cast(ptr); } - static void *conv (const T *ptr) - { return const_cast(reinterpret_cast(ptr)); } - - public: - void alm2map (const T *alm, T *map, bool add) - { - void *aptr=conv(alm), *mptr=conv(map); - int flags=cxxjobhelper__::val | (add ? SHARP_ADD : 0); - sharp_execute (SHARP_ALM2MAP, 0, &aptr, &mptr, ginfo, ainfo, 1, - flags,0,0); - } - void alm2map_spin (const T *alm1, const T *alm2, T *map1, T *map2, - int spin, bool add) - { - void *aptr[2], *mptr[2]; - aptr[0]=conv(alm1); aptr[1]=conv(alm2); - mptr[0]=conv(map1); mptr[1]=conv(map2); - int flags=cxxjobhelper__::val | (add ? SHARP_ADD : 0); - sharp_execute (SHARP_ALM2MAP,spin,aptr,mptr,ginfo,ainfo,1,flags,0,0); - } - void alm2map_der1 (const T *alm, T *map1, T *map2, bool add) - { - void *aptr=conv(alm), *mptr[2]; - mptr[0]=conv(map1); mptr[1]=conv(map2); - int flags=cxxjobhelper__::val | (add ? SHARP_ADD : 0); - sharp_execute (SHARP_ALM2MAP_DERIV1,1,&aptr,mptr,ginfo,ainfo,1,flags,0,0); - } - void map2alm (const T *map, T *alm, bool add) - { - void *aptr=conv(alm), *mptr=conv(map); - int flags=cxxjobhelper__::val | (add ? SHARP_ADD : 0); - sharp_execute (SHARP_MAP2ALM,0,&aptr,&mptr,ginfo,ainfo,1,flags,0,0); - } - void map2alm_spin (const T *map1, const T *map2, T *alm1, T *alm2, - int spin, bool add) - { - void *aptr[2], *mptr[2]; - aptr[0]=conv(alm1); aptr[1]=conv(alm2); - mptr[0]=conv(map1); mptr[1]=conv(map2); - int flags=cxxjobhelper__::val | (add ? SHARP_ADD : 0); - sharp_execute (SHARP_MAP2ALM,spin,aptr,mptr,ginfo,ainfo,1,flags,0,0); - } - }; - -#endif diff --git a/external/sharp/libsharp/sharp_geomhelpers.c b/external/sharp/libsharp/sharp_geomhelpers.c deleted file mode 100644 index dbb44e0..0000000 --- a/external/sharp/libsharp/sharp_geomhelpers.c +++ /dev/null @@ -1,317 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp_geomhelpers.c - * Spherical transform library - * - * Copyright (C) 2006-2012 Max-Planck-Society
    - * Copyright (C) 2007-2008 Pavel Holoborodko (for gauss_legendre_tbl) - * \author Martin Reinecke \author Pavel Holoborodko - */ - -#include -#include "sharp_geomhelpers.h" -#include "sharp_legendre_roots.h" -#include "c_utils.h" -#include "ls_fft.h" -#include - -void sharp_make_subset_healpix_geom_info (int nside, int stride, int nrings, - const int *rings, const double *weight, sharp_geom_info **geom_info) - { - const double pi=3.141592653589793238462643383279502884197; - ptrdiff_t npix=(ptrdiff_t)nside*nside*12; - ptrdiff_t ncap=2*(ptrdiff_t)nside*(nside-1); - - double *theta=RALLOC(double,nrings); - double *weight_=RALLOC(double,nrings); - int *nph=RALLOC(int,nrings); - double *phi0=RALLOC(double,nrings); - ptrdiff_t *ofs=RALLOC(ptrdiff_t,nrings); - int *stride_=RALLOC(int,nrings); - ptrdiff_t curofs=0, checkofs; /* checkofs used for assertion introduced when adding rings arg */ - for (int m=0; m2*nside) ? 4*nside-ring : ring; - stride_[m] = stride; - if (northring < nside) - { - theta[m] = 2*asin(northring/(sqrt(6.)*nside)); - nph[m] = 4*northring; - phi0[m] = pi/nph[m]; - checkofs = 2*northring*(northring-1)*stride; - } - else - { - double fact1 = (8.*nside)/npix; - double costheta = (2*nside-northring)*fact1; - theta[m] = acos(costheta); - nph[m] = 4*nside; - if ((northring-nside) & 1) - phi0[m] = 0; - else - phi0[m] = pi/nph[m]; - checkofs = (ncap + (northring-nside)*nph[m])*stride; - ofs[m] = curofs; - } - if (northring != ring) /* southern hemisphere */ - { - theta[m] = pi-theta[m]; - checkofs = (npix - nph[m])*stride - checkofs; - ofs[m] = curofs; - } - weight_[m]=4.*pi/npix*((weight==NULL) ? 1. : weight[northring-1]); - if (rings==NULL) { - UTIL_ASSERT(curofs==checkofs, "Bug in computing ofs[m]"); - } - ofs[m] = curofs; - curofs+=nph[m]; - } - - sharp_make_geom_info (nrings, nph, ofs, stride_, phi0, theta, weight_, - geom_info); - - DEALLOC(theta); - DEALLOC(weight_); - DEALLOC(nph); - DEALLOC(phi0); - DEALLOC(ofs); - DEALLOC(stride_); - } - -void sharp_make_weighted_healpix_geom_info (int nside, int stride, - const double *weight, sharp_geom_info **geom_info) - { - sharp_make_subset_healpix_geom_info(nside, stride, 4 * nside - 1, NULL, weight, geom_info); - } - -void sharp_make_gauss_geom_info (int nrings, int nphi, double phi0, - int stride_lon, int stride_lat, sharp_geom_info **geom_info) - { - const double pi=3.141592653589793238462643383279502884197; - - double *theta=RALLOC(double,nrings); - double *weight=RALLOC(double,nrings); - int *nph=RALLOC(int,nrings); - double *phi0_=RALLOC(double,nrings); - ptrdiff_t *ofs=RALLOC(ptrdiff_t,nrings); - int *stride_=RALLOC(int,nrings); - - sharp_legendre_roots(nrings,theta,weight); - for (int m=0; mpi-1e-15) theta[m]=pi-1e-15; - nph[m]=ppring; - phi0_[m]=phi0; - ofs[m]=(ptrdiff_t)m*stride_lat; - stride_[m]=stride_lon; - } - - sharp_make_geom_info (nrings, nph, ofs, stride_, phi0_, theta, NULL, - geom_info); - - DEALLOC(theta); - DEALLOC(nph); - DEALLOC(phi0_); - DEALLOC(ofs); - DEALLOC(stride_); - } diff --git a/external/sharp/libsharp/sharp_geomhelpers.h b/external/sharp/libsharp/sharp_geomhelpers.h deleted file mode 100644 index b7f98c4..0000000 --- a/external/sharp/libsharp/sharp_geomhelpers.h +++ /dev/null @@ -1,153 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp_geomhelpers.h - * SHARP helper function for the creation of grid geometries - * - * Copyright (C) 2006-2013 Max-Planck-Society - * \author Martin Reinecke - */ - -#ifndef PLANCK_SHARP_GEOMHELPERS_H -#define PLANCK_SHARP_GEOMHELPERS_H - -#include "sharp_lowlevel.h" - -#ifdef __cplusplus -extern "C" { -#endif - -/*! Creates a geometry information describing a HEALPix map with an - Nside parameter \a nside. \a weight contains the relative ring - weights and must have \a 2*nside entries. The rings array contains - the indices of the rings, with 1 being the first ring at the north - pole; if NULL then we take them to be sequential. Pass 4 * nside - 1 - as nrings and NULL to rings to get the full HEALPix grid. - \note if \a weight is a null pointer, all weights are assumed to be 1. - \note if \a rings is a null pointer, take all rings - \ingroup geominfogroup */ -void sharp_make_subset_healpix_geom_info (int nside, int stride, int nrings, - const int *rings, const double *weight, sharp_geom_info **geom_info); - -/*! Creates a geometry information describing a HEALPix map with an - Nside parameter \a nside. \a weight contains the relative ring - weights and must have \a 2*nside entries. - \note if \a weight is a null pointer, all weights are assumed to be 1. - \ingroup geominfogroup */ -void sharp_make_weighted_healpix_geom_info (int nside, int stride, - const double *weight, sharp_geom_info **geom_info); - -/*! Creates a geometry information describing a HEALPix map with an - Nside parameter \a nside. - \ingroup geominfogroup */ -static inline void sharp_make_healpix_geom_info (int nside, int stride, - sharp_geom_info **geom_info) - { sharp_make_weighted_healpix_geom_info (nside, stride, NULL, geom_info); } - -/*! Creates a geometry information describing a Gaussian map with \a nrings - iso-latitude rings and \a nphi pixels per ring. The azimuth of the first - pixel in each ring is \a phi0 (in radians). The index difference between - two adjacent pixels in an iso-latitude ring is \a stride_lon, the index - difference between the two start pixels in consecutive iso-latitude rings - is \a stride_lat. - \ingroup geominfogroup */ -void sharp_make_gauss_geom_info (int nrings, int nphi, double phi0, - int stride_lon, int stride_lat, sharp_geom_info **geom_info); - -/*! Creates a geometry information describing an ECP map with \a nrings - iso-latitude rings and \a nphi pixels per ring. The azimuth of the first - pixel in each ring is \a phi0 (in radians). The index difference between - two adjacent pixels in an iso-latitude ring is \a stride_lon, the index - difference between the two start pixels in consecutive iso-latitude rings - is \a stride_lat. - \note The spacing of pixel centers is equidistant in colatitude and - longitude. - \note The sphere is pixelized in a way that the colatitude of the first ring - is \a 0.5*(pi/nrings) and the colatitude of the last ring is - \a pi-0.5*(pi/nrings). There are no pixel centers at the poles. - \note This grid corresponds to Fejer's first rule. - \ingroup geominfogroup */ -void sharp_make_fejer1_geom_info (int nrings, int nphi, double phi0, - int stride_lon, int stride_lat, sharp_geom_info **geom_info); - -/*! Old name for sharp_make_fejer1_geom_info() - \ingroup geominfogroup */ -static inline void sharp_make_ecp_geom_info (int nrings, int nphi, double phi0, - int stride_lon, int stride_lat, sharp_geom_info **geom_info) - { - sharp_make_fejer1_geom_info (nrings, nphi, phi0, stride_lon, stride_lat, - geom_info); - } - -/*! Creates a geometry information describing an ECP map with \a nrings - iso-latitude rings and \a nphi pixels per ring. The azimuth of the first - pixel in each ring is \a phi0 (in radians). The index difference between - two adjacent pixels in an iso-latitude ring is \a stride_lon, the index - difference between the two start pixels in consecutive iso-latitude rings - is \a stride_lat. - \note The spacing of pixel centers is equidistant in colatitude and - longitude. - \note The sphere is pixelized in a way that the colatitude of the first ring - is \a 0 and that of the last ring is \a pi. - \note This grid corresponds to Clenshaw-Curtis integration. - \ingroup geominfogroup */ -void sharp_make_cc_geom_info (int nrings, int ppring, double phi0, - int stride_lon, int stride_lat, sharp_geom_info **geom_info); - -/*! Creates a geometry information describing an ECP map with \a nrings - iso-latitude rings and \a nphi pixels per ring. The azimuth of the first - pixel in each ring is \a phi0 (in radians). The index difference between - two adjacent pixels in an iso-latitude ring is \a stride_lon, the index - difference between the two start pixels in consecutive iso-latitude rings - is \a stride_lat. - \note The spacing of pixel centers is equidistant in colatitude and - longitude. - \note The sphere is pixelized in a way that the colatitude of the first ring - is \a pi/(nrings+1) and that of the last ring is \a pi-pi/(nrings+1). - \note This grid corresponds to Fejer's second rule. - \ingroup geominfogroup */ -void sharp_make_fejer2_geom_info (int nrings, int ppring, double phi0, - int stride_lon, int stride_lat, sharp_geom_info **geom_info); - -/*! Creates a geometry information describing a map with \a nrings - iso-latitude rings and \a nphi pixels per ring. The azimuth of the first - pixel in each ring is \a phi0 (in radians). The index difference between - two adjacent pixels in an iso-latitude ring is \a stride_lon, the index - difference between the two start pixels in consecutive iso-latitude rings - is \a stride_lat. - \note The spacing of pixel centers is equidistant in colatitude and - longitude. - \note The sphere is pixelized in a way that the colatitude of the first ring - is \a pi/(2*nrings-1) and that of the last ring is \a pi. - \note This is the grid introduced by McEwen & Wiaux 2011. - \note This function does \e not define any quadrature weights. - \ingroup geominfogroup */ -void sharp_make_mw_geom_info (int nrings, int ppring, double phi0, - int stride_lon, int stride_lat, sharp_geom_info **geom_info); - -#ifdef __cplusplus -} -#endif - -#endif diff --git a/external/sharp/libsharp/sharp_internal.h b/external/sharp/libsharp/sharp_internal.h deleted file mode 100644 index fb56877..0000000 --- a/external/sharp/libsharp/sharp_internal.h +++ /dev/null @@ -1,66 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp_internal.h - * Internally used functionality for the spherical transform library. - * - * Copyright (C) 2006-2013 Max-Planck-Society - * \author Martin Reinecke \author Dag Sverre Seljebotn - */ - -#ifndef PLANCK_SHARP_INTERNAL_H -#define PLANCK_SHARP_INTERNAL_H - -#ifdef __cplusplus -#error This header file cannot be included from C++, only from C -#endif - -#include "sharp.h" - -#define SHARP_MAXTRANS 100 - -typedef struct - { - sharp_jobtype type; - int spin; - int nmaps, nalm; - int flags; - void **map; - void **alm; - int s_m, s_th; // strides in m and theta direction - complex double *phase; - double *norm_l; - complex double *almtmp; - const sharp_geom_info *ginfo; - const sharp_alm_info *ainfo; - double time; - int ntrans; - unsigned long long opcnt; - } sharp_job; - -int sharp_get_nv_max (void); -int sharp_nv_oracle (sharp_jobtype type, int spin, int ntrans); -int sharp_get_mlim (int lmax, int spin, double sth, double cth); - -#endif diff --git a/external/sharp/libsharp/sharp_legendre.c b/external/sharp/libsharp/sharp_legendre.c deleted file mode 100644 index cd54101..0000000 --- a/external/sharp/libsharp/sharp_legendre.c +++ /dev/null @@ -1,1319 +0,0 @@ -/* DO NOT EDIT. md5sum of source: d9499375a254cbf1e7903a249a8676ff *//* - - NOTE NOTE NOTE - - This file is edited in sharp_legendre.c.in which is then preprocessed. - Do not make manual modifications to sharp_legendre.c. - - NOTE NOTE NOTE - -*/ - - -/* - * This file is part of libsharp. - * - * Redistribution and use in source and binary forms, with or without - * met: - * - * 1. Redistributions of source code must retain the above copyright - * notice, this list of conditions and the following disclaimer. - * - * 2. Redistributions in binary form must reproduce the above copyright - * notice, this list of conditions and the following disclaimer in the - * documentation and/or other materials provided with the distribution. - * - * 3. Neither the name of the copyright holder nor the names of its - * contributors may be used to endorse or promote products derived from - * this software without specific prior written permission. - * - * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS - * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT - * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR - * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT - * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, - * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT - * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, - * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY - * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE - * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - */ - -/*! \file sharp_legendre.c.in - * - * Copyright (C) 2015 University of Oslo - * \author Dag Sverre Seljebotn - */ - -#ifndef NO_LEGENDRE -#if (VLEN==8) -#error This code is not tested with MIC; please compile with -DNO_LEGENDRE -/* ...or test it (it probably works) and remove this check */ -#endif - -#ifndef SHARP_LEGENDRE_CS -#define SHARP_LEGENDRE_CS 4 -#endif - -#define MAX_CS 6 -#if (SHARP_LEGENDRE_CS > MAX_CS) -#error (SHARP_LEGENDRE_CS > MAX_CS) -#endif - -#include "sharp_legendre.h" -#include "sharp_vecsupport.h" - -#include - - - -static void legendre_transform_vec1(double *recfacs, double *bl, ptrdiff_t lmax, - double xarr[(1) * VLEN], - double out[(1) * VLEN]) { - - Tv P_0, Pm1_0, Pm2_0, x0, y0; - - Tv W1, W2, b, R; - ptrdiff_t l; - - - x0 = vloadu(xarr + 0 * VLEN); - Pm1_0 = vload(1.0); - P_0 = x0; - b = vload(*bl); - y0 = vmul(Pm1_0, b); - - - b = vload(*(bl + 1)); - - vfmaeq(y0, P_0, b); - - - for (l = 2; l <= lmax; ++l) { - b = vload(*(bl + l)); - R = vload(*(recfacs + l)); - - /* - P = x * Pm1 + recfacs[l] * (x * Pm1 - Pm2) - */ - - Pm2_0 = Pm1_0; Pm1_0 = P_0; - W1 = vmul(x0, Pm1_0); - W2 = W1; - W2 = vsub(W2, Pm2_0); - P_0 = W1; - vfmaeq(P_0, W2, R); - vfmaeq(y0, P_0, b); - - - } - - vstoreu(out + 0 * VLEN, y0); - -} - -static void legendre_transform_vec2(double *recfacs, double *bl, ptrdiff_t lmax, - double xarr[(2) * VLEN], - double out[(2) * VLEN]) { - - Tv P_0, Pm1_0, Pm2_0, x0, y0; - - Tv P_1, Pm1_1, Pm2_1, x1, y1; - - Tv W1, W2, b, R; - ptrdiff_t l; - - - x0 = vloadu(xarr + 0 * VLEN); - Pm1_0 = vload(1.0); - P_0 = x0; - b = vload(*bl); - y0 = vmul(Pm1_0, b); - - x1 = vloadu(xarr + 1 * VLEN); - Pm1_1 = vload(1.0); - P_1 = x1; - b = vload(*bl); - y1 = vmul(Pm1_1, b); - - - b = vload(*(bl + 1)); - - vfmaeq(y0, P_0, b); - - vfmaeq(y1, P_1, b); - - - for (l = 2; l <= lmax; ++l) { - b = vload(*(bl + l)); - R = vload(*(recfacs + l)); - - /* - P = x * Pm1 + recfacs[l] * (x * Pm1 - Pm2) - */ - - Pm2_0 = Pm1_0; Pm1_0 = P_0; - W1 = vmul(x0, Pm1_0); - W2 = W1; - W2 = vsub(W2, Pm2_0); - P_0 = W1; - vfmaeq(P_0, W2, R); - vfmaeq(y0, P_0, b); - - Pm2_1 = Pm1_1; Pm1_1 = P_1; - W1 = vmul(x1, Pm1_1); - W2 = W1; - W2 = vsub(W2, Pm2_1); - P_1 = W1; - vfmaeq(P_1, W2, R); - vfmaeq(y1, P_1, b); - - - } - - vstoreu(out + 0 * VLEN, y0); - - vstoreu(out + 1 * VLEN, y1); - -} - -static void legendre_transform_vec3(double *recfacs, double *bl, ptrdiff_t lmax, - double xarr[(3) * VLEN], - double out[(3) * VLEN]) { - - Tv P_0, Pm1_0, Pm2_0, x0, y0; - - Tv P_1, Pm1_1, Pm2_1, x1, y1; - - Tv P_2, Pm1_2, Pm2_2, x2, y2; - - Tv W1, W2, b, R; - ptrdiff_t l; - - - x0 = vloadu(xarr + 0 * VLEN); - Pm1_0 = vload(1.0); - P_0 = x0; - b = vload(*bl); - y0 = vmul(Pm1_0, b); - - x1 = vloadu(xarr + 1 * VLEN); - Pm1_1 = vload(1.0); - P_1 = x1; - b = vload(*bl); - y1 = vmul(Pm1_1, b); - - x2 = vloadu(xarr + 2 * VLEN); - Pm1_2 = vload(1.0); - P_2 = x2; - b = vload(*bl); - y2 = vmul(Pm1_2, b); - - - b = vload(*(bl + 1)); - - vfmaeq(y0, P_0, b); - - vfmaeq(y1, P_1, b); - - vfmaeq(y2, P_2, b); - - - for (l = 2; l <= lmax; ++l) { - b = vload(*(bl + l)); - R = vload(*(recfacs + l)); - - /* - P = x * Pm1 + recfacs[l] * (x * Pm1 - Pm2) - */ - - Pm2_0 = Pm1_0; Pm1_0 = P_0; - W1 = vmul(x0, Pm1_0); - W2 = W1; - W2 = vsub(W2, Pm2_0); - P_0 = W1; - vfmaeq(P_0, W2, R); - vfmaeq(y0, P_0, b); - - Pm2_1 = Pm1_1; Pm1_1 = P_1; - W1 = vmul(x1, Pm1_1); - W2 = W1; - W2 = vsub(W2, Pm2_1); - P_1 = W1; - vfmaeq(P_1, W2, R); - vfmaeq(y1, P_1, b); - - Pm2_2 = Pm1_2; Pm1_2 = P_2; - W1 = vmul(x2, Pm1_2); - W2 = W1; - W2 = vsub(W2, Pm2_2); - P_2 = W1; - vfmaeq(P_2, W2, R); - vfmaeq(y2, P_2, b); - - - } - - vstoreu(out + 0 * VLEN, y0); - - vstoreu(out + 1 * VLEN, y1); - - vstoreu(out + 2 * VLEN, y2); - -} - -static void legendre_transform_vec4(double *recfacs, double *bl, ptrdiff_t lmax, - double xarr[(4) * VLEN], - double out[(4) * VLEN]) { - - Tv P_0, Pm1_0, Pm2_0, x0, y0; - - Tv P_1, Pm1_1, Pm2_1, x1, y1; - - Tv P_2, Pm1_2, Pm2_2, x2, y2; - - Tv P_3, Pm1_3, Pm2_3, x3, y3; - - Tv W1, W2, b, R; - ptrdiff_t l; - - - x0 = vloadu(xarr + 0 * VLEN); - Pm1_0 = vload(1.0); - P_0 = x0; - b = vload(*bl); - y0 = vmul(Pm1_0, b); - - x1 = vloadu(xarr + 1 * VLEN); - Pm1_1 = vload(1.0); - P_1 = x1; - b = vload(*bl); - y1 = vmul(Pm1_1, b); - - x2 = vloadu(xarr + 2 * VLEN); - Pm1_2 = vload(1.0); - P_2 = x2; - b = vload(*bl); - y2 = vmul(Pm1_2, b); - - x3 = vloadu(xarr + 3 * VLEN); - Pm1_3 = vload(1.0); - P_3 = x3; - b = vload(*bl); - y3 = vmul(Pm1_3, b); - - - b = vload(*(bl + 1)); - - vfmaeq(y0, P_0, b); - - vfmaeq(y1, P_1, b); - - vfmaeq(y2, P_2, b); - - vfmaeq(y3, P_3, b); - - - for (l = 2; l <= lmax; ++l) { - b = vload(*(bl + l)); - R = vload(*(recfacs + l)); - - /* - P = x * Pm1 + recfacs[l] * (x * Pm1 - Pm2) - */ - - Pm2_0 = Pm1_0; Pm1_0 = P_0; - W1 = vmul(x0, Pm1_0); - W2 = W1; - W2 = vsub(W2, Pm2_0); - P_0 = W1; - vfmaeq(P_0, W2, R); - vfmaeq(y0, P_0, b); - - Pm2_1 = Pm1_1; Pm1_1 = P_1; - W1 = vmul(x1, Pm1_1); - W2 = W1; - W2 = vsub(W2, Pm2_1); - P_1 = W1; - vfmaeq(P_1, W2, R); - vfmaeq(y1, P_1, b); - - Pm2_2 = Pm1_2; Pm1_2 = P_2; - W1 = vmul(x2, Pm1_2); - W2 = W1; - W2 = vsub(W2, Pm2_2); - P_2 = W1; - vfmaeq(P_2, W2, R); - vfmaeq(y2, P_2, b); - - Pm2_3 = Pm1_3; Pm1_3 = P_3; - W1 = vmul(x3, Pm1_3); - W2 = W1; - W2 = vsub(W2, Pm2_3); - P_3 = W1; - vfmaeq(P_3, W2, R); - vfmaeq(y3, P_3, b); - - - } - - vstoreu(out + 0 * VLEN, y0); - - vstoreu(out + 1 * VLEN, y1); - - vstoreu(out + 2 * VLEN, y2); - - vstoreu(out + 3 * VLEN, y3); - -} - -static void legendre_transform_vec5(double *recfacs, double *bl, ptrdiff_t lmax, - double xarr[(5) * VLEN], - double out[(5) * VLEN]) { - - Tv P_0, Pm1_0, Pm2_0, x0, y0; - - Tv P_1, Pm1_1, Pm2_1, x1, y1; - - Tv P_2, Pm1_2, Pm2_2, x2, y2; - - Tv P_3, Pm1_3, Pm2_3, x3, y3; - - Tv P_4, Pm1_4, Pm2_4, x4, y4; - - Tv W1, W2, b, R; - ptrdiff_t l; - - - x0 = vloadu(xarr + 0 * VLEN); - Pm1_0 = vload(1.0); - P_0 = x0; - b = vload(*bl); - y0 = vmul(Pm1_0, b); - - x1 = vloadu(xarr + 1 * VLEN); - Pm1_1 = vload(1.0); - P_1 = x1; - b = vload(*bl); - y1 = vmul(Pm1_1, b); - - x2 = vloadu(xarr + 2 * VLEN); - Pm1_2 = vload(1.0); - P_2 = x2; - b = vload(*bl); - y2 = vmul(Pm1_2, b); - - x3 = vloadu(xarr + 3 * VLEN); - Pm1_3 = vload(1.0); - P_3 = x3; - b = vload(*bl); - y3 = vmul(Pm1_3, b); - - x4 = vloadu(xarr + 4 * VLEN); - Pm1_4 = vload(1.0); - P_4 = x4; - b = vload(*bl); - y4 = vmul(Pm1_4, b); - - - b = vload(*(bl + 1)); - - vfmaeq(y0, P_0, b); - - vfmaeq(y1, P_1, b); - - vfmaeq(y2, P_2, b); - - vfmaeq(y3, P_3, b); - - vfmaeq(y4, P_4, b); - - - for (l = 2; l <= lmax; ++l) { - b = vload(*(bl + l)); - R = vload(*(recfacs + l)); - - /* - P = x * Pm1 + recfacs[l] * (x * Pm1 - Pm2) - */ - - Pm2_0 = Pm1_0; Pm1_0 = P_0; - W1 = vmul(x0, Pm1_0); - W2 = W1; - W2 = vsub(W2, Pm2_0); - P_0 = W1; - vfmaeq(P_0, W2, R); - vfmaeq(y0, P_0, b); - - Pm2_1 = Pm1_1; Pm1_1 = P_1; - W1 = vmul(x1, Pm1_1); - W2 = W1; - W2 = vsub(W2, Pm2_1); - P_1 = W1; - vfmaeq(P_1, W2, R); - vfmaeq(y1, P_1, b); - - Pm2_2 = Pm1_2; Pm1_2 = P_2; - W1 = vmul(x2, Pm1_2); - W2 = W1; - W2 = vsub(W2, Pm2_2); - P_2 = W1; - vfmaeq(P_2, W2, R); - vfmaeq(y2, P_2, b); - - Pm2_3 = Pm1_3; Pm1_3 = P_3; - W1 = vmul(x3, Pm1_3); - W2 = W1; - W2 = vsub(W2, Pm2_3); - P_3 = W1; - vfmaeq(P_3, W2, R); - vfmaeq(y3, P_3, b); - - Pm2_4 = Pm1_4; Pm1_4 = P_4; - W1 = vmul(x4, Pm1_4); - W2 = W1; - W2 = vsub(W2, Pm2_4); - P_4 = W1; - vfmaeq(P_4, W2, R); - vfmaeq(y4, P_4, b); - - - } - - vstoreu(out + 0 * VLEN, y0); - - vstoreu(out + 1 * VLEN, y1); - - vstoreu(out + 2 * VLEN, y2); - - vstoreu(out + 3 * VLEN, y3); - - vstoreu(out + 4 * VLEN, y4); - -} - -static void legendre_transform_vec6(double *recfacs, double *bl, ptrdiff_t lmax, - double xarr[(6) * VLEN], - double out[(6) * VLEN]) { - - Tv P_0, Pm1_0, Pm2_0, x0, y0; - - Tv P_1, Pm1_1, Pm2_1, x1, y1; - - Tv P_2, Pm1_2, Pm2_2, x2, y2; - - Tv P_3, Pm1_3, Pm2_3, x3, y3; - - Tv P_4, Pm1_4, Pm2_4, x4, y4; - - Tv P_5, Pm1_5, Pm2_5, x5, y5; - - Tv W1, W2, b, R; - ptrdiff_t l; - - - x0 = vloadu(xarr + 0 * VLEN); - Pm1_0 = vload(1.0); - P_0 = x0; - b = vload(*bl); - y0 = vmul(Pm1_0, b); - - x1 = vloadu(xarr + 1 * VLEN); - Pm1_1 = vload(1.0); - P_1 = x1; - b = vload(*bl); - y1 = vmul(Pm1_1, b); - - x2 = vloadu(xarr + 2 * VLEN); - Pm1_2 = vload(1.0); - P_2 = x2; - b = vload(*bl); - y2 = vmul(Pm1_2, b); - - x3 = vloadu(xarr + 3 * VLEN); - Pm1_3 = vload(1.0); - P_3 = x3; - b = vload(*bl); - y3 = vmul(Pm1_3, b); - - x4 = vloadu(xarr + 4 * VLEN); - Pm1_4 = vload(1.0); - P_4 = x4; - b = vload(*bl); - y4 = vmul(Pm1_4, b); - - x5 = vloadu(xarr + 5 * VLEN); - Pm1_5 = vload(1.0); - P_5 = x5; - b = vload(*bl); - y5 = vmul(Pm1_5, b); - - - b = vload(*(bl + 1)); - - vfmaeq(y0, P_0, b); - - vfmaeq(y1, P_1, b); - - vfmaeq(y2, P_2, b); - - vfmaeq(y3, P_3, b); - - vfmaeq(y4, P_4, b); - - vfmaeq(y5, P_5, b); - - - for (l = 2; l <= lmax; ++l) { - b = vload(*(bl + l)); - R = vload(*(recfacs + l)); - - /* - P = x * Pm1 + recfacs[l] * (x * Pm1 - Pm2) - */ - - Pm2_0 = Pm1_0; Pm1_0 = P_0; - W1 = vmul(x0, Pm1_0); - W2 = W1; - W2 = vsub(W2, Pm2_0); - P_0 = W1; - vfmaeq(P_0, W2, R); - vfmaeq(y0, P_0, b); - - Pm2_1 = Pm1_1; Pm1_1 = P_1; - W1 = vmul(x1, Pm1_1); - W2 = W1; - W2 = vsub(W2, Pm2_1); - P_1 = W1; - vfmaeq(P_1, W2, R); - vfmaeq(y1, P_1, b); - - Pm2_2 = Pm1_2; Pm1_2 = P_2; - W1 = vmul(x2, Pm1_2); - W2 = W1; - W2 = vsub(W2, Pm2_2); - P_2 = W1; - vfmaeq(P_2, W2, R); - vfmaeq(y2, P_2, b); - - Pm2_3 = Pm1_3; Pm1_3 = P_3; - W1 = vmul(x3, Pm1_3); - W2 = W1; - W2 = vsub(W2, Pm2_3); - P_3 = W1; - vfmaeq(P_3, W2, R); - vfmaeq(y3, P_3, b); - - Pm2_4 = Pm1_4; Pm1_4 = P_4; - W1 = vmul(x4, Pm1_4); - W2 = W1; - W2 = vsub(W2, Pm2_4); - P_4 = W1; - vfmaeq(P_4, W2, R); - vfmaeq(y4, P_4, b); - - Pm2_5 = Pm1_5; Pm1_5 = P_5; - W1 = vmul(x5, Pm1_5); - W2 = W1; - W2 = vsub(W2, Pm2_5); - P_5 = W1; - vfmaeq(P_5, W2, R); - vfmaeq(y5, P_5, b); - - - } - - vstoreu(out + 0 * VLEN, y0); - - vstoreu(out + 1 * VLEN, y1); - - vstoreu(out + 2 * VLEN, y2); - - vstoreu(out + 3 * VLEN, y3); - - vstoreu(out + 4 * VLEN, y4); - - vstoreu(out + 5 * VLEN, y5); - -} - - - -static void legendre_transform_vec1_s(float *recfacs, float *bl, ptrdiff_t lmax, - float xarr[(1) * VLEN_s], - float out[(1) * VLEN_s]) { - - Tv_s P_0, Pm1_0, Pm2_0, x0, y0; - - Tv_s W1, W2, b, R; - ptrdiff_t l; - - - x0 = vloadu_s(xarr + 0 * VLEN_s); - Pm1_0 = vload_s(1.0); - P_0 = x0; - b = vload_s(*bl); - y0 = vmul_s(Pm1_0, b); - - - b = vload_s(*(bl + 1)); - - vfmaeq_s(y0, P_0, b); - - - for (l = 2; l <= lmax; ++l) { - b = vload_s(*(bl + l)); - R = vload_s(*(recfacs + l)); - - /* - P = x * Pm1 + recfacs[l] * (x * Pm1 - Pm2) - */ - - Pm2_0 = Pm1_0; Pm1_0 = P_0; - W1 = vmul_s(x0, Pm1_0); - W2 = W1; - W2 = vsub_s(W2, Pm2_0); - P_0 = W1; - vfmaeq_s(P_0, W2, R); - vfmaeq_s(y0, P_0, b); - - - } - - vstoreu_s(out + 0 * VLEN_s, y0); - -} - -static void legendre_transform_vec2_s(float *recfacs, float *bl, ptrdiff_t lmax, - float xarr[(2) * VLEN_s], - float out[(2) * VLEN_s]) { - - Tv_s P_0, Pm1_0, Pm2_0, x0, y0; - - Tv_s P_1, Pm1_1, Pm2_1, x1, y1; - - Tv_s W1, W2, b, R; - ptrdiff_t l; - - - x0 = vloadu_s(xarr + 0 * VLEN_s); - Pm1_0 = vload_s(1.0); - P_0 = x0; - b = vload_s(*bl); - y0 = vmul_s(Pm1_0, b); - - x1 = vloadu_s(xarr + 1 * VLEN_s); - Pm1_1 = vload_s(1.0); - P_1 = x1; - b = vload_s(*bl); - y1 = vmul_s(Pm1_1, b); - - - b = vload_s(*(bl + 1)); - - vfmaeq_s(y0, P_0, b); - - vfmaeq_s(y1, P_1, b); - - - for (l = 2; l <= lmax; ++l) { - b = vload_s(*(bl + l)); - R = vload_s(*(recfacs + l)); - - /* - P = x * Pm1 + recfacs[l] * (x * Pm1 - Pm2) - */ - - Pm2_0 = Pm1_0; Pm1_0 = P_0; - W1 = vmul_s(x0, Pm1_0); - W2 = W1; - W2 = vsub_s(W2, Pm2_0); - P_0 = W1; - vfmaeq_s(P_0, W2, R); - vfmaeq_s(y0, P_0, b); - - Pm2_1 = Pm1_1; Pm1_1 = P_1; - W1 = vmul_s(x1, Pm1_1); - W2 = W1; - W2 = vsub_s(W2, Pm2_1); - P_1 = W1; - vfmaeq_s(P_1, W2, R); - vfmaeq_s(y1, P_1, b); - - - } - - vstoreu_s(out + 0 * VLEN_s, y0); - - vstoreu_s(out + 1 * VLEN_s, y1); - -} - -static void legendre_transform_vec3_s(float *recfacs, float *bl, ptrdiff_t lmax, - float xarr[(3) * VLEN_s], - float out[(3) * VLEN_s]) { - - Tv_s P_0, Pm1_0, Pm2_0, x0, y0; - - Tv_s P_1, Pm1_1, Pm2_1, x1, y1; - - Tv_s P_2, Pm1_2, Pm2_2, x2, y2; - - Tv_s W1, W2, b, R; - ptrdiff_t l; - - - x0 = vloadu_s(xarr + 0 * VLEN_s); - Pm1_0 = vload_s(1.0); - P_0 = x0; - b = vload_s(*bl); - y0 = vmul_s(Pm1_0, b); - - x1 = vloadu_s(xarr + 1 * VLEN_s); - Pm1_1 = vload_s(1.0); - P_1 = x1; - b = vload_s(*bl); - y1 = vmul_s(Pm1_1, b); - - x2 = vloadu_s(xarr + 2 * VLEN_s); - Pm1_2 = vload_s(1.0); - P_2 = x2; - b = vload_s(*bl); - y2 = vmul_s(Pm1_2, b); - - - b = vload_s(*(bl + 1)); - - vfmaeq_s(y0, P_0, b); - - vfmaeq_s(y1, P_1, b); - - vfmaeq_s(y2, P_2, b); - - - for (l = 2; l <= lmax; ++l) { - b = vload_s(*(bl + l)); - R = vload_s(*(recfacs + l)); - - /* - P = x * Pm1 + recfacs[l] * (x * Pm1 - Pm2) - */ - - Pm2_0 = Pm1_0; Pm1_0 = P_0; - W1 = vmul_s(x0, Pm1_0); - W2 = W1; - W2 = vsub_s(W2, Pm2_0); - P_0 = W1; - vfmaeq_s(P_0, W2, R); - vfmaeq_s(y0, P_0, b); - - Pm2_1 = Pm1_1; Pm1_1 = P_1; - W1 = vmul_s(x1, Pm1_1); - W2 = W1; - W2 = vsub_s(W2, Pm2_1); - P_1 = W1; - vfmaeq_s(P_1, W2, R); - vfmaeq_s(y1, P_1, b); - - Pm2_2 = Pm1_2; Pm1_2 = P_2; - W1 = vmul_s(x2, Pm1_2); - W2 = W1; - W2 = vsub_s(W2, Pm2_2); - P_2 = W1; - vfmaeq_s(P_2, W2, R); - vfmaeq_s(y2, P_2, b); - - - } - - vstoreu_s(out + 0 * VLEN_s, y0); - - vstoreu_s(out + 1 * VLEN_s, y1); - - vstoreu_s(out + 2 * VLEN_s, y2); - -} - -static void legendre_transform_vec4_s(float *recfacs, float *bl, ptrdiff_t lmax, - float xarr[(4) * VLEN_s], - float out[(4) * VLEN_s]) { - - Tv_s P_0, Pm1_0, Pm2_0, x0, y0; - - Tv_s P_1, Pm1_1, Pm2_1, x1, y1; - - Tv_s P_2, Pm1_2, Pm2_2, x2, y2; - - Tv_s P_3, Pm1_3, Pm2_3, x3, y3; - - Tv_s W1, W2, b, R; - ptrdiff_t l; - - - x0 = vloadu_s(xarr + 0 * VLEN_s); - Pm1_0 = vload_s(1.0); - P_0 = x0; - b = vload_s(*bl); - y0 = vmul_s(Pm1_0, b); - - x1 = vloadu_s(xarr + 1 * VLEN_s); - Pm1_1 = vload_s(1.0); - P_1 = x1; - b = vload_s(*bl); - y1 = vmul_s(Pm1_1, b); - - x2 = vloadu_s(xarr + 2 * VLEN_s); - Pm1_2 = vload_s(1.0); - P_2 = x2; - b = vload_s(*bl); - y2 = vmul_s(Pm1_2, b); - - x3 = vloadu_s(xarr + 3 * VLEN_s); - Pm1_3 = vload_s(1.0); - P_3 = x3; - b = vload_s(*bl); - y3 = vmul_s(Pm1_3, b); - - - b = vload_s(*(bl + 1)); - - vfmaeq_s(y0, P_0, b); - - vfmaeq_s(y1, P_1, b); - - vfmaeq_s(y2, P_2, b); - - vfmaeq_s(y3, P_3, b); - - - for (l = 2; l <= lmax; ++l) { - b = vload_s(*(bl + l)); - R = vload_s(*(recfacs + l)); - - /* - P = x * Pm1 + recfacs[l] * (x * Pm1 - Pm2) - */ - - Pm2_0 = Pm1_0; Pm1_0 = P_0; - W1 = vmul_s(x0, Pm1_0); - W2 = W1; - W2 = vsub_s(W2, Pm2_0); - P_0 = W1; - vfmaeq_s(P_0, W2, R); - vfmaeq_s(y0, P_0, b); - - Pm2_1 = Pm1_1; Pm1_1 = P_1; - W1 = vmul_s(x1, Pm1_1); - W2 = W1; - W2 = vsub_s(W2, Pm2_1); - P_1 = W1; - vfmaeq_s(P_1, W2, R); - vfmaeq_s(y1, P_1, b); - - Pm2_2 = Pm1_2; Pm1_2 = P_2; - W1 = vmul_s(x2, Pm1_2); - W2 = W1; - W2 = vsub_s(W2, Pm2_2); - P_2 = W1; - vfmaeq_s(P_2, W2, R); - vfmaeq_s(y2, P_2, b); - - Pm2_3 = Pm1_3; Pm1_3 = P_3; - W1 = vmul_s(x3, Pm1_3); - W2 = W1; - W2 = vsub_s(W2, Pm2_3); - P_3 = W1; - vfmaeq_s(P_3, W2, R); - vfmaeq_s(y3, P_3, b); - - - } - - vstoreu_s(out + 0 * VLEN_s, y0); - - vstoreu_s(out + 1 * VLEN_s, y1); - - vstoreu_s(out + 2 * VLEN_s, y2); - - vstoreu_s(out + 3 * VLEN_s, y3); - -} - -static void legendre_transform_vec5_s(float *recfacs, float *bl, ptrdiff_t lmax, - float xarr[(5) * VLEN_s], - float out[(5) * VLEN_s]) { - - Tv_s P_0, Pm1_0, Pm2_0, x0, y0; - - Tv_s P_1, Pm1_1, Pm2_1, x1, y1; - - Tv_s P_2, Pm1_2, Pm2_2, x2, y2; - - Tv_s P_3, Pm1_3, Pm2_3, x3, y3; - - Tv_s P_4, Pm1_4, Pm2_4, x4, y4; - - Tv_s W1, W2, b, R; - ptrdiff_t l; - - - x0 = vloadu_s(xarr + 0 * VLEN_s); - Pm1_0 = vload_s(1.0); - P_0 = x0; - b = vload_s(*bl); - y0 = vmul_s(Pm1_0, b); - - x1 = vloadu_s(xarr + 1 * VLEN_s); - Pm1_1 = vload_s(1.0); - P_1 = x1; - b = vload_s(*bl); - y1 = vmul_s(Pm1_1, b); - - x2 = vloadu_s(xarr + 2 * VLEN_s); - Pm1_2 = vload_s(1.0); - P_2 = x2; - b = vload_s(*bl); - y2 = vmul_s(Pm1_2, b); - - x3 = vloadu_s(xarr + 3 * VLEN_s); - Pm1_3 = vload_s(1.0); - P_3 = x3; - b = vload_s(*bl); - y3 = vmul_s(Pm1_3, b); - - x4 = vloadu_s(xarr + 4 * VLEN_s); - Pm1_4 = vload_s(1.0); - P_4 = x4; - b = vload_s(*bl); - y4 = vmul_s(Pm1_4, b); - - - b = vload_s(*(bl + 1)); - - vfmaeq_s(y0, P_0, b); - - vfmaeq_s(y1, P_1, b); - - vfmaeq_s(y2, P_2, b); - - vfmaeq_s(y3, P_3, b); - - vfmaeq_s(y4, P_4, b); - - - for (l = 2; l <= lmax; ++l) { - b = vload_s(*(bl + l)); - R = vload_s(*(recfacs + l)); - - /* - P = x * Pm1 + recfacs[l] * (x * Pm1 - Pm2) - */ - - Pm2_0 = Pm1_0; Pm1_0 = P_0; - W1 = vmul_s(x0, Pm1_0); - W2 = W1; - W2 = vsub_s(W2, Pm2_0); - P_0 = W1; - vfmaeq_s(P_0, W2, R); - vfmaeq_s(y0, P_0, b); - - Pm2_1 = Pm1_1; Pm1_1 = P_1; - W1 = vmul_s(x1, Pm1_1); - W2 = W1; - W2 = vsub_s(W2, Pm2_1); - P_1 = W1; - vfmaeq_s(P_1, W2, R); - vfmaeq_s(y1, P_1, b); - - Pm2_2 = Pm1_2; Pm1_2 = P_2; - W1 = vmul_s(x2, Pm1_2); - W2 = W1; - W2 = vsub_s(W2, Pm2_2); - P_2 = W1; - vfmaeq_s(P_2, W2, R); - vfmaeq_s(y2, P_2, b); - - Pm2_3 = Pm1_3; Pm1_3 = P_3; - W1 = vmul_s(x3, Pm1_3); - W2 = W1; - W2 = vsub_s(W2, Pm2_3); - P_3 = W1; - vfmaeq_s(P_3, W2, R); - vfmaeq_s(y3, P_3, b); - - Pm2_4 = Pm1_4; Pm1_4 = P_4; - W1 = vmul_s(x4, Pm1_4); - W2 = W1; - W2 = vsub_s(W2, Pm2_4); - P_4 = W1; - vfmaeq_s(P_4, W2, R); - vfmaeq_s(y4, P_4, b); - - - } - - vstoreu_s(out + 0 * VLEN_s, y0); - - vstoreu_s(out + 1 * VLEN_s, y1); - - vstoreu_s(out + 2 * VLEN_s, y2); - - vstoreu_s(out + 3 * VLEN_s, y3); - - vstoreu_s(out + 4 * VLEN_s, y4); - -} - -static void legendre_transform_vec6_s(float *recfacs, float *bl, ptrdiff_t lmax, - float xarr[(6) * VLEN_s], - float out[(6) * VLEN_s]) { - - Tv_s P_0, Pm1_0, Pm2_0, x0, y0; - - Tv_s P_1, Pm1_1, Pm2_1, x1, y1; - - Tv_s P_2, Pm1_2, Pm2_2, x2, y2; - - Tv_s P_3, Pm1_3, Pm2_3, x3, y3; - - Tv_s P_4, Pm1_4, Pm2_4, x4, y4; - - Tv_s P_5, Pm1_5, Pm2_5, x5, y5; - - Tv_s W1, W2, b, R; - ptrdiff_t l; - - - x0 = vloadu_s(xarr + 0 * VLEN_s); - Pm1_0 = vload_s(1.0); - P_0 = x0; - b = vload_s(*bl); - y0 = vmul_s(Pm1_0, b); - - x1 = vloadu_s(xarr + 1 * VLEN_s); - Pm1_1 = vload_s(1.0); - P_1 = x1; - b = vload_s(*bl); - y1 = vmul_s(Pm1_1, b); - - x2 = vloadu_s(xarr + 2 * VLEN_s); - Pm1_2 = vload_s(1.0); - P_2 = x2; - b = vload_s(*bl); - y2 = vmul_s(Pm1_2, b); - - x3 = vloadu_s(xarr + 3 * VLEN_s); - Pm1_3 = vload_s(1.0); - P_3 = x3; - b = vload_s(*bl); - y3 = vmul_s(Pm1_3, b); - - x4 = vloadu_s(xarr + 4 * VLEN_s); - Pm1_4 = vload_s(1.0); - P_4 = x4; - b = vload_s(*bl); - y4 = vmul_s(Pm1_4, b); - - x5 = vloadu_s(xarr + 5 * VLEN_s); - Pm1_5 = vload_s(1.0); - P_5 = x5; - b = vload_s(*bl); - y5 = vmul_s(Pm1_5, b); - - - b = vload_s(*(bl + 1)); - - vfmaeq_s(y0, P_0, b); - - vfmaeq_s(y1, P_1, b); - - vfmaeq_s(y2, P_2, b); - - vfmaeq_s(y3, P_3, b); - - vfmaeq_s(y4, P_4, b); - - vfmaeq_s(y5, P_5, b); - - - for (l = 2; l <= lmax; ++l) { - b = vload_s(*(bl + l)); - R = vload_s(*(recfacs + l)); - - /* - P = x * Pm1 + recfacs[l] * (x * Pm1 - Pm2) - */ - - Pm2_0 = Pm1_0; Pm1_0 = P_0; - W1 = vmul_s(x0, Pm1_0); - W2 = W1; - W2 = vsub_s(W2, Pm2_0); - P_0 = W1; - vfmaeq_s(P_0, W2, R); - vfmaeq_s(y0, P_0, b); - - Pm2_1 = Pm1_1; Pm1_1 = P_1; - W1 = vmul_s(x1, Pm1_1); - W2 = W1; - W2 = vsub_s(W2, Pm2_1); - P_1 = W1; - vfmaeq_s(P_1, W2, R); - vfmaeq_s(y1, P_1, b); - - Pm2_2 = Pm1_2; Pm1_2 = P_2; - W1 = vmul_s(x2, Pm1_2); - W2 = W1; - W2 = vsub_s(W2, Pm2_2); - P_2 = W1; - vfmaeq_s(P_2, W2, R); - vfmaeq_s(y2, P_2, b); - - Pm2_3 = Pm1_3; Pm1_3 = P_3; - W1 = vmul_s(x3, Pm1_3); - W2 = W1; - W2 = vsub_s(W2, Pm2_3); - P_3 = W1; - vfmaeq_s(P_3, W2, R); - vfmaeq_s(y3, P_3, b); - - Pm2_4 = Pm1_4; Pm1_4 = P_4; - W1 = vmul_s(x4, Pm1_4); - W2 = W1; - W2 = vsub_s(W2, Pm2_4); - P_4 = W1; - vfmaeq_s(P_4, W2, R); - vfmaeq_s(y4, P_4, b); - - Pm2_5 = Pm1_5; Pm1_5 = P_5; - W1 = vmul_s(x5, Pm1_5); - W2 = W1; - W2 = vsub_s(W2, Pm2_5); - P_5 = W1; - vfmaeq_s(P_5, W2, R); - vfmaeq_s(y5, P_5, b); - - - } - - vstoreu_s(out + 0 * VLEN_s, y0); - - vstoreu_s(out + 1 * VLEN_s, y1); - - vstoreu_s(out + 2 * VLEN_s, y2); - - vstoreu_s(out + 3 * VLEN_s, y3); - - vstoreu_s(out + 4 * VLEN_s, y4); - - vstoreu_s(out + 5 * VLEN_s, y5); - -} - - - - - -void sharp_legendre_transform_recfac(double *r, ptrdiff_t lmax) { - /* (l - 1) / l, for l >= 2 */ - ptrdiff_t l; - r[0] = 0; - r[1] = 1; - for (l = 2; l <= lmax; ++l) { - r[l] = (double)(l - 1) / (double)l; - } -} - -void sharp_legendre_transform_recfac_s(float *r, ptrdiff_t lmax) { - /* (l - 1) / l, for l >= 2 */ - ptrdiff_t l; - r[0] = 0; - r[1] = 1; - for (l = 2; l <= lmax; ++l) { - r[l] = (float)(l - 1) / (float)l; - } -} - - -/* - Compute sum_l b_l P_l(x_i) for all i. - */ - -#define LEN (SHARP_LEGENDRE_CS * VLEN) -#define LEN_s (SHARP_LEGENDRE_CS * VLEN_s) - - -void sharp_legendre_transform(double *bl, - double *recfac, - ptrdiff_t lmax, - double *x, double *out, ptrdiff_t nx) { - double xchunk[MAX_CS * VLEN], outchunk[MAX_CS * LEN]; - int compute_recfac; - ptrdiff_t i, j, len; - - compute_recfac = (recfac == NULL); - if (compute_recfac) { - recfac = malloc(sizeof(double) * (lmax + 1)); - sharp_legendre_transform_recfac(recfac, lmax); - } - - for (j = 0; j != LEN; ++j) xchunk[j] = 0; - - for (i = 0; i < nx; i += LEN) { - len = (i + (LEN) <= nx) ? (LEN) : (nx - i); - for (j = 0; j != len; ++j) xchunk[j] = x[i + j]; - switch ((len + VLEN - 1) / VLEN) { - case 6: legendre_transform_vec6(recfac, bl, lmax, xchunk, outchunk); break; - case 5: legendre_transform_vec5(recfac, bl, lmax, xchunk, outchunk); break; - case 4: legendre_transform_vec4(recfac, bl, lmax, xchunk, outchunk); break; - case 3: legendre_transform_vec3(recfac, bl, lmax, xchunk, outchunk); break; - case 2: legendre_transform_vec2(recfac, bl, lmax, xchunk, outchunk); break; - case 1: - case 0: - legendre_transform_vec1(recfac, bl, lmax, xchunk, outchunk); break; - } - for (j = 0; j != len; ++j) out[i + j] = outchunk[j]; - } - if (compute_recfac) { - free(recfac); - } -} - -void sharp_legendre_transform_s(float *bl, - float *recfac, - ptrdiff_t lmax, - float *x, float *out, ptrdiff_t nx) { - float xchunk[MAX_CS * VLEN_s], outchunk[MAX_CS * LEN_s]; - int compute_recfac; - ptrdiff_t i, j, len; - - compute_recfac = (recfac == NULL); - if (compute_recfac) { - recfac = malloc(sizeof(float) * (lmax + 1)); - sharp_legendre_transform_recfac_s(recfac, lmax); - } - - for (j = 0; j != LEN_s; ++j) xchunk[j] = 0; - - for (i = 0; i < nx; i += LEN_s) { - len = (i + (LEN_s) <= nx) ? (LEN_s) : (nx - i); - for (j = 0; j != len; ++j) xchunk[j] = x[i + j]; - switch ((len + VLEN_s - 1) / VLEN_s) { - case 6: legendre_transform_vec6_s(recfac, bl, lmax, xchunk, outchunk); break; - case 5: legendre_transform_vec5_s(recfac, bl, lmax, xchunk, outchunk); break; - case 4: legendre_transform_vec4_s(recfac, bl, lmax, xchunk, outchunk); break; - case 3: legendre_transform_vec3_s(recfac, bl, lmax, xchunk, outchunk); break; - case 2: legendre_transform_vec2_s(recfac, bl, lmax, xchunk, outchunk); break; - case 1: - case 0: - legendre_transform_vec1_s(recfac, bl, lmax, xchunk, outchunk); break; - } - for (j = 0; j != len; ++j) out[i + j] = outchunk[j]; - } - if (compute_recfac) { - free(recfac); - } -} - - -#endif \ No newline at end of file diff --git a/external/sharp/libsharp/sharp_legendre.c.in b/external/sharp/libsharp/sharp_legendre.c.in deleted file mode 100644 index 63c84b7..0000000 --- a/external/sharp/libsharp/sharp_legendre.c.in +++ /dev/null @@ -1,176 +0,0 @@ -/* - - NOTE NOTE NOTE - - This file is edited in sharp_legendre.c.in which is then preprocessed. - Do not make manual modifications to sharp_legendre.c. - - NOTE NOTE NOTE - -*/ - - -/* - * This file is part of libsharp. - * - * Redistribution and use in source and binary forms, with or without - * met: - * - * 1. Redistributions of source code must retain the above copyright - * notice, this list of conditions and the following disclaimer. - * - * 2. Redistributions in binary form must reproduce the above copyright - * notice, this list of conditions and the following disclaimer in the - * documentation and/or other materials provided with the distribution. - * - * 3. Neither the name of the copyright holder nor the names of its - * contributors may be used to endorse or promote products derived from - * this software without specific prior written permission. - * - * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS - * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT - * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR - * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT - * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, - * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT - * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, - * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY - * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE - * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - */ - -/*! \file sharp_legendre.c.in - * - * Copyright (C) 2015 University of Oslo - * \author Dag Sverre Seljebotn - */ - -#ifndef NO_LEGENDRE -#if (VLEN==8) -#error This code is not tested with MIC; please compile with -DNO_LEGENDRE -/* ...or test it (it probably works) and remove this check */ -#endif - -#ifndef SHARP_LEGENDRE_CS -#define SHARP_LEGENDRE_CS 4 -#endif - -#define MAX_CS 6 -#if (SHARP_LEGENDRE_CS > MAX_CS) -#error (SHARP_LEGENDRE_CS > MAX_CS) -#endif - -#include "sharp_legendre.h" -#include "sharp_vecsupport.h" - -#include - -/*{ for scalar, T in [("double", ""), ("float", "_s")] }*/ -/*{ for cs in range(1, 7) }*/ -static void legendre_transform_vec{{cs}}{{T}}({{scalar}} *recfacs, {{scalar}} *bl, ptrdiff_t lmax, - {{scalar}} xarr[({{cs}}) * VLEN{{T}}], - {{scalar}} out[({{cs}}) * VLEN{{T}}]) { - /*{ for i in range(cs) }*/ - Tv{{T}} P_{{i}}, Pm1_{{i}}, Pm2_{{i}}, x{{i}}, y{{i}}; - /*{ endfor }*/ - Tv{{T}} W1, W2, b, R; - ptrdiff_t l; - - /*{ for i in range(cs) }*/ - x{{i}} = vloadu{{T}}(xarr + {{i}} * VLEN{{T}}); - Pm1_{{i}} = vload{{T}}(1.0); - P_{{i}} = x{{i}}; - b = vload{{T}}(*bl); - y{{i}} = vmul{{T}}(Pm1_{{i}}, b); - /*{ endfor }*/ - - b = vload{{T}}(*(bl + 1)); - /*{ for i in range(cs) }*/ - vfmaeq{{T}}(y{{i}}, P_{{i}}, b); - /*{ endfor }*/ - - for (l = 2; l <= lmax; ++l) { - b = vload{{T}}(*(bl + l)); - R = vload{{T}}(*(recfacs + l)); - - /* - P = x * Pm1 + recfacs[l] * (x * Pm1 - Pm2) - */ - /*{ for i in range(cs) }*/ - Pm2_{{i}} = Pm1_{{i}}; Pm1_{{i}} = P_{{i}}; - W1 = vmul{{T}}(x{{i}}, Pm1_{{i}}); - W2 = W1; - W2 = vsub{{T}}(W2, Pm2_{{i}}); - P_{{i}} = W1; - vfmaeq{{T}}(P_{{i}}, W2, R); - vfmaeq{{T}}(y{{i}}, P_{{i}}, b); - /*{ endfor }*/ - - } - /*{ for i in range(cs) }*/ - vstoreu{{T}}(out + {{i}} * VLEN{{T}}, y{{i}}); - /*{ endfor }*/ -} -/*{ endfor }*/ -/*{ endfor }*/ - - -/*{ for scalar, T in [("double", ""), ("float", "_s")] }*/ -void sharp_legendre_transform_recfac{{T}}({{scalar}} *r, ptrdiff_t lmax) { - /* (l - 1) / l, for l >= 2 */ - ptrdiff_t l; - r[0] = 0; - r[1] = 1; - for (l = 2; l <= lmax; ++l) { - r[l] = ({{scalar}})(l - 1) / ({{scalar}})l; - } -} -/*{ endfor }*/ - -/* - Compute sum_l b_l P_l(x_i) for all i. - */ - -#define LEN (SHARP_LEGENDRE_CS * VLEN) -#define LEN_s (SHARP_LEGENDRE_CS * VLEN_s) - -/*{ for scalar, T in [("double", ""), ("float", "_s")] }*/ -void sharp_legendre_transform{{T}}({{scalar}} *bl, - {{scalar}} *recfac, - ptrdiff_t lmax, - {{scalar}} *x, {{scalar}} *out, ptrdiff_t nx) { - {{scalar}} xchunk[MAX_CS * VLEN{{T}}], outchunk[MAX_CS * LEN{{T}}]; - int compute_recfac; - ptrdiff_t i, j, len; - - compute_recfac = (recfac == NULL); - if (compute_recfac) { - recfac = malloc(sizeof({{scalar}}) * (lmax + 1)); - sharp_legendre_transform_recfac{{T}}(recfac, lmax); - } - - for (j = 0; j != LEN{{T}}; ++j) xchunk[j] = 0; - - for (i = 0; i < nx; i += LEN{{T}}) { - len = (i + (LEN{{T}}) <= nx) ? (LEN{{T}}) : (nx - i); - for (j = 0; j != len; ++j) xchunk[j] = x[i + j]; - switch ((len + VLEN{{T}} - 1) / VLEN{{T}}) { - case 6: legendre_transform_vec6{{T}}(recfac, bl, lmax, xchunk, outchunk); break; - case 5: legendre_transform_vec5{{T}}(recfac, bl, lmax, xchunk, outchunk); break; - case 4: legendre_transform_vec4{{T}}(recfac, bl, lmax, xchunk, outchunk); break; - case 3: legendre_transform_vec3{{T}}(recfac, bl, lmax, xchunk, outchunk); break; - case 2: legendre_transform_vec2{{T}}(recfac, bl, lmax, xchunk, outchunk); break; - case 1: - case 0: - legendre_transform_vec1{{T}}(recfac, bl, lmax, xchunk, outchunk); break; - } - for (j = 0; j != len; ++j) out[i + j] = outchunk[j]; - } - if (compute_recfac) { - free(recfac); - } -} -/*{ endfor }*/ - -#endif diff --git a/external/sharp/libsharp/sharp_legendre.h b/external/sharp/libsharp/sharp_legendre.h deleted file mode 100644 index cfd8aee..0000000 --- a/external/sharp/libsharp/sharp_legendre.h +++ /dev/null @@ -1,62 +0,0 @@ -/* - * This file is part of libsharp. - * - * Redistribution and use in source and binary forms, with or without - * met: - * - * 1. Redistributions of source code must retain the above copyright - * notice, this list of conditions and the following disclaimer. - * - * 2. Redistributions in binary form must reproduce the above copyright - * notice, this list of conditions and the following disclaimer in the - * documentation and/or other materials provided with the distribution. - * - * 3. Neither the name of the copyright holder nor the names of its - * contributors may be used to endorse or promote products derived from - * this software without specific prior written permission. - * - * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS - * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT - * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR - * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT - * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, - * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT - * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, - * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY - * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE - * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - */ - -/*! \file sharp_legendre.h - * Interface for the Legendre transform parts of the spherical transform library. - * - * Copyright (C) 2015 University of Oslo - * \author Dag Sverre Seljebotn - */ - -#ifndef SHARP_LEGENDRE_H -#define SHARP_LEGENDRE_H - -#include - -#ifdef __cplusplus -extern "C" { -#endif - -#ifndef NO_LEGENDRE - -void sharp_legendre_transform(double *bl, double *recfac, ptrdiff_t lmax, double *x, - double *out, ptrdiff_t nx); -void sharp_legendre_transform_s(float *bl, float *recfac, ptrdiff_t lmax, float *x, - float *out, ptrdiff_t nx); -void sharp_legendre_transform_recfac(double *r, ptrdiff_t lmax); -void sharp_legendre_transform_recfac_s(float *r, ptrdiff_t lmax); - -#endif - -#ifdef __cplusplus -} -#endif - -#endif diff --git a/external/sharp/libsharp/sharp_legendre_roots.c b/external/sharp/libsharp/sharp_legendre_roots.c deleted file mode 100644 index 44d8507..0000000 --- a/external/sharp/libsharp/sharp_legendre_roots.c +++ /dev/null @@ -1,67 +0,0 @@ -/* Function adapted from GNU GSL file glfixed.c - Original author: Pavel Holoborodko (http://www.holoborodko.com) - - Adjustments by M. Reinecke - - adjusted interface (keep epsilon internal, return full number of points) - - removed precomputed tables - - tweaked Newton iteration to obtain higher accuracy */ - -#include -#include "sharp_legendre_roots.h" -#include "c_utils.h" - -static inline double one_minus_x2 (double x) - { return (fabs(x)>0.1) ? (1.+x)*(1.-x) : 1.-x*x; } - -void sharp_legendre_roots(int n, double *x, double *w) - { - const double pi = 3.141592653589793238462643383279502884197; - const double eps = 3e-14; - int m = (n+1)>>1; - - double t0 = 1 - (1-1./n) / (8.*n*n); - double t1 = 1./(4.*n+2.); - -#pragma omp parallel -{ - int i; -#pragma omp for schedule(dynamic,100) - for (i=1; i<=m; ++i) - { - double x0 = cos(pi * ((i<<2)-1) * t1) * t0; - - int dobreak=0; - int j=0; - double dpdx; - while(1) - { - double P_1 = 1.0; - double P0 = x0; - double dx, x1; - - for (int k=2; k<=n; k++) - { - double P_2 = P_1; - P_1 = P0; -// P0 = ((2*k-1)*x0*P_1-(k-1)*P_2)/k; - P0 = x0*P_1 + (k-1.)/k * (x0*P_1-P_2); - } - - dpdx = (P_1 - x0*P0) * n / one_minus_x2(x0); - - /* Newton step */ - x1 = x0 - P0/dpdx; - dx = x0-x1; - x0 = x1; - if (dobreak) break; - - if (fabs(dx)<=eps) dobreak=1; - UTIL_ASSERT(++j<100,"convergence problem"); - } - - x[i-1] = -x0; - x[n-i] = x0; - w[i-1] = w[n-i] = 2. / (one_minus_x2(x0) * dpdx * dpdx); - } -} // end of parallel region - } diff --git a/external/sharp/libsharp/sharp_legendre_roots.h b/external/sharp/libsharp/sharp_legendre_roots.h deleted file mode 100644 index 2a056b2..0000000 --- a/external/sharp/libsharp/sharp_legendre_roots.h +++ /dev/null @@ -1,50 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp_legendre_roots.h - * - * Copyright (C) 2006-2012 Max-Planck-Society - * \author Martin Reinecke - */ - -#ifndef SHARP_LEGENDRE_ROOTS_H -#define SHARP_LEGENDRE_ROOTS_H - -#ifdef __cplusplus -extern "C" { -#endif - -/*! Computes roots and Gaussian quadrature weights for Legendre polynomial - of degree \a n. - \param n Order of Legendre polynomial - \param x Array of length \a n for output (root position) - \param w Array of length \a w for output (weight for Gaussian quadrature) - */ -void sharp_legendre_roots(int n, double *x, double *w); - -#ifdef __cplusplus -} -#endif - -#endif diff --git a/external/sharp/libsharp/sharp_lowlevel.h b/external/sharp/libsharp/sharp_lowlevel.h deleted file mode 100644 index d9aa01b..0000000 --- a/external/sharp/libsharp/sharp_lowlevel.h +++ /dev/null @@ -1,272 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp_lowlevel.h - * Low-level, portable interface for the spherical transform library. - * - * Copyright (C) 2012-2013 Max-Planck-Society - * \author Martin Reinecke \author Dag Sverre Seljebotn - */ - -#ifndef PLANCK_SHARP_LOWLEVEL_H -#define PLANCK_SHARP_LOWLEVEL_H - -#include - -#ifdef __cplusplus -extern "C" { -#endif - -/*! \internal - Helper type containing information about a single ring. */ -typedef struct - { - double theta, phi0, weight, cth, sth; - ptrdiff_t ofs; - int nph, stride; - } sharp_ringinfo; - -/*! \internal - Helper type containing information about a pair of rings with colatitudes - symmetric around the equator. */ -typedef struct - { - sharp_ringinfo r1,r2; - } sharp_ringpair; - -/*! \internal - Type holding all required information about a map geometry. */ -typedef struct - { - sharp_ringpair *pair; - int npairs, nphmax; - } sharp_geom_info; - -/*! \defgroup almgroup Helpers for dealing with a_lm */ -/*! \{ */ - -/*! \internal - Helper type for index calculation in a_lm arrays. */ -typedef struct - { - /*! Maximum \a l index of the array */ - int lmax; - /*! Number of different \a m values in this object */ - int nm; - /*! Array with \a nm entries containing the individual m values */ - int *mval; - /*! Combination of flags from sharp_almflags */ - int flags; - /*! Array with \a nm entries containing the (hypothetical) indices of - the coefficients with quantum numbers 0,\a mval[i] */ - ptrdiff_t *mvstart; - /*! Stride between a_lm and a_(l+1),m */ - ptrdiff_t stride; - } sharp_alm_info; - -/*! alm_info flags */ -typedef enum { SHARP_PACKED = 1, - /*!< m=0-coefficients are packed so that the (zero) imaginary part is - not present. mvstart is in units of *real* float/double for all - m; stride is in units of reals for m=0 and complex for m!=0 */ - SHARP_REAL_HARMONICS = 1<<6 - /*!< Use the real spherical harmonic convention. For - m==0, the alm are treated exactly the same as in - the complex case. For m!=0, alm[i] represent a - pair (+abs(m), -abs(m)) instead of (real, imag), - and the coefficients are scaled by a factor of - sqrt(2) relative to the complex case. In other - words, (sqrt(.5) * alm[i]) recovers the - corresponding complex coefficient (when accessed - as complex). - */ - } sharp_almflags; - - - -/*! Creates an a_lm data structure from the following parameters: - \param lmax maximum \a l quantum number (>=0) - \param mmax maximum \a m quantum number (0<= \a mmax <= \a lmax) - \param stride the stride between entries with identical \a m, and \a l - differing by 1. - \param mstart the index of the (hypothetical) coefficient with the - quantum numbers 0,\a m. Must have \a mmax+1 entries. - \param alm_info will hold a pointer to the newly created data structure - */ -void sharp_make_alm_info (int lmax, int mmax, int stride, - const ptrdiff_t *mstart, sharp_alm_info **alm_info); -/*! Creates an a_lm data structure which from the following parameters: - \param lmax maximum \a l quantum number (\a >=0) - \param nm number of different \a m (\a 0<=nm<=lmax+1) - \param stride the stride between entries with identical \a m, and \a l - differing by 1. - \param mval array with \a nm entries containing the individual m values - \param mvstart array with \a nm entries containing the (hypothetical) - indices of the coefficients with the quantum numbers 0,\a mval[i] - \param flags a combination of sharp_almflags (pass 0 unless you know you need this) - \param alm_info will hold a pointer to the newly created data structure - */ -void sharp_make_general_alm_info (int lmax, int nm, int stride, const int *mval, - const ptrdiff_t *mvstart, int flags, sharp_alm_info **alm_info); -/*! Returns the index of the coefficient with quantum numbers \a l, - \a mval[mi]. - \note for a \a sharp_alm_info generated by sharp_make_alm_info() this is - the index for the coefficient with the quantum numbers \a l, \a mi. */ -ptrdiff_t sharp_alm_index (const sharp_alm_info *self, int l, int mi); -/*! Returns the number of alm coefficients described by \a self. If the SHARP_PACKED - flag is set, this is number of "real" coeffecients (for m < 0 and m >= 0), - otherwise it is the number of complex coefficients (with m>=0). */ -ptrdiff_t sharp_alm_count(const sharp_alm_info *self); -/*! Deallocates the a_lm info object. */ -void sharp_destroy_alm_info (sharp_alm_info *info); - -/*! \} */ - -/*! \defgroup geominfogroup Functions for dealing with geometry information */ -/*! \{ */ - -/*! Creates a geometry information from a set of ring descriptions. - All arrays passed to this function must have \a nrings elements. - \param nrings the number of rings in the map - \param nph the number of pixels in each ring - \param ofs the index of the first pixel in each ring in the map array - \param stride the stride between consecutive pixels - \param phi0 the azimuth (in radians) of the first pixel in each ring - \param theta the colatitude (in radians) of each ring - \param wgt the pixel weight to be used for the ring in map2alm - and adjoint map2alm transforms. - Pass NULL to use 1.0 as weight for all rings. - \param geom_info will hold a pointer to the newly created data structure - */ -void sharp_make_geom_info (int nrings, const int *nph, const ptrdiff_t *ofs, - const int *stride, const double *phi0, const double *theta, - const double *wgt, sharp_geom_info **geom_info); - -/*! Counts the number of grid points needed for (the local part of) a map described - by \a info. - */ -ptrdiff_t sharp_map_size(const sharp_geom_info *info); - -/*! Deallocates the geometry information in \a info. */ -void sharp_destroy_geom_info (sharp_geom_info *info); - -/*! \} */ - -/*! \defgroup lowlevelgroup Low-level libsharp SHT interface */ -/*! \{ */ - -/*! Enumeration of SHARP job types. */ -typedef enum { SHARP_YtW=0, /*!< analysis */ - SHARP_MAP2ALM=SHARP_YtW, /*!< analysis */ - SHARP_Y=1, /*!< synthesis */ - SHARP_ALM2MAP=SHARP_Y, /*!< synthesis */ - SHARP_Yt=2, /*!< adjoint synthesis */ - SHARP_WY=3, /*!< adjoint analysis */ - SHARP_ALM2MAP_DERIV1=4 /*!< synthesis of first derivatives */ - } sharp_jobtype; - -/*! Job flags */ -typedef enum { SHARP_DP = 1<<4, - /*!< map and a_lm are in double precision */ - SHARP_ADD = 1<<5, - /*!< results are added to the output arrays, instead of - overwriting them */ - - /* NOTE: SHARP_REAL_HARMONICS, 1<<6, is also available in sharp_jobflags, - but its use here is deprecated in favor of having it in the sharp_alm_info */ - - SHARP_NO_FFT = 1<<7, - - SHARP_USE_WEIGHTS = 1<<20, /* internal use only */ - SHARP_NO_OPENMP = 1<<21, /* internal use only */ - SHARP_NVMAX = (1<<4)-1 /* internal use only */ - } sharp_jobflags; - -/*! Performs a libsharp SHT job. The interface deliberately does not use - the C99 "complex" data type, in order to be callable from C89 and C++. - \param type the type of SHT - \param spin the spin of the quantities to be transformed - \param alm contains pointers to the a_lm coefficients. If \a spin==0, - alm[0] points to the a_lm of the first SHT, alm[1] to those of the second - etc. If \a spin>0, alm[0] and alm[1] point to the a_lm of the first SHT, - alm[2] and alm[3] to those of the second, etc. The exact data type of \a alm - depends on whether the SHARP_DP flag is set. - \param map contains pointers to the maps. If \a spin==0, - map[0] points to the map of the first SHT, map[1] to that of the second - etc. If \a spin>0, or \a type is SHARP_ALM2MAP_DERIV1, map[0] and map[1] - point to the maps of the first SHT, map[2] and map[3] to those of the - second, etc. The exact data type of \a map depends on whether the SHARP_DP - flag is set. - \param geom_info A \c sharp_geom_info object compatible with the provided - \a map arrays. - \param alm_info A \c sharp_alm_info object compatible with the provided - \a alm arrays. All \c m values from 0 to some \c mmax<=lmax must be present - exactly once. - \param ntrans the number of simultaneous SHTs - \param flags See sharp_jobflags. In particular, if SHARP_DP is set, then - \a alm is expected to have the type "complex double **" and \a map is - expected to have the type "double **"; otherwise, the expected - types are "complex float **" and "float **", respectively. - \param time If not NULL, the wall clock time required for this SHT - (in seconds) will be written here. - \param opcnt If not NULL, a conservative estimate of the total floating point - operation count for this SHT will be written here. */ -void sharp_execute (sharp_jobtype type, int spin, void *alm, void *map, - const sharp_geom_info *geom_info, const sharp_alm_info *alm_info, int ntrans, - int flags, double *time, unsigned long long *opcnt); - -void sharp_set_chunksize_min(int new_chunksize_min); -void sharp_set_nchunks_max(int new_nchunks_max); - - -typedef enum { SHARP_ERROR_NO_MPI = 1, - /*!< libsharp not compiled with MPI support */ - } sharp_errors; - -/*! Works like sharp_execute_mpi, but is always present whether or not libsharp - is compiled with USE_MPI. This is primarily useful for wrapper code etc. - - Note that \a pcomm has the type MPI_Comm*, except we declare void* to avoid - pulling in MPI headers. I.e., the comm argument of sharp_execute_mpi - is *(MPI_Comm*)pcomm. - - Other parameters are the same as sharp_execute_mpi. - - Returns 0 if successful, or SHARP_ERROR_NO_MPI if MPI is not available - (in which case nothing is done). - */ -int sharp_execute_mpi_maybe (void *pcomm, sharp_jobtype type, int spin, - void *alm, void *map, const sharp_geom_info *geom_info, - const sharp_alm_info *alm_info, int ntrans, int flags, double *time, - unsigned long long *opcnt); - - - -/*! \} */ - -#ifdef __cplusplus -} -#endif - -#endif diff --git a/external/sharp/libsharp/sharp_mpi.c b/external/sharp/libsharp/sharp_mpi.c deleted file mode 100644 index a364ed4..0000000 --- a/external/sharp/libsharp/sharp_mpi.c +++ /dev/null @@ -1,345 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp_mpi.c - * Functionality only needed for MPI-parallel transforms - * - * Copyright (C) 2012-2013 Max-Planck-Society - * \author Martin Reinecke \author Dag Sverre Seljebotn - */ - -#ifdef USE_MPI - -#include "sharp_mpi.h" - -typedef struct - { - int ntasks; /* number of tasks */ - int mytask; /* own task number */ - MPI_Comm comm; /* communicator to use */ - - int *nm; /* number of m values on every task */ - int *ofs_m; /* accumulated nm */ - int nmtotal; /* total number of m values (must be mmax+1) */ - int *mval; /* array containing all m values of task 0, task 1 etc. */ - int mmax; - int nph; - - int *npair; /* number of ring pairs on every task */ - int *ofs_pair; /* accumulated npair */ - int npairtotal; /* total number of ring pairs */ - - double *theta; /* theta of first ring of every pair on task 0, task 1 etc. */ - int *ispair; /* is this really a pair? */ - - int *almcount, *almdisp, *mapcount, *mapdisp; /* for all2all communication */ - } sharp_mpi_info; - -static void sharp_make_mpi_info (MPI_Comm comm, const sharp_job *job, - sharp_mpi_info *minfo) - { - minfo->comm = comm; - MPI_Comm_size (comm, &minfo->ntasks); - MPI_Comm_rank (comm, &minfo->mytask); - - minfo->nm=RALLOC(int,minfo->ntasks); - MPI_Allgather ((int *)(&job->ainfo->nm),1,MPI_INT,minfo->nm,1,MPI_INT,comm); - minfo->ofs_m=RALLOC(int,minfo->ntasks+1); - minfo->ofs_m[0]=0; - for (int i=1; i<=minfo->ntasks; ++i) - minfo->ofs_m[i] = minfo->ofs_m[i-1]+minfo->nm[i-1]; - minfo->nmtotal=minfo->ofs_m[minfo->ntasks]; - minfo->mval=RALLOC(int,minfo->nmtotal); - MPI_Allgatherv(job->ainfo->mval, job->ainfo->nm, MPI_INT, minfo->mval, - minfo->nm, minfo->ofs_m, MPI_INT, comm); - - minfo->mmax=sharp_get_mmax(minfo->mval,minfo->nmtotal); - - minfo->npair=RALLOC(int,minfo->ntasks); - MPI_Allgather ((int *)(&job->ginfo->npairs), 1, MPI_INT, minfo->npair, 1, - MPI_INT, comm); - minfo->ofs_pair=RALLOC(int,minfo->ntasks+1); - minfo->ofs_pair[0]=0; - for (int i=1; i<=minfo->ntasks; ++i) - minfo->ofs_pair[i] = minfo->ofs_pair[i-1]+minfo->npair[i-1]; - minfo->npairtotal=minfo->ofs_pair[minfo->ntasks]; - - double *theta_tmp=RALLOC(double,job->ginfo->npairs); - int *ispair_tmp=RALLOC(int,job->ginfo->npairs); - for (int i=0; iginfo->npairs; ++i) - { - theta_tmp[i]=job->ginfo->pair[i].r1.theta; - ispair_tmp[i]=job->ginfo->pair[i].r2.nph>0; - } - minfo->theta=RALLOC(double,minfo->npairtotal); - minfo->ispair=RALLOC(int,minfo->npairtotal); - MPI_Allgatherv(theta_tmp, job->ginfo->npairs, MPI_DOUBLE, minfo->theta, - minfo->npair, minfo->ofs_pair, MPI_DOUBLE, comm); - MPI_Allgatherv(ispair_tmp, job->ginfo->npairs, MPI_INT, minfo->ispair, - minfo->npair, minfo->ofs_pair, MPI_INT, comm); - DEALLOC(theta_tmp); - DEALLOC(ispair_tmp); - - minfo->nph=2*job->nmaps*job->ntrans; - - minfo->almcount=RALLOC(int,minfo->ntasks); - minfo->almdisp=RALLOC(int,minfo->ntasks+1); - minfo->mapcount=RALLOC(int,minfo->ntasks); - minfo->mapdisp=RALLOC(int,minfo->ntasks+1); - minfo->almdisp[0]=minfo->mapdisp[0]=0; - for (int i=0; intasks; ++i) - { - minfo->almcount[i] = 2*minfo->nph*minfo->nm[minfo->mytask]*minfo->npair[i]; - minfo->almdisp[i+1] = minfo->almdisp[i]+minfo->almcount[i]; - minfo->mapcount[i] = 2*minfo->nph*minfo->nm[i]*minfo->npair[minfo->mytask]; - minfo->mapdisp[i+1] = minfo->mapdisp[i]+minfo->mapcount[i]; - } - } - -static void sharp_destroy_mpi_info (sharp_mpi_info *minfo) - { - DEALLOC(minfo->nm); - DEALLOC(minfo->ofs_m); - DEALLOC(minfo->mval); - DEALLOC(minfo->npair); - DEALLOC(minfo->ofs_pair); - DEALLOC(minfo->theta); - DEALLOC(minfo->ispair); - DEALLOC(minfo->almcount); - DEALLOC(minfo->almdisp); - DEALLOC(minfo->mapcount); - DEALLOC(minfo->mapdisp); - } - -static void sharp_communicate_alm2map (const sharp_mpi_info *minfo, dcmplx **ph) - { - dcmplx *phas_tmp = RALLOC(dcmplx,minfo->mapdisp[minfo->ntasks]/2); - - MPI_Alltoallv (*ph,minfo->almcount,minfo->almdisp,MPI_DOUBLE,phas_tmp, - minfo->mapcount,minfo->mapdisp,MPI_DOUBLE,minfo->comm); - - DEALLOC(*ph); - ALLOC(*ph,dcmplx,minfo->nph*minfo->npair[minfo->mytask]*minfo->nmtotal); - - for (int task=0; taskntasks; ++task) - for (int th=0; thnpair[minfo->mytask]; ++th) - for (int mi=0; minm[task]; ++mi) - { - int m = minfo->mval[mi+minfo->ofs_m[task]]; - int o1 = minfo->nph*(th*(minfo->mmax+1) + m); - int o2 = minfo->mapdisp[task]/2+minfo->nph*(mi+th*minfo->nm[task]); - for (int i=0; inph; ++i) - (*ph)[o1+i] = phas_tmp[o2+i]; - } - DEALLOC(phas_tmp); - } - -static void sharp_communicate_map2alm (const sharp_mpi_info *minfo, dcmplx **ph) - { - dcmplx *phas_tmp = RALLOC(dcmplx,minfo->mapdisp[minfo->ntasks]/2); - - for (int task=0; taskntasks; ++task) - for (int th=0; thnpair[minfo->mytask]; ++th) - for (int mi=0; minm[task]; ++mi) - { - int m = minfo->mval[mi+minfo->ofs_m[task]]; - int o1 = minfo->mapdisp[task]/2+minfo->nph*(mi+th*minfo->nm[task]); - int o2 = minfo->nph*(th*(minfo->mmax+1) + m); - for (int i=0; inph; ++i) - phas_tmp[o1+i] = (*ph)[o2+i]; - } - - DEALLOC(*ph); - ALLOC(*ph,dcmplx,minfo->nph*minfo->nm[minfo->mytask]*minfo->npairtotal); - - MPI_Alltoallv (phas_tmp,minfo->mapcount,minfo->mapdisp,MPI_DOUBLE, - *ph,minfo->almcount,minfo->almdisp,MPI_DOUBLE,minfo->comm); - - DEALLOC(phas_tmp); - } - -static void alloc_phase_mpi (sharp_job *job, int nm, int ntheta, - int nmfull, int nthetafull) - { - ptrdiff_t phase_size = (job->type==SHARP_MAP2ALM) ? - (ptrdiff_t)(nmfull)*ntheta : (ptrdiff_t)(nm)*nthetafull; - job->phase=RALLOC(dcmplx,2*job->ntrans*job->nmaps*phase_size); - job->s_m=2*job->ntrans*job->nmaps; - job->s_th = job->s_m * ((job->type==SHARP_MAP2ALM) ? nmfull : nm); - } - -static void alm2map_comm (sharp_job *job, const sharp_mpi_info *minfo) - { - if (job->type != SHARP_MAP2ALM) - { - sharp_communicate_alm2map (minfo,&job->phase); - job->s_th=job->s_m*minfo->nmtotal; - } - } - -static void map2alm_comm (sharp_job *job, const sharp_mpi_info *minfo) - { - if (job->type == SHARP_MAP2ALM) - { - sharp_communicate_map2alm (minfo,&job->phase); - job->s_th=job->s_m*minfo->nm[minfo->mytask]; - } - } - -static void sharp_execute_job_mpi (sharp_job *job, MPI_Comm comm) - { - int ntasks; - MPI_Comm_size(comm, &ntasks); - if (ntasks==1) /* fall back to scalar implementation */ - { sharp_execute_job (job); return; } - - MPI_Barrier(comm); - double timer=wallTime(); - job->opcnt=0; - sharp_mpi_info minfo; - sharp_make_mpi_info(comm, job, &minfo); - - if (minfo.npairtotal>minfo.ntasks*300) - { - int nsub=(minfo.npairtotal+minfo.ntasks*200-1)/(minfo.ntasks*200); - for (int isub=0; isub0)&&(job->type==SHARP_MAP2ALM)) ljob.flags|=SHARP_ADD; - sharp_geom_info lginfo; - lginfo.pair=RALLOC(sharp_ringpair,(job->ginfo->npairs/nsub)+1); - lginfo.npairs=0; - lginfo.nphmax = job->ginfo->nphmax; - while (lginfo.npairs*nsub+isubginfo->npairs) - { - lginfo.pair[lginfo.npairs]=job->ginfo->pair[lginfo.npairs*nsub+isub]; - ++lginfo.npairs; - } - ljob.ginfo=&lginfo; - sharp_execute_job_mpi (&ljob,comm); - job->opcnt+=ljob.opcnt; - DEALLOC(lginfo.pair); - } - } - else - { - int lmax = job->ainfo->lmax; - job->norm_l = sharp_Ylmgen_get_norm (lmax, job->spin); - - /* clear output arrays if requested */ - init_output (job); - - alloc_phase_mpi (job,job->ainfo->nm,job->ginfo->npairs,minfo.mmax+1, - minfo.npairtotal); - - double *cth = RALLOC(double,minfo.npairtotal), - *sth = RALLOC(double,minfo.npairtotal); - int *mlim = RALLOC(int,minfo.npairtotal); - for (int i=0; ispin, sth[i], cth[i]); - } - - /* map->phase where necessary */ - map2phase (job, minfo.mmax, 0, job->ginfo->npairs); - - map2alm_comm (job, &minfo); - -#pragma omp parallel if ((job->flags&SHARP_NO_OPENMP)==0) -{ - sharp_job ljob = *job; - sharp_Ylmgen_C generator; - sharp_Ylmgen_init (&generator,lmax,minfo.mmax,ljob.spin); - alloc_almtmp(&ljob,lmax); - -#pragma omp for schedule(dynamic,1) - for (int mi=0; miainfo->nm; ++mi) - { - /* alm->alm_tmp where necessary */ - alm2almtmp (&ljob, lmax, mi); - - /* inner conversion loop */ - inner_loop (&ljob, minfo.ispair, cth, sth, 0, minfo.npairtotal, - &generator, mi, mlim); - - /* alm_tmp->alm where necessary */ - almtmp2alm (&ljob, lmax, mi); - } - - sharp_Ylmgen_destroy(&generator); - dealloc_almtmp(&ljob); - -#pragma omp critical - job->opcnt+=ljob.opcnt; -} /* end of parallel region */ - - alm2map_comm (job, &minfo); - - /* phase->map where necessary */ - phase2map (job, minfo.mmax, 0, job->ginfo->npairs); - - DEALLOC(mlim); - DEALLOC(cth); - DEALLOC(sth); - DEALLOC(job->norm_l); - dealloc_phase (job); - } - sharp_destroy_mpi_info(&minfo); - job->time=wallTime()-timer; - } - -void sharp_execute_mpi (MPI_Comm comm, sharp_jobtype type, int spin, - void *alm, void *map, const sharp_geom_info *geom_info, - const sharp_alm_info *alm_info, int ntrans, int flags, double *time, - unsigned long long *opcnt) - { - sharp_job job; - sharp_build_job_common (&job, type, spin, alm, map, geom_info, alm_info, - ntrans, flags); - - sharp_execute_job_mpi (&job, comm); - if (time!=NULL) *time = job.time; - if (opcnt!=NULL) *opcnt = job.opcnt; - } - -/* We declare this only in C file to make symbol available for Fortran wrappers; - without declaring it in C header as it should not be available to C code */ -void sharp_execute_mpi_fortran(MPI_Fint comm, sharp_jobtype type, int spin, - void *alm, void *map, const sharp_geom_info *geom_info, - const sharp_alm_info *alm_info, int ntrans, int flags, double *time, - unsigned long long *opcnt); -void sharp_execute_mpi_fortran(MPI_Fint comm, sharp_jobtype type, int spin, - void *alm, void *map, const sharp_geom_info *geom_info, - const sharp_alm_info *alm_info, int ntrans, int flags, double *time, - unsigned long long *opcnt) - { - sharp_execute_mpi(MPI_Comm_f2c(comm), type, spin, alm, map, geom_info, - alm_info, ntrans, flags, time, opcnt); - } - -#endif diff --git a/external/sharp/libsharp/sharp_mpi.h b/external/sharp/libsharp/sharp_mpi.h deleted file mode 100644 index 1053a65..0000000 --- a/external/sharp/libsharp/sharp_mpi.h +++ /dev/null @@ -1,83 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp_mpi.h - * Interface for the spherical transform library with MPI support. - * - * Copyright (C) 2011,2012 Max-Planck-Society - * \author Martin Reinecke \author Dag Sverre Seljebotn - */ - -#ifndef PLANCK_SHARP_MPI_H -#define PLANCK_SHARP_MPI_H - -#include -#include "sharp_lowlevel.h" - -#ifdef __cplusplus -extern "C" { -#endif - -/*! Performs an MPI parallel libsharp SHT job. The interface deliberately does - not use the C99 "complex" data type, in order to be callable from C. - \param comm the MPI communicator to be used for this SHT - \param type the type of SHT - \param spin the spin of the quantities to be transformed - \param alm contains pointers to the a_lm coefficients. If \a spin==0, - alm[0] points to the a_lm of the first SHT, alm[1] to those of the second - etc. If \a spin>0, alm[0] and alm[1] point to the a_lm of the first SHT, - alm[2] and alm[3] to those of the second, etc. The exact data type of \a alm - depends on whether the SHARP_DP flag is set. - \param map contains pointers to the maps. If \a spin==0, - map[0] points to the map of the first SHT, map[1] to that of the second - etc. If \a spin>0, or \a type is SHARP_ALM2MAP_DERIV1, map[0] and map[1] - point to the maps of the first SHT, map[2] and map[3] to those of the - second, etc. The exact data type of \a map depends on whether the SHARP_DP - flag is set. - \param geom_info A \c sharp_geom_info object compatible with the provided - \a map arrays. The total map geometry is the union of all \a geom_info - objects over the participating MPI tasks. - \param alm_info A \c sharp_alm_info object compatible with the provided - \a alm arrays. All \c m values from 0 to some \c mmax<=lmax must be present - exactly once in the union of all \a alm_info objects over the participating - MPI tasks. - \param ntrans the number of simultaneous SHTs - \param flags See sharp_jobflags. In particular, if SHARP_DP is set, then - \a alm is expected to have the type "complex double **" and \a map is - expected to have the type "double **"; otherwise, the expected - types are "complex float **" and "float **", respectively. - \param time If not NULL, the wall clock time required for this SHT - (in seconds) will be written here. - \param opcnt If not NULL, a conservative estimate of the total floating point - operation count for this SHT will be written here. */ -void sharp_execute_mpi (MPI_Comm comm, sharp_jobtype type, int spin, - void *alm, void *map, const sharp_geom_info *geom_info, - const sharp_alm_info *alm_info, int ntrans, int flags, double *time, - unsigned long long *opcnt); - -#ifdef __cplusplus -} -#endif - -#endif diff --git a/external/sharp/libsharp/sharp_testsuite.c b/external/sharp/libsharp/sharp_testsuite.c deleted file mode 100644 index 2b1c7af..0000000 --- a/external/sharp/libsharp/sharp_testsuite.c +++ /dev/null @@ -1,708 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/* \file sharp_testsuite.c - * - * Copyright (C) 2012-2013 Max-Planck-Society - * \author Martin Reinecke - */ - -#include -#include -#ifdef USE_MPI -#include "mpi.h" -#include "sharp_mpi.h" -#endif -#ifdef _OPENMP -#include -#endif -#include "sharp.h" -#include "sharp_internal.h" -#include "sharp_geomhelpers.h" -#include "sharp_almhelpers.h" -#include "c_utils.h" -#include "sharp_announce.h" -#include "memusage.h" -#include "sharp_vecsupport.h" - -typedef complex double dcmplx; - -int ntasks, mytask; - -static double drand (double min, double max, int *state) - { - *state = (((*state) * 1103515245) + 12345) & 0x7fffffff; - return min + (max-min)*(*state)/(0x7fffffff+1.0); - } - -static void random_alm (dcmplx *alm, sharp_alm_info *helper, int spin, int cnt) - { -#pragma omp parallel -{ - int mi; -#pragma omp for schedule (dynamic,100) - for (mi=0;minm; ++mi) - { - int m=helper->mval[mi]; - int state=1234567*cnt+8912*m; // random seed - for (int l=m;l<=helper->lmax; ++l) - { - if ((lnm; i+=ntasks,++nmnew) - { - ainfo->mval[nmnew]=ainfo->mval[i]; - ainfo->mvstart[nmnew]=ofs-ainfo->mval[nmnew]; - ofs+=ainfo->lmax-ainfo->mval[nmnew]+1; - } - ainfo->nm=nmnew; - } - -static void reduce_geom_info(sharp_geom_info *ginfo) - { - int npairsnew=0; - ptrdiff_t ofs = 0; - for (int i=mytask; inpairs; i+=ntasks,++npairsnew) - { - ginfo->pair[npairsnew]=ginfo->pair[i]; - ginfo->pair[npairsnew].r1.ofs=ofs; - ofs+=ginfo->pair[npairsnew].r1.nph; - ginfo->pair[npairsnew].r2.ofs=ofs; - if (ginfo->pair[npairsnew].r2.nph>0) ofs+=ginfo->pair[npairsnew].r2.nph; - } - ginfo->npairs=npairsnew; - } -#endif - -static ptrdiff_t get_nalms(const sharp_alm_info *ainfo) - { - ptrdiff_t res=0; - for (int i=0; inm; ++i) - res += ainfo->lmax-ainfo->mval[i]+1; - return res; - } - -static ptrdiff_t get_npix(const sharp_geom_info *ginfo) - { - ptrdiff_t res=0; - for (int i=0; inpairs; ++i) - { - res += ginfo->pair[i].r1.nph; - if (ginfo->pair[i].r2.nph>0) res += ginfo->pair[i].r2.nph; - } - return res; - } - -static double *get_sqsum_and_invert (dcmplx **alm, ptrdiff_t nalms, int ncomp) - { - double *sqsum=RALLOC(double,ncomp); - for (int i=0; imaxdiff) maxdiff=sqr; - } - maxdiff=sqrt(maxdiff); - -#ifdef USE_MPI - MPI_Allreduce(&sum,&sumtot,1,MPI_DOUBLE,MPI_SUM,MPI_COMM_WORLD); - MPI_Allreduce(&sqsum[i],&sqsumtot,1,MPI_DOUBLE,MPI_SUM,MPI_COMM_WORLD); - MPI_Allreduce(&maxdiff,&maxdifftot,1,MPI_DOUBLE,MPI_MAX,MPI_COMM_WORLD); -#else - sumtot=sum; - sqsumtot=sqsum[i]; - maxdifftot=maxdiff; -#endif - sumtot=sqrt(sumtot/nalms_tot); - sqsumtot=sqrt(sqsumtot/nalms_tot); - (*err_abs)[i]=maxdifftot; - (*err_rel)[i]=sumtot/sqsumtot; - } - } - -static int good_fft_size(int n) - { - if (n<=6) return n; - int bestfac=2*n; - - for (int f2=1; f2=n) bestfac=f235; - - return bestfac; - } - -static void get_infos (const char *gname, int lmax, int *mmax, int *gpar1, - int *gpar2, sharp_geom_info **ginfo, sharp_alm_info **ainfo) - { - UTIL_ASSERT(lmax>=0,"lmax must not be negative"); - if (*mmax<0) *mmax=lmax; - UTIL_ASSERT(*mmax<=lmax,"mmax larger than lmax"); - - if (mytask==0) printf ("lmax: %d, mmax: %d\n",lmax,*mmax); - - sharp_make_triangular_alm_info(lmax,*mmax,1,ainfo); -#ifdef USE_MPI - reduce_alm_info(*ainfo); -#endif - - if (strcmp(gname,"healpix")==0) - { - if (*gpar1<1) *gpar1=lmax/2; - if (*gpar1==0) ++(*gpar1); - sharp_make_healpix_geom_info (*gpar1, 1, ginfo); - if (mytask==0) printf ("HEALPix grid, nside=%d\n",*gpar1); - } - else if (strcmp(gname,"gauss")==0) - { - if (*gpar1<1) *gpar1=lmax+1; - if (*gpar2<1) *gpar2=2*(*mmax)+1; - sharp_make_gauss_geom_info (*gpar1, *gpar2, 0., 1, *gpar2, ginfo); - if (mytask==0) - printf ("Gauss-Legendre grid, nlat=%d, nlon=%d\n",*gpar1,*gpar2); - } - else if (strcmp(gname,"fejer1")==0) - { - if (*gpar1<1) *gpar1=2*lmax+1; - if (*gpar2<1) *gpar2=2*(*mmax)+1; - sharp_make_fejer1_geom_info (*gpar1, *gpar2, 0., 1, *gpar2, ginfo); - if (mytask==0) printf ("Fejer1 grid, nlat=%d, nlon=%d\n",*gpar1,*gpar2); - } - else if (strcmp(gname,"fejer2")==0) - { - if (*gpar1<1) *gpar1=2*lmax+1; - if (*gpar2<1) *gpar2=2*(*mmax)+1; - sharp_make_fejer2_geom_info (*gpar1, *gpar2, 0., 1, *gpar2, ginfo); - if (mytask==0) printf ("Fejer2 grid, nlat=%d, nlon=%d\n",*gpar1,*gpar2); - } - else if (strcmp(gname,"cc")==0) - { - if (*gpar1<1) *gpar1=2*lmax+1; - if (*gpar2<1) *gpar2=2*(*mmax)+1; - sharp_make_cc_geom_info (*gpar1, *gpar2, 0., 1, *gpar2, ginfo); - if (mytask==0) - printf("Clenshaw-Curtis grid, nlat=%d, nlon=%d\n",*gpar1,*gpar2); - } - else if (strcmp(gname,"smallgauss")==0) - { - int nlat=*gpar1, nlon=*gpar2; - if (nlat<1) nlat=lmax+1; - if (nlon<1) nlon=2*(*mmax)+1; - *gpar1=nlat; *gpar2=nlon; - sharp_make_gauss_geom_info (nlat, nlon, 0., 1, nlon, ginfo); - ptrdiff_t npix_o=get_npix(*ginfo); - size_t ofs=0; - for (int i=0; i<(*ginfo)->npairs; ++i) - { - sharp_ringpair *pair=&((*ginfo)->pair[i]); - int pring=1+2*sharp_get_mlim(lmax,0,pair->r1.sth,pair->r1.cth); - if (pring>nlon) pring=nlon; - pring=good_fft_size(pring); - pair->r1.nph=pring; - pair->r1.weight*=nlon*1./pring; - pair->r1.ofs=ofs; - ofs+=pring; - if (pair->r2.nph>0) - { - pair->r2.nph=pring; - pair->r2.weight*=nlon*1./pring; - pair->r2.ofs=ofs; - ofs+=pring; - } - } - if (mytask==0) - { - ptrdiff_t npix=get_npix(*ginfo); - printf("Small Gauss grid, nlat=%d, npix=%ld, savings=%.2f%%\n", - nlat,(long)npix,(npix_o-npix)*100./npix_o); - } - } - else - UTIL_FAIL("unknown grid geometry"); - -#ifdef USE_MPI - reduce_geom_info(*ginfo); -#endif - } - -static void check_sign_scale(void) - { - int lmax=50; - int mmax=lmax; - sharp_geom_info *tinfo; - int nrings=lmax+1; - int ppring=2*lmax+2; - ptrdiff_t npix=(ptrdiff_t)nrings*ppring; - sharp_make_gauss_geom_info (nrings, ppring, 0., 1, ppring, &tinfo); - - /* flip theta to emulate the "old" Gaussian grid geometry */ - for (int i=0; inpairs; ++i) - { - const double pi=3.141592653589793238462643383279502884197; - tinfo->pair[i].r1.cth=-tinfo->pair[i].r1.cth; - tinfo->pair[i].r2.cth=-tinfo->pair[i].r2.cth; - tinfo->pair[i].r1.theta=pi-tinfo->pair[i].r1.theta; - tinfo->pair[i].r2.theta=pi-tinfo->pair[i].r2.theta; - } - - sharp_alm_info *alms; - sharp_make_triangular_alm_info(lmax,mmax,1,&alms); - ptrdiff_t nalms = ((mmax+1)*(mmax+2))/2 + (mmax+1)*(lmax-mmax); - - for (int ntrans=1; ntrans<10; ++ntrans) - { - double **map; - ALLOC2D(map,double,2*ntrans,npix); - - dcmplx **alm; - ALLOC2D(alm,dcmplx,2*ntrans,nalms); - for (int i=0; i<2*ntrans; ++i) - for (int j=0; j=9,"usage: grid lmax mmax geom1 geom2 spin ntrans"); - int lmax=atoi(argv[3]); - int mmax=atoi(argv[4]); - int gpar1=atoi(argv[5]); - int gpar2=atoi(argv[6]); - int spin=atoi(argv[7]); - int ntrans=atoi(argv[8]); - - if (mytask==0) printf("Testing map analysis accuracy.\n"); - if (mytask==0) printf("spin=%d, ntrans=%d\n", spin, ntrans); - - sharp_geom_info *ginfo; - sharp_alm_info *ainfo; - get_infos (argv[2], lmax, &mmax, &gpar1, &gpar2, &ginfo, &ainfo); - - int ncomp = ntrans*((spin==0) ? 1 : 2); - double t_a2m=1e30, t_m2a=1e30; - unsigned long long op_a2m, op_m2a; - double *err_abs,*err_rel; - - double t_acc=0; - int nrpt=0; - while(1) - { - ++nrpt; - double ta2m2, tm2a2; - do_sht (ginfo, ainfo, spin, ntrans, 0, &err_abs, &err_rel, &ta2m2, &tm2a2, - &op_a2m, &op_m2a); - if (ta2m22.) - { - if (mytask==0) printf("Best of %d runs\n",nrpt); - break; - } - DEALLOC(err_abs); - DEALLOC(err_rel); - } - - if (mytask==0) printf("wall time for alm2map: %fs\n",t_a2m); - if (mytask==0) printf("Performance: %fGFLOPs/s\n",1e-9*op_a2m/t_a2m); - if (mytask==0) printf("wall time for map2alm: %fs\n",t_m2a); - if (mytask==0) printf("Performance: %fGFLOPs/s\n",1e-9*op_m2a/t_m2a); - - if (mytask==0) - for (int i=0; i=9,"usage: grid lmax mmax geom1 geom2 spin ntrans"); - int lmax=atoi(argv[3]); - int mmax=atoi(argv[4]); - int gpar1=atoi(argv[5]); - int gpar2=atoi(argv[6]); - int spin=atoi(argv[7]); - int ntrans=atoi(argv[8]); - - if (mytask==0) printf("Testing map analysis accuracy.\n"); - if (mytask==0) printf("spin=%d, ntrans=%d\n", spin, ntrans); - - sharp_geom_info *ginfo; - sharp_alm_info *ainfo; - get_infos (argv[2], lmax, &mmax, &gpar1, &gpar2, &ginfo, &ainfo); - - double ta2m_auto=1e30, tm2a_auto=1e30, ta2m_min=1e30, tm2a_min=1e30; - unsigned long long opa2m_min=0, opm2a_min=0; - int nvmin_a2m=-1, nvmin_m2a=-1; - for (int nv=0; nv<=6; ++nv) - { - int ntries=0; - double tacc=0; - do - { - double t_a2m, t_m2a; - unsigned long long op_a2m, op_m2a; - double *err_abs,*err_rel; - do_sht (ginfo, ainfo, spin, ntrans, nv, &err_abs, &err_rel, - &t_a2m, &t_m2a, &op_a2m, &op_m2a); - - DEALLOC(err_abs); - DEALLOC(err_rel); - tacc+=t_a2m+t_m2a; - ++ntries; - if (nv==0) - { - if (t_a2m=2,"need at least one command line argument"); - - if (strcmp(argv[1],"acctest")==0) - sharp_acctest(); - else if (strcmp(argv[1],"test")==0) - sharp_test(argc,argv); - else if (strcmp(argv[1],"bench")==0) - sharp_bench(argc,argv); - else - UTIL_FAIL("unknown command"); - -#ifdef USE_MPI - MPI_Finalize(); -#endif - return 0; - } diff --git a/external/sharp/libsharp/sharp_vecsupport.h b/external/sharp/libsharp/sharp_vecsupport.h deleted file mode 100644 index ee4c5e7..0000000 --- a/external/sharp/libsharp/sharp_vecsupport.h +++ /dev/null @@ -1,255 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/* \file sharp_vecsupport.h - * Convenience functions for vector arithmetics - * - * Copyright (C) 2012,2013 Max-Planck-Society - * Author: Martin Reinecke - */ - -#ifndef SHARP_VECSUPPORT_H -#define SHARP_VECSUPPORT_H - -#include -#include "sharp_vecutil.h" - -typedef double Ts; - -#if (VLEN==1) - -typedef double Tv; -typedef float Tv_s; -typedef int Tm; - -#define vadd(a,b) ((a)+(b)) -#define vadd_s(a,b) ((a)+(b)) -#define vaddeq(a,b) ((a)+=(b)) -#define vaddeq_mask(mask,a,b) if (mask) (a)+=(b); -#define vsub(a,b) ((a)-(b)) -#define vsub_s(a,b) ((a)-(b)) -#define vsubeq(a,b) ((a)-=(b)) -#define vsubeq_mask(mask,a,b) if (mask) (a)-=(b); -#define vmul(a,b) ((a)*(b)) -#define vmul_s(a,b) ((a)*(b)) -#define vmuleq(a,b) ((a)*=(b)) -#define vmuleq_mask(mask,a,b) if (mask) (a)*=(b); -#define vfmaeq(a,b,c) ((a)+=(b)*(c)) -#define vfmaeq_s(a,b,c) ((a)+=(b)*(c)) -#define vfmseq(a,b,c) ((a)-=(b)*(c)) -#define vfmaaeq(a,b,c,d,e) ((a)+=(b)*(c)+(d)*(e)) -#define vfmaseq(a,b,c,d,e) ((a)+=(b)*(c)-(d)*(e)) -#define vneg(a) (-(a)) -#define vload(a) (a) -#define vload_s(a) (a) -#define vloadu(p) (*(p)) -#define vloadu_s(p) (*(p)) -#define vabs(a) fabs(a) -#define vsqrt(a) sqrt(a) -#define vlt(a,b) ((a)<(b)) -#define vgt(a,b) ((a)>(b)) -#define vge(a,b) ((a)>=(b)) -#define vne(a,b) ((a)!=(b)) -#define vand_mask(a,b) ((a)&&(b)) -#define vstoreu(p, a) (*(p)=a) -#define vstoreu_s(p, a) (*(p)=a) - -static inline Tv vmin (Tv a, Tv b) { return (ab) ? a : b; } - -#define vanyTrue(a) (a) -#define vallTrue(a) (a) -#define vzero 0. -#define vone 1. - -#endif - -#if (VLEN==2) - -#include - -#if defined (__SSE3__) -#include -#endif -#if defined (__SSE4_1__) -#include -#endif - -typedef __m128d Tv; -typedef __m128 Tv_s; -typedef __m128d Tm; - -#if defined(__SSE4_1__) -#define vblend__(m,a,b) _mm_blendv_pd(b,a,m) -#else -static inline Tv vblend__(Tv m, Tv a, Tv b) - { return _mm_or_pd(_mm_and_pd(a,m),_mm_andnot_pd(m,b)); } -#endif -#define vzero _mm_setzero_pd() -#define vone _mm_set1_pd(1.) - -#define vadd(a,b) _mm_add_pd(a,b) -#define vadd_s(a,b) _mm_add_ps(a,b) -#define vaddeq(a,b) a=_mm_add_pd(a,b) -#define vaddeq_mask(mask,a,b) a=_mm_add_pd(a,vblend__(mask,b,vzero)) -#define vsub(a,b) _mm_sub_pd(a,b) -#define vsub_s(a,b) _mm_sub_ps(a,b) -#define vsubeq(a,b) a=_mm_sub_pd(a,b) -#define vsubeq_mask(mask,a,b) a=_mm_sub_pd(a,vblend__(mask,b,vzero)) -#define vmul(a,b) _mm_mul_pd(a,b) -#define vmul_s(a,b) _mm_mul_ps(a,b) -#define vmuleq(a,b) a=_mm_mul_pd(a,b) -#define vmuleq_mask(mask,a,b) a=_mm_mul_pd(a,vblend__(mask,b,vone)) -#define vfmaeq(a,b,c) a=_mm_add_pd(a,_mm_mul_pd(b,c)) -#define vfmaeq_s(a,b,c) a=_mm_add_ps(a,_mm_mul_ps(b,c)) -#define vfmseq(a,b,c) a=_mm_sub_pd(a,_mm_mul_pd(b,c)) -#define vfmaaeq(a,b,c,d,e) \ - a=_mm_add_pd(a,_mm_add_pd(_mm_mul_pd(b,c),_mm_mul_pd(d,e))) -#define vfmaseq(a,b,c,d,e) \ - a=_mm_add_pd(a,_mm_sub_pd(_mm_mul_pd(b,c),_mm_mul_pd(d,e))) -#define vneg(a) _mm_xor_pd(_mm_set1_pd(-0.),a) -#define vload(a) _mm_set1_pd(a) -#define vload_s(a) _mm_set1_ps(a) -#define vabs(a) _mm_andnot_pd(_mm_set1_pd(-0.),a) -#define vsqrt(a) _mm_sqrt_pd(a) -#define vlt(a,b) _mm_cmplt_pd(a,b) -#define vgt(a,b) _mm_cmpgt_pd(a,b) -#define vge(a,b) _mm_cmpge_pd(a,b) -#define vne(a,b) _mm_cmpneq_pd(a,b) -#define vand_mask(a,b) _mm_and_pd(a,b) -#define vmin(a,b) _mm_min_pd(a,b) -#define vmax(a,b) _mm_max_pd(a,b); -#define vanyTrue(a) (_mm_movemask_pd(a)!=0) -#define vallTrue(a) (_mm_movemask_pd(a)==3) -#define vloadu(p) _mm_loadu_pd(p) -#define vloadu_s(p) _mm_loadu_ps(p) -#define vstoreu(p, v) _mm_storeu_pd(p, v) -#define vstoreu_s(p, v) _mm_storeu_ps(p, v) - -#endif - -#if (VLEN==4) - -#include -#if (USE_FMA4) -#include -#endif - -typedef __m256d Tv; -typedef __m256 Tv_s; -typedef __m256d Tm; - -#define vblend__(m,a,b) _mm256_blendv_pd(b,a,m) -#define vzero _mm256_setzero_pd() -#define vone _mm256_set1_pd(1.) - -#define vadd(a,b) _mm256_add_pd(a,b) -#define vadd_s(a,b) _mm256_add_ps(a,b) -#define vaddeq(a,b) a=_mm256_add_pd(a,b) -#define vaddeq_mask(mask,a,b) a=_mm256_add_pd(a,vblend__(mask,b,vzero)) -#define vsub(a,b) _mm256_sub_pd(a,b) -#define vsub_s(a,b) _mm256_sub_ps(a,b) -#define vsubeq(a,b) a=_mm256_sub_pd(a,b) -#define vsubeq_mask(mask,a,b) a=_mm256_sub_pd(a,vblend__(mask,b,vzero)) -#define vmul(a,b) _mm256_mul_pd(a,b) -#define vmul_s(a,b) _mm256_mul_ps(a,b) -#define vmuleq(a,b) a=_mm256_mul_pd(a,b) -#define vmuleq_mask(mask,a,b) a=_mm256_mul_pd(a,vblend__(mask,b,vone)) -#if (USE_FMA4) -#define vfmaeq(a,b,c) a=_mm256_macc_pd(b,c,a) -#define vfmaeq_s(a,b,c) a=_mm256_macc_ps(b,c,a) -#define vfmseq(a,b,c) a=_mm256_nmacc_pd(b,c,a) -#define vfmaaeq(a,b,c,d,e) a=_mm256_macc_pd(d,e,_mm256_macc_pd(b,c,a)) -#define vfmaseq(a,b,c,d,e) a=_mm256_nmacc_pd(d,e,_mm256_macc_pd(b,c,a)) -#else -#define vfmaeq(a,b,c) a=_mm256_add_pd(a,_mm256_mul_pd(b,c)) -#define vfmaeq_s(a,b,c) a=_mm256_add_ps(a,_mm256_mul_ps(b,c)) -#define vfmseq(a,b,c) a=_mm256_sub_pd(a,_mm256_mul_pd(b,c)) -#define vfmaaeq(a,b,c,d,e) \ - a=_mm256_add_pd(a,_mm256_add_pd(_mm256_mul_pd(b,c),_mm256_mul_pd(d,e))) -#define vfmaseq(a,b,c,d,e) \ - a=_mm256_add_pd(a,_mm256_sub_pd(_mm256_mul_pd(b,c),_mm256_mul_pd(d,e))) -#endif -#define vneg(a) _mm256_xor_pd(_mm256_set1_pd(-0.),a) -#define vload(a) _mm256_set1_pd(a) -#define vload_s(a) _mm256_set1_ps(a) -#define vabs(a) _mm256_andnot_pd(_mm256_set1_pd(-0.),a) -#define vsqrt(a) _mm256_sqrt_pd(a) -#define vlt(a,b) _mm256_cmp_pd(a,b,_CMP_LT_OQ) -#define vgt(a,b) _mm256_cmp_pd(a,b,_CMP_GT_OQ) -#define vge(a,b) _mm256_cmp_pd(a,b,_CMP_GE_OQ) -#define vne(a,b) _mm256_cmp_pd(a,b,_CMP_NEQ_OQ) -#define vand_mask(a,b) _mm256_and_pd(a,b) -#define vmin(a,b) _mm256_min_pd(a,b) -#define vmax(a,b) _mm256_max_pd(a,b) -#define vanyTrue(a) (_mm256_movemask_pd(a)!=0) -#define vallTrue(a) (_mm256_movemask_pd(a)==15) - -#define vloadu(p) _mm256_loadu_pd(p) -#define vloadu_s(p) _mm256_loadu_ps(p) -#define vstoreu(p, v) _mm256_storeu_pd(p, v) -#define vstoreu_s(p, v) _mm256_storeu_ps(p, v) - -#endif - -#if (VLEN==8) - -#include - -typedef __m512d Tv; -typedef __mmask8 Tm; - -#define vadd(a,b) _mm512_add_pd(a,b) -#define vaddeq(a,b) a=_mm512_add_pd(a,b) -#define vaddeq_mask(mask,a,b) a=_mm512_mask_add_pd(a,mask,a,b); -#define vsub(a,b) _mm512_sub_pd(a,b) -#define vsubeq(a,b) a=_mm512_sub_pd(a,b) -#define vsubeq_mask(mask,a,b) a=_mm512_mask_sub_pd(a,mask,a,b); -#define vmul(a,b) _mm512_mul_pd(a,b) -#define vmuleq(a,b) a=_mm512_mul_pd(a,b) -#define vmuleq_mask(mask,a,b) a=_mm512_mask_mul_pd(a,mask,a,b); -#define vfmaeq(a,b,c) a=_mm512_fmadd_pd(b,c,a) -#define vfmseq(a,b,c) a=_mm512_fnmadd_pd(b,c,a) -#define vfmaaeq(a,b,c,d,e) a=_mm512_fmadd_pd(d,e,_mm512_fmadd_pd(b,c,a)) -#define vfmaseq(a,b,c,d,e) a=_mm512_fnmadd_pd(d,e,_mm512_fmadd_pd(b,c,a)) -#define vneg(a) _mm512_mul_pd(a,_mm512_set1_pd(-1.)) -#define vload(a) _mm512_set1_pd(a) -#define vabs(a) (__m512d)_mm512_andnot_epi64((__m512i)_mm512_set1_pd(-0.),(__m512i)a) -#define vsqrt(a) _mm512_sqrt_pd(a) -#define vlt(a,b) _mm512_cmplt_pd_mask(a,b) -#define vgt(a,b) _mm512_cmpnle_pd_mask(a,b) -#define vge(a,b) _mm512_cmpnlt_pd_mask(a,b) -#define vne(a,b) _mm512_cmpneq_pd_mask(a,b) -#define vand_mask(a,b) ((a)&(b)) -#define vmin(a,b) _mm512_min_pd(a,b) -#define vmax(a,b) _mm512_max_pd(a,b) -#define vanyTrue(a) (a!=0) -#define vallTrue(a) (a==255) - -#define vzero _mm512_setzero_pd() -#define vone _mm512_set1_pd(1.) - -#endif - -#endif diff --git a/external/sharp/libsharp/sharp_vecutil.h b/external/sharp/libsharp/sharp_vecutil.h deleted file mode 100644 index f6161ca..0000000 --- a/external/sharp/libsharp/sharp_vecutil.h +++ /dev/null @@ -1,63 +0,0 @@ -/* - * This file is part of libc_utils. - * - * libc_utils is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libc_utils is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libc_utils; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libc_utils is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/*! \file sharp_vecutil.h - * Functionality related to vector instruction support - * - * Copyright (C) 2012,2013 Max-Planck-Society - * \author Martin Reinecke - */ - -#ifndef SHARP_VECUTIL_H -#define SHARP_VECUTIL_H - -#ifndef VLEN - -#if (defined (__MIC__)) -#define VLEN 8 -#elif (defined (__AVX__)) -#define VLEN 4 -#elif (defined (__SSE2__)) -#define VLEN 2 -#else -#define VLEN 1 -#endif - -#endif - -#if (VLEN==1) -#define VLEN_s 1 -#else -#define VLEN_s (2*VLEN) -#endif - -#ifndef USE_FMA4 -#ifdef __FMA4__ -#define USE_FMA4 1 -#else -#define USE_FMA4 0 -#endif -#endif - -#endif diff --git a/external/sharp/libsharp/sharp_ylmgen_c.c b/external/sharp/libsharp/sharp_ylmgen_c.c deleted file mode 100644 index 6e8cee5..0000000 --- a/external/sharp/libsharp/sharp_ylmgen_c.c +++ /dev/null @@ -1,232 +0,0 @@ -/* - * This file is part of libsharp. - * - * libsharp is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * libsharp is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with libsharp; if not, write to the Free Software - * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - */ - -/* - * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik - * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt - * (DLR). - */ - -/* - * Helper code for efficient calculation of Y_lm(theta,phi=0) - * - * Copyright (C) 2005-2014 Max-Planck-Society - * Author: Martin Reinecke - */ - -#include -#include -#include "sharp_ylmgen_c.h" -#include "c_utils.h" - -static inline void normalize (double *val, int *scale, double xfmax) - { - while (fabs(*val)>xfmax) { *val*=sharp_fsmall; ++*scale; } - if (*val!=0.) - while (fabs(*val)lmax = l_max; - gen->mmax = m_max; - UTIL_ASSERT(spin>=0,"incorrect spin: must be nonnegative"); - UTIL_ASSERT(l_max>=spin,"incorrect l_max: must be >= spin"); - UTIL_ASSERT(l_max>=m_max,"incorrect l_max: must be >= m_max"); - gen->s = spin; - UTIL_ASSERT((sharp_minscale<=0)&&(sharp_maxscale>0), - "bad value for min/maxscale"); - gen->cf=RALLOC(double,sharp_maxscale-sharp_minscale+1); - gen->cf[-sharp_minscale]=1.; - for (int m=-sharp_minscale-1; m>=0; --m) - gen->cf[m]=gen->cf[m+1]*sharp_fsmall; - for (int m=-sharp_minscale+1; m<(sharp_maxscale-sharp_minscale+1); ++m) - gen->cf[m]=gen->cf[m-1]*sharp_fbig; - - gen->m = -1; - if (spin==0) - { - gen->rf = RALLOC(sharp_ylmgen_dbl2,gen->lmax+1); - gen->mfac = RALLOC(double,gen->mmax+1); - gen->mfac[0] = inv_sqrt4pi; - for (int m=1; m<=gen->mmax; ++m) - gen->mfac[m] = gen->mfac[m-1]*sqrt((2*m+1.)/(2*m)); - gen->root = RALLOC(double,2*gen->lmax+5); - gen->iroot = RALLOC(double,2*gen->lmax+5); - for (int m=0; m<2*gen->lmax+5; ++m) - { - gen->root[m] = sqrt(m); - gen->iroot[m] = (m==0) ? 0. : 1./gen->root[m]; - } - } - else - { - gen->m=gen->mlo=gen->mhi=-1234567890; - ALLOC(gen->fx,sharp_ylmgen_dbl3,gen->lmax+2); - for (int m=0; mlmax+2; ++m) - gen->fx[m].f[0]=gen->fx[m].f[1]=gen->fx[m].f[2]=0.; - ALLOC(gen->inv,double,gen->lmax+1); - gen->inv[0]=0; - for (int m=1; mlmax+1; ++m) gen->inv[m]=1./m; - ALLOC(gen->flm1,double,2*gen->lmax+1); - ALLOC(gen->flm2,double,2*gen->lmax+1); - for (int m=0; m<2*gen->lmax+1; ++m) - { - gen->flm1[m] = sqrt(1./(m+1.)); - gen->flm2[m] = sqrt(m/(m+1.)); - } - ALLOC(gen->prefac,double,gen->mmax+1); - ALLOC(gen->fscale,int,gen->mmax+1); - double *fac = RALLOC(double,2*gen->lmax+1); - int *facscale = RALLOC(int,2*gen->lmax+1); - fac[0]=1; facscale[0]=0; - for (int m=1; m<2*gen->lmax+1; ++m) - { - fac[m]=fac[m-1]*sqrt(m); - facscale[m]=facscale[m-1]; - normalize(&fac[m],&facscale[m],sharp_fbighalf); - } - for (int m=0; m<=gen->mmax; ++m) - { - int mlo=gen->s, mhi=m; - if (mhiprefac[m]=tfac; - gen->fscale[m]=tscale; - } - DEALLOC(fac); - DEALLOC(facscale); - } - } - -void sharp_Ylmgen_destroy (sharp_Ylmgen_C *gen) - { - DEALLOC(gen->cf); - if (gen->s==0) - { - DEALLOC(gen->rf); - DEALLOC(gen->mfac); - DEALLOC(gen->root); - DEALLOC(gen->iroot); - } - else - { - DEALLOC(gen->fx); - DEALLOC(gen->prefac); - DEALLOC(gen->fscale); - DEALLOC(gen->flm1); - DEALLOC(gen->flm2); - DEALLOC(gen->inv); - } - } - -void sharp_Ylmgen_prepare (sharp_Ylmgen_C *gen, int m) - { - if (m==gen->m) return; - UTIL_ASSERT(m>=0,"incorrect m"); - gen->m = m; - - if (gen->s==0) - { - gen->rf[m].f[0] = gen->root[2*m+3]; - gen->rf[m].f[1] = 0.; - for (int l=m+1; l<=gen->lmax; ++l) - { - double tmp=gen->root[2*l+3]*gen->iroot[l+1+m]*gen->iroot[l+1-m]; - gen->rf[l].f[0] = tmp*gen->root[2*l+1]; - gen->rf[l].f[1] = tmp*gen->root[l+m]*gen->root[l-m]*gen->iroot[2*l-1]; - } - } - else - { - int mlo_=m, mhi_=gen->s; - if (mhi_mhi==mhi_) && (gen->mlo==mlo_)); - - gen->mlo = mlo_; gen->mhi = mhi_; - - if (!ms_similar) - { - for (int l=gen->mhi; llmax; ++l) - { - double t = gen->flm1[l+gen->m]*gen->flm1[l-gen->m] - *gen->flm1[l+gen->s]*gen->flm1[l-gen->s]; - double lt = 2*l+1; - double l1 = l+1; - gen->fx[l+1].f[0]=l1*lt*t; - gen->fx[l+1].f[1]=gen->m*gen->s*gen->inv[l]*gen->inv[l+1]; - t = gen->flm2[l+gen->m]*gen->flm2[l-gen->m] - *gen->flm2[l+gen->s]*gen->flm2[l-gen->s]; - gen->fx[l+1].f[2]=t*l1*gen->inv[l]; - } - } - - gen->preMinus_p = gen->preMinus_m = 0; - if (gen->mhi==gen->m) - { - gen->cosPow = gen->mhi+gen->s; gen->sinPow = gen->mhi-gen->s; - gen->preMinus_p = gen->preMinus_m = ((gen->mhi-gen->s)&1); - } - else - { - gen->cosPow = gen->mhi+gen->m; gen->sinPow = gen->mhi-gen->m; - gen->preMinus_m = ((gen->mhi+gen->m)&1); - } - } - } - -double *sharp_Ylmgen_get_norm (int lmax, int spin) - { - const double pi = 3.141592653589793238462643383279502884197; - double *res=RALLOC(double,lmax+1); - /* sign convention for H=1 (LensPix paper) */ -#if 1 - double spinsign = (spin>0) ? -1.0 : 1.0; -#else - double spinsign = 1.0; -#endif - - if (spin==0) - { - for (int l=0; l<=lmax; ++l) - res[l]=1.; - return res; - } - - spinsign = (spin&1) ? -spinsign : spinsign; - for (int l=0; l<=lmax; ++l) - res[l] = (l 0: - sharp_legendre_roots(n, &x_buf[0], &w_buf[0]) - return x, w - - -JOBTYPE_TO_CONST = { - 'Y': SHARP_Y, - 'Yt': SHARP_Yt, - 'WY': SHARP_WY, - 'YtW': SHARP_YtW -} - -def sht(jobtype, geom_info ginfo, alm_info ainfo, double[:, :, ::1] input, - int spin=0, comm=None, add=False): - cdef void *comm_ptr - cdef int flags = SHARP_DP | (SHARP_ADD if add else 0) - cdef int r - cdef sharp_jobtype jobtype_i - cdef double[:, :, ::1] output_buf - cdef int ntrans = input.shape[0] * input.shape[1] - cdef int i, j - - if spin == 0 and input.shape[1] != 1: - raise ValueError('For spin == 0, we need input.shape[1] == 1') - elif spin != 0 and input.shape[1] != 2: - raise ValueError('For spin != 0, we need input.shape[1] == 2') - - - cdef size_t[::1] ptrbuf = np.empty(2 * ntrans, dtype=np.uintp) - cdef double **alm_ptrs = &ptrbuf[0] - cdef double **map_ptrs = &ptrbuf[ntrans] - - try: - jobtype_i = JOBTYPE_TO_CONST[jobtype] - except KeyError: - raise ValueError('jobtype must be one of: %s' % ', '.join(sorted(JOBTYPE_TO_CONST.keys()))) - - if jobtype_i == SHARP_Y or jobtype_i == SHARP_WY: - output = np.empty((input.shape[0], input.shape[1], ginfo.local_size()), dtype=np.float64) - output_buf = output - for i in range(input.shape[0]): - for j in range(input.shape[1]): - alm_ptrs[i * input.shape[1] + j] = &input[i, j, 0] - map_ptrs[i * input.shape[1] + j] = &output_buf[i, j, 0] - else: - output = np.empty((input.shape[0], input.shape[1], ainfo.local_size()), dtype=np.float64) - output_buf = output - for i in range(input.shape[0]): - for j in range(input.shape[1]): - alm_ptrs[i * input.shape[1] + j] = &output_buf[i, j, 0] - map_ptrs[i * input.shape[1] + j] = &input[i, j, 0] - - if comm is None: - with nogil: - sharp_execute ( - jobtype_i, - geom_info=ginfo.ginfo, alm_info=ainfo.ainfo, - spin=spin, alm=alm_ptrs, map=map_ptrs, - ntrans=ntrans, flags=flags, time=NULL, opcnt=NULL) - else: - from mpi4py import MPI - if not isinstance(comm, MPI.Comm): - raise TypeError('comm must be an mpi4py communicator') - from .libsharp_mpi import _addressof - comm_ptr = _addressof(comm) - with nogil: - r = sharp_execute_mpi_maybe ( - comm_ptr, jobtype_i, - geom_info=ginfo.ginfo, alm_info=ainfo.ainfo, - spin=spin, alm=alm_ptrs, map=map_ptrs, - ntrans=ntrans, flags=flags, time=NULL, opcnt=NULL) - if r == SHARP_ERROR_NO_MPI: - raise Exception('MPI requested, but not available') - - return output - - -def synthesis(*args, **kw): - return sht('Y', *args, **kw) - -def adjoint_synthesis(*args, **kw): - return sht('Yt', *args, **kw) - -def analysis(*args, **kw): - return sht('YtW', *args, **kw) - -def adjoint_analysis(*args, **kw): - return sht('WY', *args, **kw) - - -# -# geom_info -# -class NotInitializedError(Exception): - pass - - -cdef class geom_info: - cdef sharp_geom_info *ginfo - - def __cinit__(self, *args, **kw): - self.ginfo = NULL - - def local_size(self): - if self.ginfo == NULL: - raise NotInitializedError() - return sharp_map_size(self.ginfo) - - def __dealloc__(self): - if self.ginfo != NULL: - sharp_destroy_geom_info(self.ginfo) - self.ginfo = NULL - - -cdef class healpix_grid(geom_info): - - _weight_cache = {} # { (nside, 'T'/'Q'/'U') -> numpy array of ring weights cached from file } - - def __init__(self, int nside, stride=1, int[::1] rings=None, double[::1] weights=None): - if weights is not None and weights.shape[0] != 2 * nside: - raise ValueError('weights must have length 2 * nside') - sharp_make_subset_healpix_geom_info(nside, stride, - nrings=4 * nside - 1 if rings is None else rings.shape[0], - rings=NULL if rings is None else &rings[0], - weight=NULL if weights is None else &weights[0], - geom_info=&self.ginfo) - - @classmethod - def load_ring_weights(cls, nside, fields): - """ - Loads HEALPix ring weights from file. The environment variable - HEALPIX should be set, and this routine will look in the `data` - subdirectory. - - Parameters - ---------- - - nside: int - HEALPix nside parameter - - fields: tuple of str - Which weights to extract; pass ('T',) to only get scalar - weights back, or ('T', 'Q', 'U') to get all the weights - - Returns - ------- - - List of NumPy arrays, according to fields parameter. - - """ - import os - from astropy.io import fits - data_path = os.path.join(os.environ['HEALPIX'], 'data') - fits_field_names = { - 'T': 'TEMPERATURE WEIGHTS', - 'Q': 'Q-POLARISATION WEIGHTS', - 'U': 'U-POLARISATION WEIGHTS'} - - must_load = [field for field in fields if (nside, field) not in cls._weight_cache] - - if must_load: - hdulist = fits.open(os.path.join(data_path, 'weight_ring_n%05d.fits' % nside)) - try: - for field in must_load: - w = hdulist[1].data.field(fits_field_names[field]).ravel().astype(np.double) - w += 1 - cls._weight_cache[nside, field] = w - finally: - hdulist.close() - return [cls._weight_cache[(nside, field)].copy() for field in fields] - -# -# alm_info -# - - -cdef class alm_info: - cdef sharp_alm_info *ainfo - - def __cinit__(self, *args, **kw): - self.ainfo = NULL - - def local_size(self): - if self.ainfo == NULL: - raise NotInitializedError() - return sharp_alm_count(self.ainfo) - - def __dealloc__(self): - if self.ainfo != NULL: - sharp_destroy_alm_info(self.ainfo) - self.ainfo = NULL - - -cdef class triangular_order(alm_info): - def __init__(self, int lmax, mmax=None, stride=1): - mmax = mmax if mmax is not None else lmax - sharp_make_triangular_alm_info(lmax, mmax, stride, &self.ainfo) - - -cdef class rectangular_order(alm_info): - def __init__(self, int lmax, mmax=None, stride=1): - mmax = mmax if mmax is not None else lmax - sharp_make_rectangular_alm_info(lmax, mmax, stride, &self.ainfo) - - -cdef class packed_real_order(alm_info): - def __init__(self, int lmax, stride=1, int[::1] ms=None): - sharp_make_mmajor_real_packed_alm_info(lmax=lmax, stride=stride, - nm=lmax + 1 if ms is None else ms.shape[0], - ms=NULL if ms is None else &ms[0], - alm_info=&self.ainfo) - diff --git a/external/sharp/python/libsharp/libsharp_mpi.pyx b/external/sharp/python/libsharp/libsharp_mpi.pyx deleted file mode 100644 index e819a77..0000000 --- a/external/sharp/python/libsharp/libsharp_mpi.pyx +++ /dev/null @@ -1,17 +0,0 @@ -cdef extern from "mpi.h": - ctypedef void *MPI_Comm - -cdef extern from "Python.h": - object PyLong_FromVoidPtr(void*) - -cdef extern: - ctypedef class mpi4py.MPI.Comm [object PyMPICommObject]: - cdef MPI_Comm ob_mpi - cdef unsigned flags - -# For compatibility with mpi4py <= 1.3.1 -# Newer versions could use the MPI._addressof function -def _addressof(Comm comm): - cdef void *ptr = NULL - ptr = &comm.ob_mpi - return PyLong_FromVoidPtr(ptr) diff --git a/external/sharp/python/libsharp/tests/__init__.py b/external/sharp/python/libsharp/tests/__init__.py deleted file mode 100644 index 1bb8bf6..0000000 --- a/external/sharp/python/libsharp/tests/__init__.py +++ /dev/null @@ -1 +0,0 @@ -# empty diff --git a/external/sharp/python/libsharp/tests/test_legendre.py b/external/sharp/python/libsharp/tests/test_legendre.py deleted file mode 100644 index 321fa9c..0000000 --- a/external/sharp/python/libsharp/tests/test_legendre.py +++ /dev/null @@ -1,59 +0,0 @@ -import numpy as np -from scipy.special import legendre -from scipy.special import p_roots -import libsharp - -from numpy.testing import assert_allclose - - -def check_legendre_transform(lmax, ntheta): - l = np.arange(lmax + 1) - if lmax >= 1: - sigma = -np.log(1e-3) / lmax / (lmax + 1) - bl = np.exp(-sigma*l*(l+1)) - bl *= (2 * l + 1) - else: - bl = np.asarray([1], dtype=np.double) - - theta = np.linspace(0, np.pi, ntheta, endpoint=True) - x = np.cos(theta) - - # Compute truth using scipy.special.legendre - P = np.zeros((ntheta, lmax + 1)) - for l in range(lmax + 1): - P[:, l] = legendre(l)(x) - y0 = np.dot(P, bl) - - - # double-precision - y = libsharp.legendre_transform(x, bl) - - assert_allclose(y, y0, rtol=1e-12, atol=1e-12) - - # single-precision - y32 = libsharp.legendre_transform(x.astype(np.float32), bl) - assert_allclose(y, y0, rtol=1e-5, atol=1e-5) - - -def test_legendre_transform(): - nthetas_to_try = [0, 9, 17, 19] + list(np.random.randint(500, size=20)) - for ntheta in nthetas_to_try: - for lmax in [0, 1, 2, 3, 20] + list(np.random.randint(50, size=4)): - yield check_legendre_transform, lmax, ntheta - -def check_legendre_roots(n): - xs, ws = ([], []) if n == 0 else p_roots(n) # from SciPy - xl, wl = libsharp.legendre_roots(n) - assert_allclose(xs, xl, rtol=1e-14, atol=1e-14) - assert_allclose(ws, wl, rtol=1e-14, atol=1e-14) - -def test_legendre_roots(): - """ - Test the Legendre root-finding algorithm from libsharp by comparing it with - the SciPy version. - """ - yield check_legendre_roots, 0 - yield check_legendre_roots, 1 - yield check_legendre_roots, 32 - yield check_legendre_roots, 33 - yield check_legendre_roots, 128 diff --git a/external/sharp/python/libsharp/tests/test_sht.py b/external/sharp/python/libsharp/tests/test_sht.py deleted file mode 100644 index 459f446..0000000 --- a/external/sharp/python/libsharp/tests/test_sht.py +++ /dev/null @@ -1,34 +0,0 @@ -import numpy as np -import healpy -from scipy.special import legendre -from scipy.special import p_roots -from numpy.testing import assert_allclose -import libsharp - -from mpi4py import MPI - - -def test_basic(): - lmax = 10 - nside = 8 - rank = MPI.COMM_WORLD.Get_rank() - ms = np.arange(rank, lmax + 1, MPI.COMM_WORLD.Get_size(), dtype=np.int32) - - order = libsharp.packed_real_order(lmax, ms=ms) - grid = libsharp.healpix_grid(nside) - - - alm = np.zeros(order.local_size()) - if rank == 0: - alm[0] = 1 - elif rank == 1: - alm[0] = 1 - - - map = libsharp.synthesis(grid, order, np.repeat(alm[None, None, :], 3, 0), comm=MPI.COMM_WORLD) - assert np.all(map[2, :] == map[1, :]) and np.all(map[1, :] == map[0, :]) - map = map[0, 0, :] - if rank == 0: - healpy.mollzoom(map) - from matplotlib.pyplot import show - show() diff --git a/external/sharp/python/setup.py b/external/sharp/python/setup.py deleted file mode 100644 index b6195a3..0000000 --- a/external/sharp/python/setup.py +++ /dev/null @@ -1,77 +0,0 @@ -#! /usr/bin/env python - -descr = """Spherical Harmionic transforms package - -Python API for the libsharp spherical harmonic transforms library -""" - -import os -import sys - -DISTNAME = 'libsharp' -DESCRIPTION = 'libsharp library for fast Spherical Harmonic Transforms' -LONG_DESCRIPTION = descr -MAINTAINER = 'Dag Sverre Seljebotn', -MAINTAINER_EMAIL = 'd.s.seljebotn@astro.uio.no', -URL = 'http://sourceforge.net/projects/libsharp/' -LICENSE = 'GPL' -DOWNLOAD_URL = "http://sourceforge.net/projects/libsharp/" -VERSION = '0.1' - -# Add our fake Pyrex at the end of the Python search path -# in order to fool setuptools into allowing compilation of -# pyx files to C files. Importing Cython.Distutils then -# makes Cython the tool of choice for this rather than -# (the possibly nonexisting) Pyrex. -project_path = os.path.split(__file__)[0] -sys.path.append(os.path.join(project_path, 'fake_pyrex')) - -from setuptools import setup, find_packages, Extension -from Cython.Distutils import build_ext -import numpy as np - -libsharp = os.environ.get('LIBSHARP', None) -libsharp_include = os.environ.get('LIBSHARP_INCLUDE', libsharp and os.path.join(libsharp, 'include')) -libsharp_lib = os.environ.get('LIBSHARP_LIB', libsharp and os.path.join(libsharp, 'lib')) - -if libsharp_include is None or libsharp_lib is None: - sys.stderr.write('Please set LIBSHARP environment variable to the install directly of libsharp, ' - 'this script will refer to the lib and include sub-directories. Alternatively ' - 'set LIBSHARP_INCLUDE and LIBSHARP_LIB\n') - sys.exit(1) - -if __name__ == "__main__": - setup(install_requires = ['numpy'], - packages = find_packages(), - test_suite="nose.collector", - # Well, technically zipping the package will work, but since it's - # all compiled code it'll just get unzipped again at runtime, which - # is pointless: - zip_safe = False, - name = DISTNAME, - version = VERSION, - maintainer = MAINTAINER, - maintainer_email = MAINTAINER_EMAIL, - description = DESCRIPTION, - license = LICENSE, - url = URL, - download_url = DOWNLOAD_URL, - long_description = LONG_DESCRIPTION, - classifiers = - [ 'Development Status :: 3 - Alpha', - 'Environment :: Console', - 'Intended Audience :: Developers', - 'Intended Audience :: Science/Research', - 'License :: OSI Approved :: GNU General Public License (GPL)', - 'Topic :: Scientific/Engineering'], - cmdclass = {"build_ext": build_ext}, - ext_modules = [ - Extension("libsharp.libsharp", - ["libsharp/libsharp.pyx"], - libraries=["sharp", "fftpack", "c_utils"], - include_dirs=[libsharp_include], - library_dirs=[libsharp_lib], - extra_link_args=["-fopenmp"], - ) - ], - ) diff --git a/external/sharp/runjinja.py b/external/sharp/runjinja.py deleted file mode 100755 index fd659fa..0000000 --- a/external/sharp/runjinja.py +++ /dev/null @@ -1,19 +0,0 @@ -#!/usr/bin/env python - -""" -Preprocesses foo.c.in to foo.c. Reads STDIN and writes STDOUT. -""" - -import sys -import hashlib -from jinja2 import Template, Environment - -env = Environment(block_start_string='/*{', - block_end_string='}*/', - variable_start_string='{{', - variable_end_string='}}') - -extra_vars = dict(len=len) -input = sys.stdin.read() -sys.stdout.write('/* DO NOT EDIT. md5sum of source: %s */' % hashlib.md5(input).hexdigest()) -sys.stdout.write(env.from_string(input).render(**extra_vars)) diff --git a/src/symbol_visible.hpp b/src/symbol_visible.hpp new file mode 100644 index 0000000..d128144 --- /dev/null +++ b/src/symbol_visible.hpp @@ -0,0 +1,32 @@ +#ifndef __COSMOTOOL_SYMBOL_VISIBLE_HPP +#define __COSMOTOOL_SYMBOL_VISIBLE_HPP + + +#if defined _WIN32 || defined __CYGWIN__ + #ifdef BUILDING_DLL + #ifdef __GNUC__ + #define CTOOL_DLL_PUBLIC __attribute__ ((dllexport)) + #else + #define CTOOL_DLL_PUBLIC __declspec(dllexport) // Note: actually gcc seems to also supports this syntax. + #endif + #else + #ifdef __GNUC__ + #define CTOOL_DLL_PUBLIC __attribute__ ((dllimport)) + #else + #define CTOOL_DLL_PUBLIC __declspec(dllimport) // Note: actually gcc seems to also supports this syntax. + #endif + #endif + #define CTOOL_DLL_LOCAL +#else + #if __GNUC__ >= 4 + #define CTOOL_DLL_PUBLIC __attribute__ ((visibility ("default"))) + #define CTOOL_DLL_LOCAL __attribute__ ((visibility ("hidden"))) + #else + #define CTOOL_DLL_PUBLIC + #define CTOOL_DLL_LOCAL + #endif +#endif + + + +#endif