2024-08-30 09:14:03 +02:00
package workflow
2024-07-19 10:54:58 +02:00
import (
2024-08-12 16:11:25 +02:00
"errors"
2024-12-12 16:25:47 +01:00
"time"
2024-07-19 10:54:58 +02:00
2024-12-03 10:57:28 +01:00
"cloud.o-forge.io/core/oc-lib/models/collaborative_area/shallow_collaborative_area"
2024-12-12 16:25:47 +01:00
"cloud.o-forge.io/core/oc-lib/models/common/pricing"
2024-08-13 09:49:42 +02:00
"cloud.o-forge.io/core/oc-lib/models/peer"
2024-07-26 10:36:23 +02:00
"cloud.o-forge.io/core/oc-lib/models/resources"
2024-07-19 10:54:58 +02:00
"cloud.o-forge.io/core/oc-lib/models/utils"
2024-11-28 16:49:41 +01:00
"cloud.o-forge.io/core/oc-lib/models/workflow/graph"
2024-08-12 16:11:25 +02:00
"cloud.o-forge.io/core/oc-lib/tools"
2024-07-19 10:54:58 +02:00
)
2024-08-30 14:50:48 +02:00
/ *
* AbstractWorkflow is a struct that represents a workflow for resource or native workflow
* Warning : there is 2 types of workflows , the resource workflow and the native workflow
* native workflow is the one that you create to schedule an execution
* resource workflow is the one that is created to set our native workflow in catalog
* /
2024-07-26 10:36:23 +02:00
type AbstractWorkflow struct {
resources . ResourceSet
2024-12-12 16:25:47 +01:00
Graph * graph . Graph ` bson:"graph,omitempty" json:"graph,omitempty" ` // Graph UI & logic representation of the workflow
ScheduleActive bool ` json:"schedule_active" bson:"schedule_active" ` // ScheduleActive is a flag that indicates if the schedule is active, if not the workflow is not scheduled and no execution or booking will be set
// Schedule *WorkflowSchedule `bson:"schedule,omitempty" json:"schedule,omitempty"` // Schedule is the schedule of the workflow
Shared [ ] string ` json:"shared,omitempty" bson:"shared,omitempty" ` // Shared is the ID of the shared workflow
2024-07-26 10:36:23 +02:00
}
2024-12-12 16:25:47 +01:00
func ( d * Workflow ) GetAccessor ( request * tools . APIRequest ) utils . Accessor {
return NewAccessor ( request ) // Create a new instance of the accessor
}
func ( w * AbstractWorkflow ) GetGraphItems ( f func ( item graph . GraphItem ) bool ) ( list_datas [ ] graph . GraphItem ) {
2024-10-03 17:25:54 +02:00
for _ , item := range w . Graph . Items {
2024-12-12 16:25:47 +01:00
if f ( item ) {
list_datas = append ( list_datas , item )
2024-10-03 17:25:54 +02:00
}
}
return
}
2024-12-12 16:25:47 +01:00
func ( w * AbstractWorkflow ) GetResources ( f func ( item graph . GraphItem ) bool ) map [ string ] resources . ShallowResourceInterface {
list_datas := map [ string ] resources . ShallowResourceInterface { }
for _ , item := range w . Graph . Items {
if f ( item ) {
res := item . GetResource ( )
list_datas [ res . GetID ( ) ] = res
2024-11-14 10:02:18 +01:00
}
2024-12-12 16:25:47 +01:00
}
return list_datas
}
func ( w * AbstractWorkflow ) GetPricedItem ( f func ( item graph . GraphItem ) bool ) map [ string ] pricing . PricedItemITF {
list_datas := map [ string ] pricing . PricedItemITF { }
for _ , item := range w . Graph . Items {
if f ( item ) {
res := item . GetResource ( )
ord := item . GetPricedItem ( )
list_datas [ res . GetID ( ) ] = ord
2024-11-14 10:02:18 +01:00
}
}
2024-12-12 16:25:47 +01:00
return list_datas
2024-11-14 10:02:18 +01:00
}
2024-12-12 16:25:47 +01:00
func ( w * AbstractWorkflow ) GetByRelatedProcessing ( processingID string , g func ( item graph . GraphItem ) bool ) [ ] resources . ShallowResourceInterface {
storages := [ ] resources . ShallowResourceInterface { }
2024-10-10 09:38:27 +02:00
for _ , link := range w . Graph . Links {
2024-12-12 16:25:47 +01:00
nodeID := link . Destination . ID
var node resources . ShallowResourceInterface
if g ( w . Graph . Items [ link . Source . ID ] ) {
item := w . Graph . Items [ link . Source . ID ]
node = item . GetResource ( )
}
if node == nil && g ( w . Graph . Items [ link . Destination . ID ] ) { // if the source is not a storage, we consider that the destination is the storage
nodeID = link . Source . ID
item := w . Graph . Items [ link . Destination . ID ] // and the processing is the source
node = item . GetResource ( ) // we are looking for the storage as destination
2024-10-10 09:38:27 +02:00
}
if processingID == nodeID && node != nil { // if the storage is linked to the processing
storages = append ( storages , node )
}
}
return storages
}
2024-12-12 16:25:47 +01:00
func ( wf * AbstractWorkflow ) IsProcessing ( item graph . GraphItem ) bool {
return item . Processing != nil
2024-10-03 17:10:57 +02:00
}
2024-12-12 16:25:47 +01:00
func ( wf * AbstractWorkflow ) IsCompute ( item graph . GraphItem ) bool {
return item . Compute != nil
}
func ( wf * AbstractWorkflow ) IsData ( item graph . GraphItem ) bool {
return item . Data != nil
}
func ( wf * AbstractWorkflow ) IsStorage ( item graph . GraphItem ) bool {
return item . Storage != nil
}
func ( wf * AbstractWorkflow ) IsWorkflow ( item graph . GraphItem ) bool {
return item . Workflow != nil
2024-07-26 10:36:23 +02:00
}
2024-08-30 14:50:48 +02:00
/ *
* Workflow is a struct that represents a workflow
* it defines the native workflow
* /
2024-07-19 10:54:58 +02:00
type Workflow struct {
2024-08-30 14:50:48 +02:00
utils . AbstractObject // AbstractObject contains the basic fields of an object (id, name)
AbstractWorkflow // AbstractWorkflow contains the basic fields of a workflow
2024-07-19 10:54:58 +02:00
}
2024-12-12 16:25:47 +01:00
func ( w * Workflow ) GetNearestStart ( start time . Time ) float64 {
near := float64 ( 10000000000 )
for _ , item := range w . Graph . Items {
if item . GetResource ( ) . GetLocationStart ( ) == nil {
continue
}
newS := item . GetResource ( ) . GetLocationStart ( )
if newS . Sub ( start ) . Seconds ( ) < near {
near = newS . Sub ( start ) . Seconds ( )
}
// get the nearest start from start var
}
return near
}
func ( w * Workflow ) GetLongestTime ( end * time . Time ) float64 {
if end == nil {
return - 1
}
longestTime := float64 ( 0 )
for _ , item := range w . GetGraphItems ( w . IsProcessing ) {
if item . GetResource ( ) . GetLocationEnd ( ) == nil {
continue
}
newS := item . GetResource ( ) . GetLocationEnd ( )
if longestTime < newS . Sub ( * end ) . Seconds ( ) {
longestTime = newS . Sub ( * end ) . Seconds ( )
}
// get the nearest start from start var
}
return longestTime
}
func ( ao * Workflow ) VerifyAuth ( request * tools . APIRequest ) bool {
2024-12-03 10:57:28 +01:00
isAuthorized := false
if len ( ao . Shared ) > 0 {
for _ , shared := range ao . Shared {
2024-12-12 16:25:47 +01:00
shared , code , _ := shallow_collaborative_area . NewAccessor ( request ) . LoadOne ( shared )
2024-12-03 10:57:28 +01:00
if code != 200 || shared == nil {
isAuthorized = false
}
2024-12-12 16:25:47 +01:00
isAuthorized = shared . VerifyAuth ( request )
2024-12-03 10:57:28 +01:00
}
}
2024-12-12 16:25:47 +01:00
return ao . AbstractObject . VerifyAuth ( request ) || isAuthorized
2024-12-03 10:57:28 +01:00
}
2024-08-30 14:50:48 +02:00
/ *
* CheckBooking is a function that checks the booking of the workflow on peers ( even ourselves )
* /
2024-08-23 09:53:37 +02:00
func ( wfa * Workflow ) CheckBooking ( caller * tools . HTTPCaller ) ( bool , error ) {
2024-08-12 14:18:13 +02:00
// check if
2024-08-30 14:50:48 +02:00
if wfa . Graph == nil { // no graph no booking
2024-08-12 14:18:13 +02:00
return false , nil
}
2024-12-12 16:25:47 +01:00
accessor := ( & resources . ComputeResource { } ) . GetAccessor ( & tools . APIRequest { Caller : caller } )
2024-08-12 16:11:25 +02:00
for _ , link := range wfa . Graph . Links {
2024-12-12 16:25:47 +01:00
if ok , compute_id := link . IsComputeLink ( * wfa . Graph ) ; ok { // check if the link is a link between a compute and a resource
compute , code , _ := accessor . LoadOne ( compute_id )
2024-08-12 16:11:25 +02:00
if code != 200 {
continue
}
2024-11-07 11:05:24 +01:00
// CHECK BOOKING ON PEER, compute could be a remote one
2024-12-12 16:25:47 +01:00
peerID := compute . ( * resources . ComputeResource ) . CreatorID
2024-08-13 09:49:42 +02:00
if peerID == "" {
return false , errors . New ( "no peer id" )
2024-08-30 14:50:48 +02:00
} // no peer id no booking, we need to know where to book
2024-12-12 16:25:47 +01:00
_ , err := ( & peer . Peer { } ) . LaunchPeerExecution ( peerID , compute_id , tools . BOOKING , tools . GET , nil , caller )
2024-08-12 16:11:25 +02:00
if err != nil {
return false , err
}
}
2024-08-12 14:18:13 +02:00
}
2024-08-12 16:11:25 +02:00
return true , nil
}