OLD | NEW |
1 // Protocol Buffers - Google's data interchange format | 1 // Protocol Buffers - Google's data interchange format |
2 // Copyright 2008 Google Inc. All rights reserved. | 2 // Copyright 2008 Google Inc. All rights reserved. |
3 // https://developers.google.com/protocol-buffers/ | 3 // https://developers.google.com/protocol-buffers/ |
4 // | 4 // |
5 // Redistribution and use in source and binary forms, with or without | 5 // Redistribution and use in source and binary forms, with or without |
6 // modification, are permitted provided that the following conditions are | 6 // modification, are permitted provided that the following conditions are |
7 // met: | 7 // met: |
8 // | 8 // |
9 // * Redistributions of source code must retain the above copyright | 9 // * Redistributions of source code must retain the above copyright |
10 // notice, this list of conditions and the following disclaimer. | 10 // notice, this list of conditions and the following disclaimer. |
(...skipping 11 matching lines...) Expand all Loading... |
22 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 22 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
23 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 23 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
24 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 24 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
25 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 25 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
26 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 26 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
27 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 27 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
28 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 29 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
30 | 30 |
31 syntax = "proto3"; | 31 syntax = "proto3"; |
| 32 package benchmarks; |
| 33 option java_package = "com.google.protobuf.benchmarks"; |
32 | 34 |
33 package any_test; | 35 message BenchmarkDataset { |
| 36 // Name of the benchmark dataset. This should be unique across all datasets. |
| 37 // Should only contain word characters: [a-zA-Z0-9_] |
| 38 string name = 1; |
34 | 39 |
35 option java_package = "any_test"; | 40 // Fully-qualified name of the protobuf message for this dataset. |
36 option java_outer_classname = "AnyTestProto"; | 41 // It will be one of the messages defined benchmark_messages_proto2.proto |
| 42 // or benchmark_messages_proto3.proto. |
| 43 // |
| 44 // Implementations that do not support reflection can implement this with |
| 45 // an explicit "if/else" chain that lists every known message defined |
| 46 // in those files. |
| 47 string message_name = 2; |
37 | 48 |
38 import "google/protobuf/any.proto"; | 49 // The payload(s) for this dataset. They should be parsed or serialized |
39 | 50 // in sequence, in a loop, ie. |
40 message TestAny { | 51 // |
41 google.protobuf.Any value = 1; | 52 // while (!benchmarkDone) { // Benchmark runner decides when to exit. |
| 53 // for (i = 0; i < benchmark.payload.length; i++) { |
| 54 // parse(benchmark.payload[i]) |
| 55 // } |
| 56 // } |
| 57 // |
| 58 // This is intended to let datasets include a variety of data to provide |
| 59 // potentially more realistic results than just parsing the same message |
| 60 // over and over. A single message parsed repeatedly could yield unusually |
| 61 // good branch prediction performance. |
| 62 repeated bytes payload = 3; |
42 } | 63 } |
OLD | NEW |