| OLD | NEW |
| 1 /* Copyright (c) 2010, Google Inc. | 1 /* |
| 2 * |
| 3 * Copyright 2015, Google Inc. |
| 2 * All rights reserved. | 4 * All rights reserved. |
| 3 * | 5 * |
| 4 * Redistribution and use in source and binary forms, with or without | 6 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions are | 7 * modification, are permitted provided that the following conditions are |
| 6 * met: | 8 * met: |
| 7 * | 9 * |
| 8 * * Redistributions of source code must retain the above copyright | 10 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 11 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above | 12 * * Redistributions in binary form must reproduce the above |
| 11 * copyright notice, this list of conditions and the following disclaimer | 13 * copyright notice, this list of conditions and the following disclaimer |
| 12 * in the documentation and/or other materials provided with the | 14 * in the documentation and/or other materials provided with the |
| 13 * distribution. | 15 * distribution. |
| 14 * * Neither the name of Google Inc. nor the names of its | 16 * * Neither the name of Google Inc. nor the names of its |
| 15 * contributors may be used to endorse or promote products derived from | 17 * contributors may be used to endorse or promote products derived from |
| 16 * this software without specific prior written permission. | 18 * this software without specific prior written permission. |
| 17 * | 19 * |
| 18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 21 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 23 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 24 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 25 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 26 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 27 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 30 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 * | 31 * |
| 30 * --- | |
| 31 * This file is an internal part spinlock.cc and once.cc | |
| 32 * It may not be used directly by code outside of //base. | |
| 33 */ | 32 */ |
| 34 | 33 |
| 35 #ifndef BASE_SPINLOCK_INTERNAL_H_ | 34 #ifndef GRPC_TEST_CORE_UTIL_SLICE_SPLITTER_H |
| 36 #define BASE_SPINLOCK_INTERNAL_H_ | 35 #define GRPC_TEST_CORE_UTIL_SLICE_SPLITTER_H |
| 37 | 36 |
| 38 #include <config.h> | 37 /* utility function to split/merge slices together to help create test |
| 39 #include "base/basictypes.h" | 38 cases */ |
| 40 #include "base/atomicops.h" | |
| 41 | 39 |
| 42 namespace base { | 40 #include <grpc/support/slice.h> |
| 43 namespace internal { | 41 #include <grpc/support/slice_buffer.h> |
| 44 | 42 |
| 45 // SpinLockWait() waits until it can perform one of several transitions from | 43 typedef enum { |
| 46 // "from" to "to". It returns when it performs a transition where done==true. | 44 /* merge all input slices into a single slice */ |
| 47 struct SpinLockWaitTransition { | 45 GRPC_SLICE_SPLIT_MERGE_ALL, |
| 48 int32 from; | 46 /* leave slices as is */ |
| 49 int32 to; | 47 GRPC_SLICE_SPLIT_IDENTITY, |
| 50 bool done; | 48 /* split slices into one byte chunks */ |
| 51 }; | 49 GRPC_SLICE_SPLIT_ONE_BYTE |
| 50 } grpc_slice_split_mode; |
| 52 | 51 |
| 53 // Wait until *w can transition from trans[i].from to trans[i].to for some i | 52 /* allocates *dst_slices; caller must unref all slices in dst_slices then free |
| 54 // satisfying 0<=i<n && trans[i].done, atomically make the transition, | 53 it */ |
| 55 // then return the old value of *w. Make any other atomic tranistions | 54 void grpc_split_slices(grpc_slice_split_mode mode, gpr_slice *src_slices, |
| 56 // where !trans[i].done, but continue waiting. | 55 size_t src_slice_count, gpr_slice **dst_slices, |
| 57 int32 SpinLockWait(volatile Atomic32 *w, int n, | 56 size_t *dst_slice_count); |
| 58 const SpinLockWaitTransition trans[]); | |
| 59 void SpinLockWake(volatile Atomic32 *w, bool all); | |
| 60 void SpinLockDelay(volatile Atomic32 *w, int32 value, int loop); | |
| 61 | 57 |
| 62 } // namespace internal | 58 void grpc_split_slices_to_buffer(grpc_slice_split_mode mode, |
| 63 } // namespace base | 59 gpr_slice *src_slices, size_t src_slice_count, |
| 64 #endif | 60 gpr_slice_buffer *dst); |
| 61 void grpc_split_slice_buffer(grpc_slice_split_mode mode, gpr_slice_buffer *src, |
| 62 gpr_slice_buffer *dst); |
| 63 |
| 64 gpr_slice grpc_slice_merge(gpr_slice *slices, size_t nslices); |
| 65 |
| 66 const char *grpc_slice_split_mode_name(grpc_slice_split_mode mode); |
| 67 |
| 68 #endif /* GRPC_TEST_CORE_UTIL_SLICE_SPLITTER_H */ |
| OLD | NEW |