forked from ALHP/ALHP.GO
Switched to parsing srcinfo with channels on all available cpus, speeding up srcinfo-parsing and queue generation by a lot. New memory-limit based building will max out the available memory while not building the same packages at the same time for different marchs, fixing some long-standing bugs like firefox not building at the same time because the same ports are used for profile-based optimization. This also drops the artificial delay on build-start, speeding up things even more. This also means there is no hard-coded limit on how many packages can be build at once anymore. As long as there is RAM available, builds will be started.
200 lines
5.0 KiB
Go
200 lines
5.0 KiB
Go
// Code generated by ent, DO NOT EDIT.
|
|
|
|
package hook
|
|
|
|
import (
|
|
"context"
|
|
"fmt"
|
|
|
|
"somegit.dev/ALHP/ALHP.GO/ent"
|
|
)
|
|
|
|
// The DbPackageFunc type is an adapter to allow the use of ordinary
|
|
// function as DbPackage mutator.
|
|
type DbPackageFunc func(context.Context, *ent.DbPackageMutation) (ent.Value, error)
|
|
|
|
// Mutate calls f(ctx, m).
|
|
func (f DbPackageFunc) Mutate(ctx context.Context, m ent.Mutation) (ent.Value, error) {
|
|
if mv, ok := m.(*ent.DbPackageMutation); ok {
|
|
return f(ctx, mv)
|
|
}
|
|
return nil, fmt.Errorf("unexpected mutation type %T. expect *ent.DbPackageMutation", m)
|
|
}
|
|
|
|
// Condition is a hook condition function.
|
|
type Condition func(context.Context, ent.Mutation) bool
|
|
|
|
// And groups conditions with the AND operator.
|
|
func And(first, second Condition, rest ...Condition) Condition {
|
|
return func(ctx context.Context, m ent.Mutation) bool {
|
|
if !first(ctx, m) || !second(ctx, m) {
|
|
return false
|
|
}
|
|
for _, cond := range rest {
|
|
if !cond(ctx, m) {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
}
|
|
|
|
// Or groups conditions with the OR operator.
|
|
func Or(first, second Condition, rest ...Condition) Condition {
|
|
return func(ctx context.Context, m ent.Mutation) bool {
|
|
if first(ctx, m) || second(ctx, m) {
|
|
return true
|
|
}
|
|
for _, cond := range rest {
|
|
if cond(ctx, m) {
|
|
return true
|
|
}
|
|
}
|
|
return false
|
|
}
|
|
}
|
|
|
|
// Not negates a given condition.
|
|
func Not(cond Condition) Condition {
|
|
return func(ctx context.Context, m ent.Mutation) bool {
|
|
return !cond(ctx, m)
|
|
}
|
|
}
|
|
|
|
// HasOp is a condition testing mutation operation.
|
|
func HasOp(op ent.Op) Condition {
|
|
return func(_ context.Context, m ent.Mutation) bool {
|
|
return m.Op().Is(op)
|
|
}
|
|
}
|
|
|
|
// HasAddedFields is a condition validating `.AddedField` on fields.
|
|
func HasAddedFields(field string, fields ...string) Condition {
|
|
return func(_ context.Context, m ent.Mutation) bool {
|
|
if _, exists := m.AddedField(field); !exists {
|
|
return false
|
|
}
|
|
for _, field := range fields {
|
|
if _, exists := m.AddedField(field); !exists {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
}
|
|
|
|
// HasClearedFields is a condition validating `.FieldCleared` on fields.
|
|
func HasClearedFields(field string, fields ...string) Condition {
|
|
return func(_ context.Context, m ent.Mutation) bool {
|
|
if exists := m.FieldCleared(field); !exists {
|
|
return false
|
|
}
|
|
for _, field := range fields {
|
|
if exists := m.FieldCleared(field); !exists {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
}
|
|
|
|
// HasFields is a condition validating `.Field` on fields.
|
|
func HasFields(field string, fields ...string) Condition {
|
|
return func(_ context.Context, m ent.Mutation) bool {
|
|
if _, exists := m.Field(field); !exists {
|
|
return false
|
|
}
|
|
for _, field := range fields {
|
|
if _, exists := m.Field(field); !exists {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
}
|
|
|
|
// If executes the given hook under condition.
|
|
//
|
|
// hook.If(ComputeAverage, And(HasFields(...), HasAddedFields(...)))
|
|
func If(hk ent.Hook, cond Condition) ent.Hook {
|
|
return func(next ent.Mutator) ent.Mutator {
|
|
return ent.MutateFunc(func(ctx context.Context, m ent.Mutation) (ent.Value, error) {
|
|
if cond(ctx, m) {
|
|
return hk(next).Mutate(ctx, m)
|
|
}
|
|
return next.Mutate(ctx, m)
|
|
})
|
|
}
|
|
}
|
|
|
|
// On executes the given hook only for the given operation.
|
|
//
|
|
// hook.On(Log, ent.Delete|ent.Create)
|
|
func On(hk ent.Hook, op ent.Op) ent.Hook {
|
|
return If(hk, HasOp(op))
|
|
}
|
|
|
|
// Unless skips the given hook only for the given operation.
|
|
//
|
|
// hook.Unless(Log, ent.Update|ent.UpdateOne)
|
|
func Unless(hk ent.Hook, op ent.Op) ent.Hook {
|
|
return If(hk, Not(HasOp(op)))
|
|
}
|
|
|
|
// FixedError is a hook returning a fixed error.
|
|
func FixedError(err error) ent.Hook {
|
|
return func(ent.Mutator) ent.Mutator {
|
|
return ent.MutateFunc(func(context.Context, ent.Mutation) (ent.Value, error) {
|
|
return nil, err
|
|
})
|
|
}
|
|
}
|
|
|
|
// Reject returns a hook that rejects all operations that match op.
|
|
//
|
|
// func (T) Hooks() []ent.Hook {
|
|
// return []ent.Hook{
|
|
// Reject(ent.Delete|ent.Update),
|
|
// }
|
|
// }
|
|
func Reject(op ent.Op) ent.Hook {
|
|
hk := FixedError(fmt.Errorf("%s operation is not allowed", op))
|
|
return On(hk, op)
|
|
}
|
|
|
|
// Chain acts as a list of hooks and is effectively immutable.
|
|
// Once created, it will always hold the same set of hooks in the same order.
|
|
type Chain struct {
|
|
hooks []ent.Hook
|
|
}
|
|
|
|
// NewChain creates a new chain of hooks.
|
|
func NewChain(hooks ...ent.Hook) Chain {
|
|
return Chain{append([]ent.Hook(nil), hooks...)}
|
|
}
|
|
|
|
// Hook chains the list of hooks and returns the final hook.
|
|
func (c Chain) Hook() ent.Hook {
|
|
return func(mutator ent.Mutator) ent.Mutator {
|
|
for i := len(c.hooks) - 1; i >= 0; i-- {
|
|
mutator = c.hooks[i](mutator)
|
|
}
|
|
return mutator
|
|
}
|
|
}
|
|
|
|
// Append extends a chain, adding the specified hook
|
|
// as the last ones in the mutation flow.
|
|
func (c Chain) Append(hooks ...ent.Hook) Chain {
|
|
newHooks := make([]ent.Hook, 0, len(c.hooks)+len(hooks))
|
|
newHooks = append(newHooks, c.hooks...)
|
|
newHooks = append(newHooks, hooks...)
|
|
return Chain{newHooks}
|
|
}
|
|
|
|
// Extend extends a chain, adding the specified chain
|
|
// as the last ones in the mutation flow.
|
|
func (c Chain) Extend(chain Chain) Chain {
|
|
return c.Append(chain.hooks...)
|
|
}
|