diff --git a/cmd/server-test/only_pr_changes_test.go b/cmd/server-test/only_pr_changes_test.go new file mode 100644 index 00000000..7acc4a0f --- /dev/null +++ b/cmd/server-test/only_pr_changes_test.go @@ -0,0 +1,61 @@ +// +build integration + +package server_test + +import ( + "testing" + "time" + + fixtures "github.com/src-d/lookout-test-fixtures" + "gopkg.in/src-d/lookout-sdk.v0/pb" + + "github.com/stretchr/testify/suite" +) + +func TestReviewOnlyPrChangesIntegrationSuite(t *testing.T) { + suite.Run(t, new(reviewOnlyPrChangesIntegrationSuite)) +} + +type reviewOnlyPrChangesIntegrationSuite struct { + IntegrationSuite +} + +func (suite *reviewOnlyPrChangesIntegrationSuite) SetupTest() { + suite.ResetDB() + + suite.StoppableCtx() + suite.r, suite.w = suite.StartLookoutd(dummyConfigFile) + + suite.StartDummy("--files") + suite.GrepTrue(suite.r, `msg="connection state changed to 'READY'" addr="ipv4://localhost:9930" analyzer=Dummy`) +} + +func (suite *reviewOnlyPrChangesIntegrationSuite) TearDownTest() { + // TODO: for integration tests with RabbitMQ we wait a bit so the queue + // is depleted. Ideally this would be done with something similar to ResetDB + time.Sleep(5 * time.Second) + suite.Stop() +} + +func (suite *reviewOnlyPrChangesIntegrationSuite) TestAnalyzerErr() { + fixtures := fixtures.GetByName("get-changes-from-outdated-pr") + jsonReviewEvent := &jsonReviewEvent{ + ReviewEvent: &pb.ReviewEvent{ + InternalID: "1", + Number: 1, + CommitRevision: *fixtures.GetCommitRevision(), + }, + } + + expectedComments := []string{ + `{"analyzer-name":"Dummy","file":"javascript.js",`, + `status=success`, + } + notExpectedComments := []string{ + `{"analyzer-name":"Dummy","file":"golang.go",`, + } + + suite.sendEvent(jsonReviewEvent.String()) + suite.GrepAndNotAll(suite.r, expectedComments, notExpectedComments) +} + diff --git a/service/git/service.go b/service/git/service.go index ba3a2e52..d84edecd 100644 --- a/service/git/service.go +++ b/service/git/service.go @@ -8,6 +8,7 @@ import ( errors "gopkg.in/src-d/go-errors.v1" "gopkg.in/src-d/go-git.v4/plumbing/object" + "gopkg.in/src-d/go-git.v4" ) // Service implements data service interface on top of go-git @@ -50,6 +51,49 @@ func validateReferences(ctx context.Context, validateRefName bool, refs ...*look return nil } +func (r *Service) getFrom( + ctx context.Context, + base, head *lookout.ReferencePointer, +) ( + *lookout.ReferencePointer, error, +) { + commits, err := r.loader.LoadCommits(ctx, *base, *head) + if err != nil { + return nil, err + } + + var commonAncestor *object.Commit + res, err := git.MergeBase(commits[0], commits[1]) + if err != nil { + return nil, err + } + + if len(res) == 0 { + // If there is no common ancestor between two commits it means that they + // don't have a common history. That PR won't be able to be created in + // GitHub, but in other situations (ie. with lookout-sdk), an analyzer + // could be interested in analyzing the difference between both commints. + return base, nil + } + + commonAncestor = res[0] + + /* + // TODO(dpordomingo): uncomment this after testing that it's not a problem + // returning commits without ReferenceName (see comment below) + if base.Hash == commonAncestor.Hash.String() { + return base, nil + } + */ + + return &lookout.ReferencePointer{ + InternalRepositoryURL: base.InternalRepositoryURL, + // ReferenceName can be undefined for a random commit inside that repository + ReferenceName: "", + Hash: commonAncestor.Hash.String(), + }, nil +} + // GetChanges returns a ChangeScanner that scans all changes according to the request. func (r *Service) GetChanges(ctx context.Context, req *lookout.ChangesRequest) ( lookout.ChangeScanner, error) { @@ -58,7 +102,25 @@ func (r *Service) GetChanges(ctx context.Context, req *lookout.ChangesRequest) ( return nil, err } - base, head, err := r.loadTrees(ctx, req.Base, req.Head) + var from *lookout.ReferencePointer + + // The standard behavior for getting the changes between two commits is like doing + // `git diff base...head`, also `git diff $(git merge-base base head) head` + // (as it appears in `Changes` tab in GitHub PRs) + // If it is desired to get all changes between `base` and `head`, + // (as done by `git diff base..head`) it must be sent `req.TwoDotsMode` as true + if req.TwoDotsMode { + from = req.Base + } else { + if req.Base != nil { + from, err = r.getFrom(ctx, req.Base, req.Head) + if err != nil { + return nil, err + } + } + } + + base, head, err := r.loadTrees(ctx, from, req.Head) if err != nil { return nil, err } @@ -111,8 +173,6 @@ func (r *Service) GetFiles(ctx context.Context, req *lookout.FilesRequest) ( return scanner, nil } -const maxResolveLength = 20 - func (r *Service) loadTrees(ctx context.Context, base, head *lookout.ReferencePointer) (*object.Tree, *object.Tree, error) { diff --git a/vendor/gopkg.in/src-d/go-git-fixtures.v3/data/git-26baa505b9f6fb2024b9999c140b75514718c988.tgz b/vendor/gopkg.in/src-d/go-git-fixtures.v3/data/git-26baa505b9f6fb2024b9999c140b75514718c988.tgz new file mode 100644 index 00000000..28daa331 Binary files /dev/null and b/vendor/gopkg.in/src-d/go-git-fixtures.v3/data/git-26baa505b9f6fb2024b9999c140b75514718c988.tgz differ diff --git a/vendor/gopkg.in/src-d/go-git-fixtures.v3/fixtures.go b/vendor/gopkg.in/src-d/go-git-fixtures.v3/fixtures.go index a7b5767e..1d59ab16 100644 --- a/vendor/gopkg.in/src-d/go-git-fixtures.v3/fixtures.go +++ b/vendor/gopkg.in/src-d/go-git-fixtures.v3/fixtures.go @@ -154,6 +154,9 @@ var fixtures = Fixtures{{ Tags: []string{"thinpack"}, // adds commit on top of spinnaker fixture 06ce06d0fc49646c4de733c45b7788aabad98a6f via a thin pack PackfileHash: plumbing.NewHash("ee4fef0ef8be5053ebae4ce75acf062ddf3031fb"), Head: plumbing.NewHash("ee372bb08322c1e6e7c6c4f953cc6bf72784e7fb"), // the thin pack adds this commit +}, { + Tags: []string{"merge-base"}, + DotGitHash: plumbing.NewHash("26baa505b9f6fb2024b9999c140b75514718c988"), }} func All() Fixtures { diff --git a/vendor/gopkg.in/src-d/go-git.v4/merge_base.go b/vendor/gopkg.in/src-d/go-git.v4/merge_base.go new file mode 100644 index 00000000..7934aef0 --- /dev/null +++ b/vendor/gopkg.in/src-d/go-git.v4/merge_base.go @@ -0,0 +1,211 @@ +package git + +import ( + "fmt" + "sort" + + "gopkg.in/src-d/go-git.v4/plumbing" + "gopkg.in/src-d/go-git.v4/plumbing/object" + "gopkg.in/src-d/go-git.v4/plumbing/storer" +) + +// errIsReachable is thrown when first commit is an ancestor of the second +var errIsReachable = fmt.Errorf("first is reachable from second") + +// MergeBase mimics the behavior of `git merge-base first second`, returning the +// best common ancestor of the two passed commits +// The best common ancestors can not be reached from other common ancestors +func MergeBase( + first *object.Commit, + second *object.Commit, +) ([]*object.Commit, error) { + + // use sortedByCommitDateDesc strategy + sorted := sortByCommitDateDesc(first, second) + newer := sorted[0] + older := sorted[1] + + newerHistory, err := ancestorsIndex(older, newer) + if err == errIsReachable { + return []*object.Commit{older}, nil + } + + if err != nil { + return nil, err + } + + var res []*object.Commit + inNewerHistory := isInIndexCommitFilter(newerHistory) + resIter := object.NewFilterCommitIter(older, &inNewerHistory, &inNewerHistory) + err = resIter.ForEach(func(commit *object.Commit) error { + res = append(res, commit) + return nil + }) + + return Independents(res) +} + +// IsAncestor returns true if the candidate commit is ancestor of the target one +// It returns an error if the history is not transversable +// It mimics the behavior of `git merge --is-ancestor candidate target` +func IsAncestor( + candidate *object.Commit, + target *object.Commit, +) (bool, error) { + _, err := ancestorsIndex(candidate, target) + if err == errIsReachable { + return true, nil + } + + return false, nil +} + +// ancestorsIndex returns a map with the ancestors of the starting commit if the +// excluded one is not one of them. It returns errIsReachable if the excluded commit +// is ancestor of the starting, or another error if the history is not transversable. +func ancestorsIndex(excluded, starting *object.Commit) (map[plumbing.Hash]struct{}, error) { + if excluded.Hash.String() == starting.Hash.String() { + return nil, errIsReachable + } + + startingHistory := map[plumbing.Hash]struct{}{} + startingIter := object.NewCommitIterBSF(starting, nil, nil) + err := startingIter.ForEach(func(commit *object.Commit) error { + if commit.Hash == excluded.Hash { + return errIsReachable + } + + startingHistory[commit.Hash] = struct{}{} + return nil + }) + + if err != nil { + return nil, err + } + + return startingHistory, nil +} + +// Independents returns a subset of the passed commits, that are not reachable the others +// It mimics the behavior of `git merge-base --independent commit...`. +func Independents(commits []*object.Commit) ([]*object.Commit, error) { + // use sortedByCommitDateDesc strategy + cleaned := sortByCommitDateDesc(commits...) + cleaned = removeDuplicated(cleaned) + return independents(cleaned, map[plumbing.Hash]bool{}, 0) +} + +func independents( + candidates []*object.Commit, + excluded map[plumbing.Hash]bool, + start int, +) ([]*object.Commit, error) { + if len(candidates) == 1 { + return candidates, nil + } + + res := candidates + for i := start; i < len(candidates); i++ { + from := candidates[i] + others := remove(res, from) + fromHistoryIter := object.NewCommitIterBSF(from, excluded, nil) + err := fromHistoryIter.ForEach(func(fromAncestor *object.Commit) error { + for _, other := range others { + if fromAncestor.Hash == other.Hash { + res = remove(res, other) + others = remove(others, other) + } + } + + if len(res) == 1 { + return storer.ErrStop + } + + excluded[fromAncestor.Hash] = true + return nil + }) + + if err != nil { + return nil, err + } + + if len(res) < len(candidates) { + return independents(res, excluded, indexOf(res, from)+1) + } + + } + + return res, nil +} + +// sortByCommitDateDesc returns the passed commits, sorted by `committer.When desc` +// +// Following this strategy, it is tried to reduce the time needed when walking +// the history from one commit to reach the others. It is assumed that ancestors +// use to be committed before its descendant; +// That way `Independents(A^, A)` will be processed as being `Independents(A, A^)`; +// so starting by `A` it will be reached `A^` way sooner than walking from `A^` +// to the initial commit, and then from `A` to `A^`. +func sortByCommitDateDesc(commits ...*object.Commit) []*object.Commit { + sorted := make([]*object.Commit, len(commits)) + copy(sorted, commits) + sort.Slice(sorted, func(i, j int) bool { + return sorted[i].Committer.When.After(sorted[j].Committer.When) + }) + + return sorted +} + +// indexOf returns the first position where target was found in the passed commits +func indexOf(commits []*object.Commit, target *object.Commit) int { + for i, commit := range commits { + if target.Hash == commit.Hash { + return i + } + } + + return -1 +} + +// remove returns the passed commits excluding the commit toDelete +func remove(commits []*object.Commit, toDelete *object.Commit) []*object.Commit { + res := make([]*object.Commit, len(commits)) + j := 0 + for _, commit := range commits { + if commit.Hash == toDelete.Hash { + continue + } + + res[j] = commit + j++ + } + + return res[:j] +} + +// removeDuplicated removes duplicated commits from the passed slice of commits +func removeDuplicated(commits []*object.Commit) []*object.Commit { + seen := make(map[plumbing.Hash]struct{}, len(commits)) + res := make([]*object.Commit, len(commits)) + j := 0 + for _, commit := range commits { + if _, ok := seen[commit.Hash]; ok { + continue + } + + seen[commit.Hash] = struct{}{} + res[j] = commit + j++ + } + + return res[:j] +} + +// isInIndexCommitFilter returns a commitFilter that returns true +// if the commit is in the passed index. +func isInIndexCommitFilter(index map[plumbing.Hash]struct{}) object.CommitFilter { + return func(c *object.Commit) bool { + _, ok := index[c.Hash] + return ok + } +} diff --git a/vendor/gopkg.in/src-d/go-git.v4/plumbing/object/commit_walker_bfs_filtered.go b/vendor/gopkg.in/src-d/go-git.v4/plumbing/object/commit_walker_bfs_filtered.go new file mode 100644 index 00000000..b12523d4 --- /dev/null +++ b/vendor/gopkg.in/src-d/go-git.v4/plumbing/object/commit_walker_bfs_filtered.go @@ -0,0 +1,176 @@ +package object + +import ( + "io" + + "gopkg.in/src-d/go-git.v4/plumbing" + "gopkg.in/src-d/go-git.v4/plumbing/storer" +) + +// NewFilterCommitIter returns a CommitIter that walks the commit history, +// starting at the passed commit and visiting its parents in Breadth-first order. +// The commits returned by the CommitIter will validate the passed CommitFilter. +// The history won't be transversed beyond a commit if isLimit is true for it. +// Each commit will be visited only once. +// If the commit history can not be traversed, or the Close() method is called, +// the CommitIter won't return more commits. +// If no isValid is passed, all ancestors of from commit will be valid. +// If no isLimit is limmit, all ancestors of all commits will be visited. +func NewFilterCommitIter( + from *Commit, + isValid *CommitFilter, + isLimit *CommitFilter, +) CommitIter { + var validFilter CommitFilter + if isValid == nil { + validFilter = func(_ *Commit) bool { + return true + } + } else { + validFilter = *isValid + } + + var limitFilter CommitFilter + if isLimit == nil { + limitFilter = func(_ *Commit) bool { + return false + } + } else { + limitFilter = *isLimit + } + + return &filterCommitIter{ + isValid: validFilter, + isLimit: limitFilter, + visited: map[plumbing.Hash]struct{}{}, + queue: []*Commit{from}, + } +} + +// CommitFilter returns a boolean for the passed Commit +type CommitFilter func(*Commit) bool + +// filterCommitIter implments CommitIter +type filterCommitIter struct { + isValid CommitFilter + isLimit CommitFilter + visited map[plumbing.Hash]struct{} + queue []*Commit + lastErr error +} + +// Next returns the next commit of the CommitIter. +// It will return io.EOF if there are no more commits to visit, +// or an error if the history could not be traversed. +func (w *filterCommitIter) Next() (*Commit, error) { + var commit *Commit + var err error + for { + commit, err = w.popNewFromQueue() + if err != nil { + return nil, w.close(err) + } + + w.visited[commit.Hash] = struct{}{} + + if !w.isLimit(commit) { + err = w.addToQueue(commit.s, commit.ParentHashes...) + if err != nil { + return nil, w.close(err) + } + } + + if w.isValid(commit) { + return commit, nil + } + } +} + +// ForEach runs the passed callback over each Commit returned by the CommitIter +// until the callback returns an error or there is no more commits to traverse. +func (w *filterCommitIter) ForEach(cb func(*Commit) error) error { + for { + commit, err := w.Next() + if err == io.EOF { + break + } + + if err != nil { + return err + } + + if err := cb(commit); err == storer.ErrStop { + break + } else if err != nil { + return err + } + } + + return nil +} + +// Error returns the error that caused that the CommitIter is no longer returning commits +func (w *filterCommitIter) Error() error { + return w.lastErr +} + +// Close closes the CommitIter +func (w *filterCommitIter) Close() { + w.visited = map[plumbing.Hash]struct{}{} + w.queue = []*Commit{} + w.isLimit = nil + w.isValid = nil +} + +// close closes the CommitIter with an error +func (w *filterCommitIter) close(err error) error { + w.Close() + w.lastErr = err + return err +} + +// popNewFromQueue returns the first new commit from the internal fifo queue, +// or an io.EOF error if the queue is empty +func (w *filterCommitIter) popNewFromQueue() (*Commit, error) { + var first *Commit + for { + if len(w.queue) == 0 { + if w.lastErr != nil { + return nil, w.lastErr + } + + return nil, io.EOF + } + + first = w.queue[0] + w.queue = w.queue[1:] + if _, ok := w.visited[first.Hash]; ok { + continue + } + + return first, nil + } +} + +// addToQueue adds the passed commits to the internal fifo queue if they weren't seen +// or returns an error if the passed hashes could not be used to get valid commits +func (w *filterCommitIter) addToQueue( + store storer.EncodedObjectStorer, + hashes ...plumbing.Hash, +) error { + for _, hash := range hashes { + if _, ok := w.visited[hash]; ok { + continue + } + + commit, err := GetCommit(store, hash) + if err != nil { + return err + } + + w.queue = append(w.queue, commit) + } + + return nil +} + diff --git a/vendor/gopkg.in/src-d/lookout-sdk.v0/pb/service_data.pb.go b/vendor/gopkg.in/src-d/lookout-sdk.v0/pb/service_data.pb.go index bb96e519..e4c086e0 100644 --- a/vendor/gopkg.in/src-d/lookout-sdk.v0/pb/service_data.pb.go +++ b/vendor/gopkg.in/src-d/lookout-sdk.v0/pb/service_data.pb.go @@ -50,7 +50,7 @@ func (m *File) Reset() { *m = File{} } func (m *File) String() string { return proto.CompactTextString(m) } func (*File) ProtoMessage() {} func (*File) Descriptor() ([]byte, []int) { - return fileDescriptor_service_data_8336abc41c19202a, []int{0} + return fileDescriptor_service_data_cdd114f0940e7d0a, []int{0} } func (m *File) XXX_Unmarshal(b []byte) error { return m.Unmarshal(b) @@ -93,7 +93,7 @@ func (m *Change) Reset() { *m = Change{} } func (m *Change) String() string { return proto.CompactTextString(m) } func (*Change) ProtoMessage() {} func (*Change) Descriptor() ([]byte, []int) { - return fileDescriptor_service_data_8336abc41c19202a, []int{1} + return fileDescriptor_service_data_cdd114f0940e7d0a, []int{1} } func (m *Change) XXX_Unmarshal(b []byte) error { return m.Unmarshal(b) @@ -148,13 +148,17 @@ type ChangesRequest struct { // case insensitive. The list of language names is available at // https://github.com/github/linguist/blob/master/lib/linguist/languages.yml IncludeLanguages []string `protobuf:"bytes,9,rep,name=include_languages,json=includeLanguages,proto3" json:"include_languages,omitempty"` + // TwoDotsMode will calculate the changes between base..head + // Its default value is false, working as base...head, that calculates the + // changes introduced by head, not accessible by base. + TwoDotsMode bool `protobuf:"varint,10,opt,name=two_dots_mode,json=twoDotsMode,proto3" json:"two_dots_mode,omitempty"` } func (m *ChangesRequest) Reset() { *m = ChangesRequest{} } func (m *ChangesRequest) String() string { return proto.CompactTextString(m) } func (*ChangesRequest) ProtoMessage() {} func (*ChangesRequest) Descriptor() ([]byte, []int) { - return fileDescriptor_service_data_8336abc41c19202a, []int{2} + return fileDescriptor_service_data_cdd114f0940e7d0a, []int{2} } func (m *ChangesRequest) XXX_Unmarshal(b []byte) error { return m.Unmarshal(b) @@ -213,7 +217,7 @@ func (m *FilesRequest) Reset() { *m = FilesRequest{} } func (m *FilesRequest) String() string { return proto.CompactTextString(m) } func (*FilesRequest) ProtoMessage() {} func (*FilesRequest) Descriptor() ([]byte, []int) { - return fileDescriptor_service_data_8336abc41c19202a, []int{3} + return fileDescriptor_service_data_cdd114f0940e7d0a, []int{3} } func (m *FilesRequest) XXX_Unmarshal(b []byte) error { return m.Unmarshal(b) @@ -609,6 +613,16 @@ func (m *ChangesRequest) MarshalTo(dAtA []byte) (int, error) { i += copy(dAtA[i:], s) } } + if m.TwoDotsMode { + dAtA[i] = 0x50 + i++ + if m.TwoDotsMode { + dAtA[i] = 1 + } else { + dAtA[i] = 0 + } + i++ + } return i, nil } @@ -805,6 +819,9 @@ func (m *ChangesRequest) Size() (n int) { n += 1 + l + sovServiceData(uint64(l)) } } + if m.TwoDotsMode { + n += 2 + } return n } @@ -1458,6 +1475,26 @@ func (m *ChangesRequest) Unmarshal(dAtA []byte) error { } m.IncludeLanguages = append(m.IncludeLanguages, string(dAtA[iNdEx:postIndex])) iNdEx = postIndex + case 10: + if wireType != 0 { + return fmt.Errorf("proto: wrong wireType = %d for field TwoDotsMode", wireType) + } + var v int + for shift := uint(0); ; shift += 7 { + if shift >= 64 { + return ErrIntOverflowServiceData + } + if iNdEx >= l { + return io.ErrUnexpectedEOF + } + b := dAtA[iNdEx] + iNdEx++ + v |= (int(b) & 0x7F) << shift + if b < 0x80 { + break + } + } + m.TwoDotsMode = bool(v != 0) default: iNdEx = preIndex skippy, err := skipServiceData(dAtA[iNdEx:]) @@ -1835,48 +1872,49 @@ var ( ) func init() { - proto.RegisterFile("lookout/sdk/service_data.proto", fileDescriptor_service_data_8336abc41c19202a) + proto.RegisterFile("lookout/sdk/service_data.proto", fileDescriptor_service_data_cdd114f0940e7d0a) } -var fileDescriptor_service_data_8336abc41c19202a = []byte{ - // 615 bytes of a gzipped FileDescriptorProto - 0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0x94, 0x94, 0xc1, 0x6e, 0xd3, 0x30, - 0x18, 0xc7, 0x9b, 0x36, 0xeb, 0x5c, 0xaf, 0x1b, 0xc3, 0x42, 0x22, 0xaa, 0xa6, 0xb4, 0x8c, 0x03, - 0x99, 0x26, 0x9c, 0x31, 0x6e, 0x5c, 0x10, 0x1b, 0x62, 0x17, 0x34, 0x4d, 0x81, 0xc1, 0x71, 0x38, - 0xcd, 0xb7, 0x24, 0x5a, 0x67, 0x97, 0xd8, 0x29, 0xdc, 0x79, 0x01, 0x1e, 0x81, 0x3d, 0x0b, 0x97, - 0x1d, 0x77, 0xe4, 0x34, 0x46, 0xfb, 0x22, 0xc8, 0x4e, 0xd2, 0xad, 0xd2, 0x80, 0x72, 0xb3, 0xff, - 0xdf, 0xcf, 0x9f, 0xed, 0xff, 0x3f, 0x0e, 0x76, 0x07, 0x42, 0x9c, 0x88, 0x5c, 0xf9, 0x32, 0x3a, - 0xf1, 0x25, 0x64, 0xa3, 0xb4, 0x0f, 0x47, 0x11, 0x53, 0x8c, 0x0e, 0x33, 0xa1, 0x04, 0xa9, 0x0f, - 0xc3, 0xce, 0xe3, 0x38, 0x55, 0x49, 0x1e, 0xd2, 0xbe, 0x38, 0xf5, 0x63, 0x11, 0x0b, 0xdf, 0x94, - 0xc2, 0xfc, 0xd8, 0xcc, 0xcc, 0xc4, 0x8c, 0x8a, 0x25, 0x9d, 0xcd, 0x58, 0x0c, 0x4f, 0x62, 0x9a, - 0x72, 0x3f, 0x0c, 0x07, 0xc7, 0x32, 0xd1, 0xad, 0xe9, 0xe8, 0x89, 0x9f, 0x33, 0xa9, 0xfc, 0x18, - 0x38, 0x64, 0x4c, 0x41, 0x54, 0xc2, 0xf7, 0x6f, 0xee, 0x0f, 0x23, 0xe0, 0xaa, 0x28, 0xac, 0x7f, - 0xb7, 0xb0, 0xfd, 0x2a, 0x1d, 0x00, 0x21, 0xd8, 0x1e, 0x32, 0x95, 0x38, 0x56, 0xcf, 0xf2, 0x5a, - 0x81, 0x19, 0x6b, 0xed, 0x54, 0x44, 0xe0, 0xd4, 0x7b, 0x96, 0xb7, 0x1c, 0x98, 0xb1, 0xd6, 0x12, - 0x26, 0x13, 0xa7, 0x51, 0x70, 0x7a, 0x4c, 0x1c, 0xbc, 0xd8, 0x17, 0x5c, 0x01, 0x57, 0x8e, 0xdd, - 0xb3, 0xbc, 0x76, 0x50, 0x4d, 0xc9, 0x73, 0x6c, 0xeb, 0xf3, 0x38, 0x0b, 0x3d, 0xcb, 0x5b, 0xda, - 0x7e, 0x40, 0xab, 0x33, 0xd3, 0xe2, 0xcc, 0xb4, 0x38, 0x33, 0xd5, 0x0c, 0xdd, 0x17, 0x11, 0xec, - 0xa0, 0xf1, 0x65, 0xd7, 0x3e, 0x7c, 0xf1, 0xe6, 0x6d, 0x60, 0x16, 0x92, 0x0e, 0x46, 0x03, 0xc6, - 0xe3, 0x9c, 0xc5, 0xe0, 0x34, 0xcd, 0x96, 0xd3, 0xf9, 0x33, 0xf4, 0xed, 0xac, 0x5b, 0xbb, 0x3a, - 0xeb, 0x5a, 0xeb, 0xfb, 0xb8, 0xb9, 0x9b, 0x30, 0x1e, 0x03, 0x59, 0xc3, 0x76, 0xc8, 0x24, 0x98, - 0x6b, 0x2c, 0x6d, 0x23, 0x3a, 0x0c, 0xa9, 0xbe, 0x5e, 0x60, 0x54, 0x5d, 0x4d, 0x80, 0x45, 0xe6, - 0x42, 0x33, 0x55, 0xad, 0xde, 0xe8, 0xf7, 0xa5, 0x81, 0x57, 0x8a, 0x86, 0x32, 0x80, 0x8f, 0x39, - 0x48, 0x45, 0xbc, 0x99, 0xc6, 0xf7, 0xf4, 0xd2, 0x00, 0x8e, 0x21, 0x03, 0xde, 0x87, 0x03, 0x91, - 0x72, 0x05, 0x59, 0xb9, 0x89, 0x37, 0xb3, 0xc9, 0x1f, 0x48, 0x4d, 0x90, 0x47, 0xf8, 0x4e, 0xca, - 0xfb, 0x83, 0x3c, 0x82, 0xa3, 0x21, 0x53, 0x0a, 0x32, 0x5e, 0xda, 0xba, 0x52, 0xca, 0x07, 0x85, - 0xaa, 0x41, 0xf8, 0x3c, 0x0b, 0xda, 0x05, 0x58, 0xca, 0x15, 0xb8, 0x81, 0x57, 0x2b, 0x70, 0x04, - 0x3c, 0x12, 0x19, 0x44, 0xc6, 0x7b, 0x14, 0x54, 0x0d, 0xde, 0x95, 0x32, 0x79, 0x88, 0x97, 0x3f, - 0x31, 0xae, 0x8e, 0xca, 0xa8, 0xa4, 0xb1, 0x17, 0x05, 0x6d, 0x2d, 0xee, 0x96, 0x1a, 0xd9, 0xc0, - 0x2d, 0x03, 0x99, 0x10, 0x17, 0x35, 0xb0, 0xd3, 0x1e, 0x5f, 0x76, 0xd1, 0x7b, 0xc6, 0x95, 0x49, - 0x09, 0xe9, 0xf2, 0xa1, 0x4e, 0xaa, 0xea, 0x37, 0x8d, 0x0b, 0x5d, 0xf7, 0x7b, 0x5d, 0x6a, 0x64, - 0x13, 0xdf, 0xad, 0x6e, 0x5c, 0x71, 0xd2, 0x69, 0xf5, 0x1a, 0x5e, 0x2b, 0x58, 0x2d, 0x0b, 0x15, - 0x2b, 0xd7, 0x7f, 0xd6, 0x71, 0x5b, 0xc7, 0x33, 0xcd, 0x60, 0x0b, 0xa3, 0x0c, 0x46, 0xa9, 0x4c, - 0x05, 0xff, 0x6b, 0x0e, 0x53, 0xea, 0x36, 0x87, 0xeb, 0xf3, 0x3a, 0xdc, 0x98, 0xdb, 0x61, 0x7b, - 0x4e, 0x87, 0x17, 0xfe, 0xe5, 0x70, 0xf3, 0xff, 0x1c, 0x5e, 0x9c, 0xd7, 0x61, 0x74, 0xbb, 0xc3, - 0xdb, 0x1f, 0xb0, 0xfd, 0x92, 0x29, 0x46, 0x28, 0xc6, 0x7b, 0xa0, 0xca, 0x2f, 0x9e, 0x10, 0x6d, - 0xea, 0xec, 0xe7, 0xdf, 0xc1, 0xd7, 0xda, 0x96, 0x45, 0x3c, 0x8c, 0xf6, 0x40, 0x99, 0x6c, 0xc8, - 0x6a, 0xf5, 0x8a, 0xa6, 0xec, 0xf4, 0x5d, 0x6d, 0x59, 0x3b, 0x6b, 0xe7, 0xbf, 0xdc, 0xda, 0xf9, - 0xd8, 0xb5, 0x2e, 0xc6, 0xae, 0x75, 0x35, 0x76, 0xad, 0xaf, 0x13, 0xb7, 0x76, 0x31, 0x71, 0x6b, - 0x3f, 0x26, 0x6e, 0x2d, 0x6c, 0x9a, 0x9f, 0xd0, 0xd3, 0xdf, 0x01, 0x00, 0x00, 0xff, 0xff, 0x66, - 0x7c, 0x6c, 0xeb, 0x1f, 0x05, 0x00, 0x00, +var fileDescriptor_service_data_cdd114f0940e7d0a = []byte{ + // 640 bytes of a gzipped FileDescriptorProto + 0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0x94, 0x94, 0x4f, 0x53, 0xd3, 0x4e, + 0x18, 0xc7, 0x9b, 0x36, 0x94, 0x74, 0x29, 0xfc, 0xf8, 0xed, 0x38, 0x63, 0xa6, 0xc3, 0xa4, 0xb5, + 0x1e, 0x0c, 0xc3, 0xb8, 0x41, 0xbc, 0x79, 0x71, 0x04, 0x46, 0x2e, 0xca, 0x30, 0x51, 0xf4, 0x58, + 0x37, 0xcd, 0x43, 0x92, 0xa1, 0xec, 0xd6, 0xec, 0xa6, 0xf8, 0x32, 0x7c, 0x09, 0x72, 0xf2, 0x85, + 0x78, 0xe1, 0xc8, 0xd1, 0x13, 0x62, 0x79, 0x23, 0xce, 0x6e, 0xfe, 0x40, 0x67, 0x50, 0xeb, 0x6d, + 0xf7, 0xfb, 0x7c, 0xf7, 0xbb, 0x7f, 0x3e, 0x79, 0x82, 0x9c, 0x11, 0xe7, 0xc7, 0x3c, 0x93, 0x9e, + 0x08, 0x8f, 0x3d, 0x01, 0xe9, 0x24, 0x19, 0xc2, 0x20, 0xa4, 0x92, 0x92, 0x71, 0xca, 0x25, 0xc7, + 0xf5, 0x71, 0xd0, 0x79, 0x1c, 0x25, 0x32, 0xce, 0x02, 0x32, 0xe4, 0x27, 0x5e, 0xc4, 0x23, 0xee, + 0xe9, 0x52, 0x90, 0x1d, 0xe9, 0x99, 0x9e, 0xe8, 0x51, 0xbe, 0xa4, 0xb3, 0x11, 0xf1, 0xf1, 0x71, + 0x44, 0x12, 0xe6, 0x05, 0xc1, 0xe8, 0x48, 0xc4, 0x2a, 0x9a, 0x4c, 0x9e, 0x78, 0x19, 0x15, 0xd2, + 0x8b, 0x80, 0x41, 0x4a, 0x25, 0x84, 0x85, 0xf9, 0xfe, 0xed, 0xfd, 0x61, 0x02, 0x4c, 0xe6, 0x85, + 0xfe, 0x37, 0x03, 0x99, 0x2f, 0x93, 0x11, 0x60, 0x8c, 0xcc, 0x31, 0x95, 0xb1, 0x6d, 0xf4, 0x0c, + 0xb7, 0xe5, 0xeb, 0xb1, 0xd2, 0x4e, 0x78, 0x08, 0x76, 0xbd, 0x67, 0xb8, 0xcb, 0xbe, 0x1e, 0x2b, + 0x2d, 0xa6, 0x22, 0xb6, 0x1b, 0xb9, 0x4f, 0x8d, 0xb1, 0x8d, 0x16, 0x87, 0x9c, 0x49, 0x60, 0xd2, + 0x36, 0x7b, 0x86, 0xdb, 0xf6, 0xcb, 0x29, 0x7e, 0x8e, 0x4c, 0x75, 0x1e, 0x7b, 0xa1, 0x67, 0xb8, + 0x4b, 0x5b, 0x0f, 0x48, 0x79, 0x66, 0x92, 0x9f, 0x99, 0xe4, 0x67, 0x26, 0xca, 0x43, 0xf6, 0x79, + 0x08, 0xdb, 0xd6, 0xf4, 0xb2, 0x6b, 0x1e, 0xbe, 0x78, 0xf3, 0xd6, 0xd7, 0x0b, 0x71, 0x07, 0x59, + 0x23, 0xca, 0xa2, 0x8c, 0x46, 0x60, 0x37, 0xf5, 0x96, 0xd5, 0xfc, 0x99, 0xf5, 0xe5, 0xac, 0x5b, + 0xbb, 0x3a, 0xeb, 0x1a, 0xfd, 0x7d, 0xd4, 0xdc, 0x89, 0x29, 0x8b, 0x00, 0xaf, 0x21, 0x33, 0xa0, + 0x02, 0xf4, 0x35, 0x96, 0xb6, 0x2c, 0x32, 0x0e, 0x88, 0xba, 0x9e, 0xaf, 0x55, 0x55, 0x8d, 0x81, + 0x86, 0xfa, 0x42, 0x33, 0x55, 0xa5, 0xde, 0xca, 0xfb, 0xda, 0x40, 0x2b, 0x79, 0xa0, 0xf0, 0xe1, + 0x63, 0x06, 0x42, 0x62, 0x77, 0x26, 0xf8, 0x9e, 0x5a, 0xea, 0xc3, 0x11, 0xa4, 0xc0, 0x86, 0x70, + 0xc0, 0x13, 0x26, 0x21, 0x2d, 0x36, 0x71, 0x67, 0x36, 0xf9, 0x8d, 0x53, 0x39, 0xf0, 0x23, 0xf4, + 0x5f, 0xc2, 0x86, 0xa3, 0x2c, 0x84, 0xc1, 0x98, 0x4a, 0x09, 0x29, 0x2b, 0x9e, 0x75, 0xa5, 0x90, + 0x0f, 0x72, 0x55, 0x19, 0xe1, 0xd3, 0xac, 0xd1, 0xcc, 0x8d, 0x85, 0x5c, 0x1a, 0xd7, 0xd1, 0x6a, + 0x69, 0x9c, 0x00, 0x0b, 0x79, 0x0a, 0xa1, 0x7e, 0x7b, 0xcb, 0x2f, 0x03, 0xde, 0x15, 0x32, 0x7e, + 0x88, 0x96, 0x4f, 0x29, 0x93, 0x83, 0x02, 0x95, 0xd0, 0xcf, 0x6b, 0xf9, 0x6d, 0x25, 0xee, 0x14, + 0x1a, 0x5e, 0x47, 0x2d, 0x6d, 0xd2, 0x10, 0x17, 0x95, 0x61, 0xbb, 0x3d, 0xbd, 0xec, 0x5a, 0xef, + 0x29, 0x93, 0x9a, 0x92, 0xa5, 0xca, 0x87, 0x8a, 0x54, 0x99, 0x57, 0xe1, 0xb2, 0x6e, 0xf2, 0x5e, + 0x15, 0x1a, 0xde, 0x40, 0xff, 0x97, 0x37, 0x2e, 0x7d, 0xc2, 0x6e, 0xf5, 0x1a, 0x6e, 0xcb, 0x5f, + 0x2d, 0x0a, 0xa5, 0x57, 0xe0, 0x3e, 0x5a, 0x96, 0xa7, 0x7c, 0x10, 0x72, 0x29, 0x06, 0xfa, 0x3b, + 0x44, 0x3a, 0x71, 0x49, 0x9e, 0xf2, 0x5d, 0x2e, 0xc5, 0x6b, 0x1e, 0x42, 0xff, 0x47, 0x1d, 0xb5, + 0x15, 0xc2, 0x8a, 0xd3, 0x26, 0xb2, 0x52, 0x98, 0x24, 0x22, 0xe1, 0xec, 0x8f, 0xac, 0x2a, 0xd7, + 0x5d, 0x14, 0xea, 0xf3, 0x52, 0x68, 0xcc, 0x4d, 0xc1, 0x9c, 0x93, 0xc2, 0xc2, 0xdf, 0x28, 0x34, + 0xff, 0x8d, 0xc2, 0xe2, 0xbc, 0x14, 0xac, 0xbb, 0x29, 0x6c, 0x7d, 0x40, 0xe6, 0x2e, 0x95, 0x14, + 0x13, 0x84, 0xf6, 0x40, 0x16, 0x5d, 0x81, 0xb1, 0x7a, 0xd4, 0xd9, 0x16, 0xe9, 0xa0, 0x1b, 0x6d, + 0xd3, 0xc0, 0x2e, 0xb2, 0xf6, 0x40, 0x6a, 0x36, 0x78, 0xb5, 0xec, 0xb4, 0xca, 0x5b, 0xf5, 0xde, + 0xa6, 0xb1, 0xbd, 0x76, 0xfe, 0xd3, 0xa9, 0x9d, 0x4f, 0x1d, 0xe3, 0x62, 0xea, 0x18, 0x57, 0x53, + 0xc7, 0xf8, 0x7c, 0xed, 0xd4, 0x2e, 0xae, 0x9d, 0xda, 0xf7, 0x6b, 0xa7, 0x16, 0x34, 0xf5, 0x8f, + 0xea, 0xe9, 0xaf, 0x00, 0x00, 0x00, 0xff, 0xff, 0xe8, 0x3b, 0x87, 0x79, 0x43, 0x05, 0x00, 0x00, }