Mercurial > octave
view test/jit.tst @ 21200:fcac5dbbf9ed
maint: Indent #ifdef blocks in libinterp.
* builtins.h, Cell.cc, __contourc__.cc, __dispatch__.cc, __dsearchn__.cc,
__ichol__.cc, __ilu__.cc, __lin_interpn__.cc, __pchip_deriv__.cc, __qp__.cc,
balance.cc, besselj.cc, betainc.cc, bitfcns.cc, bsxfun.cc,
c-file-ptr-stream.cc, c-file-ptr-stream.h, cellfun.cc, colloc.cc,
comment-list.cc, conv2.cc, daspk.cc, dasrt.cc, dassl.cc, data.cc, debug.cc,
defaults.cc, defaults.in.h, defun-dld.h, defun.cc, defun.h, det.cc, dirfns.cc,
display.cc, dlmread.cc, dot.cc, dynamic-ld.cc, eig.cc, ellipj.cc, error.cc,
errwarn.cc, event-queue.cc, fft.cc, fft2.cc, fftn.cc, file-io.cc, filter.cc,
find.cc, gammainc.cc, gcd.cc, getgrent.cc, getpwent.cc, getrusage.cc,
givens.cc, gl-render.cc, gl2ps-print.cc, graphics.cc, graphics.in.h, gripes.cc,
hash.cc, help.cc, hess.cc, hex2num.cc, input.cc, inv.cc, jit-ir.cc,
jit-typeinfo.cc, jit-util.cc, jit-util.h, kron.cc, load-path.cc, load-save.cc,
lookup.cc, ls-ascii-helper.cc, ls-hdf5.cc, ls-mat-ascii.cc, ls-mat4.cc,
ls-mat5.cc, ls-oct-binary.cc, ls-oct-text.cc, ls-oct-text.h, ls-utils.cc,
ls-utils.h, lsode.cc, lu.cc, luinc.cc, mappers.cc, matrix_type.cc, max.cc,
mex.h, mexproto.h, mgorth.cc, nproc.cc, oct-errno.in.cc, oct-fstrm.cc,
oct-hdf5-types.cc, oct-hdf5.h, oct-hist.cc, oct-iostrm.cc, oct-lvalue.cc,
oct-map.cc, oct-prcstrm.cc, oct-procbuf.cc, oct-stream.cc, oct-strstrm.cc,
octave-link.cc, ordschur.cc, pager.cc, pinv.cc, pr-output.cc, procstream.cc,
profiler.cc, psi.cc, pt-jit.cc, quad.cc, quadcc.cc, qz.cc, rand.cc, rcond.cc,
regexp.cc, schur.cc, sighandlers.cc, sparse-xdiv.cc, sparse-xpow.cc, sparse.cc,
spparms.cc, sqrtm.cc, str2double.cc, strfind.cc, strfns.cc, sub2ind.cc, svd.cc,
sylvester.cc, symtab.cc, syscalls.cc, sysdep.cc, sysdep.h, time.cc, toplev.cc,
tril.cc, tsearch.cc, txt-eng-ft.cc, txt-eng.cc, typecast.cc, urlwrite.cc,
utils.cc, variables.cc, xdiv.cc, xnorm.cc, xpow.cc, zfstream.cc,
__delaunayn__.cc, __eigs__.cc, __fltk_uigetfile__.cc, __glpk__.cc,
__init_fltk__.cc, __init_gnuplot__.cc, __magick_read__.cc, __osmesa_print__.cc,
__voronoi__.cc, amd.cc, audiodevinfo.cc, audioread.cc, ccolamd.cc, chol.cc,
colamd.cc, convhulln.cc, dmperm.cc, fftw.cc, oct-qhull.h, qr.cc, symbfact.cc,
symrcm.cc, oct-conf.in.cc, ov-base-diag.cc, ov-base-int.cc, ov-base-mat.cc,
ov-base-scalar.cc, ov-base-sparse.cc, ov-base.cc, ov-bool-mat.cc,
ov-bool-sparse.cc, ov-bool.cc, ov-builtin.cc, ov-cell.cc, ov-ch-mat.cc,
ov-class.cc, ov-classdef.cc, ov-colon.cc, ov-complex.cc, ov-cs-list.cc,
ov-cx-diag.cc, ov-cx-mat.cc, ov-cx-sparse.cc, ov-dld-fcn.cc, ov-fcn-handle.cc,
ov-fcn-inline.cc, ov-fcn.cc, ov-float.cc, ov-flt-complex.cc, ov-flt-cx-diag.cc,
ov-flt-cx-mat.cc, ov-flt-re-diag.cc, ov-flt-re-mat.cc, ov-int16.cc,
ov-int32.cc, ov-int64.cc, ov-int8.cc, ov-java.cc, ov-lazy-idx.cc,
ov-mex-fcn.cc, ov-null-mat.cc, ov-oncleanup.cc, ov-perm.cc, ov-range.cc,
ov-re-diag.cc, ov-re-mat.cc, ov-re-sparse.cc, ov-scalar.cc, ov-str-mat.cc,
ov-struct.cc, ov-typeinfo.cc, ov-uint16.cc, ov-uint32.cc, ov-uint64.cc,
ov-uint8.cc, ov-usr-fcn.cc, ov.cc, ovl.cc, octave.cc, op-b-b.cc, op-b-bm.cc,
op-b-sbm.cc, op-bm-b.cc, op-bm-bm.cc, op-bm-sbm.cc, op-cdm-cdm.cc, op-cell.cc,
op-chm.cc, op-class.cc, op-cm-cm.cc, op-cm-cs.cc, op-cm-m.cc, op-cm-s.cc,
op-cm-scm.cc, op-cm-sm.cc, op-cs-cm.cc, op-cs-cs.cc, op-cs-m.cc, op-cs-s.cc,
op-cs-scm.cc, op-cs-sm.cc, op-dm-dm.cc, op-dm-scm.cc, op-dm-sm.cc,
op-dm-template.cc, op-dms-template.cc, op-double-conv.cc, op-fcdm-fcdm.cc,
op-fcdm-fdm.cc, op-fcm-fcm.cc, op-fcm-fcs.cc, op-fcm-fm.cc, op-fcm-fs.cc,
op-fcn.cc, op-fcs-fcm.cc, op-fcs-fcs.cc, op-fcs-fm.cc, op-fcs-fs.cc,
op-fdm-fdm.cc, op-float-conv.cc, op-fm-fcm.cc, op-fm-fcs.cc, op-fm-fm.cc,
op-fm-fs.cc, op-fs-fcm.cc, op-fs-fcs.cc, op-fs-fm.cc, op-fs-fs.cc,
op-i16-i16.cc, op-i32-i32.cc, op-i64-i64.cc, op-i8-i8.cc, op-int-concat.cc,
op-int-conv.cc, op-m-cm.cc, op-m-cs.cc, op-m-m.cc, op-m-s.cc, op-m-scm.cc,
op-m-sm.cc, op-pm-pm.cc, op-pm-scm.cc, op-pm-sm.cc, op-pm-template.cc,
op-range.cc, op-s-cm.cc, op-s-cs.cc, op-s-m.cc, op-s-s.cc, op-s-scm.cc,
op-s-sm.cc, op-sbm-b.cc, op-sbm-bm.cc, op-sbm-sbm.cc, op-scm-cm.cc,
op-scm-cs.cc, op-scm-m.cc, op-scm-s.cc, op-scm-scm.cc, op-scm-sm.cc,
op-sm-cm.cc, op-sm-cs.cc, op-sm-m.cc, op-sm-s.cc, op-sm-scm.cc, op-sm-sm.cc,
op-str-m.cc, op-str-s.cc, op-str-str.cc, op-struct.cc, op-ui16-ui16.cc,
op-ui32-ui32.cc, op-ui64-ui64.cc, op-ui8-ui8.cc, pt-arg-list.cc,
pt-array-list.cc, pt-assign.cc, pt-binop.cc, pt-bp.cc, pt-cbinop.cc,
pt-cell.cc, pt-check.cc, pt-classdef.cc, pt-cmd.cc, pt-colon.cc, pt-colon.h,
pt-const.cc, pt-decl.cc, pt-eval.cc, pt-except.cc, pt-exp.cc, pt-fcn-handle.cc,
pt-funcall.cc, pt-id.cc, pt-idx.cc, pt-jump.cc, pt-loop.cc, pt-mat.cc,
pt-misc.cc, pt-pr-code.cc, pt-select.cc, pt-stmt.cc, pt-unop.cc, pt.cc,
token.cc, Array-jit.cc, Array-os.cc, Array-sym.cc, Array-tc.cc, version.cc:
Indent #ifdef blocks in libinterp.
author | Rik <rik@octave.org> |
---|---|
date | Fri, 05 Feb 2016 16:29:08 -0800 |
parents | 9cf91ecdc6f7 |
children | 6c2fd62db1f7 |
line wrap: on
line source
## Copyright (C) 2012-2015 Max Brister ## ## 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 ## <http://www.gnu.org/licenses/>. ## Author: Max Brister <max@2bass.com> ## Turn on JIT and set defaults before running tests %!testif HAVE_LLVM %! global __old_jit_enable__; %! global __old_jit_startcnt__; %! __old_jit_enable__ = jit_enable (true); %! __old_jit_startcnt__ = jit_startcnt (1000); ## Test some simple cases that compile. %!testif HAVE_LLVM %! jit_failcnt (0) %! for i=1:1e6 %! if (i < 5) %! break; %! else %! break; %! endif %! endfor %! assert (i, 1); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! while (1) %! if (1) %! break; %! else %! break; %! endif %! endwhile %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! do %! break; %! until (0) %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! do %! if (1) %! break; %! end; %! until (0) %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! i=1; %! do %! continue; %! i=i+1; %! until (1) %! assert (i, 1); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! for i=1:1e6 %! if (i == 100) %! break; %! endif %! endfor %! assert (i, 100); %! assert (jit_failcnt, 0); ## Also test parfor keyword %!testif HAVE_LLVM %! jit_failcnt (0) %! parfor i=1:1e6 %! if (i == 100) %! break; %! endif %! endparfor %! assert (i, 100); %! assert (jit_failcnt, 0); ## Test some switch statements %!testif HAVE_LLVM %! jit_failcnt (0) %! do %! switch (1) %! end; %! until(1) %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! do %! switch (1) %! case 1 %! break; %! end; %! until(1) %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! do %! switch (1) %! otherwise %! break; %! end; %! until(1) %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! do %! switch (1) %! case 1 %! break; %! otherwise %! break; %! end; %! until(1) %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! i=0; %! a=0; %! b=0; %! do %! i=i+1; %! switch (i) %! case 1 %! continue; %! case 2 %! b=1; %! continue; %! case 4 %! break; %! otherwise %! a=a+5; %! end; %! a=a+1; %! until(0); %! assert (i, 4); %! assert (a, 6); %! assert (b, 1); %! assert (jit_failcnt, 0); ## Some more complex calculations %!testif HAVE_LLVM %! jit_failcnt (0) %! inc = 1e-5; %! result = 0; %! for ii = 0:inc:1 %! result = result + inc * (1/3 * ii * ii); %! endfor %! assert (abs (result - 1/9) < 1e-5); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! inc = 1e-5; %! result = 0; %! for ii = 0:inc:1 %! ## the ^ operator's result is complex %! result = result + inc * (1/3 * ii ^ 2); %! endfor %! assert (abs (result - 1/9) < 1e-5); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! temp = 1+1i; %! nan = NaN; %! while (1) %! temp = temp - 1i; %! temp = temp * nan; %! break; %! endwhile %! assert (imag (temp), 0); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! temp = 1+1i; %! nan = NaN+1i; %! while (1) %! nan = nan - 1i; %! temp = temp - 1i; %! temp = temp * nan; %! break; %! endwhile %! assert (imag (temp), 0); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! temp = 1+1i; %! while (1) %! temp = temp * 5; %! break; %! endwhile %! assert (temp, 5+5i); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! nr = 1001; %! mat = zeros (1, nr); %! for i = 1:nr %! mat(i) = i; %! endfor %! assert (mat == 1:nr); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! nr = 1001; %! mat = 1:nr; %! mat(end) = 0; # force mat to a matrix %! total = 0; %! for i = 1:nr %! total = mat(i) + total; %! endfor %! assert (sum (mat) == total); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! nr = 1001; %! mat = [3 1 5]; %! try %! for i = 1:nr %! if (i > 500) %! result = mat(100); %! else %! result = i; %! endif %! endfor %! catch %! end_try_catch %! assert (result == 500); %! assert (jit_failcnt, 0); %!function result = gen_test (n) %! result = double (rand (1, n) > .01); %!endfunction %!function z = vectorized (A, K) %! temp = ones (1, K); %! z = conv (A, temp); %! z = z > K-1; %! z = conv (z, temp); %! z = z(K:end-K+1); %! z = z >= 1; %!endfunction %!function z = loopy (A, K) %! z = A; %! n = numel (A); %! counter = 0; %! for ii=1:n %! if (z(ii)) %! counter = counter + 1; %! else %! if (counter > 0 && counter < K) %! z(ii-counter:ii-1) = 0; %! endif %! counter = 0; %! endif %! endfor %! %! if (counter > 0 && counter < K) %! z(end-counter+1:end) = 0; %! endif %!endfunction %!testif HAVE_LLVM %! jit_failcnt (0) %! test_set = gen_test (10000); %! assert (all (vectorized (test_set, 3) == loopy (test_set, 3))); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! niter = 1001; %! i = 0; %! while (i < niter) %! i = i + 1; %! endwhile %! assert (i == niter); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! niter = 1001; %! result = 0; %! m = [5 10]; %! for i=1:niter %! result = result + m(end); %! endfor %! assert (result == m(end) * niter); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! ndim = 100; %! result = 0; %! m = zeros (ndim); %! m(:) = 1:ndim^2; %! i = 1; %! while (i <= ndim) %! for j = 1:ndim %! result = result + m(i, j); %! endfor %! i = i + 1; %! endwhile %! assert (result == sum (sum (m))); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! ndim = 100; %! m = zeros (ndim); %! i = 1; %! while (i <= ndim) %! for j = 1:ndim %! m(i, j) = (j - 1) * ndim + i; %! endfor %! i = i + 1; %! endwhile %! m2 = zeros (ndim); %! m2(:) = 1:(ndim^2); %! assert (all (m == m2)); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! ndim = 2; %! m = zeros (ndim, ndim, ndim, ndim); %! result = 0; %! i0 = 1; %! while (i0 <= ndim) %! for i1 = 1:ndim %! for i2 = 1:ndim %! for i3 = 1:ndim %! m(i0, i1, i2, i3) = 1; %! m(i0, i1, i2, i3, 1, 1, 1, 1, 1, 1) = 1; %! result = result + m(i0, i1, i2, i3); %! endfor %! endfor %! endfor %! i0 = i0 + 1; %! endwhile %! expected = ones (ndim, ndim, ndim, ndim); %! assert (all (m == expected)); %! assert (result == sum (expected (:))); %! assert (jit_failcnt, 0); %!function test_divide () %! state = warning ("query", "Octave:divide-by-zero").state; %! unwind_protect %! warning ("error", "Octave:divide-by-zero"); %! for i=1:1e5 %! a = 1; %! a / 0; %! endfor %! unwind_protect_cleanup %! warning (state, "Octave:divide-by-zero"); %! end_unwind_protect %!endfunction %!testif HAVE_LLVM %! jit_failcnt (0) %! lasterr (""); %! try %! test_divide (); %! end_try_catch %! assert (strcmp (lasterr (), "division by zero")); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! while (1) %! a = 0; %! result = a / 1; %! break; %! endwhile %! assert (result, 0); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! m = zeros (2, 1001); %! for i=1:1001 %! m(end, i) = i; %! m(end - 1, end - i + 1) = i; %! endfor %! m2 = zeros (2, 1001); %! m2(1, :) = fliplr (1:1001); %! m2(2, :) = 1:1001; %! assert (m, m2); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! m = [1 2 3]; %! for i=1:1001 %! m = sin (m); %! break; %! endfor %! assert (m == sin ([1 2 3])); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! i = 0; %! while i < 10 %! i += 1; %! endwhile %! assert (i == 10); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! i = 0; %! while i < 10 %! a = ++i; %! endwhile %! assert (i == 10); %! assert (a == 10); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! i = 0; %! while i < 10 %! a = i++; %! endwhile %! assert (i == 10); %! assert (a == 9); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! num = 2; %! a = zeros (1, num); %! i = 1; %! while i <= num %! a(i) = norm (eye (i)); %! ++i; %! endwhile %! assert (a, ones (1, num)); %! assert (jit_failcnt, 0); %!function test_compute_idom () %! while (li <= length (l1) && si <= length (s1)) %! if (l1 (li) < s1 (si)) %! if (li == si) %! break; %! endif; %! li++; %! else %! si++; %! endif; %! endwhile %!testif HAVE_LLVM %! jit_failcnt (0) %! lasterr (""); %! try %! test_compute_idom (); %! end_try_catch %! assert (! isempty (lasterr ())); %! assert (jit_failcnt, 1); %!function x = test_overload (a) %! while (1) %! x = a; %! break; %! endwhile %!endfunction %!testif HAVE_LLVM %! jit_failcnt (0) %! assert (test_overload (1), 1); %! assert (test_overload ([1 2]), [1 2]); %! assert (jit_failcnt, 0); %!function a = bubble (a = [3 2 1]) %! swapped = 1; %! n = length (a); %! while (swapped) %! swapped = 0; %! for i = 1:n-1 %! if (a(i) > a(i + 1)) %! swapped = 1; %! temp = a(i); %! a(i) = a(i + 1); %! a(i + 1) = temp; %! endif %! endfor %! endwhile %!endfunction %!testif HAVE_LLVM %! jit_failcnt (0) %! assert (bubble (), [1 2 3]); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! a = 0; %! b = 1; %! for i=1:1e3 %! for j=1:2 %! a = a + b; %! endfor %! endfor %! assert (a, 2000); %! assert (b, 1); %! assert (jit_failcnt, 0); %!xtest %! ## FIXME: No support for functions with complex input prototypes %! ## testif HAVE_LLVM %! jit_failcnt (0) %! a = [1+1i 1+2i]; %! b = 0; %! while (1) %! b = a(1); %! break; %! endwhile %! assert (b, a(1)); %! assert (jit_failcnt, 0); %!function test_undef () %! for i=1:1e7 %! XXX; %! endfor %!endfunction %!testif HAVE_LLVM %! jit_failcnt (0) %! lasterr (""); %! try %! test_undef (); %! end_try_catch %! assert (strncmp (lasterr (), "'XXX' undefined near", 20)); %! assert (jit_failcnt, 1); %!shared id %! id = @(x) x; %!xtest %! ## FIXME: No support for functions with complex input prototypes %! ## testif HAVE_LLVM %! jit_failcnt (0) %! assert (id (1), 1); %! assert (id (1+1i), 1+1i); %! assert (id (1, 2), 1); %! assert (jit_failcnt, 0); %!testif HAVE_LLVM %! jit_failcnt (0) %! lasterr (""); %! try %! id (); %! end_try_catch %! assert (strncmp (lasterr (), "'x' undefined near", 18)); %! assert (jit_failcnt, 0); ## Restore JIT settings %!testif HAVE_LLVM %! global __old_jit_enable__; %! global __old_jit_startcnt__; %! jit_enable (__old_jit_enable__); %! jit_startcnt (__old_jit_startcnt__); %! clear -g __old_jit_enable__ __old_jit_startcnt__;