├── .gitignore ├── LICENSE ├── README.md ├── timer.c └── timer_list.c /.gitignore: -------------------------------------------------------------------------------- 1 | # Object files 2 | *.o 3 | *.ko 4 | *.obj 5 | *.elf 6 | 7 | # Precompiled Headers 8 | *.gch 9 | *.pch 10 | 11 | # Libraries 12 | *.lib 13 | *.a 14 | *.la 15 | *.lo 16 | 17 | # Shared objects (inc. Windows DLLs) 18 | *.dll 19 | *.so 20 | *.so.* 21 | *.dylib 22 | 23 | # Executables 24 | *.exe 25 | *.out 26 | *.app 27 | *.i*86 28 | *.x86_64 29 | *.hex 30 | 31 | # Debug files 32 | *.dSYM/ 33 | *.su 34 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | Apache License 2 | Version 2.0, January 2004 3 | http://www.apache.org/licenses/ 4 | 5 | TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 6 | 7 | 1. Definitions. 8 | 9 | "License" shall mean the terms and conditions for use, reproduction, 10 | and distribution as defined by Sections 1 through 9 of this document. 11 | 12 | "Licensor" shall mean the copyright owner or entity authorized by 13 | the copyright owner that is granting the License. 14 | 15 | "Legal Entity" shall mean the union of the acting entity and all 16 | other entities that control, are controlled by, or are under common 17 | control with that entity. For the purposes of this definition, 18 | "control" means (i) the power, direct or indirect, to cause the 19 | direction or management of such entity, whether by contract or 20 | otherwise, or (ii) ownership of fifty percent (50%) or more of the 21 | outstanding shares, or (iii) beneficial ownership of such entity. 22 | 23 | "You" (or "Your") shall mean an individual or Legal Entity 24 | exercising permissions granted by this License. 25 | 26 | "Source" form shall mean the preferred form for making modifications, 27 | including but not limited to software source code, documentation 28 | source, and configuration files. 29 | 30 | "Object" form shall mean any form resulting from mechanical 31 | transformation or translation of a Source form, including but 32 | not limited to compiled object code, generated documentation, 33 | and conversions to other media types. 34 | 35 | "Work" shall mean the work of authorship, whether in Source or 36 | Object form, made available under the License, as indicated by a 37 | copyright notice that is included in or attached to the work 38 | (an example is provided in the Appendix below). 39 | 40 | "Derivative Works" shall mean any work, whether in Source or Object 41 | form, that is based on (or derived from) the Work and for which the 42 | editorial revisions, annotations, elaborations, or other modifications 43 | represent, as a whole, an original work of authorship. For the purposes 44 | of this License, Derivative Works shall not include works that remain 45 | separable from, or merely link (or bind by name) to the interfaces of, 46 | the Work and Derivative Works thereof. 47 | 48 | "Contribution" shall mean any work of authorship, including 49 | the original version of the Work and any modifications or additions 50 | to that Work or Derivative Works thereof, that is intentionally 51 | submitted to Licensor for inclusion in the Work by the copyright owner 52 | or by an individual or Legal Entity authorized to submit on behalf of 53 | the copyright owner. For the purposes of this definition, "submitted" 54 | means any form of electronic, verbal, or written communication sent 55 | to the Licensor or its representatives, including but not limited to 56 | communication on electronic mailing lists, source code control systems, 57 | and issue tracking systems that are managed by, or on behalf of, the 58 | Licensor for the purpose of discussing and improving the Work, but 59 | excluding communication that is conspicuously marked or otherwise 60 | designated in writing by the copyright owner as "Not a Contribution." 61 | 62 | "Contributor" shall mean Licensor and any individual or Legal Entity 63 | on behalf of whom a Contribution has been received by Licensor and 64 | subsequently incorporated within the Work. 65 | 66 | 2. Grant of Copyright License. Subject to the terms and conditions of 67 | this License, each Contributor hereby grants to You a perpetual, 68 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 69 | copyright license to reproduce, prepare Derivative Works of, 70 | publicly display, publicly perform, sublicense, and distribute the 71 | Work and such Derivative Works in Source or Object form. 72 | 73 | 3. Grant of Patent License. Subject to the terms and conditions of 74 | this License, each Contributor hereby grants to You a perpetual, 75 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 76 | (except as stated in this section) patent license to make, have made, 77 | use, offer to sell, sell, import, and otherwise transfer the Work, 78 | where such license applies only to those patent claims licensable 79 | by such Contributor that are necessarily infringed by their 80 | Contribution(s) alone or by combination of their Contribution(s) 81 | with the Work to which such Contribution(s) was submitted. If You 82 | institute patent litigation against any entity (including a 83 | cross-claim or counterclaim in a lawsuit) alleging that the Work 84 | or a Contribution incorporated within the Work constitutes direct 85 | or contributory patent infringement, then any patent licenses 86 | granted to You under this License for that Work shall terminate 87 | as of the date such litigation is filed. 88 | 89 | 4. Redistribution. You may reproduce and distribute copies of the 90 | Work or Derivative Works thereof in any medium, with or without 91 | modifications, and in Source or Object form, provided that You 92 | meet the following conditions: 93 | 94 | (a) You must give any other recipients of the Work or 95 | Derivative Works a copy of this License; and 96 | 97 | (b) You must cause any modified files to carry prominent notices 98 | stating that You changed the files; and 99 | 100 | (c) You must retain, in the Source form of any Derivative Works 101 | that You distribute, all copyright, patent, trademark, and 102 | attribution notices from the Source form of the Work, 103 | excluding those notices that do not pertain to any part of 104 | the Derivative Works; and 105 | 106 | (d) If the Work includes a "NOTICE" text file as part of its 107 | distribution, then any Derivative Works that You distribute must 108 | include a readable copy of the attribution notices contained 109 | within such NOTICE file, excluding those notices that do not 110 | pertain to any part of the Derivative Works, in at least one 111 | of the following places: within a NOTICE text file distributed 112 | as part of the Derivative Works; within the Source form or 113 | documentation, if provided along with the Derivative Works; or, 114 | within a display generated by the Derivative Works, if and 115 | wherever such third-party notices normally appear. The contents 116 | of the NOTICE file are for informational purposes only and 117 | do not modify the License. You may add Your own attribution 118 | notices within Derivative Works that You distribute, alongside 119 | or as an addendum to the NOTICE text from the Work, provided 120 | that such additional attribution notices cannot be construed 121 | as modifying the License. 122 | 123 | You may add Your own copyright statement to Your modifications and 124 | may provide additional or different license terms and conditions 125 | for use, reproduction, or distribution of Your modifications, or 126 | for any such Derivative Works as a whole, provided Your use, 127 | reproduction, and distribution of the Work otherwise complies with 128 | the conditions stated in this License. 129 | 130 | 5. Submission of Contributions. Unless You explicitly state otherwise, 131 | any Contribution intentionally submitted for inclusion in the Work 132 | by You to the Licensor shall be under the terms and conditions of 133 | this License, without any additional terms or conditions. 134 | Notwithstanding the above, nothing herein shall supersede or modify 135 | the terms of any separate license agreement you may have executed 136 | with Licensor regarding such Contributions. 137 | 138 | 6. Trademarks. This License does not grant permission to use the trade 139 | names, trademarks, service marks, or product names of the Licensor, 140 | except as required for reasonable and customary use in describing the 141 | origin of the Work and reproducing the content of the NOTICE file. 142 | 143 | 7. Disclaimer of Warranty. Unless required by applicable law or 144 | agreed to in writing, Licensor provides the Work (and each 145 | Contributor provides its Contributions) on an "AS IS" BASIS, 146 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 147 | implied, including, without limitation, any warranties or conditions 148 | of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A 149 | PARTICULAR PURPOSE. You are solely responsible for determining the 150 | appropriateness of using or redistributing the Work and assume any 151 | risks associated with Your exercise of permissions under this License. 152 | 153 | 8. Limitation of Liability. In no event and under no legal theory, 154 | whether in tort (including negligence), contract, or otherwise, 155 | unless required by applicable law (such as deliberate and grossly 156 | negligent acts) or agreed to in writing, shall any Contributor be 157 | liable to You for damages, including any direct, indirect, special, 158 | incidental, or consequential damages of any character arising as a 159 | result of this License or out of the use or inability to use the 160 | Work (including but not limited to damages for loss of goodwill, 161 | work stoppage, computer failure or malfunction, or any and all 162 | other commercial damages or losses), even if such Contributor 163 | has been advised of the possibility of such damages. 164 | 165 | 9. Accepting Warranty or Additional Liability. While redistributing 166 | the Work or Derivative Works thereof, You may choose to offer, 167 | and charge a fee for, acceptance of support, warranty, indemnity, 168 | or other liability obligations and/or rights consistent with this 169 | License. However, in accepting such obligations, You may act only 170 | on Your own behalf and on Your sole responsibility, not on behalf 171 | of any other Contributor, and only if You agree to indemnify, 172 | defend, and hold each Contributor harmless for any liability 173 | incurred by, or claims asserted against, such Contributor by reason 174 | of your accepting any such warranty or additional liability. 175 | 176 | END OF TERMS AND CONDITIONS 177 | 178 | APPENDIX: How to apply the Apache License to your work. 179 | 180 | To apply the Apache License to your work, attach the following 181 | boilerplate notice, with the fields enclosed by brackets "{}" 182 | replaced with your own identifying information. (Don't include 183 | the brackets!) The text should be enclosed in the appropriate 184 | comment syntax for the file format. We also recommend that a 185 | file or class name and description of purpose be included on the 186 | same "printed page" as the copyright notice for easier 187 | identification within third-party archives. 188 | 189 | Copyright {yyyy} {name of copyright owner} 190 | 191 | Licensed under the Apache License, Version 2.0 (the "License"); 192 | you may not use this file except in compliance with the License. 193 | You may obtain a copy of the License at 194 | 195 | http://www.apache.org/licenses/LICENSE-2.0 196 | 197 | Unless required by applicable law or agreed to in writing, software 198 | distributed under the License is distributed on an "AS IS" BASIS, 199 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 200 | See the License for the specific language governing permissions and 201 | limitations under the License. 202 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # timer 2 | 嵌入式软件通用定时器,分别实现了数组和链表管理定时器. 3 | 4 | 将timer_sched();函数放入systick节拍中调度即可 5 | -------------------------------------------------------------------------------- /timer.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #define OS_TIMER_MAX 32 8 | 9 | struct timer_t 10 | { 11 | void (*pfun)(void* para); 12 | unsigned int delay; 13 | unsigned int period; 14 | bool run; 15 | void* para; 16 | }; 17 | struct timer_t timer_list[OS_TIMER_MAX]; 18 | 19 | typedef uint8_t timer_id; 20 | 21 | void timer_init(void) 22 | { 23 | uint8_t index; 24 | 25 | for (index = 0; index < OS_TIMER_MAX; index++) 26 | { 27 | timer_list[index].pfun = NULL; 28 | } 29 | } 30 | 31 | timer_id timer_creat(void(*pFunction)(void* para), 32 | const unsigned int delay, 33 | const unsigned int period, 34 | bool run, 35 | void* para) 36 | { 37 | uint8_t index = 0; 38 | 39 | while ((timer_list[index].pfun != NULL) && (index < OS_TIMER_MAX)) 40 | { 41 | index++; 42 | } 43 | 44 | printf("time index %d\r\n",index); 45 | timer_list[index].pfun = pFunction; 46 | timer_list[index].delay = delay; 47 | timer_list[index].period = period; 48 | timer_list[index].run = run; 49 | timer_list[index].para = para; 50 | return index; 51 | } 52 | 53 | bool timer_delete(const timer_id index) 54 | { 55 | if(index >= OS_TIMER_MAX) return false; 56 | 57 | if (timer_list[index].pfun == NULL) 58 | { 59 | return false; 60 | } 61 | timer_list[index].pfun = NULL; 62 | timer_list[index].delay = 0; 63 | timer_list[index].period = 0; 64 | timer_list[index].run = false; 65 | timer_list[index].para = NULL; 66 | return true; 67 | } 68 | 69 | void timer_start(const timer_id index) 70 | { 71 | if(index >= OS_TIMER_MAX) return; 72 | 73 | timer_list[index].run = true; 74 | } 75 | 76 | void timer_stop(const timer_id index) 77 | { 78 | if(index >= OS_TIMER_MAX) return; 79 | 80 | timer_list[index].run = false; 81 | } 82 | 83 | void timer_sched(void) 84 | { 85 | uint8_t index; 86 | for (index = 0; index < OS_TIMER_MAX; index++) 87 | { 88 | if(timer_list[index].delay == 0) 89 | { 90 | if (timer_list[index].run) 91 | { 92 | (*timer_list[index].pfun)(timer_list[index].para); 93 | if (timer_list[index].period == 0) 94 | { 95 | timer_delete(index); 96 | } 97 | else timer_list[index].delay = timer_list[index].period; 98 | } 99 | } 100 | else 101 | { 102 | timer_list[index].delay -= 1; 103 | } 104 | } 105 | } 106 | 107 | void f1(void* para) 108 | {} 109 | 110 | void f2(void* para) 111 | {} 112 | 113 | void f3(void* para) 114 | {} 115 | 116 | 117 | int main() 118 | { 119 | printf("Hello world!\n"); 120 | 121 | timer_init(); 122 | 123 | timer_id t1 = timer_creat(f1, 0, 100, false, NULL); 124 | timer_id t2 = timer_creat(f2, 10, 200, false, NULL); 125 | timer_id t3 = timer_creat(f3, 20, 400, false, NULL); 126 | 127 | timer_sched(); 128 | 129 | timer_start(t1); 130 | timer_stop(t1); 131 | 132 | timer_delete(t1); 133 | timer_delete(t2); 134 | timer_delete(t3); 135 | 136 | return 0; 137 | } 138 | -------------------------------------------------------------------------------- /timer_list.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | 9 | typedef struct 10 | { 11 | void (*pfun)(void* para); 12 | uint16_t delay; 13 | uint16_t period; 14 | bool run; 15 | void* para; 16 | } timer_t; 17 | 18 | typedef struct timer_node 19 | { 20 | timer_t timer; 21 | struct timer_node *prev; 22 | struct timer_node *next; 23 | } timer_node,*timer_list; 24 | 25 | bool timer_list_init(timer_list *L) 26 | { 27 | *L=(timer_list)malloc(sizeof(timer_node)); 28 | if(*L) 29 | { 30 | (*L)->next=(*L)->prev=*L; 31 | (*L)->timer.pfun=NULL; 32 | (*L)->timer.delay=0; 33 | (*L)->timer.period=0; 34 | (*L)->timer.run=false; 35 | return true; 36 | } 37 | else 38 | return false; 39 | } 40 | 41 | bool timer_list_destory(timer_list *L) 42 | { 43 | timer_list q,p=(*L)->next; 44 | while(p!=*L) 45 | { 46 | q=p->next; 47 | free(p); 48 | p=q; 49 | } 50 | free(*L); 51 | *L=NULL; 52 | (*L)->timer.pfun=NULL; 53 | (*L)->timer.delay=0; 54 | (*L)->timer.period=0; 55 | (*L)->timer.run=false; 56 | return true; 57 | } 58 | 59 | bool timer_list_clear(timer_list L) 60 | { 61 | timer_list q,p=L->next; 62 | while(p!=L) 63 | { 64 | q=p->next; 65 | free(p); 66 | p=q; 67 | } 68 | L->next=L->prev=L; 69 | L->timer.pfun=NULL; 70 | L->timer.delay=0; 71 | L->timer.period=0; 72 | L->timer.run=false; 73 | return true; 74 | } 75 | 76 | bool timer_list_is_empty(timer_list L) 77 | { 78 | if(L->next==L&&L->prev==L) 79 | return true; 80 | else 81 | return false; 82 | } 83 | 84 | int timer_list_length(timer_list L) 85 | { 86 | int i=0; 87 | timer_list p=L->next; 88 | while(p!=L) 89 | { 90 | i++; 91 | p=p->next; 92 | } 93 | return i; 94 | } 95 | 96 | bool timer_list_get_item(timer_list L,int i,timer_t *e) 97 | { 98 | int j=1; 99 | timer_list p=L->next; 100 | while(p!=L&&jnext; 103 | j++; 104 | } 105 | if(p==L||j>i) 106 | return false; 107 | *e=p->timer; 108 | return true; 109 | } 110 | 111 | bool struct_compare(timer_t a, timer_t b) 112 | { 113 | return (*a.pfun==*b.pfun && 114 | a.delay==b.delay && 115 | a.period==b.period && 116 | a.run==b.run); 117 | } 118 | 119 | uint8_t timer_list_locate_item(timer_list L,timer_t e) 120 | { 121 | uint8_t i=0; 122 | timer_list p=L->next; 123 | while(p!=L) 124 | { 125 | i++; 126 | if(struct_compare(p->timer,e)) 127 | return i; 128 | p=p->next; 129 | } 130 | return 0; 131 | } 132 | 133 | timer_list timer_list_get_locate_p(timer_list L,int i) 134 | { 135 | int j; 136 | timer_list p=L; 137 | for(j=1; j<=i; j++) 138 | p=p->next; 139 | return p; 140 | } 141 | 142 | bool timer_list_get_locate_prev_item(timer_list L,timer_t cur_e,timer_t *pre_e) 143 | { 144 | timer_list p=L->next->next; 145 | while(p!=L) 146 | { 147 | if(struct_compare(p->timer,cur_e)) 148 | { 149 | *pre_e=p->prev->timer; 150 | return true; 151 | } 152 | p=p->next; 153 | } 154 | return false; 155 | } 156 | 157 | bool timer_list_get_next_item(timer_list L,timer_t cur_e,timer_t *next_e) 158 | { 159 | timer_list p=L->next->next; 160 | while(p!=L) 161 | { 162 | if(struct_compare(p->prev->timer,cur_e)) 163 | { 164 | *next_e=p->timer; 165 | return true; 166 | } 167 | p=p->next; 168 | } 169 | return false; 170 | } 171 | 172 | bool timer_list_insert(timer_list L,int i,timer_t e) 173 | { 174 | timer_list p,s; 175 | if(i<1||i>timer_list_length(L)+1) 176 | return false; 177 | p=timer_list_get_locate_p(L,i-1); 178 | if(!p) 179 | return false; 180 | s=(timer_list)malloc(sizeof(timer_node)); 181 | if(!s) 182 | return false; 183 | //s->timer=e; 184 | memcpy(&(s->timer),&e,sizeof(timer_t)); 185 | s->prev=p; 186 | s->next=p->next; 187 | p->next->prev=s; 188 | p->next=s; 189 | return true; 190 | } 191 | 192 | bool timer_list_delete(timer_list L,int i) 193 | { 194 | timer_list p; 195 | if(i<1||i>timer_list_length(L)) 196 | return false; 197 | p=timer_list_get_locate_p(L,i); 198 | if(!p) 199 | return false; 200 | //*e=p->timer; 201 | p->prev->next=p->next; 202 | p->next->prev=p->prev; 203 | free(p); 204 | return true; 205 | } 206 | 207 | bool timer_list_item_update(timer_list L,int i,timer_t t) 208 | { 209 | timer_list p; 210 | if(i<1||i>timer_list_length(L)) 211 | return false; 212 | p=timer_list_get_locate_p(L,i); 213 | if(!p) 214 | return false; 215 | p->timer=t; 216 | return true; 217 | } 218 | 219 | #if DEBUG 220 | void timer_list_traverse(timer_list L) 221 | { 222 | timer_list p=L->next; 223 | while(p!=L) 224 | { 225 | printf("%d ",(p->timer.delay)); 226 | p=p->next; 227 | } 228 | printf("\n"); 229 | } 230 | 231 | void timer_list_traverse_back(timer_list L) 232 | { 233 | timer_list p=L->prev; 234 | while(p!=L) 235 | { 236 | printf("%d ",(p->timer.delay)); 237 | p=p->prev; 238 | } 239 | printf("\n"); 240 | } 241 | #endif 242 | 243 | //测试实例 244 | 245 | timer_list l; 246 | 247 | bool timer_init(void) 248 | { 249 | return timer_list_init(&l); 250 | } 251 | 252 | timer_t timer_creat(void(*pFunction)(void* para), 253 | const uint16_t delay, 254 | const uint16_t period, 255 | const bool run, 256 | void* para) 257 | { 258 | timer_t t; 259 | t.pfun = pFunction; 260 | t.delay = delay; 261 | t.period = period; 262 | t.run = run; 263 | t.para = para; 264 | timer_list_insert(l,1,t); 265 | return l->timer; 266 | } 267 | 268 | 269 | bool timer_delete(const timer_t t) 270 | { 271 | uint8_t i =timer_list_locate_item(l,t); 272 | return timer_list_delete(l,i); 273 | } 274 | 275 | void timer_start(timer_t t) 276 | { 277 | uint8_t i =timer_list_locate_item(l,t); 278 | t.run=true; 279 | timer_list_item_update(l,i,t); 280 | } 281 | 282 | void timer_stop(timer_t t) 283 | { 284 | uint8_t i =timer_list_locate_item(l,t); 285 | t.run=false; 286 | timer_list_item_update(l,i,t); 287 | } 288 | 289 | 290 | void timer_sched() 291 | { 292 | timer_list p=l->next; 293 | while(p!=l) 294 | { 295 | printf("delay=%d\n",(p->timer.delay)); 296 | 297 | if(p->timer.delay == 0) 298 | { 299 | if (p->timer.run) 300 | { 301 | (*p->timer.pfun)(p->timer.para); 302 | 303 | if (p->timer.period == 0) 304 | { 305 | timer_delete(p->timer); 306 | } 307 | else p->timer.delay = p->timer.period; 308 | } 309 | } 310 | else 311 | { 312 | p->timer.delay -= 1; 313 | } 314 | p=p->next; 315 | } 316 | } 317 | 318 | void f1(void* para) 319 | {} 320 | 321 | void f2(void* para) 322 | {} 323 | 324 | void f3(void* para) 325 | {} 326 | 327 | 328 | int main() 329 | { 330 | printf("Hello world!\n"); 331 | 332 | timer_init(); 333 | 334 | timer_t t1=timer_creat(f1, 0, 100, false, NULL); 335 | timer_t t2=timer_creat(f2, 10, 200, false, NULL); 336 | timer_t t3=timer_creat(f3, 20, 400, false, NULL); 337 | 338 | timer_sched(); 339 | 340 | timer_delete(t1); 341 | timer_delete(t2); 342 | timer_delete(t3); 343 | 344 | return 0; 345 | } 346 | --------------------------------------------------------------------------------