fifo_scheduler.go ×10

Frontier kind: Code frontier

unlabeled · c_c1cc9a2f8a8a

18 tests · 1637 LOC · 65 files · introduces 0 tests · 39 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code: 10 ranges39 lines · 1 files
Tests: 0 tests

Contains — complete concept membership

All code (extent): 202 ranges1637 lines · 65 files · Browse complete extent
All tests (intent): 18 testsBrowse complete intent

Neighbourhood graph

The orange circle is the focus. Violet and green circles are every ancestor and descendant, broader and narrower, at any distance; blue squares and pink diamonds are the introduced files and exact introduced tests of every visible concept, not only the focus's. Arrows point from broader to narrower concepts and bridge only concepts omitted from this view. Undirected links show source or test introduction. Concept and file size follows LOC; exact test nodes use test-count units.

Focus concept
Ancestors (broader)
Descendants (narrower)
Introduced files
Introduced tests

Introduced files, introduced tests, and structurally relevant concept specialization

In the embedded map, ordinary wheel input scrolls the page; use the visible controls to zoom and drag to pan. Open the full-screen map for canvas navigation: wheel pans, Ctrl/Command plus wheel zooms, and arrow keys pan when this region is focused. On touch screens, open the full-screen map to pan or pinch. If JavaScript or WebGL is unavailable, use the native relationship evidence on this page.

Graph controls are ready.

Interactive rendering requires JavaScript and WebGL. Use the native relationship evidence on this page while the interactive map is unavailable.

Native relationship evidence

Every exact file and test below is linked only from the concept that introduces it.

Introduced tests

Every collected test enters the hierarchy at exactly one concept.

No tests are introduced at this concept. Its intent tests are introduced by other concepts.

Introduced code

Every collected source range enters the hierarchy at exactly one concept.

1 file ranked by introduced lines: 39 introduced LOC across 10 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/common/tasks/fifo_scheduler.go 39 introduced LOC · 10 ranges

Open complete file

  53
  
  }
  
  54
  
  55
  >
  func (f *FIFOScheduler[T]) Start() {
  
fifo_scheduler.go

  56
  >
  	if !atomic.CompareAndSwapInt32(
  
  57
  >
  		&f.status,
  
  58
  >
  		common.DaemonStatusInitialized,
  
  59
  >
  		common.DaemonStatusStarted,
  
  60
  >
  	) {
  
  61
  
  		return
  
  62
  
  	}
  
  63
  
  64
  >
  	initialWorkerCount, workerCountSubscriptionCancelFn := f.options.WorkerCount(f.updateWorkerCount)
  
fifo_scheduler.go

  65
  >
  	f.workerCountSubscriptionCancelFn = workerCountSubscriptionCancelFn
  
  66
  >
  	f.updateWorkerCount(initialWorkerCount)
  
  67
  >
  
  68
  >
  	f.logger.Info("fifo scheduler started")
  
  69
  
  }
  
  70

  109
  
  }
  
  110
  
  111
  >
  func (f *FIFOScheduler[T]) updateWorkerCount(targetWorkerNum int) {
  
fifo_scheduler.go

  112
  >
  	f.workerLock.Lock()
  
  113
  >
  	defer f.workerLock.Unlock()
  
  114
  >
  
  115
  >
  	if f.isStopped() {
  
  116
  
  		// Always set the value to 0 when scheduler is stopped,
  
  117
  
  		// in case there's a race condition between subscription callback invocation

  120
  
  	}
  
  121
  
  122
  >
  	if targetWorkerNum < 0 {
  
fifo_scheduler.go

  123
  
  		f.logger.Error("Target worker pool size is negative. Please fix the dynamic config.", tag.Key("worker-pool-size"), tag.Value(targetWorkerNum))
  
  124
  
  		return
  
  125
  
  	}
  
  126
  
  127
  >
  	currentWorkerNum := len(f.workerShutdownCh)
  
fifo_scheduler.go

  128
  >
  	if targetWorkerNum == currentWorkerNum {
  
  129
  
  		return
  
  130
  
  	}
  
  131
  
  132
  >
  	if targetWorkerNum > currentWorkerNum {
  
fifo_scheduler.go

  133
  >
  		f.startWorkers(targetWorkerNum - currentWorkerNum)
  
  134
  >
  	} else {
  
  135
  
  		f.stopWorkers(currentWorkerNum - targetWorkerNum)
  
  136
  
  	}
  
  137
  
  138
  >
  	f.logger.Info("Update worker pool size", tag.Key("worker-pool-size"), tag.Value(targetWorkerNum))
  
fifo_scheduler.go

  139
  
  }
  
  140
  
  141
  
  func (f *FIFOScheduler[T]) startWorkers(
  
  142
  
  	count int,
  
  143
  >
  ) {
  
fifo_scheduler.go

  144
  >
  	for range count {
  
  145
  >
  		shutdownCh := make(chan struct{})
  
  146
  >
  		f.workerShutdownCh = append(f.workerShutdownCh, shutdownCh)
  
  147
  >
  
  148
  >
  		f.shutdownWG.Add(1)
  
  149
  >
  		go f.processTask(shutdownCh)
  
  150
  >
  	}
  
  151
  
  }
  
  152

  164
  
  func (f *FIFOScheduler[T]) processTask(
  
  165
  
  	shutdownCh chan struct{},
  
  166
  >
  ) {
  
fifo_scheduler.go

  167
  >
  	defer f.shutdownWG.Done()
  
  168
  >
  
  169
  >
  	for {
  
  170
  >
  		if f.isStopped() {
  
  171
  
  			return
  
  172
  
  		}

  227
  
  }
  
  228
  
  229
  >
  func (f *FIFOScheduler[T]) isStopped() bool {
  
fifo_scheduler.go

  230
  >
  	return atomic.LoadInt32(&f.status) == common.DaemonStatusStopped
  
  231
  >
  }

fifo_scheduler.go ×10

Introduces — evidence that enters the hierarchy at this concept

Contains — complete concept membership

Neighbourhood graph

Introduced tests

Introduced code

Direct hierarchy

Parents

Children