HomeSort by relevance Sort by last modified time
    Searched full:fences (Results 1 - 25 of 291) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeonsi/
radeonsi_pipe.c 61 pipe_mutex_lock(rscreen->fences.mutex);
63 if (!rscreen->fences.bo) {
65 rscreen->fences.bo = si_resource_create_custom(&rscreen->screen,
68 if (!rscreen->fences.bo) {
72 rscreen->fences.data = rctx->ws->buffer_map(rscreen->fences.bo->cs_buf,
77 if (!LIST_IS_EMPTY(&rscreen->fences.pool)) {
81 LIST_FOR_EACH_ENTRY(entry, &rscreen->fences.pool, head) {
82 if (rscreen->fences.data[entry->index] != 0) {
95 if ((rscreen->fences.next_index + 1) >= 1024)
    [all...]
radeonsi_pipe.h 59 /* linked list of freed fences */
72 struct r600_pipe_fences fences; member in struct:r600_screen
106 struct r600_fence fences[FENCE_BLOCK_SIZE]; member in struct:r600_fence_block
  /external/mesa3d/src/gallium/drivers/radeonsi/
radeonsi_pipe.c 61 pipe_mutex_lock(rscreen->fences.mutex);
63 if (!rscreen->fences.bo) {
65 rscreen->fences.bo = si_resource_create_custom(&rscreen->screen,
68 if (!rscreen->fences.bo) {
72 rscreen->fences.data = rctx->ws->buffer_map(rscreen->fences.bo->cs_buf,
77 if (!LIST_IS_EMPTY(&rscreen->fences.pool)) {
81 LIST_FOR_EACH_ENTRY(entry, &rscreen->fences.pool, head) {
82 if (rscreen->fences.data[entry->index] != 0) {
95 if ((rscreen->fences.next_index + 1) >= 1024)
    [all...]
radeonsi_pipe.h 59 /* linked list of freed fences */
72 struct r600_pipe_fences fences; member in struct:r600_screen
106 struct r600_fence fences[FENCE_BLOCK_SIZE]; member in struct:r600_fence_block
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/
nouveau_mm.h 8 * them. This struct is linked with fences for delayed freeing of allocs.
  /external/mesa3d/src/gallium/drivers/nouveau/
nouveau_mm.h 8 * them. This struct is linked with fences for delayed freeing of allocs.
  /external/libcxx/test/atomics/atomics.fences/
Android.mk 17 test_makefile := external/libcxx/test/atomics/atomics.fences/Android.mk
19 test_name := atomics/atomics.fences/atomic_signal_fence
23 test_name := atomics/atomics.fences/atomic_thread_fence
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r600/
r600_pipe.c 44 pipe_mutex_lock(rscreen->fences.mutex);
46 if (!rscreen->fences.bo) {
48 rscreen->fences.bo = (struct r600_resource*)
51 if (!rscreen->fences.bo) {
55 rscreen->fences.data = rctx->ws->buffer_map(rscreen->fences.bo->cs_buf,
60 if (!LIST_IS_EMPTY(&rscreen->fences.pool)) {
64 LIST_FOR_EACH_ENTRY(entry, &rscreen->fences.pool, head) {
65 if (rscreen->fences.data[entry->index] != 0) {
78 if ((rscreen->fences.next_index + 1) >= 1024)
    [all...]
  /external/mesa3d/src/gallium/drivers/r600/
r600_pipe.c 44 pipe_mutex_lock(rscreen->fences.mutex);
46 if (!rscreen->fences.bo) {
48 rscreen->fences.bo = (struct r600_resource*)
51 if (!rscreen->fences.bo) {
55 rscreen->fences.data = rctx->ws->buffer_map(rscreen->fences.bo->cs_buf,
60 if (!LIST_IS_EMPTY(&rscreen->fences.pool)) {
64 LIST_FOR_EACH_ENTRY(entry, &rscreen->fences.pool, head) {
65 if (rscreen->fences.data[entry->index] != 0) {
78 if ((rscreen->fences.next_index + 1) >= 1024)
    [all...]
  /cts/suite/cts/deviceTests/opengl/jni/
Android.mk 23 # Needed in order to use fences for synchronization
  /external/chromium_org/third_party/mesa/src/src/gallium/winsys/i915/drm/
i915_drm_fence.c 8 * Because gem does not have fence's we have to create our own fences.
  /external/mesa3d/src/gallium/winsys/i915/drm/
i915_drm_fence.c 8 * Because gem does not have fence's we have to create our own fences.
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/
memory_order.hpp 31 // For leading fences one can use:
  /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/dri/common/
dri_drawable.c 288 * If the throttle queue is filled to the desired number of fences,
289 * pull fences off the queue until the number is less than the desired
290 * number of fences, and return the last fence pulled.
314 * push a fence onto the throttle queue and pull fences of the queue
315 * so that the desired number of fences are on the queue.
339 * pulls fences of the throttle queue until it is empty.
358 * number of fences on the throttling queue has reached the desired
  /external/mesa3d/src/gallium/state_trackers/dri/common/
dri_drawable.c 288 * If the throttle queue is filled to the desired number of fences,
289 * pull fences off the queue until the number is less than the desired
290 * number of fences, and return the last fence pulled.
314 * push a fence onto the throttle queue and pull fences of the queue
315 * so that the desired number of fences are on the queue.
339 * pulls fences of the throttle queue until it is empty.
358 * number of fences on the throttling queue has reached the desired
  /docs/source.android.com/src/devices/camera/
camera3_requests_methods.jd 54 provide sync fences to wait on. Multiple requests are expected to be in flight
59 waiting on and closing the buffers' fences and returning the buffer handles to
73 retain responsibility for the stream buffers' fences and the buffer handles;
74 the HAL should not close the fences or return these buffers with
  /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
math_semantic_tree.js 75 * E.g. a node of type FENCED can have the opening and closing fences here.
916 * 2. Neutral fences are matched only with neutral fences of the same shape.
917 * 3. For a collection of unmatched neutral fences we try to get a maximum
918 * number of matching fences. E.g. || a|b || would be turned into a fenced
919 * node with fences || and content a|b.
935 * into single nodes. It also processes singular fences, building expressions
937 * @param {!Array.<cvox.SemanticTree.Node>} fences FIFO queue of fence nodes.
939 * between fences.
940 * @param {!Array.<cvox.SemanticTree.Node>} openStack LIFO stack of open fences
    [all...]
math_semantic_attr.js 106 // Fences.
107 // Fences are treated slightly differently from other symbols as we want to
108 // record pairs of opening/closing and top/bottom fences.
110 * Mapping opening to closing fences.
130 // Extender fences.
139 * Mapping top to bottom fences.
172 /** Array of all fences.
175 this.fences = this.neutralFences.concat(
861 // Fences
    [all...]
  /frameworks/native/include/ui/
FrameStats.h 49 * case these are the times when the frame contents were completely rendered (i.e. their fences
  /external/chromium_org/gpu/command_buffer/service/
gpu_scheduler.h 96 // Polls the fences, invoking callbacks that were waiting to be triggered
97 // by them and returns whether all fences were complete.
144 // are issued to it before all these fences have been crossed by the GPU.
  /frameworks/av/services/camera/libcameraservice/device3/
StatusTracker.cpp 125 // Treat -1 as 'signalled', since HAL may not be using fences, and want
130 ALOGV_IF(!fencesDone, "%s: Fences still to wait on", __FUNCTION__);
157 // with timeout, need to check to account for fences that may still be
  /frameworks/native/services/surfaceflinger/
DispSync.h 28 // Ignore present (retire) fences if the device doesn't have support for the
77 // addResyncSample method, the timestamps of consecutive fences need not
165 // These member variables store information about the present fences used
FrameTracker.h 128 // valid and has all arrived (i.e. there are no oustanding fences).
138 // mNumFences is the total number of fences set in the frame records. It
143 // The number of fences is tracked so that the run time of processFences
  /libcore/luni/src/main/java/java/util/concurrent/atomic/
Fences.java 80 * return Fences.orderWrites(h);
97 * it may be possible to cope using more extensive sets of fences, or
112 * this.widget = Fences.orderWrites(w);
140 * return Fences.orderReads(c).data;
145 * c.data = Fences.orderWrites(newValue);
146 * Fences.orderAccesses(c);
196 * return Fences.orderReads(item);
200 * item = Fences.orderWrites(x);
251 * Fences.reachabilityFence(this);
285 * Fences.reachabilityFence(this)
    [all...]
  /frameworks/base/services/core/java/com/android/server/location/
GeofenceManager.java 158 // just remove matching fences
234 * The geofence update loop. This function removes expired fences, then tests the most
247 // Remove expired fences.
254 // Update all fences.
387 // Update the fences immediately before returning in

Completed in 1463 milliseconds

1 2 3 4 5 6 7 8 91011>>