• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 // Protocol Buffers - Google's data interchange format
2 // Copyright 2008 Google Inc.  All rights reserved.
3 // https://developers.google.com/protocol-buffers/
4 //
5 // Redistribution and use in source and binary forms, with or without
6 // modification, are permitted provided that the following conditions are
7 // met:
8 //
9 //     * Redistributions of source code must retain the above copyright
10 // notice, this list of conditions and the following disclaimer.
11 //     * Redistributions in binary form must reproduce the above
12 // copyright notice, this list of conditions and the following disclaimer
13 // in the documentation and/or other materials provided with the
14 // distribution.
15 //     * Neither the name of Google Inc. nor the names of its
16 // contributors may be used to endorse or promote products derived from
17 // this software without specific prior written permission.
18 //
19 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
23 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
29 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 
31 // Author: rennie@google.com (Jeffrey Rennie)
32 
33 #ifndef GOOGLE_PROTOBUF_COMPILER_CPP_OPTIONS_H__
34 #define GOOGLE_PROTOBUF_COMPILER_CPP_OPTIONS_H__
35 
36 #include <set>
37 #include <string>
38 
39 namespace google {
40 namespace protobuf {
41 namespace compiler {
42 class AccessInfoMap;
43 
44 namespace cpp {
45 
46 enum class EnforceOptimizeMode {
47   kNoEnforcement,  // Use the runtime specified by the file specific options.
48   kSpeed,          // Full runtime with a generated code implementation.
49   kCodeSize,       // Full runtime with a reflective implementation.
50   kLiteRuntime,
51 };
52 
53 struct FieldListenerOptions {
54   bool inject_field_listener_events = false;
55   std::set<std::string> forbidden_field_listener_events;
56 };
57 
58 // Generator options (see generator.cc for a description of each):
59 struct Options {
60   const AccessInfoMap* access_info_map = nullptr;
61   std::string dllexport_decl;
62   std::string runtime_include_base;
63   std::string annotation_pragma_name;
64   std::string annotation_guard_name;
65   FieldListenerOptions field_listener_options;
66   EnforceOptimizeMode enforce_mode = EnforceOptimizeMode::kNoEnforcement;
67   enum {
68     kTCTableNever,
69     kTCTableGuarded,
70     kTCTableAlways
71   } tctable_mode = kTCTableNever;
72   int num_cc_files = 0;
73   bool safe_boundary_check = false;
74   bool proto_h = false;
75   bool transitive_pb_h = true;
76   bool annotate_headers = false;
77   bool lite_implicit_weak_fields = false;
78   bool bootstrap = false;
79   bool opensource_runtime = false;
80   bool annotate_accessor = false;
81   bool unused_field_stripping = false;
82   bool unverified_lazy_message_sets = true;
83   bool eagerly_verified_lazy = true;
84   bool profile_driven_inline_string = true;
85   bool force_split = false;
86 #ifdef PROTOBUF_STABLE_EXPERIMENTS
87   bool force_eagerly_verified_lazy = true;
88   bool force_inline_string = true;
89 #else   // PROTOBUF_STABLE_EXPERIMENTS
90   bool force_eagerly_verified_lazy = false;
91   bool force_inline_string = false;
92 #endif  // !PROTOBUF_STABLE_EXPERIMENTS
93 };
94 
95 }  // namespace cpp
96 }  // namespace compiler
97 }  // namespace protobuf
98 }  // namespace google
99 
100 #endif  // GOOGLE_PROTOBUF_COMPILER_CPP_OPTIONS_H__
101