テスト用です。

Dependencies:   mbed

Committer:
jksoft
Date:
Tue Oct 11 11:09:42 2016 +0000
Revision:
0:8468a4403fea
SB??ver;

Who changed what in which revision?

UserRevisionLine numberNew contents of line
jksoft 0:8468a4403fea 1 /* Copyright (c) 2012 Nordic Semiconductor. All Rights Reserved.
jksoft 0:8468a4403fea 2 *
jksoft 0:8468a4403fea 3 * The information contained herein is property of Nordic Semiconductor ASA.
jksoft 0:8468a4403fea 4 * Terms and conditions of usage are described in detail in NORDIC
jksoft 0:8468a4403fea 5 * SEMICONDUCTOR STANDARD SOFTWARE LICENSE AGREEMENT.
jksoft 0:8468a4403fea 6 *
jksoft 0:8468a4403fea 7 * Licensees are granted free, non-transferable use of the information. NO
jksoft 0:8468a4403fea 8 * WARRANTY of ANY KIND is provided. This heading must NOT be removed from
jksoft 0:8468a4403fea 9 * the file.
jksoft 0:8468a4403fea 10 *
jksoft 0:8468a4403fea 11 */
jksoft 0:8468a4403fea 12
jksoft 0:8468a4403fea 13 #include "app_scheduler.h"
jksoft 0:8468a4403fea 14 #include <stdlib.h>
jksoft 0:8468a4403fea 15 #include <stdint.h>
jksoft 0:8468a4403fea 16 #include <string.h>
jksoft 0:8468a4403fea 17 #include "nrf_soc.h"
jksoft 0:8468a4403fea 18 #include "nrf_assert.h"
jksoft 0:8468a4403fea 19 #include "app_util.h"
jksoft 0:8468a4403fea 20 #include "app_util_platform.h"
jksoft 0:8468a4403fea 21
jksoft 0:8468a4403fea 22 /**@brief Structure for holding a scheduled event header. */
jksoft 0:8468a4403fea 23 typedef struct
jksoft 0:8468a4403fea 24 {
jksoft 0:8468a4403fea 25 app_sched_event_handler_t handler; /**< Pointer to event handler to receive the event. */
jksoft 0:8468a4403fea 26 uint16_t event_data_size; /**< Size of event data. */
jksoft 0:8468a4403fea 27 } event_header_t;
jksoft 0:8468a4403fea 28
jksoft 0:8468a4403fea 29 STATIC_ASSERT(sizeof(event_header_t) <= APP_SCHED_EVENT_HEADER_SIZE);
jksoft 0:8468a4403fea 30
jksoft 0:8468a4403fea 31 static event_header_t * m_queue_event_headers; /**< Array for holding the queue event headers. */
jksoft 0:8468a4403fea 32 static uint8_t * m_queue_event_data; /**< Array for holding the queue event data. */
jksoft 0:8468a4403fea 33 static volatile uint8_t m_queue_start_index; /**< Index of queue entry at the start of the queue. */
jksoft 0:8468a4403fea 34 static volatile uint8_t m_queue_end_index; /**< Index of queue entry at the end of the queue. */
jksoft 0:8468a4403fea 35 static uint16_t m_queue_event_size; /**< Maximum event size in queue. */
jksoft 0:8468a4403fea 36 static uint16_t m_queue_size; /**< Number of queue entries. */
jksoft 0:8468a4403fea 37
jksoft 0:8468a4403fea 38 /**@brief Macro for checking if a queue is full. */
jksoft 0:8468a4403fea 39 #define APP_SCHED_QUEUE_FULL() (next_index(m_queue_end_index) == m_queue_start_index)
jksoft 0:8468a4403fea 40
jksoft 0:8468a4403fea 41 /**@brief Macro for checking if a queue is empty. */
jksoft 0:8468a4403fea 42 #define APP_SCHED_QUEUE_EMPTY() (m_queue_end_index == m_queue_start_index)
jksoft 0:8468a4403fea 43
jksoft 0:8468a4403fea 44
jksoft 0:8468a4403fea 45 /**@brief Function for incrementing a queue index, and handle wrap-around.
jksoft 0:8468a4403fea 46 *
jksoft 0:8468a4403fea 47 * @param[in] index Old index.
jksoft 0:8468a4403fea 48 *
jksoft 0:8468a4403fea 49 * @return New (incremented) index.
jksoft 0:8468a4403fea 50 */
jksoft 0:8468a4403fea 51 static __INLINE uint8_t next_index(uint8_t index)
jksoft 0:8468a4403fea 52 {
jksoft 0:8468a4403fea 53 return (index < m_queue_size) ? (index + 1) : 0;
jksoft 0:8468a4403fea 54 }
jksoft 0:8468a4403fea 55
jksoft 0:8468a4403fea 56
jksoft 0:8468a4403fea 57 uint32_t app_sched_init(uint16_t event_size, uint16_t queue_size, void * p_event_buffer)
jksoft 0:8468a4403fea 58 {
jksoft 0:8468a4403fea 59 uint16_t data_start_index = (queue_size + 1) * sizeof(event_header_t);
jksoft 0:8468a4403fea 60
jksoft 0:8468a4403fea 61 // Check that buffer is correctly aligned
jksoft 0:8468a4403fea 62 if (!is_word_aligned(p_event_buffer))
jksoft 0:8468a4403fea 63 {
jksoft 0:8468a4403fea 64 return NRF_ERROR_INVALID_PARAM;
jksoft 0:8468a4403fea 65 }
jksoft 0:8468a4403fea 66
jksoft 0:8468a4403fea 67 // Initialize event scheduler
jksoft 0:8468a4403fea 68 m_queue_event_headers = p_event_buffer;
jksoft 0:8468a4403fea 69 m_queue_event_data = &((uint8_t *)p_event_buffer)[data_start_index];
jksoft 0:8468a4403fea 70 m_queue_end_index = 0;
jksoft 0:8468a4403fea 71 m_queue_start_index = 0;
jksoft 0:8468a4403fea 72 m_queue_event_size = event_size;
jksoft 0:8468a4403fea 73 m_queue_size = queue_size;
jksoft 0:8468a4403fea 74
jksoft 0:8468a4403fea 75 return NRF_SUCCESS;
jksoft 0:8468a4403fea 76 }
jksoft 0:8468a4403fea 77
jksoft 0:8468a4403fea 78
jksoft 0:8468a4403fea 79 uint32_t app_sched_event_put(void * p_event_data,
jksoft 0:8468a4403fea 80 uint16_t event_data_size,
jksoft 0:8468a4403fea 81 app_sched_event_handler_t handler)
jksoft 0:8468a4403fea 82 {
jksoft 0:8468a4403fea 83 uint32_t err_code;
jksoft 0:8468a4403fea 84
jksoft 0:8468a4403fea 85 if (event_data_size <= m_queue_event_size)
jksoft 0:8468a4403fea 86 {
jksoft 0:8468a4403fea 87 uint16_t event_index = 0xFFFF;
jksoft 0:8468a4403fea 88
jksoft 0:8468a4403fea 89 CRITICAL_REGION_ENTER();
jksoft 0:8468a4403fea 90
jksoft 0:8468a4403fea 91 if (!APP_SCHED_QUEUE_FULL())
jksoft 0:8468a4403fea 92 {
jksoft 0:8468a4403fea 93 event_index = m_queue_end_index;
jksoft 0:8468a4403fea 94 m_queue_end_index = next_index(m_queue_end_index);
jksoft 0:8468a4403fea 95 }
jksoft 0:8468a4403fea 96
jksoft 0:8468a4403fea 97 CRITICAL_REGION_EXIT();
jksoft 0:8468a4403fea 98
jksoft 0:8468a4403fea 99 if (event_index != 0xFFFF)
jksoft 0:8468a4403fea 100 {
jksoft 0:8468a4403fea 101 // NOTE: This can be done outside the critical region since the event consumer will
jksoft 0:8468a4403fea 102 // always be called from the main loop, and will thus never interrupt this code.
jksoft 0:8468a4403fea 103 m_queue_event_headers[event_index].handler = handler;
jksoft 0:8468a4403fea 104 if ((p_event_data != NULL) && (event_data_size > 0))
jksoft 0:8468a4403fea 105 {
jksoft 0:8468a4403fea 106 memcpy(&m_queue_event_data[event_index * m_queue_event_size],
jksoft 0:8468a4403fea 107 p_event_data,
jksoft 0:8468a4403fea 108 event_data_size);
jksoft 0:8468a4403fea 109 m_queue_event_headers[event_index].event_data_size = event_data_size;
jksoft 0:8468a4403fea 110 }
jksoft 0:8468a4403fea 111 else
jksoft 0:8468a4403fea 112 {
jksoft 0:8468a4403fea 113 m_queue_event_headers[event_index].event_data_size = 0;
jksoft 0:8468a4403fea 114 }
jksoft 0:8468a4403fea 115
jksoft 0:8468a4403fea 116 err_code = NRF_SUCCESS;
jksoft 0:8468a4403fea 117 }
jksoft 0:8468a4403fea 118 else
jksoft 0:8468a4403fea 119 {
jksoft 0:8468a4403fea 120 err_code = NRF_ERROR_NO_MEM;
jksoft 0:8468a4403fea 121 }
jksoft 0:8468a4403fea 122 }
jksoft 0:8468a4403fea 123 else
jksoft 0:8468a4403fea 124 {
jksoft 0:8468a4403fea 125 err_code = NRF_ERROR_INVALID_LENGTH;
jksoft 0:8468a4403fea 126 }
jksoft 0:8468a4403fea 127
jksoft 0:8468a4403fea 128 return err_code;
jksoft 0:8468a4403fea 129 }
jksoft 0:8468a4403fea 130
jksoft 0:8468a4403fea 131
jksoft 0:8468a4403fea 132 /**@brief Function for reading the next event from specified event queue.
jksoft 0:8468a4403fea 133 *
jksoft 0:8468a4403fea 134 * @param[out] pp_event_data Pointer to pointer to event data.
jksoft 0:8468a4403fea 135 * @param[out] p_event_data_size Pointer to size of event data.
jksoft 0:8468a4403fea 136 * @param[out] p_event_handler Pointer to event handler function pointer.
jksoft 0:8468a4403fea 137 *
jksoft 0:8468a4403fea 138 * @return NRF_SUCCESS if new event, NRF_ERROR_NOT_FOUND if event queue is empty.
jksoft 0:8468a4403fea 139 */
jksoft 0:8468a4403fea 140 static uint32_t app_sched_event_get(void ** pp_event_data,
jksoft 0:8468a4403fea 141 uint16_t * p_event_data_size,
jksoft 0:8468a4403fea 142 app_sched_event_handler_t * p_event_handler)
jksoft 0:8468a4403fea 143 {
jksoft 0:8468a4403fea 144 uint32_t err_code = NRF_ERROR_NOT_FOUND;
jksoft 0:8468a4403fea 145
jksoft 0:8468a4403fea 146 if (!APP_SCHED_QUEUE_EMPTY())
jksoft 0:8468a4403fea 147 {
jksoft 0:8468a4403fea 148 uint16_t event_index;
jksoft 0:8468a4403fea 149
jksoft 0:8468a4403fea 150 // NOTE: There is no need for a critical region here, as this function will only be called
jksoft 0:8468a4403fea 151 // from app_sched_execute() from inside the main loop, so it will never interrupt
jksoft 0:8468a4403fea 152 // app_sched_event_put(). Also, updating of (i.e. writing to) the start index will be
jksoft 0:8468a4403fea 153 // an atomic operation.
jksoft 0:8468a4403fea 154 event_index = m_queue_start_index;
jksoft 0:8468a4403fea 155 m_queue_start_index = next_index(m_queue_start_index);
jksoft 0:8468a4403fea 156
jksoft 0:8468a4403fea 157 *pp_event_data = &m_queue_event_data[event_index * m_queue_event_size];
jksoft 0:8468a4403fea 158 *p_event_data_size = m_queue_event_headers[event_index].event_data_size;
jksoft 0:8468a4403fea 159 *p_event_handler = m_queue_event_headers[event_index].handler;
jksoft 0:8468a4403fea 160
jksoft 0:8468a4403fea 161 err_code = NRF_SUCCESS;
jksoft 0:8468a4403fea 162 }
jksoft 0:8468a4403fea 163
jksoft 0:8468a4403fea 164 return err_code;
jksoft 0:8468a4403fea 165 }
jksoft 0:8468a4403fea 166
jksoft 0:8468a4403fea 167
jksoft 0:8468a4403fea 168 void app_sched_execute(void)
jksoft 0:8468a4403fea 169 {
jksoft 0:8468a4403fea 170 void * p_event_data;
jksoft 0:8468a4403fea 171 uint16_t event_data_size;
jksoft 0:8468a4403fea 172 app_sched_event_handler_t event_handler;
jksoft 0:8468a4403fea 173
jksoft 0:8468a4403fea 174 // Get next event (if any), and execute handler
jksoft 0:8468a4403fea 175 while ((app_sched_event_get(&p_event_data, &event_data_size, &event_handler) == NRF_SUCCESS))
jksoft 0:8468a4403fea 176 {
jksoft 0:8468a4403fea 177 event_handler(p_event_data, event_data_size);
jksoft 0:8468a4403fea 178 }
jksoft 0:8468a4403fea 179 }