-
Notifications
You must be signed in to change notification settings - Fork 70
Protobuf Validation & Conversion #691
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
jfallows
merged 6 commits into
aklivity:feature/schema-registry
from
ankitk-me:protobuf
Jan 10, 2024
Merged
Changes from 1 commit
Commits
Show all changes
6 commits
Select commit
Hold shift + click to select a range
ee6ae5f
Protobuf Validation & Conversion
ankitk-me e324ae8
Schema text to descriptor changes & Validation update
ankitk-me 682bb44
Descriptor tree & other validation changes
ankitk-me ef84156
json convertor changes and unit tests
ankitk-me a842df3
Flow optimisation, module-info changes & bug fixes
ankitk-me c10639f
Addressing review comments
ankitk-me File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Descriptor tree & other validation changes
- Loading branch information
commit 682bb4418a5206a0d5eca083d5fd54608de7f67c
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
151 changes: 151 additions & 0 deletions
151
...r-protobuf/src/main/java/io/aklivity/zilla/runtime/validator/protobuf/DescriptorTree.java
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,151 @@ | ||
| /* | ||
| * Copyright 2021-2023 Aklivity Inc | ||
| * | ||
| * Licensed under the Aklivity Community License (the "License"); you may not use | ||
| * this file except in compliance with the License. You may obtain a copy of the | ||
| * License at | ||
| * | ||
| * https://www.aklivity.io/aklivity-community-license/ | ||
| * | ||
| * Unless required by applicable law or agreed to in writing, software | ||
| * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT | ||
| * WARRANTIES OF ANY KIND, either express or implied. See the License for the | ||
| * specific language governing permissions and limitations under the License. | ||
| */ | ||
| package io.aklivity.zilla.runtime.validator.protobuf; | ||
|
|
||
| import java.util.LinkedHashMap; | ||
| import java.util.LinkedList; | ||
| import java.util.List; | ||
| import java.util.Map; | ||
|
|
||
| import com.google.protobuf.Descriptors; | ||
| import com.google.protobuf.Descriptors.Descriptor; | ||
| import com.google.protobuf.Descriptors.FileDescriptor; | ||
|
|
||
| public class DescriptorTree | ||
| { | ||
| protected final Map<String, DescriptorTree> children; | ||
| protected final List<Integer> indexes; | ||
|
|
||
| protected Descriptors.Descriptor descriptor; | ||
| protected String name; | ||
|
|
||
| private DescriptorTree() | ||
| { | ||
| this.children = new LinkedHashMap<>(); | ||
| this.indexes = new LinkedList<>(); | ||
| } | ||
|
|
||
| protected DescriptorTree( | ||
| FileDescriptor fileDescriptors) | ||
| { | ||
| this(); | ||
| this.name = fileDescriptors.getPackage(); | ||
| for (Descriptor descriptor : fileDescriptors.getMessageTypes()) | ||
| { | ||
| addDescriptor(descriptor); | ||
| addNestedDescriptors(descriptor); | ||
| } | ||
| } | ||
|
|
||
| protected DescriptorTree findByName( | ||
| String path) | ||
| { | ||
| DescriptorTree current = this; | ||
| int start = 0; | ||
| int end; | ||
|
|
||
| while (start < path.length()) | ||
| { | ||
| end = path.indexOf('.', start); | ||
| if (end == -1) | ||
| { | ||
| end = path.length(); | ||
| } | ||
|
|
||
| String part = path.substring(start, end); | ||
| current = current.children.get(part); | ||
|
|
||
| if (current == null) | ||
| { | ||
| break; | ||
| } | ||
| start = end + 1; | ||
| } | ||
| return current; | ||
| } | ||
|
|
||
| protected DescriptorTree findByIndexes( | ||
| List<Integer> indexes) | ||
| { | ||
| DescriptorTree current = this; | ||
|
|
||
| for (Integer index : indexes) | ||
| { | ||
| current = current.getChild(index); | ||
| if (current == null) | ||
| { | ||
| return null; | ||
| } | ||
| } | ||
| return current; | ||
| } | ||
|
|
||
| private DescriptorTree findParent( | ||
| String path) | ||
| { | ||
| int index = path.lastIndexOf('.'); | ||
| String part = index >= 0 ? path.substring(index + 1) : path; | ||
| return this.children.getOrDefault(part, null); | ||
| } | ||
|
|
||
| private DescriptorTree getChild( | ||
| int index) | ||
| { | ||
| DescriptorTree tree = this; | ||
| int currentIndex = 0; | ||
| for (Map.Entry<String, DescriptorTree> entry : children.entrySet()) | ||
| { | ||
| if (currentIndex == index) | ||
| { | ||
| tree = entry.getValue(); | ||
| break; | ||
| } | ||
| currentIndex++; | ||
| } | ||
| return tree; | ||
| } | ||
|
|
||
| private void addNestedDescriptor( | ||
| Descriptor parent, | ||
| int index) | ||
| { | ||
| DescriptorTree parentNode = findParent(parent.getFullName()); | ||
| if (parentNode != null) | ||
| { | ||
| Descriptors.Descriptor nestedDescriptor = parent.getNestedTypes().get(index); | ||
| parentNode.addDescriptor(nestedDescriptor); | ||
| parentNode.addNestedDescriptors(nestedDescriptor); | ||
| } | ||
| } | ||
|
|
||
| private void addDescriptor( | ||
| Descriptor descriptor) | ||
| { | ||
| DescriptorTree node = new DescriptorTree(); | ||
| node.descriptor = descriptor; | ||
| node.name = name; | ||
| node.indexes.addAll(this.indexes); | ||
| node.indexes.add(this.children.size()); | ||
| this.children.put(descriptor.getName(), node); | ||
| } | ||
|
|
||
| private void addNestedDescriptors(Descriptor descriptor) | ||
| { | ||
| for (int i = 0; i < descriptor.getNestedTypes().size(); i++) | ||
| { | ||
| addNestedDescriptor(descriptor, i); | ||
| } | ||
| } | ||
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
We typically use
exfor exception variables.