Mercurial > octave
view scripts/specfun/isprime.m @ 29949:f254c302bb9c
remove JIT compiler from Octave sources
As stated in the NEWS file entry added with this changeset, no one
has ever seriously taken on further development of the JIT compiler in
Octave since it was first added as part of a Google Summer of Code
project in 2012 and it still does nothing significant. It is out of
date with the default interpreter that walks the parse tree. Even
though we have fixed the configure script to disable it by default,
people still ask questions about how to build it, but it doesn’t seem
that they are doing that to work on it but because they think it will
make Octave code run faster (it never did, except for some extremely
simple bits of code as examples for demonstration purposes only).
* NEWS: Note change.
* configure.ac, acinclude.m4: Eliminate checks and macros related to
the JIT compiler and LLVM.
* basics.txi, install.txi, octave.texi, vectorize.txi: Remove mention
of JIT compiler and LLVM.
* jit-ir.cc, jit-ir.h, jit-typeinfo.cc, jit-typeinfo.h, jit-util.cc,
jit-util.h, pt-jit.cc, pt-jit.h: Delete.
* libinterp/parse-tree/module.mk: Update.
* Array-jit.cc: Delete.
* libinterp/template-inst/module.mk: Update.
* test/jit.tst: Delete.
* test/module.mk: Update.
* interpreter.cc (interpreter::interpreter): Don't check options for
debug_jit or jit_compiler.
* toplev.cc (F__octave_config_info__): Remove JIT compiler and LLVM
info from struct.
* ov-base.h (octave_base_value::grab, octave_base_value::release):
Delete.
* ov-builtin.h, ov-builtin.cc (octave_builtin::to_jit,
octave_builtin::stash_jit): Delete.
(octave_builtin::m_jtype): Delete data member and all uses.
* ov-usr-fcn.h, ov-usr-fcn.cc (octave_user_function::m_jit_info):
Delete data member and all uses.
(octave_user_function::get_info, octave_user_function::stash_info): Delete.
* options.h (DEBUG_JIT_OPTION, JIT_COMPILER_OPTION): Delete macro
definitions and all uses.
* octave.h, octave.cc (cmdline_options::cmdline_options): Don't handle
DEBUG_JIT_OPTION, JIT_COMPILER_OPTION): Delete.
(cmdline_options::debug_jit, cmdline_options::jit_compiler): Delete
functions and all uses.
(cmdline_options::m_debug_jit, cmdline_options::m_jit_compiler): Delete
data members and all uses.
(octave_getopt_options long_opts): Remove "debug-jit" and
"jit-compiler" from the list.
* pt-eval.cc (tree_evaluator::visit_simple_for_command,
tree_evaluator::visit_complex_for_command,
tree_evaluator::visit_while_command,
tree_evaluator::execute_user_function): Eliminate JIT compiler code.
* pt-loop.h, pt-loop.cc (tree_while_command::get_info,
tree_while_command::stash_info, tree_simple_for_command::get_info,
tree_simple_for_command::stash_info): Delete functions and all uses.
(tree_while_command::m_compiled, tree_simple_for_command::m_compiled):
Delete member variable and all uses.
* usage.h (usage_string, octave_print_verbose_usage_and_exit): Remove
[--debug-jit] and [--jit-compiler] from the message.
* Array.h (Array<T>::Array): Remove constructor that was only intended
to be used by the JIT compiler.
(Array<T>::jit_ref_count, Array<T>::jit_slice_data,
Array<T>::jit_dimensions, Array<T>::jit_array_rep): Delete.
* Marray.h (MArray<T>::MArray): Remove constructor that was only
intended to be used by the JIT compiler.
* NDArray.h (NDArray::NDarray): Remove constructor that was only
intended to be used by the JIT compiler.
* dim-vector.h (dim_vector::to_jit): Delete.
(dim_vector::dim_vector): Remove constructor that was only intended to
be used by the JIT compiler.
* codeql-analysis.yaml, make.yaml: Don't require llvm-dev.
* subst-config-vals.in.sh, subst-cross-config-vals.in.sh: Don't
substitute OCTAVE_CONF_LLVM_CPPFLAGS, OCTAVE_CONF_LLVM_LDFLAGS, or
OCTAVE_CONF_LLVM_LIBS.
* Doxyfile.in: Don't define HAVE_LLVM.
* aspell-octave.en.pws: Eliminate jit, JIT, and LLVM from the list of
spelling exceptions.
* build-env.h, build-env.in.cc (LLVM_CPPFLAGS, LLVM_LDFLAGS,
LLVM_LIBS): Delete variables and all uses.
* libinterp/corefcn/module.mk (%canon_reldir%_libcorefcn_la_CPPFLAGS):
Remove $(LLVM_CPPFLAGS) from the list.
* libinterp/parse-tree/module.mk (%canon_reldir%_libparse_tree_la_CPPFLAGS):
Remove $(LLVM_CPPFLAGS) from the list.
author | John W. Eaton <jwe@octave.org> |
---|---|
date | Tue, 10 Aug 2021 16:42:29 -0400 |
parents | 7854d5752dd2 |
children | a49c635b179d |
line wrap: on
line source
######################################################################## ## ## Copyright (C) 2000-2021 The Octave Project Developers ## ## See the file COPYRIGHT.md in the top-level directory of this ## distribution or <https://octave.org/copyright/>. ## ## This file is part of Octave. ## ## Octave 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 3 of the License, or ## (at your option) any later version. ## ## Octave 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 Octave; see the file COPYING. If not, see ## <https://www.gnu.org/licenses/>. ## ######################################################################## ## -*- texinfo -*- ## @deftypefn {} {} isprime (@var{x}) ## Return a logical array which is true where the elements of @var{x} are prime ## numbers and false where they are not. ## ## A prime number is conventionally defined as a positive integer greater than ## 1 (e.g., 2, 3, @dots{}) which is divisible only by itself and 1. Octave ## extends this definition to include both negative integers and complex ## values. A negative integer is prime if its positive counterpart is prime. ## This is equivalent to @code{isprime (abs (x))}. ## ## If @code{class (@var{x})} is complex, then primality is tested in the domain ## of Gaussian integers (@url{https://en.wikipedia.org/wiki/Gaussian_integer}). ## Some non-complex integers are prime in the ordinary sense, but not in the ## domain of Gaussian integers. For example, @math{5 = (1+2i)*(1-2i)} shows ## that 5 is not prime because it has a factor other than itself and 1. ## Exercise caution when testing complex and real values together in the same ## matrix. ## ## Examples: ## ## @example ## @group ## isprime (1:6) ## @result{} 0 1 1 0 1 0 ## @end group ## @end example ## ## @example ## @group ## isprime ([i, 2, 3, 5]) ## @result{} 0 0 1 0 ## @end group ## @end example ## ## Programming Note: @code{isprime} is appropriate if the maximum value in ## @var{x} is not too large (< 1e15). For larger values special purpose ## factorization code should be used. ## ## Compatibility Note: @sc{matlab} does not extend the definition of prime ## numbers and will produce an error if given negative or complex inputs. ## @seealso{primes, factor, gcd, lcm} ## @end deftypefn function t = isprime (x) if (nargin < 1) print_usage (); elseif (any (fix (x) != x)) error ("isprime: X contains non-integer entries"); endif if (isempty (x)) t = x; return; endif if (iscomplex (x)) t = isgaussianprime (x); return; endif ## Code strategy is to build a table with the list of possible primes ## and then quickly compare entries in x with the table of primes using ## lookup(). The table size is limited to save memory and computation ## time during its creation. All entries larger than the maximum in the ## table are checked by straightforward division. x = abs (x); # handle negative entries maxn = max (x(:)); ## generate prime table of suitable length. ## 1e7 threshold requires ~0.15 seconds of computation, 1e8 requires 1.8. maxp = min (maxn, max (sqrt (maxn), 1e7)); pr = primes (maxp); t = lookup (pr, x, "b"); # quick search for table matches. ## process any remaining large entries m = x(x > maxp); if (! isempty (m)) if (maxn <= intmax ("uint32")) m = uint32 (m); elseif (maxn <= intmax ("uint64")) m = uint64 (m); else warning ("isprime: X contains integers too large to be tested"); endif ## Start by dividing through by the small primes until the remaining ## list of entries is small (and most likely prime themselves). pr = cast (pr(pr <= sqrt (maxn)), class (m)); for p = pr m = m(rem (m, p) != 0); if (numel (m) < numel (pr) / 10) break; endif endfor ## Check the remaining list of possible primes against the ## remaining prime factors which were not tested in the for loop. ## This is just an optimization to use arrayfun over for loo pr = pr(pr > p); mm = arrayfun (@(x) all (rem (x, pr)), m); m = m(mm); ## Add any remaining entries, which are truly prime, to the results. if (! isempty (m)) m = cast (sort (m), class (x)); t |= lookup (m, x, "b"); endif endif endfunction function t = isgaussianprime (z) ## Assume prime unless proven otherwise t = true (size (z)); x = real (z); y = imag (z); ## If purely real or purely imaginary, ordinary prime test for ## that complex part if that part is 3 mod 4. xidx = y==0 & mod (x, 4) == 3; yidx = x==0 & mod (y, 4) == 3; t(xidx) &= isprime (x(xidx)); t(yidx) &= isprime (y(yidx)); ## Otherwise, prime if x^2 + y^2 is prime zidx = ! (xidx | yidx); # Skip entries that were already evaluated zabs = x(zidx).^2 + y(zidx).^2; t(zidx) &= isprime (zabs); endfunction %!assert (isprime (3), true) %!assert (isprime (4), false) %!assert (isprime (5i), false) %!assert (isprime (7i), true) %!assert (isprime ([1+2i, (2+3i)*(-1+2i)]), [true, false]) %!assert (isprime (-2), true) %!assert (isprime (complex (-2)), false) %!assert (isprime (2i), false) %!assert (isprime ([i, 2, 3, 5]), [false, false, true, false]) %!assert (isprime (0), false) %!assert (isprime (magic (3)), logical ([0, 0, 0; 1, 1, 1; 0, 0, 1])) ## Test input validation %!error <Invalid call> isprime () %!error <X contains non-integer entries> isprime (0.5i) %!error <X contains non-integer entries> isprime (0.5)