Norimasa Okamoto / Mbed 2 deprecated F401RE-BTstack_example

BTstack for Nucleo F401RE/FRDM-KL46Z example program

Dependencies:   F401RE-USBHost mbed

The usage is the same as KL46Z-BTstack_example.
使い方はKL46Z-BTstack_exampleと同じです。
/media/uploads/va009039/f401re-btstack.jpg

BTstack/linked_list.c@0:a05a07cd6fdf, 2014-06-09 (annotated)

Committer:
va009039
Date:
Mon Jun 09 09:03:25 2014 +0000
Revision:
0:a05a07cd6fdf
first commit

Who changed what in which revision?

UserRevisionLine numberNew contents of line
va009039 0:a05a07cd6fdf 1 /*
va009039 0:a05a07cd6fdf 2 * Copyright (C) 2009-2012 by Matthias Ringwald
va009039 0:a05a07cd6fdf 3 *
va009039 0:a05a07cd6fdf 4 * Redistribution and use in source and binary forms, with or without
va009039 0:a05a07cd6fdf 5 * modification, are permitted provided that the following conditions
va009039 0:a05a07cd6fdf 6 * are met:
va009039 0:a05a07cd6fdf 7 *
va009039 0:a05a07cd6fdf 8 * 1. Redistributions of source code must retain the above copyright
va009039 0:a05a07cd6fdf 9 * notice, this list of conditions and the following disclaimer.
va009039 0:a05a07cd6fdf 10 * 2. Redistributions in binary form must reproduce the above copyright
va009039 0:a05a07cd6fdf 11 * notice, this list of conditions and the following disclaimer in the
va009039 0:a05a07cd6fdf 12 * documentation and/or other materials provided with the distribution.
va009039 0:a05a07cd6fdf 13 * 3. Neither the name of the copyright holders nor the names of
va009039 0:a05a07cd6fdf 14 * contributors may be used to endorse or promote products derived
va009039 0:a05a07cd6fdf 15 * from this software without specific prior written permission.
va009039 0:a05a07cd6fdf 16 * 4. Any redistribution, use, or modification is done solely for
va009039 0:a05a07cd6fdf 17 * personal benefit and not for any commercial purpose or for
va009039 0:a05a07cd6fdf 18 * monetary gain.
va009039 0:a05a07cd6fdf 19 *
va009039 0:a05a07cd6fdf 20 * THIS SOFTWARE IS PROVIDED BY MATTHIAS RINGWALD AND CONTRIBUTORS
va009039 0:a05a07cd6fdf 21 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
va009039 0:a05a07cd6fdf 22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
va009039 0:a05a07cd6fdf 23 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL MATTHIAS
va009039 0:a05a07cd6fdf 24 * RINGWALD OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
va009039 0:a05a07cd6fdf 25 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
va009039 0:a05a07cd6fdf 26 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
va009039 0:a05a07cd6fdf 27 * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
va009039 0:a05a07cd6fdf 28 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
va009039 0:a05a07cd6fdf 29 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
va009039 0:a05a07cd6fdf 30 * THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
va009039 0:a05a07cd6fdf 31 * SUCH DAMAGE.
va009039 0:a05a07cd6fdf 32 *
va009039 0:a05a07cd6fdf 33 * Please inquire about commercial licensing options at btstack@ringwald.ch
va009039 0:a05a07cd6fdf 34 *
va009039 0:a05a07cd6fdf 35 */
va009039 0:a05a07cd6fdf 36
va009039 0:a05a07cd6fdf 37 /*
va009039 0:a05a07cd6fdf 38 * linked_list.c
va009039 0:a05a07cd6fdf 39 *
va009039 0:a05a07cd6fdf 40 * Created by Matthias Ringwald on 7/13/09.
va009039 0:a05a07cd6fdf 41 */
va009039 0:a05a07cd6fdf 42
va009039 0:a05a07cd6fdf 43 #include <btstack/linked_list.h>
va009039 0:a05a07cd6fdf 44 #include <stdlib.h>
va009039 0:a05a07cd6fdf 45 /**
va009039 0:a05a07cd6fdf 46 * tests if list is empty
va009039 0:a05a07cd6fdf 47 */
va009039 0:a05a07cd6fdf 48 int linked_list_empty(linked_list_t * list){
va009039 0:a05a07cd6fdf 49 return *list == (void *) 0;
va009039 0:a05a07cd6fdf 50 }
va009039 0:a05a07cd6fdf 51
va009039 0:a05a07cd6fdf 52 /**
va009039 0:a05a07cd6fdf 53 * linked_list_get_last_item
va009039 0:a05a07cd6fdf 54 */
va009039 0:a05a07cd6fdf 55 linked_item_t * linked_list_get_last_item(linked_list_t * list){ // <-- find the last item in the list
va009039 0:a05a07cd6fdf 56 linked_item_t *lastItem = NULL;
va009039 0:a05a07cd6fdf 57 linked_item_t *it;
va009039 0:a05a07cd6fdf 58 for (it = *list; it ; it = it->next){
va009039 0:a05a07cd6fdf 59 if (it) {
va009039 0:a05a07cd6fdf 60 lastItem = it;
va009039 0:a05a07cd6fdf 61 }
va009039 0:a05a07cd6fdf 62 }
va009039 0:a05a07cd6fdf 63 return lastItem;
va009039 0:a05a07cd6fdf 64 }
va009039 0:a05a07cd6fdf 65
va009039 0:a05a07cd6fdf 66
va009039 0:a05a07cd6fdf 67 /**
va009039 0:a05a07cd6fdf 68 * linked_list_add
va009039 0:a05a07cd6fdf 69 */
va009039 0:a05a07cd6fdf 70 void linked_list_add(linked_list_t * list, linked_item_t *item){ // <-- add item to list
va009039 0:a05a07cd6fdf 71 // check if already in list
va009039 0:a05a07cd6fdf 72 linked_item_t *it;
va009039 0:a05a07cd6fdf 73 for (it = *list; it ; it = it->next){
va009039 0:a05a07cd6fdf 74 if (it == item) {
va009039 0:a05a07cd6fdf 75 return;
va009039 0:a05a07cd6fdf 76 }
va009039 0:a05a07cd6fdf 77 }
va009039 0:a05a07cd6fdf 78 // add first
va009039 0:a05a07cd6fdf 79 item->next = *list;
va009039 0:a05a07cd6fdf 80 *list = item;
va009039 0:a05a07cd6fdf 81 }
va009039 0:a05a07cd6fdf 82
va009039 0:a05a07cd6fdf 83 void linked_list_add_tail(linked_list_t * list, linked_item_t *item){ // <-- add item to list as last element
va009039 0:a05a07cd6fdf 84 // check if already in list
va009039 0:a05a07cd6fdf 85 linked_item_t *it;
va009039 0:a05a07cd6fdf 86 for (it = (linked_item_t *) list; it->next ; it = it->next){
va009039 0:a05a07cd6fdf 87 if (it->next == item) {
va009039 0:a05a07cd6fdf 88 return;
va009039 0:a05a07cd6fdf 89 }
va009039 0:a05a07cd6fdf 90 }
va009039 0:a05a07cd6fdf 91 item->next = (linked_item_t*) 0;
va009039 0:a05a07cd6fdf 92 it->next = item;
va009039 0:a05a07cd6fdf 93 }
va009039 0:a05a07cd6fdf 94
va009039 0:a05a07cd6fdf 95 /**
va009039 0:a05a07cd6fdf 96 * Remove data_source from run loop
va009039 0:a05a07cd6fdf 97 *
va009039 0:a05a07cd6fdf 98 * @note: assumes that data_source_t.next is first element in data_source
va009039 0:a05a07cd6fdf 99 */
va009039 0:a05a07cd6fdf 100 int linked_list_remove(linked_list_t * list, linked_item_t *item){ // <-- remove item from list
va009039 0:a05a07cd6fdf 101 linked_item_t *it;
va009039 0:a05a07cd6fdf 102 for (it = (linked_item_t *) list; it ; it = it->next){
va009039 0:a05a07cd6fdf 103 if (it->next == item){
va009039 0:a05a07cd6fdf 104 it->next = item->next;
va009039 0:a05a07cd6fdf 105 return 0;
va009039 0:a05a07cd6fdf 106 }
va009039 0:a05a07cd6fdf 107 }
va009039 0:a05a07cd6fdf 108 return -1;
va009039 0:a05a07cd6fdf 109 }
va009039 0:a05a07cd6fdf 110
va009039 0:a05a07cd6fdf 111 void linked_item_set_user(linked_item_t *item, void *user_data){
va009039 0:a05a07cd6fdf 112 item->next = (linked_item_t *) 0;
va009039 0:a05a07cd6fdf 113 item->user_data = user_data;
va009039 0:a05a07cd6fdf 114 }
va009039 0:a05a07cd6fdf 115
va009039 0:a05a07cd6fdf 116 void * linked_item_get_user(linked_item_t *item) {
va009039 0:a05a07cd6fdf 117 return item->user_data;
va009039 0:a05a07cd6fdf 118 }
va009039 0:a05a07cd6fdf 119
va009039 0:a05a07cd6fdf 120 #if 0
va009039 0:a05a07cd6fdf 121 #include <stdio.h>
va009039 0:a05a07cd6fdf 122 void test_linked_list(){
va009039 0:a05a07cd6fdf 123 linked_list_t testList = 0;
va009039 0:a05a07cd6fdf 124 linked_item_t itemA;
va009039 0:a05a07cd6fdf 125 linked_item_t itemB;
va009039 0:a05a07cd6fdf 126 linked_item_t itemC;
va009039 0:a05a07cd6fdf 127 linked_item_set_user(&itemA, (void *) 0);
va009039 0:a05a07cd6fdf 128 linked_item_set_user(&itemB, (void *) 0);
va009039 0:a05a07cd6fdf 129 linked_list_add(&testList, &itemA);
va009039 0:a05a07cd6fdf 130 linked_list_add(&testList, &itemB);
va009039 0:a05a07cd6fdf 131 linked_list_add_tail(&testList, &itemC);
va009039 0:a05a07cd6fdf 132 // linked_list_remove(&testList, &itemB);
va009039 0:a05a07cd6fdf 133 linked_item_t *it;
va009039 0:a05a07cd6fdf 134 for (it = (linked_item_t *) &testList; it ; it = it->next){
va009039 0:a05a07cd6fdf 135 if (it->next == &itemA) printf("Item A\n");
va009039 0:a05a07cd6fdf 136 if (it->next == &itemB) printf("Item B\n");
va009039 0:a05a07cd6fdf 137 if (it->next == &itemC) printf("Item C\n");
va009039 0:a05a07cd6fdf 138 /* if (it->next == &itemB){
va009039 0:a05a07cd6fdf 139 it->next = it->next;
va009039 0:a05a07cd6fdf 140 printf(" remove\n");
va009039 0:a05a07cd6fdf 141 } else {
va009039 0:a05a07cd6fdf 142 printf(" keep\n");
va009039 0:a05a07cd6fdf 143
va009039 0:a05a07cd6fdf 144 */
va009039 0:a05a07cd6fdf 145 }
va009039 0:a05a07cd6fdf 146 }
va009039 0:a05a07cd6fdf 147 #endif