kubernetes: k8s.io/kubernetes/pkg/scheduler/internal/queue Index | Files

package queue

import "k8s.io/kubernetes/pkg/scheduler/internal/queue"

Index

Package Files

pod_backoff.go scheduling_queue.go

func MakeNextPodFunc Uses

func MakeNextPodFunc(queue SchedulingQueue) func() *v1.Pod

MakeNextPodFunc returns a function to retrieve the next pod from a given scheduling queue

func NominatedNodeName Uses

func NominatedNodeName(pod *v1.Pod) string

NominatedNodeName returns nominated node name of a Pod.

type PodBackoffMap Uses

type PodBackoffMap struct {
    // contains filtered or unexported fields
}

PodBackoffMap is a structure that stores backoff related information for pods

func NewPodBackoffMap Uses

func NewPodBackoffMap(initialDuration, maxDuration time.Duration) *PodBackoffMap

NewPodBackoffMap creates a PodBackoffMap with initial duration and max duration.

func (*PodBackoffMap) BackoffPod Uses

func (pbm *PodBackoffMap) BackoffPod(nsPod ktypes.NamespacedName)

BackoffPod updates the lastUpdateTime for an nsPod, and increases its numberOfAttempts by 1

func (*PodBackoffMap) CleanupPodsCompletesBackingoff Uses

func (pbm *PodBackoffMap) CleanupPodsCompletesBackingoff()

CleanupPodsCompletesBackingoff execute garbage collection on the pod backoff, i.e, it will remove a pod from the PodBackoffMap if lastUpdateTime + maxBackoffDuration is before the current timestamp

func (*PodBackoffMap) ClearPodBackoff Uses

func (pbm *PodBackoffMap) ClearPodBackoff(nsPod ktypes.NamespacedName)

ClearPodBackoff is the thread safe version of clearPodBackoff

func (*PodBackoffMap) GetBackoffTime Uses

func (pbm *PodBackoffMap) GetBackoffTime(nsPod ktypes.NamespacedName) (time.Time, bool)

GetBackoffTime returns the time that nsPod completes backoff

type PriorityQueue Uses

type PriorityQueue struct {
    // contains filtered or unexported fields
}

PriorityQueue implements a scheduling queue. The head of PriorityQueue is the highest priority pending pod. This structure has three sub queues. One sub-queue holds pods that are being considered for scheduling. This is called activeQ and is a Heap. Another queue holds pods that are already tried and are determined to be unschedulable. The latter is called unschedulableQ. The third queue holds pods that are moved from unschedulable queues and will be moved to active queue when backoff are completed.

func NewPriorityQueue Uses

func NewPriorityQueue(stop <-chan struct{}, fwk framework.Framework) *PriorityQueue

NewPriorityQueue creates a PriorityQueue object.

func NewPriorityQueueWithClock Uses

func NewPriorityQueueWithClock(stop <-chan struct{}, clock util.Clock, fwk framework.Framework) *PriorityQueue

NewPriorityQueueWithClock creates a PriorityQueue which uses the passed clock for time.

func (*PriorityQueue) Add Uses

func (p *PriorityQueue) Add(pod *v1.Pod) error

Add adds a pod to the active queue. It should be called only when a new pod is added so there is no chance the pod is already in active/unschedulable/backoff queues

func (*PriorityQueue) AddIfNotPresent Uses

func (p *PriorityQueue) AddIfNotPresent(pod *v1.Pod) error

AddIfNotPresent adds a pod to the active queue if it is not present in any of the queues. If it is present in any, it doesn't do any thing.

func (*PriorityQueue) AddUnschedulableIfNotPresent Uses

func (p *PriorityQueue) AddUnschedulableIfNotPresent(pod *v1.Pod, podSchedulingCycle int64) error

AddUnschedulableIfNotPresent inserts a pod that cannot be scheduled into the queue, unless it is already in the queue. Normally, PriorityQueue puts unschedulable pods in `unschedulableQ`. But if there has been a recent move request, then the pod is put in `podBackoffQ`.

func (*PriorityQueue) AssignedPodAdded Uses

func (p *PriorityQueue) AssignedPodAdded(pod *v1.Pod)

AssignedPodAdded is called when a bound pod is added. Creation of this pod may make pending pods with matching affinity terms schedulable.

func (*PriorityQueue) AssignedPodUpdated Uses

func (p *PriorityQueue) AssignedPodUpdated(pod *v1.Pod)

AssignedPodUpdated is called when a bound pod is updated. Change of labels may make pending pods with matching affinity terms schedulable.

func (*PriorityQueue) Close Uses

func (p *PriorityQueue) Close()

Close closes the priority queue.

func (*PriorityQueue) Delete Uses

func (p *PriorityQueue) Delete(pod *v1.Pod) error

Delete deletes the item from either of the two queues. It assumes the pod is only in one queue.

func (*PriorityQueue) DeleteNominatedPodIfExists Uses

func (p *PriorityQueue) DeleteNominatedPodIfExists(pod *v1.Pod)

