This repository has been archived by the owner on Mar 18, 2019. It is now read-only.
/
market.go
366 lines (320 loc) · 15 KB
/
market.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
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
/*
Copyright 2017 Loopring Project Ltd (Loopring Foundation).
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
package timing_matcher
import (
"fmt"
"github.com/Loopring/relay/ethaccessor"
"github.com/Loopring/relay/eventemiter"
"github.com/Loopring/relay/log"
"github.com/Loopring/relay/miner"
"github.com/Loopring/relay/ordermanager"
"github.com/Loopring/relay/types"
"github.com/ethereum/go-ethereum/common"
"math/big"
"sort"
)
type Market struct {
matcher *TimingMatcher
om ordermanager.OrderManager
protocolImpl *ethaccessor.ProtocolAddress
TokenA common.Address
TokenB common.Address
AtoBOrders map[common.Hash]*types.OrderState
BtoAOrders map[common.Hash]*types.OrderState
AtoBOrderHashesExcludeNextRound []common.Hash
BtoAOrderHashesExcludeNextRound []common.Hash
}
func (market *Market) match() {
market.getOrdersForMatching(market.protocolImpl.DelegateAddress)
matchedOrderHashes := make(map[common.Hash]bool) //true:fullfilled, false:partfilled
ringSubmitInfos := []*types.RingSubmitInfo{}
candidateRingList := CandidateRingList{}
//step 1: evaluate received
for _, a2BOrder := range market.AtoBOrders {
if failedCount, err1 := OrderExecuteFailedCount(a2BOrder.RawOrder.Hash); nil == err1 && failedCount > market.matcher.maxFailedCount {
log.Debugf("orderhash:%s has been failed to submit %d times", a2BOrder.RawOrder.Hash.Hex(), failedCount)
continue
}
for _, b2AOrder := range market.BtoAOrders {
if failedCount, err1 := OrderExecuteFailedCount(b2AOrder.RawOrder.Hash); nil == err1 && failedCount > market.matcher.maxFailedCount {
log.Debugf("orderhash:%s has been failed to submit %d times", b2AOrder.RawOrder.Hash.Hex(), failedCount)
continue
}
//todo:move a2BOrder.RawOrder.Owner != b2AOrder.RawOrder.Owner after contract fix bug
if miner.PriceValid(a2BOrder, b2AOrder) && a2BOrder.RawOrder.Owner != b2AOrder.RawOrder.Owner {
if candidateRing, err := market.GenerateCandidateRing(a2BOrder, b2AOrder); nil != err {
log.Errorf("err:%s", err.Error())
continue
} else {
if candidateRing.received.Sign() > 0 {
candidateRingList = append(candidateRingList, *candidateRing)
} else {
log.Debugf("timing_matchher, market ringForSubmit received not enough, received:%s, cost:%s ", candidateRing.received.FloatString(0), candidateRing.cost.FloatString(0))
}
}
}
}
}
log.Debugf("match round:%s, market: %s -> %s , candidateRingList.length:%d", market.matcher.lastRoundNumber, market.TokenA.Hex(), market.TokenB.Hex(), len(candidateRingList))
//the ring that can get max received
list := candidateRingList
for {
if len(list) <= 0 {
break
}
sort.Sort(list)
candidateRing := list[0]
list = list[1:]
orders := []*types.OrderState{}
for hash, _ := range candidateRing.filledOrders {
if o, exists := market.AtoBOrders[hash]; exists {
orders = append(orders, o)
} else {
orders = append(orders, market.BtoAOrders[hash])
}
}
if ringForSubmit, err := market.generateRingSubmitInfo(orders...); nil != err {
log.Debugf("generate RingSubmitInfo err:%s", err.Error())
continue
} else {
if exists, err := CachedMatchedRing(ringForSubmit.Ringhash); nil != err || exists {
if nil != err {
log.Error(err.Error())
} else {
log.Errorf("ringhash:%s has been submitted", ringForSubmit.Ringhash.Hex())
}
continue
}
uniqueId := ringForSubmit.RawRing.GenerateUniqueId()
if failedCount, err := RingExecuteFailedCount(uniqueId); nil == err && failedCount > market.matcher.maxFailedCount {
log.Debugf("ringSubmitInfo.UniqueId:%s , ringhash: %s , has been failed to submit %d times", uniqueId.Hex(), ringForSubmit.Ringhash.Hex(), failedCount)
continue
}
//todo:for test, release this limit
if ringForSubmit.RawRing.Received.Sign() > 0 {
for _, filledOrder := range ringForSubmit.RawRing.Orders {
orderState := market.reduceAmountAfterFilled(filledOrder)
isFullFilled := market.om.IsOrderFullFinished(orderState)
matchedOrderHashes[filledOrder.OrderState.RawOrder.Hash] = isFullFilled
//market.matcher.rounds.AppendFilledOrderToCurrent(filledOrder, ringForSubmit.RawRing.Hash)
list = market.reduceReceivedOfCandidateRing(list, filledOrder, isFullFilled)
}
AddMinedRing(ringForSubmit)
ringSubmitInfos = append(ringSubmitInfos, ringForSubmit)
} else {
log.Debugf("ring:%s will not be submitted,because of received:%s", ringForSubmit.RawRing.Hash.Hex(), ringForSubmit.RawRing.Received.String())
}
}
}
for orderHash, _ := range market.AtoBOrders {
fullFilled, exists := matchedOrderHashes[orderHash]
if exists && fullFilled {
market.AtoBOrderHashesExcludeNextRound = append(market.AtoBOrderHashesExcludeNextRound, orderHash)
} else if !exists && (len(market.AtoBOrders) >= market.matcher.roundOrderCount) {
market.AtoBOrderHashesExcludeNextRound = append(market.AtoBOrderHashesExcludeNextRound, orderHash)
}
}
for orderHash, _ := range market.BtoAOrders {
fullFilled, exists := matchedOrderHashes[orderHash]
if exists && fullFilled {
market.BtoAOrderHashesExcludeNextRound = append(market.BtoAOrderHashesExcludeNextRound, orderHash)
} else if !exists && (len(market.BtoAOrders) >= market.matcher.roundOrderCount) {
market.AtoBOrderHashesExcludeNextRound = append(market.AtoBOrderHashesExcludeNextRound, orderHash)
}
}
if len(ringSubmitInfos) > 0 {
eventemitter.Emit(eventemitter.Miner_NewRing, ringSubmitInfos)
}
}
func (market *Market) reduceReceivedOfCandidateRing(list CandidateRingList, filledOrder *types.FilledOrder, isFullFilled bool) CandidateRingList {
resList := CandidateRingList{}
hash := filledOrder.OrderState.RawOrder.Hash
for _, ring := range list {
if amountS, exists := ring.filledOrders[hash]; exists {
if isFullFilled {
continue
}
availableAmountS := new(big.Rat)
availableAmountS.Sub(filledOrder.AvailableAmountS, filledOrder.FillAmountS)
if availableAmountS.Sign() > 0 {
var remainedAmountS *big.Rat
if amountS.Cmp(availableAmountS) >= 0 {
remainedAmountS = availableAmountS
} else {
remainedAmountS = amountS
}
log.Debugf("reduceReceivedOfCandidateRing, filledOrder.availableAmountS:%s, filledOrder.FillAmountS:%s, amountS:%s", filledOrder.AvailableAmountS.FloatString(3), filledOrder.FillAmountS.FloatString(3), amountS.FloatString(3))
rate := new(big.Rat)
rate.Quo(remainedAmountS, amountS)
remainedReceived := new(big.Rat).Add(ring.received, ring.cost)
remainedReceived.Mul(remainedReceived, rate).Sub(remainedReceived, ring.cost)
//todo:
if remainedReceived.Sign() <= 0 {
continue
}
for hash, amount := range ring.filledOrders {
ring.filledOrders[hash] = amount.Mul(amount, rate)
}
resList = append(resList, ring)
}
} else {
resList = append(resList, ring)
}
}
return resList
}
/**
get orders from ordermanager
*/
func (market *Market) getOrdersForMatching(delegateAddress common.Address) {
market.AtoBOrders = make(map[common.Hash]*types.OrderState)
market.BtoAOrders = make(map[common.Hash]*types.OrderState)
// log.Debugf("timing matcher,market tokenA:%s, tokenB:%s, atob hash length:%d, btoa hash length:%d", market.TokenA.Hex(), market.TokenB.Hex(), len(market.AtoBOrderHashesExcludeNextRound), len(market.BtoAOrderHashesExcludeNextRound))
currentRoundNumber := market.matcher.lastRoundNumber.Int64()
deleyedNumber := market.matcher.delayedNumber + currentRoundNumber
atoBOrders := market.om.MinerOrders(delegateAddress, market.TokenA, market.TokenB, market.matcher.roundOrderCount, market.matcher.reservedTime, int64(0), currentRoundNumber, &types.OrderDelayList{OrderHash: market.AtoBOrderHashesExcludeNextRound, DelayedCount: deleyedNumber})
if len(atoBOrders) < market.matcher.roundOrderCount {
orderCount := market.matcher.roundOrderCount - len(atoBOrders)
orders := market.om.MinerOrders(delegateAddress, market.TokenA, market.TokenB, orderCount, market.matcher.reservedTime, currentRoundNumber+1, currentRoundNumber+market.matcher.delayedNumber)
atoBOrders = append(atoBOrders, orders...)
}
btoAOrders := market.om.MinerOrders(delegateAddress, market.TokenB, market.TokenA, market.matcher.roundOrderCount, market.matcher.reservedTime, int64(0), currentRoundNumber, &types.OrderDelayList{OrderHash: market.BtoAOrderHashesExcludeNextRound, DelayedCount: deleyedNumber})
if len(btoAOrders) < market.matcher.roundOrderCount {
orderCount := market.matcher.roundOrderCount - len(btoAOrders)
orders := market.om.MinerOrders(delegateAddress, market.TokenB, market.TokenA, orderCount, market.matcher.reservedTime, currentRoundNumber+1, currentRoundNumber+market.matcher.delayedNumber)
btoAOrders = append(btoAOrders, orders...)
}
//log.Debugf("#### %s,%s %d,%d %d",market.TokenA.Hex(),market.TokenB.Hex(), len(atoBOrders), len(btoAOrders),market.matcher.roundOrderCount)
market.AtoBOrderHashesExcludeNextRound = []common.Hash{}
market.BtoAOrderHashesExcludeNextRound = []common.Hash{}
for _, order := range atoBOrders {
market.reduceRemainedAmountBeforeMatch(order)
if !market.om.IsOrderFullFinished(order) {
market.AtoBOrders[order.RawOrder.Hash] = order
} else {
market.AtoBOrderHashesExcludeNextRound = append(market.AtoBOrderHashesExcludeNextRound, order.RawOrder.Hash)
}
log.Debugf("order status in this new round:%s, orderhash:%s, DealtAmountS:%s, ", market.matcher.lastRoundNumber.String(), order.RawOrder.Hash.Hex(), order.DealtAmountS.String())
}
for _, order := range btoAOrders {
market.reduceRemainedAmountBeforeMatch(order)
if !market.om.IsOrderFullFinished(order) {
market.BtoAOrders[order.RawOrder.Hash] = order
} else {
market.BtoAOrderHashesExcludeNextRound = append(market.BtoAOrderHashesExcludeNextRound, order.RawOrder.Hash)
}
log.Debugf("order status in this new round:%s, orderhash:%s, DealtAmountS:%s", market.matcher.lastRoundNumber.String(), order.RawOrder.Hash.Hex(), order.DealtAmountS.String())
}
}
//sub the matched amount in new round.
func (market *Market) reduceRemainedAmountBeforeMatch(orderState *types.OrderState) {
orderHash := orderState.RawOrder.Hash
if amountS, amountB, err := DealtAmount(orderHash); nil != err {
log.Errorf("err:%s", err.Error())
} else {
log.Debugf("reduceRemainedAmountBeforeMatch:%s, %s, %s", orderState.RawOrder.Owner.Hex(), amountS.String(), amountB.String())
orderState.DealtAmountB.Add(orderState.DealtAmountB, ratToInt(amountB))
orderState.DealtAmountS.Add(orderState.DealtAmountS, ratToInt(amountS))
}
}
func (market *Market) reduceAmountAfterFilled(filledOrder *types.FilledOrder) *types.OrderState {
filledOrderState := filledOrder.OrderState
var orderState *types.OrderState
//only one of DealtAmountB and DealtAmountS is precise
if filledOrderState.RawOrder.TokenS == market.TokenA {
orderState = market.AtoBOrders[filledOrderState.RawOrder.Hash]
orderState.DealtAmountB.Add(orderState.DealtAmountB, ratToInt(filledOrder.FillAmountB))
orderState.DealtAmountS.Add(orderState.DealtAmountS, ratToInt(filledOrder.FillAmountS))
} else {
orderState = market.BtoAOrders[filledOrderState.RawOrder.Hash]
orderState.DealtAmountB.Add(orderState.DealtAmountB, ratToInt(filledOrder.FillAmountB))
orderState.DealtAmountS.Add(orderState.DealtAmountS, ratToInt(filledOrder.FillAmountS))
}
log.Debugf("order status after matched, orderhash:%s,filledAmountS:%s, DealtAmountS:%s, ", orderState.RawOrder.Hash.Hex(), filledOrder.FillAmountS.String(), orderState.DealtAmountS.String())
//reduced account balance
return orderState
}
func (market *Market) GenerateCandidateRing(orders ...*types.OrderState) (*CandidateRing, error) {
filledOrders := []*types.FilledOrder{}
//miner will received nothing, if miner set FeeSelection=1 and he doesn't have enough lrc
for _, order := range orders {
if filledOrder, err := market.generateFilledOrder(order); nil != err {
log.Errorf("err:%s", err.Error())
return nil, err
} else {
filledOrders = append(filledOrders, filledOrder)
}
}
ringTmp := miner.NewRing(filledOrders)
if err := market.matcher.evaluator.ComputeRing(ringTmp); nil != err {
return nil, err
} else {
candidateRing := &CandidateRing{cost: ringTmp.LegalCost, received: ringTmp.Received, filledOrders: make(map[common.Hash]*big.Rat)}
for _, filledOrder := range ringTmp.Orders {
log.Debugf("match, orderhash:%s, filledOrder.FilledAmountS:%s", filledOrder.OrderState.RawOrder.Hash.Hex(), filledOrder.FillAmountS.FloatString(3))
candidateRing.filledOrders[filledOrder.OrderState.RawOrder.Hash] = filledOrder.FillAmountS
}
return candidateRing, nil
}
}
func (market *Market) generateFilledOrder(order *types.OrderState) (*types.FilledOrder, error) {
lrcTokenBalance, err := market.matcher.GetAccountAvailableAmount(order.RawOrder.Owner, market.protocolImpl.LrcTokenAddress, market.protocolImpl.DelegateAddress)
if nil != err {
return nil, err
}
tokenSBalance, err := market.matcher.GetAccountAvailableAmount(order.RawOrder.Owner, order.RawOrder.TokenS, market.protocolImpl.DelegateAddress)
if nil != err {
return nil, err
}
if tokenSBalance.Sign() <= 0 {
return nil, fmt.Errorf("owner:%s token:%s balance or allowance is zero", order.RawOrder.Owner.Hex(), order.RawOrder.TokenS.Hex())
}
//todo:
if market.om.IsValueDusted(order.RawOrder.TokenS, tokenSBalance) {
return nil, fmt.Errorf("owner:%s token:%s balance or allowance is not enough", order.RawOrder.Owner.Hex(), order.RawOrder.TokenS.Hex())
}
return types.ConvertOrderStateToFilledOrder(*order, lrcTokenBalance, tokenSBalance, market.protocolImpl.LrcTokenAddress), nil
}
func (market *Market) generateRingSubmitInfo(orders ...*types.OrderState) (*types.RingSubmitInfo, error) {
filledOrders := []*types.FilledOrder{}
//miner will received nothing, if miner set FeeSelection=1 and he doesn't have enough lrc
for _, order := range orders {
if filledOrder, err := market.generateFilledOrder(order); nil != err {
log.Errorf("err:%s", err.Error())
return nil, err
} else {
filledOrders = append(filledOrders, filledOrder)
}
}
ringTmp := miner.NewRing(filledOrders)
if err := market.matcher.evaluator.ComputeRing(ringTmp); nil != err {
return nil, err
} else {
res, err := market.matcher.submitter.GenerateRingSubmitInfo(ringTmp)
return res, err
}
}
func NewMarket(protocolAddress *ethaccessor.ProtocolAddress, tokenS, tokenB common.Address, matcher *TimingMatcher, om ordermanager.OrderManager) *Market {
m := &Market{}
m.om = om
m.protocolImpl = protocolAddress
m.matcher = matcher
m.TokenA = tokenS
m.TokenB = tokenB
m.AtoBOrderHashesExcludeNextRound = []common.Hash{}
m.BtoAOrderHashesExcludeNextRound = []common.Hash{}
return m
}
func ratToInt(rat *big.Rat) *big.Int {
return new(big.Int).Div(rat.Num(), rat.Denom())
}