Vihren Atlas

backlog_manager.go ×1

Code frontier

unlabeled · c_e0c64addf3a6

2 tests · 4156 LOC · 183 files · introduces 0 tests · 30 LOC · 3 files

Introduces — evidence that enters the hierarchy at this concept

Code
3 ranges30 lines · 3 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
722 ranges4156 lines · 183 files · Browse complete extent
All tests (intent)
2 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.

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

go.temporal.io/server/service/matching/physical_task_queue_manager.go 15 introduced LOC · 1 range

Open complete file

662 // pollers which polled this taskqueue in last few minutes and status of taskqueue's ackManager
663 // (readLevel, ackLevel, backlogCountHint and taskIDBlock).
664 > func (c *physicalTaskQueueManagerImpl) LegacyDescribeTaskQueue(includeTaskQueueStatus bool) *matchingservice.DescribeTaskQueueResponse { physical_task_queue_manager.go
665 > response := &matchingservice.DescribeTaskQueueResponse{
666 > DescResponse: &workflowservice.DescribeTaskQueueResponse{
667 > Pollers: c.GetAllPollerInfo(),
668 > },
669 > }
670 > if includeTaskQueueStatus {
671 > // Don't look at c.drainBacklogMgr here, we can't merge info from the draining queue
672 > // with this interface. Use GetInternalTaskQueueStatus instead.
673 > response.DescResponse.TaskQueueStatus = c.backlogMgr.BacklogStatus()
674 > rps, _ := c.partitionMgr.GetRateLimitManager().GetEffectiveRPSAndSource()
675 > //nolint:staticcheck // SA1019: using deprecated TaskQueueStatus for legacy compatibility
676 > response.DescResponse.TaskQueueStatus.RatePerSecond = rps
677 > }
678 > return response
679 }
680
go.temporal.io/server/service/matching/backlog_manager.go 13 introduced LOC · 1 range

Open complete file

184 }
185
186 > func (c *backlogManagerImpl) BacklogStatus() *taskqueuepb.TaskQueueStatus { backlog_manager.go
187 > taskIDBlock := rangeIDToTaskIDBlock(c.db.RangeID(), c.config.RangeSize)
188 > return &taskqueuepb.TaskQueueStatus{
189 > ReadLevel: c.taskAckManager.getReadLevel(),
190 > AckLevel: c.taskAckManager.getAckLevel(),
191 > // use getTotalApproximateBacklogCount instead of BacklogCountHint since it's more accurate
192 > BacklogCountHint: c.db.getTotalApproximateBacklogCount(),
193 > TaskIdBlock: &taskqueuepb.TaskIdBlock{
194 > StartId: taskIDBlock.start,
195 > EndId: taskIDBlock.end,
196 > },
197 > }
198 > }
199
200 func (c *backlogManagerImpl) BacklogStatsByPriority() map[int32]*taskqueuepb.TaskQueueStats {
go.temporal.io/server/service/matching/poller_history.go 2 introduced LOC · 1 range

Open complete file

73 func defaultRPS(wrapper *wrapperspb.DoubleValue) float64 {
74 if wrapper != nil {
75 > return wrapper.Value poller_history.go
76 > }
77 return defaultTaskDispatchRPS
78 }

Direct hierarchy

Parents

Children