2009-11-05 23:58:36 +01:00
|
|
|
/****************************************************************************
|
2016-08-07 16:25:30 +02:00
|
|
|
* sched/wqueue/work_process.c
|
2009-11-05 23:58:36 +01:00
|
|
|
*
|
2020-03-11 21:23:38 +01:00
|
|
|
* Licensed to the Apache Software Foundation (ASF) under one or more
|
|
|
|
* contributor license agreements. See the NOTICE file distributed with
|
|
|
|
* this work for additional information regarding copyright ownership. The
|
|
|
|
* ASF licenses this file to you under the Apache License, Version 2.0 (the
|
|
|
|
* "License"); you may not use this file except in compliance with the
|
|
|
|
* License. You may obtain a copy of the License at
|
2009-11-05 23:58:36 +01:00
|
|
|
*
|
2020-03-11 21:23:38 +01:00
|
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
2009-11-05 23:58:36 +01:00
|
|
|
*
|
2020-03-11 21:23:38 +01:00
|
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
|
|
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
|
|
|
|
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
|
|
|
|
* License for the specific language governing permissions and limitations
|
|
|
|
* under the License.
|
2009-11-05 23:58:36 +01:00
|
|
|
*
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
/****************************************************************************
|
|
|
|
* Included Files
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
#include <nuttx/config.h>
|
|
|
|
|
2009-12-14 19:39:29 +01:00
|
|
|
#include <stdint.h>
|
2009-11-05 23:58:36 +01:00
|
|
|
#include <unistd.h>
|
2014-10-11 15:09:21 +02:00
|
|
|
#include <signal.h>
|
2014-10-11 16:29:26 +02:00
|
|
|
#include <assert.h>
|
2009-11-05 23:58:36 +01:00
|
|
|
#include <queue.h>
|
|
|
|
|
2016-02-14 15:17:46 +01:00
|
|
|
#include <nuttx/irq.h>
|
2009-11-05 23:58:36 +01:00
|
|
|
#include <nuttx/clock.h>
|
2017-10-06 18:15:01 +02:00
|
|
|
#include <nuttx/signal.h>
|
2014-10-10 14:22:51 +02:00
|
|
|
#include <nuttx/wqueue.h>
|
|
|
|
|
2014-10-11 00:24:50 +02:00
|
|
|
#include "wqueue/wqueue.h"
|
|
|
|
|
2009-11-05 23:58:36 +01:00
|
|
|
#ifdef CONFIG_SCHED_WORKQUEUE
|
|
|
|
|
|
|
|
/****************************************************************************
|
|
|
|
* Pre-processor Definitions
|
|
|
|
****************************************************************************/
|
|
|
|
|
2014-10-10 20:27:11 +02:00
|
|
|
/* Use CLOCK_MONOTONIC if it is available. CLOCK_REALTIME can cause bad
|
|
|
|
* delays if the time is changed.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifdef CONFIG_CLOCK_MONOTONIC
|
|
|
|
# define WORK_CLOCK CLOCK_MONOTONIC
|
|
|
|
#else
|
|
|
|
# define WORK_CLOCK CLOCK_REALTIME
|
|
|
|
#endif
|
|
|
|
|
2018-08-25 22:58:07 +02:00
|
|
|
#ifdef CONFIG_SYSTEM_TIME64
|
|
|
|
# define WORK_DELAY_MAX UINT64_MAX
|
|
|
|
#else
|
|
|
|
# define WORK_DELAY_MAX UINT32_MAX
|
|
|
|
#endif
|
|
|
|
|
2014-10-10 21:21:37 +02:00
|
|
|
#ifndef MIN
|
|
|
|
# define MIN(a,b) ((a) < (b) ? (a) : (b))
|
|
|
|
#endif
|
2014-10-10 20:27:11 +02:00
|
|
|
|
2014-10-10 14:22:51 +02:00
|
|
|
/****************************************************************************
|
|
|
|
* Public Functions
|
|
|
|
****************************************************************************/
|
|
|
|
|
2009-11-05 23:58:36 +01:00
|
|
|
/****************************************************************************
|
2012-09-04 02:54:09 +02:00
|
|
|
* Name: work_process
|
2009-11-05 23:58:36 +01:00
|
|
|
*
|
|
|
|
* Description:
|
2014-10-10 14:22:51 +02:00
|
|
|
* This is the logic that performs actions placed on any work list. This
|
|
|
|
* logic is the common underlying logic to all work queues. This logic is
|
|
|
|
* part of the internal implementation of each work queue; it should not
|
|
|
|
* be called from application level logic.
|
2009-11-05 23:58:36 +01:00
|
|
|
*
|
2018-02-01 17:00:02 +01:00
|
|
|
* Input Parameters:
|
2012-09-04 02:54:09 +02:00
|
|
|
* wqueue - Describes the work queue to be processed
|
2009-11-05 23:58:36 +01:00
|
|
|
*
|
|
|
|
* Returned Value:
|
2012-09-04 02:54:09 +02:00
|
|
|
* None
|
2009-11-05 23:58:36 +01:00
|
|
|
*
|
|
|
|
****************************************************************************/
|
|
|
|
|
2018-08-25 22:58:07 +02:00
|
|
|
void work_process(FAR struct kwork_wqueue_s *wqueue, int wndx)
|
2009-11-05 23:58:36 +01:00
|
|
|
{
|
|
|
|
volatile FAR struct work_s *work;
|
2009-11-06 14:42:49 +01:00
|
|
|
worker_t worker;
|
2012-09-04 02:54:09 +02:00
|
|
|
irqstate_t flags;
|
2009-11-06 14:42:49 +01:00
|
|
|
FAR void *arg;
|
2018-06-16 20:16:13 +02:00
|
|
|
clock_t elapsed;
|
|
|
|
clock_t remaining;
|
|
|
|
clock_t stick;
|
|
|
|
clock_t ctick;
|
|
|
|
clock_t next;
|
2009-11-05 23:58:36 +01:00
|
|
|
|
2012-09-04 02:54:09 +02:00
|
|
|
/* Then process queued work. We need to keep interrupts disabled while
|
|
|
|
* we process items in the work list.
|
|
|
|
*/
|
2009-11-05 23:58:36 +01:00
|
|
|
|
2018-08-25 22:58:07 +02:00
|
|
|
next = WORK_DELAY_MAX;
|
2016-02-14 15:17:46 +01:00
|
|
|
flags = enter_critical_section();
|
2014-10-10 20:27:11 +02:00
|
|
|
|
2018-08-25 22:58:07 +02:00
|
|
|
/* Get the time that we started processing the queue in clock ticks. */
|
2014-10-10 20:27:11 +02:00
|
|
|
|
|
|
|
stick = clock_systimer();
|
|
|
|
|
|
|
|
/* And check each entry in the work queue. Since we have disabled
|
|
|
|
* interrupts we know: (1) we will not be suspended unless we do
|
|
|
|
* so ourselves, and (2) there will be no changes to the work queue
|
|
|
|
*/
|
|
|
|
|
|
|
|
work = (FAR struct work_s *)wqueue->q.head;
|
2019-08-24 22:42:14 +02:00
|
|
|
while (work != NULL)
|
2009-11-05 23:58:36 +01:00
|
|
|
{
|
2012-09-04 02:54:09 +02:00
|
|
|
/* Is this work ready? It is ready if there is no delay or if
|
|
|
|
* the delay has elapsed. qtime is the time that the work was added
|
|
|
|
* to the work queue. It will always be greater than or equal to
|
|
|
|
* zero. Therefore a delay of zero will always execute immediately.
|
2009-11-05 23:58:36 +01:00
|
|
|
*/
|
|
|
|
|
2014-10-10 20:27:11 +02:00
|
|
|
ctick = clock_systimer();
|
|
|
|
elapsed = ctick - work->qtime;
|
2012-09-04 02:54:09 +02:00
|
|
|
if (elapsed >= work->delay)
|
|
|
|
{
|
|
|
|
/* Remove the ready-to-execute work from the list */
|
2009-11-05 23:58:36 +01:00
|
|
|
|
2020-01-02 17:49:34 +01:00
|
|
|
dq_rem((struct dq_entry_s *)work, &wqueue->q);
|
2009-11-05 23:58:36 +01:00
|
|
|
|
2012-09-04 02:54:09 +02:00
|
|
|
/* Extract the work description from the entry (in case the work
|
|
|
|
* instance by the re-used after it has been de-queued).
|
|
|
|
*/
|
2009-11-05 23:58:36 +01:00
|
|
|
|
2012-09-04 02:54:09 +02:00
|
|
|
worker = work->worker;
|
|
|
|
|
2014-06-29 17:30:09 +02:00
|
|
|
/* Check for a race condition where the work may be nullified
|
|
|
|
* before it is removed from the queue.
|
|
|
|
*/
|
2012-09-04 02:54:09 +02:00
|
|
|
|
2014-06-29 17:30:09 +02:00
|
|
|
if (worker != NULL)
|
|
|
|
{
|
|
|
|
/* Extract the work argument (before re-enabling interrupts) */
|
2012-09-04 02:54:09 +02:00
|
|
|
|
2014-06-29 17:30:09 +02:00
|
|
|
arg = work->arg;
|
2012-09-04 02:54:09 +02:00
|
|
|
|
2014-06-29 17:30:09 +02:00
|
|
|
/* Mark the work as no longer being queued */
|
2009-11-05 23:58:36 +01:00
|
|
|
|
2014-06-29 17:30:09 +02:00
|
|
|
work->worker = NULL;
|
|
|
|
|
|
|
|
/* Do the work. Re-enable interrupts while the work is being
|
2014-10-10 22:52:04 +02:00
|
|
|
* performed... we don't have any idea how long this will take!
|
2014-06-29 17:30:09 +02:00
|
|
|
*/
|
|
|
|
|
2016-02-14 15:17:46 +01:00
|
|
|
leave_critical_section(flags);
|
2014-06-29 17:30:09 +02:00
|
|
|
worker(arg);
|
|
|
|
|
|
|
|
/* Now, unfortunately, since we re-enabled interrupts we don't
|
|
|
|
* know the state of the work list and we will have to start
|
|
|
|
* back at the head of the list.
|
|
|
|
*/
|
|
|
|
|
2016-02-14 15:17:46 +01:00
|
|
|
flags = enter_critical_section();
|
2014-06-29 17:30:09 +02:00
|
|
|
work = (FAR struct work_s *)wqueue->q.head;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* Cancelled.. Just move to the next work in the list with
|
|
|
|
* interrupts still disabled.
|
|
|
|
*/
|
2012-09-04 02:54:09 +02:00
|
|
|
|
2014-06-29 17:30:09 +02:00
|
|
|
work = (FAR struct work_s *)work->dq.flink;
|
|
|
|
}
|
2012-09-04 02:54:09 +02:00
|
|
|
}
|
2015-01-27 13:17:02 +01:00
|
|
|
else /* elapsed < work->delay */
|
2009-11-05 23:58:36 +01:00
|
|
|
{
|
2015-01-27 13:17:02 +01:00
|
|
|
/* This one is not ready.
|
2014-10-10 20:27:11 +02:00
|
|
|
*
|
2017-05-11 21:35:56 +02:00
|
|
|
* NOTE that elapsed is relative to the current time,
|
2014-10-10 20:27:11 +02:00
|
|
|
* not the time of beginning of this queue processing pass.
|
|
|
|
* So it may need an adjustment.
|
2009-11-06 14:42:49 +01:00
|
|
|
*/
|
2009-11-05 23:58:36 +01:00
|
|
|
|
2015-01-27 13:17:02 +01:00
|
|
|
elapsed += (ctick - stick);
|
|
|
|
if (elapsed > work->delay)
|
|
|
|
{
|
|
|
|
/* The delay has expired while we are processing */
|
|
|
|
|
|
|
|
elapsed = work->delay;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Will it be ready before the next scheduled wakeup interval? */
|
|
|
|
|
|
|
|
remaining = work->delay - elapsed;
|
2012-09-04 02:54:09 +02:00
|
|
|
if (remaining < next)
|
2009-11-06 14:42:49 +01:00
|
|
|
{
|
2012-09-04 02:54:09 +02:00
|
|
|
/* Yes.. Then schedule to wake up when the work is ready */
|
2009-11-05 23:58:36 +01:00
|
|
|
|
2012-09-04 02:54:09 +02:00
|
|
|
next = remaining;
|
|
|
|
}
|
2014-04-13 22:32:20 +02:00
|
|
|
|
2012-09-04 02:54:09 +02:00
|
|
|
/* Then try the next in the list. */
|
2009-11-05 23:58:36 +01:00
|
|
|
|
2012-09-04 02:54:09 +02:00
|
|
|
work = (FAR struct work_s *)work->dq.flink;
|
|
|
|
}
|
|
|
|
}
|
2009-11-05 23:58:36 +01:00
|
|
|
|
2018-08-25 22:58:07 +02:00
|
|
|
/* When multiple worker threads are created for this work queue, only
|
|
|
|
* thread 0 (wndx = 0) will monitor the unexpired works.
|
|
|
|
*
|
|
|
|
* Other worker threads (wndx > 0) just process no-delay or expired
|
|
|
|
* works, then sleep. The unexpired works are left in the queue. They
|
|
|
|
* will be handled by thread 0 when it finishes current work and iterate
|
|
|
|
* over the queue again.
|
2014-10-11 15:09:21 +02:00
|
|
|
*/
|
|
|
|
|
2018-08-25 22:58:07 +02:00
|
|
|
if (wndx > 0 || next == WORK_DELAY_MAX)
|
2015-10-08 03:59:14 +02:00
|
|
|
{
|
|
|
|
sigset_t set;
|
2009-11-05 23:58:36 +01:00
|
|
|
|
2015-10-08 03:59:14 +02:00
|
|
|
/* Wait indefinitely until signalled with SIGWORK */
|
2014-10-11 15:09:21 +02:00
|
|
|
|
2015-10-08 03:59:14 +02:00
|
|
|
sigemptyset(&set);
|
|
|
|
sigaddset(&set, SIGWORK);
|
2014-10-13 01:19:51 +02:00
|
|
|
|
2015-10-08 03:59:14 +02:00
|
|
|
wqueue->worker[wndx].busy = false;
|
2017-10-06 16:28:20 +02:00
|
|
|
DEBUGVERIFY(nxsig_waitinfo(&set, NULL));
|
2017-08-15 01:19:27 +02:00
|
|
|
wqueue->worker[wndx].busy = true;
|
2015-10-08 03:59:14 +02:00
|
|
|
}
|
|
|
|
else
|
2014-10-10 20:27:11 +02:00
|
|
|
{
|
2018-08-25 22:58:07 +02:00
|
|
|
/* Wait a while to check the work list. We will wait here until
|
|
|
|
* either the time elapses or until we are awakened by a signal.
|
|
|
|
* Interrupts will be re-enabled while we wait.
|
|
|
|
*/
|
2014-10-10 21:21:37 +02:00
|
|
|
|
2018-08-25 22:58:07 +02:00
|
|
|
wqueue->worker[wndx].busy = false;
|
|
|
|
nxsig_usleep(next * USEC_PER_TICK);
|
|
|
|
wqueue->worker[wndx].busy = true;
|
2014-10-10 20:27:11 +02:00
|
|
|
}
|
|
|
|
|
2016-02-14 15:17:46 +01:00
|
|
|
leave_critical_section(flags);
|
2012-09-04 02:54:09 +02:00
|
|
|
}
|
2010-05-26 14:34:59 +02:00
|
|
|
|
2009-11-05 23:58:36 +01:00
|
|
|
#endif /* CONFIG_SCHED_WORKQUEUE */
|