#!/usr/bin/env python3
#
# Copyright (C) 2016 Codethink Limited
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library. If not, see .
#
# Authors:
# Tristan Van Berkom
# Jürg Billeter
# System imports
from collections import deque
from enum import Enum
import traceback
# Local imports
from .job import Job
# BuildStream toplevel imports
from .._exceptions import BstError, set_last_task_error
from .._message import Message, MessageType
# Indicates the kind of activity
#
#
class QueueType():
# Tasks which download stuff from the internet
FETCH = 1
# CPU/Disk intensive tasks
BUILD = 2
# Tasks which upload stuff to the internet
PUSH = 3
# Queue status for a given element
#
#
class QueueStatus(Enum):
# The element is waiting for dependencies.
WAIT = 1
# The element can skip this queue.
SKIP = 2
# The element is ready for processing in this queue.
READY = 3
# Queue()
#
# Args:
# scheduler (Scheduler): The Scheduler
#
class Queue():
# These should be overridden on class data of of concrete Queue implementations
action_name = None
complete_name = None
queue_type = None
def __init__(self, scheduler):
#
# Public members
#
self.active_jobs = [] # List of active ongoing Jobs, for scheduler observation
self.failed_elements = [] # List of failed elements, for the frontend
self.processed_elements = [] # List of processed elements, for the frontend
self.skipped_elements = [] # List of skipped elements, for the frontend
#
# Private members
#
self._scheduler = scheduler
self._wait_queue = deque()
self._done_queue = deque()
self._max_retries = 0
if self.queue_type == QueueType.FETCH or self.queue_type == QueueType.PUSH:
self._max_retries = scheduler.context.sched_network_retries
# Assert the subclass has setup class data
assert self.action_name is not None
assert self.complete_name is not None
assert self.queue_type is not None
#####################################################
# Abstract Methods for Queue implementations #
#####################################################
# process()
#
# Abstract method for processing an element
#
# Args:
# element (Element): An element to process
#
# Returns:
# (any): An optional something to be returned
# for every element successfully processed
#
#
def process(self, element):
pass
# status()
#
# Abstract method for reporting the status of an element.
#
# Args:
# element (Element): An element to process
#
# Returns:
# (QueueStatus): The element status
#
def status(self, element):
return QueueStatus.READY
# prepare()
#
# Abstract method for handling job preparation in the main process.
#
# Args:
# element (Element): The element which is scheduled
#
def prepare(self, element):
pass
# done()
#
# Abstract method for handling a successful job completion.
#
# Args:
# element (Element): The element which completed processing
# result (any): The return value of the process() implementation
# success (bool): True if the process() implementation did not
# raise any exception
#
# Returns:
# (bool): True if the element should appear to be processsed,
# Otherwise False will count the element as "skipped"
#
def done(self, element, result, success):
pass
#####################################################
# Scheduler / Pipeline facing APIs #
#####################################################
# enqueue()
#
# Enqueues some elements
#
# Args:
# elts (list): A list of Elements
#
def enqueue(self, elts):
if not elts:
return
# Place skipped elements directly on the done queue
elts = list(elts)
skip = [elt for elt in elts if self.status(elt) == QueueStatus.SKIP]
wait = [elt for elt in elts if elt not in skip]
self._wait_queue.extend(wait)
self._done_queue.extend(skip)
self.skipped_elements.extend(skip)
# dequeue()
#
# A generator which dequeues the elements which
# are ready to exit the queue.
#
# Yields:
# (Element): Elements being dequeued
#
def dequeue(self):
while self._done_queue:
yield self._done_queue.popleft()
# dequeue_ready()
#
# Reports whether there are any elements to dequeue
#
# Returns:
# (bool): Whether there are elements to dequeue
#
def dequeue_ready(self):
return any(self._done_queue)
# process_ready()
#
# Process elements in the queue, moving elements which were enqueued
# into the dequeue pool, and processing them if necessary.
#
# This will have different results for elements depending
# on the Queue.status() implementation.
#
# o Elements which are QueueStatus.WAIT will not be effected
#
# o Elements which are QueueStatus.READY will be processed
# and added to the Queue.active_jobs list as a result,
# given that the scheduler allows the Queue enough tokens
# for the given queue's job type
#
# o Elements which are QueueStatus.SKIP will move directly
# to the dequeue pool
#
def process_ready(self):
scheduler = self._scheduler
unready = []
while self._wait_queue and scheduler.get_job_token(self.queue_type):
element = self._wait_queue.popleft()
status = self.status(element)
if status == QueueStatus.WAIT:
scheduler.put_job_token(self.queue_type)
unready.append(element)
continue
elif status == QueueStatus.SKIP:
scheduler.put_job_token(self.queue_type)
self._done_queue.append(element)
self.skipped_elements.append(element)
continue
self.prepare(element)
job = Job(scheduler, element, self.action_name,
self.process, self._job_done,
max_retries=self._max_retries)
scheduler.job_starting(job)
job.spawn()
self.active_jobs.append(job)
# These were not ready but were in the beginning, give em
# first priority again next time around
self._wait_queue.extendleft(unready)
#####################################################
# Private Methods #
#####################################################
# _update_workspaces()
#
# Updates and possibly saves the workspaces in the
# main data model in the main process after a job completes.
#
# Args:
# element (Element): The element which completed
# job (Job): The job which completed
#
def _update_workspaces(self, element, job):
# Handle any workspace modifications now
#
if job.workspace_dict:
project = element._get_project()
if project.workspaces.update_workspace(element.name, job.workspace_dict):
try:
project.workspaces.save_config()
except BstError as e:
self._message(element, MessageType.ERROR, "Error saving workspaces", detail=str(e))
except Exception as e: # pylint: disable=broad-except
self._message(element, MessageType.BUG,
"Unhandled exception while saving workspaces",
detail=traceback.format_exc())
# _job_done()
#
# A callback reported by the Job() when a job completes
#
# This will call the Queue implementation specific Queue.done()
# implementation and trigger the scheduler to reschedule.
#
# See the Job object for an explanation of the call signature
#
def _job_done(self, job, element, success, result):
# Remove from our jobs
self.active_jobs.remove(job)
# Update workspaces in the main task before calling any queue implementation
self._update_workspaces(element, job)
# Give the result of the job to the Queue implementor,
# and determine if it should be considered as processed
# or skipped.
try:
processed = self.done(element, result, success)
except BstError as e:
# Report error and mark as failed
#
self._message(element, MessageType.ERROR, "Post processing error", detail=str(e))
self.failed_elements.append(element)
# Treat this as a task error as it's related to a task
# even though it did not occur in the task context
#
# This just allows us stronger testing capability
#
set_last_task_error(e.domain, e.reason)
except Exception as e: # pylint: disable=broad-except
# Report unhandled exceptions and mark as failed
#
self._message(element, MessageType.BUG,
"Unhandled exception in post processing",
detail=traceback.format_exc())
self.failed_elements.append(element)
else:
# No exception occured, handle the success/failure state in the normal way
#
if success:
self._done_queue.append(element)
if processed:
self.processed_elements.append(element)
else:
self.skipped_elements.append(element)
else:
self.failed_elements.append(element)
# Give the token for this job back to the scheduler
# immediately before invoking another round of scheduling
self._scheduler.put_job_token(self.queue_type)
# Notify frontend
self._scheduler.job_completed(self, job, success)
self._scheduler.sched()
# Convenience wrapper for Queue implementations to send
# a message for the element they are processing
def _message(self, element, message_type, brief, **kwargs):
context = element._get_context()
message = Message(element._get_unique_id(), message_type, brief, **kwargs)
context.message(message)