OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * |
| 3 * Copyright 2015, Google Inc. |
| 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. |
| 31 * |
29 */ | 32 */ |
30 | 33 |
31 #ifndef WTF_SpinLock_h | 34 // Generates Ruby gRPC service interface out of Protobuf IDL. |
32 #define WTF_SpinLock_h | |
33 | 35 |
34 #include "wtf/Compiler.h" | |
35 #include "wtf/WTFExport.h" | |
36 #include <atomic> | |
37 #include <memory> | 36 #include <memory> |
38 #include <mutex> | |
39 | 37 |
40 // DESCRIPTION | 38 #include "src/compiler/config.h" |
41 // Spinlock is a simple spinlock class based on the standard CPU primitive of | 39 #include "src/compiler/ruby_generator.h" |
42 // atomic increment and decrement of an int at a given memory address. These are | 40 #include "src/compiler/ruby_generator_helpers-inl.h" |
43 // intended only for very short duration locks and assume a system with multiple | |
44 // cores. For any potentially longer wait you should be using a real lock. | |
45 | 41 |
46 namespace WTF { | 42 class RubyGrpcGenerator : public grpc::protobuf::compiler::CodeGenerator { |
| 43 public: |
| 44 RubyGrpcGenerator() {} |
| 45 ~RubyGrpcGenerator() {} |
47 | 46 |
48 class SpinLock { | 47 bool Generate(const grpc::protobuf::FileDescriptor *file, |
49 public: | 48 const grpc::string ¶meter, |
50 using Guard = std::lock_guard<SpinLock>; | 49 grpc::protobuf::compiler::GeneratorContext *context, |
51 | 50 grpc::string *error) const { |
52 ALWAYS_INLINE void lock() | 51 grpc::string code = grpc_ruby_generator::GetServices(file); |
53 { | 52 if (code.size() == 0) { |
54 static_assert(sizeof(m_lock) == sizeof(int), "int and m_lock are differe
nt sizes"); | 53 return true; // don't generate a file if there are no services |
55 if (LIKELY(!m_lock.exchange(true, std::memory_order_acquire))) | |
56 return; | |
57 lockSlow(); | |
58 } | 54 } |
59 | 55 |
60 ALWAYS_INLINE void unlock() | 56 // Get output file name. |
61 { | 57 grpc::string file_name; |
62 m_lock.store(false, std::memory_order_release); | 58 if (!grpc_ruby_generator::ServicesFilename(file, &file_name)) { |
| 59 return false; |
63 } | 60 } |
64 | 61 std::unique_ptr<grpc::protobuf::io::ZeroCopyOutputStream> output( |
65 private: | 62 context->Open(file_name)); |
66 // This is called if the initial attempt to acquire the lock fails. It's | 63 grpc::protobuf::io::CodedOutputStream coded_out(output.get()); |
67 // slower, but has a much better scheduling and power consumption behavior. | 64 coded_out.WriteRaw(code.data(), code.size()); |
68 WTF_EXPORT void lockSlow(); | 65 return true; |
69 | 66 } |
70 std::atomic_int m_lock; | |
71 }; | 67 }; |
72 | 68 |
73 | 69 int main(int argc, char *argv[]) { |
74 } // namespace WTF | 70 RubyGrpcGenerator generator; |
75 | 71 return grpc::protobuf::compiler::PluginMain(argc, argv, &generator); |
76 using WTF::SpinLock; | 72 } |
77 | |
78 #endif // WTF_SpinLock_h | |
OLD | NEW |