Protocol Buffers - Google's data interchange format (grpc依赖)
https://developers.google.com/protocol-buffers/
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
69 lines
2.2 KiB
69 lines
2.2 KiB
#!/usr/bin/python3 |
|
# |
|
# Protocol Buffers - Google's data interchange format |
|
# Copyright 2023 Google LLC. All rights reserved. |
|
# https://developers.google.com/protocol-buffers/ |
|
# |
|
# Redistribution and use in source and binary forms, with or without |
|
# modification, are permitted provided that the following conditions are |
|
# met: |
|
# |
|
# * Redistributions of source code must retain the above copyright |
|
# notice, this list of conditions and the following disclaimer. |
|
# * Redistributions in binary form must reproduce the above |
|
# copyright notice, this list of conditions and the following disclaimer |
|
# in the documentation and/or other materials provided with the |
|
# distribution. |
|
# * Neither the name of Google LLC nor the names of its |
|
# contributors may be used to endorse or promote products derived from |
|
# this software without specific prior written permission. |
|
# |
|
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
|
# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
|
# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
|
# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
|
# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
|
# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
|
|
import sys |
|
import re |
|
|
|
include = sys.argv[1] |
|
msg_basename = sys.argv[2] |
|
count = 1 |
|
|
|
m = re.search(r'(.*\D)(\d+)$', sys.argv[2]) |
|
if m: |
|
msg_basename = m.group(1) |
|
count = int(m.group(2)) |
|
|
|
print(''' |
|
#include "{include}" |
|
|
|
char buf[1]; |
|
|
|
int main() {{ |
|
'''.format(include=include)) |
|
|
|
def RefMessage(name): |
|
print(''' |
|
{{ |
|
{name} proto; |
|
proto.ParseFromArray(buf, 0); |
|
proto.SerializePartialToArray(&buf[0], 0); |
|
}} |
|
'''.format(name=name)) |
|
|
|
RefMessage(msg_basename) |
|
|
|
for i in range(2, count + 1): |
|
RefMessage(msg_basename + str(i)) |
|
|
|
print(''' |
|
return 0; |
|
}''')
|
|
|