Vihren Atlas

tree.go ×18

Code frontier

unlabeled · c_252600fb4d30

278 tests · 2087 LOC · 82 files · introduces 0 tests · 56 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
18 ranges56 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
341 ranges2087 lines · 82 files · Browse complete extent
All tests (intent)
278 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: 56 introduced LOC across 18 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/chasm/tree.go 56 introduced LOC · 18 ranges

Open complete file

1560 // reference a component that was never registered as a node are dropped and
1561 // logged at warn level to surface caller misuse.
1562 > func (n *Node) closeTransactionApplyPendingComponentMetadata() error { tree.go
1563 > if len(n.pendingRequestLinks) == 0 && len(n.pendingUserMetadata) == 0 {
1564 > return nil
1565 > }
1566 for _, node := range n.andAllChildren() {
1567 if !node.applyPendingComponentMetadata() {
1709 }
1710
1711 > nextVersionedTransition := &persistencespb.VersionedTransition{ tree.go
1712 > NamespaceFailoverVersion: n.backend.GetCurrentVersion(),
1713 > TransitionCount: n.backend.NextTransitionCount(),
1714 > }
1715 >
1716 > immutableContext := NewContext(context.TODO(), n)
1717 > rootLifecycleChanged, err := n.closeTransactionHandleRootLifecycleChange(immutableContext)
1718 > if err != nil {
1719 return NodesMutation{}, err
1720 }
1721
1722 > if n.subtreeIsDirty { tree.go
1723 if err := n.closeTransactionForceUpdateVisibility(immutableContext, rootLifecycleChanged); err != nil {
1724 return NodesMutation{}, err
1726 }
1727
1728 > if err := n.closeTransactionSerializeNodes(); err != nil { tree.go
1729 return NodesMutation{}, err
1730 }
1731
1732 > if err := n.closeTransactionUpdateComponentTasks(nextVersionedTransition); err != nil { tree.go
1733 return NodesMutation{}, err
1734 }
1735
1736 > if err := n.closeTransactionApplyPendingComponentMetadata(); err != nil { tree.go
1737 return NodesMutation{}, err
1738 }
1739
1740 // Both user & system data mutation need to be returned and persisted.
1741 > maps.Copy(n.mutation.UpdatedNodes, n.systemMutation.UpdatedNodes) tree.go
1742 > maps.Copy(n.mutation.DeletedNodes, n.systemMutation.DeletedNodes)
1743 >
1744 > return n.mutation, nil
1745 }
1746
1791 func (n *Node) closeTransactionHandleRootLifecycleChange(
1792 immutableContext Context,
1793 > ) (bool, error) { tree.go
1794 > if n.backend.IsWorkflow() {
1795 // Workflow manages its lifecycle directly in mutable state.
1796 return false, nil
1933 }
1934
1935 > func (n *Node) closeTransactionSerializeNodes() error { tree.go
1936 > for nodePath, node := range n.andAllChildren() {
1937 > if node.valueState > valueStateNeedSerialize {
1938 return serviceerror.NewInternalf("invalid valueState for serializing: %v", node.valueState)
1939 }
1940
1941 > if node.valueState < valueStateNeedSerialize { tree.go
1942 continue
1943 }
1992 }
1993
1994 > return nil tree.go
1995 }
1996
1997 func (n *Node) closeTransactionUpdateComponentTasks(
1998 nextVersionedTransition *persistencespb.VersionedTransition,
1999 > ) error { tree.go
2000 > taskOffset := int64(1)
2001 > taskValidationContext := NewContext(newContextWithOperationIntent(context.Background(), OperationIntentProgress), n)
2002 >
2003 > archetypeID := n.ArchetypeID()
2004 >
2005 > var firstPureTask *persistencespb.ChasmComponentAttributes_Task
2006 > var firstPureTaskNode *Node
2007 >
2008 > for nodePath, node := range n.andAllChildren() {
2009 > // no-op if node is not a component
2010 > componentAttr := node.serializedNode.Metadata.GetComponentAttributes()
2011 > if componentAttr == nil {
2012 continue
2013 }
2021 // markSubtreeDirty propagates to both ancestors and descendants at mutation time,
2022 // so we skip validation only for nodes with no dirty node anywhere in their lineage.
2023 > if node.subtreeIsDirty { tree.go
2024 // Ensure this node's component value is hydrated before cleaning up tasks.
2025 if err := node.prepareComponentValue(taskValidationContext); err != nil {
2054 // This method is called after the closeTransactionSerializeNodes which sets valueState
2055 // to valueStateSynced.
2056 > if transitionhistory.Compare( tree.go
2057 > node.serializedNode.GetMetadata().LastUpdateVersionedTransition,
2058 > nextVersionedTransition,
2059 > ) == 0 && node.valueState != valueStateNeedDeserialize {
2060 if err := node.closeTransactionHandleNewTasks(
2061 nextVersionedTransition,
2067 }
2068
2069 > sideEffectTasks := componentAttr.GetSideEffectTasks() tree.go
2070 > for idx := len(sideEffectTasks) - 1; idx >= 0; idx-- {
2071 sideEffectTask := sideEffectTasks[idx]
2072 if sideEffectTask.PhysicalTaskStatus == physicalTaskStatusCreated {
2083 // Find the first pure task in the entire tree,
2084 // regardless if the pure task is newly added or existing.
2085 > pureTasks := componentAttr.GetPureTasks() tree.go
2086 > if len(pureTasks) == 0 {
2087 continue
2088 }
2101 // task, and that component get deleted by the second task.
2102
2103 > return n.closeTransactionGeneratePhysicalPureTask( tree.go
2104 > firstPureTask,
2105 > firstPureTaskNode,
2106 > archetypeID,
2107 > )
2108 }
2109
2346 firstTaskNode *Node,
2347 archetypeID ArchetypeID,
2348 > ) error { tree.go
2349 > if firstPureTask == nil {
2350 n.backend.DeleteCHASMPureTasks(tasks.MaximumKey.FireTime)
2351 return nil

Direct hierarchy

Parents

Children