Vihren Atlas

sequential_scheduler.go ×9

Code frontier

unlabeled · c_f76a985219d3

20 tests · 1699 LOC · 67 files · introduces 0 tests · 38 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
9 ranges38 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
215 ranges1699 lines · 67 files · Browse complete extent
All tests (intent)
20 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.

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: 38 introduced LOC across 9 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/common/tasks/sequential_scheduler.go 38 introduced LOC · 9 ranges

Open complete file

82 }
83
84 > func (s *SequentialScheduler[T]) Stop() { sequential_scheduler.go
85 > if !atomic.CompareAndSwapInt32(
86 > &s.status,
87 > common.DaemonStatusStarted,
88 > common.DaemonStatusStopped,
89 > ) {
90 return
91 }
92
93 > close(s.shutdownChan) sequential_scheduler.go
94 > s.workerCountSubscriptionCancelFn()
95 > s.updateWorkerCount(0)
96 > // must be called after the close of the shutdownChan
97 > s.drainTasks()
98 >
99 > go func() {
100 > if success := common.AwaitWaitGroup(&s.shutdownWG, time.Minute); !success {
101 s.logger.Warn("sequential scheduler timed out waiting for workers")
102 }
103 }()
104 > s.logger.Info("sequential scheduler stopped") sequential_scheduler.go
105 }
106
204
205 if s.isStopped() {
206 > // Always set the value to 0 when scheduler is stopped, sequential_scheduler.go
207 > // in case there's a race condition between subscription callback invocation
208 > // and the invocation made from Stop()
209 > targetWorkerNum = 0
210 > }
211
212 if targetWorkerNum < 0 {
223 s.startWorkers(targetWorkerNum - currentWorkerNum)
224 } else {
225 > s.stopWorkers(currentWorkerNum - targetWorkerNum) sequential_scheduler.go
226 > }
227
228 s.logger.Info("Update worker pool size", tag.Key("worker-pool-size"), tag.Value(targetWorkerNum))
243 func (s *SequentialScheduler[T]) stopWorkers(
244 count int,
245 > ) { sequential_scheduler.go
246 > shutdownChToClose := s.workerShutdownCh[:count]
247 > s.workerShutdownCh = s.workerShutdownCh[count:]
248 >
249 > for _, shutdownCh := range shutdownChToClose {
250 > close(shutdownCh)
251 > }
252 }
253
257 for {
258 select {
259 > case <-s.shutdownChan: sequential_scheduler.go
260 > s.drainTasks()
261 > return
262 case <-workerShutdownCh:
263 return
345 }
346
347 > func (s *SequentialScheduler[T]) drainTasks() { sequential_scheduler.go
348 > LoopDrainQueues:
349 > for {
350 > select {
351 case queue := <-s.queueChan:
352 LoopDrainSingleQueue:

Direct hierarchy

Parents

Children