Daiki Kato / mbed-os-lychee

mbed-os for GR-LYCHEE

Dependents:   mbed-os-example-blinky-gr-lychee GR-Boads_Camera_sample GR-Boards_Audio_Recoder GR-Boads_Camera_DisplayApp ... more

hal/mbed_ticker_api.c@0:f782d9c66c49, 2018-02-02 (annotated)

Committer:
dkato
Date:
Fri Feb 02 05:42:23 2018 +0000
Revision:
0:f782d9c66c49
mbed-os for GR-LYCHEE

Who changed what in which revision?

UserRevisionLine numberNew contents of line
dkato 0:f782d9c66c49 1 /* mbed Microcontroller Library
dkato 0:f782d9c66c49 2 * Copyright (c) 2015 ARM Limited
dkato 0:f782d9c66c49 3 *
dkato 0:f782d9c66c49 4 * Licensed under the Apache License, Version 2.0 (the "License");
dkato 0:f782d9c66c49 5 * you may not use this file except in compliance with the License.
dkato 0:f782d9c66c49 6 * You may obtain a copy of the License at
dkato 0:f782d9c66c49 7 *
dkato 0:f782d9c66c49 8 * http://www.apache.org/licenses/LICENSE-2.0
dkato 0:f782d9c66c49 9 *
dkato 0:f782d9c66c49 10 * Unless required by applicable law or agreed to in writing, software
dkato 0:f782d9c66c49 11 * distributed under the License is distributed on an "AS IS" BASIS,
dkato 0:f782d9c66c49 12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
dkato 0:f782d9c66c49 13 * See the License for the specific language governing permissions and
dkato 0:f782d9c66c49 14 * limitations under the License.
dkato 0:f782d9c66c49 15 */
dkato 0:f782d9c66c49 16 #include <stddef.h>
dkato 0:f782d9c66c49 17 #include "hal/ticker_api.h"
dkato 0:f782d9c66c49 18 #include "platform/mbed_critical.h"
dkato 0:f782d9c66c49 19
dkato 0:f782d9c66c49 20 void ticker_set_handler(const ticker_data_t *const data, ticker_event_handler handler) {
dkato 0:f782d9c66c49 21 data->interface->init();
dkato 0:f782d9c66c49 22
dkato 0:f782d9c66c49 23 data->queue->event_handler = handler;
dkato 0:f782d9c66c49 24 }
dkato 0:f782d9c66c49 25
dkato 0:f782d9c66c49 26 void ticker_irq_handler(const ticker_data_t *const data) {
dkato 0:f782d9c66c49 27 data->interface->clear_interrupt();
dkato 0:f782d9c66c49 28
dkato 0:f782d9c66c49 29 /* Go through all the pending TimerEvents */
dkato 0:f782d9c66c49 30 while (1) {
dkato 0:f782d9c66c49 31 if (data->queue->head == NULL) {
dkato 0:f782d9c66c49 32 // There are no more TimerEvents left, so disable matches.
dkato 0:f782d9c66c49 33 data->interface->disable_interrupt();
dkato 0:f782d9c66c49 34 return;
dkato 0:f782d9c66c49 35 }
dkato 0:f782d9c66c49 36
dkato 0:f782d9c66c49 37 if ((int)(data->queue->head->timestamp - data->interface->read()) <= 0) {
dkato 0:f782d9c66c49 38 // This event was in the past:
dkato 0:f782d9c66c49 39 // point to the following one and execute its handler
dkato 0:f782d9c66c49 40 ticker_event_t *p = data->queue->head;
dkato 0:f782d9c66c49 41 data->queue->head = data->queue->head->next;
dkato 0:f782d9c66c49 42 if (data->queue->event_handler != NULL) {
dkato 0:f782d9c66c49 43 (*data->queue->event_handler)(p->id); // NOTE: the handler can set new events
dkato 0:f782d9c66c49 44 }
dkato 0:f782d9c66c49 45 /* Note: We continue back to examining the head because calling the
dkato 0:f782d9c66c49 46 * event handler may have altered the chain of pending events. */
dkato 0:f782d9c66c49 47 } else {
dkato 0:f782d9c66c49 48 // This event and the following ones in the list are in the future:
dkato 0:f782d9c66c49 49 // set it as next interrupt and return
dkato 0:f782d9c66c49 50 data->interface->set_interrupt(data->queue->head->timestamp);
dkato 0:f782d9c66c49 51 return;
dkato 0:f782d9c66c49 52 }
dkato 0:f782d9c66c49 53 }
dkato 0:f782d9c66c49 54 }
dkato 0:f782d9c66c49 55
dkato 0:f782d9c66c49 56 void ticker_insert_event(const ticker_data_t *const data, ticker_event_t *obj, timestamp_t timestamp, uint32_t id) {
dkato 0:f782d9c66c49 57 /* disable interrupts for the duration of the function */
dkato 0:f782d9c66c49 58 core_util_critical_section_enter();
dkato 0:f782d9c66c49 59
dkato 0:f782d9c66c49 60 // initialise our data
dkato 0:f782d9c66c49 61 obj->timestamp = timestamp;
dkato 0:f782d9c66c49 62 obj->id = id;
dkato 0:f782d9c66c49 63
dkato 0:f782d9c66c49 64 /* Go through the list until we either reach the end, or find
dkato 0:f782d9c66c49 65 an element this should come before (which is possibly the
dkato 0:f782d9c66c49 66 head). */
dkato 0:f782d9c66c49 67 ticker_event_t *prev = NULL, *p = data->queue->head;
dkato 0:f782d9c66c49 68 while (p != NULL) {
dkato 0:f782d9c66c49 69 /* check if we come before p */
dkato 0:f782d9c66c49 70 if ((int)(timestamp - p->timestamp) < 0) {
dkato 0:f782d9c66c49 71 break;
dkato 0:f782d9c66c49 72 }
dkato 0:f782d9c66c49 73 /* go to the next element */
dkato 0:f782d9c66c49 74 prev = p;
dkato 0:f782d9c66c49 75 p = p->next;
dkato 0:f782d9c66c49 76 }
dkato 0:f782d9c66c49 77 /* if prev is NULL we're at the head */
dkato 0:f782d9c66c49 78 if (prev == NULL) {
dkato 0:f782d9c66c49 79 data->queue->head = obj;
dkato 0:f782d9c66c49 80 data->interface->set_interrupt(timestamp);
dkato 0:f782d9c66c49 81 } else {
dkato 0:f782d9c66c49 82 prev->next = obj;
dkato 0:f782d9c66c49 83 }
dkato 0:f782d9c66c49 84 /* if we're at the end p will be NULL, which is correct */
dkato 0:f782d9c66c49 85 obj->next = p;
dkato 0:f782d9c66c49 86
dkato 0:f782d9c66c49 87 core_util_critical_section_exit();
dkato 0:f782d9c66c49 88 }
dkato 0:f782d9c66c49 89
dkato 0:f782d9c66c49 90 void ticker_remove_event(const ticker_data_t *const data, ticker_event_t *obj) {
dkato 0:f782d9c66c49 91 core_util_critical_section_enter();
dkato 0:f782d9c66c49 92
dkato 0:f782d9c66c49 93 // remove this object from the list
dkato 0:f782d9c66c49 94 if (data->queue->head == obj) {
dkato 0:f782d9c66c49 95 // first in the list, so just drop me
dkato 0:f782d9c66c49 96 data->queue->head = obj->next;
dkato 0:f782d9c66c49 97 if (data->queue->head == NULL) {
dkato 0:f782d9c66c49 98 data->interface->disable_interrupt();
dkato 0:f782d9c66c49 99 } else {
dkato 0:f782d9c66c49 100 data->interface->set_interrupt(data->queue->head->timestamp);
dkato 0:f782d9c66c49 101 }
dkato 0:f782d9c66c49 102 } else {
dkato 0:f782d9c66c49 103 // find the object before me, then drop me
dkato 0:f782d9c66c49 104 ticker_event_t* p = data->queue->head;
dkato 0:f782d9c66c49 105 while (p != NULL) {
dkato 0:f782d9c66c49 106 if (p->next == obj) {
dkato 0:f782d9c66c49 107 p->next = obj->next;
dkato 0:f782d9c66c49 108 break;
dkato 0:f782d9c66c49 109 }
dkato 0:f782d9c66c49 110 p = p->next;
dkato 0:f782d9c66c49 111 }
dkato 0:f782d9c66c49 112 }
dkato 0:f782d9c66c49 113
dkato 0:f782d9c66c49 114 core_util_critical_section_exit();
dkato 0:f782d9c66c49 115 }
dkato 0:f782d9c66c49 116
dkato 0:f782d9c66c49 117 timestamp_t ticker_read(const ticker_data_t *const data)
dkato 0:f782d9c66c49 118 {
dkato 0:f782d9c66c49 119 return data->interface->read();
dkato 0:f782d9c66c49 120 }
dkato 0:f782d9c66c49 121
dkato 0:f782d9c66c49 122 int ticker_get_next_timestamp(const ticker_data_t *const data, timestamp_t *timestamp)
dkato 0:f782d9c66c49 123 {
dkato 0:f782d9c66c49 124 int ret = 0;
dkato 0:f782d9c66c49 125
dkato 0:f782d9c66c49 126 /* if head is NULL, there are no pending events */
dkato 0:f782d9c66c49 127 core_util_critical_section_enter();
dkato 0:f782d9c66c49 128 if (data->queue->head != NULL) {
dkato 0:f782d9c66c49 129 *timestamp = data->queue->head->timestamp;
dkato 0:f782d9c66c49 130 ret = 1;
dkato 0:f782d9c66c49 131 }
dkato 0:f782d9c66c49 132 core_util_critical_section_exit();
dkato 0:f782d9c66c49 133
dkato 0:f782d9c66c49 134 return ret;
dkato 0:f782d9c66c49 135 }