Vihren Atlas

pri_backlog_manager.go ×3

Code frontier

unlabeled · c_504a237e3201

201 tests · 3390 LOC · 149 files · introduces 0 tests · 28 LOC · 2 files

Introduces — evidence that enters the hierarchy at this concept

Code
4 ranges28 lines · 2 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
538 ranges3390 lines · 149 files · Browse complete extent
All tests (intent)
201 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.

2 files ranked by introduced lines: 28 introduced LOC across 4 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/service/matching/pri_backlog_manager.go 23 introduced LOC · 3 ranges

Open complete file

277 }
278
279 > func (c *priBacklogManagerImpl) BacklogStatsByPriority() map[int32]*taskqueuepb.TaskQueueStats { pri_backlog_manager.go
280 > c.subqueueLock.Lock()
281 > defer c.subqueueLock.Unlock()
282 >
283 > result := make(map[int32]*taskqueuepb.TaskQueueStats)
284 > backlogCounts := c.db.getApproximateBacklogCountsBySubqueue()
285 > for subqueueIdx, priorityKey := range c.priorityBySubqueue {
286 > pk := int32(priorityKey)
287 >
288 > // Note that there could be more than one subqueue for the same priority.
289 > if _, ok := result[pk]; !ok {
290 > result[pk] = &taskqueuepb.TaskQueueStats{
291 > // TODO(pri): returning 0 to match existing behavior, but maybe emptyBacklogAge would
292 > // be more appropriate in the future.
293 > ApproximateBacklogAge: durationpb.New(0),
294 > }
295 > }
296
297 // Add backlog counts together across all subqueues for the same priority.
298 > result[pk].ApproximateBacklogCount += backlogCounts[subqueueIdx] pri_backlog_manager.go
299 >
300 > // Find greatest backlog age for across all subqueues for the same priority.
301 > oldestBacklogTime := c.subqueues[subqueueIdx].getOldestBacklogTime()
302 > if !oldestBacklogTime.IsZero() {
303 oldestBacklogAge := time.Since(oldestBacklogTime)
304 if oldestBacklogAge > result[pk].ApproximateBacklogAge.AsDuration() {
go.temporal.io/server/service/matching/pri_task_reader.go 5 introduced LOC · 1 range

Open complete file

103 }
104
105 > func (tr *priTaskReader) getOldestBacklogTime() time.Time { pri_task_reader.go
106 > tr.lock.Lock()
107 > defer tr.lock.Unlock()
108 > return tr.backlogAge.oldestTime()
109 > }
110
111 func (tr *priTaskReader) completeTask(task *internalTask, res taskResponse) {

Direct hierarchy

Parents

Children