Changes in / [17b6fc9:1c1395d]
- Files:
-
- 96 added
- 96 deleted
- 3 edited
-
doc/theses/fangren_yu_COOP_S20/Report.tex (modified) (10 diffs)
-
examples/ArrayN.c (added)
-
examples/Initialization.c (added)
-
examples/Initialization2.c (added)
-
examples/Makefile.example (added)
-
examples/Members.c (added)
-
examples/Misc.c (added)
-
examples/MiscError.c (added)
-
examples/Rank2.c (added)
-
examples/Tuple.c (added)
-
examples/abstype.c (added)
-
examples/constructors.c (added)
-
examples/forward.c (added)
-
examples/gc_no_raii/.gitignore (added)
-
examples/gc_no_raii/bug-repro/assert.c (added)
-
examples/gc_no_raii/bug-repro/blockers.tar.gz (added)
-
examples/gc_no_raii/bug-repro/blockers/explicit_cast.c (added)
-
examples/gc_no_raii/bug-repro/blockers/file_scope.c (added)
-
examples/gc_no_raii/bug-repro/blockers/recursive_realloc.c (added)
-
examples/gc_no_raii/bug-repro/crash.c (added)
-
examples/gc_no_raii/bug-repro/deref.c (added)
-
examples/gc_no_raii/bug-repro/field.c (added)
-
examples/gc_no_raii/bug-repro/find.c (added)
-
examples/gc_no_raii/bug-repro/inline.c (added)
-
examples/gc_no_raii/bug-repro/malloc.c (added)
-
examples/gc_no_raii/bug-repro/not_equal.c (added)
-
examples/gc_no_raii/bug-repro/oddtype.c (added)
-
examples/gc_no_raii/bug-repro/push_back.c (added)
-
examples/gc_no_raii/bug-repro/push_back.h (added)
-
examples/gc_no_raii/bug-repro/realloc.c (added)
-
examples/gc_no_raii/bug-repro/return.c (added)
-
examples/gc_no_raii/bug-repro/return_template.c (added)
-
examples/gc_no_raii/bug-repro/slow_malloc.c (added)
-
examples/gc_no_raii/bug-repro/static_const_local.c (added)
-
examples/gc_no_raii/bug-repro/test-assert.cpp (added)
-
examples/gc_no_raii/bug-repro/void_pointer.c (added)
-
examples/gc_no_raii/bug-repro/while.c (added)
-
examples/gc_no_raii/bug-repro/zero.c (added)
-
examples/gc_no_raii/pool-alloc/allocate-malign.c (added)
-
examples/gc_no_raii/pool-alloc/allocate-malloc.c (added)
-
examples/gc_no_raii/pool-alloc/allocate-mmap.c (added)
-
examples/gc_no_raii/pool-alloc/allocate-win-valloc.c (added)
-
examples/gc_no_raii/premake4.lua (added)
-
examples/gc_no_raii/src/allocate-pool.c (added)
-
examples/gc_no_raii/src/allocate-pool.h (added)
-
examples/gc_no_raii/src/gc.h (added)
-
examples/gc_no_raii/src/gcpointers.c (added)
-
examples/gc_no_raii/src/gcpointers.h (added)
-
examples/gc_no_raii/src/internal/card_table.h (added)
-
examples/gc_no_raii/src/internal/collector.c (added)
-
examples/gc_no_raii/src/internal/collector.h (added)
-
examples/gc_no_raii/src/internal/gc_tools.h (added)
-
examples/gc_no_raii/src/internal/globals.h (added)
-
examples/gc_no_raii/src/internal/memory_pool.c (added)
-
examples/gc_no_raii/src/internal/memory_pool.h (added)
-
examples/gc_no_raii/src/internal/object_header.c (added)
-
examples/gc_no_raii/src/internal/object_header.h (added)
-
examples/gc_no_raii/src/internal/state.c (added)
-
examples/gc_no_raii/src/internal/state.h (added)
-
examples/gc_no_raii/src/test_include.c (added)
-
examples/gc_no_raii/src/tools.h (added)
-
examples/gc_no_raii/src/tools/checks.h (added)
-
examples/gc_no_raii/src/tools/print.c (added)
-
examples/gc_no_raii/src/tools/print.h (added)
-
examples/gc_no_raii/src/tools/worklist.h (added)
-
examples/gc_no_raii/test/badlll.c (added)
-
examples/gc_no_raii/test/gctest.c (added)
-
examples/gc_no_raii/test/operators.c (added)
-
examples/hashtable.cfa (added)
-
examples/hashtable2.cfa (added)
-
examples/huge.c (added)
-
examples/includes.c (added)
-
examples/index.h (added)
-
examples/io/cat.c (added)
-
examples/io/filereader.c (added)
-
examples/io/simple/client.c (added)
-
examples/io/simple/server.c (added)
-
examples/io/simple/server.cfa (added)
-
examples/io/simple/server_epoll.c (added)
-
examples/io_uring.txt (added)
-
examples/it_out.c (added)
-
examples/multicore.c (added)
-
examples/new.c (added)
-
examples/poly-bench.c (added)
-
examples/prolog.c (added)
-
examples/quad.c (added)
-
examples/s.c (added)
-
examples/simplePoly.c (added)
-
examples/simpler.c (added)
-
examples/specialize.c (added)
-
examples/square.c (added)
-
examples/twice.c (added)
-
examples/wrapper/.gitignore (added)
-
examples/wrapper/premake4.lua (added)
-
examples/wrapper/src/main.c (added)
-
examples/wrapper/src/pointer.h (added)
-
examples/zero_one.c (added)
-
libcfa/src/limits.cfa (modified) (2 diffs)
-
libcfa/src/limits.hfa (modified) (2 diffs)
-
tests/zombies/ArrayN.c (deleted)
-
tests/zombies/Initialization.c (deleted)
-
tests/zombies/Initialization2.c (deleted)
-
tests/zombies/Makefile.example (deleted)
-
tests/zombies/Members.c (deleted)
-
tests/zombies/Misc.c (deleted)
-
tests/zombies/MiscError.c (deleted)
-
tests/zombies/Rank2.c (deleted)
-
tests/zombies/Tuple.c (deleted)
-
tests/zombies/abstype.c (deleted)
-
tests/zombies/constructors.c (deleted)
-
tests/zombies/forward.c (deleted)
-
tests/zombies/gc_no_raii/.gitignore (deleted)
-
tests/zombies/gc_no_raii/bug-repro/assert.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/blockers.tar.gz (deleted)
-
tests/zombies/gc_no_raii/bug-repro/blockers/explicit_cast.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/blockers/file_scope.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/blockers/recursive_realloc.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/crash.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/deref.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/field.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/find.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/inline.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/malloc.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/not_equal.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/oddtype.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/push_back.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/push_back.h (deleted)
-
tests/zombies/gc_no_raii/bug-repro/realloc.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/return.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/return_template.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/slow_malloc.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/static_const_local.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/test-assert.cpp (deleted)
-
tests/zombies/gc_no_raii/bug-repro/void_pointer.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/while.c (deleted)
-
tests/zombies/gc_no_raii/bug-repro/zero.c (deleted)
-
tests/zombies/gc_no_raii/pool-alloc/allocate-malign.c (deleted)
-
tests/zombies/gc_no_raii/pool-alloc/allocate-malloc.c (deleted)
-
tests/zombies/gc_no_raii/pool-alloc/allocate-mmap.c (deleted)
-
tests/zombies/gc_no_raii/pool-alloc/allocate-win-valloc.c (deleted)
-
tests/zombies/gc_no_raii/premake4.lua (deleted)
-
tests/zombies/gc_no_raii/src/allocate-pool.c (deleted)
-
tests/zombies/gc_no_raii/src/allocate-pool.h (deleted)
-
tests/zombies/gc_no_raii/src/gc.h (deleted)
-
tests/zombies/gc_no_raii/src/gcpointers.c (deleted)
-
tests/zombies/gc_no_raii/src/gcpointers.h (deleted)
-
tests/zombies/gc_no_raii/src/internal/card_table.h (deleted)
-
tests/zombies/gc_no_raii/src/internal/collector.c (deleted)
-
tests/zombies/gc_no_raii/src/internal/collector.h (deleted)
-
tests/zombies/gc_no_raii/src/internal/gc_tools.h (deleted)
-
tests/zombies/gc_no_raii/src/internal/globals.h (deleted)
-
tests/zombies/gc_no_raii/src/internal/memory_pool.c (deleted)
-
tests/zombies/gc_no_raii/src/internal/memory_pool.h (deleted)
-
tests/zombies/gc_no_raii/src/internal/object_header.c (deleted)
-
tests/zombies/gc_no_raii/src/internal/object_header.h (deleted)
-
tests/zombies/gc_no_raii/src/internal/state.c (deleted)
-
tests/zombies/gc_no_raii/src/internal/state.h (deleted)
-
tests/zombies/gc_no_raii/src/test_include.c (deleted)
-
tests/zombies/gc_no_raii/src/tools.h (deleted)
-
tests/zombies/gc_no_raii/src/tools/checks.h (deleted)
-
tests/zombies/gc_no_raii/src/tools/print.c (deleted)
-
tests/zombies/gc_no_raii/src/tools/print.h (deleted)
-
tests/zombies/gc_no_raii/src/tools/worklist.h (deleted)
-
tests/zombies/gc_no_raii/test/badlll.c (deleted)
-
tests/zombies/gc_no_raii/test/gctest.c (deleted)
-
tests/zombies/gc_no_raii/test/operators.c (deleted)
-
tests/zombies/hashtable.cfa (deleted)
-
tests/zombies/hashtable2.cfa (deleted)
-
tests/zombies/huge.c (deleted)
-
tests/zombies/includes.c (deleted)
-
tests/zombies/index.h (deleted)
-
tests/zombies/io/cat.c (deleted)
-
tests/zombies/io/filereader.c (deleted)
-
tests/zombies/io/simple/client.c (deleted)
-
tests/zombies/io/simple/server.c (deleted)
-
tests/zombies/io/simple/server.cfa (deleted)
-
tests/zombies/io/simple/server_epoll.c (deleted)
-
tests/zombies/io_uring.txt (deleted)
-
tests/zombies/it_out.c (deleted)
-
tests/zombies/multicore.c (deleted)
-
tests/zombies/new.c (deleted)
-
tests/zombies/poly-bench.c (deleted)
-
tests/zombies/prolog.c (deleted)
-
tests/zombies/quad.c (deleted)
-
tests/zombies/s.c (deleted)
-
tests/zombies/simplePoly.c (deleted)
-
tests/zombies/simpler.c (deleted)
-
tests/zombies/specialize.c (deleted)
-
tests/zombies/square.c (deleted)
-
tests/zombies/twice.c (deleted)
-
tests/zombies/wrapper/.gitignore (deleted)
-
tests/zombies/wrapper/premake4.lua (deleted)
-
tests/zombies/wrapper/src/main.c (deleted)
-
tests/zombies/wrapper/src/pointer.h (deleted)
-
tests/zombies/zero_one.c (deleted)
Legend:
- Unmodified
- Added
- Removed
-
doc/theses/fangren_yu_COOP_S20/Report.tex
r17b6fc9 r1c1395d 13 13 \usepackage{latexsym} % \Box glyph 14 14 \usepackage{mathptmx} % better math font with "times" 15 \usepackage{appendix}16 15 \usepackage[usenames]{color} 17 16 \input{common} % common CFA document macros 18 17 \usepackage[dvips,plainpages=false,pdfpagelabels,pdfpagemode=UseNone,colorlinks=true,pagebackref=true,linkcolor=blue,citecolor=blue,urlcolor=blue,pagebackref=true,breaklinks=true]{hyperref} 19 18 \usepackage{breakurl} 20 \urlstyle{sf}21 22 % reduce spacing23 \setlist[itemize]{topsep=5pt,parsep=0pt}% global24 \setlist[enumerate]{topsep=5pt,parsep=0pt}% global25 19 26 20 \usepackage[pagewise]{lineno} … … 118 112 \begin{itemize} 119 113 \item 120 type declaration: @struct@, @union@, @typedef@ or type parameter (see \VRef[Appendix]{s:KindsTypeParameters})114 type declaration: @struct@, @union@, @typedef@ or type parameter (see Appendix A.1) 121 115 \item 122 116 variable declaration … … 380 374 381 375 \subsubsection{Source: \lstinline{AST/SymbolTable.hpp}} 382 383 384 376 \subsubsection{Source: \lstinline{SymTab/Indexer.h}} 385 377 … … 534 526 Each pair of compatible branch expression types produce a possible interpretation, and the cost is defined as the sum of the expression costs plus the sum of conversion costs to the common type. 535 527 536 537 528 \subsection{Conversion and Application Cost} 538 539 There were some unclear parts in the previous documentation in the cost system, as described in the Moss thesis~\cite{Moss19}, section 4.1.2. 540 Some clarification are presented in this section. 529 There were some unclear parts in the previous documentation of cost system, as described in the Moss thesis \cite{Moss19}, section 4.1.2. Some clarification are presented in this section. 541 530 542 531 \begin{enumerate} 543 532 \item 544 Conversion to a type denoted by parameter may incur additional cost if the match is not exact. 545 For example, if a function is declared to accept @(T, T)@ and receives @(int, long)@, @T@ is deducted @long@ and an additional widening conversion cost is added for @int@ to @T@. 546 547 \item 548 The specialization level of a function is the sum of the least depth of an appearance of a type parameter (counting pointers, references and parameterized types), plus the number of assertions. 549 A higher specialization level is favoured if argument conversion costs are equal. 550 551 \item 552 Coercion of pointer types is only allowed in explicit cast expressions; 553 the only allowed implicit pointer casts are adding qualifiers to the base type and cast to @void*@, and these counts as safe conversions. 554 Note that implicit cast from @void *@ to other pointer types is no longer valid, as opposed to standard C. 533 Conversion to a type denoted by parameter may incur additional cost if the match is not exact. For example, if a function is declared to accept @(T, T)@ and receives @(int, long)@, @T@ is deducted @long@ and an additional widening conversion cost is added for @int@ to @T@. 534 535 \item 536 The specialization level of a function is the sum of the least depth of an appearance of type parameter (counting pointers, references and parameterized types), plus the number of assertions. A higher specialization level is favored if conversion cost of arguments are equal. 537 538 \item 539 Coercion of pointer types is only allowed in explicit cast expressions; the only allowed implicit pointer casts are adding qualifiers to the base type and cast to @void*@, and those counts as safe conversions. Note that implicit cast from @void*@ to other pointer types is no longer valid, as opposed to standard C. 540 555 541 \end{enumerate} 556 542 … … 570 556 At the call site, implicit parameters are automatically inserted by the compiler. 571 557 572 Implementation of implicit parameters is discussed in \VRef[Appendix]{s:ImplementationParametricFunctions}.558 Implementation of implicit parameters is discussed in Appendix A.3. 573 559 574 560 \section{Tests} … … 611 597 It is suggested to run performance tests with optimization (@g++@ flag @-O3@). 612 598 613 614 \begin{appendices}[toc,titletoc]615 599 \section{Appendix} 616 600 617 618 601 \subsection{Kinds of Type Parameters} 619 \label{s:KindsTypeParameters} 620 621 A type parameter in a @forall@ clause has three possible kinds: 622 \begin{enumerate}[listparindent=0pt] 623 \item 624 @dtype@: any data type (built-in or user defined). 625 626 There is also a difference between opaque types (incomplete types, \ie those with only a forward declaration) and concrete types. 627 Only concrete types can be directly used as a variable type. 628 629 \CFA provides the @otype@ shorthand to require a type parameter be concrete, which also implicitly asserts the existence of its default and copy constructors, assignment, and destructor\footnote{\CFA implements the same automatic resource management (RAII) semantics as \CC.}. 630 \item 631 @ftype@: any function type. 632 633 @ftype@ provides two purposes: 634 \begin{itemize} 635 \item 636 Differentiate function pointer from data pointer because (in theory) some systems have different sizes for these pointers. 637 \item 638 Disallow a function pointer to match an overloaded data pointer, since variables and functions can have the same names. 639 \end{itemize} 640 641 \item 642 @ttype@: tuple (variadic) type. 643 644 @ttype@ parameter may only appear as type of the last parameter in a function, and it provides a type-safe way to implement variadic functions. 645 Note however, that it has certain restrictions, as described in the implementation section below. 602 The type parameters in a @forall@ clause has three different kinds: 603 \begin{enumerate} 604 \item 605 @dtype@: any data type (built-in or user defined). There is also a difference between opaque types (incomplete types, those with only a forward declaration) and concrete types. Only concrete types can be directly used as a variable type. \CFA provides the @otype@ shorthand to require a type parameter as concrete, which also implicitly asserts the existence of its constructor and destructor\footnote{\CFA implements the same automatic resource management (RAII) semantics as \CC.}. 606 \item 607 @ftype@: any function type. Since @ftype@ does not provide any information about parameter types of a function, it is rarely used. The main purpose of introducing @ftype@ is to disallow a function to match a pointer overload, since variables and functions can have the same names. 608 \item 609 @ttype@: tuple (variadic) type. @ttype@ parameter may only appear as type of the last parameter in a function, and it provides a type-safe way to implement variadic functions. Note however, that it has certain restrictions, as described in the implementation section below. 610 646 611 \end{enumerate} 647 612 648 649 613 \subsection{GNU C Nested Functions} 650 614 … … 652 616 653 617 In ISO C, function definitions are not allowed to be nested. GCC allows nested functions with full lexical scoping. The following example is taken from GCC documentation\footnote{\url{https://gcc.gnu.org/onlinedocs/gcc/Nested-Functions.html}}: 654 \begin{C++} 655 void bar( int * array, int offset, int size ) { 656 int access( int * array, int index ) { return array[index + offset]; } 657 int i; 658 /* ... */ 659 for ( i = 0; i < size; i++ ) 660 /* ... */ access (array, i) /* ... */ 618 619 \begin{C++} 620 bar (int *array, int offset, int size) 621 { 622 int access (int *array, int index) 623 { return array[index + offset]; } 624 int i; 625 /* ... */ 626 for (i = 0; i < size; i++) 627 /* ... */ access (array, i) /* ... */ 661 628 } 662 629 \end{C++} 663 GCC nested functions behave identically to \CC lambda functions with default by-reference capture (stack-allocated, lifetime ends upon exiting the declared block), while also possible to be passed as arguments with standard function pointer types. 664 630 631 GCC nested functions behave identically to \CC lambda functions with default by-reference capture (stack-allocated, lifetime ends upon exiting the block declared in), while also possible to be passed as arguments with standard function pointer types. 665 632 666 633 \subsection{Implementation of Parametric Functions} 667 \label{s:ImplementationParametricFunctions} 668 669 \CFA implements parametric functions using the implicit parameter approach: required assertions are passed to the callee by function pointers; 670 size of a parametric type must also be known if referenced directly (\ie not as a pointer). 634 \CFA implements parametric functions using the implicit parameter approach: required assertions are passed to the callee by function pointers; size of a parametric type must also be known if referenced directly (i.e. not as a pointer). 671 635 672 636 The implementation is similar to the one from Scala\footnote{\url{https://www.scala-lang.org/files/archive/spec/2.13/07-implicits.html}}, with some notable differences in resolution: … … 677 641 The parameter (assertion) name must match the actual declarations. 678 642 \item 679 Currently, assertions are all functions. 680 Note that since \CFA has variable overloading, implicit value parameters might also be supported in the future. 643 Currently, assertions are all functions. Note that since \CFA has variable overloading, implicit value parameters might also be supported in the future. 681 644 \end{enumerate} 682 645 683 646 For example, the \CFA function declaration 647 684 648 \begin{cfa} 685 forall( otype T | { int foo( T, int ); })649 forall(otype T | {int foo(T, int);}) 686 650 int bar(T); 687 651 \end{cfa} 652 688 653 after implicit parameter expansion, has the actual signature\footnote{\textbf{otype} also requires the type to have constructor and destructor, which are the first two function pointers preceding the one for \textbf{foo}.} 689 \begin{C++} 690 int bar( T, size_t, void (*)(T&), void (*)(T&), int (*)(T, int) ); 691 \end{C++} 692 The implicit parameter approach has an apparent issue: when the satisfying declaration is also parametric, it may require its own implicit parameters too. 693 That also causes the supplied implicit parameter to have a different \textbf{actual} type than the \textbf{nominal} type, so it cannot be passed directly. 694 The refore, a wrapper with matching actual type must be created, and it is here where GCC nested functions areused internally by the compiler.654 655 \begin{C++} 656 int bar(T, size_t, void (*)(T&), void (*)(T&), int (*)(T, int)); 657 \end{C++} 658 659 The implicit parameter approach has an apparent issue: when the satisfying declaration is also parametric, it may require its own implicit parameters too. That also causes the supplied implicit parameter to have a different \textbf{actual} type than the \textbf{nominal} type, so it cannot be passed directly. Therefore, a wrapper with matching actual type must be created, and here it is where GCC nested function is used internally by the compiler. 695 660 696 661 Consider the following program: … … 698 663 int assertion(int); 699 664 700 forall ( otype T | { int assertion(T); })665 forall (otype T | {int assertion(T);}) 701 666 void foo(T); 702 667 703 forall (otype T | { void foo(T); })668 forall (otype T | {void foo(T);}) 704 669 void bar(T t) { 705 670 foo(t); 706 671 } 707 672 \end{cfa} 708 The \CFA compiler translates the program to non-parametric form\footnote{In the final code output, \lstinline@T@ needs to be replaced by an opaque type, and arguments must be accessed by a frame pointer offset table, due to the unknown sizes. The presented code here is simplified for better understanding.} 673 674 \CFA compiler translates the program to non-parametric form\footnote{In the final code output, T needs to be replaced by an opaque type, and arguments must be accessed by a frame pointer offset table, due to the unknown sizes. The presented code here is simplified for better understanding.} 675 709 676 \begin{C++} 710 677 // ctor, dtor and size arguments are omitted … … 715 682 } 716 683 \end{C++} 684 717 685 However, when @bar(1)@ is called, @foo@ cannot be directly provided as an argument: 686 718 687 \begin{C++} 719 688 bar(1, foo); // WRONG: foo has different actual type 720 689 \end{C++} 690 721 691 and an additional step is required: 692 722 693 \begin{C++} 723 694 { 724 695 void _foo_wrapper(int t) { 725 foo( t, assertion);696 foo(t, assertion); 726 697 } 727 bar( 1, _foo_wrapper);698 bar(1, _foo_wrapper); 728 699 } 729 700 \end{C++} 730 Nested assertions and implicit parameter creation may continue indefinitely. 731 This issue is a limitation of implicit parameter implementation. 732 In particular, polymorphic variadic recursion must be structural (\ie the number of arguments decreases in any possible recursive calls), otherwise code generation gets into an infinite loop. 733 The \CFA compiler sets a limit on assertion depth and reports an error if assertion resolution does not terminate within the limit (as for \lstinline[language=C++]@templates@ in \CC). 734 \end{appendices} 701 702 Nested assertions and implicit parameter creation may continue indefinitely. This is a limitation of implicit parameter implementation. In particular, polymorphic variadic recursion must be structural (i.e. number of arguments decreases in any possible recursive calls), otherwise code generation gets into an infinite loop. \CFA compiler sets a limit on assertion depth and reports an error if assertion resolution does not terminate within the limit. 735 703 736 704 \bibliographystyle{plain} -
libcfa/src/limits.cfa
r17b6fc9 r1c1395d 10 10 // Created On : Wed Apr 6 18:06:52 2016 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Wed Sep 30 22:56:32 202013 // Update Count : 7 612 // Last Modified On : Thu Mar 1 16:22:51 2018 13 // Update Count : 74 14 14 // 15 15 … … 23 23 // Integral Constants 24 24 25 signed char MIN = SCHAR_MIN;26 unsigned char MIN = 0;27 short int MIN = SHRT_MIN;28 unsigned short int MIN = 0;29 int MIN = INT_MIN;30 unsigned int MIN = 0;31 long int MIN = LONG_MIN;32 unsigned long int MIN = 0;33 long long int MIN = LLONG_MIN;34 unsigned long long int MIN = 0;25 const signed char MIN = SCHAR_MIN; 26 const unsigned char MIN = 0; 27 const short int MIN = SHRT_MIN; 28 const unsigned short int MIN = 0; 29 const int MIN = INT_MIN; 30 const unsigned int MIN = 0; 31 const long int MIN = LONG_MIN; 32 const unsigned long int MIN = 0; 33 const long long int MIN = LLONG_MIN; 34 const unsigned long long int MIN = 0; 35 35 36 signed char MAX = SCHAR_MAX;37 unsigned char MAX = UCHAR_MAX;38 short int MAX = SHRT_MAX;39 unsigned short int MAX = USHRT_MAX;40 int MAX = INT_MAX;41 unsigned int MAX = UINT_MAX;42 long int MAX = LONG_MAX;43 unsigned long int MAX = ULONG_MAX;44 long long int MAX = LLONG_MAX;45 unsigned long long int MAX = ULLONG_MAX;36 const signed char MAX = SCHAR_MAX; 37 const unsigned char MAX = UCHAR_MAX; 38 const short int MAX = SHRT_MAX; 39 const unsigned short int MAX = USHRT_MAX; 40 const int MAX = INT_MAX; 41 const unsigned int MAX = UINT_MAX; 42 const long int MAX = LONG_MAX; 43 const unsigned long int MAX = ULONG_MAX; 44 const long long int MAX = LLONG_MAX; 45 const unsigned long long int MAX = ULLONG_MAX; 46 46 47 47 // Floating-Point Constants 48 48 49 float MIN = FLT_MIN;50 double MIN = DBL_MIN;51 long double MIN = LDBL_MIN;52 float _Complex MIN = __FLT_MIN__ + __FLT_MIN__ * I;53 double _Complex MIN = DBL_MIN + DBL_MIN * I;54 long double _Complex MIN = LDBL_MIN + LDBL_MIN * I;49 const float MIN = FLT_MIN; 50 const double MIN = DBL_MIN; 51 const long double MIN = LDBL_MIN; 52 const float _Complex MIN = __FLT_MIN__ + __FLT_MIN__ * I; 53 const double _Complex MIN = DBL_MIN + DBL_MIN * I; 54 const long double _Complex MIN = LDBL_MIN + LDBL_MIN * I; 55 55 56 float MAX = FLT_MAX;57 double MAX = DBL_MAX;58 long double MAX = LDBL_MAX;59 float _Complex MAX = FLT_MAX + FLT_MAX * I;60 double _Complex MAX = DBL_MAX + DBL_MAX * I;61 long double _Complex MAX = LDBL_MAX + LDBL_MAX * I;56 const float MAX = FLT_MAX; 57 const double MAX = DBL_MAX; 58 const long double MAX = LDBL_MAX; 59 const float _Complex MAX = FLT_MAX + FLT_MAX * I; 60 const double _Complex MAX = DBL_MAX + DBL_MAX * I; 61 const long double _Complex MAX = LDBL_MAX + LDBL_MAX * I; 62 62 63 float PI = (float)M_PI;// pi64 float PI_2 = (float)M_PI_2;// pi / 265 float PI_4 = (float)M_PI_4;// pi / 466 float _1_PI = (float)M_1_PI;// 1 / pi67 float _2_PI = (float)M_2_PI;// 2 / pi68 float _2_SQRT_PI = (float)M_2_SQRTPI;// 2 / sqrt(pi)63 const float PI = (float)M_PI; // pi 64 const float PI_2 = (float)M_PI_2; // pi / 2 65 const float PI_4 = (float)M_PI_4; // pi / 4 66 const float _1_PI = (float)M_1_PI; // 1 / pi 67 const float _2_PI = (float)M_2_PI; // 2 / pi 68 const float _2_SQRT_PI = (float)M_2_SQRTPI; // 2 / sqrt(pi) 69 69 70 double PI = M_PI;// pi71 double PI_2 = M_PI_2;// pi / 272 double PI_4 = M_PI_4;// pi / 473 double _1_PI = M_1_PI;// 1 / pi74 double _2_PI = M_2_PI;// 2 / pi75 double _2_SQRT_PI = M_2_SQRTPI;// 2 / sqrt(pi)70 const double PI = M_PI; // pi 71 const double PI_2 = M_PI_2; // pi / 2 72 const double PI_4 = M_PI_4; // pi / 4 73 const double _1_PI = M_1_PI; // 1 / pi 74 const double _2_PI = M_2_PI; // 2 / pi 75 const double _2_SQRT_PI = M_2_SQRTPI; // 2 / sqrt(pi) 76 76 77 long double PI = M_PIl;// pi78 long double PI_2 = M_PI_2l;// pi / 279 long double PI_4 = M_PI_4l;// pi / 480 long double _1_PI = M_1_PIl;// 1 / pi81 long double _2_PI = M_2_PIl;// 2 / pi82 long double _2_SQRT_PI = M_2_SQRTPIl;// 2 / sqrt(pi)77 const long double PI = M_PIl; // pi 78 const long double PI_2 = M_PI_2l; // pi / 2 79 const long double PI_4 = M_PI_4l; // pi / 4 80 const long double _1_PI = M_1_PIl; // 1 / pi 81 const long double _2_PI = M_2_PIl; // 2 / pi 82 const long double _2_SQRT_PI = M_2_SQRTPIl; // 2 / sqrt(pi) 83 83 84 float _Complex PI = (float)M_PI + 0.0_iF;// pi85 float _Complex PI_2 = (float)M_PI_2 + 0.0_iF;// pi / 286 float _Complex PI_4 = (float)M_PI_4 + 0.0_iF;// pi / 487 float _Complex _1_PI = (float)M_1_PI + 0.0_iF;// 1 / pi88 float _Complex _2_PI = (float)M_2_PI + 0.0_iF;// 2 / pi89 float _Complex _2_SQRT_PI = (float)M_2_SQRTPI + 0.0_iF; // 2 / sqrt(pi)84 const float _Complex PI = (float)M_PI + 0.0_iF; // pi 85 const float _Complex PI_2 = (float)M_PI_2 + 0.0_iF; // pi / 2 86 const float _Complex PI_4 = (float)M_PI_4 + 0.0_iF; // pi / 4 87 const float _Complex _1_PI = (float)M_1_PI + 0.0_iF; // 1 / pi 88 const float _Complex _2_PI = (float)M_2_PI + 0.0_iF; // 2 / pi 89 const float _Complex _2_SQRT_PI = (float)M_2_SQRTPI + 0.0_iF; // 2 / sqrt(pi) 90 90 91 double _Complex PI = M_PI + 0.0_iD;// pi92 double _Complex PI_2 = M_PI_2 + 0.0_iD;// pi / 293 double _Complex PI_4 = M_PI_4 + 0.0_iD;// pi / 494 double _Complex _1_PI = M_1_PI + 0.0_iD;// 1 / pi95 double _Complex _2_PI = M_2_PI + 0.0_iD;// 2 / pi96 double _Complex _2_SQRT_PI = M_2_SQRTPI + 0.0_iD;// 2 / sqrt(pi)91 const double _Complex PI = M_PI + 0.0_iD; // pi 92 const double _Complex PI_2 = M_PI_2 + 0.0_iD; // pi / 2 93 const double _Complex PI_4 = M_PI_4 + 0.0_iD; // pi / 4 94 const double _Complex _1_PI = M_1_PI + 0.0_iD; // 1 / pi 95 const double _Complex _2_PI = M_2_PI + 0.0_iD; // 2 / pi 96 const double _Complex _2_SQRT_PI = M_2_SQRTPI + 0.0_iD; // 2 / sqrt(pi) 97 97 98 long double _Complex PI = M_PIl + 0.0_iL;// pi99 long double _Complex PI_2 = M_PI_2l + 0.0_iL;// pi / 2100 long double _Complex PI_4 = M_PI_4l + 0.0_iL;// pi / 4101 long double _Complex _1_PI = M_1_PIl + 0.0_iL;// 1 / pi102 long double _Complex _2_PI = M_2_PIl + 0.0_iL;// 2 / pi103 long double _Complex _2_SQRT_PI = M_2_SQRTPIl + 0.0_iL; // 2 / sqrt(pi)98 const long double _Complex PI = M_PIl + 0.0_iL; // pi 99 const long double _Complex PI_2 = M_PI_2l + 0.0_iL; // pi / 2 100 const long double _Complex PI_4 = M_PI_4l + 0.0_iL; // pi / 4 101 const long double _Complex _1_PI = M_1_PIl + 0.0_iL; // 1 / pi 102 const long double _Complex _2_PI = M_2_PIl + 0.0_iL; // 2 / pi 103 const long double _Complex _2_SQRT_PI = M_2_SQRTPIl + 0.0_iL; // 2 / sqrt(pi) 104 104 105 float E = (float)M_E;// e106 float LOG2_E = (float)M_LOG2E;// log_2(e)107 float LOG10_E = (float)M_LOG10E;// log_10(e)108 float LN_2 = (float)M_LN2;// log_e(2)109 float LN_10 = (float)M_LN10;// log_e(10)110 float SQRT_2 = (float)M_SQRT2;// sqrt(2)111 float _1_SQRT_2 = (float)M_SQRT1_2;// 1 / sqrt(2)105 const float E = (float)M_E; // e 106 const float LOG2_E = (float)M_LOG2E; // log_2(e) 107 const float LOG10_E = (float)M_LOG10E; // log_10(e) 108 const float LN_2 = (float)M_LN2; // log_e(2) 109 const float LN_10 = (float)M_LN10; // log_e(10) 110 const float SQRT_2 = (float)M_SQRT2; // sqrt(2) 111 const float _1_SQRT_2 = (float)M_SQRT1_2; // 1 / sqrt(2) 112 112 113 double E = M_E;// e114 double LOG2_E = M_LOG2E;// log_2(e)115 double LOG10_E = M_LOG10E;// log_10(e)116 double LN_2 = M_LN2;// log_e(2)117 double LN_10 = M_LN10;// log_e(10)118 double SQRT_2 = M_SQRT2;// sqrt(2)119 double _1_SQRT_2 = M_SQRT1_2;// 1 / sqrt(2)113 const double E = M_E; // e 114 const double LOG2_E = M_LOG2E; // log_2(e) 115 const double LOG10_E = M_LOG10E; // log_10(e) 116 const double LN_2 = M_LN2; // log_e(2) 117 const double LN_10 = M_LN10; // log_e(10) 118 const double SQRT_2 = M_SQRT2; // sqrt(2) 119 const double _1_SQRT_2 = M_SQRT1_2; // 1 / sqrt(2) 120 120 121 long double E = M_El;// e122 long double LOG2_E = M_LOG2El;// log_2(e)123 long double LOG10_E = M_LOG10El;// log_10(e)124 long double LN_2 = M_LN2l;// log_e(2)125 long double LN_10 = M_LN10l;// log_e(10)126 long double SQRT_2 = M_SQRT2l;// sqrt(2)127 long double _1_SQRT_2 = M_SQRT1_2l;// 1 / sqrt(2)121 const long double E = M_El; // e 122 const long double LOG2_E = M_LOG2El; // log_2(e) 123 const long double LOG10_E = M_LOG10El; // log_10(e) 124 const long double LN_2 = M_LN2l; // log_e(2) 125 const long double LN_10 = M_LN10l; // log_e(10) 126 const long double SQRT_2 = M_SQRT2l; // sqrt(2) 127 const long double _1_SQRT_2 = M_SQRT1_2l; // 1 / sqrt(2) 128 128 129 float _Complex E = M_E + 0.0_iF;// e130 float _Complex LOG2_E = M_LOG2E + 0.0_iF;// log_2(e)131 float _Complex LOG10_E = M_LOG10E + 0.0_iF;// log_10(e)132 float _Complex LN_2 = M_LN2 + 0.0_iF;// log_e(2)133 float _Complex LN_10 = M_LN10 + 0.0_iF;// log_e(10)134 float _Complex SQRT_2 = M_SQRT2 + 0.0_iF;// sqrt(2)135 float _Complex _1_SQRT_2 = M_SQRT1_2 + 0.0_iF;// 1 / sqrt(2)129 const float _Complex E = M_E + 0.0_iF; // e 130 const float _Complex LOG2_E = M_LOG2E + 0.0_iF; // log_2(e) 131 const float _Complex LOG10_E = M_LOG10E + 0.0_iF; // log_10(e) 132 const float _Complex LN_2 = M_LN2 + 0.0_iF; // log_e(2) 133 const float _Complex LN_10 = M_LN10 + 0.0_iF; // log_e(10) 134 const float _Complex SQRT_2 = M_SQRT2 + 0.0_iF; // sqrt(2) 135 const float _Complex _1_SQRT_2 = M_SQRT1_2 + 0.0_iF; // 1 / sqrt(2) 136 136 137 double _Complex E = M_E + 0.0_iD;// e138 double _Complex LOG2_E = M_LOG2E + 0.0_iD;// log_2(e)139 double _Complex LOG10_E = M_LOG10E + 0.0_iD;// log_10(e)140 double _Complex LN_2 = M_LN2 + 0.0_iD;// log_e(2)141 double _Complex LN_10 = M_LN10 + 0.0_iD;// log_e(10)142 double _Complex SQRT_2 = M_SQRT2 + 0.0_iD;// sqrt(2)143 double _Complex _1_SQRT_2 = M_SQRT1_2 + 0.0_iD;// 1 / sqrt(2)137 const double _Complex E = M_E + 0.0_iD; // e 138 const double _Complex LOG2_E = M_LOG2E + 0.0_iD; // log_2(e) 139 const double _Complex LOG10_E = M_LOG10E + 0.0_iD; // log_10(e) 140 const double _Complex LN_2 = M_LN2 + 0.0_iD; // log_e(2) 141 const double _Complex LN_10 = M_LN10 + 0.0_iD; // log_e(10) 142 const double _Complex SQRT_2 = M_SQRT2 + 0.0_iD; // sqrt(2) 143 const double _Complex _1_SQRT_2 = M_SQRT1_2 + 0.0_iD; // 1 / sqrt(2) 144 144 145 long double _Complex E = M_El + 0.0_iL;// e146 long double _Complex LOG2_E = M_LOG2El + 0.0_iL;// log_2(e)147 long double _Complex LOG10_E = M_LOG10El + 0.0_iL;// log_10(e)148 long double _Complex LN_2 = M_LN2l + 0.0_iL;// log_e(2)149 long double _Complex LN_10 = M_LN10l + 0.0_iL;// log_e(10)150 long double _Complex SQRT_2 = M_SQRT2l + 0.0_iL;// sqrt(2)151 long double _Complex _1_SQRT_2 = M_SQRT1_2l + 0.0_iL;// 1 / sqrt(2)145 const long double _Complex E = M_El + 0.0_iL; // e 146 const long double _Complex LOG2_E = M_LOG2El + 0.0_iL; // log_2(e) 147 const long double _Complex LOG10_E = M_LOG10El + 0.0_iL; // log_10(e) 148 const long double _Complex LN_2 = M_LN2l + 0.0_iL; // log_e(2) 149 const long double _Complex LN_10 = M_LN10l + 0.0_iL; // log_e(10) 150 const long double _Complex SQRT_2 = M_SQRT2l + 0.0_iL; // sqrt(2) 151 const long double _Complex _1_SQRT_2 = M_SQRT1_2l + 0.0_iL; // 1 / sqrt(2) 152 152 153 153 // Local Variables: // -
libcfa/src/limits.hfa
r17b6fc9 r1c1395d 10 10 // Created On : Wed Apr 6 18:06:52 2016 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Wed Sep 30 22:56:35 202013 // Update Count : 1 512 // Last Modified On : Thu Mar 1 16:20:54 2018 13 // Update Count : 13 14 14 // 15 15 … … 18 18 // Integral Constants 19 19 20 extern signed char MIN;21 extern unsigned char MIN;22 extern short int MIN;23 extern unsigned short int MIN;24 extern int MIN;25 extern unsigned int MIN;26 extern long int MIN;27 extern unsigned long int MIN;28 extern long long int MIN;29 extern unsigned long long int MIN;20 extern const signed char MIN; 21 extern const unsigned char MIN; 22 extern const short int MIN; 23 extern const unsigned short int MIN; 24 extern const int MIN; 25 extern const unsigned int MIN; 26 extern const long int MIN; 27 extern const unsigned long int MIN; 28 extern const long long int MIN; 29 extern const unsigned long long int MIN; 30 30 31 extern signed char MAX;32 extern unsigned char MAX;33 extern short int MAX;34 extern unsigned short int MAX;35 extern int MAX;36 extern unsigned int MAX;37 extern long int MAX;38 extern unsigned long int MAX;39 extern long long int MAX;40 extern unsigned long long int MAX;31 extern const signed char MAX; 32 extern const unsigned char MAX; 33 extern const short int MAX; 34 extern const unsigned short int MAX; 35 extern const int MAX; 36 extern const unsigned int MAX; 37 extern const long int MAX; 38 extern const unsigned long int MAX; 39 extern const long long int MAX; 40 extern const unsigned long long int MAX; 41 41 42 42 // Floating-Point Constants 43 43 44 extern float MIN;45 extern double MIN;46 extern long double MIN;47 extern float _Complex MIN;48 extern double _Complex MIN;49 extern long double _Complex MIN;44 extern const float MIN; 45 extern const double MIN; 46 extern const long double MIN; 47 extern const float _Complex MIN; 48 extern const double _Complex MIN; 49 extern const long double _Complex MIN; 50 50 51 extern float MAX;52 extern double MAX;53 extern long double MAX;54 extern float _Complex MAX;55 extern double _Complex MAX;56 extern long double _Complex MAX;51 extern const float MAX; 52 extern const double MAX; 53 extern const long double MAX; 54 extern const float _Complex MAX; 55 extern const double _Complex MAX; 56 extern const long double _Complex MAX; 57 57 58 extern float PI;// pi59 extern float PI_2;// pi / 260 extern float PI_4;// pi / 461 extern float _1_PI;// 1 / pi62 extern float _2_PI;// 2 / pi63 extern float _2_SQRT_PI;// 2 / sqrt(pi)58 extern const float PI; // pi 59 extern const float PI_2; // pi / 2 60 extern const float PI_4; // pi / 4 61 extern const float _1_PI; // 1 / pi 62 extern const float _2_PI; // 2 / pi 63 extern const float _2_SQRT_PI; // 2 / sqrt(pi) 64 64 65 extern double PI;// pi66 extern double PI_2;// pi / 267 extern double PI_4;// pi / 468 extern double _1_PI;// 1 / pi69 extern double _2_PI;// 2 / pi70 extern double _2_SQRT_PI;// 2 / sqrt(pi)65 extern const double PI; // pi 66 extern const double PI_2; // pi / 2 67 extern const double PI_4; // pi / 4 68 extern const double _1_PI; // 1 / pi 69 extern const double _2_PI; // 2 / pi 70 extern const double _2_SQRT_PI; // 2 / sqrt(pi) 71 71 72 extern long double PI;// pi73 extern long double PI_2;// pi / 274 extern long double PI_4;// pi / 475 extern long double _1_PI;// 1 / pi76 extern long double _2_PI;// 2 / pi77 extern long double _2_SQRT_PI;// 2 / sqrt(pi)72 extern const long double PI; // pi 73 extern const long double PI_2; // pi / 2 74 extern const long double PI_4; // pi / 4 75 extern const long double _1_PI; // 1 / pi 76 extern const long double _2_PI; // 2 / pi 77 extern const long double _2_SQRT_PI; // 2 / sqrt(pi) 78 78 79 extern float _Complex PI;// pi80 extern float _Complex PI_2;// pi / 281 extern float _Complex PI_4;// pi / 482 extern float _Complex _1_PI;// 1 / pi83 extern float _Complex _2_PI;// 2 / pi84 extern float _Complex _2_SQRT_PI;// 2 / sqrt(pi)79 extern const float _Complex PI; // pi 80 extern const float _Complex PI_2; // pi / 2 81 extern const float _Complex PI_4; // pi / 4 82 extern const float _Complex _1_PI; // 1 / pi 83 extern const float _Complex _2_PI; // 2 / pi 84 extern const float _Complex _2_SQRT_PI; // 2 / sqrt(pi) 85 85 86 extern double _Complex PI;// pi87 extern double _Complex PI_2;// pi / 288 extern double _Complex PI_4;// pi / 489 extern double _Complex _1_PI;// 1 / pi90 extern double _Complex _2_PI;// 2 / pi91 extern double _Complex _2_SQRT_PI;// 2 / sqrt(pi)86 extern const double _Complex PI; // pi 87 extern const double _Complex PI_2; // pi / 2 88 extern const double _Complex PI_4; // pi / 4 89 extern const double _Complex _1_PI; // 1 / pi 90 extern const double _Complex _2_PI; // 2 / pi 91 extern const double _Complex _2_SQRT_PI; // 2 / sqrt(pi) 92 92 93 extern long double _Complex PI;// pi94 extern long double _Complex PI_2;// pi / 295 extern long double _Complex PI_4;// pi / 496 extern long double _Complex _1_PI;// 1 / pi97 extern long double _Complex _2_PI;// 2 / pi98 extern long double _Complex _2_SQRT_PI;// 2 / sqrt(pi)93 extern const long double _Complex PI; // pi 94 extern const long double _Complex PI_2; // pi / 2 95 extern const long double _Complex PI_4; // pi / 4 96 extern const long double _Complex _1_PI; // 1 / pi 97 extern const long double _Complex _2_PI; // 2 / pi 98 extern const long double _Complex _2_SQRT_PI; // 2 / sqrt(pi) 99 99 100 extern float E;// e101 extern float LOG2_E;// log_2(e)102 extern float LOG10_E;// log_10(e)103 extern float LN_2;// log_e(2)104 extern float LN_10;// log_e(10)105 extern float SQRT_2;// sqrt(2)106 extern float _1_SQRT_2;// 1 / sqrt(2)100 extern const float E; // e 101 extern const float LOG2_E; // log_2(e) 102 extern const float LOG10_E; // log_10(e) 103 extern const float LN_2; // log_e(2) 104 extern const float LN_10; // log_e(10) 105 extern const float SQRT_2; // sqrt(2) 106 extern const float _1_SQRT_2; // 1 / sqrt(2) 107 107 108 extern double E;// e109 extern double LOG2_E;// log_2(e)110 extern double LOG10_E;// log_10(e)111 extern double LN_2;// log_e(2)112 extern double LN_10;// log_e(10)113 extern double SQRT_2;// sqrt(2)114 extern double _1_SQRT_2;// 1 / sqrt(2)108 extern const double E; // e 109 extern const double LOG2_E; // log_2(e) 110 extern const double LOG10_E; // log_10(e) 111 extern const double LN_2; // log_e(2) 112 extern const double LN_10; // log_e(10) 113 extern const double SQRT_2; // sqrt(2) 114 extern const double _1_SQRT_2; // 1 / sqrt(2) 115 115 116 extern long double E;// e117 extern long double LOG2_E;// log_2(e)118 extern long double LOG10_E;// log_10(e)119 extern long double LN_2;// log_e(2)120 extern long double LN_10;// log_e(10)121 extern long double SQRT_2;// sqrt(2)122 extern long double _1_SQRT_2;// 1/sqrt(2)116 extern const long double E; // e 117 extern const long double LOG2_E; // log_2(e) 118 extern const long double LOG10_E; // log_10(e) 119 extern const long double LN_2; // log_e(2) 120 extern const long double LN_10; // log_e(10) 121 extern const long double SQRT_2; // sqrt(2) 122 extern const long double _1_SQRT_2; // 1/sqrt(2) 123 123 124 extern float _Complex E;// e125 extern float _Complex LOG2_E;// log_2(e)126 extern float _Complex LOG10_E;// log_10(e)127 extern float _Complex LN_2;// log_e(2)128 extern float _Complex LN_10;// log_e(10)129 extern float _Complex SQRT_2;// sqrt(2)130 extern float _Complex _1_SQRT_2;// 1 / sqrt(2)124 extern const float _Complex E; // e 125 extern const float _Complex LOG2_E; // log_2(e) 126 extern const float _Complex LOG10_E; // log_10(e) 127 extern const float _Complex LN_2; // log_e(2) 128 extern const float _Complex LN_10; // log_e(10) 129 extern const float _Complex SQRT_2; // sqrt(2) 130 extern const float _Complex _1_SQRT_2; // 1 / sqrt(2) 131 131 132 extern double _Complex E;// e133 extern double _Complex LOG2_E;// log_2(e)134 extern double _Complex LOG10_E;// log_10(e)135 extern double _Complex LN_2;// log_e(2)136 extern double _Complex LN_10;// log_e(10)137 extern double _Complex SQRT_2;// sqrt(2)138 extern double _Complex _1_SQRT_2;// 1 / sqrt(2)132 extern const double _Complex E; // e 133 extern const double _Complex LOG2_E; // log_2(e) 134 extern const double _Complex LOG10_E; // log_10(e) 135 extern const double _Complex LN_2; // log_e(2) 136 extern const double _Complex LN_10; // log_e(10) 137 extern const double _Complex SQRT_2; // sqrt(2) 138 extern const double _Complex _1_SQRT_2; // 1 / sqrt(2) 139 139 140 extern long double _Complex E;// e141 extern long double _Complex LOG2_E;// log_2(e)142 extern long double _Complex LOG10_E;// log_10(e)143 extern long double _Complex LN_2;// log_e(2)144 extern long double _Complex LN_10;// log_e(10)145 extern long double _Complex SQRT_2;// sqrt(2)146 extern long double _Complex _1_SQRT_2;// 1 / sqrt(2)140 extern const long double _Complex E; // e 141 extern const long double _Complex LOG2_E; // log_2(e) 142 extern const long double _Complex LOG10_E; // log_10(e) 143 extern const long double _Complex LN_2; // log_e(2) 144 extern const long double _Complex LN_10; // log_e(10) 145 extern const long double _Complex SQRT_2; // sqrt(2) 146 extern const long double _Complex _1_SQRT_2; // 1 / sqrt(2) 147 147 148 148 // Local Variables: //
Note:
See TracChangeset
for help on using the changeset viewer.