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 * Author: Chris Ruemmler | |
32 */ | 32 */ |
33 | 33 |
34 #ifndef BASE_AUXILIARY_SYNCHRONIZATION_PROFILING_H_ | 34 #include "test/core/util/parse_hexstring.h" |
35 #define BASE_AUXILIARY_SYNCHRONIZATION_PROFILING_H_ | 35 #include <grpc/support/log.h> |
36 | 36 |
37 #include "base/basictypes.h" | 37 gpr_slice parse_hexstring(const char *hexstring) { |
| 38 size_t nibbles = 0; |
| 39 const char *p = 0; |
| 40 uint8_t *out; |
| 41 uint8_t temp; |
| 42 gpr_slice slice; |
38 | 43 |
39 namespace base { | 44 for (p = hexstring; *p; p++) { |
| 45 nibbles += (*p >= '0' && *p <= '9') || (*p >= 'a' && *p <= 'f'); |
| 46 } |
40 | 47 |
41 // We can do contention-profiling of SpinLocks, but the code is in | 48 GPR_ASSERT((nibbles & 1) == 0); |
42 // mutex.cc, which is not always linked in with spinlock. Hence we | |
43 // provide a weak definition, which are used if mutex.cc isn't linked in. | |
44 | 49 |
45 // Submit the number of cycles the spinlock spent contending. | 50 slice = gpr_slice_malloc(nibbles / 2); |
46 ATTRIBUTE_WEAK extern void SubmitSpinLockProfileData(const void *, int64); | 51 out = GPR_SLICE_START_PTR(slice); |
47 extern void SubmitSpinLockProfileData(const void *contendedlock, | 52 |
48 int64 wait_cycles) {} | 53 nibbles = 0; |
| 54 temp = 0; |
| 55 for (p = hexstring; *p; p++) { |
| 56 if (*p >= '0' && *p <= '9') { |
| 57 temp = (uint8_t)(temp << 4) | (uint8_t)(*p - '0'); |
| 58 nibbles++; |
| 59 } else if (*p >= 'a' && *p <= 'f') { |
| 60 temp = (uint8_t)(temp << 4) | (uint8_t)(*p - 'a' + 10); |
| 61 nibbles++; |
| 62 } |
| 63 if (nibbles == 2) { |
| 64 *out++ = temp; |
| 65 nibbles = 0; |
| 66 } |
| 67 } |
| 68 |
| 69 return slice; |
49 } | 70 } |
50 #endif // BASE_AUXILIARY_SYNCHRONIZATION_PROFILING_H_ | |
OLD | NEW |