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