/
lease.go
660 lines (589 loc) · 22.5 KB
/
lease.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
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
package server
import (
"context"
"fmt"
"io"
"math"
"sync/atomic"
"time"
"github.com/gogo/protobuf/types"
"github.com/grpc-ecosystem/go-grpc-middleware/logging/logrus/ctxlogrus"
"github.com/hashicorp/go-multierror"
pool "github.com/jolestar/go-commons-pool"
"github.com/pkg/errors"
log "github.com/sirupsen/logrus"
"golang.org/x/sync/errgroup"
"google.golang.org/grpc/codes"
"google.golang.org/grpc/status"
"k8s.io/apimachinery/pkg/api/resource"
"k8s.io/utils/clock"
"github.com/G-Research/armada/internal/armada/configuration"
"github.com/G-Research/armada/internal/armada/permissions"
"github.com/G-Research/armada/internal/armada/repository"
"github.com/G-Research/armada/internal/armada/scheduling"
"github.com/G-Research/armada/internal/common"
"github.com/G-Research/armada/internal/common/auth/authorization"
"github.com/G-Research/armada/internal/common/compress"
"github.com/G-Research/armada/internal/common/logging"
"github.com/G-Research/armada/internal/common/util"
"github.com/G-Research/armada/internal/scheduler"
"github.com/G-Research/armada/internal/scheduler/schedulerobjects"
"github.com/G-Research/armada/pkg/api"
)
type AggregatedQueueServer struct {
permissions authorization.PermissionChecker
schedulingConfig configuration.SchedulingConfig
jobRepository repository.JobRepository
queueRepository repository.QueueRepository
usageRepository repository.UsageRepository
eventStore repository.EventStore
schedulingInfoRepository repository.SchedulingInfoRepository
decompressorPool *pool.ObjectPool
clock clock.Clock
// For storing reports of scheduling attempts.
SchedulingReportsRepository *scheduler.SchedulingReportsRepository[*api.Job]
// Stores the most recent NodeDb for each executor.
// Used to check if a job could ever be scheduled at job submit time.
SubmitChecker *scheduler.SubmitChecker
}
func NewAggregatedQueueServer(
permissions authorization.PermissionChecker,
schedulingConfig configuration.SchedulingConfig,
jobRepository repository.JobRepository,
queueRepository repository.QueueRepository,
usageRepository repository.UsageRepository,
eventStore repository.EventStore,
schedulingInfoRepository repository.SchedulingInfoRepository,
) *AggregatedQueueServer {
poolConfig := pool.ObjectPoolConfig{
MaxTotal: 100,
MaxIdle: 50,
MinIdle: 10,
BlockWhenExhausted: true,
MinEvictableIdleTime: 30 * time.Minute,
SoftMinEvictableIdleTime: math.MaxInt64,
TimeBetweenEvictionRuns: 0,
NumTestsPerEvictionRun: 10,
}
decompressorPool := pool.NewObjectPool(context.Background(), pool.NewPooledObjectFactorySimple(
func(context.Context) (interface{}, error) {
return compress.NewZlibDecompressor()
}), &poolConfig)
return &AggregatedQueueServer{
permissions: permissions,
schedulingConfig: schedulingConfig,
jobRepository: jobRepository,
queueRepository: queueRepository,
usageRepository: usageRepository,
eventStore: eventStore,
schedulingInfoRepository: schedulingInfoRepository,
decompressorPool: decompressorPool,
clock: clock.RealClock{},
}
}
// StreamingLeaseJobs is called by the executor to request jobs for it to run.
// It streams jobs to the executor as quickly as it can and then waits to receive ids back.
// Only jobs for which an id was sent back are marked as leased.
//
// This function should be used instead of the LeaseJobs function in most cases.
func (q *AggregatedQueueServer) StreamingLeaseJobs(stream api.AggregatedQueue_StreamingLeaseJobsServer) error {
if err := checkPermission(q.permissions, stream.Context(), permissions.ExecuteJobs); err != nil {
return err
}
// Receive once to get info necessary to get jobs to lease.
req, err := stream.Recv()
if err != nil {
return errors.WithStack(err)
}
// Old scheduler resource accounting logic. Should be called on all requests.
err = q.usageRepository.UpdateClusterLeased(&req.ClusterLeasedReport)
if err != nil {
return err
}
nodeResources := scheduling.AggregateNodeTypeAllocations(req.Nodes)
clusterSchedulingInfo := scheduling.CreateClusterSchedulingInfoReport(req, nodeResources)
err = q.schedulingInfoRepository.UpdateClusterSchedulingInfo(clusterSchedulingInfo)
if err != nil {
return err
}
// New scheduler resource accounting logic.
usageByQueue := make(map[string]*schedulerobjects.QueueClusterResourceUsage)
for _, r := range req.GetClusterLeasedReport().Queues {
resourcesByPriority := make(map[int32]schedulerobjects.ResourceList)
for p, rs := range r.ResourcesLeasedByPriority {
resourcesByPriority[p] = schedulerobjects.ResourceList{
Resources: make(map[string]resource.Quantity),
}
for t, q := range rs.Resources {
resourcesByPriority[p].Resources[t] = q.DeepCopy()
}
}
report := &schedulerobjects.QueueClusterResourceUsage{
Created: q.clock.Now(),
Queue: r.Name,
ExecutorId: req.GetClusterLeasedReport().ClusterId,
ResourcesByPriority: resourcesByPriority,
}
usageByQueue[r.Name] = report
}
clusterUsageReport := q.createClusterUsageReport(usageByQueue, req.Pool)
err = q.usageRepository.UpdateClusterQueueResourceUsage(req.ClusterId, clusterUsageReport)
if err != nil {
return err
}
// Return no jobs if we don't have enough work.
var res common.ComputeResources = req.Resources
if res.AsFloat().IsLessThan(q.schedulingConfig.MinimumResourceToSchedule) {
return nil
}
// Get jobs to be leased.
jobs, err := q.getJobs(stream.Context(), req)
if err != nil {
return err
}
err = q.decompressJobOwnershipGroups(jobs)
if err != nil {
return err
}
// The server streams jobs to the executor.
// The executor streams back an ack for each received job.
// With each job sent to the executor, the server includes the number of received acks.
//
// When the connection breaks, the server expires all leases for which it hasn't received an ack
// and the executor expires all leases for which it hasn't received confirmation that the server received the ack.
//
// We track the total number of jobs and the number of jobs for which acks have been received.
// Because gRPC streams guarantee ordering, we only need to track the number of acks.
// The client is responsible for acking jobs in the order they are received.
numJobs := uint32(len(jobs))
var numAcked uint32
// Stream the jobs to the executor.
g, _ := errgroup.WithContext(stream.Context())
g.Go(func() error {
for _, job := range jobs {
err := stream.Send(&api.StreamingJobLease{
Job: job,
NumJobs: numJobs,
NumAcked: atomic.LoadUint32(&numAcked),
})
if err == io.EOF {
return nil
} else if err != nil {
return err
}
}
return nil
})
// Listen for job ids being streamed back as they're received.
g.Go(func() error {
numJobs := numJobs // Assign a local variable to guarantee there are no race conditions.
for atomic.LoadUint32(&numAcked) < numJobs {
ack, err := stream.Recv()
if err == io.EOF {
return nil
} else if err != nil {
return err
}
atomic.AddUint32(&numAcked, uint32(len(ack.ReceivedJobIds)))
}
return nil
})
// Wait for all jobs to have been sent and all acks to have been received.
err = g.Wait()
if err != nil {
log.WithError(err).Error("error sending/receiving job leases to/from executor")
}
// Send one more message with the total number of acks.
err = stream.Send(&api.StreamingJobLease{
Job: nil, // Omitted
NumJobs: numJobs,
NumAcked: numAcked,
})
if err != nil {
log.WithError(err).Error("error sending the number of acks")
}
// Create job leased events and write a leased report into Redis for all acked jobs.
ackedJobs := jobs[:numAcked]
reportJobsLeased(q.eventStore, ackedJobs, req.ClusterId)
var result *multierror.Error
clusterLeasedReport := scheduling.CreateClusterLeasedReport(req.ClusterLeasedReport.ClusterId, &req.ClusterLeasedReport, ackedJobs)
err = q.usageRepository.UpdateClusterLeased(clusterLeasedReport)
result = multierror.Append(result, err)
// scheduling.LeaseJobs (called above) automatically marks all returned jobs as leased.
// Return the leases of any non-acked jobs so that they can be re-leased.
for i := numAcked; i < numJobs; i++ {
_, err = q.jobRepository.ReturnLease(req.ClusterId, jobs[i].Id)
result = multierror.Append(result, err)
}
return result.ErrorOrNil()
}
func (q *AggregatedQueueServer) getJobs(ctx context.Context, req *api.StreamingLeaseRequest) ([]*api.Job, error) {
log := ctxlogrus.Extract(ctx)
log.Info("using new scheduler for lease call")
// Get the total capacity available across all clusters.
usageReports, err := q.usageRepository.GetClusterUsageReports()
if err != nil {
return nil, err
}
activeClusterReports := scheduling.FilterActiveClusters(usageReports)
totalCapacity := make(common.ComputeResources)
for _, clusterReport := range activeClusterReports {
totalCapacity.Add(util.GetClusterAvailableCapacity(clusterReport))
}
totalCapacityRl := schedulerobjects.ResourceList{
Resources: totalCapacity,
}
// load the usage from all other executors
reportsByExecutor, err := q.usageRepository.GetClusterQueueResourceUsage()
if err != nil {
return nil, err
}
// Create an aggregated usage by queue over all clusters
aggregatedUsageByQueue := q.aggregateUsage(reportsByExecutor, req.Pool)
// Collect all allowed priorities.
priorities := make([]int32, 0)
if len(q.schedulingConfig.Preemption.PriorityClasses) > 0 {
for _, p := range q.schedulingConfig.Preemption.PriorityClasses {
priorities = append(priorities, p.Priority)
}
} else {
priorities = append(priorities, 0)
}
// Nodes to be considered by the scheduler.
nodes := make([]*schedulerobjects.Node, len(req.Nodes))
for i, nodeInfo := range req.Nodes {
nodes[i] = schedulerobjects.NewNodeFromNodeInfo(
&nodeInfo,
req.ClusterId,
priorities,
)
}
indexedResources := q.schedulingConfig.IndexedResources
if len(indexedResources) == 0 {
indexedResources = []string{"cpu", "memory"}
}
nodeDb, err := scheduler.NewNodeDb(
priorities,
indexedResources,
q.schedulingConfig.IndexedTaints,
q.schedulingConfig.IndexedNodeLabels,
)
if err != nil {
return nil, err
}
err = nodeDb.Upsert(nodes)
if err != nil {
return nil, err
}
// Map queue names to priority factor for all active queues, i.e.,
// all queues for which the jobs queue has not been deleted automatically by Redis.
queues, err := q.queueRepository.GetAllQueues()
if err != nil {
return nil, err
}
priorityFactorByQueue := make(map[string]float64)
apiQueues := make([]*api.Queue, len(queues))
for i, queue := range queues {
priorityFactorByQueue[queue.Name] = float64(queue.PriorityFactor)
apiQueues[i] = &api.Queue{Name: queue.Name}
}
activeQueues, err := q.jobRepository.FilterActiveQueues(apiQueues)
if err != nil {
return nil, err
}
priorityFactorByActiveQueue := make(map[string]float64)
for _, queue := range activeQueues {
priorityFactorByActiveQueue[queue.Name] = priorityFactorByQueue[queue.Name]
}
// Give Schedule() a 3 second shorter deadline than ctx,
// to give it a chance to finish up before ctx is cancelled.
if deadline, ok := ctx.Deadline(); ok {
var cancel context.CancelFunc
ctx, cancel = context.WithDeadline(ctx, deadline.Add(-3*time.Second))
defer cancel()
}
constraints := scheduler.SchedulingConstraintsFromSchedulingConfig(
req.ClusterId,
req.Pool,
schedulerobjects.ResourceList{Resources: req.MinimumJobSize},
q.schedulingConfig,
totalCapacityRl,
)
legacySchedulerRepo := scheduler.NewJobRepositoryAdapter(q.jobRepository)
sched, err := scheduler.NewLegacyScheduler[*api.Job](
ctx,
*constraints,
q.schedulingConfig,
nodeDb,
legacySchedulerRepo,
priorityFactorByActiveQueue,
aggregatedUsageByQueue,
)
if err != nil {
return nil, err
}
// Log initial scheduler state.
log.Info("LegacyScheduler:\n" + sched.String())
// Run the scheduler.
jobs, err := sched.Schedule()
// Log and store scheduling reports.
if q.SchedulingReportsRepository != nil && sched.SchedulingRoundReport != nil {
log.Infof("Scheduling report:\n%s", sched.SchedulingRoundReport)
sched.SchedulingRoundReport.ClearJobSpecs()
q.SchedulingReportsRepository.AddSchedulingRoundReport(sched.SchedulingRoundReport)
}
// Update the usage report in-place to account for any leased jobs and write it back into Redis.
// This ensures resources of leased jobs are accounted for without needing to wait for feedback from the executor.
if sched.SchedulingRoundReport != nil {
executorReport, ok := reportsByExecutor[req.ClusterId]
if !ok || executorReport.ResourcesByQueue == nil {
executorReport = &schedulerobjects.ClusterResourceUsageReport{
Pool: req.Pool,
Created: q.clock.Now(),
ResourcesByQueue: make(map[string]*schedulerobjects.QueueClusterResourceUsage),
}
reportsByExecutor[req.ClusterId] = executorReport
}
for queue, queueSchedulingRoundReport := range sched.SchedulingRoundReport.QueueSchedulingRoundReports {
if queueClusterUsage := executorReport.ResourcesByQueue[queue]; queueClusterUsage != nil && queueClusterUsage.ResourcesByPriority != nil {
schedulerobjects.QuantityByPriorityAndResourceType(queueClusterUsage.ResourcesByPriority).Add(
queueSchedulingRoundReport.ScheduledResourcesByPriority,
)
} else {
queueClusterUsage = &schedulerobjects.QueueClusterResourceUsage{
Created: q.clock.Now(),
Queue: queue,
ExecutorId: req.ClusterId,
ResourcesByPriority: queueSchedulingRoundReport.ScheduledResourcesByPriority.DeepCopy(),
}
executorReport.ResourcesByQueue[queue] = queueClusterUsage
}
}
if err := q.usageRepository.UpdateClusterQueueResourceUsage(req.ClusterId, executorReport); err != nil {
logging.WithStacktrace(log, err).Errorf("failed to update cluster usage")
}
}
// If we successfully leased jobs, those have to be sent to the executor,
// since the leases will have been written into Redis.
if len(jobs) > 0 {
if err != nil {
logging.WithStacktrace(log, err).Error("failed to schedule jobs")
}
return jobs, nil
} else if err != nil {
return nil, err
}
// Use this NodeDb when checking if a job could ever be scheduled.
// We clear allocated resources since we want to check if a job
// could be scheduled if the cluster was empty.
if err := nodeDb.ClearAllocated(); err == nil {
q.SubmitChecker.RegisterNodeDb(req.ClusterId, nodeDb)
} else {
logging.WithStacktrace(log, err).Error("failed to clear allocated resources in NodeDb")
}
return jobs, nil
}
// aggregateUsage Creates a map of usage first by cluster and then by queue
// Note that the desired cluster is excluded as this will be filled in later as are clusters that are not in the
// same pool as the desired cluster
func (q *AggregatedQueueServer) aggregateUsage(reportsByCluster map[string]*schedulerobjects.ClusterResourceUsageReport, pool string) map[string]schedulerobjects.QuantityByPriorityAndResourceType {
const activeClusterExpiry = 10 * time.Minute
now := q.clock.Now()
// Aggregate resource usage across clusters.
aggregatedUsageByQueue := make(map[string]schedulerobjects.QuantityByPriorityAndResourceType)
for _, clusterReport := range reportsByCluster {
if clusterReport.Pool == pool && clusterReport.Created.Add(activeClusterExpiry).After(now) {
for queue, report := range clusterReport.ResourcesByQueue {
quantityByPriorityAndResourceType, ok := aggregatedUsageByQueue[queue]
if !ok {
quantityByPriorityAndResourceType = make(schedulerobjects.QuantityByPriorityAndResourceType)
aggregatedUsageByQueue[queue] = quantityByPriorityAndResourceType
}
quantityByPriorityAndResourceType.Add(report.ResourcesByPriority)
}
}
}
return aggregatedUsageByQueue
}
// createClusterUsageReport creates a schedulerobjects.ClusterResourceUsageReport suitable for storing in redis
func (q *AggregatedQueueServer) createClusterUsageReport(resourceByQueue map[string]*schedulerobjects.QueueClusterResourceUsage, pool string) *schedulerobjects.ClusterResourceUsageReport {
return &schedulerobjects.ClusterResourceUsageReport{
Pool: pool,
Created: q.clock.Now(),
ResourcesByQueue: resourceByQueue,
}
}
func (q *AggregatedQueueServer) decompressJobOwnershipGroups(jobs []*api.Job) error {
for _, j := range jobs {
// No need to decompress, if compressed groups not set
if len(j.CompressedQueueOwnershipUserGroups) == 0 {
continue
}
groups, err := q.decompressOwnershipGroups(j.CompressedQueueOwnershipUserGroups)
if err != nil {
return fmt.Errorf("failed to decompress ownership groups for job %s because %s", j.Id, err)
}
j.QueueOwnershipUserGroups = groups
j.CompressedQueueOwnershipUserGroups = nil
}
return nil
}
func (q *AggregatedQueueServer) decompressOwnershipGroups(compressedOwnershipGroups []byte) ([]string, error) {
decompressor, err := q.decompressorPool.BorrowObject(context.Background())
if err != nil {
return nil, fmt.Errorf("failed to borrow decompressior because %s", err)
}
defer func(decompressorPool *pool.ObjectPool, ctx context.Context, object interface{}) {
err := decompressorPool.ReturnObject(ctx, object)
if err != nil {
log.WithError(err).Errorf("Error returning decompressorPool to pool")
}
}(q.decompressorPool, context.Background(), decompressor)
return compress.DecompressStringArray(compressedOwnershipGroups, decompressor.(compress.Decompressor))
}
func (q *AggregatedQueueServer) RenewLease(ctx context.Context, request *api.RenewLeaseRequest) (*api.IdList, error) {
if err := checkPermission(q.permissions, ctx, permissions.ExecuteJobs); err != nil {
return nil, status.Errorf(codes.PermissionDenied, "[RenewLease] error: %s", err)
}
renewed, e := q.jobRepository.RenewLease(request.ClusterId, request.Ids)
return &api.IdList{renewed}, e
}
func (q *AggregatedQueueServer) ReturnLease(ctx context.Context, request *api.ReturnLeaseRequest) (*types.Empty, error) {
if err := checkPermission(q.permissions, ctx, permissions.ExecuteJobs); err != nil {
return nil, status.Errorf(codes.PermissionDenied, "[ReturnLease] error: %s", err)
}
// Check how many times the same job has been retried already
retries, err := q.jobRepository.GetNumberOfRetryAttempts(request.JobId)
if err != nil {
return nil, err
}
err = q.reportLeaseReturned(request)
if err != nil {
return nil, err
}
maxRetries := int(q.schedulingConfig.MaxRetries)
if retries >= maxRetries {
failureReason := fmt.Sprintf("Exceeded maximum number of retries: %d", maxRetries)
err = q.reportFailure(request.JobId, request.ClusterId, failureReason)
if err != nil {
return nil, err
}
_, err := q.ReportDone(ctx, &api.IdList{Ids: []string{request.JobId}})
if err != nil {
return nil, err
}
return &types.Empty{}, nil
}
if request.AvoidNodeLabels != nil && len(request.AvoidNodeLabels.Entries) > 0 {
err = q.addAvoidNodeAffinity(request.JobId, request.AvoidNodeLabels, authorization.GetPrincipal(ctx).GetName())
if err != nil {
log.Warnf("Failed to set avoid node affinity for job %s: %v", request.JobId, err)
}
}
_, err = q.jobRepository.ReturnLease(request.ClusterId, request.JobId)
if err != nil {
return nil, err
}
if request.JobRunAttempted {
err = q.jobRepository.AddRetryAttempt(request.JobId)
if err != nil {
return nil, err
}
}
return &types.Empty{}, nil
}
func (q *AggregatedQueueServer) addAvoidNodeAffinity(
jobId string,
labels *api.OrderedStringMap,
principalName string,
) error {
allClusterSchedulingInfo, err := q.schedulingInfoRepository.GetClusterSchedulingInfo()
if err != nil {
return fmt.Errorf("[AggregatedQueueServer.addAvoidNodeAffinity] error getting scheduling information: %w", err)
}
res, err := q.jobRepository.UpdateJobs([]string{jobId}, func(jobs []*api.Job) {
if len(jobs) < 1 {
log.Warnf("[AggregatedQueueServer.addAvoidNodeAffinity] job %s not found", jobId)
return
}
changed := addAvoidNodeAffinity(jobs[0], labels, func(jobsToValidate []*api.Job) error {
if ok, err := validateJobsCanBeScheduled(jobsToValidate, allClusterSchedulingInfo); !ok {
if err != nil {
return errors.WithMessage(err, "can't schedule at least 1 job")
} else {
return errors.Errorf("can't schedule at least 1 job")
}
}
return nil
})
if changed {
err := reportJobsUpdated(q.eventStore, principalName, jobs)
if err != nil {
log.Warnf("[AggregatedQueueServer.addAvoidNodeAffinity] error reporting job updated event for job %s: %s", jobId, err)
}
}
})
if err != nil {
return fmt.Errorf("[AggregatedQueueServer.addAvoidNodeAffinity] error updating job with ID %s: %s", jobId, err)
}
if len(res) < 1 {
errJobNotFound := &repository.ErrJobNotFound{JobId: jobId}
return fmt.Errorf("[AggregatedQueueServer.addAvoidNodeAffinity] error: %w", errJobNotFound)
}
return res[0].Error
}
func (q *AggregatedQueueServer) ReportDone(ctx context.Context, idList *api.IdList) (*api.IdList, error) {
if err := checkPermission(q.permissions, ctx, permissions.ExecuteJobs); err != nil {
return nil, status.Errorf(codes.PermissionDenied, "[ReportDone] error: %s", err)
}
jobs, e := q.jobRepository.GetExistingJobsByIds(idList.Ids)
if e != nil {
return nil, status.Errorf(codes.Internal, e.Error())
}
deletionResult, err := q.jobRepository.DeleteJobs(jobs)
if err != nil {
return nil, fmt.Errorf("[AggregatedQueueServer.ReportDone] error deleting jobs: %s", err)
}
cleanedIds := make([]string, 0, len(deletionResult))
var returnedError error = nil
for job, err := range deletionResult {
if err != nil {
returnedError = err
} else {
cleanedIds = append(cleanedIds, job.Id)
}
}
return &api.IdList{cleanedIds}, returnedError
}
func (q *AggregatedQueueServer) reportLeaseReturned(leaseReturnRequest *api.ReturnLeaseRequest) error {
job, err := q.getJobById(leaseReturnRequest.JobId)
if err != nil {
return err
}
err = reportJobLeaseReturned(q.eventStore, job, leaseReturnRequest)
if err != nil {
return err
}
return nil
}
func (q *AggregatedQueueServer) reportFailure(jobId string, clusterId string, reason string) error {
job, err := q.getJobById(jobId)
if err != nil {
return err
}
err = reportFailed(q.eventStore, clusterId, []*jobFailure{{job: job, reason: reason}})
if err != nil {
return err
}
return nil
}
func (q *AggregatedQueueServer) getJobById(jobId string) (*api.Job, error) {
jobs, err := q.jobRepository.GetExistingJobsByIds([]string{jobId})
if err != nil {
return nil, err
}
if len(jobs) < 1 {
return nil, errors.Errorf("job with jobId %q not found", jobId)
}
return jobs[0], err
}