deadlock.go ×5

Frontier kind: Code frontier

unlabeled · c_7196093e29fe

13 tests · 1690 LOC · 68 files · introduces 0 tests · 34 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code: 5 ranges34 lines · 1 files
Tests: 0 tests

Contains — complete concept membership

All code (extent): 212 ranges1690 lines · 68 files · Browse complete extent
All tests (intent): 13 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: 34 introduced LOC across 5 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/common/deadlock/deadlock.go 34 introduced LOC · 5 ranges

Open complete file

  64
  
  }
  
  65
  
  66
  >
  func NewDeadlockDetector(params params) *deadlockDetector {
  
deadlock.go

  67
  >
  	return &deadlockDetector{
  
  68
  >
  		logger:         params.Logger,
  
  69
  >
  		healthServer:   params.HealthServer,
  
  70
  >
  		metricsHandler: params.MetricsHandler.WithTags(metrics.OperationTag(metrics.DeadlockDetectorScope)),
  
  71
  >
  		config: config{
  
  72
  >
  			DumpGoroutines:    dynamicconfig.DeadlockDumpGoroutines.Get(params.Collection),
  
  73
  >
  			FailHealthCheck:   dynamicconfig.DeadlockFailHealthCheck.Get(params.Collection),
  
  74
  >
  			AbortProcess:      dynamicconfig.DeadlockAbortProcess.Get(params.Collection),
  
  75
  >
  			Interval:          dynamicconfig.DeadlockInterval.Get(params.Collection),
  
  76
  >
  			MaxWorkersPerRoot: dynamicconfig.DeadlockMaxWorkersPerRoot.Get(params.Collection),
  
  77
  >
  		},
  
  78
  >
  		roots: params.Roots,
  
  79
  >
  	}
  
  80
  >
  }
  
  81
  
  82
  
  func (dd *deadlockDetector) Start() error {

  167
  
  }
  
  168
  
  169
  >
  func (lc *loopContext) ping(ctx context.Context, pingables []pingable.Pingable) {
  
deadlock.go

  170
  >
  	for _, pingable := range pingables {
  
  171
  
  		for _, check := range pingable.GetPingChecks() {
  
  172
  
  			lc.p.Do(func() { lc.check(ctx, check) })

  175
  
  }
  
  176
  
  177
  >
  func (lc *loopContext) check(ctx context.Context, check pingable.Check) {
  
deadlock.go

  178
  >
  	lc.dd.logger.Debug("starting ping check", tag.Name(check.Name))
  
  179
  >
  	startTime := time.Now().UTC()
  
  180
  >
  	resolved := make(chan struct{})
  
  181
  >
  
  182
  >
  	// Using AfterFunc is cheaper than creating another goroutine to be the waiter, since
  
  183
  >
  	// we expect to always cancel it. If the go runtime is so messed up that it can't
  
  184
  >
  	// create a goroutine, that's a bigger problem than we can handle.
  
  185
  >
  	t := time.AfterFunc(check.Timeout, func() {
  
  186
  
  		if ctx.Err() != nil {
  
  187
  
  			// deadlock detector was stopped

  197
  
  		lc.dd.adjustCurrent(-1)
  
  198
  
  	})
  
  199
  >
  	newPingables := check.Ping()
  
deadlock.go

  200
  >
  	t.Stop()
  
  201
  >
  	if len(check.MetricsName) > 0 {
  
  202
  
  		lc.dd.metricsHandler.Timer(check.MetricsName).Record(time.Since(startTime))
  
  203
  
  	}
  
  204
  >
  	close(resolved)
  
deadlock.go

  205
  >
  
  206
  >
  	lc.dd.logger.Debug("ping check succeeded", tag.Name(check.Name))
  
  207
  >
  
  208
  >
  	lc.ping(ctx, newPingables)
  
  209
  
  }

deadlock.go ×5

Introduces — evidence that enters the hierarchy at this concept

Contains — complete concept membership

Neighbourhood graph

Introduced tests

Introduced code

Direct hierarchy

Parents

Children