Merge pull request #10601 from ziggie1984/invoice-filter-index-optimization

invoices/sql_store: replace catch-all FilterInvoices with targeted index-friendly queries
This commit is contained in:
Olaoluwa Osuntokun authored and GitHub committed 2026-02-24 16:34:27 -08:00
commit 0b00c66231
7 files changed
+606 -146

No files matched your search

@@ -139,6 +139,16 @@
## Performance Improvements
* [Replace the catch-all `FilterInvoices` SQL query with five focused,
index-friendly queries](https://github.com/lightningnetwork/lnd/pull/10601)
(`FetchPendingInvoices`, `FilterInvoicesBySettleIndex`,
`FilterInvoicesByAddIndex`, `FilterInvoicesForward`,
`FilterInvoicesReverse`). The old query used `col >= $param OR $param IS
NULL` predicates and a `CASE`-based `ORDER BY` that prevented SQLite's query
planner from using indexes, causing full table scans. Each new query carries
only the parameters it actually needs and uses a direct `ORDER BY`, allowing
the planner to perform efficient index range scans on the invoice table.
## Deprecations
### ⚠️ **Warning:** The deprecated fee rate option `--sat_per_byte` will be removed in release version **0.22**
+113
View File
@@ -166,6 +166,10 @@ func TestInvoices(t *testing.T) {
name: "FetchPendingInvoices",
test: testFetchPendingInvoices,
},
{
name: "FetchPendingInvoicesAccepted",
test: testFetchPendingInvoicesAccepted,
},
{
name: "DuplicateSettleInvoice",
test: testDuplicateSettleInvoice,
@@ -1288,6 +1292,115 @@ func testFetchPendingInvoices(t *testing.T,
require.Equal(t, pendingInvoices, pending)
}
// testFetchPendingInvoicesAccepted verifies that FetchPendingInvoices returns
// invoices in both ContractOpen (state 0) and ContractAccepted (state 3)
// states, and that ContractSettled (state 1) and ContractCanceled (state 2)
// invoices are excluded. This specifically exercises the `state IN (0, 3)`
// predicate in the underlying SQL query.
func testFetchPendingInvoicesAccepted(t *testing.T,
makeDB func(t *testing.T) invpkg.InvoiceDB) {
t.Parallel()
db := makeDB(t)
ctxb := t.Context()
amt := lnwire.MilliSatoshi(1000)
// Add an invoice that stays in ContractOpen state.
openInvoice, err := randInvoice(amt)
require.NoError(t, err)
openHash := openInvoice.Terms.PaymentPreimage.Hash()
_, err = db.AddInvoice(ctxb, openInvoice, openHash)
require.NoError(t, err)
// Add a second invoice and transition it to ContractAccepted by
// adding an HTLC while setting the new invoice state in a single
// UpdateInvoice call (addHTLCs processes the HTLC list before
// validating the state transition, so the empty-set check passes).
acceptedInvoice, err := randInvoice(amt)
require.NoError(t, err)
acceptedHash := acceptedInvoice.Terms.PaymentPreimage.Hash()
_, err = db.AddInvoice(ctxb, acceptedInvoice, acceptedHash)
require.NoError(t, err)
acceptKey := models.CircuitKey{HtlcID: 1}
acceptRef := invpkg.InvoiceRefByHash(acceptedHash)
addHtlcs := map[models.CircuitKey]*invpkg.HtlcAcceptDesc{
acceptKey: {
Amt: amt,
CustomRecords: make(
record.CustomSet,
),
},
}
dbAccepted, err := db.UpdateInvoice(
ctxb, acceptRef, nil,
func(inv *invpkg.Invoice) (*invpkg.InvoiceUpdateDesc, error) {
return &invpkg.InvoiceUpdateDesc{
UpdateType: invpkg.AddHTLCsUpdate,
State: &invpkg.InvoiceStateUpdateDesc{
NewState: invpkg.ContractAccepted,
},
AddHtlcs: addHtlcs,
}, nil
},
)
require.NoError(t, err)
require.Equal(t, invpkg.ContractAccepted, dbAccepted.State)
// Add a settled invoice – it must NOT appear in the pending result.
settledInvoice, err := randInvoice(amt)
require.NoError(t, err)
settledHash := settledInvoice.Terms.PaymentPreimage.Hash()
_, err = db.AddInvoice(ctxb, settledInvoice, settledHash)
require.NoError(t, err)
_, err = db.UpdateInvoice(
ctxb, invpkg.InvoiceRefByHash(settledHash), nil,
getUpdateInvoice(2, amt),
)
require.NoError(t, err)
// Add a canceled invoice – it must also NOT appear in the pending
// result, verifying that state 2 (ContractCanceled) is excluded by
// the `state IN (0, 3)` SQL predicate.
canceledInvoice, err := randInvoice(amt)
require.NoError(t, err)
canceledHash := canceledInvoice.Terms.PaymentPreimage.Hash()
_, err = db.AddInvoice(ctxb, canceledInvoice, canceledHash)
require.NoError(t, err)
_, err = db.UpdateInvoice(
ctxb, invpkg.InvoiceRefByHash(canceledHash), nil,
func(inv *invpkg.Invoice) (*invpkg.InvoiceUpdateDesc, error) {
return &invpkg.InvoiceUpdateDesc{
UpdateType: invpkg.CancelInvoiceUpdate,
State: &invpkg.InvoiceStateUpdateDesc{
NewState: invpkg.ContractCanceled,
},
}, nil
},
)
require.NoError(t, err)
// FetchPendingInvoices must return exactly the two pending invoices.
pending, err := db.FetchPendingInvoices(ctxb)
require.NoError(t, err)
require.Len(t, pending, 2)
_, hasOpen := pending[openHash]
require.True(t, hasOpen, "ContractOpen invoice missing from results")
_, hasAccepted := pending[acceptedHash]
require.True(t, hasAccepted, "ContractAccepted invoice missing")
require.NotContains(t, pending, settledHash,
"ContractSettled invoice should not appear in pending results")
require.NotContains(t, pending, canceledHash,
"ContractCanceled invoice should not appear in pending results")
require.Equal(t, invpkg.ContractOpen, pending[openHash].State)
require.Equal(t, invpkg.ContractAccepted, pending[acceptedHash].State)
}
// testDuplicateSettleInvoice tests that if we add a new invoice and settle it
// twice, then the second time we also receive the invoice that we settled as a
// return argument.
+118 -52
View File
@@ -30,6 +30,24 @@ const (
invoiceProgressLogInterval = 30 * time.Second
)
var (
// invoiceCreatedAfterDefault is the lower-bound sentinel for the
// created_at timestamp filter used by FilterInvoicesForward and
// FilterInvoicesReverse. time.Unix(0, 0) precedes any real invoice
// creation date, so passing this value tells the planner "no lower
// bound" while still providing a concrete, non-nullable parameter.
invoiceCreatedAfterDefault = time.Unix(0, 0).UTC()
// invoiceCreatedBeforeDefault is the upper-bound sentinel for the
// created_at timestamp filter. Year 9999 lies far beyond any
// foreseeable invoice creation date, so passing this value tells the
// planner "no upper bound" while still keeping the parameter
// non-nullable.
invoiceCreatedBeforeDefault = time.Date(
9999, 12, 31, 23, 59, 59, 0, time.UTC,
)
)
// SQLInvoiceQueries is an interface that defines the set of operations that can
// be executed against the invoice SQL database.
type SQLInvoiceQueries interface { //nolint:interfacebloat
@@ -49,8 +67,38 @@ type SQLInvoiceQueries interface { //nolint:interfacebloat
InsertInvoiceHTLCCustomRecord(ctx context.Context,
arg sqlc.InsertInvoiceHTLCCustomRecordParams) error
FilterInvoices(ctx context.Context,
arg sqlc.FilterInvoicesParams) ([]sqlc.Invoice, error)
// FetchPendingInvoices returns all open/accepted invoices ordered by
// id ascending. It replaces the old catch-all FilterInvoices for the
// pending-only path and lets the planner use invoices_state_idx.
FetchPendingInvoices(ctx context.Context,
arg sqlc.FetchPendingInvoicesParams) ([]sqlc.Invoice, error)
// FilterInvoicesBySettleIndex returns settled invoices whose
// settle_index is >= the given bound, ordered by id ascending. The
// caller must always supply a concrete lower bound so the planner can
// use invoices_settle_index_idx.
FilterInvoicesBySettleIndex(ctx context.Context,
arg sqlc.FilterInvoicesBySettleIndexParams) ([]sqlc.Invoice,
error)
// FilterInvoicesByAddIndex returns invoices whose primary-key id is >=
// the given bound, ordered by id ascending. Because id is the primary
// key, this is always a range scan on the clustered index.
FilterInvoicesByAddIndex(ctx context.Context,
arg sqlc.FilterInvoicesByAddIndexParams) ([]sqlc.Invoice, error)
// FilterInvoicesForward returns invoices in ascending id order. All
// parameters are non-nullable so the planner always sees plain range
// predicates. Callers must supply Go-side defaults for unused filters
// (see FilterInvoicesForwardParams).
FilterInvoicesForward(ctx context.Context,
arg sqlc.FilterInvoicesForwardParams) ([]sqlc.Invoice, error)
// FilterInvoicesReverse is the descending counterpart of
// FilterInvoicesForward. See FilterInvoicesForwardParams for the
// expected Go-side defaults.
FilterInvoicesReverse(ctx context.Context,
arg sqlc.FilterInvoicesReverseParams) ([]sqlc.Invoice, error)
GetInvoice(ctx context.Context,
arg sqlc.GetInvoiceParams) ([]sqlc.Invoice, error)
@@ -721,14 +769,12 @@ func (i *SQLStore) FetchPendingInvoices(ctx context.Context) (
readTxOpt := sqldb.ReadTxOpt()
err := i.db.ExecTx(ctx, readTxOpt, func(db SQLInvoiceQueries) error {
return queryWithLimit(func(offset int) (int, error) {
params := sqlc.FilterInvoicesParams{
PendingOnly: true,
NumOffset: int32(offset),
NumLimit: int32(i.opts.paginationLimit),
Reverse: false,
params := sqlc.FetchPendingInvoicesParams{
NumOffset: int32(offset),
NumLimit: int32(i.opts.paginationLimit),
}
rows, err := db.FilterInvoices(ctx, params)
rows, err := db.FetchPendingInvoices(ctx, params)
if err != nil && !errors.Is(err, sql.ErrNoRows) {
return 0, fmt.Errorf("unable to get invoices "+
"from db: %w", err)
@@ -782,14 +828,15 @@ func (i *SQLStore) InvoicesSettledSince(ctx context.Context, idx uint64) (
readTxOpt := sqldb.ReadTxOpt()
err := i.db.ExecTx(ctx, readTxOpt, func(db SQLInvoiceQueries) error {
err := queryWithLimit(func(offset int) (int, error) {
params := sqlc.FilterInvoicesParams{
// settle_index is always provided here so the
// invoices_settle_index_idx index can be used.
params := sqlc.FilterInvoicesBySettleIndexParams{
SettleIndexGet: sqldb.SQLInt64(idx + 1),
NumOffset: int32(offset),
NumLimit: int32(i.opts.paginationLimit),
Reverse: false,
}
rows, err := db.FilterInvoices(ctx, params)
rows, err := db.FilterInvoicesBySettleIndex(ctx, params)
if err != nil && !errors.Is(err, sql.ErrNoRows) {
return 0, fmt.Errorf("unable to get invoices "+
"from db: %w", err)
@@ -928,14 +975,15 @@ func (i *SQLStore) InvoicesAddedSince(ctx context.Context, idx uint64) (
readTxOpt := sqldb.ReadTxOpt()
err := i.db.ExecTx(ctx, readTxOpt, func(db SQLInvoiceQueries) error {
return queryWithLimit(func(offset int) (int, error) {
params := sqlc.FilterInvoicesParams{
AddIndexGet: sqldb.SQLInt64(idx + 1),
// id is always provided here so the primary-key
// index is used for this range scan.
params := sqlc.FilterInvoicesByAddIndexParams{
AddIndexGet: int64(idx + 1),
NumOffset: int32(offset),
NumLimit: int32(i.opts.paginationLimit),
Reverse: false,
}
rows, err := db.FilterInvoices(ctx, params)
rows, err := db.FilterInvoicesByAddIndex(ctx, params)
if err != nil && !errors.Is(err, sql.ErrNoRows) {
return 0, fmt.Errorf("unable to get invoices "+
"from db: %w", err)
@@ -996,53 +1044,71 @@ func (i *SQLStore) QueryInvoices(ctx context.Context,
"be non-zero")
}
// Default date bounds: use the package-level sentinels so that the
// planner always receives a concrete, non-nullable value and can use
// the created_at index without OR-based fallbacks.
createdAfter := invoiceCreatedAfterDefault
if q.CreationDateStart != 0 {
createdAfter = time.Unix(q.CreationDateStart, 0).UTC()
}
createdBefore := invoiceCreatedBeforeDefault
if q.CreationDateEnd != 0 {
// Add 1 second so the end boundary is inclusive: the SQL
// predicate is strict less-than (created_at < createdBefore).
createdBefore = time.Unix(q.CreationDateEnd+1, 0).UTC()
}
readTxOpt := sqldb.ReadTxOpt()
err := i.db.ExecTx(ctx, readTxOpt, func(db SQLInvoiceQueries) error {
return queryWithLimit(func(offset int) (int, error) {
params := sqlc.FilterInvoicesParams{
NumOffset: int32(offset),
NumLimit: int32(i.opts.paginationLimit),
PendingOnly: q.PendingOnly,
Reverse: q.Reversed,
}
var (
rows []sqlc.Invoice
err error
limit = int32(i.opts.paginationLimit)
)
if q.Reversed {
// If the index offset was not set, we want to
// fetch from the lastest invoice.
if q.IndexOffset == 0 {
params.AddIndexLet = sqldb.SQLInt64(
int64(math.MaxInt64),
)
} else {
// The invoice with index offset id must
// not be included in the results.
params.AddIndexLet = sqldb.SQLInt64(
q.IndexOffset - 1,
)
// For reverse queries the upper id bound is
// always provided. When no offset is given we
// start from the most recently added invoice.
addIndexLet := int64(math.MaxInt64)
if q.IndexOffset != 0 {
// The invoice at IndexOffset must not
// appear in the results.
addIndexLet = int64(q.IndexOffset) - 1
}
params := sqlc.FilterInvoicesReverseParams{
AddIndexLet: addIndexLet,
PendingOnly: q.PendingOnly,
CreatedAfter: createdAfter,
CreatedBefore: createdBefore,
NumOffset: int32(offset),
NumLimit: limit,
}
rows, err = db.FilterInvoicesReverse(
ctx, params,
)
} else {
// The invoice with index offset id must not be
// included in the results.
params.AddIndexGet = sqldb.SQLInt64(
q.IndexOffset + 1,
// For forward queries the lower id bound is
// always provided. IndexOffset 0 means "start
// from the very first invoice" (id >= 1).
params := sqlc.FilterInvoicesForwardParams{
AddIndexGet: int64(q.IndexOffset) + 1,
PendingOnly: q.PendingOnly,
CreatedAfter: createdAfter,
CreatedBefore: createdBefore,
NumOffset: int32(offset),
NumLimit: limit,
}
rows, err = db.FilterInvoicesForward(
ctx, params,
)
}
if q.CreationDateStart != 0 {
params.CreatedAfter = sqldb.SQLTime(
time.Unix(q.CreationDateStart, 0).UTC(),
)
}
if q.CreationDateEnd != 0 {
// We need to add 1 to the end date as we're
// checking less than the end date in SQL.
params.CreatedBefore = sqldb.SQLTime(
time.Unix(q.CreationDateEnd+1, 0).UTC(),
)
}
rows, err := db.FilterInvoices(ctx, params)
if err != nil && !errors.Is(err, sql.ErrNoRows) {
return 0, fmt.Errorf("unable to get invoices "+
"from db: %w", err)
+2 -2
View File
@@ -113,8 +113,8 @@ func testInvoiceExpiryMigration(t *testing.T, makeDB makeMigrationTestDB) {
// AMP invoices.
err = migrate(TargetVersion(4))
invoices, err := db.FilterInvoices(ctxb, sqlc.FilterInvoicesParams{
AddIndexGet: SQLInt64(1),
invoices, err := db.FilterInvoicesByAddIndex(ctxb, sqlc.FilterInvoicesByAddIndexParams{
AddIndexGet: 1,
NumLimit: 100,
})
+275 -54
View File
@@ -64,74 +64,295 @@ func (q *Queries) DeleteInvoice(ctx context.Context, arg DeleteInvoiceParams) (s
)
}
const filterInvoices = `-- name: FilterInvoices :many
const fetchPendingInvoices = `-- name: FetchPendingInvoices :many
SELECT
invoices.id, invoices.hash, invoices.preimage, invoices.settle_index, invoices.settled_at, invoices.memo, invoices.amount_msat, invoices.cltv_delta, invoices.expiry, invoices.payment_addr, invoices.payment_request, invoices.payment_request_hash, invoices.state, invoices.amount_paid_msat, invoices.is_amp, invoices.is_hodl, invoices.is_keysend, invoices.created_at
FROM invoices
WHERE (
id >= $1 OR
$1 IS NULL
) AND (
id <= $2 OR
$2 IS NULL
) AND (
settle_index >= $3 OR
$3 IS NULL
) AND (
settle_index <= $4 OR
$4 IS NULL
) AND (
state = $5 OR
$5 IS NULL
) AND (
created_at >= $6 OR
$6 IS NULL
) AND (
created_at < $7 OR
$7 IS NULL
) AND (
CASE
WHEN $8 = TRUE THEN (state = 0 OR state = 3)
ELSE TRUE
END
)
ORDER BY
CASE
WHEN $9 = FALSE OR $9 IS NULL THEN id
ELSE NULL
END ASC,
CASE
WHEN $9 = TRUE THEN id
ELSE NULL
END DESC
LIMIT $11 OFFSET $10
WHERE state IN (0, 3) -- 0 = ContractOpen, 3 = ContractAccepted
ORDER BY id ASC
LIMIT $2 OFFSET $1
`
type FilterInvoicesParams struct {
AddIndexGet sql.NullInt64
AddIndexLet sql.NullInt64
type FetchPendingInvoicesParams struct {
NumOffset int32
NumLimit int32
}
// FetchPendingInvoices returns all invoices in a pending state (open or
// accepted). The invoices_state_idx index on the state column makes this a
// fast index scan rather than a full table scan.
func (q *Queries) FetchPendingInvoices(ctx context.Context, arg FetchPendingInvoicesParams) ([]Invoice, error) {
rows, err := q.db.QueryContext(ctx, fetchPendingInvoices, arg.NumOffset, arg.NumLimit)
if err != nil {
return nil, err
}
defer rows.Close()
var items []Invoice
for rows.Next() {
var i Invoice
if err := rows.Scan(
&i.ID,
&i.Hash,
&i.Preimage,
&i.SettleIndex,
&i.SettledAt,
&i.Memo,
&i.AmountMsat,
&i.CltvDelta,
&i.Expiry,
&i.PaymentAddr,
&i.PaymentRequest,
&i.PaymentRequestHash,
&i.State,
&i.AmountPaidMsat,
&i.IsAmp,
&i.IsHodl,
&i.IsKeysend,
&i.CreatedAt,
); err != nil {
return nil, err
}
items = append(items, i)
}
if err := rows.Close(); err != nil {
return nil, err
}
if err := rows.Err(); err != nil {
return nil, err
}
return items, nil
}
const filterInvoicesByAddIndex = `-- name: FilterInvoicesByAddIndex :many
SELECT
invoices.id, invoices.hash, invoices.preimage, invoices.settle_index, invoices.settled_at, invoices.memo, invoices.amount_msat, invoices.cltv_delta, invoices.expiry, invoices.payment_addr, invoices.payment_request, invoices.payment_request_hash, invoices.state, invoices.amount_paid_msat, invoices.is_amp, invoices.is_hodl, invoices.is_keysend, invoices.created_at
FROM invoices
WHERE id >= $1
ORDER BY id ASC
LIMIT $3 OFFSET $2
`
type FilterInvoicesByAddIndexParams struct {
AddIndexGet int64
NumOffset int32
NumLimit int32
}
// FilterInvoicesByAddIndex returns invoices whose add_index (primary key id)
// is greater than or equal to the given value, ordered by id. Because id is
// the primary key, this is always an efficient range scan on the clustered
// index.
func (q *Queries) FilterInvoicesByAddIndex(ctx context.Context, arg FilterInvoicesByAddIndexParams) ([]Invoice, error) {
rows, err := q.db.QueryContext(ctx, filterInvoicesByAddIndex, arg.AddIndexGet, arg.NumOffset, arg.NumLimit)
if err != nil {
return nil, err
}
defer rows.Close()
var items []Invoice
for rows.Next() {
var i Invoice
if err := rows.Scan(
&i.ID,
&i.Hash,
&i.Preimage,
&i.SettleIndex,
&i.SettledAt,
&i.Memo,
&i.AmountMsat,
&i.CltvDelta,
&i.Expiry,
&i.PaymentAddr,
&i.PaymentRequest,
&i.PaymentRequestHash,
&i.State,
&i.AmountPaidMsat,
&i.IsAmp,
&i.IsHodl,
&i.IsKeysend,
&i.CreatedAt,
); err != nil {
return nil, err
}
items = append(items, i)
}
if err := rows.Close(); err != nil {
return nil, err
}
if err := rows.Err(); err != nil {
return nil, err
}
return items, nil
}
const filterInvoicesBySettleIndex = `-- name: FilterInvoicesBySettleIndex :many
SELECT
invoices.id, invoices.hash, invoices.preimage, invoices.settle_index, invoices.settled_at, invoices.memo, invoices.amount_msat, invoices.cltv_delta, invoices.expiry, invoices.payment_addr, invoices.payment_request, invoices.payment_request_hash, invoices.state, invoices.amount_paid_msat, invoices.is_amp, invoices.is_hodl, invoices.is_keysend, invoices.created_at
FROM invoices
WHERE settle_index >= $1
ORDER BY id ASC
LIMIT $3 OFFSET $2
`
type FilterInvoicesBySettleIndexParams struct {
SettleIndexGet sql.NullInt64
SettleIndexLet sql.NullInt64
State sql.NullInt16
CreatedAfter sql.NullTime
CreatedBefore sql.NullTime
PendingOnly interface{}
Reverse interface{}
NumOffset int32
NumLimit int32
}
func (q *Queries) FilterInvoices(ctx context.Context, arg FilterInvoicesParams) ([]Invoice, error) {
rows, err := q.db.QueryContext(ctx, filterInvoices,
// FilterInvoicesBySettleIndex returns settled invoices whose settle_index is
// greater than or equal to the given value, ordered by id. The caller must
// always supply a concrete lower bound so the invoices_settle_index_idx index
// can be used.
func (q *Queries) FilterInvoicesBySettleIndex(ctx context.Context, arg FilterInvoicesBySettleIndexParams) ([]Invoice, error) {
rows, err := q.db.QueryContext(ctx, filterInvoicesBySettleIndex, arg.SettleIndexGet, arg.NumOffset, arg.NumLimit)
if err != nil {
return nil, err
}
defer rows.Close()
var items []Invoice
for rows.Next() {
var i Invoice
if err := rows.Scan(
&i.ID,
&i.Hash,
&i.Preimage,
&i.SettleIndex,
&i.SettledAt,
&i.Memo,
&i.AmountMsat,
&i.CltvDelta,
&i.Expiry,
&i.PaymentAddr,
&i.PaymentRequest,
&i.PaymentRequestHash,
&i.State,
&i.AmountPaidMsat,
&i.IsAmp,
&i.IsHodl,
&i.IsKeysend,
&i.CreatedAt,
); err != nil {
return nil, err
}
items = append(items, i)
}
if err := rows.Close(); err != nil {
return nil, err
}
if err := rows.Err(); err != nil {
return nil, err
}
return items, nil
}
const filterInvoicesForward = `-- name: FilterInvoicesForward :many
SELECT
invoices.id, invoices.hash, invoices.preimage, invoices.settle_index, invoices.settled_at, invoices.memo, invoices.amount_msat, invoices.cltv_delta, invoices.expiry, invoices.payment_addr, invoices.payment_request, invoices.payment_request_hash, invoices.state, invoices.amount_paid_msat, invoices.is_amp, invoices.is_hodl, invoices.is_keysend, invoices.created_at
FROM invoices
WHERE id >= $1
AND (NOT $2 OR state IN (0, 3)) -- 0 = ContractOpen, 3 = ContractAccepted
AND created_at >= $3
AND created_at < $4
ORDER BY id ASC
LIMIT $6 OFFSET $5
`
type FilterInvoicesForwardParams struct {
AddIndexGet int64
PendingOnly interface{}
CreatedAfter time.Time
CreatedBefore time.Time
NumOffset int32
NumLimit int32
}
// FilterInvoicesForward returns invoices in ascending id order starting from
// add_index_get. All parameters are non-nullable so the planner always sees
// plain range predicates and can use the primary-key index. The caller is
// responsible for supplying Go-side defaults when a filter is not needed:
//
// created_after → time.Unix(0, 0).UTC() (epoch – before any invoice)
// created_before → time.Date(9999, …) (far future – no upper cap)
// pending_only → false (include all states)
func (q *Queries) FilterInvoicesForward(ctx context.Context, arg FilterInvoicesForwardParams) ([]Invoice, error) {
rows, err := q.db.QueryContext(ctx, filterInvoicesForward,
arg.AddIndexGet,
arg.AddIndexLet,
arg.SettleIndexGet,
arg.SettleIndexLet,
arg.State,
arg.PendingOnly,
arg.CreatedAfter,
arg.CreatedBefore,
arg.NumOffset,
arg.NumLimit,
)
if err != nil {
return nil, err
}
defer rows.Close()
var items []Invoice
for rows.Next() {
var i Invoice
if err := rows.Scan(
&i.ID,
&i.Hash,
&i.Preimage,
&i.SettleIndex,
&i.SettledAt,
&i.Memo,
&i.AmountMsat,
&i.CltvDelta,
&i.Expiry,
&i.PaymentAddr,
&i.PaymentRequest,
&i.PaymentRequestHash,
&i.State,
&i.AmountPaidMsat,
&i.IsAmp,
&i.IsHodl,
&i.IsKeysend,
&i.CreatedAt,
); err != nil {
return nil, err
}
items = append(items, i)
}
if err := rows.Close(); err != nil {
return nil, err
}
if err := rows.Err(); err != nil {
return nil, err
}
return items, nil
}
const filterInvoicesReverse = `-- name: FilterInvoicesReverse :many
SELECT
invoices.id, invoices.hash, invoices.preimage, invoices.settle_index, invoices.settled_at, invoices.memo, invoices.amount_msat, invoices.cltv_delta, invoices.expiry, invoices.payment_addr, invoices.payment_request, invoices.payment_request_hash, invoices.state, invoices.amount_paid_msat, invoices.is_amp, invoices.is_hodl, invoices.is_keysend, invoices.created_at
FROM invoices
WHERE id <= $1
AND (NOT $2 OR state IN (0, 3)) -- 0 = ContractOpen, 3 = ContractAccepted
AND created_at >= $3
AND created_at < $4
ORDER BY id DESC
LIMIT $6 OFFSET $5
`
type FilterInvoicesReverseParams struct {
AddIndexLet int64
PendingOnly interface{}
CreatedAfter time.Time
CreatedBefore time.Time
NumOffset int32
NumLimit int32
}
// FilterInvoicesReverse is the descending counterpart of FilterInvoicesForward.
// It returns invoices in descending id order up to and including add_index_let.
// See FilterInvoicesForward for the expected Go-side defaults.
func (q *Queries) FilterInvoicesReverse(ctx context.Context, arg FilterInvoicesReverseParams) ([]Invoice, error) {
rows, err := q.db.QueryContext(ctx, filterInvoicesReverse,
arg.AddIndexLet,
arg.PendingOnly,
arg.Reverse,
arg.CreatedAfter,
arg.CreatedBefore,
arg.NumOffset,
arg.NumLimit,
)
+26 -1
View File
@@ -31,8 +31,33 @@ type Querier interface {
DeleteZombieChannel(ctx context.Context, arg DeleteZombieChannelParams) (sql.Result, error)
FetchAMPSubInvoiceHTLCs(ctx context.Context, arg FetchAMPSubInvoiceHTLCsParams) ([]FetchAMPSubInvoiceHTLCsRow, error)
FetchAMPSubInvoices(ctx context.Context, arg FetchAMPSubInvoicesParams) ([]AmpSubInvoice, error)
// FetchPendingInvoices returns all invoices in a pending state (open or
// accepted). The invoices_state_idx index on the state column makes this a
// fast index scan rather than a full table scan.
FetchPendingInvoices(ctx context.Context, arg FetchPendingInvoicesParams) ([]Invoice, error)
FetchSettledAMPSubInvoices(ctx context.Context, arg FetchSettledAMPSubInvoicesParams) ([]FetchSettledAMPSubInvoicesRow, error)
FilterInvoices(ctx context.Context, arg FilterInvoicesParams) ([]Invoice, error)
// FilterInvoicesByAddIndex returns invoices whose add_index (primary key id)
// is greater than or equal to the given value, ordered by id. Because id is
// the primary key, this is always an efficient range scan on the clustered
// index.
FilterInvoicesByAddIndex(ctx context.Context, arg FilterInvoicesByAddIndexParams) ([]Invoice, error)
// FilterInvoicesBySettleIndex returns settled invoices whose settle_index is
// greater than or equal to the given value, ordered by id. The caller must
// always supply a concrete lower bound so the invoices_settle_index_idx index
// can be used.
FilterInvoicesBySettleIndex(ctx context.Context, arg FilterInvoicesBySettleIndexParams) ([]Invoice, error)
// FilterInvoicesForward returns invoices in ascending id order starting from
// add_index_get. All parameters are non-nullable so the planner always sees
// plain range predicates and can use the primary-key index. The caller is
// responsible for supplying Go-side defaults when a filter is not needed:
// created_after → time.Unix(0, 0).UTC() (epoch – before any invoice)
// created_before → time.Date(9999, …) (far future – no upper cap)
// pending_only → false (include all states)
FilterInvoicesForward(ctx context.Context, arg FilterInvoicesForwardParams) ([]Invoice, error)
// FilterInvoicesReverse is the descending counterpart of FilterInvoicesForward.
// It returns invoices in descending id order up to and including add_index_let.
// See FilterInvoicesForward for the expected Go-side defaults.
FilterInvoicesReverse(ctx context.Context, arg FilterInvoicesReverseParams) ([]Invoice, error)
GetAMPInvoiceID(ctx context.Context, setID []byte) (int64, error)
GetChannelAndNodesBySCID(ctx context.Context, arg GetChannelAndNodesBySCIDParams) (GetChannelAndNodesBySCIDRow, error)
GetChannelByOutpointWithPolicies(ctx context.Context, arg GetChannelByOutpointWithPoliciesParams) (GetChannelByOutpointWithPoliciesRow, error)
+62 -37
View File
@@ -65,46 +65,71 @@ FROM invoices i
INNER JOIN amp_sub_invoices a
ON i.id = a.invoice_id AND a.set_id = $1;
-- name: FilterInvoices :many
-- name: FetchPendingInvoices :many
-- FetchPendingInvoices returns all invoices in a pending state (open or
-- accepted). The invoices_state_idx index on the state column makes this a
-- fast index scan rather than a full table scan.
SELECT
invoices.*
FROM invoices
WHERE (
id >= sqlc.narg('add_index_get') OR
sqlc.narg('add_index_get') IS NULL
) AND (
id <= sqlc.narg('add_index_let') OR
sqlc.narg('add_index_let') IS NULL
) AND (
settle_index >= sqlc.narg('settle_index_get') OR
sqlc.narg('settle_index_get') IS NULL
) AND (
settle_index <= sqlc.narg('settle_index_let') OR
sqlc.narg('settle_index_let') IS NULL
) AND (
state = sqlc.narg('state') OR
sqlc.narg('state') IS NULL
) AND (
created_at >= sqlc.narg('created_after') OR
sqlc.narg('created_after') IS NULL
) AND (
created_at < sqlc.narg('created_before') OR
sqlc.narg('created_before') IS NULL
) AND (
CASE
WHEN sqlc.narg('pending_only') = TRUE THEN (state = 0 OR state = 3)
ELSE TRUE
END
)
ORDER BY
CASE
WHEN sqlc.narg('reverse') = FALSE OR sqlc.narg('reverse') IS NULL THEN id
ELSE NULL
END ASC,
CASE
WHEN sqlc.narg('reverse') = TRUE THEN id
ELSE NULL
END DESC
WHERE state IN (0, 3) -- 0 = ContractOpen, 3 = ContractAccepted
ORDER BY id ASC
LIMIT @num_limit OFFSET @num_offset;
-- name: FilterInvoicesBySettleIndex :many
-- FilterInvoicesBySettleIndex returns settled invoices whose settle_index is
-- greater than or equal to the given value, ordered by id. The caller must
-- always supply a concrete lower bound so the invoices_settle_index_idx index
-- can be used.
SELECT
invoices.*
FROM invoices
WHERE settle_index >= @settle_index_get
ORDER BY id ASC
LIMIT @num_limit OFFSET @num_offset;
-- name: FilterInvoicesByAddIndex :many
-- FilterInvoicesByAddIndex returns invoices whose add_index (primary key id)
-- is greater than or equal to the given value, ordered by id. Because id is
-- the primary key, this is always an efficient range scan on the clustered
-- index.
SELECT
invoices.*
FROM invoices
WHERE id >= @add_index_get
ORDER BY id ASC
LIMIT @num_limit OFFSET @num_offset;
-- name: FilterInvoicesForward :many
-- FilterInvoicesForward returns invoices in ascending id order starting from
-- add_index_get. All parameters are non-nullable so the planner always sees
-- plain range predicates and can use the primary-key index. The caller is
-- responsible for supplying Go-side defaults when a filter is not needed:
-- created_after → time.Unix(0, 0).UTC() (epoch – before any invoice)
-- created_before → time.Date(9999, …) (far future – no upper cap)
-- pending_only → false (include all states)
SELECT
invoices.*
FROM invoices
WHERE id >= @add_index_get
AND (NOT @pending_only OR state IN (0, 3)) -- 0 = ContractOpen, 3 = ContractAccepted
AND created_at >= @created_after
AND created_at < @created_before
ORDER BY id ASC
LIMIT @num_limit OFFSET @num_offset;
-- name: FilterInvoicesReverse :many
-- FilterInvoicesReverse is the descending counterpart of FilterInvoicesForward.
-- It returns invoices in descending id order up to and including add_index_let.
-- See FilterInvoicesForward for the expected Go-side defaults.
SELECT
invoices.*
FROM invoices
WHERE id <= @add_index_let
AND (NOT @pending_only OR state IN (0, 3)) -- 0 = ContractOpen, 3 = ContractAccepted
AND created_at >= @created_after
AND created_at < @created_before
ORDER BY id DESC
LIMIT @num_limit OFFSET @num_offset;
-- name: UpdateInvoiceState :execresult