Mercurial > octave-dspies
view liboctave/util/oct-locbuf.cc @ 19010:3fb030666878 draft default tip dspies
Added special-case logical-indexing function
* logical-index.h (New file) : Logical-indexing function. May be called on
octave_value types via call_bool_index
* nz-iterators.h : Add base-class nz_iterator for iterator types. Array has
template bool for whether to internally store row-col or compute on the fly
Add skip_ahead method which skips forward to the next nonzero after its
argument
Add flat_index for computing octave_idx_type index of current position (with
assertion failure in the case of overflow)
Move is_zero to separate file
* ov-base-diag.cc, ov-base-mat.cc, ov-base-sparse.cc, ov-perm.cc
(do_index_op): Add call to call_bool_index in logical-index.h
* Array.h : Move forward-declaration for array_iterator to separate header file
* dim-vector.cc (dim_max): Refers to idx-bounds.h (max_idx)
* array-iter-decl.h (New file): Header file for forward declaration of
array-iterator
* direction.h : Add constants fdirc and bdirc to avoid having to reconstruct
them
* dv-utils.h, dv-utils.cc (New files) :
Utility functions for querying and constructing dim-vectors
* idx-bounds.h (New file) :
Utility constants and functions for determining whether things will overflow
the maximum allowed bounds
* interp-idx.h (New function : to_flat_idx) : Converts row-col pair to linear
index of octave_idx_type
* is-zero.h (New file) : Function for determining whether an element is zero
* logical-index.tst : Add tests for correct return-value dimensions and large
sparse matrix behavior
author | David Spies <dnspies@gmail.com> |
---|---|
date | Fri, 25 Jul 2014 13:39:31 -0600 |
parents | 49a5a4be04a1 |
children |
line wrap: on
line source
/* Copyright (C) 2008-2013 Jaroslav Hajek 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/>. */ #ifdef HAVE_CONFIG_H #include <config.h> #endif #include <iostream> #include "lo-error.h" #include "oct-locbuf.h" // FIXME: Maybe we should querying for available physical memory? #ifndef OCTAVE_LOCBUF_CHUNKSIZE_MB #define OCTAVE_LOCBUF_CHUNKSIZE_MB 32 #endif // Each chunk will be at least this big. const size_t octave_chunk_buffer::chunk_size = static_cast<size_t> (OCTAVE_LOCBUF_CHUNKSIZE_MB) << 20; char *octave_chunk_buffer::top = 0; char *octave_chunk_buffer::chunk = 0; size_t octave_chunk_buffer::left = 0; size_t octave_chunk_buffer::active = 0; octave_chunk_buffer::octave_chunk_buffer (size_t size) : cnk (0), dat (0) { // Alignment mask. The size of double or long int, whichever is // greater. All data will be aligned to this size. If it's not // enough for a type, that type should not be declared as POD. static const size_t align_mask = (sizeof (long) < sizeof (double) ? sizeof (double) : sizeof (long)) - 1; active++; if (! size) return; // Align size. Note that size_t is unsigned, so size-1 must correctly // wrap around. size = ((size - 1) | align_mask) + 1; if (size > left) { // Big buffers (> 1/8 chunk) will be allocated as stand-alone and // won't disrupt the chain. if (size > chunk_size >> 3) { // Use new [] to get std::bad_alloc if out of memory. dat = new char [size]; return; } dat = new char [chunk_size]; chunk = top = dat; left = chunk_size; } // Now allocate memory from the chunk and update state. cnk = chunk; dat = top; left -= size; top += size; } octave_chunk_buffer::~octave_chunk_buffer (void) { active--; if (cnk == chunk) { // Our chunk is still the active one. Just restore the state. left += top - dat; top = dat; } else { if (cnk) { // Responsible for deletion. delete [] chunk; chunk = cnk; top = dat; // FIXME: the following calcuation of remaining data will // only work if each chunk has the same chunk_size. left = chunk_size - (dat - cnk); } else { // We were a stand-alone buffer. delete [] dat; } } } // Clear the final chunk of allocated memory. void octave_chunk_buffer::clear (void) { if (active == 0) { delete [] chunk; chunk = 0; top = 0; left = 0; } else { (*current_liboctave_warning_handler) ("octave_chunk_buffer::clear: %d active allocations remain!", active); } }