DeleteNominatedPodIfExists deletes pod nominatedPods.

func (*PriorityQueue) MoveAllToActiveQueue Uses

func (p *PriorityQueue) MoveAllToActiveQueue()

MoveAllToActiveQueue moves all pods from unschedulableQ to activeQ. This function adds all pods and then signals the condition variable to ensure that if Pop() is waiting for an item, it receives it after all the pods are in the queue and the head is the highest priority pod.

func (*PriorityQueue) NominatedPodsForNode Uses

func (p *PriorityQueue) NominatedPodsForNode(nodeName string) []*v1.Pod

NominatedPodsForNode returns pods that are nominated to run on the given node, but they are waiting for other pods to be removed from the node before they can be actually scheduled.

func (*PriorityQueue) NumUnschedulablePods Uses

func (p *PriorityQueue) NumUnschedulablePods() int

NumUnschedulablePods returns the number of unschedulable pods exist in the SchedulingQueue.

func (*PriorityQueue) PendingPods Uses

func (p *PriorityQueue) PendingPods() []*v1.Pod

PendingPods returns all the pending pods in the queue. This function is used for debugging purposes in the scheduler cache dumper and comparer.

func (*PriorityQueue) Pop Uses

func (p *PriorityQueue) Pop() (*v1.Pod, error)

Pop removes the head of the active queue and returns it. It blocks if the activeQ is empty and waits until a new item is added to the queue. It increments scheduling cycle when a pod is popped.

func (*PriorityQueue) SchedulingCycle Uses

func (p *PriorityQueue) SchedulingCycle() int64

SchedulingCycle returns current scheduling cycle.

func (*PriorityQueue) Update Uses

func (p *PriorityQueue) Update(oldPod, newPod *v1.Pod) error

Update updates a pod in the active or backoff queue if present. Otherwise, it removes the item from the unschedulable queue if pod is updated in a way that it may become schedulable and adds the updated one to the active queue. If pod is not present in any of the queues, it is added to the active queue.

func (*PriorityQueue) UpdateNominatedPodForNode Uses

func (p *PriorityQueue) UpdateNominatedPodForNode(pod *v1.Pod, nodeName string)

UpdateNominatedPodForNode adds a pod to the nominated pods of the given node. This is called during the preemption process after a node is nominated to run the pod. We update the structure before sending a request to update the pod object to avoid races with the following scheduling cycles.

type SchedulingQueue Uses

type SchedulingQueue interface {
    Add(pod *v1.Pod) error
    AddIfNotPresent(pod *v1.Pod) error
    // AddUnschedulableIfNotPresent adds an unschedulable pod back to scheduling queue.
    // The podSchedulingCycle represents the current scheduling cycle number which can be
    // returned by calling SchedulingCycle().
    AddUnschedulableIfNotPresent(pod *v1.Pod, podSchedulingCycle int64) error
    // SchedulingCycle returns the current number of scheduling cycle which is
    // cached by scheduling queue. Normally, incrementing this number whenever
    // a pod is popped (e.g. called Pop()) is enough.
    SchedulingCycle() int64
    // Pop removes the head of the queue and returns it. It blocks if the
    // queue is empty and waits until a new item is added to the queue.
    Pop() (*v1.Pod, error)
    Update(oldPod, newPod *v1.Pod) error
    Delete(pod *v1.Pod) error
    MoveAllToActiveQueue()
    AssignedPodAdded(pod *v1.Pod)
    AssignedPodUpdated(pod *v1.Pod)
    NominatedPodsForNode(nodeName string) []*v1.Pod
    PendingPods() []*v1.Pod
    // Close closes the SchedulingQueue so that the goroutine which is
    // waiting to pop items can exit gracefully.
    Close()
    // UpdateNominatedPodForNode adds the given pod to the nominated pod map or
    // updates it if it already exists.
    UpdateNominatedPodForNode(pod *v1.Pod, nodeName string)
    // DeleteNominatedPodIfExists deletes nominatedPod from internal cache
    DeleteNominatedPodIfExists(pod *v1.Pod)
    // NumUnschedulablePods returns the number of unschedulable pods exist in the SchedulingQueue.
    NumUnschedulablePods() int
}

SchedulingQueue is an interface for a queue to store pods waiting to be scheduled. The interface follows a pattern similar to cache.FIFO and cache.Heap and makes it easy to use those data structures as a SchedulingQueue.

func NewSchedulingQueue Uses

func NewSchedulingQueue(stop <-chan struct{}, fwk framework.Framework) SchedulingQueue

NewSchedulingQueue initializes a priority queue as a new scheduling queue.

type UnschedulablePodsMap Uses

type UnschedulablePodsMap struct {
    // contains filtered or unexported fields
}

UnschedulablePodsMap holds pods that cannot be scheduled. This data structure is used to implement unschedulableQ.

Package queue imports 15 packages (graph) and is imported by 64 packages. Updated 2019-09-22. Refresh now. Tools for package owners.