This repository has been archived by the owner on Sep 28, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 21
/
Copy pathingest.go
146 lines (131 loc) · 4.28 KB
/
ingest.go
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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
// Copyright 2017 Pilosa Corp.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the copyright holder nor the names of its
// contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
// CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
// INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
// DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
// BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
// DAMAGE.
package pdk
import (
"io"
"log"
"os"
"sync"
"github.com/pilosa/pdk/termstat"
)
// Ingester combines a Source, Parser, Mapper, and Indexer, and uses them to
// ingest data into Pilosa. This could be a streaming situation where the Source
// never ends, and calling it just waits for more data to be available, or a
// batch situation where the Source eventually returns io.EOF (or some other
// error), and the Ingester completes (after the other components are done).
type Ingester struct {
ParseConcurrency int
src Source
parser RecordParser
mapper RecordMapper
indexer Indexer
Transformers []Transformer
AllowedFields map[string]bool
Stats Statter
Log Logger
}
// NewIngester gets a new Ingester.
func NewIngester(source Source, parser RecordParser, mapper RecordMapper, indexer Indexer) *Ingester {
return &Ingester{
ParseConcurrency: 1,
src: source,
parser: parser,
mapper: mapper,
indexer: indexer,
// Reasonable defaults for crosscutting dependencies.
Stats: termstat.NewCollector(os.Stdout),
Log: StdLogger{log.New(os.Stderr, "Ingest", log.LstdFlags)},
}
}
// Run runs the ingest.
func (n *Ingester) Run() error {
pwg := sync.WaitGroup{}
for i := 0; i < n.ParseConcurrency; i++ {
pwg.Add(1)
go func() {
defer pwg.Done()
var recordErr error
for {
// Source
var rec interface{}
rec, recordErr = n.src.Record()
if recordErr != nil {
break
}
n.Stats.Count("ingest.Record", 1, 1)
// Parse
val, err := n.parser.Parse(rec)
if err != nil {
n.Log.Printf("couldn't parse record %s, err: %v", rec, err)
n.Stats.Count("ingest.ParseError", 1, 1)
continue
}
n.Stats.Count("ingest.Parse", 1, 1)
// Transform
for _, tr := range n.Transformers {
err := tr.Transform(val)
if err != nil {
n.Log.Printf("Problem with transformer %#v: %v", tr, err)
n.Stats.Count("ingest.TransformError", 1, 1)
}
}
n.Stats.Count("ingest.Transform", 1, 1)
// Map
pr, err := n.mapper.Map(val)
if err != nil {
n.Log.Printf("couldn't map val: %s, err: %v", val, err)
n.Stats.Count("ingest.MapError", 1, 1)
continue
}
// Index
n.Stats.Count("ingest.Map", 1, 1)
for _, row := range pr.Rows {
if n.AllowedFields == nil || n.AllowedFields[row.Field] {
n.indexer.AddColumn(row.Field, pr.Col, row.ID)
n.Stats.Count("ingest.AddBit", 1, 1)
}
}
for _, val := range pr.Vals {
if n.AllowedFields == nil || n.AllowedFields[val.Field] {
n.indexer.AddValue(val.Field, pr.Col, val.Value)
n.Stats.Count("ingest.AddValue", 1, 1)
}
}
}
if recordErr != io.EOF && recordErr != nil {
n.Log.Printf("error in ingest run loop: %v", recordErr)
}
}()
}
pwg.Wait()
return n.indexer.Close()
}