Mercurial > octave
view libinterp/parse-tree/jit-util.h @ 29572:aef11bb4e6d1
use std::size_t and std::ptrdiff_t in C++ code (bug #60471)
Files affected: make_int.cc, file-editor-tab.cc, octave-qscintilla.cc,
Cell.cc, Cell.h, call-stack.cc, call-stack.h, cellfun.cc, data.cc,
debug.cc, dlmread.cc, error.cc, event-queue.h, fcn-info.cc,
fcn-info.h, file-io.cc, ft-text-renderer.cc, gl2ps-print.cc,
graphics.cc, graphics.in.h, help.cc, hex2num.cc, input.cc,
latex-text-renderer.cc, load-path.cc, load-save.cc, load-save.h,
ls-hdf5.cc, ls-mat-ascii.cc, ls-mat5.cc, ls-oct-text.cc, mex.cc,
mexproto.h, mxarray.h, oct-map.cc, oct-stream.cc, oct-stream.h,
pager.cc, pager.h, pr-output.cc, regexp.cc, settings.h,
stack-frame.cc, stack-frame.h, strfns.cc, syminfo.cc, symrec.h,
symscope.cc, symscope.h, symtab.cc, sysdep.cc, toplev.cc, utils.cc,
utils.h, variables.cc, __fltk_uigetfile__.cc, __init_fltk__.cc,
audioread.cc, gzip.cc, cdef-class.cc, cdef-manager.cc, cdef-method.cc,
cdef-object.cc, cdef-object.h, ov-base-diag.cc, ov-base-diag.h,
ov-base-mat.cc, ov-base-mat.h, ov-base-scalar.cc, ov-base-scalar.h,
ov-base-sparse.h, ov-base.cc, ov-base.h, ov-cell.cc, ov-cell.h,
ov-ch-mat.cc, ov-class.cc, ov-class.h, ov-classdef.cc,
ov-fcn-handle.cc, ov-java.cc, ov-lazy-idx.h, ov-perm.cc, ov-perm.h,
ov-range.h, ov-str-mat.cc, ov-struct.cc, ov-struct.h, ov-usr-fcn.cc,
ov-usr-fcn.h, ov.cc, ov.h, ovl.cc, octave.cc, bp-table.cc, jit-ir.cc,
jit-ir.h, jit-typeinfo.cc, jit-typeinfo.h, jit-util.h, lex.h, lex.ll,
oct-lvalue.cc, oct-parse.yy, parse.h, profiler.h, pt-eval.cc,
pt-eval.h, pt-jit.cc, pt-jit.h, pt-pr-code.cc, pt-tm-const.cc,
pt-tm-const.h, Array.h, CMatrix.cc, DiagArray2.h, PermMatrix.h,
Sparse.h, dMatrix.cc, fCMatrix.cc, fMatrix.cc, bsxfun-defs.cc,
oct-fftw.cc, oct-fftw.h, randpoisson.cc, sparse-chol.cc,
mx-inlines.cc, file-ops.cc, lo-sysdep.cc, oct-env.cc, oct-time.cc,
action-container.cc, action-container.h, base-list.h, caseless-str.h,
cmd-edit.cc, cmd-hist.cc, data-conv.cc, data-conv.h, f77-fcn.h,
file-info.cc, file-info.h, kpse.cc, kpse.h, lo-cutils.h, lo-hash.h,
lo-regexp.cc, oct-base64.cc, oct-base64.h, oct-binmap.h, oct-glob.cc,
oct-shlib.cc, oct-shlib.h, oct-sort.cc, oct-sparse.h, oct-string.cc,
quit.cc, unwind-prot.h, url-transfer.cc, main.in.cc, mkoctfile.in.cc,
and shared-fcns.h.
author | John W. Eaton <jwe@octave.org> |
---|---|
date | Wed, 28 Apr 2021 22:57:42 -0400 |
parents | 0a5b15007766 |
children |
line wrap: on
line source
//////////////////////////////////////////////////////////////////////// // // Copyright (C) 2012-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/>. // //////////////////////////////////////////////////////////////////////// // Some utility classes and functions used throughout jit #if ! defined (octave_jit_util_h) #define octave_jit_util_h 1 #include "octave-config.h" #if defined (HAVE_LLVM) #include <stdexcept> #if defined (HAVE_LLVM_IR_DATALAYOUT_H) || defined (HAVE_LLVM_DATALAYOUT_H) # define HAVE_LLVM_DATALAYOUT #endif // we don't want to include llvm headers here, as they require // __STDC_LIMIT_MACROS and __STDC_CONSTANT_MACROS be defined in the entire // compilation unit namespace llvm { class Value; class Module; class ExecutionEngine; class Function; class BasicBlock; class LLVMContext; class Type; class StructType; class FunctionType; class Twine; class GlobalValue; class GlobalVariable; class TerminatorInst; class PHINode; class TargetMachine; class ConstantFolder; #if defined LLVM_IRBUILDER_HAS_TWO_TEMPLATE_ARGS class IRBuilderDefaultInserter; template <typename T, typename Inserter> class IRBuilder; typedef IRBuilder<ConstantFolder, IRBuilderDefaultInserter> IRBuilderD; #else template <bool preserveNames> class IRBuilderDefaultInserter; template <bool preserveNames, typename T, typename Inserter> class IRBuilder; typedef IRBuilder<true, ConstantFolder, IRBuilderDefaultInserter<true>> IRBuilderD; #endif } // some octave classes that are not (yet) in the octave namespace class octave_base_value; class octave_builtin; class octave_value; class tree; class tree_expression; namespace octave { // thrown when we should give up on JIT and interpret class jit_fail_exception : public std::runtime_error { public: jit_fail_exception (void) : std::runtime_error ("unknown"), m_known (false) { } jit_fail_exception (const std::string& reason) : std::runtime_error (reason), m_known (true) { } bool known (void) const { return m_known; } private: bool m_known; }; // llvm doesn't provide this, and it's really useful for debugging std::ostream& operator<< (std::ostream& os, const llvm::Value& v); template <typename HOLDER_T, typename SUB_T> class jit_internal_node; // jit_internal_list and jit_internal_node implement generic embedded doubly // linked lists. List items extend from jit_internal_list, and can be placed // in nodes of type jit_internal_node. We use CRTP twice. template <typename LIST_T, typename NODE_T> class jit_internal_list { friend class jit_internal_node<LIST_T, NODE_T>; public: jit_internal_list (void) : m_use_head (0), m_use_tail (0), m_use_count (0) { } virtual ~jit_internal_list (void) { while (m_use_head) m_use_head->stash_value (0); } NODE_T * first_use (void) const { return m_use_head; } std::size_t use_count (void) const { return m_use_count; } private: NODE_T *m_use_head; NODE_T *m_use_tail; std::size_t m_use_count; }; // a node for internal linked lists template <typename LIST_T, typename NODE_T> class jit_internal_node { public: typedef jit_internal_list<LIST_T, NODE_T> jit_ilist; jit_internal_node (void) : m_value (nullptr), m_next (nullptr), m_prev (nullptr) { } ~jit_internal_node (void) { remove (); } LIST_T * value (void) const { return m_value; } void stash_value (LIST_T *avalue) { remove (); m_value = avalue; if (m_value) { jit_ilist *ilist = m_value; NODE_T *sthis = static_cast<NODE_T *> (this); if (ilist->m_use_head) { ilist->m_use_tail->m_next = sthis; m_prev = ilist->m_use_tail; } else ilist->m_use_head = sthis; ilist->m_use_tail = sthis; ++ilist->m_use_count; } } NODE_T * next (void) const { return m_next; } NODE_T * prev (void) const { return m_prev; } private: void remove (void) { if (m_value) { jit_ilist *ilist = m_value; if (m_prev) m_prev->m_next = m_next; else // we are the use_head ilist->m_use_head = m_next; if (m_next) m_next->m_prev = m_prev; else // we are the use tail ilist->m_use_tail = m_prev; m_next = m_prev = 0; --ilist->m_use_count; m_value = 0; } } LIST_T *m_value; NODE_T *m_next; NODE_T *m_prev; }; // Use like: isa<jit_phi> (value) // basically just a short cut type typing dyanmic_cast. template <typename T, typename U> bool isa (U *value) { return dynamic_cast<T *> (value); } } #endif #endif