1 // Protocol Buffers - Google's data interchange format
2 // Copyright 2023 Google LLC. All rights reserved.
3 //
4 // Use of this source code is governed by a BSD-style
5 // license that can be found in the LICENSE file or at
6 // https://developers.google.com/open-source/licenses/bsd
7
8 #include "google/protobuf/compiler/hpb/gen_utils.h"
9
10 #include <algorithm>
11 #include <string>
12 #include <vector>
13
14 #include "absl/strings/ascii.h"
15 #include "absl/strings/string_view.h"
16
17 namespace google::protobuf::hpb_generator {
18
19 namespace protobuf = ::proto2;
20
AddEnums(const protobuf::Descriptor * message,std::vector<const protobuf::EnumDescriptor * > * enums)21 void AddEnums(const protobuf::Descriptor* message,
22 std::vector<const protobuf::EnumDescriptor*>* enums) {
23 enums->reserve(enums->size() + message->enum_type_count());
24 for (int i = 0; i < message->enum_type_count(); i++) {
25 enums->push_back(message->enum_type(i));
26 }
27 for (int i = 0; i < message->nested_type_count(); i++) {
28 AddEnums(message->nested_type(i), enums);
29 }
30 }
31
SortedEnums(const protobuf::FileDescriptor * file)32 std::vector<const protobuf::EnumDescriptor*> SortedEnums(
33 const protobuf::FileDescriptor* file) {
34 std::vector<const protobuf::EnumDescriptor*> enums;
35 enums.reserve(file->enum_type_count());
36 for (int i = 0; i < file->enum_type_count(); i++) {
37 enums.push_back(file->enum_type(i));
38 }
39 for (int i = 0; i < file->message_type_count(); i++) {
40 AddEnums(file->message_type(i), &enums);
41 }
42 return enums;
43 }
44
AddMessages(const protobuf::Descriptor * message,std::vector<const protobuf::Descriptor * > * messages)45 void AddMessages(const protobuf::Descriptor* message,
46 std::vector<const protobuf::Descriptor*>* messages) {
47 messages->push_back(message);
48 for (int i = 0; i < message->nested_type_count(); i++) {
49 AddMessages(message->nested_type(i), messages);
50 }
51 }
52
SortedMessages(const protobuf::FileDescriptor * file)53 std::vector<const protobuf::Descriptor*> SortedMessages(
54 const protobuf::FileDescriptor* file) {
55 std::vector<const protobuf::Descriptor*> messages;
56 for (int i = 0; i < file->message_type_count(); i++) {
57 AddMessages(file->message_type(i), &messages);
58 }
59 return messages;
60 }
61
AddExtensionsFromMessage(const protobuf::Descriptor * message,std::vector<const protobuf::FieldDescriptor * > * exts)62 void AddExtensionsFromMessage(
63 const protobuf::Descriptor* message,
64 std::vector<const protobuf::FieldDescriptor*>* exts) {
65 for (int i = 0; i < message->extension_count(); i++) {
66 exts->push_back(message->extension(i));
67 }
68 for (int i = 0; i < message->nested_type_count(); i++) {
69 AddExtensionsFromMessage(message->nested_type(i), exts);
70 }
71 }
72
SortedExtensions(const protobuf::FileDescriptor * file)73 std::vector<const protobuf::FieldDescriptor*> SortedExtensions(
74 const protobuf::FileDescriptor* file) {
75 const int extension_count = file->extension_count();
76 const int message_type_count = file->message_type_count();
77
78 std::vector<const protobuf::FieldDescriptor*> ret;
79 ret.reserve(extension_count + message_type_count);
80
81 for (int i = 0; i < extension_count; i++) {
82 ret.push_back(file->extension(i));
83 }
84 for (int i = 0; i < message_type_count; i++) {
85 AddExtensionsFromMessage(file->message_type(i), &ret);
86 }
87
88 return ret;
89 }
90
FieldNumberOrder(const protobuf::Descriptor * message)91 std::vector<const protobuf::FieldDescriptor*> FieldNumberOrder(
92 const protobuf::Descriptor* message) {
93 std::vector<const protobuf::FieldDescriptor*> fields;
94 fields.reserve(message->field_count());
95 for (int i = 0; i < message->field_count(); i++) {
96 fields.push_back(message->field(i));
97 }
98 std::sort(fields.begin(), fields.end(),
99 [](const protobuf::FieldDescriptor* a,
100 const protobuf::FieldDescriptor* b) {
101 return a->number() < b->number();
102 });
103 return fields;
104 }
105
ToCamelCase(const absl::string_view input,bool lower_first)106 std::string ToCamelCase(const absl::string_view input, bool lower_first) {
107 bool capitalize_next = !lower_first;
108 std::string result;
109 result.reserve(input.size());
110
111 for (char character : input) {
112 if (character == '_') {
113 capitalize_next = true;
114 } else if (capitalize_next) {
115 result.push_back(absl::ascii_toupper(character));
116 capitalize_next = false;
117 } else {
118 result.push_back(character);
119 }
120 }
121
122 // Lower-case the first letter.
123 if (lower_first && !result.empty()) {
124 result[0] = absl::ascii_tolower(result[0]);
125 }
126
127 return result;
128 }
129
130 } // namespace protobuf
131 } // namespace google::hpb_generator
132