MCPcopy Create free account
hub / github.com/araddon/qlbridge / WalkPlanAll

Method WalkPlanAll

exec/executor.go:268–285  ·  view source on GitHub ↗
(p plan.Task)

Source from the content-addressed store, hash-verified

266 return NewJoinKey(m.Ctx, p), nil
267}
268func (m *JobExecutor) WalkPlanAll(p plan.Task) (Task, error) {
269 root, err := m.WalkPlanTask(p)
270 if err != nil {
271 u.Errorf("all damn %v err=%v", p, err)
272 return nil, err
273 }
274 if len(p.Children()) > 0 {
275 dagRoot := m.NewTask(p)
276 //u.Debugf("sequential?%v parallel?%v", p.IsSequential(), p.IsParallel())
277 err = dagRoot.Add(root)
278 if err != nil {
279 u.Errorf("Could not add root: %v", err)
280 return nil, err
281 }
282 return dagRoot, m.WalkChildren(p, dagRoot)
283 }
284 return root, m.WalkChildren(p, root)
285}
286func (m *JobExecutor) WalkPlanTask(p plan.Task) (Task, error) {
287 //u.Debugf("WalkPlanTask: %p %T", p, p)
288 switch p := p.(type) {

Callers 1

WalkJoinMethod · 0.95

Calls 6

WalkPlanTaskMethod · 0.95
NewTaskMethod · 0.95
AddMethod · 0.95
WalkChildrenMethod · 0.95
ErrorfMethod · 0.80
ChildrenMethod · 0.65

Tested by

no test coverage detected