ruby-prof 0.17.0 → 0.18.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (185) hide show
  1. checksums.yaml +5 -5
  2. data/CHANGES +500 -482
  3. data/LICENSE +24 -24
  4. data/README.rdoc +487 -485
  5. data/Rakefile +113 -113
  6. data/bin/ruby-prof +345 -345
  7. data/bin/ruby-prof-check-trace +45 -45
  8. data/examples/flat.txt +50 -50
  9. data/examples/graph.dot +84 -84
  10. data/examples/graph.html +823 -823
  11. data/examples/graph.txt +139 -139
  12. data/examples/multi.flat.txt +23 -23
  13. data/examples/multi.graph.html +760 -760
  14. data/examples/multi.grind.dat +114 -114
  15. data/examples/multi.stack.html +547 -547
  16. data/examples/stack.html +547 -547
  17. data/ext/ruby_prof/extconf.rb +68 -68
  18. data/ext/ruby_prof/rp_call_info.c +425 -425
  19. data/ext/ruby_prof/rp_call_info.h +53 -53
  20. data/ext/ruby_prof/rp_measure.c +40 -40
  21. data/ext/ruby_prof/rp_measure.h +45 -45
  22. data/ext/ruby_prof/rp_measure_allocations.c +76 -76
  23. data/ext/ruby_prof/rp_measure_cpu_time.c +136 -136
  24. data/ext/ruby_prof/rp_measure_gc_runs.c +73 -73
  25. data/ext/ruby_prof/rp_measure_gc_time.c +60 -60
  26. data/ext/ruby_prof/rp_measure_memory.c +77 -77
  27. data/ext/ruby_prof/rp_measure_process_time.c +71 -71
  28. data/ext/ruby_prof/rp_measure_wall_time.c +45 -45
  29. data/ext/ruby_prof/rp_method.c +630 -636
  30. data/ext/ruby_prof/rp_method.h +75 -75
  31. data/ext/ruby_prof/rp_stack.c +173 -173
  32. data/ext/ruby_prof/rp_stack.h +63 -63
  33. data/ext/ruby_prof/rp_thread.c +277 -276
  34. data/ext/ruby_prof/rp_thread.h +27 -27
  35. data/ext/ruby_prof/ruby_prof.c +794 -774
  36. data/ext/ruby_prof/ruby_prof.h +60 -59
  37. data/ext/ruby_prof/vc/ruby_prof.sln +20 -21
  38. data/ext/ruby_prof/vc/{ruby_prof_20.vcxproj → ruby_prof.vcxproj} +31 -0
  39. data/lib/ruby-prof.rb +68 -68
  40. data/lib/ruby-prof/aggregate_call_info.rb +76 -76
  41. data/lib/ruby-prof/assets/call_stack_printer.css.html +116 -116
  42. data/lib/ruby-prof/assets/call_stack_printer.js.html +384 -384
  43. data/lib/ruby-prof/call_info.rb +115 -115
  44. data/lib/ruby-prof/call_info_visitor.rb +40 -40
  45. data/lib/ruby-prof/compatibility.rb +179 -178
  46. data/lib/ruby-prof/method_info.rb +121 -121
  47. data/lib/ruby-prof/printers/abstract_printer.rb +104 -103
  48. data/lib/ruby-prof/printers/call_info_printer.rb +41 -41
  49. data/lib/ruby-prof/printers/call_stack_printer.rb +265 -265
  50. data/lib/ruby-prof/printers/call_tree_printer.rb +143 -143
  51. data/lib/ruby-prof/printers/dot_printer.rb +132 -132
  52. data/lib/ruby-prof/printers/flat_printer.rb +70 -70
  53. data/lib/ruby-prof/printers/flat_printer_with_line_numbers.rb +83 -83
  54. data/lib/ruby-prof/printers/graph_html_printer.rb +249 -249
  55. data/lib/ruby-prof/printers/graph_printer.rb +116 -116
  56. data/lib/ruby-prof/printers/multi_printer.rb +84 -84
  57. data/lib/ruby-prof/profile.rb +26 -26
  58. data/lib/ruby-prof/profile/exclude_common_methods.rb +207 -201
  59. data/lib/ruby-prof/profile/legacy_method_elimination.rb +50 -49
  60. data/lib/ruby-prof/rack.rb +174 -174
  61. data/lib/ruby-prof/task.rb +147 -147
  62. data/lib/ruby-prof/thread.rb +35 -35
  63. data/lib/ruby-prof/version.rb +3 -3
  64. data/lib/unprof.rb +10 -10
  65. data/ruby-prof.gemspec +58 -58
  66. data/test/abstract_printer_test.rb +53 -0
  67. data/test/aggregate_test.rb +136 -136
  68. data/test/basic_test.rb +128 -128
  69. data/test/block_test.rb +74 -74
  70. data/test/call_info_test.rb +78 -78
  71. data/test/call_info_visitor_test.rb +31 -31
  72. data/test/duplicate_names_test.rb +32 -32
  73. data/test/dynamic_method_test.rb +55 -55
  74. data/test/enumerable_test.rb +21 -21
  75. data/test/exceptions_test.rb +24 -16
  76. data/test/exclude_methods_test.rb +146 -146
  77. data/test/exclude_threads_test.rb +53 -53
  78. data/test/fiber_test.rb +79 -79
  79. data/test/issue137_test.rb +63 -63
  80. data/test/line_number_test.rb +80 -80
  81. data/test/measure_allocations_test.rb +26 -26
  82. data/test/measure_cpu_time_test.rb +212 -213
  83. data/test/measure_gc_runs_test.rb +32 -32
  84. data/test/measure_gc_time_test.rb +36 -36
  85. data/test/measure_memory_test.rb +33 -33
  86. data/test/measure_process_time_test.rb +61 -63
  87. data/test/measure_wall_time_test.rb +255 -255
  88. data/test/method_elimination_test.rb +84 -84
  89. data/test/module_test.rb +45 -45
  90. data/test/multi_printer_test.rb +104 -104
  91. data/test/no_method_class_test.rb +15 -15
  92. data/test/pause_resume_test.rb +166 -166
  93. data/test/prime.rb +54 -54
  94. data/test/printers_test.rb +275 -275
  95. data/test/printing_recursive_graph_test.rb +127 -127
  96. data/test/rack_test.rb +157 -157
  97. data/test/recursive_test.rb +215 -215
  98. data/test/singleton_test.rb +38 -38
  99. data/test/stack_printer_test.rb +77 -78
  100. data/test/stack_test.rb +138 -138
  101. data/test/start_stop_test.rb +112 -112
  102. data/test/test_helper.rb +267 -275
  103. data/test/thread_test.rb +187 -187
  104. data/test/unique_call_path_test.rb +202 -202
  105. data/test/yarv_test.rb +55 -55
  106. metadata +17 -96
  107. data/doc/LICENSE.html +0 -115
  108. data/doc/README_rdoc.html +0 -637
  109. data/doc/Rack.html +0 -96
  110. data/doc/Rack/RubyProf.html +0 -233
  111. data/doc/Rack/RubyProf/RackProfiler.html +0 -343
  112. data/doc/RubyProf.html +0 -974
  113. data/doc/RubyProf/AbstractPrinter.html +0 -625
  114. data/doc/RubyProf/AggregateCallInfo.html +0 -552
  115. data/doc/RubyProf/CallInfo.html +0 -579
  116. data/doc/RubyProf/CallInfoPrinter.html +0 -121
  117. data/doc/RubyProf/CallInfoVisitor.html +0 -199
  118. data/doc/RubyProf/CallStackPrinter.html +0 -1127
  119. data/doc/RubyProf/CallTreePrinter.html +0 -725
  120. data/doc/RubyProf/Cmd.html +0 -637
  121. data/doc/RubyProf/DeprecationWarnings.html +0 -148
  122. data/doc/RubyProf/DotPrinter.html +0 -258
  123. data/doc/RubyProf/FlatPrinter.html +0 -164
  124. data/doc/RubyProf/FlatPrinterWithLineNumbers.html +0 -210
  125. data/doc/RubyProf/GraphHtmlPrinter.html +0 -558
  126. data/doc/RubyProf/GraphPrinter.html +0 -140
  127. data/doc/RubyProf/MethodInfo.html +0 -676
  128. data/doc/RubyProf/MultiPrinter.html +0 -574
  129. data/doc/RubyProf/Profile.html +0 -908
  130. data/doc/RubyProf/Profile/ExcludeCommonMethods.html +0 -411
  131. data/doc/RubyProf/Profile/LegacyMethodElimination.html +0 -158
  132. data/doc/RubyProf/ProfileTask.html +0 -491
  133. data/doc/RubyProf/Thread.html +0 -275
  134. data/doc/created.rid +0 -33
  135. data/doc/css/fonts.css +0 -167
  136. data/doc/css/rdoc.css +0 -590
  137. data/doc/examples/flat_txt.html +0 -139
  138. data/doc/examples/graph_html.html +0 -910
  139. data/doc/examples/graph_txt.html +0 -248
  140. data/doc/fonts/Lato-Light.ttf +0 -0
  141. data/doc/fonts/Lato-LightItalic.ttf +0 -0
  142. data/doc/fonts/Lato-Regular.ttf +0 -0
  143. data/doc/fonts/Lato-RegularItalic.ttf +0 -0
  144. data/doc/fonts/SourceCodePro-Bold.ttf +0 -0
  145. data/doc/fonts/SourceCodePro-Regular.ttf +0 -0
  146. data/doc/images/add.png +0 -0
  147. data/doc/images/arrow_up.png +0 -0
  148. data/doc/images/brick.png +0 -0
  149. data/doc/images/brick_link.png +0 -0
  150. data/doc/images/bug.png +0 -0
  151. data/doc/images/bullet_black.png +0 -0
  152. data/doc/images/bullet_toggle_minus.png +0 -0
  153. data/doc/images/bullet_toggle_plus.png +0 -0
  154. data/doc/images/date.png +0 -0
  155. data/doc/images/delete.png +0 -0
  156. data/doc/images/find.png +0 -0
  157. data/doc/images/loadingAnimation.gif +0 -0
  158. data/doc/images/macFFBgHack.png +0 -0
  159. data/doc/images/package.png +0 -0
  160. data/doc/images/page_green.png +0 -0
  161. data/doc/images/page_white_text.png +0 -0
  162. data/doc/images/page_white_width.png +0 -0
  163. data/doc/images/plugin.png +0 -0
  164. data/doc/images/ruby.png +0 -0
  165. data/doc/images/tag_blue.png +0 -0
  166. data/doc/images/tag_green.png +0 -0
  167. data/doc/images/transparent.png +0 -0
  168. data/doc/images/wrench.png +0 -0
  169. data/doc/images/wrench_orange.png +0 -0
  170. data/doc/images/zoom.png +0 -0
  171. data/doc/index.html +0 -666
  172. data/doc/js/darkfish.js +0 -161
  173. data/doc/js/jquery.js +0 -4
  174. data/doc/js/navigation.js +0 -142
  175. data/doc/js/navigation.js.gz +0 -0
  176. data/doc/js/search.js +0 -109
  177. data/doc/js/search_index.js +0 -1
  178. data/doc/js/search_index.js.gz +0 -0
  179. data/doc/js/searcher.js +0 -229
  180. data/doc/js/searcher.js.gz +0 -0
  181. data/doc/table_of_contents.html +0 -1052
  182. data/examples/cachegrind.out.1 +0 -114
  183. data/examples/cachegrind.out.1.32313213 +0 -114
  184. data/ext/ruby_prof/vc/ruby_prof_18.vcxproj +0 -108
  185. data/ext/ruby_prof/vc/ruby_prof_19.vcxproj +0 -110
