cgal/Interval_arithmetic/include/CGAL/Kernel_profiler.h

140 lines
4.0 KiB
C++

// Copyright (c) 2004 Utrecht University (The Netherlands),
// ETH Zurich (Switzerland), Freie Universitaet Berlin (Germany),
// INRIA Sophia-Antipolis (France), Martin-Luther-University Halle-Wittenberg
// (Germany), Max-Planck-Institute Saarbruecken (Germany), RISC Linz (Austria),
// and Tel-Aviv University (Israel). All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; version 2.1 of the License.
// See the file LICENSE.LGPL distributed with CGAL.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $Source$
// $Revision$ $Date$
// $Name$
//
// Author(s) : Sylvain Pion
#ifndef CGAL_KERNEL_PROFILER_H
#define CGAL_KERNEL_PROFILER_H
// This file contains the definition of a kernel traits profiler.
#include <CGAL/basic.h>
#include <typeinfo>
CGAL_BEGIN_NAMESPACE
// Primitive wrapper which handles the profiling.
template < typename P >
struct Primitive_profiler
: public P
{
typedef typename P::result_type result_type;
typedef typename P::Arity Arity;
// #define CGAL_KERNEL_PROFILER CGAL_PROFILER(CGAL_PRETTY_FUNCTION);
#define CGAL_KERNEL_PROFILER \
CGAL_PROFILER(typeid(static_cast<const P&>(*this)).name())
Primitive_profiler(const P& p = P())
: P(p) {}
template <class A1>
result_type
operator()(const A1 &a1) const
{
CGAL_KERNEL_PROFILER;
return P::operator()(a1);
}
template <class A1, class A2>
result_type
operator()(const A1 &a1, const A2 &a2) const
{
CGAL_KERNEL_PROFILER;
return P::operator()(a1, a2);
}
template <class A1, class A2, class A3>
result_type
operator()(const A1 &a1, const A2 &a2, const A3 &a3) const
{
CGAL_KERNEL_PROFILER;
return P::operator()(a1, a2, a3);
}
template <class A1, class A2, class A3, class A4>
result_type
operator()(const A1 &a1, const A2 &a2, const A3 &a3, const A4 &a4) const
{
CGAL_KERNEL_PROFILER;
return P::operator()(a1, a2, a3, a4);
}
template <class A1, class A2, class A3, class A4, class A5>
result_type
operator()(const A1 &a1, const A2 &a2, const A3 &a3, const A4 &a4,
const A5 &a5) const
{
CGAL_KERNEL_PROFILER;
return P::operator()(a1, a2, a3, a4, a5);
}
template <class A1, class A2, class A3, class A4, class A5, class A6>
result_type
operator()(const A1 &a1, const A2 &a2, const A3 &a3, const A4 &a4,
const A5 &a5, const A6 &a6) const
{
CGAL_KERNEL_PROFILER;
return P::operator()(a1, a2, a3, a4, a5, a6);
}
template <class A1, class A2, class A3, class A4,
class A5, class A6, class A7>
result_type
operator()(const A1 &a1, const A2 &a2, const A3 &a3, const A4 &a4,
const A5 &a5, const A6 &a6, const A7 &a7) const
{
CGAL_KERNEL_PROFILER;
return P::operator()(a1, a2, a3, a4, a5, a6, a7);
}
template <class A1, class A2, class A3, class A4,
class A5, class A6, class A7, class A8>
result_type
operator()(const A1 &a1, const A2 &a2, const A3 &a3, const A4 &a4,
const A5 &a5, const A6 &a6, const A7 &a7, const A8 &a8) const
{
CGAL_KERNEL_PROFILER;
return P::operator()(a1, a2, a3, a4, a5, a6, a7, a8);
}
// ...
};
// We inherit all geometric objects from K, and just replace the primitives.
template < typename K >
struct Kernel_profiler
: public K
{
#define CGAL_prof_prim(X, Y) \
typedef Primitive_profiler<typename K::X> X; \
X Y() const { return X(static_cast<const K&>(*this).Y()); }
#define CGAL_Kernel_pred(X, Y) CGAL_prof_prim(X, Y)
#define CGAL_Kernel_cons(X, Y) CGAL_prof_prim(X, Y)
#include <CGAL/Kernel/interface_macros.h>
};
CGAL_END_NAMESPACE
#endif // CGAL_KERNEL_PROFILER_H