Mercurial > octave-nkf
view scripts/general/bitget.m @ 18840:4a4edf0f2077 nkf-ready
fix LLVM 3.4 build (bug #41061)
* configure.ac: Call new functions OCTAVE_LLVM_RAW_FD_OSTREAM_API and
OCTAVE_LLVM_LEGACY_PASSMANAGER_API, check for Verifier.h header file
* m4/acinclude.m4 (OCTAVE_LLVM_RAW_FD_OSTREAM_API): New function to
detect correct raw_fd_ostream API
* m4/acinclude.m4 (OCTAVE_LLVM_LEGACY_PASSMANAGER_API): New function
to detect legacy passmanager API
* libinterp/corefcn/jit-util.h: Use legacy passmanager namespace if
necessary
* libinterp/corefcn/pt-jit.h (class tree_jit): Use legacy passmanager
class if necessary
* libinterp/corefcn/pt-jit.cc: Include appropriate header files
* libinterp/corefcn/pt-jit.cc (tree_jit::initialize): Use legacy
passmanager if necessary
* libinterp/corefcn/pt-jit.cc (tree_jit::optimize): Use correct API
* libinterp/corefcn/jit-typeinfo.cc: Include appropriate header file
author | Stefan Mahr <dac922@gmx.de> |
---|---|
date | Sun, 11 May 2014 02:28:33 +0200 |
parents | d63878346099 |
children | 4197fc428c7d |
line wrap: on
line source
## Copyright (C) 2004-2013 David Bateman ## ## 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/>. ## -*- texinfo -*- ## @deftypefn {Function File} {@var{c} =} bitget (@var{A}, @var{n}) ## Return the status of bit(s) @var{n} of unsigned integers in @var{A} ## the lowest significant bit is @var{n} = 1. ## ## @example ## @group ## bitget (100, 8:-1:1) ## @result{} 0 1 1 0 0 1 0 0 ## @end group ## @end example ## @seealso{bitand, bitor, bitxor, bitset, bitcmp, bitshift, bitmax} ## @end deftypefn ## Liberally based of the version by Kai Habel from octave-forge function C = bitget (A, n) if (nargin != 2) print_usage (); endif if (isa (A, "double")) Amax = ceil (log2 (bitmax)); _conv = @double; elseif (isa (A, "single")) Amax = ceil (log2 (bitmax ("single"))); _conv = @single; else if (isa (A, "uint8")) Amax = 8; _conv = @uint8; elseif (isa (A, "uint16")) Amax = 16; _conv = @uint16; elseif (isa (A, "uint32")) Amax = 32; _conv = @uint32; elseif (isa (A, "uint64")) Amax = 64; _conv = @uint64; elseif (isa (A, "int8")) Amax = 8; _conv = @int8; elseif (isa (A, "int16")) Amax = 16; _conv = @int16; elseif (isa (A, "int32")) Amax = 32; _conv = @int32; elseif (isa (A, "int64")) Amax = 64; _conv = @int64; else error ("bitget: invalid class %s", class (A)); endif endif m = double (n(:)); if (any (m < 1) || any (m > Amax)) error ("bitget: N must be in the range [1,%d]", Amax); endif C = bitand (A, bitshift (_conv (1), uint8 (n) - uint8 (1))) != _conv (0); endfunction %!test %! assert (bitget ([4, 14], [3, 3]), logical ([1, 1])); %! assert (bitget (single ([4, 14]), [3, 3]), logical ([1, 1])); %! pfx = {"", "u"}; %! for i = 1:2 %! for prec = [8, 16, 32, 64] %! fcn = str2func (sprintf ("%sint%d", pfx{i}, prec)); %! assert (bitget (fcn ([4, 14]), [3, 3]), logical ([1, 1])); %! endfor %! endfor %!error bitget (0, 0) %!error bitget (0, 55) %!error bitget (single (0), 0) %!error bitget (single (0), 26) %!error bitget (int8 (0), 9) %!error bitget (uint8 (0), 9) %!error bitget (int16 (0), 17) %!error bitget (uint16 (0), 17) %!error bitget (int32 (0), 33) %!error bitget (uint32 (0), 33) %!error bitget (int64 (0), 65) %!error bitget (uint64 (0), 65) %!error bitget (1) %!error bitget (1, 2, 3)