1 /* This file is part of the Linux Trace Toolkit viewer
2 * Copyright (C) 2003-2004 Michel Dagenais
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License Version 2 as
6 * published by the Free Software Foundation;
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 * GNU General Public License for more details.
13 * You should have received a copy of the GNU General Public License
14 * along with this program; if not, write to the Free Software
15 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
23 #include <lttv/hook.h>
24 #include <ltt/compiler.h>
26 typedef struct _LttvHookClosure
{
33 gint
lttv_hooks_prio_compare(LttvHookClosure
*a
, LttvHookClosure
*b
)
36 if(a
->prio
< b
->prio
) ret
= -1;
37 else if(a
->prio
> b
->prio
) ret
= 1;
42 LttvHooks
*lttv_hooks_new()
44 return g_array_new(FALSE
, FALSE
, sizeof(LttvHookClosure
));
48 void lttv_hooks_destroy(LttvHooks
*h
)
50 g_log(G_LOG_DOMAIN
, G_LOG_LEVEL_DEBUG
, "lttv_hooks_destroy()");
51 g_array_free(h
, TRUE
);
55 void lttv_hooks_add(LttvHooks
*h
, LttvHook f
, void *hook_data
, LttvHookPrio p
)
57 LttvHookClosure
*c
, new_c
;
60 if(unlikely(h
== NULL
))g_error("Null hook added");
63 new_c
.hook_data
= hook_data
;
67 /* Preliminary check for duplication */
68 /* only hook and hook data is checked */
69 for(i
= 0; i
< h
->len
; i
++) {
70 c
= &g_array_index(h
, LttvHookClosure
, i
);
71 if(new_c
.hook
== c
->hook
&& new_c
.hook_data
== c
->hook_data
) {
72 g_assert(new_c
.prio
== c
->prio
);
79 for(i
= 0; i
< h
->len
; i
++) {
80 c
= &g_array_index(h
, LttvHookClosure
, i
);
81 if(new_c
.prio
< c
->prio
) {
82 g_array_insert_val(h
,i
,new_c
);
87 g_array_append_val(h
,new_c
);
90 /* lttv_hooks_add_list
92 * Adds a sorted list into another sorted list.
94 * Note : h->len is modified, but only incremented. This assures
95 * its coherence through the function.
97 * j is an index to the element following the last one added in the
100 void lttv_hooks_add_list(LttvHooks
*h
, const LttvHooks
*list
)
104 const LttvHookClosure
*new_c
;
106 if(unlikely(list
== NULL
)) return;
108 for(i
= 0, j
= 0 ; i
< list
->len
; i
++) {
109 new_c
= &g_array_index(list
, LttvHookClosure
, i
);
110 gboolean found
=FALSE
;
112 /* Preliminary check for duplication */
113 /* only hook and hook data is checked, not priority */
114 for(k
= 0; k
< h
->len
; k
++) {
115 c
= &g_array_index(h
, LttvHookClosure
, k
);
116 if(new_c
->hook
== c
->hook
&& new_c
->hook_data
== c
->hook_data
) {
117 /* Found another identical entry : increment its ref_count and
118 * jump over the source index */
119 g_assert(new_c
->prio
== c
->prio
);
127 /* If not found, add it to the destination array */
129 c
= &g_array_index(h
, LttvHookClosure
, j
);
130 if(new_c
->prio
< c
->prio
) {
131 g_array_insert_val(h
,j
,*new_c
);
138 g_array_append_val(h
,*new_c
);
146 void *lttv_hooks_remove(LttvHooks
*h
, LttvHook f
)
154 for(i
= 0 ; i
< h
->len
; i
++) {
155 c
= &g_array_index(h
, LttvHookClosure
, i
);
157 if(c
->ref_count
== 1) {
158 hook_data
= c
->hook_data
;
159 lttv_hooks_remove_by_position(h
, i
);
162 g_assert(c
->ref_count
!= 0);
164 return NULL
; /* We do not want anyone to free a hook_data
173 void lttv_hooks_remove_data(LttvHooks
*h
, LttvHook f
, void *hook_data
)
179 for(i
= 0 ; i
< h
->len
; i
++) {
180 c
= &g_array_index(h
, LttvHookClosure
, i
);
181 if(c
->hook
== f
&& c
->hook_data
== hook_data
) {
182 if(c
->ref_count
== 1) {
183 lttv_hooks_remove_by_position(h
, i
);
186 g_assert(c
->ref_count
!= 0);
195 void lttv_hooks_remove_list(LttvHooks
*h
, LttvHooks
*list
)
199 LttvHookClosure
*c
, *c_list
;
201 if(list
== NULL
) return;
202 for(i
= 0, j
= 0 ; i
< h
->len
&& j
< list
->len
;) {
203 c
= &g_array_index(h
, LttvHookClosure
, i
);
204 c_list
= &g_array_index(list
, LttvHookClosure
, j
);
205 if(c
->hook
== c_list
->hook
&& c
->hook_data
== c_list
->hook_data
) {
206 if(c
->ref_count
== 1) {
207 lttv_hooks_remove_by_position(h
, i
);
209 g_assert(c
->ref_count
!= 0);
217 /* Normally the hooks in h are ordered as in list. If this is not the case,
220 if(unlikely(j
< list
->len
)) {
221 for(; j
< list
->len
; j
++) {
222 c_list
= &g_array_index(list
, LttvHookClosure
, j
);
223 lttv_hooks_remove_data(h
, c_list
->hook
, c_list
->hook_data
);
229 unsigned lttv_hooks_number(LttvHooks
*h
)
235 void lttv_hooks_get(LttvHooks
*h
, unsigned i
, LttvHook
*f
, void **hook_data
,
240 if(unlikely(i
>= h
->len
))
248 c
= &g_array_index(h
, LttvHookClosure
, i
);
250 *hook_data
= c
->hook_data
;
255 void lttv_hooks_remove_by_position(LttvHooks
*h
, unsigned i
)
257 g_array_remove_index(h
, i
);
260 gboolean
lttv_hooks_call(LttvHooks
*h
, void *call_data
)
262 gboolean ret
, sum_ret
= FALSE
;
268 if(likely(h
!= NULL
)) {
269 for(i
= 0 ; i
< h
->len
; i
++) {
270 c
= &g_array_index(h
, LttvHookClosure
, i
);
271 ret
= c
->hook(c
->hook_data
,call_data
);
272 sum_ret
= sum_ret
|| ret
;
279 gboolean
lttv_hooks_call_check(LttvHooks
*h
, void *call_data
)
285 for(i
= 0 ; i
< h
->len
; i
++) {
286 c
= &g_array_index(h
, LttvHookClosure
, i
);
287 if(unlikely(c
->hook(c
->hook_data
,call_data
))) return TRUE
;
292 /* Optimised for h1 == NULL, h2 != NULL. This is the case
293 * for optimised computation (with specific by id hooks, but
296 * The second case that should occur the most often is
297 * h1 != NULL , h2 == NULL.
299 gboolean
lttv_hooks_call_merge(LttvHooks
*h1
, void *call_data1
,
300 LttvHooks
*h2
, void *call_data2
)
302 gboolean ret
, sum_ret
= FALSE
;
304 LttvHookClosure
*c1
, *c2
;
308 if(unlikely(h1
!= NULL
)) {
309 if(unlikely(h2
!= NULL
)) {
310 for(i
= 0, j
= 0 ; i
< h1
->len
&& j
< h2
->len
;) {
311 c1
= &g_array_index(h1
, LttvHookClosure
, i
);
312 c2
= &g_array_index(h2
, LttvHookClosure
, j
);
313 if(c1
->prio
<= c2
->prio
) {
314 ret
= c1
->hook(c1
->hook_data
,call_data1
);
315 sum_ret
= sum_ret
|| ret
;
319 ret
= c2
->hook(c2
->hook_data
,call_data2
);
320 sum_ret
= sum_ret
|| ret
;
324 /* Finish the last list with hooks left */
325 for(;i
< h1
->len
; i
++) {
326 c1
= &g_array_index(h1
, LttvHookClosure
, i
);
327 ret
= c1
->hook(c1
->hook_data
,call_data1
);
328 sum_ret
= sum_ret
|| ret
;
330 for(;j
< h2
->len
; j
++) {
331 c2
= &g_array_index(h2
, LttvHookClosure
, j
);
332 ret
= c2
->hook(c2
->hook_data
,call_data2
);
333 sum_ret
= sum_ret
|| ret
;
335 } else { /* h1 != NULL && h2 == NULL */
336 for(i
= 0 ; i
< h1
->len
; i
++) {
337 c1
= &g_array_index(h1
, LttvHookClosure
, i
);
338 ret
= c1
->hook(c1
->hook_data
,call_data1
);
339 sum_ret
= sum_ret
|| ret
;
342 } else if(likely(h2
!= NULL
)) { /* h1 == NULL && h2 != NULL */
343 for(j
= 0 ; j
< h2
->len
; j
++) {
344 c2
= &g_array_index(h2
, LttvHookClosure
, j
);
345 ret
= c2
->hook(c2
->hook_data
,call_data2
);
346 sum_ret
= sum_ret
|| ret
;
353 gboolean
lttv_hooks_call_check_merge(LttvHooks
*h1
, void *call_data1
,
354 LttvHooks
*h2
, void *call_data2
)
356 LttvHookClosure
*c1
, *c2
;
360 if(unlikely(h1
!= NULL
)) {
361 if(unlikely(h2
!= NULL
)) {
362 for(i
= 0, j
= 0 ; i
< h1
->len
&& j
< h2
->len
;) {
363 c1
= &g_array_index(h1
, LttvHookClosure
, i
);
364 c2
= &g_array_index(h2
, LttvHookClosure
, j
);
365 if(c1
->prio
<= c2
->prio
) {
366 if(c1
->hook(c1
->hook_data
,call_data1
)) return TRUE
;
370 if(c2
->hook(c2
->hook_data
,call_data2
)) return TRUE
;
374 /* Finish the last list with hooks left */
375 for(;i
< h1
->len
; i
++) {
376 c1
= &g_array_index(h1
, LttvHookClosure
, i
);
377 if(c1
->hook(c1
->hook_data
,call_data1
)) return TRUE
;
379 for(;j
< h2
->len
; j
++) {
380 c2
= &g_array_index(h2
, LttvHookClosure
, j
);
381 if(c2
->hook(c2
->hook_data
,call_data2
)) return TRUE
;
383 } else { /* h2 == NULL && h1 != NULL */
384 for(i
= 0 ; i
< h1
->len
; i
++) {
385 c1
= &g_array_index(h1
, LttvHookClosure
, i
);
386 if(c1
->hook(c1
->hook_data
,call_data1
)) return TRUE
;
389 } else if(likely(h2
!= NULL
)) { /* h1 == NULL && h2 != NULL */
390 for(j
= 0 ; j
< h2
->len
; j
++) {
391 c2
= &g_array_index(h2
, LttvHookClosure
, j
);
392 if(c2
->hook(c2
->hook_data
,call_data2
)) return TRUE
;
401 LttvHooksById
*lttv_hooks_by_id_new()
403 return g_ptr_array_new();
407 void lttv_hooks_by_id_destroy(LttvHooksById
*h
)
411 for(i
= 0 ; i
< h
->len
; i
++) {
412 if(h
->pdata
[i
] != NULL
) lttv_hooks_destroy((LttvHooks
*)(h
->pdata
[i
]));
414 g_ptr_array_free(h
, TRUE
);
417 /* Optimised for searching an existing hook */
418 LttvHooks
*lttv_hooks_by_id_find(LttvHooksById
*h
, unsigned id
)
420 if(unlikely(h
->len
<= id
)) g_ptr_array_set_size(h
, id
+ 1);
421 if(unlikely(h
->pdata
[id
] == NULL
)) h
->pdata
[id
] = lttv_hooks_new();
426 unsigned lttv_hooks_by_id_max_id(LttvHooksById
*h
)
431 void lttv_hooks_by_id_remove(LttvHooksById
*h
, unsigned id
)
433 if(likely(id
< h
->len
&& h
->pdata
[id
] != NULL
)) {
434 lttv_hooks_destroy((LttvHooks
*)h
->pdata
[id
]);
This page took 0.078044 seconds and 5 git commands to generate.