2015-06-01 15:49:10 +00:00
package structs
2015-06-05 22:21:17 +00:00
import (
"bytes"
2016-03-14 22:46:06 +00:00
"crypto/md5"
2015-11-21 20:34:01 +00:00
"crypto/sha1"
2016-03-14 22:46:06 +00:00
"crypto/sha256"
"crypto/sha512"
"encoding/hex"
2015-09-15 17:46:10 +00:00
"errors"
2015-06-05 22:41:03 +00:00
"fmt"
2015-11-21 20:34:01 +00:00
"io"
2016-11-03 21:14:52 +00:00
"net"
2016-10-05 20:41:29 +00:00
"os"
2016-03-18 19:01:46 +00:00
"path/filepath"
2015-11-16 22:25:19 +00:00
"reflect"
2015-10-11 19:50:16 +00:00
"regexp"
2016-10-20 20:55:35 +00:00
"sort"
2015-12-18 20:26:28 +00:00
"strconv"
2015-09-16 00:38:23 +00:00
"strings"
2015-06-05 22:41:03 +00:00
"time"
2015-06-05 22:21:17 +00:00
2015-12-01 00:51:56 +00:00
"github.com/gorhill/cronexpr"
2016-08-16 19:05:15 +00:00
"github.com/hashicorp/consul/api"
2015-09-15 17:46:10 +00:00
"github.com/hashicorp/go-multierror"
2015-10-11 19:50:16 +00:00
"github.com/hashicorp/go-version"
2017-01-18 23:55:14 +00:00
"github.com/hashicorp/nomad/helper"
2015-11-27 03:26:00 +00:00
"github.com/hashicorp/nomad/helper/args"
2015-12-18 20:26:28 +00:00
"github.com/mitchellh/copystructure"
2016-02-21 02:05:17 +00:00
"github.com/ugorji/go/codec"
hcodec "github.com/hashicorp/go-msgpack/codec"
2015-06-05 22:21:17 +00:00
)
2015-06-05 22:41:03 +00:00
var (
2015-12-18 20:17:13 +00:00
ErrNoLeader = fmt . Errorf ( "No cluster leader" )
ErrNoRegionPath = fmt . Errorf ( "No path to region" )
2015-06-05 22:41:03 +00:00
)
2015-06-01 15:49:10 +00:00
type MessageType uint8
const (
2015-07-07 16:51:42 +00:00
NodeRegisterRequestType MessageType = iota
NodeDeregisterRequestType
2015-07-04 01:41:36 +00:00
NodeUpdateStatusRequestType
2015-09-07 02:55:38 +00:00
NodeUpdateDrainRequestType
2015-07-07 16:51:42 +00:00
JobRegisterRequestType
JobDeregisterRequestType
2015-07-23 22:52:38 +00:00
EvalUpdateRequestType
EvalDeleteRequestType
2015-08-04 21:04:33 +00:00
AllocUpdateRequestType
2015-08-26 01:00:14 +00:00
AllocClientUpdateRequestType
2016-08-03 23:08:30 +00:00
ReconcileJobSummariesRequestType
2016-08-19 01:14:58 +00:00
VaultAccessorRegisterRequestType
2016-08-22 20:57:27 +00:00
VaultAccessorDegisterRequestType
2015-06-01 15:49:10 +00:00
)
const (
// IgnoreUnknownTypeFlag is set along with a MessageType
// to indicate that the message type can be safely ignored
// if it is not recognized. This is for future proofing, so
// that new commands can be added in a way that won't cause
// old servers to crash when the FSM attempts to process them.
IgnoreUnknownTypeFlag MessageType = 128
2016-05-28 01:14:34 +00:00
// ApiMajorVersion is returned as part of the Status.Version request.
// It should be incremented anytime the APIs are changed in a way
// that would break clients for sane client versioning.
ApiMajorVersion = 1
// ApiMinorVersion is returned as part of the Status.Version request.
// It should be incremented anytime the APIs are changed to allow
// for sane client versioning. Minor changes should be compatible
// within the major version.
ApiMinorVersion = 1
ProtocolVersion = "protocol"
APIMajorVersion = "api.major"
APIMinorVersion = "api.minor"
2015-06-01 15:49:10 +00:00
)
2015-06-05 22:21:17 +00:00
2015-06-05 22:41:03 +00:00
// RPCInfo is used to describe common information about query
type RPCInfo interface {
RequestRegion ( ) string
IsRead ( ) bool
AllowStaleRead ( ) bool
}
// QueryOptions is used to specify various flags for read queries
type QueryOptions struct {
2015-07-03 23:04:24 +00:00
// The target region for this query
Region string
2015-06-07 18:18:59 +00:00
// If set, wait until query exceeds given index. Must be provided
// with MaxQueryTime.
MinQueryIndex uint64
// Provided with MinQueryIndex to wait for change.
MaxQueryTime time . Duration
2015-06-05 22:41:03 +00:00
// If set, any follower can service the request. Results
// may be arbitrarily stale.
AllowStale bool
2015-12-22 22:44:33 +00:00
// If set, used as prefix for resource list searches
Prefix string
2015-06-05 22:41:03 +00:00
}
func ( q QueryOptions ) RequestRegion ( ) string {
return q . Region
}
// QueryOption only applies to reads, so always true
func ( q QueryOptions ) IsRead ( ) bool {
return true
}
func ( q QueryOptions ) AllowStaleRead ( ) bool {
return q . AllowStale
}
type WriteRequest struct {
2015-07-03 23:04:24 +00:00
// The target region for this write
2015-06-05 22:41:03 +00:00
Region string
}
func ( w WriteRequest ) RequestRegion ( ) string {
// The target region for this request
return w . Region
}
// WriteRequest only applies to writes, always false
func ( w WriteRequest ) IsRead ( ) bool {
return false
}
func ( w WriteRequest ) AllowStaleRead ( ) bool {
return false
}
// QueryMeta allows a query response to include potentially
// useful metadata about a query
type QueryMeta struct {
// This is the index associated with the read
Index uint64
// If AllowStale is used, this is time elapsed since
// last contact between the follower and leader. This
// can be used to gauge staleness.
LastContact time . Duration
// Used to indicate if there is a known leader node
KnownLeader bool
}
2016-01-13 18:19:53 +00:00
// WriteMeta allows a write response to include potentially
2015-07-03 23:04:24 +00:00
// useful metadata about the write
type WriteMeta struct {
// This is the index associated with the write
Index uint64
}
2015-06-07 18:18:59 +00:00
2015-09-07 03:31:32 +00:00
// NodeRegisterRequest is used for Node.Register endpoint
2015-06-07 18:18:59 +00:00
// to register a node as being a schedulable entity.
2015-07-07 16:51:42 +00:00
type NodeRegisterRequest struct {
2015-07-03 23:04:24 +00:00
Node * Node
WriteRequest
}
2015-09-07 03:31:32 +00:00
// NodeDeregisterRequest is used for Node.Deregister endpoint
2015-07-04 01:41:36 +00:00
// to deregister a node as being a schedulable entity.
2015-07-07 16:51:42 +00:00
type NodeDeregisterRequest struct {
2015-07-04 01:41:36 +00:00
NodeID string
WriteRequest
}
2016-05-23 18:09:31 +00:00
// NodeServerInfo is used to in NodeUpdateResponse to return Nomad server
// information used in RPC server lists.
type NodeServerInfo struct {
// RPCAdvertiseAddr is the IP endpoint that a Nomad Server wishes to
// be contacted at for RPCs.
2016-06-11 03:26:15 +00:00
RPCAdvertiseAddr string
2016-05-23 18:09:31 +00:00
2016-05-28 01:14:34 +00:00
// RpcMajorVersion is the major version number the Nomad Server
// supports
2016-06-11 03:26:15 +00:00
RPCMajorVersion int32
2016-05-28 01:14:34 +00:00
// RpcMinorVersion is the minor version number the Nomad Server
// supports
2016-06-11 03:26:15 +00:00
RPCMinorVersion int32
2016-05-27 10:45:09 +00:00
// Datacenter is the datacenter that a Nomad server belongs to
Datacenter string
2016-05-23 18:09:31 +00:00
}
2015-09-07 03:31:32 +00:00
// NodeUpdateStatusRequest is used for Node.UpdateStatus endpoint
2015-07-04 01:41:36 +00:00
// to update the status of a node.
2015-07-07 16:51:42 +00:00
type NodeUpdateStatusRequest struct {
2015-07-04 01:41:36 +00:00
NodeID string
Status string
WriteRequest
}
2015-09-07 02:55:38 +00:00
// NodeUpdateDrainRequest is used for updatin the drain status
type NodeUpdateDrainRequest struct {
NodeID string
Drain bool
WriteRequest
}
2015-08-16 01:20:35 +00:00
// NodeEvaluateRequest is used to re-evaluate the ndoe
type NodeEvaluateRequest struct {
NodeID string
WriteRequest
}
2015-07-06 21:23:15 +00:00
// NodeSpecificRequest is used when we just need to specify a target node
type NodeSpecificRequest struct {
2016-08-16 06:11:57 +00:00
NodeID string
SecretID string
2015-08-16 01:20:35 +00:00
QueryOptions
2015-07-06 21:23:15 +00:00
}
2015-07-07 16:51:42 +00:00
// JobRegisterRequest is used for Job.Register endpoint
// to register a job as being a schedulable entity.
type JobRegisterRequest struct {
Job * Job
2016-06-08 23:48:02 +00:00
// If EnforceIndex is set then the job will only be registered if the passed
// JobModifyIndex matches the current Jobs index. If the index is zero, the
// register only occurs if the job is new.
EnforceIndex bool
JobModifyIndex uint64
2015-07-07 16:51:42 +00:00
WriteRequest
}
// JobDeregisterRequest is used for Job.Deregister endpoint
// to deregister a job as being a schedulable entity.
type JobDeregisterRequest struct {
2015-07-23 22:15:48 +00:00
JobID string
2017-04-15 03:54:30 +00:00
// Purge controls whether the deregister purges the job from the system or
// whether the job is just marked as stopped and will be removed by the
// garbage collector
Purge bool
2015-07-07 16:51:42 +00:00
WriteRequest
}
2015-08-16 01:11:26 +00:00
// JobEvaluateRequest is used when we just need to re-evaluate a target job
type JobEvaluateRequest struct {
JobID string
WriteRequest
}
2015-07-23 21:41:18 +00:00
// JobSpecificRequest is used when we just need to specify a target job
type JobSpecificRequest struct {
2016-11-24 12:20:52 +00:00
JobID string
AllAllocs bool
2015-08-15 19:59:10 +00:00
QueryOptions
2015-07-23 21:41:18 +00:00
}
2015-09-06 19:18:45 +00:00
// JobListRequest is used to parameterize a list request
type JobListRequest struct {
QueryOptions
}
2016-05-05 18:21:58 +00:00
// JobPlanRequest is used for the Job.Plan endpoint to trigger a dry-run
// evaluation of the Job.
type JobPlanRequest struct {
Job * Job
Diff bool // Toggles an annotated diff
WriteRequest
}
2016-07-18 23:51:47 +00:00
// JobSummaryRequest is used when we just need to get a specific job summary
type JobSummaryRequest struct {
JobID string
QueryOptions
}
2017-01-20 18:33:52 +00:00
// JobDispatchRequest is used to dispatch a job based on a parameterized job
2016-11-26 02:04:55 +00:00
type JobDispatchRequest struct {
2016-12-14 20:50:08 +00:00
JobID string
Payload [ ] byte
Meta map [ string ] string
2016-11-26 02:04:55 +00:00
WriteRequest
}
2017-02-06 19:48:28 +00:00
// JobValidateRequest is used to validate a job
type JobValidateRequest struct {
Job * Job
WriteRequest
}
// JobValidateResponse is the response from validate request
type JobValidateResponse struct {
// DriverConfigValidated indicates whether the agent validated the driver
// config
DriverConfigValidated bool
// ValidationErrors is a list of validation errors
ValidationErrors [ ] string
2017-03-03 23:00:39 +00:00
// Error is a string version of any error that may have occured
Error string
2017-02-06 19:48:28 +00:00
}
2015-09-06 21:28:29 +00:00
// NodeListRequest is used to parameterize a list request
type NodeListRequest struct {
QueryOptions
}
2015-08-06 21:51:15 +00:00
// EvalUpdateRequest is used for upserting evaluations.
2015-07-23 22:52:38 +00:00
type EvalUpdateRequest struct {
2015-08-15 21:22:21 +00:00
Evals [ ] * Evaluation
EvalToken string
2015-07-23 22:52:38 +00:00
WriteRequest
}
// EvalDeleteRequest is used for deleting an evaluation.
type EvalDeleteRequest struct {
2015-08-15 23:07:22 +00:00
Evals [ ] string
Allocs [ ] string
2015-07-23 22:52:38 +00:00
WriteRequest
}
2015-07-23 23:00:19 +00:00
// EvalSpecificRequest is used when we just need to specify a target evaluation
type EvalSpecificRequest struct {
EvalID string
2015-08-16 01:20:35 +00:00
QueryOptions
2015-07-23 23:00:19 +00:00
}
2015-08-12 22:25:31 +00:00
// EvalAckRequest is used to Ack/Nack a specific evaluation
type EvalAckRequest struct {
EvalID string
Token string
WriteRequest
}
2015-07-24 04:58:51 +00:00
// EvalDequeueRequest is used when we want to dequeue an evaluation
type EvalDequeueRequest struct {
2016-10-26 21:52:48 +00:00
Schedulers [ ] string
Timeout time . Duration
SchedulerVersion uint16
2015-07-24 04:58:51 +00:00
WriteRequest
}
2015-09-06 23:01:16 +00:00
// EvalListRequest is used to list the evaluations
type EvalListRequest struct {
QueryOptions
}
2015-07-27 22:31:49 +00:00
// PlanRequest is used to submit an allocation plan to the leader
type PlanRequest struct {
Plan * Plan
WriteRequest
}
2015-08-04 21:04:33 +00:00
// AllocUpdateRequest is used to submit changes to allocations, either
// to cause evictions or to assign new allocaitons. Both can be done
// within a single transaction
type AllocUpdateRequest struct {
// Alloc is the list of new allocations to assign
Alloc [ ] * Allocation
2016-02-21 19:31:27 +00:00
// Job is the shared parent job of the allocations.
// It is pulled out since it is common to reduce payload size.
Job * Job
2015-08-26 01:12:51 +00:00
WriteRequest
2015-08-04 21:04:33 +00:00
}
2015-09-06 22:34:28 +00:00
// AllocListRequest is used to request a list of allocations
type AllocListRequest struct {
QueryOptions
}
2015-09-06 22:46:45 +00:00
// AllocSpecificRequest is used to query a specific allocation
type AllocSpecificRequest struct {
AllocID string
QueryOptions
}
2016-05-27 06:48:34 +00:00
// AllocsGetRequest is used to query a set of allocations
2016-02-01 21:57:35 +00:00
type AllocsGetRequest struct {
AllocIDs [ ] string
QueryOptions
}
2016-01-13 18:19:53 +00:00
// PeriodicForceReqeuest is used to force a specific periodic job.
type PeriodicForceRequest struct {
JobID string
WriteRequest
}
2016-11-03 21:14:52 +00:00
// ServerMembersResponse has the list of servers in a cluster
type ServerMembersResponse struct {
ServerName string
ServerRegion string
ServerDC string
Members [ ] * ServerMember
}
// ServerMember holds information about a Nomad server agent in a cluster
type ServerMember struct {
Name string
Addr net . IP
Port uint16
Tags map [ string ] string
Status string
ProtocolMin uint8
ProtocolMax uint8
ProtocolCur uint8
DelegateMin uint8
DelegateMax uint8
DelegateCur uint8
}
2016-08-18 21:31:44 +00:00
// DeriveVaultTokenRequest is used to request wrapped Vault tokens for the
// following tasks in the given allocation
2016-08-18 17:50:47 +00:00
type DeriveVaultTokenRequest struct {
NodeID string
SecretID string
AllocID string
Tasks [ ] string
QueryOptions
}
2016-08-22 20:57:27 +00:00
// VaultAccessorsRequest is used to operate on a set of Vault accessors
type VaultAccessorsRequest struct {
2016-08-19 01:14:58 +00:00
Accessors [ ] * VaultAccessor
}
// VaultAccessor is a reference to a created Vault token on behalf of
// an allocation's task.
type VaultAccessor struct {
AllocID string
Task string
NodeID string
Accessor string
2016-08-19 01:57:33 +00:00
CreationTTL int
2016-08-19 01:14:58 +00:00
// Raft Indexes
CreateIndex uint64
}
2016-08-18 21:31:44 +00:00
// DeriveVaultTokenResponse returns the wrapped tokens for each requested task
2016-08-18 17:50:47 +00:00
type DeriveVaultTokenResponse struct {
2016-08-19 01:57:33 +00:00
// Tasks is a mapping between the task name and the wrapped token
2016-08-18 21:31:44 +00:00
Tasks map [ string ] string
2016-10-23 01:08:30 +00:00
// Error stores any error that occured. Errors are stored here so we can
// communicate whether it is retriable
Error * RecoverableError
2016-08-18 17:50:47 +00:00
QueryMeta
}
2015-08-15 19:59:10 +00:00
// GenericRequest is used to request where no
// specific information is needed.
type GenericRequest struct {
QueryOptions
}
2015-07-04 01:41:36 +00:00
// GenericResponse is used to respond to a request where no
// specific response information is needed.
type GenericResponse struct {
2015-07-03 23:04:24 +00:00
WriteMeta
}
2015-08-15 19:59:10 +00:00
// VersionResponse is used for the Status.Version reseponse
type VersionResponse struct {
2015-08-15 20:08:06 +00:00
Build string
Versions map [ string ] int
2015-08-15 19:59:10 +00:00
QueryMeta
}
2015-08-06 18:48:44 +00:00
// JobRegisterResponse is used to respond to a job registration
type JobRegisterResponse struct {
EvalID string
EvalCreateIndex uint64
JobModifyIndex uint64
QueryMeta
}
2015-08-06 21:17:18 +00:00
// JobDeregisterResponse is used to respond to a job deregistration
type JobDeregisterResponse struct {
EvalID string
EvalCreateIndex uint64
JobModifyIndex uint64
QueryMeta
}
2015-08-06 23:39:20 +00:00
// NodeUpdateResponse is used to respond to a node update
type NodeUpdateResponse struct {
2015-08-23 00:37:50 +00:00
HeartbeatTTL time . Duration
2015-08-06 23:39:20 +00:00
EvalIDs [ ] string
EvalCreateIndex uint64
NodeModifyIndex uint64
2016-05-23 18:09:31 +00:00
// LeaderRPCAddr is the RPC address of the current Raft Leader. If
// empty, the current Nomad Server is in the minority of a partition.
LeaderRPCAddr string
// NumNodes is the number of Nomad nodes attached to this quorum of
// Nomad Servers at the time of the response. This value can
// fluctuate based on the health of the cluster between heartbeats.
NumNodes int32
// Servers is the full list of known Nomad servers in the local
// region.
Servers [ ] * NodeServerInfo
2015-08-06 23:39:20 +00:00
QueryMeta
}
2015-09-07 03:00:12 +00:00
// NodeDrainUpdateResponse is used to respond to a node drain update
type NodeDrainUpdateResponse struct {
EvalIDs [ ] string
EvalCreateIndex uint64
NodeModifyIndex uint64
QueryMeta
}
2015-08-23 02:17:49 +00:00
// NodeAllocsResponse is used to return allocs for a single node
type NodeAllocsResponse struct {
Allocs [ ] * Allocation
QueryMeta
}
2016-01-29 14:29:52 +00:00
// NodeClientAllocsResponse is used to return allocs meta data for a single node
type NodeClientAllocsResponse struct {
Allocs map [ string ] uint64
QueryMeta
}
2015-07-06 21:23:15 +00:00
// SingleNodeResponse is used to return a single node
type SingleNodeResponse struct {
Node * Node
QueryMeta
}
2017-04-13 22:47:59 +00:00
// NodeListResponse is used for a list request
2015-09-06 21:28:29 +00:00
type NodeListResponse struct {
Nodes [ ] * NodeListStub
QueryMeta
}
2015-07-23 21:41:18 +00:00
// SingleJobResponse is used to return a single job
type SingleJobResponse struct {
Job * Job
QueryMeta
}
2016-07-22 06:13:07 +00:00
// JobSummaryResponse is used to return a single job summary
2016-07-21 21:43:21 +00:00
type JobSummaryResponse struct {
2016-07-18 23:51:47 +00:00
JobSummary * JobSummary
QueryMeta
}
2016-11-26 02:04:55 +00:00
type JobDispatchResponse struct {
DispatchedJobID string
EvalID string
EvalCreateIndex uint64
JobCreateIndex uint64
2017-02-17 19:43:14 +00:00
WriteMeta
2016-11-26 02:04:55 +00:00
}
2015-09-06 19:18:45 +00:00
// JobListResponse is used for a list request
type JobListResponse struct {
Jobs [ ] * JobListStub
QueryMeta
}
2017-04-13 22:47:59 +00:00
// JobVersionsResponse is used for a job get versions request
type JobVersionsResponse struct {
Versions [ ] * Job
QueryMeta
}
2016-05-05 18:21:58 +00:00
// JobPlanResponse is used to respond to a job plan request
type JobPlanResponse struct {
2016-05-12 18:29:38 +00:00
// Annotations stores annotations explaining decisions the scheduler made.
Annotations * PlanAnnotations
2016-05-05 18:21:58 +00:00
2016-05-31 21:51:23 +00:00
// FailedTGAllocs is the placement failures per task group.
FailedTGAllocs map [ string ] * AllocMetric
2016-05-16 18:48:44 +00:00
// JobModifyIndex is the modification index of the job. The value can be
// used when running `nomad run` to ensure that the Job wasn’ t modified
// since the last plan. If the job is being created, the value is zero.
JobModifyIndex uint64
2016-05-05 18:21:58 +00:00
// CreatedEvals is the set of evaluations created by the scheduler. The
// reasons for this can be rolling-updates or blocked evals.
CreatedEvals [ ] * Evaluation
// Diff contains the diff of the job and annotations on whether the change
// causes an in-place update or create/destroy
Diff * JobDiff
2016-06-15 20:34:45 +00:00
// NextPeriodicLaunch is the time duration till the job would be launched if
// submitted.
NextPeriodicLaunch time . Time
2016-05-12 01:51:48 +00:00
WriteMeta
2016-05-05 18:21:58 +00:00
}
2015-09-06 22:46:45 +00:00
// SingleAllocResponse is used to return a single allocation
type SingleAllocResponse struct {
Alloc * Allocation
QueryMeta
}
2016-02-01 21:57:35 +00:00
// AllocsGetResponse is used to return a set of allocations
type AllocsGetResponse struct {
Allocs [ ] * Allocation
QueryMeta
}
2015-09-06 19:18:45 +00:00
// JobAllocationsResponse is used to return the allocations for a job
type JobAllocationsResponse struct {
2015-09-06 23:14:41 +00:00
Allocations [ ] * AllocListStub
2015-09-06 19:18:45 +00:00
QueryMeta
}
// JobEvaluationsResponse is used to return the evaluations for a job
type JobEvaluationsResponse struct {
Evaluations [ ] * Evaluation
QueryMeta
}
2015-07-23 23:00:19 +00:00
// SingleEvalResponse is used to return a single evaluation
type SingleEvalResponse struct {
Eval * Evaluation
QueryMeta
}
2015-08-12 22:25:31 +00:00
// EvalDequeueResponse is used to return from a dequeue
type EvalDequeueResponse struct {
Eval * Evaluation
Token string
QueryMeta
}
2015-07-27 22:31:49 +00:00
// PlanResponse is used to return from a PlanRequest
type PlanResponse struct {
Result * PlanResult
WriteMeta
}
2015-09-06 22:34:28 +00:00
// AllocListResponse is used for a list request
type AllocListResponse struct {
Allocations [ ] * AllocListStub
QueryMeta
}
2015-09-06 23:01:16 +00:00
// EvalListResponse is used for a list request
type EvalListResponse struct {
Evaluations [ ] * Evaluation
QueryMeta
}
2015-09-06 23:14:41 +00:00
// EvalAllocationsResponse is used to return the allocations for an evaluation
type EvalAllocationsResponse struct {
Allocations [ ] * AllocListStub
QueryMeta
}
2016-01-13 18:19:53 +00:00
// PeriodicForceResponse is used to respond to a periodic job force launch
type PeriodicForceResponse struct {
EvalID string
EvalCreateIndex uint64
WriteMeta
}
2015-07-03 23:57:48 +00:00
const (
NodeStatusInit = "initializing"
NodeStatusReady = "ready"
NodeStatusDown = "down"
)
2015-08-13 23:40:51 +00:00
// ShouldDrainNode checks if a given node status should trigger an
2015-08-06 23:39:20 +00:00
// evaluation. Some states don't require any further action.
2015-08-13 23:40:51 +00:00
func ShouldDrainNode ( status string ) bool {
2015-08-06 23:39:20 +00:00
switch status {
2015-09-07 02:47:02 +00:00
case NodeStatusInit , NodeStatusReady :
2015-08-06 23:39:20 +00:00
return false
2015-09-07 02:47:02 +00:00
case NodeStatusDown :
2015-08-06 23:39:20 +00:00
return true
default :
panic ( fmt . Sprintf ( "unhandled node status %s" , status ) )
}
}
// ValidNodeStatus is used to check if a node status is valid
func ValidNodeStatus ( status string ) bool {
switch status {
2015-09-07 02:47:02 +00:00
case NodeStatusInit , NodeStatusReady , NodeStatusDown :
2015-08-06 23:39:20 +00:00
return true
default :
return false
}
}
2015-07-03 23:04:24 +00:00
// Node is a representation of a schedulable client node
type Node struct {
// ID is a unique identifier for the node. It can be constructed
// by doing a concatenation of the Name and Datacenter as a simple
// approach. Alternatively a UUID may be used.
ID string
2016-08-16 06:11:57 +00:00
// SecretID is an ID that is only known by the Node and the set of Servers.
// It is not accessible via the API and is used to authenticate nodes
// conducting priviledged activities.
SecretID string
2015-06-07 18:18:59 +00:00
// Datacenter for this node
Datacenter string
2015-06-07 19:14:41 +00:00
// Node name
2015-07-03 23:04:24 +00:00
Name string
2015-06-07 18:18:59 +00:00
2016-01-27 19:06:48 +00:00
// HTTPAddr is the address on which the Nomad client is listening for http
// requests
2016-01-26 22:31:52 +00:00
HTTPAddr string
2016-10-26 18:13:53 +00:00
// TLSEnabled indicates if the Agent has TLS enabled for the HTTP API
TLSEnabled bool
2015-06-07 18:18:59 +00:00
// Attributes is an arbitrary set of key/value
// data that can be used for constraints. Examples
2015-08-28 08:30:47 +00:00
// include "kernel.name=linux", "arch=386", "driver.docker=1",
2015-07-03 23:04:24 +00:00
// "docker.runtime=1.8.3"
2015-07-06 20:01:10 +00:00
Attributes map [ string ] string
2015-06-07 18:18:59 +00:00
// Resources is the available resources on the client.
// For example 'cpu=2' 'memory=2048'
2015-07-06 20:01:10 +00:00
Resources * Resources
2015-06-07 18:18:59 +00:00
2015-07-03 23:57:48 +00:00
// Reserved is the set of resources that are reserved,
// and should be subtracted from the total resources for
// the purposes of scheduling. This may be provide certain
// high-watermark tolerances or because of external schedulers
// consuming resources.
Reserved * Resources
2015-06-07 18:18:59 +00:00
// Links are used to 'link' this client to external
// systems. For example 'consul=foo.dc1' 'aws=i-83212'
// 'ami=ami-123'
2015-07-06 20:01:10 +00:00
Links map [ string ] string
2015-06-07 18:18:59 +00:00
// Meta is used to associate arbitrary metadata with this
// client. This is opaque to Nomad.
Meta map [ string ] string
2015-07-04 00:37:01 +00:00
// NodeClass is an opaque identifier used to group nodes
// together for the purpose of determining scheduling pressure.
NodeClass string
2016-01-21 01:30:02 +00:00
// ComputedClass is a unique id that identifies nodes with a common set of
// attributes and capabilities.
2016-01-30 01:46:44 +00:00
ComputedClass string
2016-01-21 01:30:02 +00:00
2015-09-07 02:47:02 +00:00
// Drain is controlled by the servers, and not the client.
// If true, no jobs will be scheduled to this node, and existing
// allocations will be drained.
Drain bool
2015-07-03 23:04:24 +00:00
// Status of this node
Status string
2015-07-04 00:50:54 +00:00
2015-08-15 20:08:06 +00:00
// StatusDescription is meant to provide more human useful information
StatusDescription string
2016-07-12 17:29:23 +00:00
// StatusUpdatedAt is the time stamp at which the state of the node was
// updated
StatusUpdatedAt int64
2015-07-04 00:50:54 +00:00
// Raft Indexes
CreateIndex uint64
ModifyIndex uint64
2015-06-07 18:18:59 +00:00
}
2016-09-24 04:15:50 +00:00
// Ready returns if the node is ready for running allocations
func ( n * Node ) Ready ( ) bool {
return n . Status == NodeStatusReady && ! n . Drain
}
2016-02-10 21:44:53 +00:00
func ( n * Node ) Copy ( ) * Node {
2016-02-11 01:54:43 +00:00
if n == nil {
2016-02-10 21:44:53 +00:00
return nil
}
2016-02-11 01:54:43 +00:00
nn := new ( Node )
* nn = * n
2017-01-18 23:55:14 +00:00
nn . Attributes = helper . CopyMapStringString ( nn . Attributes )
2016-02-11 01:54:43 +00:00
nn . Resources = nn . Resources . Copy ( )
nn . Reserved = nn . Reserved . Copy ( )
2017-01-18 23:55:14 +00:00
nn . Links = helper . CopyMapStringString ( nn . Links )
nn . Meta = helper . CopyMapStringString ( nn . Meta )
2016-02-11 01:54:43 +00:00
return nn
2016-02-10 21:44:53 +00:00
}
2015-08-23 00:17:13 +00:00
// TerminalStatus returns if the current status is terminal and
// will no longer transition.
func ( n * Node ) TerminalStatus ( ) bool {
switch n . Status {
case NodeStatusDown :
return true
default :
return false
}
}
2015-09-06 22:34:28 +00:00
// Stub returns a summarized version of the node
func ( n * Node ) Stub ( ) * NodeListStub {
return & NodeListStub {
ID : n . ID ,
Datacenter : n . Datacenter ,
Name : n . Name ,
NodeClass : n . NodeClass ,
2015-09-07 02:47:02 +00:00
Drain : n . Drain ,
2015-09-06 22:34:28 +00:00
Status : n . Status ,
StatusDescription : n . StatusDescription ,
CreateIndex : n . CreateIndex ,
ModifyIndex : n . ModifyIndex ,
}
}
// NodeListStub is used to return a subset of job information
// for the job list
type NodeListStub struct {
ID string
Datacenter string
Name string
NodeClass string
2015-09-07 02:47:02 +00:00
Drain bool
2015-09-06 22:34:28 +00:00
Status string
StatusDescription string
CreateIndex uint64
ModifyIndex uint64
}
2015-06-07 18:18:59 +00:00
// Resources is used to define the resources available
// on a client
type Resources struct {
2015-09-23 18:14:32 +00:00
CPU int
2017-02-22 20:30:05 +00:00
MemoryMB int
DiskMB int
2015-07-03 23:57:48 +00:00
IOPS int
2016-01-21 19:25:14 +00:00
Networks [ ] * NetworkResource
2015-06-07 18:18:59 +00:00
}
2016-08-11 07:20:53 +00:00
const (
BytesInMegabyte = 1024 * 1024
)
2016-07-19 06:37:54 +00:00
// DefaultResources returns the default resources for a task.
2016-02-02 20:00:26 +00:00
func DefaultResources ( ) * Resources {
return & Resources {
CPU : 100 ,
MemoryMB : 10 ,
2016-02-03 00:13:25 +00:00
IOPS : 0 ,
2016-02-02 20:00:26 +00:00
}
}
2016-08-11 07:20:53 +00:00
// DiskInBytes returns the amount of disk resources in bytes.
func ( r * Resources ) DiskInBytes ( ) int64 {
return int64 ( r . DiskMB * BytesInMegabyte )
}
2016-02-02 20:07:16 +00:00
// Merge merges this resource with another resource.
2016-02-02 20:00:26 +00:00
func ( r * Resources ) Merge ( other * Resources ) {
if other . CPU != 0 {
r . CPU = other . CPU
}
if other . MemoryMB != 0 {
r . MemoryMB = other . MemoryMB
}
if other . DiskMB != 0 {
r . DiskMB = other . DiskMB
}
if other . IOPS != 0 {
r . IOPS = other . IOPS
}
if len ( other . Networks ) != 0 {
r . Networks = other . Networks
}
}
2016-07-20 23:07:15 +00:00
func ( r * Resources ) Canonicalize ( ) {
2016-07-18 23:17:38 +00:00
// Ensure that an empty and nil slices are treated the same to avoid scheduling
// problems since we use reflect DeepEquals.
if len ( r . Networks ) == 0 {
r . Networks = nil
}
for _ , n := range r . Networks {
2016-07-20 23:07:15 +00:00
n . Canonicalize ( )
2016-07-18 23:17:38 +00:00
}
}
2016-02-02 20:07:16 +00:00
// MeetsMinResources returns an error if the resources specified are less than
// the minimum allowed.
2016-02-02 20:00:26 +00:00
func ( r * Resources ) MeetsMinResources ( ) error {
var mErr multierror . Error
2016-02-16 18:25:45 +00:00
if r . CPU < 20 {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "minimum CPU value is 20; got %d" , r . CPU ) )
2016-02-02 20:00:26 +00:00
}
if r . MemoryMB < 10 {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "minimum MemoryMB value is 10; got %d" , r . MemoryMB ) )
}
2016-02-02 21:26:12 +00:00
if r . IOPS < 0 {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "minimum IOPS value is 0; got %d" , r . IOPS ) )
2016-02-02 20:00:26 +00:00
}
2016-02-02 20:07:16 +00:00
for i , n := range r . Networks {
if err := n . MeetsMinResources ( ) ; err != nil {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "network resource at index %d failed: %v" , i , err ) )
}
}
2016-02-02 20:00:26 +00:00
return mErr . ErrorOrNil ( )
}
2015-09-13 21:30:45 +00:00
// Copy returns a deep copy of the resources
func ( r * Resources ) Copy ( ) * Resources {
2016-02-11 01:54:43 +00:00
if r == nil {
return nil
}
2015-09-13 21:30:45 +00:00
newR := new ( Resources )
* newR = * r
2016-03-21 23:29:21 +00:00
if r . Networks != nil {
n := len ( r . Networks )
newR . Networks = make ( [ ] * NetworkResource , n )
for i := 0 ; i < n ; i ++ {
newR . Networks [ i ] = r . Networks [ i ] . Copy ( )
}
2015-09-13 21:30:45 +00:00
}
return newR
}
2015-09-13 22:04:36 +00:00
// NetIndex finds the matching net index using device name
2015-09-13 00:04:09 +00:00
func ( r * Resources ) NetIndex ( n * NetworkResource ) int {
2015-08-05 00:23:42 +00:00
for idx , net := range r . Networks {
2015-09-13 22:04:36 +00:00
if net . Device == n . Device {
2015-09-12 23:21:57 +00:00
return idx
}
}
return - 1
}
2015-08-05 00:32:57 +00:00
// Superset checks if one set of resources is a superset
2015-09-13 21:59:34 +00:00
// of another. This ignores network resources, and the NetworkIndex
// should be used for that.
2015-09-14 01:38:11 +00:00
func ( r * Resources ) Superset ( other * Resources ) ( bool , string ) {
2015-08-05 00:32:57 +00:00
if r . CPU < other . CPU {
2015-09-14 01:38:11 +00:00
return false , "cpu exhausted"
2015-08-05 00:32:57 +00:00
}
if r . MemoryMB < other . MemoryMB {
2015-09-14 01:38:11 +00:00
return false , "memory exhausted"
2015-08-05 00:32:57 +00:00
}
if r . DiskMB < other . DiskMB {
2015-09-14 01:38:11 +00:00
return false , "disk exhausted"
2015-08-05 00:32:57 +00:00
}
if r . IOPS < other . IOPS {
2015-09-14 01:38:11 +00:00
return false , "iops exhausted"
2015-08-05 00:32:57 +00:00
}
2015-09-14 01:38:11 +00:00
return true , ""
2015-08-05 00:32:57 +00:00
}
2015-08-05 00:41:02 +00:00
// Add adds the resources of the delta to this, potentially
// returning an error if not possible.
func ( r * Resources ) Add ( delta * Resources ) error {
if delta == nil {
return nil
}
r . CPU += delta . CPU
r . MemoryMB += delta . MemoryMB
r . DiskMB += delta . DiskMB
r . IOPS += delta . IOPS
2015-09-12 23:33:41 +00:00
for _ , n := range delta . Networks {
// Find the matching interface by IP or CIDR
2015-09-13 00:04:09 +00:00
idx := r . NetIndex ( n )
2015-08-05 00:41:02 +00:00
if idx == - 1 {
2015-09-13 23:40:53 +00:00
r . Networks = append ( r . Networks , n . Copy ( ) )
2015-09-12 23:33:41 +00:00
} else {
r . Networks [ idx ] . Add ( n )
2015-08-05 00:41:02 +00:00
}
}
return nil
}
2015-09-15 00:43:42 +00:00
func ( r * Resources ) GoString ( ) string {
return fmt . Sprintf ( "*%#v" , * r )
}
2015-11-14 02:09:42 +00:00
type Port struct {
Label string
2017-02-22 20:30:05 +00:00
Value int
2015-11-14 02:09:42 +00:00
}
2015-09-24 06:56:25 +00:00
// NetworkResource is used to represent available network
2015-07-03 23:57:48 +00:00
// resources
2015-06-07 18:18:59 +00:00
type NetworkResource struct {
2015-11-14 02:09:42 +00:00
Device string // Name of the device
CIDR string // CIDR block of addresses
IP string // IP address
MBits int // Throughput
ReservedPorts [ ] Port // Reserved ports
DynamicPorts [ ] Port // Dynamically assigned ports
2015-07-03 23:57:48 +00:00
}
2016-07-20 23:07:15 +00:00
func ( n * NetworkResource ) Canonicalize ( ) {
2016-07-18 23:17:38 +00:00
// Ensure that an empty and nil slices are treated the same to avoid scheduling
// problems since we use reflect DeepEquals.
if len ( n . ReservedPorts ) == 0 {
n . ReservedPorts = nil
}
if len ( n . DynamicPorts ) == 0 {
n . DynamicPorts = nil
}
}
2016-02-02 20:07:16 +00:00
// MeetsMinResources returns an error if the resources specified are less than
// the minimum allowed.
func ( n * NetworkResource ) MeetsMinResources ( ) error {
var mErr multierror . Error
if n . MBits < 1 {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "minimum MBits value is 1; got %d" , n . MBits ) )
}
return mErr . ErrorOrNil ( )
}
2015-09-13 21:30:45 +00:00
// Copy returns a deep copy of the network resource
func ( n * NetworkResource ) Copy ( ) * NetworkResource {
2016-02-11 01:54:43 +00:00
if n == nil {
return nil
}
2015-09-13 21:30:45 +00:00
newR := new ( NetworkResource )
* newR = * n
2015-09-14 01:38:11 +00:00
if n . ReservedPorts != nil {
2015-11-14 02:09:42 +00:00
newR . ReservedPorts = make ( [ ] Port , len ( n . ReservedPorts ) )
2015-09-14 01:38:11 +00:00
copy ( newR . ReservedPorts , n . ReservedPorts )
}
2015-11-24 00:32:30 +00:00
if n . DynamicPorts != nil {
newR . DynamicPorts = make ( [ ] Port , len ( n . DynamicPorts ) )
copy ( newR . DynamicPorts , n . DynamicPorts )
}
2015-09-13 21:30:45 +00:00
return newR
}
2015-08-05 00:41:02 +00:00
// Add adds the resources of the delta to this, potentially
// returning an error if not possible.
func ( n * NetworkResource ) Add ( delta * NetworkResource ) {
if len ( delta . ReservedPorts ) > 0 {
n . ReservedPorts = append ( n . ReservedPorts , delta . ReservedPorts ... )
}
n . MBits += delta . MBits
2015-09-22 20:33:16 +00:00
n . DynamicPorts = append ( n . DynamicPorts , delta . DynamicPorts ... )
2015-08-05 00:41:02 +00:00
}
2015-09-15 01:27:37 +00:00
func ( n * NetworkResource ) GoString ( ) string {
return fmt . Sprintf ( "*%#v" , * n )
}
2015-11-20 03:08:21 +00:00
func ( n * NetworkResource ) MapLabelToValues ( port_map map [ string ] int ) map [ string ] int {
2015-11-15 09:13:42 +00:00
labelValues := make ( map [ string ] int )
ports := append ( n . ReservedPorts , n . DynamicPorts ... )
for _ , port := range ports {
2015-11-20 03:08:21 +00:00
if mapping , ok := port_map [ port . Label ] ; ok {
labelValues [ port . Label ] = mapping
} else {
labelValues [ port . Label ] = port . Value
}
2015-11-15 09:13:42 +00:00
}
return labelValues
}
2015-07-03 23:57:48 +00:00
const (
2015-08-15 19:38:58 +00:00
// JobTypeNomad is reserved for internal system tasks and is
// always handled by the CoreScheduler.
JobTypeCore = "_core"
2015-07-03 23:57:48 +00:00
JobTypeService = "service"
JobTypeBatch = "batch"
2015-10-14 23:43:06 +00:00
JobTypeSystem = "system"
2015-07-03 23:57:48 +00:00
)
const (
2016-01-08 04:08:14 +00:00
JobStatusPending = "pending" // Pending means the job is waiting on scheduling
JobStatusRunning = "running" // Running means the job has non-terminal allocations
JobStatusDead = "dead" // Dead means all evaluation's and allocations are terminal
2015-07-03 23:57:48 +00:00
)
2015-08-06 18:48:44 +00:00
const (
// JobMinPriority is the minimum allowed priority
JobMinPriority = 1
// JobDefaultPriority is the default priority if not
// not specified.
JobDefaultPriority = 50
// JobMaxPriority is the maximum allowed priority
JobMaxPriority = 100
2015-08-15 22:15:00 +00:00
// Ensure CoreJobPriority is higher than any user
// specified job so that it gets priority. This is important
// for the system to remain healthy.
CoreJobPriority = JobMaxPriority * 2
2017-04-13 20:54:57 +00:00
2017-04-13 21:54:22 +00:00
// JobTrackedVersions is the number of historic job versions that are
2017-04-13 20:54:57 +00:00
// kept.
2017-04-13 21:54:22 +00:00
JobTrackedVersions = 6
2015-08-06 18:48:44 +00:00
)
2015-07-03 23:57:48 +00:00
// Job is the scope of a scheduling request to Nomad. It is the largest
// scoped object, and is a named collection of task groups. Each task group
// is further composed of tasks. A task group (TG) is the unit of scheduling
// however.
type Job struct {
2017-04-15 03:54:30 +00:00
// Stop marks whether the user has stopped the job. A stopped job will
// have all created allocations stopped and acts as a way to stop a job
// without purging it from the system. This allows existing allocs to be
// queried and the job to be inspected as it is being killed.
Stop bool
2015-09-15 17:46:10 +00:00
// Region is the Nomad region that handles scheduling this job
Region string
// ID is a unique identifier for the job per region. It can be
// specified hierarchically like LineOfBiz/OrgName/Team/Project
2015-07-23 22:15:48 +00:00
ID string
2015-12-18 20:26:28 +00:00
// ParentID is the unique identifier of the job that spawned this job.
ParentID string
2015-07-03 23:57:48 +00:00
// Name is the logical name of the job used to refer to it. This is unique
// per region, but not unique globally.
Name string
// Type is used to control various behaviors about the job. Most jobs
// are service jobs, meaning they are expected to be long lived.
// Some jobs are batch oriented meaning they run and then terminate.
// This can be extended in the future to support custom schedulers.
Type string
// Priority is used to control scheduling importance and if this job
// can preempt other jobs.
Priority int
// AllAtOnce is used to control if incremental scheduling of task groups
// is allowed or if we must do a gang scheduling of the entire job. This
// can slow down larger jobs if resources are not available.
2017-02-22 20:30:05 +00:00
AllAtOnce bool
2015-07-03 23:57:48 +00:00
2015-08-13 21:02:39 +00:00
// Datacenters contains all the datacenters this job is allowed to span
Datacenters [ ] string
2015-07-03 23:57:48 +00:00
// Constraints can be specified at a job level and apply to
// all the task groups and tasks.
Constraints [ ] * Constraint
// TaskGroups are the collections of task groups that this job needs
// to run. Each task group is an atomic unit of scheduling and placement.
TaskGroups [ ] * TaskGroup
2015-09-07 22:08:50 +00:00
// Update is used to control the update strategy
Update UpdateStrategy
2015-12-01 00:51:56 +00:00
// Periodic is used to define the interval the job is run at.
2015-12-01 16:40:32 +00:00
Periodic * PeriodicConfig
2015-12-01 00:51:56 +00:00
2017-01-20 18:33:52 +00:00
// ParameterizedJob is used to specify the job as a parameterized job
// for dispatching.
ParameterizedJob * ParameterizedJobConfig
2016-11-23 22:56:50 +00:00
2016-12-14 20:50:08 +00:00
// Payload is the payload supplied when the job was dispatched.
Payload [ ] byte
2016-11-26 02:04:55 +00:00
2015-07-03 23:57:48 +00:00
// Meta is used to associate arbitrary metadata with this
// job. This is opaque to Nomad.
Meta map [ string ] string
2016-08-10 18:51:19 +00:00
// VaultToken is the Vault token that proves the submitter of the job has
// access to the specified Vault policies. This field is only used to
// transfer the token and is not stored after Job submission.
2017-02-22 20:30:05 +00:00
VaultToken string
2016-08-10 18:51:19 +00:00
2015-07-03 23:57:48 +00:00
// Job status
Status string
2015-07-04 00:50:54 +00:00
2015-08-15 20:08:06 +00:00
// StatusDescription is meant to provide more human useful information
StatusDescription string
2017-04-13 20:54:57 +00:00
// Stable marks a job as stable. Stability is only defined on "service" and
// "system" jobs. The stability of a job will be set automatically as part
// of a deployment and can be manually set via APIs.
Stable bool
// Version is a monitonically increasing version number that is incremened
// on each job register.
Version uint64
2015-07-04 00:50:54 +00:00
// Raft Indexes
2016-01-12 17:50:33 +00:00
CreateIndex uint64
ModifyIndex uint64
JobModifyIndex uint64
2015-07-03 23:57:48 +00:00
}
2016-07-20 23:07:15 +00:00
// Canonicalize is used to canonicalize fields in the Job. This should be called
2015-12-15 03:20:57 +00:00
// when registering a Job.
2016-07-20 23:07:15 +00:00
func ( j * Job ) Canonicalize ( ) {
2016-07-18 23:17:38 +00:00
// Ensure that an empty and nil map are treated the same to avoid scheduling
// problems since we use reflect DeepEquals.
if len ( j . Meta ) == 0 {
j . Meta = nil
}
2015-12-18 20:17:13 +00:00
for _ , tg := range j . TaskGroups {
2016-07-20 23:07:15 +00:00
tg . Canonicalize ( j )
2015-12-18 20:17:13 +00:00
}
2016-11-23 22:56:50 +00:00
2017-01-20 18:33:52 +00:00
if j . ParameterizedJob != nil {
j . ParameterizedJob . Canonicalize ( )
2016-11-23 22:56:50 +00:00
}
2017-02-15 22:37:06 +00:00
if j . Periodic != nil {
j . Periodic . Canonicalize ( )
}
2015-12-15 03:20:57 +00:00
}
2015-12-18 20:26:28 +00:00
// Copy returns a deep copy of the Job. It is expected that callers use recover.
// This job can panic if the deep copy failed as it uses reflection.
func ( j * Job ) Copy ( ) * Job {
2016-02-11 01:54:43 +00:00
if j == nil {
return nil
}
nj := new ( Job )
* nj = * j
2017-01-18 23:55:14 +00:00
nj . Datacenters = helper . CopySliceString ( nj . Datacenters )
2016-02-11 17:08:20 +00:00
nj . Constraints = CopySliceConstraints ( nj . Constraints )
2015-12-18 20:26:28 +00:00
2016-03-21 23:29:21 +00:00
if j . TaskGroups != nil {
tgs := make ( [ ] * TaskGroup , len ( nj . TaskGroups ) )
for i , tg := range nj . TaskGroups {
tgs [ i ] = tg . Copy ( )
}
nj . TaskGroups = tgs
2016-02-11 01:54:43 +00:00
}
nj . Periodic = nj . Periodic . Copy ( )
2017-01-18 23:55:14 +00:00
nj . Meta = helper . CopyMapStringString ( nj . Meta )
2017-01-20 18:33:52 +00:00
nj . ParameterizedJob = nj . ParameterizedJob . Copy ( )
2016-02-11 01:54:43 +00:00
return nj
2015-12-18 20:26:28 +00:00
}
2015-09-15 17:46:10 +00:00
// Validate is used to sanity check a job input
func ( j * Job ) Validate ( ) error {
var mErr multierror . Error
2017-02-06 19:48:28 +00:00
2015-09-15 17:46:10 +00:00
if j . Region == "" {
mErr . Errors = append ( mErr . Errors , errors . New ( "Missing job region" ) )
}
if j . ID == "" {
mErr . Errors = append ( mErr . Errors , errors . New ( "Missing job ID" ) )
2015-09-16 00:38:23 +00:00
} else if strings . Contains ( j . ID , " " ) {
mErr . Errors = append ( mErr . Errors , errors . New ( "Job ID contains a space" ) )
2015-09-15 17:46:10 +00:00
}
if j . Name == "" {
mErr . Errors = append ( mErr . Errors , errors . New ( "Missing job name" ) )
}
if j . Type == "" {
mErr . Errors = append ( mErr . Errors , errors . New ( "Missing job type" ) )
}
if j . Priority < JobMinPriority || j . Priority > JobMaxPriority {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "Job priority must be between [%d, %d]" , JobMinPriority , JobMaxPriority ) )
}
if len ( j . Datacenters ) == 0 {
2015-09-25 19:27:31 +00:00
mErr . Errors = append ( mErr . Errors , errors . New ( "Missing job datacenters" ) )
2015-09-15 17:46:10 +00:00
}
if len ( j . TaskGroups ) == 0 {
mErr . Errors = append ( mErr . Errors , errors . New ( "Missing job task groups" ) )
}
2015-10-11 19:50:16 +00:00
for idx , constr := range j . Constraints {
if err := constr . Validate ( ) ; err != nil {
outer := fmt . Errorf ( "Constraint %d validation failed: %s" , idx + 1 , err )
mErr . Errors = append ( mErr . Errors , outer )
}
}
2015-09-15 17:46:10 +00:00
// Check for duplicate task groups
taskGroups := make ( map [ string ] int )
for idx , tg := range j . TaskGroups {
if tg . Name == "" {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "Job task group %d missing name" , idx + 1 ) )
} else if existing , ok := taskGroups [ tg . Name ] ; ok {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "Job task group %d redefines '%s' from group %d" , idx + 1 , tg . Name , existing + 1 ) )
} else {
taskGroups [ tg . Name ] = idx
}
2015-10-16 21:15:01 +00:00
2016-07-13 19:50:08 +00:00
if j . Type == "system" && tg . Count > 1 {
2015-10-16 21:15:01 +00:00
mErr . Errors = append ( mErr . Errors ,
2016-07-20 13:23:35 +00:00
fmt . Errorf ( "Job task group %s has count %d. Count cannot exceed 1 with system scheduler" ,
tg . Name , tg . Count ) )
2015-10-16 21:15:01 +00:00
}
2015-09-15 18:23:03 +00:00
}
2015-09-15 17:46:10 +00:00
2015-09-15 18:23:03 +00:00
// Validate the task group
2016-07-20 13:23:35 +00:00
for _ , tg := range j . TaskGroups {
2015-09-15 17:46:10 +00:00
if err := tg . Validate ( ) ; err != nil {
2017-03-03 23:00:39 +00:00
outer := fmt . Errorf ( "Task group %s validation failed: %v" , tg . Name , err )
2015-09-21 00:08:57 +00:00
mErr . Errors = append ( mErr . Errors , outer )
2015-09-15 17:46:10 +00:00
}
}
2015-12-01 00:51:56 +00:00
// Validate periodic is only used with batch jobs.
2016-07-13 19:50:08 +00:00
if j . IsPeriodic ( ) && j . Periodic . Enabled {
2015-12-04 23:10:08 +00:00
if j . Type != JobTypeBatch {
mErr . Errors = append ( mErr . Errors ,
fmt . Errorf ( "Periodic can only be used with %q scheduler" , JobTypeBatch ) )
}
if err := j . Periodic . Validate ( ) ; err != nil {
mErr . Errors = append ( mErr . Errors , err )
}
2015-12-01 00:51:56 +00:00
}
2017-01-20 18:33:52 +00:00
if j . IsParameterized ( ) {
2016-12-16 23:20:12 +00:00
if j . Type != JobTypeBatch {
mErr . Errors = append ( mErr . Errors ,
2017-01-20 18:33:52 +00:00
fmt . Errorf ( "Parameterized job can only be used with %q scheduler" , JobTypeBatch ) )
2016-12-16 23:20:12 +00:00
}
2017-01-20 18:33:52 +00:00
if err := j . ParameterizedJob . Validate ( ) ; err != nil {
2016-11-23 22:56:50 +00:00
mErr . Errors = append ( mErr . Errors , err )
}
}
2015-09-15 17:46:10 +00:00
return mErr . ErrorOrNil ( )
}
2015-08-23 23:49:48 +00:00
// LookupTaskGroup finds a task group by name
2015-08-30 02:14:47 +00:00
func ( j * Job ) LookupTaskGroup ( name string ) * TaskGroup {
2015-08-23 23:49:48 +00:00
for _ , tg := range j . TaskGroups {
if tg . Name == name {
return tg
}
}
return nil
}
2016-12-16 01:08:38 +00:00
// CombinedTaskMeta takes a TaskGroup and Task name and returns the combined
// meta data for the task. When joining Job, Group and Task Meta, the precedence
// is by deepest scope (Task > Group > Job).
func ( j * Job ) CombinedTaskMeta ( groupName , taskName string ) map [ string ] string {
group := j . LookupTaskGroup ( groupName )
if group == nil {
return nil
}
task := group . LookupTask ( taskName )
if task == nil {
return nil
}
2017-01-18 23:55:14 +00:00
meta := helper . CopyMapStringString ( task . Meta )
2016-12-16 01:08:38 +00:00
if meta == nil {
meta = make ( map [ string ] string , len ( group . Meta ) + len ( j . Meta ) )
}
// Add the group specific meta
for k , v := range group . Meta {
if _ , ok := meta [ k ] ; ! ok {
meta [ k ] = v
}
}
// Add the job specific meta
for k , v := range j . Meta {
if _ , ok := meta [ k ] ; ! ok {
meta [ k ] = v
}
}
return meta
}
2015-09-06 22:34:28 +00:00
// Stub is used to return a summary of the job
2016-07-21 20:21:47 +00:00
func ( j * Job ) Stub ( summary * JobSummary ) * JobListStub {
2015-09-06 22:34:28 +00:00
return & JobListStub {
ID : j . ID ,
2016-01-07 22:43:55 +00:00
ParentID : j . ParentID ,
2015-09-06 22:34:28 +00:00
Name : j . Name ,
Type : j . Type ,
Priority : j . Priority ,
2017-04-16 00:05:52 +00:00
Periodic : j . IsPeriodic ( ) ,
ParameterizedJob : j . IsParameterized ( ) ,
2017-04-15 03:54:30 +00:00
Stop : j . Stop ,
2015-09-06 22:34:28 +00:00
Status : j . Status ,
StatusDescription : j . StatusDescription ,
CreateIndex : j . CreateIndex ,
ModifyIndex : j . ModifyIndex ,
2016-06-08 23:48:02 +00:00
JobModifyIndex : j . JobModifyIndex ,
2016-07-21 20:21:47 +00:00
JobSummary : summary ,
2015-09-06 22:34:28 +00:00
}
}
2015-12-01 16:40:32 +00:00
// IsPeriodic returns whether a job is periodic.
func ( j * Job ) IsPeriodic ( ) bool {
return j . Periodic != nil
}
2017-01-20 18:33:52 +00:00
// IsParameterized returns whether a job is parameterized job.
func ( j * Job ) IsParameterized ( ) bool {
return j . ParameterizedJob != nil
2016-11-23 22:56:50 +00:00
}
2016-08-17 00:50:14 +00:00
// VaultPolicies returns the set of Vault policies per task group, per task
2016-08-18 17:50:47 +00:00
func ( j * Job ) VaultPolicies ( ) map [ string ] map [ string ] * Vault {
policies := make ( map [ string ] map [ string ] * Vault , len ( j . TaskGroups ) )
2016-08-17 00:50:14 +00:00
for _ , tg := range j . TaskGroups {
2016-08-18 17:50:47 +00:00
tgPolicies := make ( map [ string ] * Vault , len ( tg . Tasks ) )
2016-08-17 00:50:14 +00:00
for _ , task := range tg . Tasks {
if task . Vault == nil {
continue
}
2016-08-18 17:50:47 +00:00
tgPolicies [ task . Name ] = task . Vault
2016-08-17 00:50:14 +00:00
}
2016-09-21 18:14:09 +00:00
if len ( tgPolicies ) != 0 {
policies [ tg . Name ] = tgPolicies
}
2016-08-17 00:50:14 +00:00
}
return policies
}
2016-10-20 20:55:35 +00:00
// RequiredSignals returns a mapping of task groups to tasks to their required
// set of signals
func ( j * Job ) RequiredSignals ( ) map [ string ] map [ string ] [ ] string {
signals := make ( map [ string ] map [ string ] [ ] string )
for _ , tg := range j . TaskGroups {
for _ , task := range tg . Tasks {
// Use this local one as a set
taskSignals := make ( map [ string ] struct { } )
// Check if the Vault change mode uses signals
if task . Vault != nil && task . Vault . ChangeMode == VaultChangeModeSignal {
taskSignals [ task . Vault . ChangeSignal ] = struct { } { }
}
// Check if any template change mode uses signals
for _ , t := range task . Templates {
if t . ChangeMode != TemplateChangeModeSignal {
continue
}
taskSignals [ t . ChangeSignal ] = struct { } { }
}
// Flatten and sort the signals
l := len ( taskSignals )
if l == 0 {
continue
}
flat := make ( [ ] string , 0 , l )
for sig := range taskSignals {
flat = append ( flat , sig )
}
sort . Strings ( flat )
tgSignals , ok := signals [ tg . Name ]
if ! ok {
tgSignals = make ( map [ string ] [ ] string )
signals [ tg . Name ] = tgSignals
}
tgSignals [ task . Name ] = flat
}
}
return signals
}
2015-09-06 22:34:28 +00:00
// JobListStub is used to return a subset of job information
// for the job list
type JobListStub struct {
ID string
2016-01-07 22:43:55 +00:00
ParentID string
2015-09-06 22:34:28 +00:00
Name string
Type string
Priority int
2017-04-16 00:05:52 +00:00
Periodic bool
ParameterizedJob bool
2017-04-15 03:54:30 +00:00
Stop bool
2015-09-06 22:34:28 +00:00
Status string
StatusDescription string
2016-07-21 20:34:19 +00:00
JobSummary * JobSummary
2015-09-06 22:34:28 +00:00
CreateIndex uint64
ModifyIndex uint64
2016-06-08 23:48:02 +00:00
JobModifyIndex uint64
2015-09-06 22:34:28 +00:00
}
2016-12-06 01:24:37 +00:00
// JobSummary summarizes the state of the allocations of a job
type JobSummary struct {
JobID string
// Summmary contains the summary per task group for the Job
Summary map [ string ] TaskGroupSummary
2016-12-15 00:58:54 +00:00
// Children contains a summary for the children of this job.
2016-12-06 01:24:37 +00:00
Children * JobChildrenSummary
// Raft Indexes
CreateIndex uint64
ModifyIndex uint64
}
// Copy returns a new copy of JobSummary
func ( js * JobSummary ) Copy ( ) * JobSummary {
newJobSummary := new ( JobSummary )
* newJobSummary = * js
newTGSummary := make ( map [ string ] TaskGroupSummary , len ( js . Summary ) )
for k , v := range js . Summary {
newTGSummary [ k ] = v
}
newJobSummary . Summary = newTGSummary
newJobSummary . Children = newJobSummary . Children . Copy ( )
return newJobSummary
}
// JobChildrenSummary contains the summary of children job statuses
type JobChildrenSummary struct {
2016-12-07 00:58:44 +00:00
Pending int64
Running int64
Dead int64
2016-12-06 01:24:37 +00:00
}
// Copy returns a new copy of a JobChildrenSummary
func ( jc * JobChildrenSummary ) Copy ( ) * JobChildrenSummary {
if jc == nil {
return nil
}
njc := new ( JobChildrenSummary )
* njc = * jc
return njc
}
// TaskGroup summarizes the state of all the allocations of a particular
// TaskGroup
type TaskGroupSummary struct {
Queued int
Complete int
Failed int
Running int
Starting int
Lost int
}
2015-09-07 22:08:50 +00:00
// UpdateStrategy is used to modify how updates are done
type UpdateStrategy struct {
// Stagger is the amount of time between the updates
Stagger time . Duration
// MaxParallel is how many updates can be done in parallel
2017-02-22 20:30:05 +00:00
MaxParallel int
2015-09-07 22:08:50 +00:00
}
// Rolling returns if a rolling strategy should be used
func ( u * UpdateStrategy ) Rolling ( ) bool {
return u . Stagger > 0 && u . MaxParallel > 0
}
2015-12-01 00:51:56 +00:00
const (
// PeriodicSpecCron is used for a cron spec.
PeriodicSpecCron = "cron"
2015-12-18 20:26:28 +00:00
// PeriodicSpecTest is only used by unit tests. It is a sorted, comma
2016-05-15 16:41:34 +00:00
// separated list of unix timestamps at which to launch.
2015-12-16 21:46:09 +00:00
PeriodicSpecTest = "_internal_test"
2015-12-01 00:51:56 +00:00
)
// Periodic defines the interval a job should be run at.
type PeriodicConfig struct {
// Enabled determines if the job should be run periodically.
Enabled bool
// Spec specifies the interval the job should be run as. It is parsed based
// on the SpecType.
Spec string
// SpecType defines the format of the spec.
SpecType string
2016-01-07 19:19:46 +00:00
// ProhibitOverlap enforces that spawned jobs do not run in parallel.
2017-02-22 20:30:05 +00:00
ProhibitOverlap bool
2017-02-15 22:37:06 +00:00
// TimeZone is the user specified string that determines the time zone to
// launch against. The time zones must be specified from IANA Time Zone
// database, such as "America/New_York".
// Reference: https://en.wikipedia.org/wiki/List_of_tz_database_time_zones
// Reference: https://www.iana.org/time-zones
2017-02-22 20:30:05 +00:00
TimeZone string
2017-02-15 22:37:06 +00:00
// location is the time zone to evaluate the launch time against
location * time . Location
2015-12-01 00:51:56 +00:00
}
2016-02-11 01:54:43 +00:00
func ( p * PeriodicConfig ) Copy ( ) * PeriodicConfig {
if p == nil {
return nil
}
np := new ( PeriodicConfig )
* np = * p
return np
}
2015-12-01 00:51:56 +00:00
func ( p * PeriodicConfig ) Validate ( ) error {
if ! p . Enabled {
return nil
}
2017-02-15 22:37:06 +00:00
var mErr multierror . Error
2015-12-01 00:56:44 +00:00
if p . Spec == "" {
2017-02-15 22:37:06 +00:00
multierror . Append ( & mErr , fmt . Errorf ( "Must specify a spec" ) )
}
// Check if we got a valid time zone
if p . TimeZone != "" {
if _ , err := time . LoadLocation ( p . TimeZone ) ; err != nil {
multierror . Append ( & mErr , fmt . Errorf ( "Invalid time zone %q: %v" , p . TimeZone , err ) )
}
2015-12-01 00:51:56 +00:00
}
switch p . SpecType {
case PeriodicSpecCron :
// Validate the cron spec
if _ , err := cronexpr . Parse ( p . Spec ) ; err != nil {
2017-02-15 22:37:06 +00:00
multierror . Append ( & mErr , fmt . Errorf ( "Invalid cron spec %q: %v" , p . Spec , err ) )
2015-12-01 00:51:56 +00:00
}
2015-12-18 20:26:28 +00:00
case PeriodicSpecTest :
// No-op
2015-12-01 00:51:56 +00:00
default :
2017-02-15 22:37:06 +00:00
multierror . Append ( & mErr , fmt . Errorf ( "Unknown periodic specification type %q" , p . SpecType ) )
2015-12-01 00:51:56 +00:00
}
2017-02-15 22:37:06 +00:00
return mErr . ErrorOrNil ( )
}
func ( p * PeriodicConfig ) Canonicalize ( ) {
// Load the location
l , err := time . LoadLocation ( p . TimeZone )
if err != nil {
2017-02-17 19:21:49 +00:00
p . location = time . UTC
2017-02-15 22:37:06 +00:00
}
p . location = l
2015-12-01 00:51:56 +00:00
}
// Next returns the closest time instant matching the spec that is after the
// passed time. If no matching instance exists, the zero value of time.Time is
// returned. The `time.Location` of the returned value matches that of the
// passed time.
func ( p * PeriodicConfig ) Next ( fromTime time . Time ) time . Time {
switch p . SpecType {
case PeriodicSpecCron :
if e , err := cronexpr . Parse ( p . Spec ) ; err == nil {
return e . Next ( fromTime )
}
2015-12-18 20:26:28 +00:00
case PeriodicSpecTest :
split := strings . Split ( p . Spec , "," )
if len ( split ) == 1 && split [ 0 ] == "" {
return time . Time { }
}
// Parse the times
times := make ( [ ] time . Time , len ( split ) )
for i , s := range split {
unix , err := strconv . Atoi ( s )
if err != nil {
return time . Time { }
}
2015-12-21 21:55:26 +00:00
times [ i ] = time . Unix ( int64 ( unix ) , 0 )
2015-12-18 20:26:28 +00:00
}
// Find the next match
for _ , next := range times {
if fromTime . Before ( next ) {
return next
}
}
2015-12-01 00:51:56 +00:00
}
return time . Time { }
}
2017-02-15 22:37:06 +00:00
// GetLocation returns the location to use for determining the time zone to run
// the periodic job against.
func ( p * PeriodicConfig ) GetLocation ( ) * time . Location {
// Jobs pre 0.5.5 will not have this
if p . location != nil {
return p . location
}
return time . UTC
}
2016-01-07 22:24:25 +00:00
const (
// PeriodicLaunchSuffix is the string appended to the periodic jobs ID
// when launching derived instances of it.
PeriodicLaunchSuffix = "/periodic-"
)
2015-12-19 01:51:30 +00:00
// PeriodicLaunch tracks the last launch time of a periodic job.
type PeriodicLaunch struct {
ID string // ID of the periodic job.
Launch time . Time // The last launch time.
2015-12-16 21:46:09 +00:00
// Raft Indexes
CreateIndex uint64
ModifyIndex uint64
2015-12-19 01:51:30 +00:00
}
2016-11-23 22:56:50 +00:00
const (
2016-12-14 20:50:08 +00:00
DispatchPayloadForbidden = "forbidden"
DispatchPayloadOptional = "optional"
DispatchPayloadRequired = "required"
2016-11-26 02:04:55 +00:00
2017-01-20 18:33:52 +00:00
// DispatchLaunchSuffix is the string appended to the parameterized job's ID
2016-12-14 20:50:08 +00:00
// when dispatching instances of it.
2017-01-20 18:33:52 +00:00
DispatchLaunchSuffix = "/dispatch-"
2016-11-23 22:56:50 +00:00
)
2017-01-20 18:33:52 +00:00
// ParameterizedJobConfig is used to configure the parameterized job
type ParameterizedJobConfig struct {
2016-12-14 20:50:08 +00:00
// Payload configure the payload requirements
Payload string
2016-11-23 22:56:50 +00:00
// MetaRequired is metadata keys that must be specified by the dispatcher
2017-02-22 20:30:05 +00:00
MetaRequired [ ] string
2016-11-23 22:56:50 +00:00
// MetaOptional is metadata keys that may be specified by the dispatcher
2017-02-22 20:30:05 +00:00
MetaOptional [ ] string
2016-11-23 22:56:50 +00:00
}
2017-01-20 18:33:52 +00:00
func ( d * ParameterizedJobConfig ) Validate ( ) error {
2016-11-23 22:56:50 +00:00
var mErr multierror . Error
2016-12-14 20:50:08 +00:00
switch d . Payload {
case DispatchPayloadOptional , DispatchPayloadRequired , DispatchPayloadForbidden :
2016-11-23 22:56:50 +00:00
default :
2016-12-14 20:50:08 +00:00
multierror . Append ( & mErr , fmt . Errorf ( "Unknown payload requirement: %q" , d . Payload ) )
2016-11-23 22:56:50 +00:00
}
// Check that the meta configurations are disjoint sets
2017-01-18 23:55:14 +00:00
disjoint , offending := helper . SliceSetDisjoint ( d . MetaRequired , d . MetaOptional )
2016-11-23 22:56:50 +00:00
if ! disjoint {
multierror . Append ( & mErr , fmt . Errorf ( "Required and optional meta keys should be disjoint. Following keys exist in both: %v" , offending ) )
}
return mErr . ErrorOrNil ( )
}
2017-01-20 18:33:52 +00:00
func ( d * ParameterizedJobConfig ) Canonicalize ( ) {
2016-12-14 20:50:08 +00:00
if d . Payload == "" {
d . Payload = DispatchPayloadOptional
2016-11-23 22:56:50 +00:00
}
}
2017-01-20 18:33:52 +00:00
func ( d * ParameterizedJobConfig ) Copy ( ) * ParameterizedJobConfig {
2016-11-23 22:56:50 +00:00
if d == nil {
return nil
}
2017-01-20 18:33:52 +00:00
nd := new ( ParameterizedJobConfig )
2016-11-23 22:56:50 +00:00
* nd = * d
2017-01-18 23:55:14 +00:00
nd . MetaOptional = helper . CopySliceString ( nd . MetaOptional )
nd . MetaRequired = helper . CopySliceString ( nd . MetaRequired )
2016-11-23 22:56:50 +00:00
return nd
}
2016-11-26 02:04:55 +00:00
// DispatchedID returns an ID appropriate for a job dispatched against a
2017-01-20 18:33:52 +00:00
// particular parameterized job
2016-11-26 04:02:18 +00:00
func DispatchedID ( templateID string , t time . Time ) string {
u := GenerateUUID ( ) [ : 8 ]
2017-01-20 18:33:52 +00:00
return fmt . Sprintf ( "%s%s%d-%s" , templateID , DispatchLaunchSuffix , t . Unix ( ) , u )
2016-11-26 02:04:55 +00:00
}
2017-01-26 05:06:16 +00:00
// DispatchPayloadConfig configures how a task gets its input from a job dispatch
type DispatchPayloadConfig struct {
2016-11-23 22:56:50 +00:00
// File specifies a relative path to where the input data should be written
File string
}
2017-01-26 05:06:16 +00:00
func ( d * DispatchPayloadConfig ) Copy ( ) * DispatchPayloadConfig {
2016-11-23 22:56:50 +00:00
if d == nil {
return nil
}
2017-01-26 05:06:16 +00:00
nd := new ( DispatchPayloadConfig )
2016-11-23 22:56:50 +00:00
* nd = * d
return nd
}
2017-01-26 05:06:16 +00:00
func ( d * DispatchPayloadConfig ) Validate ( ) error {
2016-12-18 23:48:30 +00:00
// Verify the destination doesn't escape
escaped , err := PathEscapesAllocDir ( "task/local/" , d . File )
if err != nil {
return fmt . Errorf ( "invalid destination path: %v" , err )
} else if escaped {
return fmt . Errorf ( "destination escapes allocation directory" )
}
return nil
}
2015-12-18 20:17:13 +00:00
var (
defaultServiceJobRestartPolicy = RestartPolicy {
2016-02-02 23:08:07 +00:00
Delay : 15 * time . Second ,
Attempts : 2 ,
Interval : 1 * time . Minute ,
Mode : RestartPolicyModeDelay ,
2015-12-18 20:17:13 +00:00
}
defaultBatchJobRestartPolicy = RestartPolicy {
2016-02-02 23:08:07 +00:00
Delay : 15 * time . Second ,
Attempts : 15 ,
Interval : 7 * 24 * time . Hour ,
Mode : RestartPolicyModeDelay ,
2015-12-18 20:17:13 +00:00
}
)
const (
// RestartPolicyModeDelay causes an artificial delay till the next interval is
// reached when the specified attempts have been reached in the interval.
RestartPolicyModeDelay = "delay"
// RestartPolicyModeFail causes a job to fail if the specified number of
// attempts are reached within an interval.
RestartPolicyModeFail = "fail"
2017-02-13 23:27:36 +00:00
// RestartPolicyMinInterval is the minimum interval that is accepted for a
// restart policy.
RestartPolicyMinInterval = 5 * time . Second
2015-12-18 20:17:13 +00:00
)
// RestartPolicy configures how Tasks are restarted when they crash or fail.
2015-10-30 22:51:39 +00:00
type RestartPolicy struct {
2015-12-18 20:17:13 +00:00
// Attempts is the number of restart that will occur in an interval.
2015-10-30 22:51:39 +00:00
Attempts int
2015-12-18 20:17:13 +00:00
// Interval is a duration in which we can limit the number of restarts
// within.
2015-10-30 22:51:39 +00:00
Interval time . Duration
2015-12-18 20:17:13 +00:00
// Delay is the time between a failure and a restart.
Delay time . Duration
// Mode controls what happens when the task restarts more than attempt times
// in an interval.
Mode string
2015-10-30 22:51:39 +00:00
}
2016-02-11 01:54:43 +00:00
func ( r * RestartPolicy ) Copy ( ) * RestartPolicy {
if r == nil {
return nil
}
nrp := new ( RestartPolicy )
* nrp = * r
return nrp
}
2015-10-30 22:51:39 +00:00
func ( r * RestartPolicy ) Validate ( ) error {
2017-02-13 23:27:36 +00:00
var mErr multierror . Error
2015-12-18 20:17:13 +00:00
switch r . Mode {
case RestartPolicyModeDelay , RestartPolicyModeFail :
default :
2017-02-13 23:27:36 +00:00
multierror . Append ( & mErr , fmt . Errorf ( "Unsupported restart mode: %q" , r . Mode ) )
2015-12-18 20:17:13 +00:00
}
2016-02-02 22:32:30 +00:00
// Check for ambiguous/confusing settings
if r . Attempts == 0 && r . Mode != RestartPolicyModeFail {
2017-02-13 23:27:36 +00:00
multierror . Append ( & mErr , fmt . Errorf ( "Restart policy %q with %d attempts is ambiguous" , r . Mode , r . Attempts ) )
2016-02-02 22:32:30 +00:00
}
2017-02-13 23:27:36 +00:00
if r . Interval . Nanoseconds ( ) < RestartPolicyMinInterval . Nanoseconds ( ) {
multierror . Append ( & mErr , fmt . Errorf ( "Interval can not be less than %v (got %v)" , RestartPolicyMinInterval , r . Interval ) )
2015-11-17 07:56:11 +00:00
}
2015-10-30 22:51:39 +00:00
if time . Duration ( r . Attempts ) * r . Delay > r . Interval {
2017-02-13 23:27:36 +00:00
multierror . Append ( & mErr ,
fmt . Errorf ( "Nomad can't restart the TaskGroup %v times in an interval of %v with a delay of %v" , r . Attempts , r . Interval , r . Delay ) )
2015-10-30 22:51:39 +00:00
}
2017-02-13 23:27:36 +00:00
return mErr . ErrorOrNil ( )
2015-10-30 22:51:39 +00:00
}
func NewRestartPolicy ( jobType string ) * RestartPolicy {
2015-11-02 21:35:51 +00:00
switch jobType {
2015-11-06 20:38:25 +00:00
case JobTypeService , JobTypeSystem :
2015-11-03 01:00:17 +00:00
rp := defaultServiceJobRestartPolicy
return & rp
2015-11-02 21:35:51 +00:00
case JobTypeBatch :
2015-11-03 21:54:29 +00:00
rp := defaultBatchJobRestartPolicy
2015-11-03 01:00:17 +00:00
return & rp
2015-10-30 22:51:39 +00:00
}
2015-11-03 01:00:17 +00:00
return nil
2015-10-30 22:51:39 +00:00
}
2015-07-03 23:57:48 +00:00
// TaskGroup is an atomic unit of placement. Each task group belongs to
// a job and may contain any number of tasks. A task group support running
// in many replicas using the same configuration..
type TaskGroup struct {
// Name of the task group
Name string
// Count is the number of replicas of this task group that should
// be scheduled.
Count int
// Constraints can be specified at a task group level and apply to
// all the tasks contained.
Constraints [ ] * Constraint
2015-10-30 22:51:39 +00:00
//RestartPolicy of a TaskGroup
RestartPolicy * RestartPolicy
2015-07-03 23:57:48 +00:00
// Tasks are the collection of tasks that this task group needs to run
Tasks [ ] * Task
2016-09-14 22:43:42 +00:00
// EphemeralDisk is the disk resources that the task group requests
EphemeralDisk * EphemeralDisk
2016-08-24 18:51:15 +00:00
2015-07-03 23:57:48 +00:00
// Meta is used to associate arbitrary metadata with this
// task group. This is opaque to Nomad.
Meta map [ string ] string
}
2016-02-04 05:22:18 +00:00
func ( tg * TaskGroup ) Copy ( ) * TaskGroup {
2016-02-11 01:54:43 +00:00
if tg == nil {
return nil
}
ntg := new ( TaskGroup )
* ntg = * tg
2016-02-11 17:08:20 +00:00
ntg . Constraints = CopySliceConstraints ( ntg . Constraints )
2016-02-11 01:54:43 +00:00
ntg . RestartPolicy = ntg . RestartPolicy . Copy ( )
2016-03-21 23:29:21 +00:00
if tg . Tasks != nil {
tasks := make ( [ ] * Task , len ( ntg . Tasks ) )
for i , t := range ntg . Tasks {
tasks [ i ] = t . Copy ( )
}
ntg . Tasks = tasks
2016-02-04 05:22:18 +00:00
}
2017-01-18 23:55:14 +00:00
ntg . Meta = helper . CopyMapStringString ( ntg . Meta )
2016-08-26 19:24:47 +00:00
2016-09-14 22:43:42 +00:00
if tg . EphemeralDisk != nil {
ntg . EphemeralDisk = tg . EphemeralDisk . Copy ( )
2016-08-26 19:24:47 +00:00
}
2016-02-11 01:54:43 +00:00
return ntg
2016-02-04 05:22:18 +00:00
}
2016-07-20 23:07:15 +00:00
// Canonicalize is used to canonicalize fields in the TaskGroup.
func ( tg * TaskGroup ) Canonicalize ( job * Job ) {
2016-07-18 23:17:38 +00:00
// Ensure that an empty and nil map are treated the same to avoid scheduling
// problems since we use reflect DeepEquals.
if len ( tg . Meta ) == 0 {
tg . Meta = nil
}
2015-12-18 20:17:13 +00:00
// Set the default restart policy.
if tg . RestartPolicy == nil {
tg . RestartPolicy = NewRestartPolicy ( job . Type )
}
2016-11-02 22:07:22 +00:00
// Set a default ephemeral disk object if the user has not requested for one
if tg . EphemeralDisk == nil {
tg . EphemeralDisk = DefaultEphemeralDisk ( )
}
2015-11-27 03:26:00 +00:00
for _ , task := range tg . Tasks {
2016-07-20 23:07:15 +00:00
task . Canonicalize ( job , tg )
2015-11-27 03:26:00 +00:00
}
2016-11-08 23:24:51 +00:00
// Add up the disk resources to EphemeralDisk. This is done so that users
// are not required to move their disk attribute from resources to
// EphemeralDisk section of the job spec in Nomad 0.5
// COMPAT 0.4.1 -> 0.5
// Remove in 0.6
var diskMB int
for _ , task := range tg . Tasks {
diskMB += task . Resources . DiskMB
}
if diskMB > 0 {
tg . EphemeralDisk . SizeMB = diskMB
}
2015-11-27 03:26:00 +00:00
}
2015-09-15 17:46:10 +00:00
// Validate is used to sanity check a task group
func ( tg * TaskGroup ) Validate ( ) error {
var mErr multierror . Error
if tg . Name == "" {
mErr . Errors = append ( mErr . Errors , errors . New ( "Missing task group name" ) )
}
2016-03-17 18:02:59 +00:00
if tg . Count < 0 {
mErr . Errors = append ( mErr . Errors , errors . New ( "Task group count can't be negative" ) )
2015-09-15 17:46:10 +00:00
}
if len ( tg . Tasks ) == 0 {
mErr . Errors = append ( mErr . Errors , errors . New ( "Missing tasks for task group" ) )
}
2015-10-11 19:50:16 +00:00
for idx , constr := range tg . Constraints {
if err := constr . Validate ( ) ; err != nil {
outer := fmt . Errorf ( "Constraint %d validation failed: %s" , idx + 1 , err )
mErr . Errors = append ( mErr . Errors , outer )
}
}
2015-09-15 17:46:10 +00:00
2015-11-11 23:10:39 +00:00
if tg . RestartPolicy != nil {
if err := tg . RestartPolicy . Validate ( ) ; err != nil {
mErr . Errors = append ( mErr . Errors , err )
}
} else {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "Task Group %v should have a restart policy" , tg . Name ) )
2015-10-30 22:51:39 +00:00
}
2016-09-14 22:43:42 +00:00
if tg . EphemeralDisk != nil {
if err := tg . EphemeralDisk . Validate ( ) ; err != nil {
2016-08-24 18:51:15 +00:00
mErr . Errors = append ( mErr . Errors , err )
}
} else {
2016-09-28 00:57:05 +00:00
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "Task Group %v should have an ephemeral disk object" , tg . Name ) )
2016-08-24 18:51:15 +00:00
}
2017-02-11 00:57:47 +00:00
// Check for duplicate tasks and that there is only leader task if any
2015-09-15 17:46:10 +00:00
tasks := make ( map [ string ] int )
2017-02-11 00:57:47 +00:00
leaderTasks := 0
2015-09-15 17:46:10 +00:00
for idx , task := range tg . Tasks {
if task . Name == "" {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "Task %d missing name" , idx + 1 ) )
} else if existing , ok := tasks [ task . Name ] ; ok {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "Task %d redefines '%s' from task %d" , idx + 1 , task . Name , existing + 1 ) )
} else {
tasks [ task . Name ] = idx
}
2017-02-11 00:57:47 +00:00
if task . Leader {
leaderTasks ++
}
}
if leaderTasks > 1 {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "Only one task may be marked as leader" ) )
2015-09-15 18:23:03 +00:00
}
2015-09-15 17:46:10 +00:00
2015-09-15 18:23:03 +00:00
// Validate the tasks
2016-07-20 13:23:35 +00:00
for _ , task := range tg . Tasks {
2016-09-14 22:43:42 +00:00
if err := task . Validate ( tg . EphemeralDisk ) ; err != nil {
2017-03-03 23:00:39 +00:00
outer := fmt . Errorf ( "Task %s validation failed: %v" , task . Name , err )
2015-09-21 00:08:57 +00:00
mErr . Errors = append ( mErr . Errors , outer )
2015-09-15 17:46:10 +00:00
}
}
return mErr . ErrorOrNil ( )
}
2015-09-07 19:23:34 +00:00
// LookupTask finds a task by name
func ( tg * TaskGroup ) LookupTask ( name string ) * Task {
for _ , t := range tg . Tasks {
if t . Name == name {
return t
}
}
return nil
}
2015-09-15 00:43:42 +00:00
func ( tg * TaskGroup ) GoString ( ) string {
return fmt . Sprintf ( "*%#v" , * tg )
}
2015-11-17 21:36:59 +00:00
const (
2016-06-14 01:55:15 +00:00
// TODO add Consul TTL check
2015-11-17 21:36:59 +00:00
ServiceCheckHTTP = "http"
ServiceCheckTCP = "tcp"
ServiceCheckScript = "script"
2016-06-14 01:19:40 +00:00
// minCheckInterval is the minimum check interval permitted. Consul
// currently has its MinInterval set to 1s. Mirror that here for
// consistency.
minCheckInterval = 1 * time . Second
// minCheckTimeout is the minimum check timeout permitted for Consul
// script TTL checks.
minCheckTimeout = 1 * time . Second
2015-11-17 21:36:59 +00:00
)
2015-11-17 07:20:35 +00:00
// The ServiceCheck data model represents the consul health check that
// Nomad registers for a Task
type ServiceCheck struct {
2016-08-16 19:05:15 +00:00
Name string // Name of the check, defaults to id
Type string // Type of the check - tcp, http, docker and script
Command string // Command is the command to run for script checks
Args [ ] string // Args is a list of argumes for script checks
Path string // path of the health check url for http type check
Protocol string // Protocol to use if check is http, defaults to http
2017-02-22 20:30:05 +00:00
PortLabel string // The port to use for tcp/http checks
2016-08-16 19:05:15 +00:00
Interval time . Duration // Interval of the check
Timeout time . Duration // Timeout of the response from the check before consul fails the check
2017-02-22 20:30:05 +00:00
InitialStatus string // Initial status of the check
2015-11-17 07:20:35 +00:00
}
2016-02-11 01:54:43 +00:00
func ( sc * ServiceCheck ) Copy ( ) * ServiceCheck {
if sc == nil {
return nil
}
nsc := new ( ServiceCheck )
* nsc = * sc
return nsc
}
2016-07-20 23:07:15 +00:00
func ( sc * ServiceCheck ) Canonicalize ( serviceName string ) {
2016-07-18 23:17:38 +00:00
// Ensure empty slices are treated as null to avoid scheduling issues when
// using DeepEquals.
if len ( sc . Args ) == 0 {
sc . Args = nil
}
if sc . Name == "" {
sc . Name = fmt . Sprintf ( "service: %q check" , serviceName )
}
}
2016-06-14 01:17:43 +00:00
// validate a Service's ServiceCheck
func ( sc * ServiceCheck ) validate ( ) error {
2016-06-14 01:19:40 +00:00
switch strings . ToLower ( sc . Type ) {
case ServiceCheckTCP :
2016-11-01 23:02:16 +00:00
if sc . Timeout == 0 {
2016-11-01 23:05:34 +00:00
return fmt . Errorf ( "missing required value timeout. Timeout cannot be less than %v" , minCheckInterval )
2016-11-01 23:02:16 +00:00
} else if sc . Timeout < minCheckTimeout {
2016-07-09 05:33:04 +00:00
return fmt . Errorf ( "timeout (%v) is lower than required minimum timeout %v" , sc . Timeout , minCheckInterval )
2016-06-14 01:55:15 +00:00
}
2016-06-14 01:19:40 +00:00
case ServiceCheckHTTP :
if sc . Path == "" {
return fmt . Errorf ( "http type must have a valid http path" )
}
2016-06-14 01:55:15 +00:00
2016-11-01 23:02:16 +00:00
if sc . Timeout == 0 {
2016-11-01 23:05:34 +00:00
return fmt . Errorf ( "missing required value timeout. Timeout cannot be less than %v" , minCheckInterval )
2016-11-01 23:02:16 +00:00
} else if sc . Timeout < minCheckTimeout {
2016-07-09 05:33:04 +00:00
return fmt . Errorf ( "timeout (%v) is lower than required minimum timeout %v" , sc . Timeout , minCheckInterval )
2016-06-14 01:55:15 +00:00
}
2016-06-14 01:19:40 +00:00
case ServiceCheckScript :
if sc . Command == "" {
return fmt . Errorf ( "script type must have a valid script path" )
}
2016-06-14 01:55:15 +00:00
// TODO: enforce timeout on the Client side and reenable
// validation.
2016-06-14 01:19:40 +00:00
default :
return fmt . Errorf ( ` invalid type (%+q), must be one of "http", "tcp", or "script" type ` , sc . Type )
2016-01-08 02:03:44 +00:00
}
2016-11-01 23:02:16 +00:00
if sc . Interval == 0 {
2016-11-01 23:05:34 +00:00
return fmt . Errorf ( "missing required value interval. Interval cannot be less than %v" , minCheckInterval )
2016-11-01 23:02:16 +00:00
} else if sc . Interval < minCheckInterval {
2016-11-01 23:05:34 +00:00
return fmt . Errorf ( "interval (%v) cannot be lower than %v" , sc . Interval , minCheckInterval )
2015-11-17 22:25:23 +00:00
}
2016-06-14 01:28:27 +00:00
2016-08-16 19:05:15 +00:00
switch sc . InitialStatus {
case "" :
2016-10-06 17:22:03 +00:00
// case api.HealthUnknown: TODO: Add when Consul releases 0.7.1
2016-08-16 19:05:15 +00:00
case api . HealthPassing :
case api . HealthWarning :
case api . HealthCritical :
default :
2017-02-28 00:00:19 +00:00
return fmt . Errorf ( ` invalid initial check state (%s), must be one of %q, %q, %q or empty ` , sc . InitialStatus , api . HealthPassing , api . HealthWarning , api . HealthCritical )
2016-08-16 19:05:15 +00:00
}
2015-11-17 21:36:59 +00:00
return nil
}
2016-04-19 02:38:47 +00:00
// RequiresPort returns whether the service check requires the task has a port.
func ( sc * ServiceCheck ) RequiresPort ( ) bool {
switch sc . Type {
case ServiceCheckHTTP , ServiceCheckTCP :
return true
default :
return false
}
}
2015-12-14 23:57:56 +00:00
func ( sc * ServiceCheck ) Hash ( serviceID string ) string {
2015-11-21 20:34:01 +00:00
h := sha1 . New ( )
2015-12-14 23:57:56 +00:00
io . WriteString ( h , serviceID )
2015-11-21 20:34:01 +00:00
io . WriteString ( h , sc . Name )
io . WriteString ( h , sc . Type )
2016-03-28 21:05:12 +00:00
io . WriteString ( h , sc . Command )
2016-03-24 17:06:40 +00:00
io . WriteString ( h , strings . Join ( sc . Args , "" ) )
2015-11-21 20:34:01 +00:00
io . WriteString ( h , sc . Path )
io . WriteString ( h , sc . Protocol )
2016-07-08 21:09:27 +00:00
io . WriteString ( h , sc . PortLabel )
2015-11-21 20:34:01 +00:00
io . WriteString ( h , sc . Interval . String ( ) )
io . WriteString ( h , sc . Timeout . String ( ) )
return fmt . Sprintf ( "%x" , h . Sum ( nil ) )
}
2016-06-12 23:36:49 +00:00
// Service represents a Consul service definition in Nomad
type Service struct {
2016-06-10 03:00:32 +00:00
// Name of the service registered with Consul. Consul defaults the
// Name to ServiceID if not specified. The Name if specified is used
// as one of the seed values when generating a Consul ServiceID.
Name string
// PortLabel is either the numeric port number or the `host:port`.
// To specify the port number using the host's Consul Advertise
// address, specify an empty host in the PortLabel (e.g. `:port`).
2017-02-22 20:30:05 +00:00
PortLabel string
2016-06-10 03:00:32 +00:00
Tags [ ] string // List of tags for the service
2015-11-26 01:44:57 +00:00
Checks [ ] * ServiceCheck // List of checks associated with the service
2015-11-17 07:20:35 +00:00
}
2016-06-12 23:36:49 +00:00
func ( s * Service ) Copy ( ) * Service {
2016-02-11 01:54:43 +00:00
if s == nil {
return nil
}
2016-06-12 23:36:49 +00:00
ns := new ( Service )
2016-02-11 01:54:43 +00:00
* ns = * s
2017-01-18 23:55:14 +00:00
ns . Tags = helper . CopySliceString ( ns . Tags )
2016-02-11 01:54:43 +00:00
2016-03-21 23:29:21 +00:00
if s . Checks != nil {
checks := make ( [ ] * ServiceCheck , len ( ns . Checks ) )
2016-02-11 17:08:20 +00:00
for i , c := range ns . Checks {
checks [ i ] = c . Copy ( )
}
2016-03-21 23:29:21 +00:00
ns . Checks = checks
2016-02-11 01:54:43 +00:00
}
2016-03-21 23:29:21 +00:00
2016-02-11 01:54:43 +00:00
return ns
}
2016-07-20 23:07:15 +00:00
// Canonicalize interpolates values of Job, Task Group and Task in the Service
2015-12-11 00:04:04 +00:00
// Name. This also generates check names, service id and check ids.
2016-07-20 23:07:15 +00:00
func ( s * Service ) Canonicalize ( job string , taskGroup string , task string ) {
2016-07-18 23:17:38 +00:00
// Ensure empty lists are treated as null to avoid scheduler issues when
// using DeepEquals
if len ( s . Tags ) == 0 {
s . Tags = nil
}
if len ( s . Checks ) == 0 {
s . Checks = nil
}
2015-12-11 00:04:04 +00:00
s . Name = args . ReplaceEnv ( s . Name , map [ string ] string {
"JOB" : job ,
"TASKGROUP" : taskGroup ,
"TASK" : task ,
"BASE" : fmt . Sprintf ( "%s-%s-%s" , job , taskGroup , task ) ,
} ,
)
for _ , check := range s . Checks {
2016-07-20 23:07:15 +00:00
check . Canonicalize ( s . Name )
2015-12-11 00:04:04 +00:00
}
}
// Validate checks if the Check definition is valid
2016-06-12 23:36:49 +00:00
func ( s * Service ) Validate ( ) error {
2015-11-17 21:36:59 +00:00
var mErr multierror . Error
2016-02-05 22:42:35 +00:00
2016-10-24 19:13:47 +00:00
// Ensure the service name is valid per the below RFCs but make an exception
// for our interpolation syntax
// RFC-952 §1 (https://tools.ietf.org/html/rfc952), RFC-1123 §2.1
2016-03-15 00:44:59 +00:00
// (https://tools.ietf.org/html/rfc1123), and RFC-2782
// (https://tools.ietf.org/html/rfc2782).
2016-10-24 19:13:47 +00:00
re := regexp . MustCompile ( ` ^(?i:[a-z0-9]|[a-z0-9\$][a-zA-Z0-9\-\$\ { \}\_\.]*[a-z0-9\}])$ ` )
2016-03-15 00:44:59 +00:00
if ! re . MatchString ( s . Name ) {
2016-10-24 19:13:47 +00:00
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "service name must be valid per RFC 1123 and can contain only alphanumeric characters or dashes: %q" , s . Name ) )
2016-02-05 22:42:35 +00:00
}
2015-11-17 21:36:59 +00:00
for _ , c := range s . Checks {
2016-04-19 02:38:47 +00:00
if s . PortLabel == "" && c . RequiresPort ( ) {
2016-07-20 11:41:24 +00:00
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "check %s invalid: check requires a port but the service %+q has no port" , c . Name , s . Name ) )
2016-04-15 08:50:55 +00:00
continue
}
2016-06-14 01:19:40 +00:00
2016-06-14 01:17:43 +00:00
if err := c . validate ( ) ; err != nil {
2016-06-14 01:19:40 +00:00
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "check %s invalid: %v" , c . Name , err ) )
2015-11-17 21:36:59 +00:00
}
}
return mErr . ErrorOrNil ( )
}
2016-10-24 19:13:47 +00:00
// ValidateName checks if the services Name is valid and should be called after
// the name has been interpolated
func ( s * Service ) ValidateName ( name string ) error {
// Ensure the service name is valid per RFC-952 §1
// (https://tools.ietf.org/html/rfc952), RFC-1123 §2.1
// (https://tools.ietf.org/html/rfc1123), and RFC-2782
// (https://tools.ietf.org/html/rfc2782).
re := regexp . MustCompile ( ` ^(?i:[a-z0-9]|[a-z0-9][a-z0-9\-] { 0,61}[a-z0-9])$ ` )
if ! re . MatchString ( name ) {
2017-03-08 14:10:30 +00:00
return fmt . Errorf ( "service name must be valid per RFC 1123 and can contain only alphanumeric characters or dashes and must be no longer than 63 characters: %q" , name )
2016-10-24 19:13:47 +00:00
}
return nil
}
2015-12-11 00:04:04 +00:00
// Hash calculates the hash of the check based on it's content and the service
// which owns it
2016-06-12 23:36:49 +00:00
func ( s * Service ) Hash ( ) string {
2015-11-23 07:27:59 +00:00
h := sha1 . New ( )
io . WriteString ( h , s . Name )
io . WriteString ( h , strings . Join ( s . Tags , "" ) )
io . WriteString ( h , s . PortLabel )
return fmt . Sprintf ( "%x" , h . Sum ( nil ) )
}
2015-12-23 00:10:30 +00:00
const (
// DefaultKillTimeout is the default timeout between signaling a task it
// will be killed and killing it.
DefaultKillTimeout = 5 * time . Second
)
2016-02-05 07:28:01 +00:00
// LogConfig provides configuration for log rotation
type LogConfig struct {
2017-02-22 20:30:05 +00:00
MaxFiles int
MaxFileSizeMB int
2016-02-05 07:28:01 +00:00
}
2016-07-19 06:37:54 +00:00
// DefaultLogConfig returns the default LogConfig values.
2016-02-11 00:44:31 +00:00
func DefaultLogConfig ( ) * LogConfig {
return & LogConfig {
MaxFiles : 10 ,
MaxFileSizeMB : 10 ,
}
}
2016-02-11 22:44:35 +00:00
// Validate returns an error if the log config specified are less than
2016-02-05 07:28:01 +00:00
// the minimum allowed.
2016-02-11 22:44:35 +00:00
func ( l * LogConfig ) Validate ( ) error {
2016-02-05 07:28:01 +00:00
var mErr multierror . Error
2016-02-11 22:44:35 +00:00
if l . MaxFiles < 1 {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "minimum number of files is 1; got %d" , l . MaxFiles ) )
2016-02-05 07:28:01 +00:00
}
2016-02-11 22:44:35 +00:00
if l . MaxFileSizeMB < 1 {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "minimum file size is 1MB; got %d" , l . MaxFileSizeMB ) )
2016-02-05 07:28:01 +00:00
}
return mErr . ErrorOrNil ( )
}
2015-07-03 23:57:48 +00:00
// Task is a single process typically that is executed as part of a task group.
type Task struct {
// Name of the task
Name string
// Driver is used to control which driver is used
Driver string
2016-03-23 11:57:31 +00:00
// User is used to determine which user will run the task. It defaults to
// the same user the Nomad client is being run as.
User string
2015-07-03 23:57:48 +00:00
// Config is provided to the driver to initialize
2015-11-14 02:09:42 +00:00
Config map [ string ] interface { }
2015-07-03 23:57:48 +00:00
2015-09-30 16:18:43 +00:00
// Map of environment variables to be used by the driver
Env map [ string ] string
2015-11-17 07:20:35 +00:00
// List of service definitions exposed by the Task
2016-06-12 23:36:49 +00:00
Services [ ] * Service
2015-11-17 06:37:09 +00:00
2016-08-09 22:23:44 +00:00
// Vault is used to define the set of Vault policies that this task should
// have access to.
Vault * Vault
2016-09-23 22:39:52 +00:00
// Templates are the set of templates to be rendered for the task.
Templates [ ] * Template
2015-07-03 23:57:48 +00:00
// Constraints can be specified at a task level and apply only to
// the particular task.
Constraints [ ] * Constraint
// Resources is the resources needed by this task
Resources * Resources
2017-01-26 05:06:16 +00:00
// DispatchPayload configures how the task retrieves its input from a dispatch
DispatchPayload * DispatchPayloadConfig
2016-11-23 22:56:50 +00:00
2015-07-03 23:57:48 +00:00
// Meta is used to associate arbitrary metadata with this
// task. This is opaque to Nomad.
Meta map [ string ] string
2015-12-23 00:10:30 +00:00
// KillTimeout is the time between signaling a task that it will be
// killed and killing it.
2017-02-22 20:30:05 +00:00
KillTimeout time . Duration
2016-02-05 07:28:01 +00:00
// LogConfig provides configuration for log rotation
2017-02-22 20:30:05 +00:00
LogConfig * LogConfig
2016-03-14 05:29:07 +00:00
// Artifacts is a list of artifacts to download and extract before running
// the task.
2016-03-14 18:13:43 +00:00
Artifacts [ ] * TaskArtifact
2017-02-11 00:57:47 +00:00
// Leader marks the task as the leader within the group. When the leader
// task exits, other tasks will be gracefully terminated.
Leader bool
2016-03-14 18:13:43 +00:00
}
2016-02-10 21:44:53 +00:00
func ( t * Task ) Copy ( ) * Task {
2016-02-11 01:54:43 +00:00
if t == nil {
2016-02-10 21:44:53 +00:00
return nil
}
2016-02-11 01:54:43 +00:00
nt := new ( Task )
* nt = * t
2017-01-18 23:55:14 +00:00
nt . Env = helper . CopyMapStringString ( nt . Env )
2016-02-11 01:54:43 +00:00
2016-06-12 23:36:49 +00:00
if t . Services != nil {
services := make ( [ ] * Service , len ( nt . Services ) )
for i , s := range nt . Services {
2016-03-21 23:29:21 +00:00
services [ i ] = s . Copy ( )
}
2016-06-12 23:36:49 +00:00
nt . Services = services
2016-02-11 01:54:43 +00:00
}
2016-03-21 23:29:21 +00:00
2016-02-11 17:08:20 +00:00
nt . Constraints = CopySliceConstraints ( nt . Constraints )
2016-02-11 01:54:43 +00:00
2016-08-09 22:23:44 +00:00
nt . Vault = nt . Vault . Copy ( )
2016-02-11 01:54:43 +00:00
nt . Resources = nt . Resources . Copy ( )
2017-01-18 23:55:14 +00:00
nt . Meta = helper . CopyMapStringString ( nt . Meta )
2017-01-26 05:06:16 +00:00
nt . DispatchPayload = nt . DispatchPayload . Copy ( )
2016-02-11 01:54:43 +00:00
2016-03-21 23:29:21 +00:00
if t . Artifacts != nil {
2016-03-22 00:23:04 +00:00
artifacts := make ( [ ] * TaskArtifact , 0 , len ( t . Artifacts ) )
2016-03-21 23:29:21 +00:00
for _ , a := range nt . Artifacts {
artifacts = append ( artifacts , a . Copy ( ) )
}
nt . Artifacts = artifacts
2016-03-14 22:46:06 +00:00
}
2016-02-11 01:54:43 +00:00
if i , err := copystructure . Copy ( nt . Config ) ; err != nil {
nt . Config = i . ( map [ string ] interface { } )
}
2016-09-23 22:39:52 +00:00
if t . Templates != nil {
templates := make ( [ ] * Template , len ( t . Templates ) )
for i , tmpl := range nt . Templates {
templates [ i ] = tmpl . Copy ( )
}
nt . Templates = templates
}
2016-02-11 01:54:43 +00:00
return nt
2016-02-10 21:44:53 +00:00
}
2016-07-20 23:07:15 +00:00
// Canonicalize canonicalizes fields in the task.
func ( t * Task ) Canonicalize ( job * Job , tg * TaskGroup ) {
2016-07-18 23:17:38 +00:00
// Ensure that an empty and nil map are treated the same to avoid scheduling
// problems since we use reflect DeepEquals.
if len ( t . Meta ) == 0 {
t . Meta = nil
}
if len ( t . Config ) == 0 {
t . Config = nil
}
if len ( t . Env ) == 0 {
t . Env = nil
}
2016-07-20 23:07:15 +00:00
for _ , service := range t . Services {
service . Canonicalize ( job . Name , tg . Name , t . Name )
}
2016-10-26 20:21:09 +00:00
// If Resources are nil initialize them to defaults, otherwise canonicalize
2016-10-26 17:36:41 +00:00
if t . Resources == nil {
t . Resources = DefaultResources ( )
} else {
2016-07-20 23:43:20 +00:00
t . Resources . Canonicalize ( )
}
2015-12-23 00:10:30 +00:00
// Set the default timeout if it is not specified.
if t . KillTimeout == 0 {
t . KillTimeout = DefaultKillTimeout
}
2016-10-25 18:09:22 +00:00
if t . Vault != nil {
t . Vault . Canonicalize ( )
}
for _ , template := range t . Templates {
template . Canonicalize ( )
}
2015-12-18 20:17:13 +00:00
}
2015-09-15 00:43:42 +00:00
func ( t * Task ) GoString ( ) string {
return fmt . Sprintf ( "*%#v" , * t )
}
2015-11-25 02:39:38 +00:00
func ( t * Task ) FindHostAndPortFor ( portLabel string ) ( string , int ) {
for _ , network := range t . Resources . Networks {
if p , ok := network . MapLabelToValues ( nil ) [ portLabel ] ; ok {
return network . IP , p
}
}
return "" , 0
}
2016-03-16 03:21:52 +00:00
// Validate is used to sanity check a task
2016-09-14 22:43:42 +00:00
func ( t * Task ) Validate ( ephemeralDisk * EphemeralDisk ) error {
2016-03-14 22:46:06 +00:00
var mErr multierror . Error
if t . Name == "" {
mErr . Errors = append ( mErr . Errors , errors . New ( "Missing task name" ) )
}
2016-05-28 00:17:10 +00:00
if strings . ContainsAny ( t . Name , ` /\ ` ) {
2016-05-28 00:43:20 +00:00
// We enforce this so that when creating the directory on disk it will
// not have any slashes.
2016-11-01 23:05:34 +00:00
mErr . Errors = append ( mErr . Errors , errors . New ( "Task name cannot include slashes" ) )
2016-05-28 00:17:10 +00:00
}
2016-03-14 22:46:06 +00:00
if t . Driver == "" {
mErr . Errors = append ( mErr . Errors , errors . New ( "Missing task driver" ) )
}
if t . KillTimeout . Nanoseconds ( ) < 0 {
mErr . Errors = append ( mErr . Errors , errors . New ( "KillTimeout must be a positive value" ) )
}
// Validate the resources.
if t . Resources == nil {
mErr . Errors = append ( mErr . Errors , errors . New ( "Missing task resources" ) )
2016-10-26 17:36:41 +00:00
} else {
if err := t . Resources . MeetsMinResources ( ) ; err != nil {
mErr . Errors = append ( mErr . Errors , err )
}
2016-03-14 22:46:06 +00:00
2016-10-26 17:36:41 +00:00
// Ensure the task isn't asking for disk resources
2016-08-25 18:53:09 +00:00
if t . Resources . DiskMB > 0 {
mErr . Errors = append ( mErr . Errors , errors . New ( "Task can't ask for disk resources, they have to be specified at the task group level." ) )
}
}
2016-03-14 22:46:06 +00:00
// Validate the log config
if t . LogConfig == nil {
mErr . Errors = append ( mErr . Errors , errors . New ( "Missing Log Config" ) )
} else if err := t . LogConfig . Validate ( ) ; err != nil {
mErr . Errors = append ( mErr . Errors , err )
}
for idx , constr := range t . Constraints {
if err := constr . Validate ( ) ; err != nil {
outer := fmt . Errorf ( "Constraint %d validation failed: %s" , idx + 1 , err )
mErr . Errors = append ( mErr . Errors , outer )
}
2017-03-12 00:23:24 +00:00
switch constr . Operand {
case ConstraintDistinctHosts , ConstraintDistinctProperty :
outer := fmt . Errorf ( "Constraint %d has disallowed Operand at task level: %s" , idx + 1 , constr . Operand )
mErr . Errors = append ( mErr . Errors , outer )
}
2016-03-14 22:46:06 +00:00
}
2016-04-19 02:38:47 +00:00
// Validate Services
if err := validateServices ( t ) ; err != nil {
mErr . Errors = append ( mErr . Errors , err )
2016-03-14 22:46:06 +00:00
}
2016-09-14 22:43:42 +00:00
if t . LogConfig != nil && ephemeralDisk != nil {
2016-03-14 22:46:06 +00:00
logUsage := ( t . LogConfig . MaxFiles * t . LogConfig . MaxFileSizeMB )
2016-09-14 22:43:42 +00:00
if ephemeralDisk . SizeMB <= logUsage {
2016-03-14 22:46:06 +00:00
mErr . Errors = append ( mErr . Errors ,
2016-03-22 17:27:14 +00:00
fmt . Errorf ( "log storage (%d MB) must be less than requested disk capacity (%d MB)" ,
2016-09-14 22:43:42 +00:00
logUsage , ephemeralDisk . SizeMB ) )
2016-03-14 22:46:06 +00:00
}
}
for idx , artifact := range t . Artifacts {
if err := artifact . Validate ( ) ; err != nil {
outer := fmt . Errorf ( "Artifact %d validation failed: %v" , idx + 1 , err )
mErr . Errors = append ( mErr . Errors , outer )
}
}
2016-08-09 22:23:44 +00:00
if t . Vault != nil {
if err := t . Vault . Validate ( ) ; err != nil {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "Vault validation failed: %v" , err ) )
}
}
2016-10-10 22:19:00 +00:00
destinations := make ( map [ string ] int , len ( t . Templates ) )
2016-09-23 22:39:52 +00:00
for idx , tmpl := range t . Templates {
if err := tmpl . Validate ( ) ; err != nil {
outer := fmt . Errorf ( "Template %d validation failed: %s" , idx + 1 , err )
mErr . Errors = append ( mErr . Errors , outer )
}
2016-10-10 22:19:00 +00:00
if other , ok := destinations [ tmpl . DestPath ] ; ok {
outer := fmt . Errorf ( "Template %d has same destination as %d" , idx + 1 , other )
mErr . Errors = append ( mErr . Errors , outer )
} else {
destinations [ tmpl . DestPath ] = idx + 1
}
2016-09-23 22:39:52 +00:00
}
2017-01-26 05:06:16 +00:00
// Validate the dispatch payload block if there
if t . DispatchPayload != nil {
if err := t . DispatchPayload . Validate ( ) ; err != nil {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "Dispatch Payload validation failed: %v" , err ) )
2016-12-18 23:48:30 +00:00
}
}
2016-03-14 22:46:06 +00:00
return mErr . ErrorOrNil ( )
}
2016-04-19 02:38:47 +00:00
// validateServices takes a task and validates the services within it are valid
// and reference ports that exist.
func validateServices ( t * Task ) error {
var mErr multierror . Error
2016-05-02 20:40:49 +00:00
// Ensure that services don't ask for non-existent ports and their names are
// unique.
2016-04-19 02:38:47 +00:00
servicePorts := make ( map [ string ] [ ] string )
2016-05-02 20:40:49 +00:00
knownServices := make ( map [ string ] struct { } )
2016-06-12 23:36:49 +00:00
for i , service := range t . Services {
2016-04-19 02:38:47 +00:00
if err := service . Validate ( ) ; err != nil {
2016-06-14 01:19:40 +00:00
outer := fmt . Errorf ( "service[%d] %+q validation failed: %s" , i , service . Name , err )
2016-04-19 02:38:47 +00:00
mErr . Errors = append ( mErr . Errors , outer )
}
2017-01-17 20:26:07 +00:00
// Ensure that services with the same name are not being registered for
// the same port
if _ , ok := knownServices [ service . Name + service . PortLabel ] ; ok {
2016-05-02 20:40:49 +00:00
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "service %q is duplicate" , service . Name ) )
}
2017-01-17 20:26:07 +00:00
knownServices [ service . Name + service . PortLabel ] = struct { } { }
2016-04-19 02:38:47 +00:00
if service . PortLabel != "" {
servicePorts [ service . PortLabel ] = append ( servicePorts [ service . PortLabel ] , service . Name )
}
2016-05-03 20:16:02 +00:00
// Ensure that check names are unique.
knownChecks := make ( map [ string ] struct { } )
for _ , check := range service . Checks {
if _ , ok := knownChecks [ check . Name ] ; ok {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "check %q is duplicate" , check . Name ) )
}
knownChecks [ check . Name ] = struct { } { }
}
2016-04-19 02:38:47 +00:00
}
// Get the set of port labels.
portLabels := make ( map [ string ] struct { } )
if t . Resources != nil {
for _ , network := range t . Resources . Networks {
ports := network . MapLabelToValues ( nil )
for portLabel , _ := range ports {
portLabels [ portLabel ] = struct { } { }
}
}
}
// Ensure all ports referenced in services exist.
for servicePort , services := range servicePorts {
_ , ok := portLabels [ servicePort ]
if ! ok {
joined := strings . Join ( services , ", " )
err := fmt . Errorf ( "port label %q referenced by services %v does not exist" , servicePort , joined )
mErr . Errors = append ( mErr . Errors , err )
}
}
return mErr . ErrorOrNil ( )
}
2016-09-23 22:39:52 +00:00
const (
// TemplateChangeModeNoop marks that no action should be taken if the
// template is re-rendered
TemplateChangeModeNoop = "noop"
// TemplateChangeModeSignal marks that the task should be signaled if the
// template is re-rendered
TemplateChangeModeSignal = "signal"
// TemplateChangeModeRestart marks that the task should be restarted if the
// template is re-rendered
TemplateChangeModeRestart = "restart"
)
var (
// TemplateChangeModeInvalidError is the error for when an invalid change
// mode is given
TemplateChangeModeInvalidError = errors . New ( "Invalid change mode. Must be one of the following: noop, signal, restart" )
)
// Template represents a template configuration to be rendered for a given task
type Template struct {
2016-10-11 19:31:40 +00:00
// SourcePath is the path to the template to be rendered
2017-02-22 20:30:05 +00:00
SourcePath string
2016-09-23 22:39:52 +00:00
// DestPath is the path to where the template should be rendered
2017-02-22 20:30:05 +00:00
DestPath string
2016-09-23 22:39:52 +00:00
2016-10-03 19:42:18 +00:00
// EmbeddedTmpl store the raw template. This is useful for smaller templates
2016-10-05 20:41:29 +00:00
// where they are embedded in the job file rather than sent as an artificat
2017-02-22 20:30:05 +00:00
EmbeddedTmpl string
2016-09-23 22:39:52 +00:00
// ChangeMode indicates what should be done if the template is re-rendered
2017-02-22 20:30:05 +00:00
ChangeMode string
2016-09-23 22:39:52 +00:00
2016-10-03 19:42:18 +00:00
// ChangeSignal is the signal that should be sent if the change mode
2016-09-23 22:39:52 +00:00
// requires it.
2017-02-22 20:30:05 +00:00
ChangeSignal string
2016-09-23 22:39:52 +00:00
// Splay is used to avoid coordinated restarts of processes by applying a
// random wait between 0 and the given splay value before signalling the
// application of a change
2017-02-22 20:30:05 +00:00
Splay time . Duration
2017-02-01 04:00:33 +00:00
// Perms is the permission the file should be written out with.
2017-02-22 20:30:05 +00:00
Perms string
2017-02-21 00:43:28 +00:00
// LeftDelim and RightDelim are optional configurations to control what
// delimiter is utilized when parsing the template.
2017-02-22 20:30:05 +00:00
LeftDelim string
RightDelim string
2016-09-23 22:39:52 +00:00
}
2016-09-26 22:23:26 +00:00
// DefaultTemplate returns a default template.
func DefaultTemplate ( ) * Template {
return & Template {
ChangeMode : TemplateChangeModeRestart ,
Splay : 5 * time . Second ,
2017-02-01 04:00:33 +00:00
Perms : "0644" ,
2016-09-26 22:23:26 +00:00
}
}
2016-09-23 22:39:52 +00:00
func ( t * Template ) Copy ( ) * Template {
if t == nil {
return nil
}
copy := new ( Template )
* copy = * t
return copy
}
2016-10-25 18:09:22 +00:00
func ( t * Template ) Canonicalize ( ) {
if t . ChangeSignal != "" {
t . ChangeSignal = strings . ToUpper ( t . ChangeSignal )
}
}
2016-09-23 22:39:52 +00:00
func ( t * Template ) Validate ( ) error {
var mErr multierror . Error
// Verify we have something to render
2016-10-03 19:42:18 +00:00
if t . SourcePath == "" && t . EmbeddedTmpl == "" {
2016-10-05 20:41:29 +00:00
multierror . Append ( & mErr , fmt . Errorf ( "Must specify a source path or have an embedded template" ) )
2016-09-23 22:39:52 +00:00
}
// Verify we can render somewhere
if t . DestPath == "" {
multierror . Append ( & mErr , fmt . Errorf ( "Must specify a destination for the template" ) )
}
// Verify the destination doesn't escape
2016-12-18 23:48:30 +00:00
escaped , err := PathEscapesAllocDir ( "task" , t . DestPath )
2016-09-23 22:39:52 +00:00
if err != nil {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "invalid destination path: %v" , err ) )
} else if escaped {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "destination escapes allocation directory" ) )
}
// Verify a proper change mode
switch t . ChangeMode {
case TemplateChangeModeNoop , TemplateChangeModeRestart :
case TemplateChangeModeSignal :
2016-10-03 19:42:18 +00:00
if t . ChangeSignal == "" {
2016-09-23 22:39:52 +00:00
multierror . Append ( & mErr , fmt . Errorf ( "Must specify signal value when change mode is signal" ) )
}
default :
multierror . Append ( & mErr , TemplateChangeModeInvalidError )
}
// Verify the splay is positive
if t . Splay < 0 {
multierror . Append ( & mErr , fmt . Errorf ( "Must specify positive splay value" ) )
}
2017-02-01 04:00:33 +00:00
// Verify the permissions
if t . Perms != "" {
if _ , err := strconv . ParseUint ( t . Perms , 8 , 12 ) ; err != nil {
multierror . Append ( & mErr , fmt . Errorf ( "Failed to parse %q as octal: %v" , t . Perms , err ) )
}
}
2016-09-23 22:39:52 +00:00
return mErr . ErrorOrNil ( )
}
2015-11-12 23:28:22 +00:00
// Set of possible states for a task.
const (
TaskStatePending = "pending" // The task is waiting to be run.
TaskStateRunning = "running" // The task is currently running.
TaskStateDead = "dead" // Terminal state of task.
)
// TaskState tracks the current state of a task and events that caused state
2016-05-15 16:41:34 +00:00
// transitions.
2015-11-12 23:28:22 +00:00
type TaskState struct {
// The current state of the task.
State string
2016-10-21 00:27:16 +00:00
// Failed marks a task as having failed
Failed bool
2017-03-31 22:57:10 +00:00
// StartedAt is the time the task is started. It is updated each time the
// task starts
StartedAt time . Time
// FinishedAt is the time at which the task transistioned to dead and will
// not be started again.
FinishedAt time . Time
2016-05-15 16:41:34 +00:00
// Series of task events that transition the state of the task.
2015-11-12 23:28:22 +00:00
Events [ ] * TaskEvent
}
2016-02-02 01:47:53 +00:00
func ( ts * TaskState ) Copy ( ) * TaskState {
2016-02-11 01:54:43 +00:00
if ts == nil {
return nil
}
2016-02-02 01:47:53 +00:00
copy := new ( TaskState )
copy . State = ts . State
2016-10-21 00:27:16 +00:00
copy . Failed = ts . Failed
2017-03-31 22:57:10 +00:00
copy . StartedAt = ts . StartedAt
copy . FinishedAt = ts . FinishedAt
2016-03-21 23:29:21 +00:00
if ts . Events != nil {
copy . Events = make ( [ ] * TaskEvent , len ( ts . Events ) )
for i , e := range ts . Events {
copy . Events [ i ] = e . Copy ( )
}
2016-02-02 01:47:53 +00:00
}
return copy
}
2016-05-25 00:23:18 +00:00
// Successful returns whether a task finished successfully.
func ( ts * TaskState ) Successful ( ) bool {
l := len ( ts . Events )
if ts . State != TaskStateDead || l == 0 {
return false
}
e := ts . Events [ l - 1 ]
if e . Type != TaskTerminated {
return false
}
return e . ExitCode == 0
}
2015-11-12 23:28:22 +00:00
const (
2016-10-10 21:49:37 +00:00
// TaskSetupFailure indicates that the task could not be started due to a
// a setup failure.
TaskSetupFailure = "Setup Failure"
2016-03-24 17:55:14 +00:00
// TaskDriveFailure indicates that the task could not be started due to a
2015-11-12 23:28:22 +00:00
// failure in the driver.
2015-11-14 22:13:32 +00:00
TaskDriverFailure = "Driver Failure"
2015-11-12 23:28:22 +00:00
2016-03-24 17:55:14 +00:00
// TaskReceived signals that the task has been pulled by the client at the
2016-02-19 22:49:43 +00:00
// given timestamp.
TaskReceived = "Received"
2016-03-24 17:55:14 +00:00
// TaskFailedValidation indicates the task was invalid and as such was not
// run.
TaskFailedValidation = "Failed Validation"
// TaskStarted signals that the task was started and its timestamp can be
2015-11-12 23:28:22 +00:00
// used to determine the running length of the task.
2015-11-14 22:13:32 +00:00
TaskStarted = "Started"
2015-11-12 23:28:22 +00:00
2016-03-24 17:55:14 +00:00
// TaskTerminated indicates that the task was started and exited.
2015-11-14 22:13:32 +00:00
TaskTerminated = "Terminated"
2015-11-12 23:28:22 +00:00
2016-07-21 22:49:54 +00:00
// TaskKilling indicates a kill signal has been sent to the task.
TaskKilling = "Killing"
2016-03-24 17:55:14 +00:00
// TaskKilled indicates a user has killed the task.
2015-11-14 22:13:32 +00:00
TaskKilled = "Killed"
2016-02-29 00:56:05 +00:00
2016-10-05 22:11:09 +00:00
// TaskRestarting indicates that task terminated and is being restarted.
2016-02-29 00:56:05 +00:00
TaskRestarting = "Restarting"
// TaskNotRestarting indicates that the task has failed and is not being
// restarted because it has exceeded its restart policy.
2016-03-24 22:43:55 +00:00
TaskNotRestarting = "Not Restarting"
2016-03-15 17:53:20 +00:00
2016-10-05 22:11:09 +00:00
// TaskRestartSignal indicates that the task has been signalled to be
// restarted
TaskRestartSignal = "Restart Signaled"
// TaskSignaling indicates that the task is being signalled.
TaskSignaling = "Signaling"
2016-03-24 17:55:14 +00:00
// TaskDownloadingArtifacts means the task is downloading the artifacts
2016-03-15 17:53:20 +00:00
// specified in the task.
TaskDownloadingArtifacts = "Downloading Artifacts"
// TaskArtifactDownloadFailed indicates that downloading the artifacts
// failed.
TaskArtifactDownloadFailed = "Failed Artifact Download"
2016-08-11 07:20:53 +00:00
2017-02-27 19:40:24 +00:00
// TaskBuildingTaskDir indicates that the task directory/chroot is being
2017-02-10 01:40:13 +00:00
// built.
TaskBuildingTaskDir = "Building Task Directory"
// TaskSetup indicates the task runner is setting up the task environment
TaskSetup = "Task Setup"
2016-08-11 07:20:53 +00:00
// TaskDiskExceeded indicates that one of the tasks in a taskgroup has
// exceeded the requested disk resources.
TaskDiskExceeded = "Disk Resources Exceeded"
// TaskSiblingFailed indicates that a sibling task in the task group has
// failed.
2017-02-11 01:55:19 +00:00
TaskSiblingFailed = "Sibling Task Failed"
2016-11-30 00:39:36 +00:00
2016-12-20 19:51:09 +00:00
// TaskDriverMessage is an informational event message emitted by
// drivers such as when they're performing a long running action like
// downloading an image.
TaskDriverMessage = "Driver"
2017-02-11 01:55:19 +00:00
// TaskLeaderDead indicates that the leader task within the has finished.
TaskLeaderDead = "Leader Task Dead"
2015-11-12 23:28:22 +00:00
)
// TaskEvent is an event that effects the state of a task and contains meta-data
// appropriate to the events type.
type TaskEvent struct {
2015-11-14 22:13:32 +00:00
Type string
2015-11-12 23:28:22 +00:00
Time int64 // Unix Nanosecond timestamp
2016-10-21 00:27:16 +00:00
// FailsTask marks whether this event fails the task
FailsTask bool
2016-03-24 22:43:55 +00:00
// Restart fields.
RestartReason string
2016-10-10 21:49:37 +00:00
// Setup Failure fields.
SetupError string
2015-11-12 23:28:22 +00:00
// Driver Failure fields.
2016-05-15 16:41:34 +00:00
DriverError string // A driver error occurred while starting the task.
2015-11-12 23:28:22 +00:00
// Task Terminated Fields.
ExitCode int // The exit code of the task.
Signal int // The signal that terminated the task.
Message string // A possible message explaining the termination of the task.
2015-11-14 06:07:13 +00:00
2016-07-21 22:49:54 +00:00
// Killing fields
KillTimeout time . Duration
2015-11-14 06:07:13 +00:00
// Task Killed Fields.
KillError string // Error killing the task.
2016-02-29 00:56:05 +00:00
2016-10-05 20:41:29 +00:00
// KillReason is the reason the task was killed
KillReason string
2016-02-29 00:56:05 +00:00
// TaskRestarting fields.
StartDelay int64 // The sleep period before restarting the task in unix nanoseconds.
2016-03-15 17:53:20 +00:00
// Artifact Download fields
DownloadError string // Error downloading artifacts
2016-03-24 17:55:14 +00:00
// Validation fields
ValidationError string // Validation error
2016-08-11 07:20:53 +00:00
// The maximum allowed task disk size.
DiskLimit int64
// Name of the sibling task that caused termination of the task that
// the TaskEvent refers to.
FailedSibling string
2016-09-14 20:30:01 +00:00
2016-09-15 01:27:13 +00:00
// VaultError is the error from token renewal
VaultError string
2016-10-05 20:41:29 +00:00
// TaskSignalReason indicates the reason the task is being signalled.
TaskSignalReason string
// TaskSignal is the signal that was sent to the task
TaskSignal string
2016-11-30 00:39:36 +00:00
2016-12-20 19:51:09 +00:00
// DriverMessage indicates a driver action being taken.
DriverMessage string
2016-02-29 00:56:05 +00:00
}
func ( te * TaskEvent ) GoString ( ) string {
return fmt . Sprintf ( "%v at %v" , te . Type , te . Time )
2015-11-14 06:07:13 +00:00
}
2017-02-10 01:40:13 +00:00
// SetMessage sets the message of TaskEvent
func ( te * TaskEvent ) SetMessage ( msg string ) * TaskEvent {
te . Message = msg
return te
}
2016-02-02 01:47:53 +00:00
func ( te * TaskEvent ) Copy ( ) * TaskEvent {
2016-02-11 01:54:43 +00:00
if te == nil {
return nil
}
2016-02-02 01:47:53 +00:00
copy := new ( TaskEvent )
* copy = * te
return copy
}
2015-11-14 22:13:32 +00:00
func NewTaskEvent ( event string ) * TaskEvent {
2015-11-14 06:07:13 +00:00
return & TaskEvent {
Type : event ,
Time : time . Now ( ) . UnixNano ( ) ,
}
}
2016-10-18 18:23:27 +00:00
// SetSetupError is used to store an error that occured while setting up the
// task
2016-10-10 21:49:37 +00:00
func ( e * TaskEvent ) SetSetupError ( err error ) * TaskEvent {
if err != nil {
e . SetupError = err . Error ( )
}
return e
}
2016-10-21 00:27:16 +00:00
func ( e * TaskEvent ) SetFailsTask ( ) * TaskEvent {
e . FailsTask = true
return e
}
2015-11-14 06:07:13 +00:00
func ( e * TaskEvent ) SetDriverError ( err error ) * TaskEvent {
if err != nil {
e . DriverError = err . Error ( )
}
return e
}
func ( e * TaskEvent ) SetExitCode ( c int ) * TaskEvent {
e . ExitCode = c
return e
}
func ( e * TaskEvent ) SetSignal ( s int ) * TaskEvent {
e . Signal = s
return e
}
2015-11-16 22:46:18 +00:00
func ( e * TaskEvent ) SetExitMessage ( err error ) * TaskEvent {
if err != nil {
e . Message = err . Error ( )
}
2015-11-14 06:07:13 +00:00
return e
}
func ( e * TaskEvent ) SetKillError ( err error ) * TaskEvent {
if err != nil {
e . KillError = err . Error ( )
}
return e
2015-11-12 23:28:22 +00:00
}
2016-10-05 20:41:29 +00:00
func ( e * TaskEvent ) SetKillReason ( r string ) * TaskEvent {
e . KillReason = r
return e
}
2016-02-29 00:56:05 +00:00
func ( e * TaskEvent ) SetRestartDelay ( delay time . Duration ) * TaskEvent {
e . StartDelay = int64 ( delay )
return e
}
2016-03-24 22:43:55 +00:00
func ( e * TaskEvent ) SetRestartReason ( reason string ) * TaskEvent {
e . RestartReason = reason
return e
}
2016-10-05 20:41:29 +00:00
func ( e * TaskEvent ) SetTaskSignalReason ( r string ) * TaskEvent {
e . TaskSignalReason = r
return e
}
func ( e * TaskEvent ) SetTaskSignal ( s os . Signal ) * TaskEvent {
e . TaskSignal = s . String ( )
return e
}
2016-03-15 17:53:20 +00:00
func ( e * TaskEvent ) SetDownloadError ( err error ) * TaskEvent {
if err != nil {
e . DownloadError = err . Error ( )
}
return e
}
2016-03-24 17:55:14 +00:00
func ( e * TaskEvent ) SetValidationError ( err error ) * TaskEvent {
if err != nil {
e . ValidationError = err . Error ( )
}
return e
}
2016-07-21 22:49:54 +00:00
func ( e * TaskEvent ) SetKillTimeout ( timeout time . Duration ) * TaskEvent {
e . KillTimeout = timeout
return e
}
2016-08-11 07:20:53 +00:00
func ( e * TaskEvent ) SetDiskLimit ( limit int64 ) * TaskEvent {
e . DiskLimit = limit
return e
}
func ( e * TaskEvent ) SetFailedSibling ( sibling string ) * TaskEvent {
e . FailedSibling = sibling
return e
}
2016-09-14 20:30:01 +00:00
func ( e * TaskEvent ) SetVaultRenewalError ( err error ) * TaskEvent {
if err != nil {
2016-09-15 01:27:13 +00:00
e . VaultError = err . Error ( )
2016-09-14 20:30:01 +00:00
}
return e
}
2016-12-20 19:51:09 +00:00
func ( e * TaskEvent ) SetDriverMessage ( m string ) * TaskEvent {
e . DriverMessage = m
2016-11-30 00:39:36 +00:00
return e
}
2016-03-14 22:46:06 +00:00
// TaskArtifact is an artifact to download before running the task.
type TaskArtifact struct {
// GetterSource is the source to download an artifact using go-getter
2017-02-22 20:30:05 +00:00
GetterSource string
2016-02-02 20:00:26 +00:00
2016-03-14 22:46:06 +00:00
// GetterOptions are options to use when downloading the artifact using
// go-getter.
2017-02-22 20:30:05 +00:00
GetterOptions map [ string ] string
2016-03-18 19:01:46 +00:00
// RelativeDest is the download destination given relative to the task's
// directory.
2017-02-22 20:30:05 +00:00
RelativeDest string
2016-03-14 22:46:06 +00:00
}
2016-02-02 20:00:26 +00:00
2016-03-14 22:46:06 +00:00
func ( ta * TaskArtifact ) Copy ( ) * TaskArtifact {
if ta == nil {
return nil
2016-02-05 07:28:01 +00:00
}
2016-03-14 22:46:06 +00:00
nta := new ( TaskArtifact )
* nta = * ta
2017-01-18 23:55:14 +00:00
nta . GetterOptions = helper . CopyMapStringString ( ta . GetterOptions )
2016-03-14 22:46:06 +00:00
return nta
}
2016-02-05 07:28:01 +00:00
2016-03-18 19:01:46 +00:00
func ( ta * TaskArtifact ) GoString ( ) string {
return fmt . Sprintf ( "%+v" , ta )
}
2016-10-03 21:58:44 +00:00
// PathEscapesAllocDir returns if the given path escapes the allocation
2016-12-18 23:48:30 +00:00
// directory. The prefix allows adding a prefix if the path will be joined, for
// example a "task/local" prefix may be provided if the path will be joined
// against that prefix.
func PathEscapesAllocDir ( prefix , path string ) ( bool , error ) {
2016-03-18 19:01:46 +00:00
// Verify the destination doesn't escape the tasks directory
2016-12-18 23:48:30 +00:00
alloc , err := filepath . Abs ( filepath . Join ( "/" , "alloc-dir/" , "alloc-id/" ) )
2016-03-23 03:54:36 +00:00
if err != nil {
2016-09-23 22:39:52 +00:00
return false , err
2016-03-23 03:54:36 +00:00
}
2016-12-18 23:48:30 +00:00
abs , err := filepath . Abs ( filepath . Join ( alloc , prefix , path ) )
2016-03-15 02:55:30 +00:00
if err != nil {
2016-09-23 22:39:52 +00:00
return false , err
2016-03-18 19:01:46 +00:00
}
rel , err := filepath . Rel ( alloc , abs )
if err != nil {
2016-09-23 22:39:52 +00:00
return false , err
2016-03-18 19:01:46 +00:00
}
2016-09-23 22:39:52 +00:00
return strings . HasPrefix ( rel , ".." ) , nil
}
func ( ta * TaskArtifact ) Validate ( ) error {
// Verify the source
var mErr multierror . Error
if ta . GetterSource == "" {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "source must be specified" ) )
}
2016-12-18 23:48:30 +00:00
escaped , err := PathEscapesAllocDir ( "task" , ta . RelativeDest )
2016-09-23 22:39:52 +00:00
if err != nil {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "invalid destination path: %v" , err ) )
} else if escaped {
2016-12-19 00:32:14 +00:00
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "destination escapes allocation directory" ) )
2016-03-15 02:55:30 +00:00
}
2016-03-14 22:46:06 +00:00
// Verify the checksum
if check , ok := ta . GetterOptions [ "checksum" ] ; ok {
check = strings . TrimSpace ( check )
if check == "" {
2016-11-01 23:05:34 +00:00
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "checksum value cannot be empty" ) )
2016-03-15 22:05:36 +00:00
return mErr . ErrorOrNil ( )
2015-10-11 19:50:16 +00:00
}
2015-11-17 21:36:59 +00:00
2016-03-14 22:46:06 +00:00
parts := strings . Split ( check , ":" )
if l := len ( parts ) ; l != 2 {
2016-03-15 22:05:36 +00:00
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( ` checksum must be given as "type:value"; got %q ` , check ) )
return mErr . ErrorOrNil ( )
2015-11-17 21:36:59 +00:00
}
2016-02-11 20:30:47 +00:00
2016-03-14 22:46:06 +00:00
checksumVal := parts [ 1 ]
checksumBytes , err := hex . DecodeString ( checksumVal )
if err != nil {
2016-03-15 22:05:36 +00:00
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "invalid checksum: %v" , err ) )
return mErr . ErrorOrNil ( )
2016-03-14 22:46:06 +00:00
}
checksumType := parts [ 0 ]
expectedLength := 0
switch checksumType {
case "md5" :
expectedLength = md5 . Size
case "sha1" :
expectedLength = sha1 . Size
case "sha256" :
expectedLength = sha256 . Size
case "sha512" :
expectedLength = sha512 . Size
default :
2016-03-15 22:05:36 +00:00
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "unsupported checksum type: %s" , checksumType ) )
return mErr . ErrorOrNil ( )
2016-03-14 22:46:06 +00:00
}
if len ( checksumBytes ) != expectedLength {
2016-03-15 22:05:36 +00:00
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "invalid %s checksum: %v" , checksumType , checksumVal ) )
return mErr . ErrorOrNil ( )
2016-02-12 06:33:41 +00:00
}
2016-02-11 20:30:47 +00:00
}
2016-03-14 22:46:06 +00:00
2016-03-15 22:05:36 +00:00
return mErr . ErrorOrNil ( )
2015-09-15 17:46:10 +00:00
}
2015-10-26 20:47:56 +00:00
const (
2017-03-07 22:20:02 +00:00
ConstraintDistinctProperty = "distinct_property"
ConstraintDistinctHosts = "distinct_hosts"
ConstraintRegex = "regexp"
ConstraintVersion = "version"
ConstraintSetContains = "set_contains"
2015-10-26 20:47:56 +00:00
)
2015-10-27 21:31:14 +00:00
// Constraints are used to restrict placement options.
2015-07-03 23:57:48 +00:00
type Constraint struct {
LTarget string // Left-hand target
RTarget string // Right-hand target
Operand string // Constraint operand (<=, <, =, !=, >, >=), contains, near
2016-01-26 21:45:03 +00:00
str string // Memoized string
2015-06-07 18:18:59 +00:00
}
2016-09-01 21:23:40 +00:00
// Equal checks if two constraints are equal
func ( c * Constraint ) Equal ( o * Constraint ) bool {
return c . LTarget == o . LTarget &&
c . RTarget == o . RTarget &&
c . Operand == o . Operand
}
2016-02-11 01:54:43 +00:00
func ( c * Constraint ) Copy ( ) * Constraint {
if c == nil {
return nil
}
nc := new ( Constraint )
* nc = * c
return nc
}
2015-08-14 04:46:33 +00:00
func ( c * Constraint ) String ( ) string {
2016-01-26 21:45:03 +00:00
if c . str != "" {
return c . str
}
c . str = fmt . Sprintf ( "%s %s %s" , c . LTarget , c . Operand , c . RTarget )
return c . str
2015-08-14 04:46:33 +00:00
}
2015-10-11 19:50:16 +00:00
func ( c * Constraint ) Validate ( ) error {
var mErr multierror . Error
if c . Operand == "" {
mErr . Errors = append ( mErr . Errors , errors . New ( "Missing constraint operand" ) )
}
// Perform additional validation based on operand
switch c . Operand {
2015-10-26 20:47:56 +00:00
case ConstraintRegex :
2015-10-11 19:50:16 +00:00
if _ , err := regexp . Compile ( c . RTarget ) ; err != nil {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "Regular expression failed to compile: %v" , err ) )
}
2015-10-26 20:47:56 +00:00
case ConstraintVersion :
2015-10-11 19:50:16 +00:00
if _ , err := version . NewConstraint ( c . RTarget ) ; err != nil {
mErr . Errors = append ( mErr . Errors , fmt . Errorf ( "Version constraint is invalid: %v" , err ) )
}
}
return mErr . ErrorOrNil ( )
}
2016-09-14 22:43:42 +00:00
// EphemeralDisk is an ephemeral disk object
type EphemeralDisk struct {
2016-08-25 20:26:28 +00:00
// Sticky indicates whether the allocation is sticky to a node
2016-08-24 18:51:15 +00:00
Sticky bool
2016-08-25 20:26:28 +00:00
2016-09-14 22:43:42 +00:00
// SizeMB is the size of the local disk
2017-02-22 20:30:05 +00:00
SizeMB int
2016-10-03 16:59:57 +00:00
// Migrate determines if Nomad client should migrate the allocation dir for
// sticky allocations
Migrate bool
2016-08-24 18:51:15 +00:00
}
2016-09-14 22:43:42 +00:00
// DefaultEphemeralDisk returns a EphemeralDisk with default configurations
func DefaultEphemeralDisk ( ) * EphemeralDisk {
return & EphemeralDisk {
SizeMB : 300 ,
2016-08-24 18:51:15 +00:00
}
}
2016-09-14 22:43:42 +00:00
// Validate validates EphemeralDisk
func ( d * EphemeralDisk ) Validate ( ) error {
if d . SizeMB < 10 {
return fmt . Errorf ( "minimum DiskMB value is 10; got %d" , d . SizeMB )
2016-08-24 18:51:15 +00:00
}
return nil
}
2016-09-14 22:43:42 +00:00
// Copy copies the EphemeralDisk struct and returns a new one
func ( d * EphemeralDisk ) Copy ( ) * EphemeralDisk {
ld := new ( EphemeralDisk )
2016-08-26 19:24:47 +00:00
* ld = * d
return ld
}
2016-10-11 22:25:49 +00:00
const (
// VaultChangeModeNoop takes no action when a new token is retrieved.
VaultChangeModeNoop = "noop"
// VaultChangeModeSignal signals the task when a new token is retrieved.
VaultChangeModeSignal = "signal"
// VaultChangeModeRestart restarts the task when a new token is retrieved.
VaultChangeModeRestart = "restart"
)
2016-08-09 22:23:44 +00:00
// Vault stores the set of premissions a task needs access to from Vault.
type Vault struct {
// Policies is the set of policies that the task needs access to
Policies [ ] string
2016-09-20 20:22:29 +00:00
// Env marks whether the Vault Token should be exposed as an environment
// variable
Env bool
2016-10-11 22:25:49 +00:00
// ChangeMode is used to configure the task's behavior when the Vault
// token changes because the original token could not be renewed in time.
2017-02-22 20:30:05 +00:00
ChangeMode string
2016-10-11 22:25:49 +00:00
// ChangeSignal is the signal sent to the task when a new token is
// retrieved. This is only valid when using the signal change mode.
2017-02-22 20:30:05 +00:00
ChangeSignal string
2016-08-09 22:23:44 +00:00
}
2016-10-17 18:41:22 +00:00
func DefaultVaultBlock ( ) * Vault {
return & Vault {
Env : true ,
ChangeMode : VaultChangeModeRestart ,
}
}
2016-08-09 22:23:44 +00:00
// Copy returns a copy of this Vault block.
func ( v * Vault ) Copy ( ) * Vault {
if v == nil {
return nil
}
nv := new ( Vault )
* nv = * v
return nv
}
2016-10-25 18:09:22 +00:00
func ( v * Vault ) Canonicalize ( ) {
if v . ChangeSignal != "" {
v . ChangeSignal = strings . ToUpper ( v . ChangeSignal )
}
}
2016-08-09 22:23:44 +00:00
// Validate returns if the Vault block is valid.
func ( v * Vault ) Validate ( ) error {
if v == nil {
return nil
}
2017-02-13 18:51:29 +00:00
var mErr multierror . Error
2016-08-09 22:23:44 +00:00
if len ( v . Policies ) == 0 {
2017-02-13 18:51:29 +00:00
multierror . Append ( & mErr , fmt . Errorf ( "Policy list cannot be empty" ) )
}
for _ , p := range v . Policies {
if p == "root" {
multierror . Append ( & mErr , fmt . Errorf ( "Can not specifiy \"root\" policy" ) )
}
2016-08-09 22:23:44 +00:00
}
2016-10-11 22:25:49 +00:00
switch v . ChangeMode {
case VaultChangeModeSignal :
if v . ChangeSignal == "" {
2017-02-13 18:51:29 +00:00
multierror . Append ( & mErr , fmt . Errorf ( "Signal must be specified when using change mode %q" , VaultChangeModeSignal ) )
2016-10-11 22:25:49 +00:00
}
case VaultChangeModeNoop , VaultChangeModeRestart :
default :
2017-02-13 18:51:29 +00:00
multierror . Append ( & mErr , fmt . Errorf ( "Unknown change mode %q" , v . ChangeMode ) )
2016-10-11 22:25:49 +00:00
}
2017-02-13 18:51:29 +00:00
return mErr . ErrorOrNil ( )
2016-08-09 22:23:44 +00:00
}
2015-07-04 00:11:53 +00:00
const (
2016-07-13 19:20:46 +00:00
AllocDesiredStatusRun = "run" // Allocation should run
AllocDesiredStatusStop = "stop" // Allocation should stop
AllocDesiredStatusEvict = "evict" // Allocation should stop, and was evicted
2015-08-25 23:18:37 +00:00
)
const (
2016-03-24 01:08:19 +00:00
AllocClientStatusPending = "pending"
AllocClientStatusRunning = "running"
AllocClientStatusComplete = "complete"
AllocClientStatusFailed = "failed"
2016-07-11 23:56:57 +00:00
AllocClientStatusLost = "lost"
2015-07-04 00:11:53 +00:00
)
// Allocation is used to allocate the placement of a task group to a node.
type Allocation struct {
// ID of the allocation (UUID)
ID string
2015-08-15 20:08:06 +00:00
// ID of the evaluation that generated this allocation
EvalID string
2015-08-11 23:34:06 +00:00
// Name is a logical name of the allocation.
Name string
2015-07-04 00:11:53 +00:00
// NodeID is the node this is being placed on
NodeID string
// Job is the parent job of the task group being allocated.
// This is copied at allocation time to avoid issues if the job
// definition is updated.
2015-07-23 22:15:48 +00:00
JobID string
Job * Job
2015-07-04 00:11:53 +00:00
2015-08-23 23:30:57 +00:00
// TaskGroup is the name of the task group that should be run
TaskGroup string
2015-09-12 23:22:18 +00:00
// Resources is the total set of resources allocated as part
2015-07-04 00:11:53 +00:00
// of this allocation of the task group.
Resources * Resources
2016-08-29 19:49:52 +00:00
// SharedResources are the resources that are shared by all the tasks in an
// allocation
SharedResources * Resources
2015-09-12 23:22:18 +00:00
// TaskResources is the set of resources allocated to each
// task. These should sum to the total Resources.
TaskResources map [ string ] * Resources
2015-07-04 00:37:01 +00:00
// Metrics associated with this allocation
Metrics * AllocMetric
2015-08-25 23:18:37 +00:00
// Desired Status of the allocation on the client
DesiredStatus string
2015-07-04 00:50:54 +00:00
2015-08-25 23:18:37 +00:00
// DesiredStatusDescription is meant to provide more human useful information
DesiredDescription string
// Status of the allocation on the client
ClientStatus string
// ClientStatusDescription is meant to provide more human useful information
2015-08-25 23:26:34 +00:00
ClientDescription string
2015-08-15 20:08:06 +00:00
2015-11-12 23:28:22 +00:00
// TaskStates stores the state of each task,
TaskStates map [ string ] * TaskState
2016-08-16 17:49:45 +00:00
// PreviousAllocation is the allocation that this allocation is replacing
PreviousAllocation string
2015-07-04 00:50:54 +00:00
// Raft Indexes
CreateIndex uint64
ModifyIndex uint64
2016-02-02 02:15:12 +00:00
// AllocModifyIndex is not updated when the client updates allocations. This
// lets the client pull only the allocs updated by the server.
2016-02-01 21:57:35 +00:00
AllocModifyIndex uint64
2016-02-09 05:58:05 +00:00
// CreateTime is the time the allocation has finished scheduling and been
// verified by the plan applier.
CreateTime int64
2015-07-04 00:11:53 +00:00
}
2016-02-02 01:47:53 +00:00
func ( a * Allocation ) Copy ( ) * Allocation {
2016-02-11 01:54:43 +00:00
if a == nil {
return nil
}
na := new ( Allocation )
* na = * a
na . Job = na . Job . Copy ( )
na . Resources = na . Resources . Copy ( )
2016-08-29 19:49:52 +00:00
na . SharedResources = na . SharedResources . Copy ( )
2016-02-11 01:54:43 +00:00
2016-03-21 23:29:21 +00:00
if a . TaskResources != nil {
tr := make ( map [ string ] * Resources , len ( na . TaskResources ) )
for task , resource := range na . TaskResources {
tr [ task ] = resource . Copy ( )
}
na . TaskResources = tr
2016-02-11 01:54:43 +00:00
}
na . Metrics = na . Metrics . Copy ( )
2016-03-21 23:29:21 +00:00
if a . TaskStates != nil {
ts := make ( map [ string ] * TaskState , len ( na . TaskStates ) )
for task , state := range na . TaskStates {
ts [ task ] = state . Copy ( )
}
na . TaskStates = ts
2016-02-11 01:54:43 +00:00
}
return na
2015-07-04 00:11:53 +00:00
}
2015-12-15 03:20:57 +00:00
// TerminalStatus returns if the desired or actual status is terminal and
// will no longer transition.
2015-08-15 23:07:22 +00:00
func ( a * Allocation ) TerminalStatus ( ) bool {
2015-12-16 22:34:17 +00:00
// First check the desired state and if that isn't terminal, check client
// state.
2015-08-25 23:18:37 +00:00
switch a . DesiredStatus {
2016-07-13 19:20:46 +00:00
case AllocDesiredStatusStop , AllocDesiredStatusEvict :
2015-08-15 23:07:22 +00:00
return true
2016-04-08 21:22:06 +00:00
default :
}
switch a . ClientStatus {
2016-08-03 22:45:42 +00:00
case AllocClientStatusComplete , AllocClientStatusFailed , AllocClientStatusLost :
2016-04-08 21:22:06 +00:00
return true
2015-12-16 22:34:17 +00:00
default :
return false
2015-08-15 23:07:22 +00:00
}
}
2016-08-22 16:34:24 +00:00
// Terminated returns if the allocation is in a terminal state on a client.
func ( a * Allocation ) Terminated ( ) bool {
if a . ClientStatus == AllocClientStatusFailed ||
a . ClientStatus == AllocClientStatusComplete ||
a . ClientStatus == AllocClientStatusLost {
return true
}
return false
}
2016-05-25 00:23:18 +00:00
// RanSuccessfully returns whether the client has ran the allocation and all
// tasks finished successfully
func ( a * Allocation ) RanSuccessfully ( ) bool {
// Handle the case the client hasn't started the allocation.
if len ( a . TaskStates ) == 0 {
return false
}
// Check to see if all the tasks finised successfully in the allocation
allSuccess := true
for _ , state := range a . TaskStates {
allSuccess = allSuccess && state . Successful ( )
}
return allSuccess
}
2015-09-06 22:34:28 +00:00
// Stub returns a list stub for the allocation
func ( a * Allocation ) Stub ( ) * AllocListStub {
return & AllocListStub {
ID : a . ID ,
EvalID : a . EvalID ,
Name : a . Name ,
NodeID : a . NodeID ,
JobID : a . JobID ,
TaskGroup : a . TaskGroup ,
DesiredStatus : a . DesiredStatus ,
DesiredDescription : a . DesiredDescription ,
ClientStatus : a . ClientStatus ,
ClientDescription : a . ClientDescription ,
2015-11-12 23:28:22 +00:00
TaskStates : a . TaskStates ,
2015-09-06 22:34:28 +00:00
CreateIndex : a . CreateIndex ,
ModifyIndex : a . ModifyIndex ,
2016-02-09 05:58:05 +00:00
CreateTime : a . CreateTime ,
2015-09-06 22:34:28 +00:00
}
}
2016-10-03 16:59:57 +00:00
// ShouldMigrate returns if the allocation needs data migration
func ( a * Allocation ) ShouldMigrate ( ) bool {
if a . DesiredStatus == AllocDesiredStatusStop || a . DesiredStatus == AllocDesiredStatusEvict {
return false
}
2016-10-19 18:12:25 +00:00
tg := a . Job . LookupTaskGroup ( a . TaskGroup )
// if the task group is nil or the ephemeral disk block isn't present then
// we won't migrate
if tg == nil || tg . EphemeralDisk == nil {
return false
}
// We won't migrate any data is the user hasn't enabled migration or the
// disk is not marked as sticky
if ! tg . EphemeralDisk . Migrate || ! tg . EphemeralDisk . Sticky {
2016-10-03 16:59:57 +00:00
return false
}
return true
}
2016-03-10 02:09:51 +00:00
var (
// AllocationIndexRegex is a regular expression to find the allocation index.
AllocationIndexRegex = regexp . MustCompile ( ".+\\[(\\d+)\\]$" )
)
// Index returns the index of the allocation. If the allocation is from a task
// group with count greater than 1, there will be multiple allocations for it.
func ( a * Allocation ) Index ( ) int {
matches := AllocationIndexRegex . FindStringSubmatch ( a . Name )
if len ( matches ) != 2 {
return - 1
}
index , err := strconv . Atoi ( matches [ 1 ] )
if err != nil {
return - 1
}
return index
}
2015-09-06 22:34:28 +00:00
// AllocListStub is used to return a subset of alloc information
type AllocListStub struct {
ID string
EvalID string
Name string
NodeID string
JobID string
TaskGroup string
DesiredStatus string
DesiredDescription string
ClientStatus string
ClientDescription string
2015-11-12 23:28:22 +00:00
TaskStates map [ string ] * TaskState
2015-09-06 22:34:28 +00:00
CreateIndex uint64
ModifyIndex uint64
2016-02-09 05:58:05 +00:00
CreateTime int64
2015-09-06 22:34:28 +00:00
}
2015-07-04 00:37:01 +00:00
// AllocMetric is used to track various metrics while attempting
// to make an allocation. These are used to debug a job, or to better
// understand the pressure within the system.
type AllocMetric struct {
// NodesEvaluated is the number of nodes that were evaluated
NodesEvaluated int
2015-10-27 21:31:14 +00:00
// NodesFiltered is the number of nodes filtered due to a constraint
2015-07-04 00:37:01 +00:00
NodesFiltered int
2016-01-04 20:07:33 +00:00
// NodesAvailable is the number of nodes available for evaluation per DC.
NodesAvailable map [ string ] int
2015-07-04 00:37:01 +00:00
// ClassFiltered is the number of nodes filtered by class
ClassFiltered map [ string ] int
// ConstraintFiltered is the number of failures caused by constraint
ConstraintFiltered map [ string ] int
2015-09-24 06:56:25 +00:00
// NodesExhausted is the number of nodes skipped due to being
2015-07-04 00:37:01 +00:00
// exhausted of at least one resource
NodesExhausted int
// ClassExhausted is the number of nodes exhausted by class
ClassExhausted map [ string ] int
2015-09-23 00:37:33 +00:00
// DimensionExhausted provides the count by dimension or reason
DimensionExhausted map [ string ] int
2015-09-13 23:48:01 +00:00
2015-07-04 00:37:01 +00:00
// Scores is the scores of the final few nodes remaining
// for placement. The top score is typically selected.
2015-08-14 04:46:33 +00:00
Scores map [ string ] float64
2015-07-04 00:37:01 +00:00
// AllocationTime is a measure of how long the allocation
// attempt took. This can affect performance and SLAs.
AllocationTime time . Duration
2015-08-16 17:03:21 +00:00
// CoalescedFailures indicates the number of other
// allocations that were coalesced into this failed allocation.
// This is to prevent creating many failed allocations for a
// single task group.
CoalescedFailures int
2015-07-04 00:37:01 +00:00
}
2016-02-11 01:54:43 +00:00
func ( a * AllocMetric ) Copy ( ) * AllocMetric {
if a == nil {
return nil
}
na := new ( AllocMetric )
* na = * a
2017-01-18 23:55:14 +00:00
na . NodesAvailable = helper . CopyMapStringInt ( na . NodesAvailable )
na . ClassFiltered = helper . CopyMapStringInt ( na . ClassFiltered )
na . ConstraintFiltered = helper . CopyMapStringInt ( na . ConstraintFiltered )
na . ClassExhausted = helper . CopyMapStringInt ( na . ClassExhausted )
na . DimensionExhausted = helper . CopyMapStringInt ( na . DimensionExhausted )
na . Scores = helper . CopyMapStringFloat64 ( na . Scores )
2016-02-11 01:54:43 +00:00
return na
}
2015-08-14 04:46:33 +00:00
func ( a * AllocMetric ) EvaluateNode ( ) {
a . NodesEvaluated += 1
}
func ( a * AllocMetric ) FilterNode ( node * Node , constraint string ) {
a . NodesFiltered += 1
if node != nil && node . NodeClass != "" {
if a . ClassFiltered == nil {
a . ClassFiltered = make ( map [ string ] int )
}
a . ClassFiltered [ node . NodeClass ] += 1
}
if constraint != "" {
if a . ConstraintFiltered == nil {
a . ConstraintFiltered = make ( map [ string ] int )
}
a . ConstraintFiltered [ constraint ] += 1
}
}
2015-09-13 23:48:01 +00:00
func ( a * AllocMetric ) ExhaustedNode ( node * Node , dimension string ) {
2015-08-14 04:46:33 +00:00
a . NodesExhausted += 1
if node != nil && node . NodeClass != "" {
if a . ClassExhausted == nil {
a . ClassExhausted = make ( map [ string ] int )
}
a . ClassExhausted [ node . NodeClass ] += 1
}
2015-09-13 23:48:01 +00:00
if dimension != "" {
2015-09-23 00:37:33 +00:00
if a . DimensionExhausted == nil {
a . DimensionExhausted = make ( map [ string ] int )
2015-09-13 23:48:01 +00:00
}
2015-09-23 00:37:33 +00:00
a . DimensionExhausted [ dimension ] += 1
2015-09-13 23:48:01 +00:00
}
2015-08-14 04:46:33 +00:00
}
2015-08-16 16:57:30 +00:00
func ( a * AllocMetric ) ScoreNode ( node * Node , name string , score float64 ) {
2015-08-14 04:46:33 +00:00
if a . Scores == nil {
a . Scores = make ( map [ string ] float64 )
}
2015-08-16 16:57:30 +00:00
key := fmt . Sprintf ( "%s.%s" , node . ID , name )
a . Scores [ key ] = score
2015-08-14 04:46:33 +00:00
}
2015-07-23 22:27:13 +00:00
const (
2016-01-31 00:16:13 +00:00
EvalStatusBlocked = "blocked"
EvalStatusPending = "pending"
EvalStatusComplete = "complete"
EvalStatusFailed = "failed"
2016-02-01 02:46:45 +00:00
EvalStatusCancelled = "canceled"
2015-07-23 22:27:13 +00:00
)
2015-08-06 18:48:44 +00:00
const (
2017-04-12 21:47:59 +00:00
EvalTriggerJobRegister = "job-register"
EvalTriggerJobDeregister = "job-deregister"
EvalTriggerPeriodicJob = "periodic-job"
EvalTriggerNodeUpdate = "node-update"
EvalTriggerScheduled = "scheduled"
EvalTriggerRollingUpdate = "rolling-update"
2017-04-14 20:19:14 +00:00
EvalTriggerFailedFollowUp = "failed-follow-up"
2017-04-12 21:47:59 +00:00
EvalTriggerMaxPlans = "max-plan-attempts"
2015-08-15 22:15:00 +00:00
)
const (
2015-09-07 18:01:29 +00:00
// CoreJobEvalGC is used for the garbage collection of evaluations
2015-09-24 06:56:25 +00:00
// and allocations. We periodically scan evaluations in a terminal state,
2015-09-07 18:01:29 +00:00
// in which all the corresponding allocations are also terminal. We
// delete these out of the system to bound the state.
2015-08-15 22:15:00 +00:00
CoreJobEvalGC = "eval-gc"
2015-09-07 18:01:29 +00:00
// CoreJobNodeGC is used for the garbage collection of failed nodes.
// We periodically scan nodes in a terminal state, and if they have no
// corresponding allocations we delete these out of the system.
CoreJobNodeGC = "node-gc"
2015-12-15 03:20:57 +00:00
// CoreJobJobGC is used for the garbage collection of eligible jobs. We
// periodically scan garbage collectible jobs and check if both their
// evaluations and allocations are terminal. If so, we delete these out of
// the system.
CoreJobJobGC = "job-gc"
2016-04-08 18:42:02 +00:00
// CoreJobForceGC is used to force garbage collection of all GCable objects.
CoreJobForceGC = "force-gc"
2015-08-06 18:48:44 +00:00
)
2015-07-23 22:27:13 +00:00
// Evaluation is used anytime we need to apply business logic as a result
// of a change to our desired state (job specification) or the emergent state
// (registered nodes). When the inputs change, we need to "evaluate" them,
// potentially taking action (allocation of work) or doing nothing if the state
// of the world does not require it.
type Evaluation struct {
// ID is a randonly generated UUID used for this evaluation. This
// is assigned upon the creation of the evaluation.
ID string
2015-07-24 00:31:08 +00:00
// Priority is used to control scheduling importance and if this job
// can preempt other jobs.
Priority int
// Type is used to control which schedulers are available to handle
// this evaluation.
Type string
2015-07-24 05:30:08 +00:00
// TriggeredBy is used to give some insight into why this Eval
// was created. (Job change, node failure, alloc failure, etc).
TriggeredBy string
2015-09-24 06:56:25 +00:00
// JobID is the job this evaluation is scoped to. Evaluations cannot
2015-08-06 00:55:15 +00:00
// be run in parallel for a given JobID, so we serialize on this.
JobID string
2015-08-06 18:48:44 +00:00
// JobModifyIndex is the modify index of the job at the time
// the evaluation was created
JobModifyIndex uint64
2015-08-06 23:39:20 +00:00
// NodeID is the node that was affected triggering the evaluation.
NodeID string
// NodeModifyIndex is the modify index of the node at the time
// the evaluation was created
NodeModifyIndex uint64
2015-07-23 22:27:13 +00:00
// Status of the evaluation
Status string
2015-08-15 20:08:06 +00:00
// StatusDescription is meant to provide more human useful information
StatusDescription string
2015-09-07 19:47:48 +00:00
// Wait is a minimum wait time for running the eval. This is used to
// support a rolling upgrade.
Wait time . Duration
// NextEval is the evaluation ID for the eval created to do a followup.
// This is used to support rolling upgrades, where we need a chain of evaluations.
NextEval string
// PreviousEval is the evaluation ID for the eval creating this one to do a followup.
// This is used to support rolling upgrades, where we need a chain of evaluations.
PreviousEval string
2016-05-25 01:12:59 +00:00
// BlockedEval is the evaluation ID for a created blocked eval. A
2016-05-19 20:09:52 +00:00
// blocked eval will be created if all allocations could not be placed due
// to constraints or lacking resources.
2016-05-25 01:12:59 +00:00
BlockedEval string
2016-05-19 20:09:52 +00:00
2016-05-19 01:11:40 +00:00
// FailedTGAllocs are task groups which have allocations that could not be
// made, but the metrics are persisted so that the user can use the feedback
// to determine the cause.
FailedTGAllocs map [ string ] * AllocMetric
2016-05-15 16:41:34 +00:00
// ClassEligibility tracks computed node classes that have been explicitly
2016-01-30 01:46:44 +00:00
// marked as eligible or ineligible.
ClassEligibility map [ string ] bool
2016-01-28 21:43:48 +00:00
// EscapedComputedClass marks whether the job has constraints that are not
// captured by computed node classes.
2016-01-30 01:46:44 +00:00
EscapedComputedClass bool
2016-01-28 21:43:48 +00:00
2016-05-05 18:21:58 +00:00
// AnnotatePlan triggers the scheduler to provide additional annotations
// during the evaluation. This should not be set during normal operations.
AnnotatePlan bool
2017-03-09 20:37:41 +00:00
// QueuedAllocations is the number of unplaced allocations at the time the
// evaluation was processed. The map is keyed by Task Group names.
QueuedAllocations map [ string ] int
2016-05-21 01:07:10 +00:00
// SnapshotIndex is the Raft index of the snapshot used to process the
// evaluation. As such it will only be set once it has gone through the
// scheduler.
SnapshotIndex uint64
2015-07-23 22:27:13 +00:00
// Raft Indexes
CreateIndex uint64
ModifyIndex uint64
}
2015-08-15 23:07:22 +00:00
// TerminalStatus returns if the current status is terminal and
// will no longer transition.
func ( e * Evaluation ) TerminalStatus ( ) bool {
switch e . Status {
2016-01-31 00:16:13 +00:00
case EvalStatusComplete , EvalStatusFailed , EvalStatusCancelled :
2015-08-15 23:07:22 +00:00
return true
default :
return false
}
}
2015-08-14 00:11:20 +00:00
func ( e * Evaluation ) GoString ( ) string {
return fmt . Sprintf ( "<Eval '%s' JobID: '%s'>" , e . ID , e . JobID )
}
2015-08-15 21:16:40 +00:00
func ( e * Evaluation ) Copy ( ) * Evaluation {
2016-02-11 01:54:43 +00:00
if e == nil {
return nil
}
2015-08-15 21:16:40 +00:00
ne := new ( Evaluation )
* ne = * e
2016-05-19 01:11:40 +00:00
// Copy ClassEligibility
if e . ClassEligibility != nil {
classes := make ( map [ string ] bool , len ( e . ClassEligibility ) )
for class , elig := range e . ClassEligibility {
classes [ class ] = elig
}
ne . ClassEligibility = classes
}
// Copy FailedTGAllocs
if e . FailedTGAllocs != nil {
failedTGs := make ( map [ string ] * AllocMetric , len ( e . FailedTGAllocs ) )
for tg , metric := range e . FailedTGAllocs {
failedTGs [ tg ] = metric . Copy ( )
}
ne . FailedTGAllocs = failedTGs
}
2016-07-18 22:04:05 +00:00
// Copy queued allocations
if e . QueuedAllocations != nil {
queuedAllocations := make ( map [ string ] int , len ( e . QueuedAllocations ) )
for tg , num := range e . QueuedAllocations {
queuedAllocations [ tg ] = num
}
ne . QueuedAllocations = queuedAllocations
}
2015-08-15 21:16:40 +00:00
return ne
}
2016-01-29 23:31:32 +00:00
// ShouldEnqueue checks if a given evaluation should be enqueued into the
// eval_broker
2015-08-06 18:28:55 +00:00
func ( e * Evaluation ) ShouldEnqueue ( ) bool {
switch e . Status {
case EvalStatusPending :
return true
2016-01-31 00:16:13 +00:00
case EvalStatusComplete , EvalStatusFailed , EvalStatusBlocked , EvalStatusCancelled :
2016-01-29 23:31:32 +00:00
return false
default :
panic ( fmt . Sprintf ( "unhandled evaluation (%s) status %s" , e . ID , e . Status ) )
}
}
// ShouldBlock checks if a given evaluation should be entered into the blocked
// eval tracker.
func ( e * Evaluation ) ShouldBlock ( ) bool {
switch e . Status {
case EvalStatusBlocked :
return true
2016-01-31 00:16:13 +00:00
case EvalStatusComplete , EvalStatusFailed , EvalStatusPending , EvalStatusCancelled :
2015-08-06 18:28:55 +00:00
return false
default :
panic ( fmt . Sprintf ( "unhandled evaluation (%s) status %s" , e . ID , e . Status ) )
}
}
2015-08-11 23:34:06 +00:00
// MakePlan is used to make a plan from the given evaluation
// for a given Job
func ( e * Evaluation ) MakePlan ( j * Job ) * Plan {
p := & Plan {
EvalID : e . ID ,
2015-08-13 23:29:28 +00:00
Priority : e . Priority ,
2016-02-21 19:31:27 +00:00
Job : j ,
2015-08-25 23:52:56 +00:00
NodeUpdate : make ( map [ string ] [ ] * Allocation ) ,
2015-08-11 23:34:06 +00:00
NodeAllocation : make ( map [ string ] [ ] * Allocation ) ,
}
2015-08-13 23:29:28 +00:00
if j != nil {
p . AllAtOnce = j . AllAtOnce
}
2015-08-11 23:34:06 +00:00
return p
}
2015-09-07 22:08:50 +00:00
// NextRollingEval creates an evaluation to followup this eval for rolling updates
func ( e * Evaluation ) NextRollingEval ( wait time . Duration ) * Evaluation {
return & Evaluation {
ID : GenerateUUID ( ) ,
Priority : e . Priority ,
Type : e . Type ,
TriggeredBy : EvalTriggerRollingUpdate ,
JobID : e . JobID ,
JobModifyIndex : e . JobModifyIndex ,
Status : EvalStatusPending ,
Wait : wait ,
PreviousEval : e . ID ,
}
}
2016-05-25 01:12:59 +00:00
// CreateBlockedEval creates a blocked evaluation to followup this eval to place any
2016-05-15 16:41:34 +00:00
// failed allocations. It takes the classes marked explicitly eligible or
2016-01-28 21:43:48 +00:00
// ineligible and whether the job has escaped computed node classes.
2016-05-25 01:12:59 +00:00
func ( e * Evaluation ) CreateBlockedEval ( classEligibility map [ string ] bool , escaped bool ) * Evaluation {
2016-01-28 21:43:48 +00:00
return & Evaluation {
ID : GenerateUUID ( ) ,
Priority : e . Priority ,
Type : e . Type ,
TriggeredBy : e . TriggeredBy ,
JobID : e . JobID ,
JobModifyIndex : e . JobModifyIndex ,
Status : EvalStatusBlocked ,
PreviousEval : e . ID ,
2016-01-30 01:46:44 +00:00
ClassEligibility : classEligibility ,
2016-01-28 21:43:48 +00:00
EscapedComputedClass : escaped ,
}
}
2017-04-12 21:47:59 +00:00
// CreateFailedFollowUpEval creates a follow up evaluation when the current one
// has been marked as failed becasue it has hit the delivery limit and will not
// be retried by the eval_broker.
func ( e * Evaluation ) CreateFailedFollowUpEval ( wait time . Duration ) * Evaluation {
return & Evaluation {
ID : GenerateUUID ( ) ,
Priority : e . Priority ,
Type : e . Type ,
TriggeredBy : EvalTriggerFailedFollowUp ,
JobID : e . JobID ,
JobModifyIndex : e . JobModifyIndex ,
Status : EvalStatusPending ,
Wait : wait ,
PreviousEval : e . ID ,
}
}
2015-07-27 21:59:16 +00:00
// Plan is used to submit a commit plan for task allocations. These
// are submitted to the leader which verifies that resources have
// not been overcommitted before admiting the plan.
type Plan struct {
2015-07-29 00:49:45 +00:00
// EvalID is the evaluation ID this plan is associated with
EvalID string
2015-08-12 22:44:36 +00:00
// EvalToken is used to prevent a split-brain processing of
// an evaluation. There should only be a single scheduler running
// an Eval at a time, but this could be violated after a leadership
// transition. This unique token is used to reject plans that are
// being submitted from a different leader.
EvalToken string
2015-07-27 21:59:16 +00:00
// Priority is the priority of the upstream job
Priority int
2015-07-29 00:49:45 +00:00
// AllAtOnce is used to control if incremental scheduling of task groups
// is allowed or if we must do a gang scheduling of the entire job.
// If this is false, a plan may be partially applied. Otherwise, the
// entire plan must be able to make progress.
AllAtOnce bool
2016-02-21 19:31:27 +00:00
// Job is the parent job of all the allocations in the Plan.
// Since a Plan only involves a single Job, we can reduce the size
// of the plan by only including it once.
Job * Job
2015-08-25 23:52:56 +00:00
// NodeUpdate contains all the allocations for each node. For each node,
// this is a list of the allocations to update to either stop or evict.
NodeUpdate map [ string ] [ ] * Allocation
2015-07-29 00:49:45 +00:00
// NodeAllocation contains all the allocations for each node.
// The evicts must be considered prior to the allocations.
2015-08-04 23:32:46 +00:00
NodeAllocation map [ string ] [ ] * Allocation
2015-08-15 20:27:42 +00:00
2016-05-05 18:21:58 +00:00
// Annotations contains annotations by the scheduler to be used by operators
// to understand the decisions made by the scheduler.
Annotations * PlanAnnotations
2015-07-27 21:59:16 +00:00
}
2016-08-03 22:45:42 +00:00
// AppendUpdate marks the allocation for eviction. The clientStatus of the
// allocation may be optionally set by passing in a non-empty value.
func ( p * Plan ) AppendUpdate ( alloc * Allocation , desiredStatus , desiredDesc , clientStatus string ) {
2015-08-26 00:06:06 +00:00
newAlloc := new ( Allocation )
* newAlloc = * alloc
2016-02-24 22:50:59 +00:00
// If the job is not set in the plan we are deregistering a job so we
// extract the job from the allocation.
if p . Job == nil && newAlloc . Job != nil {
p . Job = newAlloc . Job
}
// Normalize the job
newAlloc . Job = nil
2016-03-01 22:09:25 +00:00
// Strip the resources as it can be rebuilt.
newAlloc . Resources = nil
2016-08-03 22:45:42 +00:00
newAlloc . DesiredStatus = desiredStatus
newAlloc . DesiredDescription = desiredDesc
if clientStatus != "" {
newAlloc . ClientStatus = clientStatus
}
2015-08-13 21:02:39 +00:00
node := alloc . NodeID
2015-08-25 23:52:56 +00:00
existing := p . NodeUpdate [ node ]
2015-08-26 00:06:06 +00:00
p . NodeUpdate [ node ] = append ( existing , newAlloc )
2015-08-13 21:02:39 +00:00
}
2015-09-07 19:00:34 +00:00
func ( p * Plan ) PopUpdate ( alloc * Allocation ) {
existing := p . NodeUpdate [ alloc . NodeID ]
n := len ( existing )
if n > 0 && existing [ n - 1 ] . ID == alloc . ID {
existing = existing [ : n - 1 ]
2015-09-07 19:05:18 +00:00
if len ( existing ) > 0 {
p . NodeUpdate [ alloc . NodeID ] = existing
} else {
delete ( p . NodeUpdate , alloc . NodeID )
}
2015-09-07 19:00:34 +00:00
}
}
2015-08-13 21:02:39 +00:00
func ( p * Plan ) AppendAlloc ( alloc * Allocation ) {
node := alloc . NodeID
existing := p . NodeAllocation [ node ]
p . NodeAllocation [ node ] = append ( existing , alloc )
}
2015-08-14 01:16:32 +00:00
// IsNoOp checks if this plan would do nothing
func ( p * Plan ) IsNoOp ( ) bool {
2016-05-19 01:11:40 +00:00
return len ( p . NodeUpdate ) == 0 && len ( p . NodeAllocation ) == 0
2015-08-14 01:16:32 +00:00
}
2015-07-27 22:31:49 +00:00
// PlanResult is the result of a plan submitted to the leader.
2015-07-27 21:59:16 +00:00
type PlanResult struct {
2015-08-25 23:52:56 +00:00
// NodeUpdate contains all the updates that were committed.
NodeUpdate map [ string ] [ ] * Allocation
2015-07-29 00:49:45 +00:00
// NodeAllocation contains all the allocations that were committed.
2015-08-04 23:32:46 +00:00
NodeAllocation map [ string ] [ ] * Allocation
2015-07-29 00:49:45 +00:00
// RefreshIndex is the index the worker should refresh state up to.
// This allows all evictions and allocations to be materialized.
// If any allocations were rejected due to stale data (node state,
// over committed) this can be used to force a worker refresh.
2015-07-28 23:36:15 +00:00
RefreshIndex uint64
2015-07-29 00:49:45 +00:00
// AllocIndex is the Raft index in which the evictions and
// allocations took place. This is used for the write index.
2015-07-27 22:31:49 +00:00
AllocIndex uint64
2015-07-27 21:59:16 +00:00
}
2015-08-26 00:36:52 +00:00
// IsNoOp checks if this plan result would do nothing
func ( p * PlanResult ) IsNoOp ( ) bool {
2016-05-19 01:11:40 +00:00
return len ( p . NodeUpdate ) == 0 && len ( p . NodeAllocation ) == 0
2015-08-26 00:36:52 +00:00
}
2015-08-13 22:17:24 +00:00
// FullCommit is used to check if all the allocations in a plan
// were committed as part of the result. Returns if there was
// a match, and the number of expected and actual allocations.
func ( p * PlanResult ) FullCommit ( plan * Plan ) ( bool , int , int ) {
expected := 0
actual := 0
for name , allocList := range plan . NodeAllocation {
didAlloc , _ := p . NodeAllocation [ name ]
expected += len ( allocList )
actual += len ( didAlloc )
}
return actual == expected , expected , actual
}
2016-05-05 18:21:58 +00:00
// PlanAnnotations holds annotations made by the scheduler to give further debug
// information to operators.
type PlanAnnotations struct {
// DesiredTGUpdates is the set of desired updates per task group.
DesiredTGUpdates map [ string ] * DesiredUpdates
}
// DesiredUpdates is the set of changes the scheduler would like to make given
// sufficient resources and cluster capacity.
type DesiredUpdates struct {
Ignore uint64
Place uint64
Migrate uint64
Stop uint64
InPlaceUpdate uint64
DestructiveUpdate uint64
}
2015-06-05 22:21:17 +00:00
// msgpackHandle is a shared handle for encoding/decoding of structs
2015-11-18 23:16:42 +00:00
var MsgpackHandle = func ( ) * codec . MsgpackHandle {
2015-11-16 22:25:19 +00:00
h := & codec . MsgpackHandle { RawToString : true }
// Sets the default type for decoding a map into a nil interface{}.
// This is necessary in particular because we store the driver configs as a
// nil interface{}.
h . MapType = reflect . TypeOf ( map [ string ] interface { } ( nil ) )
return h
} ( )
2015-06-05 22:21:17 +00:00
2016-02-21 02:05:17 +00:00
var HashiMsgpackHandle = func ( ) * hcodec . MsgpackHandle {
h := & hcodec . MsgpackHandle { RawToString : true }
// Sets the default type for decoding a map into a nil interface{}.
// This is necessary in particular because we store the driver configs as a
// nil interface{}.
h . MapType = reflect . TypeOf ( map [ string ] interface { } ( nil ) )
return h
} ( )
2015-06-05 22:21:17 +00:00
// Decode is used to decode a MsgPack encoded object
func Decode ( buf [ ] byte , out interface { } ) error {
2015-11-18 23:16:42 +00:00
return codec . NewDecoder ( bytes . NewReader ( buf ) , MsgpackHandle ) . Decode ( out )
2015-06-05 22:21:17 +00:00
}
// Encode is used to encode a MsgPack object with type prefix
func Encode ( t MessageType , msg interface { } ) ( [ ] byte , error ) {
var buf bytes . Buffer
buf . WriteByte ( uint8 ( t ) )
2015-11-18 23:16:42 +00:00
err := codec . NewEncoder ( & buf , MsgpackHandle ) . Encode ( msg )
2015-06-05 22:21:17 +00:00
return buf . Bytes ( ) , err
}
2016-10-17 17:48:04 +00:00
// KeyringResponse is a unified key response and can be used for install,
// remove, use, as well as listing key queries.
type KeyringResponse struct {
Messages map [ string ] string
Keys map [ string ] int
NumNodes int
}
// KeyringRequest is request objects for serf key operations.
type KeyringRequest struct {
Key string
}
2016-10-23 01:08:30 +00:00
// RecoverableError wraps an error and marks whether it is recoverable and could
// be retried or it is fatal.
type RecoverableError struct {
Err string
2017-03-27 23:27:24 +00:00
Recoverable bool
2016-10-23 01:08:30 +00:00
}
// NewRecoverableError is used to wrap an error and mark it as recoverable or
// not.
2017-01-14 00:46:08 +00:00
func NewRecoverableError ( e error , recoverable bool ) error {
2016-10-23 01:08:30 +00:00
if e == nil {
return nil
}
return & RecoverableError {
Err : e . Error ( ) ,
2017-03-27 23:27:24 +00:00
Recoverable : recoverable ,
2016-10-23 01:08:30 +00:00
}
}
2017-03-27 22:37:15 +00:00
// WrapRecoverable wraps an existing error in a new RecoverableError with a new
// message. If the error was recoverable before the returned error is as well;
// otherwise it is unrecoverable.
func WrapRecoverable ( msg string , err error ) error {
2017-03-27 23:27:24 +00:00
return & RecoverableError { Err : msg , Recoverable : IsRecoverable ( err ) }
2017-03-27 22:37:15 +00:00
}
2016-10-23 01:08:30 +00:00
func ( r * RecoverableError ) Error ( ) string {
return r . Err
}
2017-01-14 00:46:08 +00:00
2017-03-27 23:27:24 +00:00
func ( r * RecoverableError ) IsRecoverable ( ) bool {
return r . Recoverable
2017-03-24 22:26:05 +00:00
}
// Recoverable is an interface for errors to implement to indicate whether or
// not they are fatal or recoverable.
type Recoverable interface {
error
2017-03-27 23:27:24 +00:00
IsRecoverable ( ) bool
2017-03-24 22:26:05 +00:00
}
2017-01-14 00:46:08 +00:00
// IsRecoverable returns true if error is a RecoverableError with
// Recoverable=true. Otherwise false is returned.
func IsRecoverable ( e error ) bool {
2017-03-24 22:26:05 +00:00
if re , ok := e . ( Recoverable ) ; ok {
2017-03-27 23:27:24 +00:00
return re . IsRecoverable ( )
2017-01-14 00:46:08 +00:00
}
return false
}