@@ -1,63 +1,63 @@
1
- /* Copyright (C) 2005-2013 Shugo Maeda <shugo@ruby-lang.org> and Charlie Savage <cfis@savagexi.com>
2
- Please see the LICENSE file for copyright and distribution information */
3
-
4
- #ifndef __RP_STACK__
5
- #define __RP_STACK__
6
-
7
- #include <ruby.h>
8
-
9
- #include "rp_measure.h"
10
- #include "rp_call_info.h"
11
-
12
-
13
- /* Temporary object that maintains profiling information
14
- for active methods. They are created and destroyed
15
- as the program moves up and down its stack. */
16
- typedef struct
17
- {
18
- /* Caching prof_method_t values significantly
19
- increases performance. */
20
- prof_call_info_t *call_info;
21
-
22
- unsigned int line;
23
- unsigned int passes; /* Count of "pass" frames, _after_ this one. */
24
-
25
- double start_time;
26
- double switch_time; /* Time at switch to different thread */
27
- double wait_time;
28
- double child_time;
29
- double pause_time; // Time pause() was initiated
30
- double dead_time; // Time to ignore (i.e. total amount of time between pause/resume blocks)
31
- } prof_frame_t;
32
-
33
- #define prof_frame_is_real(f) ((f)->passes == 0)
34
- #define prof_frame_is_pass(f) ((f)->passes > 0)
35
-
36
- #define prof_frame_is_paused(f) (f->pause_time >= 0)
37
- #define prof_frame_is_unpaused(f) (f->pause_time < 0)
38
-
39
- void prof_frame_pause(prof_frame_t*, double current_measurement);
40
- void prof_frame_unpause(prof_frame_t*, double current_measurement);
41
-
42
- /* Current stack of active methods.*/
43
- typedef struct
44
- {
45
- prof_frame_t *start;
46
- prof_frame_t *end;
47
- prof_frame_t *ptr;
48
- } prof_stack_t;
49
-
50
- prof_stack_t *prof_stack_create();
51
- void prof_stack_free(prof_stack_t *stack);
52
-
53
- prof_frame_t *prof_stack_push(prof_stack_t *stack, prof_call_info_t *call_info, double measurement, int paused);
54
- prof_frame_t *prof_stack_pop(prof_stack_t *stack, double measurement);
55
- prof_frame_t *prof_stack_pass(prof_stack_t *stack);
56
-
57
- static inline prof_frame_t *
58
- prof_stack_peek(prof_stack_t *stack) {
59
- return stack->ptr != stack->start ? stack->ptr - 1 : NULL;
60
- }
61
-
62
-
63
- #endif //__RP_STACK__
1
+ /* Copyright (C) 2005-2019 Shugo Maeda <shugo@ruby-lang.org> and Charlie Savage <cfis@savagexi.com>
2
+ Please see the LICENSE file for copyright and distribution information */
3
+
4
+ #ifndef __RP_STACK__
5
+ #define __RP_STACK__
6
+
7
+ #include <ruby.h>
8
+
9
+ #include "rp_measure.h"
10
+ #include "rp_call_info.h"
11
+
12
+
13
+ /* Temporary object that maintains profiling information
14
+ for active methods. They are created and destroyed
15
+ as the program moves up and down its stack. */
16
+ typedef struct
17
+ {
18
+ /* Caching prof_method_t values significantly
19
+ increases performance. */
20
+ prof_call_info_t *call_info;
21
+
22
+ unsigned int line;
23
+ unsigned int passes; /* Count of "pass" frames, _after_ this one. */
24
+
25
+ double start_time;
26
+ double switch_time; /* Time at switch to different thread */
27
+ double wait_time;
28
+ double child_time;
29
+ double pause_time; // Time pause() was initiated
30
+ double dead_time; // Time to ignore (i.e. total amount of time between pause/resume blocks)
31
+ } prof_frame_t;
32
+
33
+ #define prof_frame_is_real(f) ((f)->passes == 0)
34
+ #define prof_frame_is_pass(f) ((f)->passes > 0)
35
+
36
+ #define prof_frame_is_paused(f) (f->pause_time >= 0)
37
+ #define prof_frame_is_unpaused(f) (f->pause_time < 0)
38
+
39
+ void prof_frame_pause(prof_frame_t*, double current_measurement);
40
+ void prof_frame_unpause(prof_frame_t*, double current_measurement);
41
+
42
+ /* Current stack of active methods.*/
43
+ typedef struct
44
+ {
45
+ prof_frame_t *start;
46
+ prof_frame_t *end;
47
+ prof_frame_t *ptr;
48
+ } prof_stack_t;
49
+
50
+ prof_stack_t *prof_stack_create();
51
+ void prof_stack_free(prof_stack_t *stack);
52
+
53
+ prof_frame_t *prof_stack_push(prof_stack_t *stack, prof_call_info_t *call_info, double measurement, int paused);
54
+ prof_frame_t *prof_stack_pop(prof_stack_t *stack, double measurement);
55
+ prof_frame_t *prof_stack_pass(prof_stack_t *stack);
56
+
57
+ static inline prof_frame_t *
58
+ prof_stack_peek(prof_stack_t *stack) {
59
+ return stack->ptr != stack->start ? stack->ptr - 1 : NULL;
60
+ }
61
+
62
+
63
+ #endif //__RP_STACK__
@@ -1,276 +1,277 @@
1
- /* Copyright (C) 2005-2013 Shugo Maeda <shugo@ruby-lang.org> and Charlie Savage <cfis@savagexi.com>
2
- Please see the LICENSE file for copyright and distribution information */
3
-
4
- #include "ruby_prof.h"
5
-
6
- VALUE cRpThread;
7
-
8
- /* ====== thread_data_t ====== */
9
- thread_data_t*
10
- thread_data_create()
11
- {
12
- thread_data_t* result = ALLOC(thread_data_t);
13
- result->stack = prof_stack_create();
14
- result->method_table = method_table_create();
15
- result->object = Qnil;
16
- result->methods = Qnil;
17
- return result;
18
- }
19
-
20
- /* The underlying c structures are freed when the parent profile is freed.
21
- However, on shutdown the Ruby GC frees objects in any will-nilly order.
22
- That means the ruby thread object wrapping the c thread struct may
23
- be freed before the parent profile. Thus we add in a free function
24
- for the garbage collector so that if it does get called will nil
25
- out our Ruby object reference.*/
26
- static void
27
- thread_data_ruby_gc_free(thread_data_t* thread_data)
28
- {
29
- /* Has this thread object been accessed by Ruby? If
30
- yes clean it up so to avoid a segmentation fault. */
31
- if (thread_data->object != Qnil)
32
- {
33
- RDATA(thread_data->object)->data = NULL;
34
- RDATA(thread_data->object)->dfree = NULL;
35
- RDATA(thread_data->object)->dmark = NULL;
36
- }
37
- thread_data->object = Qnil;
38
- }
39
-
40
- static void
41
- thread_data_free(thread_data_t* thread_data)
42
- {
43
- thread_data_ruby_gc_free(thread_data);
44
- method_table_free(thread_data->method_table);
45
- prof_stack_free(thread_data->stack);
46
-
47
- thread_data->thread_id = Qnil;
48
-
49
- xfree(thread_data);
50
- }
51
-
52
- static int
53
- mark_methods(st_data_t key, st_data_t value, st_data_t result)
54
- {
55
- prof_method_t *method = (prof_method_t *) value;
56
- prof_method_mark(method);
57
- return ST_CONTINUE;
58
- }
59
-
60
- void
61
- prof_thread_mark(thread_data_t *thread)
62
- {
63
- if (thread->object != Qnil)
64
- rb_gc_mark(thread->object);
65
-
66
- if (thread->methods != Qnil)
67
- rb_gc_mark(thread->methods);
68
-
69
- if (thread->thread_id != Qnil)
70
- rb_gc_mark(thread->thread_id);
71
-
72
- if (thread->fiber_id != Qnil)
73
- rb_gc_mark(thread->fiber_id);
74
-
75
- st_foreach(thread->method_table, mark_methods, 0);
76
- }
77
-
78
- VALUE
79
- prof_thread_wrap(thread_data_t *thread)
80
- {
81
- if (thread->object == Qnil) {
82
- thread->object = Data_Wrap_Struct(cRpThread, prof_thread_mark, thread_data_ruby_gc_free, thread);
83
- }
84
- return thread->object;
85
- }
86
-
87
- static thread_data_t*
88
- prof_get_thread(VALUE self)
89
- {
90
- /* Can't use Data_Get_Struct because that triggers the event hook
91
- ending up in endless recursion. */
92
- thread_data_t* result = DATA_PTR(self);
93
- if (!result)
94
- rb_raise(rb_eRuntimeError, "This RubyProf::Thread instance has already been freed, likely because its profile has been freed.");
95
-
96
- return result;
97
- }
98
-
99
- /* ====== Thread Table ====== */
100
- /* The thread table is hash keyed on ruby thread_id that stores instances
101
- of thread_data_t. */
102
-
103
- st_table *
104
- threads_table_create()
105
- {
106
- return st_init_numtable();
107
- }
108
-
109
- static int
110
- thread_table_free_iterator(st_data_t key, st_data_t value, st_data_t dummy)
111
- {
112
- thread_data_free((thread_data_t*)value);
113
- return ST_CONTINUE;
114
- }
115
-
116
- void
117
- threads_table_free(st_table *table)
118
- {
119
- st_foreach(table, thread_table_free_iterator, 0);
120
- st_free_table(table);
121
- }
122
-
123
- size_t
124
- threads_table_insert(prof_profile_t* profile, VALUE fiber, thread_data_t *thread_data)
125
- {
126
- /* Its too slow to key on the real thread id so just typecast thread instead. */
127
- return st_insert(profile->threads_tbl, (st_data_t) fiber, (st_data_t) thread_data);
128
- }
129
-
130
- thread_data_t *
131
- threads_table_lookup(prof_profile_t* profile, VALUE thread_id, VALUE fiber_id)
132
- {
133
- thread_data_t* result;
134
- st_data_t val;
135
-
136
- /* If we should merge fibers, we use the thread_id as key, otherwise the fiber id.
137
- None of this is perfect, as garbage collected fiber/thread might be reused again later.
138
- A real solution would require integration with the garbage collector.
139
- */
140
- VALUE key = profile->merge_fibers ? thread_id : fiber_id;
141
- if (st_lookup(profile->threads_tbl, (st_data_t) key, &val))
142
- {
143
- result = (thread_data_t *) val;
144
- }
145
- else
146
- {
147
- result = thread_data_create();
148
- result->thread_id = thread_id;
149
- /* We set fiber id to 0 in the merge fiber case. Real fibers never have id 0,
150
- so we can identify them later during printing.
151
- */
152
- result->fiber_id = profile->merge_fibers ? INT2FIX(0) : fiber_id;
153
- /* Insert the table */
154
- threads_table_insert(profile, key, result);
155
- }
156
- return result;
157
- }
158
-
159
- thread_data_t *
160
- switch_thread(void* prof, VALUE thread_id, VALUE fiber_id)
161
- {
162
- prof_profile_t* profile = (prof_profile_t*)prof;
163
- double measurement = profile->measurer->measure();
164
-
165
- /* Get new thread information. */
166
- thread_data_t *thread_data = threads_table_lookup(profile, thread_id, fiber_id);
167
-
168
- /* Get current frame for this thread */
169
- prof_frame_t *frame = prof_stack_peek(thread_data->stack);
170
-
171
- /* Update the time this thread waited for another thread */
172
- if (frame)
173
- {
174
- frame->wait_time += measurement - frame->switch_time;
175
- frame->switch_time = measurement;
176
- }
177
-
178
- /* Save on the last thread the time of the context switch
179
- and reset this thread's last context switch to 0.*/
180
- if (profile->last_thread_data)
181
- {
182
- prof_frame_t *last_frame = prof_stack_peek(profile->last_thread_data->stack);
183
- if (last_frame)
184
- last_frame->switch_time = measurement;
185
- }
186
-
187
- profile->last_thread_data = thread_data;
188
- return thread_data;
189
- }
190
-
191
- int pause_thread(st_data_t key, st_data_t value, st_data_t data)
192
- {
193
- thread_data_t* thread_data = (thread_data_t *) value;
194
- prof_profile_t* profile = (prof_profile_t*)data;
195
-
196
- prof_frame_t* frame = prof_stack_peek(thread_data->stack);
197
- prof_frame_pause(frame, profile->measurement_at_pause_resume);
198
-
199
- return ST_CONTINUE;
200
- }
201
-
202
- int unpause_thread(st_data_t key, st_data_t value, st_data_t data)
203
- {
204
- thread_data_t* thread_data = (thread_data_t *) value;
205
- prof_profile_t* profile = (prof_profile_t*)data;
206
-
207
- prof_frame_t* frame = prof_stack_peek(thread_data->stack);
208
- prof_frame_unpause(frame, profile->measurement_at_pause_resume);
209
-
210
- return ST_CONTINUE;
211
- }
212
-
213
- static int
214
- collect_methods(st_data_t key, st_data_t value, st_data_t result)
215
- {
216
- /* Called for each method stored in a thread's method table.
217
- We want to store the method info information into an array.*/
218
- VALUE methods = (VALUE) result;
219
- prof_method_t *method = (prof_method_t *) value;
220
-
221
- if (!method->excluded) {
222
- rb_ary_push(methods, prof_method_wrap(method));
223
- }
224
-
225
- return ST_CONTINUE;
226
- }
227
-
228
-
229
- /* call-seq:
230
- id -> number
231
-
232
- Returns the id of this thread. */
233
- static VALUE
234
- prof_thread_id(VALUE self)
235
- {
236
- thread_data_t* thread = prof_get_thread(self);
237
- return thread->thread_id;
238
- }
239
-
240
- /* call-seq:
241
- fiber_id -> number
242
-
243
- Returns the fiber id of this thread. */
244
- static VALUE
245
- prof_fiber_id(VALUE self)
246
- {
247
- thread_data_t* thread = prof_get_thread(self);
248
- return thread->fiber_id;
249
- }
250
-
251
- /* call-seq:
252
- methods -> Array of MethodInfo
253
-
254
- Returns an array of methods that were called from this
255
- thread during program execution. */
256
- static VALUE
257
- prof_thread_methods(VALUE self)
258
- {
259
- thread_data_t* thread = prof_get_thread(self);
260
- if (thread->methods == Qnil)
261
- {
262
- thread->methods = rb_ary_new();
263
- st_foreach(thread->method_table, collect_methods, thread->methods);
264
- }
265
- return thread->methods;
266
- }
267
-
268
- void rp_init_thread()
269
- {
270
- cRpThread = rb_define_class_under(mProf, "Thread", rb_cObject);
271
- rb_undef_method(CLASS_OF(cRpThread), "new");
272
-
273
- rb_define_method(cRpThread, "id", prof_thread_id, 0);
274
- rb_define_method(cRpThread, "fiber_id", prof_fiber_id, 0);
275
- rb_define_method(cRpThread, "methods", prof_thread_methods, 0);
276
- }
1
+ /* Copyright (C) 2005-2013 Shugo Maeda <shugo@ruby-lang.org> and Charlie Savage <cfis@savagexi.com>
2
+ Please see the LICENSE file for copyright and distribution information */
3
+
4
+ #include "ruby_prof.h"
5
+
6
+ VALUE cRpThread;
7
+
8
+ /* ====== thread_data_t ====== */
9
+ thread_data_t*
10
+ thread_data_create()
11
+ {
12
+ thread_data_t* result = ALLOC(thread_data_t);
13
+ result->stack = prof_stack_create();
14
+ result->method_table = method_table_create();
15
+ result->object = Qnil;
16
+ result->methods = Qnil;
17
+ return result;
18
+ }
19
+
20
+ /* The underlying c structures are freed when the parent profile is freed.
21
+ However, on shutdown the Ruby GC frees objects in any will-nilly order.
22
+ That means the ruby thread object wrapping the c thread struct may
23
+ be freed before the parent profile. Thus we add in a free function
24
+ for the garbage collector so that if it does get called will nil
25
+ out our Ruby object reference.*/
26
+ static void
27
+ thread_data_ruby_gc_free(thread_data_t* thread_data)
28
+ {
29
+ /* Has this thread object been accessed by Ruby? If
30
+ yes clean it up so to avoid a segmentation fault. */
31
+ if (thread_data->object != Qnil)
32
+ {
33
+ RDATA(thread_data->object)->data = NULL;
34
+ RDATA(thread_data->object)->dfree = NULL;
35
+ RDATA(thread_data->object)->dmark = NULL;
36
+ }
37
+ thread_data->object = Qnil;
38
+ }
39
+
40
+ static void
41
+ thread_data_free(thread_data_t* thread_data)
42
+ {
43
+ thread_data_ruby_gc_free(thread_data);
44
+ method_table_free(thread_data->method_table);
45
+ prof_stack_free(thread_data->stack);
46
+
47
+ thread_data->thread_id = Qnil;
48
+
49
+ xfree(thread_data);
50
+ }
51
+
52
+ static int
53
+ mark_methods(st_data_t key, st_data_t value, st_data_t result)
54
+ {
55
+ prof_method_t *method = (prof_method_t *) value;
56
+ prof_method_mark(method);
57
+ return ST_CONTINUE;
58
+ }
59
+
60
+ void
61
+ prof_thread_mark(thread_data_t *thread)
62
+ {
63
+ if (thread->object != Qnil)
64
+ rb_gc_mark(thread->object);
65
+
66
+ if (thread->methods != Qnil)
67
+ rb_gc_mark(thread->methods);
68
+
69
+ if (thread->thread_id != Qnil)
70
+ rb_gc_mark(thread->thread_id);
71
+
72
+ if (thread->fiber_id != Qnil)
73
+ rb_gc_mark(thread->fiber_id);
74
+
75
+ st_foreach(thread->method_table, mark_methods, 0);
76
+ }
77
+
78
+ VALUE
79
+ prof_thread_wrap(thread_data_t *thread)
80
+ {
81
+ if (thread->object == Qnil) {
82
+ thread->object = Data_Wrap_Struct(cRpThread, prof_thread_mark, thread_data_ruby_gc_free, thread);
83
+ }
84
+ return thread->object;
85
+ }
86
+
87
+ static thread_data_t*
88
+ prof_get_thread(VALUE self)
89
+ {
90
+ /* Can't use Data_Get_Struct because that triggers the event hook
91
+ ending up in endless recursion. */
92
+ thread_data_t* result = DATA_PTR(self);
93
+ if (!result)
94
+ rb_raise(rb_eRuntimeError, "This RubyProf::Thread instance has already been freed, likely because its profile has been freed.");
95
+
96
+ return result;
97
+ }
98
+
99
+ /* ====== Thread Table ====== */
100
+ /* The thread table is hash keyed on ruby thread_id that stores instances
101
+ of thread_data_t. */
102
+
103
+ st_table *
104
+ threads_table_create()
105
+ {
106
+ return st_init_numtable();
107
+ }
108
+
109
+ static int
110
+ thread_table_free_iterator(st_data_t key, st_data_t value, st_data_t dummy)
111
+ {
112
+ thread_data_free((thread_data_t*)value);
113
+ return ST_CONTINUE;
114
+ }
115
+
116
+ void
117
+ threads_table_free(st_table *table)
118
+ {
119
+ st_foreach(table, thread_table_free_iterator, 0);
120
+ st_free_table(table);
121
+ }
122
+
123
+ size_t
124
+ threads_table_insert(prof_profile_t* profile, VALUE key, thread_data_t *thread_data)
125
+ {
126
+ unsigned LONG_LONG key_value = NUM2ULL(key);
127
+ return st_insert(profile->threads_tbl, key_value, (st_data_t) thread_data);
128
+ }
129
+
130
+ thread_data_t *
131
+ threads_table_lookup(prof_profile_t* profile, VALUE thread_id, VALUE fiber_id)
132
+ {
133
+ thread_data_t* result;
134
+ st_data_t val;
135
+
136
+ /* If we should merge fibers, we use the thread_id as key, otherwise the fiber id.
137
+ None of this is perfect, as garbage collected fiber/thread might be reused again later.
138
+ A real solution would require integration with the garbage collector.
139
+ */
140
+ VALUE key = profile->merge_fibers ? thread_id : fiber_id;
141
+ unsigned LONG_LONG key_value = NUM2ULL(key);
142
+ if (st_lookup(profile->threads_tbl, key_value, &val))
143
+ {
144
+ result = (thread_data_t *) val;
145
+ }
146
+ else
147
+ {
148
+ result = thread_data_create();
149
+ result->thread_id = thread_id;
150
+ /* We set fiber id to 0 in the merge fiber case. Real fibers never have id 0,
151
+ so we can identify them later during printing.
152
+ */
153
+ result->fiber_id = profile->merge_fibers ? INT2FIX(0) : fiber_id;
154
+ /* Insert the table */
155
+ threads_table_insert(profile, key, result);
156
+ }
157
+ return result;
158
+ }
159
+
160
+ thread_data_t *
161
+ switch_thread(void* prof, VALUE thread_id, VALUE fiber_id)
162
+ {
163
+ prof_profile_t* profile = (prof_profile_t*)prof;
164
+ double measurement = profile->measurer->measure();
165
+
166
+ /* Get new thread information. */
167
+ thread_data_t *thread_data = threads_table_lookup(profile, thread_id, fiber_id);
168
+
169
+ /* Get current frame for this thread */
170
+ prof_frame_t *frame = prof_stack_peek(thread_data->stack);
171
+
172
+ /* Update the time this thread waited for another thread */
173
+ if (frame)
174
+ {
175
+ frame->wait_time += measurement - frame->switch_time;
176
+ frame->switch_time = measurement;
177
+ }
178
+
179
+ /* Save on the last thread the time of the context switch
180
+ and reset this thread's last context switch to 0.*/
181
+ if (profile->last_thread_data)
182
+ {
183
+ prof_frame_t *last_frame = prof_stack_peek(profile->last_thread_data->stack);
184
+ if (last_frame)
185
+ last_frame->switch_time = measurement;
186
+ }
187
+
188
+ profile->last_thread_data = thread_data;
189
+ return thread_data;
190
+ }
191
+
192
+ int pause_thread(st_data_t key, st_data_t value, st_data_t data)
193
+ {
194
+ thread_data_t* thread_data = (thread_data_t *) value;
195
+ prof_profile_t* profile = (prof_profile_t*)data;
196
+
197
+ prof_frame_t* frame = prof_stack_peek(thread_data->stack);
198
+ prof_frame_pause(frame, profile->measurement_at_pause_resume);
199
+
200
+ return ST_CONTINUE;
201
+ }
202
+
203
+ int unpause_thread(st_data_t key, st_data_t value, st_data_t data)
204
+ {
205
+ thread_data_t* thread_data = (thread_data_t *) value;
206
+ prof_profile_t* profile = (prof_profile_t*)data;
207
+
208
+ prof_frame_t* frame = prof_stack_peek(thread_data->stack);
209
+ prof_frame_unpause(frame, profile->measurement_at_pause_resume);
210
+
211
+ return ST_CONTINUE;
212
+ }
213
+
214
+ static int
215
+ collect_methods(st_data_t key, st_data_t value, st_data_t result)
216
+ {
217
+ /* Called for each method stored in a thread's method table.
218
+ We want to store the method info information into an array.*/
219
+ VALUE methods = (VALUE) result;
220
+ prof_method_t *method = (prof_method_t *) value;
221
+
222
+ if (!method->excluded) {
223
+ rb_ary_push(methods, prof_method_wrap(method));
224
+ }
225
+
226
+ return ST_CONTINUE;
227
+ }
228
+
229
+
230
+ /* call-seq:
231
+ id -> number
232
+
233
+ Returns the id of this thread. */
234
+ static VALUE
235
+ prof_thread_id(VALUE self)
236
+ {
237
+ thread_data_t* thread = prof_get_thread(self);
238
+ return thread->thread_id;
239
+ }
240
+
241
+ /* call-seq:
242
+ fiber_id -> number
243
+
244
+ Returns the fiber id of this thread. */
245
+ static VALUE
246
+ prof_fiber_id(VALUE self)
247
+ {
248
+ thread_data_t* thread = prof_get_thread(self);
249
+ return thread->fiber_id;
250
+ }
251
+
252
+ /* call-seq:
253
+ methods -> Array of MethodInfo
254
+
255
+ Returns an array of methods that were called from this
256
+ thread during program execution. */
257
+ static VALUE
258
+ prof_thread_methods(VALUE self)
259
+ {
260
+ thread_data_t* thread = prof_get_thread(self);
261
+ if (thread->methods == Qnil)
262
+ {
263
+ thread->methods = rb_ary_new();
264
+ st_foreach(thread->method_table, collect_methods, thread->methods);
265
+ }
266
+ return thread->methods;
267
+ }
268
+
269
+ void rp_init_thread()
270
+ {
271
+ cRpThread = rb_define_class_under(mProf, "Thread", rb_cObject);
272
+ rb_undef_method(CLASS_OF(cRpThread), "new");
273
+
274
+ rb_define_method(cRpThread, "id", prof_thread_id, 0);
275
+ rb_define_method(cRpThread, "fiber_id", prof_fiber_id, 0);
276
+ rb_define_method(cRpThread, "methods", prof_thread_methods, 0);
277
+ }