1 /**************************************************************************
3 * Copyright 2009 VMware, Inc.
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sub license, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
19 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
21 * IN NO EVENT SHALL VMWARE AND/OR ITS SUPPLIERS BE LIABLE FOR
22 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
23 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
24 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
26 **************************************************************************/
29 #include "pipe/p_screen.h"
30 #include "util/u_memory.h"
36 * Create a new fence object.
38 * The rank will be the number of bins in the scene. Whenever a rendering
39 * thread hits a fence command, it'll increment the fence counter. When
40 * the counter == the rank, the fence is finished.
42 * \param rank the expected finished value of the fence counter.
45 lp_fence_create(unsigned rank
)
48 struct lp_fence
*fence
= CALLOC_STRUCT(lp_fence
);
50 pipe_reference_init(&fence
->reference
, 1);
52 pipe_mutex_init(fence
->mutex
);
53 pipe_condvar_init(fence
->signalled
);
55 fence
->id
= fence_id
++;
58 if (LP_DEBUG
& DEBUG_FENCE
)
59 debug_printf("%s %d\n", __FUNCTION__
, fence
->id
);
65 /** Destroy a fence. Called when refcount hits zero. */
67 lp_fence_destroy(struct lp_fence
*fence
)
69 if (LP_DEBUG
& DEBUG_FENCE
)
70 debug_printf("%s %d\n", __FUNCTION__
, fence
->id
);
72 pipe_mutex_destroy(fence
->mutex
);
73 pipe_condvar_destroy(fence
->signalled
);
79 * Called by the rendering threads to increment the fence counter.
80 * When the counter == the rank, the fence is finished.
83 lp_fence_signal(struct lp_fence
*fence
)
85 if (LP_DEBUG
& DEBUG_FENCE
)
86 debug_printf("%s %d\n", __FUNCTION__
, fence
->id
);
88 pipe_mutex_lock(fence
->mutex
);
91 assert(fence
->count
<= fence
->rank
);
93 if (LP_DEBUG
& DEBUG_FENCE
)
94 debug_printf("%s count=%u rank=%u\n", __FUNCTION__
,
95 fence
->count
, fence
->rank
);
97 /* Wakeup all threads waiting on the mutex:
99 pipe_condvar_broadcast(fence
->signalled
);
101 pipe_mutex_unlock(fence
->mutex
);
105 lp_fence_signalled(struct lp_fence
*f
)
107 return f
->count
== f
->rank
;
111 lp_fence_wait(struct lp_fence
*f
)
113 if (LP_DEBUG
& DEBUG_FENCE
)
114 debug_printf("%s %d\n", __FUNCTION__
, f
->id
);
116 pipe_mutex_lock(f
->mutex
);
118 while (f
->count
< f
->rank
) {
119 pipe_condvar_wait(f
->signalled
, f
->mutex
);
121 pipe_mutex_unlock(f
->mutex
);