Vihren Atlas

execution_manager.go ×13

Code frontier

unlabeled · c_b65c99e85541

141 tests · 2141 LOC · 91 files · introduces 0 tests · 62 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
13 ranges62 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
357 ranges2141 lines · 91 files · Browse complete extent
All tests (intent)
141 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: 62 introduced LOC across 13 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/common/persistence/execution_manager.go 62 introduced LOC · 13 ranges

Open complete file

630 func (m *executionManagerImpl) SerializeWorkflowMutation( // unexport
631 input *WorkflowMutation,
632 > ) (*InternalWorkflowMutation, error) { execution_manager.go
633 >
634 > serializedTasks, err := serializeTasks(m.serializer, input.Tasks)
635 > if err != nil {
636 return nil, err
637 }
638
639 > result := &InternalWorkflowMutation{ execution_manager.go
640 > NamespaceID: input.ExecutionInfo.GetNamespaceId(),
641 > WorkflowID: input.ExecutionInfo.GetWorkflowId(),
642 > RunID: input.ExecutionState.GetRunId(),
643 >
644 > UpsertActivityInfos: make(map[int64]*commonpb.DataBlob, len(input.UpsertActivityInfos)),
645 > DeleteActivityInfos: input.DeleteActivityInfos,
646 >
647 > UpsertTimerInfos: make(map[string]*commonpb.DataBlob, len(input.UpsertTimerInfos)),
648 > DeleteTimerInfos: input.DeleteTimerInfos,
649 >
650 > UpsertChildExecutionInfos: make(map[int64]*commonpb.DataBlob, len(input.UpsertChildExecutionInfos)),
651 > DeleteChildExecutionInfos: input.DeleteChildExecutionInfos,
652 >
653 > UpsertRequestCancelInfos: make(map[int64]*commonpb.DataBlob, len(input.UpsertRequestCancelInfos)),
654 > DeleteRequestCancelInfos: input.DeleteRequestCancelInfos,
655 >
656 > UpsertSignalInfos: make(map[int64]*commonpb.DataBlob, len(input.UpsertSignalInfos)),
657 > DeleteSignalInfos: input.DeleteSignalInfos,
658 >
659 > UpsertChasmNodes: make(map[string]InternalChasmNode, len(input.UpsertChasmNodes)),
660 > DeleteChasmNodes: input.DeleteChasmNodes,
661 >
662 > UpsertSignalRequestedIDs: input.UpsertSignalRequestedIDs,
663 > DeleteSignalRequestedIDs: input.DeleteSignalRequestedIDs,
664 >
665 > NewBufferedEvents: nil,
666 > ClearBufferedEvents: input.ClearBufferedEvents,
667 >
668 > ExecutionInfo: input.ExecutionInfo,
669 > ExecutionState: input.ExecutionState,
670 >
671 > Tasks: serializedTasks,
672 >
673 > Condition: input.Condition,
674 > DBRecordVersion: input.DBRecordVersion,
675 > NextEventID: input.NextEventID,
676 > }
677 >
678 > result.ExecutionInfoBlob, err = m.serializer.WorkflowExecutionInfoToBlob(input.ExecutionInfo)
679 > if err != nil {
680 return nil, err
681 }
682 > result.ExecutionStateBlob, err = m.serializer.WorkflowExecutionStateToBlob(input.ExecutionState) execution_manager.go
683 > if err != nil {
684 return nil, err
685 }
686
687 > for key, info := range input.UpsertActivityInfos { execution_manager.go
688 blob, err := m.serializer.ActivityInfoToBlob(info)
689 if err != nil {
693 }
694
695 > for key, info := range input.UpsertTimerInfos { execution_manager.go
696 blob, err := m.serializer.TimerInfoToBlob(info)
697 if err != nil {
701 }
702
703 > for key, info := range input.UpsertChildExecutionInfos { execution_manager.go
704 blob, err := m.serializer.ChildExecutionInfoToBlob(info)
705 if err != nil {
709 }
710
711 > for key, info := range input.UpsertRequestCancelInfos { execution_manager.go
712 blob, err := m.serializer.RequestCancelInfoToBlob(info)
713 if err != nil {
717 }
718
719 > for key, info := range input.UpsertSignalInfos { execution_manager.go
720 blob, err := m.serializer.SignalInfoToBlob(info)
721 if err != nil {
725 }
726
727 > nodeMap, err := m.makeInternalChasmNodeMap(input.UpsertChasmNodes) execution_manager.go
728 > if err != nil {
729 return nil, err
730 }
731 > result.UpsertChasmNodes = nodeMap execution_manager.go
732 >
733 > if len(input.NewBufferedEvents) > 0 {
734 result.NewBufferedEvents, err = m.serializer.SerializeEvents(input.NewBufferedEvents)
735 if err != nil {
738 }
739
740 > result.LastWriteVersion, err = getCurrentBranchLastWriteVersion(input.ExecutionInfo.VersionHistories, input.ExecutionInfo.TransitionHistory) execution_manager.go
741 > if err != nil {
742 return nil, err
743 }
744 > result.Checksum, err = m.serializer.ChecksumToBlob(input.Checksum) execution_manager.go
745 > if err != nil {
746 return nil, err
747 }
748
749 > return result, nil execution_manager.go
750 }
751

Direct hierarchy

Parents

Children