1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
|
// Copyright 2019 Oath Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
package com.yahoo.search.dispatch;
import com.yahoo.prelude.fastsearch.VespaBackEndSearcher;
import com.yahoo.search.Query;
import com.yahoo.search.Result;
import com.yahoo.search.dispatch.searchcluster.Node;
import com.yahoo.search.dispatch.searchcluster.SearchCluster;
import com.yahoo.search.result.Coverage;
import com.yahoo.search.result.ErrorMessage;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Optional;
import java.util.OptionalInt;
import java.util.Set;
/**
* @author ollivir
*/
public abstract class InvokerFactory {
protected final SearchCluster searchCluster;
public InvokerFactory(SearchCluster searchCluster) {
this.searchCluster = searchCluster;
}
protected abstract Optional<SearchInvoker> createNodeSearchInvoker(VespaBackEndSearcher searcher,
Query query,
int maxHits,
Node node);
public abstract FillInvoker createFillInvoker(VespaBackEndSearcher searcher, Result result);
/**
* Create a {@link SearchInvoker} for a list of content nodes.
*
* @param searcher the searcher processing the query
* @param query the search query being processed
* @param groupId the id of the node group to which the nodes belong
* @param nodes pre-selected list of content nodes
* @param acceptIncompleteCoverage if some of the nodes are unavailable and this parameter is
* false, verify that the remaining set of nodes has sufficient coverage
* @return the invoker or empty if some node in the
* list is invalid and the remaining coverage is not sufficient
*/
Optional<SearchInvoker> createSearchInvoker(VespaBackEndSearcher searcher,
Query query,
OptionalInt groupId,
List<Node> nodes,
boolean acceptIncompleteCoverage,
int maxHits) {
List<SearchInvoker> invokers = new ArrayList<>(nodes.size());
Set<Integer> failed = null;
for (Node node : nodes) {
boolean nodeAdded = false;
if (node.isWorking() != Boolean.FALSE) {
Optional<SearchInvoker> invoker = createNodeSearchInvoker(searcher, query, maxHits, node);
if (invoker.isPresent()) {
invokers.add(invoker.get());
nodeAdded = true;
}
}
if ( ! nodeAdded) {
if (failed == null) {
failed = new HashSet<>();
}
failed.add(node.key());
}
}
if (failed != null) {
List<Node> success = new ArrayList<>(nodes.size() - failed.size());
for (Node node : nodes) {
if ( ! failed.contains(node.key())) {
success.add(node);
}
}
if ( ! searchCluster.isPartialGroupCoverageSufficient(groupId, success) && !acceptIncompleteCoverage) {
return Optional.empty();
}
if (invokers.size() == 0) {
return Optional.of(createCoverageErrorInvoker(nodes, failed));
}
}
if (invokers.size() == 1 && failed == null) {
return Optional.of(invokers.get(0));
} else {
return Optional.of(new InterleavedSearchInvoker(invokers, searchCluster.isGroupWellBalanced(groupId), searchCluster, failed));
}
}
protected static SearchInvoker createCoverageErrorInvoker(List<Node> nodes, Set<Integer> failed) {
StringBuilder down = new StringBuilder("Connection failure on nodes with distribution-keys: ");
int count = 0;
for (Node node : nodes) {
if (failed.contains(node.key())) {
if (count > 0) {
down.append(", ");
}
count++;
down.append(node.key());
}
}
Coverage coverage = new Coverage(0, 0, 0);
coverage.setNodesTried(count);
return new SearchErrorInvoker(ErrorMessage.createBackendCommunicationError(down.toString()), coverage);
}
public void release() {}
}
|