1 /*
   2  * Copyright (c) 2003, 2011, Oracle and/or its affiliates. All rights reserved.
   3  *
   4  * Redistribution and use in source and binary forms, with or without
   5  * modification, are permitted provided that the following conditions
   6  * are met:
   7  *
   8  *   - Redistributions of source code must retain the above copyright
   9  *     notice, this list of conditions and the following disclaimer.
  10  *
  11  *   - Redistributions in binary form must reproduce the above copyright
  12  *     notice, this list of conditions and the following disclaimer in the
  13  *     documentation and/or other materials provided with the distribution.
  14  *
  15  *   - Neither the name of Oracle nor the names of its
  16  *     contributors may be used to endorse or promote products derived
  17  *     from this software without specific prior written permission.
  18  *
  19  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
  20  * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
  21  * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  22  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  23  * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
  24  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
  25  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
  26  * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
  27  * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
  28  * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  29  * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  30  */
  31 
  32 /*
  33  * This source code is provided to illustrate the usage of a given feature
  34  * or technique and has been deliberately simplified. Additional steps
  35  * required for a production-quality application, such as security checks,
  36  * input validation and proper error handling, might not be present in
  37  * this sample code.
  38  */
  39 
  40 
  41 #ifndef HPROF_TRACE_H
  42 #define HPROF_TRACE_H
  43 
  44 void         trace_increment_all_sample_costs(jint count, jthread *threads,
  45                         SerialNumber *thread_serial_nums, int depth,
  46                         jboolean skip_init);
  47 
  48 void         trace_get_all_current(jint count, jthread *threads,
  49                         SerialNumber *thread_serial_nums, int depth,
  50                         jboolean skip_init, TraceIndex *traces,
  51                         jboolean always_care);
  52 
  53 TraceIndex   trace_get_current(jthread thread,
  54                         SerialNumber thread_serial_num, int depth,
  55                         jboolean skip_init,
  56                         FrameIndex *frames_buffer,
  57                         jvmtiFrameInfo *jframes_buffer);
  58 
  59 void         trace_init(void);
  60 TraceIndex   trace_find_or_create(SerialNumber thread_serial_num,
  61                         jint n_frames, FrameIndex *frames,
  62                         jvmtiFrameInfo *jframes_buffer);
  63 SerialNumber trace_get_serial_number(TraceIndex index);
  64 void         trace_increment_cost(TraceIndex index,
  65                         jint num_hits, jlong self_cost, jlong total_cost);
  66 void         trace_list(void);
  67 void         trace_cleanup(void);
  68 
  69 void         trace_clear_cost(void);
  70 void         trace_output_unmarked(JNIEnv *env);
  71 void         trace_output_cost(JNIEnv *env, double cutoff);
  72 void         trace_output_cost_in_prof_format(JNIEnv *env);
  73 
  74 #endif