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
117
118
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include <vespa/eval/eval/nested_loop.h>
#include <vespa/eval/eval/value_type.h>
#include <vespa/eval/eval/operation.h>
#include <vespa/eval/eval/interpreted_function.h>
#include <vespa/vespalib/util/small_vector.h>
namespace vespalib { class Stash; }
namespace vespalib::eval { struct ValueBuilderFactory; }
namespace vespalib::eval::instruction {
using join_fun_t = operation::op2_t;
//-----------------------------------------------------------------------------
struct JoinParam;
template <typename LCT, typename RCT, typename OCT, typename Fun>
Value::UP generic_mixed_join(const Value &lhs, const Value &rhs, const JoinParam ¶m);
struct GenericJoin {
static InterpretedFunction::Instruction
make_instruction(const ValueType &result_type,
const ValueType &lhs_type, const ValueType &rhs_type,
join_fun_t function,
const ValueBuilderFactory &factory, Stash &stash);
};
//-----------------------------------------------------------------------------
/**
* Plan for how to traverse two partially overlapping dense subspaces
* in parallel, identifying all matching cell index combinations, in
* the exact order the joined cells will be stored in the result. The
* plan can be made up-front during tensor function compilation.
**/
struct DenseJoinPlan {
size_t lhs_size;
size_t rhs_size;
size_t out_size;
SmallVector<size_t> loop_cnt;
SmallVector<size_t> lhs_stride;
SmallVector<size_t> rhs_stride;
DenseJoinPlan(const ValueType &lhs_type, const ValueType &rhs_type);
~DenseJoinPlan();
template <typename F> void execute(size_t lhs, size_t rhs, const F &f) const {
run_nested_loop(lhs, rhs, loop_cnt, lhs_stride, rhs_stride, f);
}
};
/**
* Plan for how to join the sparse part (all mapped dimensions)
* between two values. The plan can be made up-front during tensor
* function compilation.
**/
struct SparseJoinPlan {
enum class Source { LHS, RHS, BOTH };
SmallVector<Source> sources;
SmallVector<size_t> lhs_overlap;
SmallVector<size_t> rhs_overlap;
bool should_forward_lhs_index() const;
bool should_forward_rhs_index() const;
SparseJoinPlan(const ValueType &lhs_type, const ValueType &rhs_type);
explicit SparseJoinPlan(size_t num_mapped_dims); // full overlap plan
~SparseJoinPlan();
};
// Contains various state needed to perform the sparse part (all
// mapped dimensions) of the join operation. Performs swapping of
// sparse indexes to ensure that we look up entries from the smallest
// index in the largest index.
struct SparseJoinState {
bool swapped;
const Value::Index &first_index;
const Value::Index &second_index;
const SmallVector<size_t> &second_view_dims;
SmallVector<string_id> full_address;
SmallVector<string_id*> first_address;
SmallVector<const string_id*> address_overlap;
SmallVector<string_id*> second_only_address;
size_t lhs_subspace;
size_t rhs_subspace;
size_t &first_subspace;
size_t &second_subspace;
SparseJoinState(const SparseJoinPlan &plan, const Value::Index &lhs, const Value::Index &rhs);
~SparseJoinState();
};
/**
* Full set of parameters passed to low-level generic join function
**/
struct JoinParam {
ValueType res_type;
SparseJoinPlan sparse_plan;
DenseJoinPlan dense_plan;
join_fun_t function;
const ValueBuilderFactory &factory;
JoinParam(const ValueType &res_type_in,
const ValueType &lhs_type, const ValueType &rhs_type,
join_fun_t function_in, const ValueBuilderFactory &factory_in)
: res_type(res_type_in),
sparse_plan(lhs_type, rhs_type),
dense_plan(lhs_type, rhs_type),
function(function_in),
factory(factory_in)
{
assert(!res_type.is_error());
}
~JoinParam();
};
//-----------------------------------------------------------------------------
} // namespace
|
