Vihren Atlas

loadbalancer.go ×5

Code frontier

unlabeled · c_0d8c3cc7ad4e

15 tests · 1836 LOC · 76 files · introduces 0 tests · 30 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
5 ranges30 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
246 ranges1836 lines · 76 files · Browse complete extent
All tests (intent)
15 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: 30 introduced LOC across 5 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/client/matching/loadbalancer.go 30 introduced LOC · 5 ranges

Open complete file

151 }
152
153 > func (b *tqLoadBalancer) pickReadPartition(partitionCount int) *pollToken { loadbalancer.go
154 > b.lock.Lock()
155 > defer b.lock.Unlock()
156 >
157 > b.ensurePartitionCountLocked(partitionCount)
158 > partitionID := b.pickReadPartitionWithFewestPolls(partitionCount)
159 >
160 > b.pollerCounts[partitionID]++
161 >
162 > return &pollToken{
163 > TQPartition: b.taskQueue.NormalPartition(partitionID),
164 > balancer: b,
165 > }
166 > }
167
168 func (b *tqLoadBalancer) forceReadPartition(partitionCount, partitionID int) *pollToken {
181
182 // caller to ensure that lock is obtained before call this function
183 > func (b *tqLoadBalancer) pickReadPartitionWithFewestPolls(partitionCount int) int { loadbalancer.go
184 > // pick a random partition to start with
185 > startPartitionID := rand.Intn(partitionCount)
186 > pickedPartitionID := startPartitionID
187 > minPollerCount := b.pollerCounts[pickedPartitionID]
188 > for i := 1; i < partitionCount && minPollerCount > 0; i++ {
189 currPartitionID := (startPartitionID + i) % int(partitionCount)
190 if b.pollerCounts[currPartitionID] < minPollerCount {
194 }
195
196 > return pickedPartitionID loadbalancer.go
197 }
198
199 // caller to ensure that lock is obtained before call this function
200 > func (b *tqLoadBalancer) ensurePartitionCountLocked(partitionCount int) { loadbalancer.go
201 > if len(b.pollerCounts) == partitionCount {
202 > return
203 > }
204
205 > if len(b.pollerCounts) < partitionCount { loadbalancer.go
206 > // add more partition entries
207 > for i := len(b.pollerCounts); i < partitionCount; i++ {
208 > b.pollerCounts = append(b.pollerCounts, 0)
209 > }
210 } else {
211 // truncate existing partition entries

Direct hierarchy

Parents

Children