x86_64-unknown-linux-gnu/include/c++/4.5.3/profile/impl/profiler_list_to_vector.h - toolchains/kvm - Git at Google

 // -*- C++ -*-
 //
 // Copyright (C) 2009, 2010 Free Software Foundation, Inc.
 //
 // This file is part of the GNU ISO C++ Library.  This library 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 2, or (at your option) any later
 // version.

 // This library 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 this library; see the file COPYING.  If not, write to
 // the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
 // MA 02111-1307, USA.

 // As a special exception, you may use this file as part of a free
 // software library without restriction.  Specifically, if other files
 // instantiate templates or use macros or inline functions from this
 // file, or you compile this file and link it with other files to
 // produce an executable, this file does not by itself cause the
 // resulting executable to be covered by the GNU General Public
 // License.  This exception does not however invalidate any other
 // reasons why the executable file might be covered by the GNU General
 // Public License.

 /** @file profile/impl/profiler_list_to_vector.h
  *  @brief diagnostics for list to vector.
  */

 // Written by Changhee Jung.

 #ifndef _GLIBCXX_PROFILE_PROFILER_LIST_TO_VECTOR_H
 #define _GLIBCXX_PROFILE_PROFILER_LIST_TO_VECTOR_H 1

 #ifdef __GXX_EXPERIMENTAL_CXX0X__
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #else
 #include <stdio.h>
 #include <stdint.h>
 #include <string.h>
 #endif
 #include <string>
 #include <sstream>
 #include "profile/impl/profiler.h"
 #include "profile/impl/profiler_node.h"
 #include "profile/impl/profiler_trace.h"

 namespace __gnu_profile
 {

 /** @brief A list-to-vector instrumentation line in the object table.  */
 class __list2vector_info: public __object_info_base
 {
  public:
   __list2vector_info()
       :_M_shift_count(0), _M_iterate(0), _M_resize(0), _M_list_cost(0),
        _M_vector_cost(0), _M_valid(true), _M_max_size(0) {}
   __list2vector_info(__stack_t __stack)
       : __object_info_base(__stack), _M_shift_count(0), _M_iterate(0),
         _M_resize(0), _M_list_cost(0), _M_vector_cost(0), _M_valid(true),
         _M_max_size(0) {}
   virtual ~__list2vector_info() {}
   __list2vector_info(const __list2vector_info& __o);
   void __merge(const __list2vector_info& __o);
   void __write(FILE* __f) const;
   float __magnitude() const { return _M_list_cost - _M_vector_cost; }
   const char* __advice() const;
   size_t __shift_count() { return _M_shift_count; }
   size_t __iterate()   { return _M_iterate; }
   float __list_cost() { return _M_list_cost; }
   size_t __resize() { return _M_resize; }
   void __set_list_cost(float __lc) { _M_list_cost = __lc; }
   void __set_vector_cost(float __vc) { _M_vector_cost = __vc; }
   bool __is_valid() { return _M_valid; }
   void __set_invalid() { _M_valid = false; }

   void __opr_insert(size_t __shift, size_t __size);
   void __opr_iterate(size_t __num) { _M_iterate += __num;}

   void __resize(size_t __from, size_t __to);

 private:
   size_t _M_shift_count;
   size_t _M_iterate;
   size_t _M_resize;
   float _M_list_cost;
   float _M_vector_cost;
   bool  _M_valid;
   size_t _M_max_size;
 };

 inline __list2vector_info::__list2vector_info(const __list2vector_info& __o)
     : __object_info_base(__o)
 {
   _M_shift_count  = __o._M_shift_count;
   _M_iterate      = __o._M_iterate;
   _M_vector_cost  = __o._M_vector_cost;
   _M_list_cost    = __o._M_list_cost;
   _M_valid        = __o._M_valid;
   _M_resize       = __o._M_resize;
   _M_max_size     = __o._M_max_size;
 }

 inline const char* __list2vector_info::__advice() const {
   std::stringstream __sstream;
   __sstream
       << "change std::list to std::vector and its initial size from 0 to "
       << _M_max_size;
   return strdup(__sstream.str().c_str());
 }

 inline void __list2vector_info::__merge(const __list2vector_info& __o)
 {
   _M_shift_count  += __o._M_shift_count;
   _M_iterate      += __o._M_iterate;
   _M_vector_cost  += __o._M_vector_cost;
   _M_list_cost    += __o._M_list_cost;
   _M_valid        &= __o._M_valid;
   _M_resize       += __o._M_resize;
   _M_max_size     = std::max( _M_max_size, __o._M_max_size);
 }

 inline void __list2vector_info::__opr_insert(size_t __shift, size_t __size)
 {
   _M_shift_count += __shift;
   _M_max_size = std::max(_M_max_size, __size);
 }

 inline void __list2vector_info::__resize(size_t __from, size_t __to)
 {
   _M_resize += __from;
 }

 class __list2vector_stack_info: public __list2vector_info {
  public:
   __list2vector_stack_info(const __list2vector_info& __o)
       : __list2vector_info(__o) {}
 };

 class __trace_list_to_vector
     : public __trace_base<__list2vector_info, __list2vector_stack_info>
 {
  public:
   __trace_list_to_vector();
   ~__trace_list_to_vector() {}

   // Insert a new node at construct with object, callstack and initial size.
   void __insert(__object_t __obj, __stack_t __stack);
   // Call at destruction/clean to set container final size.
   void __destruct(const void* __obj);

   // Find the node in the live map.
   __list2vector_info* __find(const void* __obj);

   // Collect cost of operations.
   void __opr_insert(const void* __obj, size_t __shift, size_t __size);
   void __opr_iterate(const void* __obj, size_t __num);
   void __invalid_operator(const void* __obj);
   void __resize(const void* __obj, size_t __from, size_t __to);
   float __vector_cost(size_t __shift, size_t __iterate);
   float __list_cost(size_t __shift, size_t __iterate);
 };

 inline __trace_list_to_vector::__trace_list_to_vector()
     : __trace_base<__list2vector_info, __list2vector_stack_info>()
 {
   __id = "list-to-vector";
 }

 inline void __trace_list_to_vector::__insert(__object_t __obj,
                                              __stack_t __stack)
 {
   __add_object(__obj, __list2vector_info(__stack));
 }

 inline void __list2vector_info::__write(FILE* __f) const
 {
   fprintf(__f, "%Zu %Zu %Zu %.0f %.0f\n",
           _M_shift_count, _M_resize, _M_iterate, _M_vector_cost, _M_list_cost);
 }

 inline float __trace_list_to_vector::__vector_cost(size_t __shift,
                                                    size_t __iterate)
 {
   // The resulting vector will use a 'reserve' method.
   return __shift * _GLIBCXX_PROFILE_DATA(__vector_shift_cost_factor).__value +
       __iterate * _GLIBCXX_PROFILE_DATA(__vector_iterate_cost_factor).__value;
 }

 inline float __trace_list_to_vector::__list_cost(size_t __shift,
                                                  size_t __iterate)
 {
   return __shift * _GLIBCXX_PROFILE_DATA(__list_shift_cost_factor).__value +
       __iterate * _GLIBCXX_PROFILE_DATA(__list_iterate_cost_factor).__value;
 }

 inline void __trace_list_to_vector::__destruct(const void* __obj)
 {
   if (!__is_on())
     return;

  __list2vector_info* __res = __get_object_info(__obj);
   if (!__res)
     return;

   float __vc = __vector_cost(__res->__shift_count(), __res->__iterate());
   float __lc = __list_cost(__res->__shift_count(), __res->__iterate());
   __res->__set_vector_cost(__vc);
   __res->__set_list_cost(__lc);
   __retire_object(__obj);
 }

 inline void __trace_list_to_vector::__opr_insert(const void* __obj,
                                                  size_t __shift, size_t __size)
 {
   __list2vector_info* __res = __get_object_info(__obj);
   if (__res)
     __res->__opr_insert(__shift, __size);
 }

 inline void __trace_list_to_vector::__opr_iterate(const void* __obj,
                                                   size_t __num)
 {
   __list2vector_info* __res = __get_object_info(__obj);
   if (__res) {
     __res->__opr_iterate(__num);
   }
 }

 inline void __trace_list_to_vector::__invalid_operator(const void* __obj)
 {
   __list2vector_info* __res = __get_object_info(__obj);
   if (__res)
     __res->__set_invalid();
 }

 inline void __trace_list_to_vector::__resize(const void* __obj, size_t __from,
                                              size_t __to)
 {
   __list2vector_info* __res = __get_object_info(__obj);
   if (__res)
     __res->__resize(__from, __to);
 }

 inline void __trace_list_to_vector_init()
 {
   _GLIBCXX_PROFILE_DATA(_S_list_to_vector) = new __trace_list_to_vector();
 }

 inline void __trace_list_to_vector_report(FILE* __f,
                                           __warning_vector_t& __warnings)
 {
   if (_GLIBCXX_PROFILE_DATA(_S_list_to_vector)) {
     _GLIBCXX_PROFILE_DATA(_S_list_to_vector)->__collect_warnings(__warnings);
     _GLIBCXX_PROFILE_DATA(_S_list_to_vector)->__write(__f);
   }
 }

 inline void __trace_list_to_vector_construct(const void* __obj)
 {
   if (!__profcxx_init()) return;

   _GLIBCXX_PROFILE_DATA(_S_list_to_vector)->__insert(__obj, __get_stack());
 }

 inline void __trace_list_to_vector_destruct(const void* __obj)
 {
   if (!__profcxx_init()) return;

   _GLIBCXX_PROFILE_DATA(_S_list_to_vector)->__destruct(__obj);
 }

 inline void __trace_list_to_vector_insert(const void* __obj,
                                           size_t __shift, size_t __size)
 {
   if (!__profcxx_init()) return;

   _GLIBCXX_PROFILE_DATA(_S_list_to_vector)->__opr_insert(__obj, __shift,
                                                          __size);
 }


 inline void __trace_list_to_vector_iterate(const void* __obj, size_t __num = 1)
 {
   if (!__profcxx_init()) return;

   _GLIBCXX_PROFILE_DATA(_S_list_to_vector)->__opr_iterate(__obj, __num);
 }

 inline void __trace_list_to_vector_invalid_operator(const void* __obj)
 {
   if (!__profcxx_init()) return;

   _GLIBCXX_PROFILE_DATA(_S_list_to_vector)->__invalid_operator(__obj);
 }

 inline void __trace_list_to_vector_resize(const void* __obj,
                                           size_t __from, size_t __to)
 {
   if (!__profcxx_init()) return;

   _GLIBCXX_PROFILE_DATA(_S_list_to_vector)->__resize(__obj, __from, __to);
 }

 } // namespace __gnu_profile
 #endif /* _GLIBCXX_PROFILE_PROFILER_LIST_TO_VECTOR_H__ */
	// -- C++ --
	//
	// Copyright (C) 2009, 2010 Free Software Foundation, Inc.
	//
	// This file is part of the GNU ISO C++ Library. This library 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 2, or (at your option) any later
	// version.

	// This library 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 this library; see the file COPYING. If not, write to
	// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
	// MA 02111-1307, USA.

	// As a special exception, you may use this file as part of a free
	// software library without restriction. Specifically, if other files
	// instantiate templates or use macros or inline functions from this
	// file, or you compile this file and link it with other files to
	// produce an executable, this file does not by itself cause the
	// resulting executable to be covered by the GNU General Public
	// License. This exception does not however invalidate any other
	// reasons why the executable file might be covered by the GNU General
	// Public License.

	/** @file profile/impl/profiler_list_to_vector.h
	* @brief diagnostics for list to vector.
	*/

	// Written by Changhee Jung.

	#ifndef _GLIBCXX_PROFILE_PROFILER_LIST_TO_VECTOR_H
	#define _GLIBCXX_PROFILE_PROFILER_LIST_TO_VECTOR_H 1

	#ifdef __GXX_EXPERIMENTAL_CXX0X__
	#include <cstdio>
	#include <cstdlib>
	#include <cstring>
	#else
	#include <stdio.h>
	#include <stdint.h>
	#include <string.h>
	#endif
	#include <string>
	#include <sstream>
	#include "profile/impl/profiler.h"
	#include "profile/impl/profiler_node.h"
	#include "profile/impl/profiler_trace.h"

	namespace __gnu_profile
	{

	/** @brief A list-to-vector instrumentation line in the object table. */
	class __list2vector_info: public __object_info_base
	{
	public:
	__list2vector_info()
	:_M_shift_count(0), _M_iterate(0), _M_resize(0), _M_list_cost(0),
	_M_vector_cost(0), _M_valid(true), _M_max_size(0) {}
	__list2vector_info(__stack_t __stack)
	: __object_info_base(__stack), _M_shift_count(0), _M_iterate(0),
	_M_resize(0), _M_list_cost(0), _M_vector_cost(0), _M_valid(true),
	_M_max_size(0) {}
	virtual ~__list2vector_info() {}
	__list2vector_info(const __list2vector_info& __o);
	void __merge(const __list2vector_info& __o);
	void __write(FILE* __f) const;
	float __magnitude() const { return _M_list_cost - _M_vector_cost; }
	const char* __advice() const;
	size_t __shift_count() { return _M_shift_count; }
	size_t __iterate() { return _M_iterate; }
	float __list_cost() { return _M_list_cost; }
	size_t __resize() { return _M_resize; }
	void __set_list_cost(float __lc) { _M_list_cost = __lc; }
	void __set_vector_cost(float __vc) { _M_vector_cost = __vc; }
	bool __is_valid() { return _M_valid; }
	void __set_invalid() { _M_valid = false; }

	void __opr_insert(size_t __shift, size_t __size);
	void __opr_iterate(size_t __num) { _M_iterate += __num;}

	void __resize(size_t __from, size_t __to);

	private:
	size_t _M_shift_count;
	size_t _M_iterate;
	size_t _M_resize;
	float _M_list_cost;
	float _M_vector_cost;
	bool _M_valid;
	size_t _M_max_size;
	};

	inline __list2vector_info::__list2vector_info(const __list2vector_info& __o)
	: __object_info_base(__o)
	{
	_M_shift_count = __o._M_shift_count;
	_M_iterate = __o._M_iterate;
	_M_vector_cost = __o._M_vector_cost;
	_M_list_cost = __o._M_list_cost;
	_M_valid = __o._M_valid;
	_M_resize = __o._M_resize;
	_M_max_size = __o._M_max_size;
	}

	inline const char* __list2vector_info::__advice() const {
	std::stringstream __sstream;
	__sstream
	<< "change std::list to std::vector and its initial size from 0 to "
	<< _M_max_size;
	return strdup(__sstream.str().c_str());
	}

	inline void __list2vector_info::__merge(const __list2vector_info& __o)
	{
	_M_shift_count += __o._M_shift_count;
	_M_iterate += __o._M_iterate;
	_M_vector_cost += __o._M_vector_cost;
	_M_list_cost += __o._M_list_cost;
	_M_valid &= __o._M_valid;
	_M_resize += __o._M_resize;
	_M_max_size = std::max( _M_max_size, __o._M_max_size);
	}

	inline void __list2vector_info::__opr_insert(size_t __shift, size_t __size)
	{
	_M_shift_count += __shift;
	_M_max_size = std::max(_M_max_size, __size);
	}

	inline void __list2vector_info::__resize(size_t __from, size_t __to)
	{
	_M_resize += __from;
	}

	class __list2vector_stack_info: public __list2vector_info {
	public:
	__list2vector_stack_info(const __list2vector_info& __o)
	: __list2vector_info(__o) {}
	};

	class __trace_list_to_vector
	: public __trace_base<__list2vector_info, __list2vector_stack_info>
	{
	public:
	__trace_list_to_vector();
	~__trace_list_to_vector() {}

	// Insert a new node at construct with object, callstack and initial size.
	void __insert(__object_t __obj, __stack_t __stack);
	// Call at destruction/clean to set container final size.
	void __destruct(const void* __obj);

	// Find the node in the live map.
	__list2vector_info* __find(const void* __obj);

	// Collect cost of operations.
	void __opr_insert(const void* __obj, size_t __shift, size_t __size);
	void __opr_iterate(const void* __obj, size_t __num);
	void __invalid_operator(const void* __obj);
	void __resize(const void* __obj, size_t __from, size_t __to);
	float __vector_cost(size_t __shift, size_t __iterate);
	float __list_cost(size_t __shift, size_t __iterate);
	};

	inline __trace_list_to_vector::__trace_list_to_vector()
	: __trace_base<__list2vector_info, __list2vector_stack_info>()
	{
	__id = "list-to-vector";
	}

	inline void __trace_list_to_vector::__insert(__object_t __obj,
	__stack_t __stack)
	{
	__add_object(__obj, __list2vector_info(__stack));
	}

	inline void __list2vector_info::__write(FILE* __f) const
	{
	fprintf(__f, "%Zu %Zu %Zu %.0f %.0f\n",
	_M_shift_count, _M_resize, _M_iterate, _M_vector_cost, _M_list_cost);
	}

	inline float __trace_list_to_vector::__vector_cost(size_t __shift,
	size_t __iterate)
	{
	// The resulting vector will use a 'reserve' method.
	return __shift * _GLIBCXX_PROFILE_DATA(__vector_shift_cost_factor).__value +
	__iterate * _GLIBCXX_PROFILE_DATA(__vector_iterate_cost_factor).__value;
	}

	inline float __trace_list_to_vector::__list_cost(size_t __shift,
	size_t __iterate)
	{
	return __shift * _GLIBCXX_PROFILE_DATA(__list_shift_cost_factor).__value +
	__iterate * _GLIBCXX_PROFILE_DATA(__list_iterate_cost_factor).__value;
	}

	inline void __trace_list_to_vector::__destruct(const void* __obj)
	{
	if (!__is_on())
	return;

	__list2vector_info* __res = __get_object_info(__obj);
	if (!__res)
	return;

	float __vc = __vector_cost(__res->__shift_count(), __res->__iterate());
	float __lc = __list_cost(__res->__shift_count(), __res->__iterate());
	__res->__set_vector_cost(__vc);
	__res->__set_list_cost(__lc);
	__retire_object(__obj);
	}

	inline void __trace_list_to_vector::__opr_insert(const void* __obj,
	size_t __shift, size_t __size)
	{
	__list2vector_info* __res = __get_object_info(__obj);
	if (__res)
	__res->__opr_insert(__shift, __size);
	}

	inline void __trace_list_to_vector::__opr_iterate(const void* __obj,
	size_t __num)
	{
	__list2vector_info* __res = __get_object_info(__obj);
	if (__res) {
	__res->__opr_iterate(__num);
	}
	}

	inline void __trace_list_to_vector::__invalid_operator(const void* __obj)
	{
	__list2vector_info* __res = __get_object_info(__obj);
	if (__res)
	__res->__set_invalid();
	}

	inline void __trace_list_to_vector::__resize(const void* __obj, size_t __from,
	size_t __to)
	{
	__list2vector_info* __res = __get_object_info(__obj);
	if (__res)
	__res->__resize(__from, __to);
	}

	inline void __trace_list_to_vector_init()
	{
	_GLIBCXX_PROFILE_DATA(_S_list_to_vector) = new __trace_list_to_vector();
	}

	inline void __trace_list_to_vector_report(FILE* __f,
	__warning_vector_t& __warnings)
	{
	if (_GLIBCXX_PROFILE_DATA(_S_list_to_vector)) {
	_GLIBCXX_PROFILE_DATA(_S_list_to_vector)->__collect_warnings(__warnings);
	_GLIBCXX_PROFILE_DATA(_S_list_to_vector)->__write(__f);
	}
	}

	inline void __trace_list_to_vector_construct(const void* __obj)
	{
	if (!__profcxx_init()) return;

	_GLIBCXX_PROFILE_DATA(_S_list_to_vector)->__insert(__obj, __get_stack());
	}

	inline void __trace_list_to_vector_destruct(const void* __obj)
	{
	if (!__profcxx_init()) return;

	_GLIBCXX_PROFILE_DATA(_S_list_to_vector)->__destruct(__obj);
	}

	inline void __trace_list_to_vector_insert(const void* __obj,
	size_t __shift, size_t __size)
	{
	if (!__profcxx_init()) return;

	_GLIBCXX_PROFILE_DATA(_S_list_to_vector)->__opr_insert(__obj, __shift,
	__size);
	}


	inline void __trace_list_to_vector_iterate(const void* __obj, size_t __num = 1)
	{
	if (!__profcxx_init()) return;

	_GLIBCXX_PROFILE_DATA(_S_list_to_vector)->__opr_iterate(__obj, __num);
	}

	inline void __trace_list_to_vector_invalid_operator(const void* __obj)
	{
	if (!__profcxx_init()) return;

	_GLIBCXX_PROFILE_DATA(_S_list_to_vector)->__invalid_operator(__obj);
	}

	inline void __trace_list_to_vector_resize(const void* __obj,
	size_t __from, size_t __to)
	{
	if (!__profcxx_init()) return;

	_GLIBCXX_PROFILE_DATA(_S_list_to_vector)->__resize(__obj, __from, __to);
	}

	} // namespace __gnu_profile
	#endif /* _GLIBCXX_PROFILE_PROFILER_LIST_TO_VECTOR_H__ */