mirror of
https://github.com/bluekitchen/btstack.git
synced 2025-03-28 08:37:22 +00:00
added basic run loop for embedded use
This commit is contained in:
parent
36c74a6d73
commit
0453d688d1
@ -64,7 +64,7 @@ AM_CONDITIONAL(HAVE_LIBUSB, [test "x$HAVE_LIBUSB" == "xyes"])
|
||||
echo
|
||||
echo "BTstack configured for HCI $HCI_TRANSPORT Transport"
|
||||
|
||||
RUN_LOOP_SOURCES=run_loop_posix.c
|
||||
RUN_LOOP_SOURCES="run_loop_posix.c run_loop_embedded.c"
|
||||
case "$host_os" in
|
||||
darwin*)
|
||||
RUN_LOOP_SOURCES="$RUN_LOOP_SOURCES run_loop_cocoa.m"
|
||||
|
@ -47,6 +47,7 @@
|
||||
static run_loop_t * the_run_loop = NULL;
|
||||
|
||||
extern run_loop_t run_loop_posix;
|
||||
extern run_loop_t run_loop_embedded;
|
||||
|
||||
#ifdef USE_COCOA_RUN_LOOP
|
||||
extern run_loop_t run_loop_cocoa;
|
||||
@ -115,6 +116,9 @@ void run_loop_init(RUN_LOOP_TYPE type){
|
||||
case RUN_LOOP_POSIX:
|
||||
the_run_loop = &run_loop_posix;
|
||||
break;
|
||||
case RUN_LOOP_EMBEDDED:
|
||||
the_run_loop = &run_loop_embedded;
|
||||
break;
|
||||
#ifdef USE_COCOA_RUN_LOOP
|
||||
case RUN_LOOP_COCOA:
|
||||
the_run_loop = &run_loop_cocoa;
|
||||
|
171
src/run_loop_embedded.c
Normal file
171
src/run_loop_embedded.c
Normal file
@ -0,0 +1,171 @@
|
||||
/*
|
||||
* Copyright (C) 2009 by Matthias Ringwald
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. Neither the name of the copyright holders nor the names of
|
||||
* contributors may be used to endorse or promote products derived
|
||||
* from this software without specific prior written permission.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY MATTHIAS RINGWALD AND CONTRIBUTORS
|
||||
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
|
||||
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL MATTHIAS
|
||||
* RINGWALD OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
|
||||
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
|
||||
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
|
||||
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||||
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
|
||||
* THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
*
|
||||
*/
|
||||
|
||||
/*
|
||||
* run_loop_embedded.c
|
||||
*
|
||||
* For this run loop, we assume that there's no global way to wait for a list
|
||||
* of data sources to get ready. Instead, each data source has to queried
|
||||
* individually. Calling ds->isReady() before calling ds->process() doesn't
|
||||
* make sense, so we just poll each data source round robin.
|
||||
*
|
||||
*/
|
||||
|
||||
#include <btstack/run_loop.h>
|
||||
#include <btstack/linked_list.h>
|
||||
|
||||
#include "run_loop_private.h"
|
||||
|
||||
// the run loop
|
||||
static linked_list_t data_sources;
|
||||
static linked_list_t timers;
|
||||
|
||||
/**
|
||||
* Add data_source to run_loop
|
||||
*/
|
||||
void embedded_add_data_source(data_source_t *ds){
|
||||
linked_list_add(&data_sources, (linked_item_t *) ds);
|
||||
}
|
||||
|
||||
/**
|
||||
* Remove data_source from run loop
|
||||
*/
|
||||
int embedded_remove_data_source(data_source_t *ds){
|
||||
return linked_list_remove(&data_sources, (linked_item_t *) ds);
|
||||
}
|
||||
|
||||
/**
|
||||
* Add timer to run_loop (keep list sorted)
|
||||
*/
|
||||
void embedded_add_timer(timer_source_t *ts){
|
||||
linked_item_t *it;
|
||||
for (it = (linked_item_t *) &timers; it->next ; it = it->next){
|
||||
if (run_loop_timer_compare( (timer_source_t *) it->next, ts) >= 0) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
ts->item.next = it->next;
|
||||
it->next = (linked_item_t *) ts;
|
||||
// printf("Added timer %x at %u\n", (int) ts, (unsigned int) ts->timeout.tv_sec);
|
||||
// embedded_dump_timer();
|
||||
}
|
||||
|
||||
/**
|
||||
* Remove timer from run loop
|
||||
*/
|
||||
int embedded_remove_timer(timer_source_t *ts){
|
||||
// printf("Removed timer %x at %u\n", (int) ts, (unsigned int) ts->timeout.tv_sec);
|
||||
return linked_list_remove(&timers, (linked_item_t *) ts);
|
||||
}
|
||||
|
||||
void embedded_dump_timer(){
|
||||
#if 0
|
||||
linked_item_t *it;
|
||||
int i = 0;
|
||||
for (it = (linked_item_t *) timers; it ; it = it->next){
|
||||
timer_source_t *ts = (timer_source_t*) it;
|
||||
// printf("timer %u, timeout %u\n", i, (unsigned int) ts->timeout.tv_sec);
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
||||
/**
|
||||
* Execute run_loop
|
||||
*/
|
||||
void embedded_execute() {
|
||||
data_source_t *ds;
|
||||
#ifdef TIMERS
|
||||
timer_source_t *ts;
|
||||
struct timeval current_tv;
|
||||
struct timeval next_tv;
|
||||
struct timeval *timeout;
|
||||
#endif
|
||||
|
||||
while (1) {
|
||||
|
||||
#ifdef TIMERS
|
||||
// get next timeout
|
||||
// pre: 0 <= tv_usec < 1000000
|
||||
timeout = NULL;
|
||||
if (timers) {
|
||||
gettimeofday(¤t_tv, NULL);
|
||||
ts = (timer_source_t *) timers;
|
||||
next_tv.tv_usec = ts->timeout.tv_usec - current_tv.tv_usec;
|
||||
next_tv.tv_sec = ts->timeout.tv_sec - current_tv.tv_sec;
|
||||
while (next_tv.tv_usec < 0){
|
||||
next_tv.tv_usec += 1000000;
|
||||
next_tv.tv_sec--;
|
||||
}
|
||||
if (next_tv.tv_sec < 0 || (next_tv.tv_sec == 0 && next_tv.tv_usec < 0)){
|
||||
next_tv.tv_sec = 0;
|
||||
next_tv.tv_usec = 0;
|
||||
}
|
||||
timeout = &next_tv;
|
||||
}
|
||||
#endif
|
||||
|
||||
// process data sources
|
||||
data_source_t *next;
|
||||
for (ds = (data_source_t *) data_sources; ds != NULL ; ds = next){
|
||||
next = (data_source_t *) ds->item.next; // cache pointer to next data_source to allow data source to remove itself
|
||||
ds->process(ds);
|
||||
}
|
||||
|
||||
#if TIMERS
|
||||
// process timers
|
||||
// pre: 0 <= tv_usec < 1000000
|
||||
while (timers) {
|
||||
gettimeofday(¤t_tv, NULL);
|
||||
ts = (timer_source_t *) timers;
|
||||
if (ts->timeout.tv_sec > current_tv.tv_sec) break;
|
||||
if (ts->timeout.tv_sec == current_tv.tv_sec && ts->timeout.tv_usec > current_tv.tv_usec) break;
|
||||
run_loop_remove_timer(ts);
|
||||
ts->process(ts);
|
||||
}
|
||||
#endif
|
||||
|
||||
}
|
||||
}
|
||||
|
||||
void embedded_init(){
|
||||
data_sources = NULL;
|
||||
timers = NULL;
|
||||
}
|
||||
|
||||
const run_loop_t run_loop_embedded = {
|
||||
&embedded_init,
|
||||
&embedded_add_data_source,
|
||||
&embedded_remove_data_source,
|
||||
&embedded_add_timer,
|
||||
&embedded_remove_timer,
|
||||
&embedded_execute,
|
||||
&embedded_dump_timer
|
||||
};
|
Loading…
x
Reference in New Issue
Block a user