Removed EventMangar
parent
32434e7dfe
commit
9980be7c86
@ -1,200 +0,0 @@
|
||||
package graphvent
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"errors"
|
||||
)
|
||||
|
||||
type EventManager struct {
|
||||
dag_nodes map[string]Resource
|
||||
Root Event
|
||||
aborts []chan error
|
||||
}
|
||||
|
||||
// root_event's requirements must be in dag_nodes, and dag_nodes must be ordered by dependency(children first)
|
||||
func NewEventManager(root_event Event, dag_nodes []Resource) * EventManager {
|
||||
|
||||
manager := &EventManager{
|
||||
dag_nodes: map[string]Resource{},
|
||||
Root: nil,
|
||||
aborts: []chan error{},
|
||||
}
|
||||
|
||||
// Construct the DAG
|
||||
for _, resource := range dag_nodes {
|
||||
err := manager.AddResource(resource)
|
||||
if err != nil {
|
||||
log.Logf("manager", "Failed to add %s to EventManager: %s", resource.Name(), err)
|
||||
return nil
|
||||
}
|
||||
}
|
||||
|
||||
err := manager.AddEvent(nil, root_event, nil)
|
||||
if err != nil {
|
||||
log.Logf("manager", "Failed to add %s to EventManager as root_event: %s", root_event.Name(), err)
|
||||
}
|
||||
|
||||
return manager;
|
||||
}
|
||||
|
||||
// Init to all resources(in a thread to handle reconnections), and start the first event
|
||||
func (manager * EventManager) Run() error {
|
||||
log.Logf("manager", "MANAGER_START")
|
||||
|
||||
abort := make(chan error, 1)
|
||||
go func(abort chan error, manager * EventManager) {
|
||||
<- abort
|
||||
for _, c := range(manager.aborts) {
|
||||
c <- nil
|
||||
}
|
||||
}(abort, manager)
|
||||
|
||||
err := LockResources(manager.Root)
|
||||
if err != nil {
|
||||
log.Logf("manager", "MANAGER_LOCK_ERR: %s", err)
|
||||
abort <- nil
|
||||
return err
|
||||
}
|
||||
|
||||
err = RunEvent(manager.Root)
|
||||
abort <- nil
|
||||
if err != nil {
|
||||
log.Logf("manager", "MANAGER_RUN_ERR: %s", err)
|
||||
return err
|
||||
}
|
||||
|
||||
err = FinishEvent(manager.Root)
|
||||
if err != nil {
|
||||
log.Logf("manager", "MANAGER_FINISH_ERR: %s", err)
|
||||
return err
|
||||
}
|
||||
log.Logf("manager", "MANAGER_DONE")
|
||||
|
||||
return nil
|
||||
}
|
||||
|
||||
func (manager * EventManager) FindResource(id string) Resource {
|
||||
resource, exists := manager.dag_nodes[id]
|
||||
if exists == false {
|
||||
return nil
|
||||
}
|
||||
|
||||
return resource
|
||||
}
|
||||
|
||||
func (manager * EventManager) FindEvent(id string) Event {
|
||||
event := FindChild(manager.Root, id)
|
||||
|
||||
return event
|
||||
}
|
||||
|
||||
func (manager * EventManager) AddResource(resource Resource) error {
|
||||
log.Logf("manager", "Adding resource %s", resource.Name())
|
||||
_, exists := manager.dag_nodes[resource.ID()]
|
||||
if exists == true {
|
||||
error_str := fmt.Sprintf("%s is already in the resource DAG, cannot add again", resource.Name())
|
||||
return errors.New(error_str)
|
||||
}
|
||||
|
||||
for _, child := range resource.Children() {
|
||||
_, exists := manager.dag_nodes[child.ID()]
|
||||
if exists == false {
|
||||
error_str := fmt.Sprintf("%s is not in the resource DAG, cannot add %s to DAG", child.Name(), resource.Name())
|
||||
return errors.New(error_str)
|
||||
}
|
||||
}
|
||||
manager.dag_nodes[resource.ID()] = resource
|
||||
abort := make(chan error, 1)
|
||||
abort_used := resource.Init(abort)
|
||||
if abort_used == true {
|
||||
manager.aborts = append(manager.aborts, abort)
|
||||
}
|
||||
for _, child := range resource.Children() {
|
||||
AddParent(child, resource)
|
||||
}
|
||||
return nil
|
||||
}
|
||||
|
||||
// Check that the node doesn't already exist in the tree
|
||||
// Check the the selected parent exists in the tree
|
||||
// Check that required resources exist in the DAG
|
||||
// Check that created resources don't exist in the DAG
|
||||
// Add resources created by the event to the DAG
|
||||
// Add child to parent
|
||||
func (manager * EventManager) CheckResources(event Event) error {
|
||||
if event == nil {
|
||||
return errors.New("Cannot check nil event for resources")
|
||||
}
|
||||
|
||||
for _, r := range(event.RequiredResources()) {
|
||||
res_found := false
|
||||
for _, res := range(manager.dag_nodes) {
|
||||
if res.ID() == r.ID() {
|
||||
res_found = true
|
||||
}
|
||||
}
|
||||
if res_found == false {
|
||||
return errors.New(fmt.Sprintf("Failed to find %s in the resource forest for %s", r.Name(), event.Name()))
|
||||
}
|
||||
}
|
||||
|
||||
for _, c := range(event.Children()) {
|
||||
err := manager.CheckResources(c)
|
||||
if err != nil {
|
||||
return err
|
||||
}
|
||||
}
|
||||
|
||||
return nil
|
||||
}
|
||||
|
||||
func (manager * EventManager) AddDoneResources(event Event) {
|
||||
if event == nil {
|
||||
return
|
||||
}
|
||||
|
||||
done_resource := event.DoneResource()
|
||||
_, exists := manager.dag_nodes[done_resource.ID()]
|
||||
if exists == false {
|
||||
manager.AddResource(done_resource)
|
||||
}
|
||||
|
||||
for _, child := range(event.Children()) {
|
||||
manager.AddDoneResources(child)
|
||||
}
|
||||
}
|
||||
|
||||
func (manager * EventManager) AddEvent(parent Event, child Event, info EventInfo) error {
|
||||
if child == nil {
|
||||
return errors.New("Cannot add nil Event to EventManager")
|
||||
}
|
||||
|
||||
err := manager.CheckResources(child)
|
||||
if err != nil {
|
||||
return fmt.Errorf("Failed to add event to event manager: %w", err)
|
||||
}
|
||||
|
||||
manager.AddDoneResources(child)
|
||||
|
||||
if manager.Root == nil {
|
||||
if parent != nil {
|
||||
return fmt.Errorf("EventManager has no root, so can't add event to parent")
|
||||
} else {
|
||||
manager.Root = child
|
||||
return nil
|
||||
}
|
||||
} else {
|
||||
if parent == nil {
|
||||
return fmt.Errorf("Replacing root event not implemented")
|
||||
} else if FindChild(manager.Root, parent.ID()) == nil {
|
||||
return fmt.Errorf("Parent does not exists in event tree")
|
||||
} else if FindChild(manager.Root, child.ID()) != nil {
|
||||
return fmt.Errorf("Child already exists in event tree")
|
||||
} else {
|
||||
AddChild(parent, child, info)
|
||||
}
|
||||
}
|
||||
return nil
|
||||
}
|
||||
|
||||
|
||||
Loading…
Reference in New Issue