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

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 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 *
va009039 0:a05a07cd6fdf 17 * THIS SOFTWARE IS PROVIDED BY MATTHIAS RINGWALD AND CONTRIBUTORS
va009039 0:a05a07cd6fdf 18 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
va009039 0:a05a07cd6fdf 19 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
va009039 0:a05a07cd6fdf 20 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL MATTHIAS
va009039 0:a05a07cd6fdf 21 * RINGWALD OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
va009039 0:a05a07cd6fdf 22 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
va009039 0:a05a07cd6fdf 23 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
va009039 0:a05a07cd6fdf 24 * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
va009039 0:a05a07cd6fdf 25 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
va009039 0:a05a07cd6fdf 26 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
va009039 0:a05a07cd6fdf 27 * THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
va009039 0:a05a07cd6fdf 28 * SUCH DAMAGE.
va009039 0:a05a07cd6fdf 29 *
va009039 0:a05a07cd6fdf 30 */
va009039 0:a05a07cd6fdf 31
va009039 0:a05a07cd6fdf 32 /*
va009039 0:a05a07cd6fdf 33 * linked_list.h
va009039 0:a05a07cd6fdf 34 *
va009039 0:a05a07cd6fdf 35 * Created by Matthias Ringwald on 7/13/09.
va009039 0:a05a07cd6fdf 36 */
va009039 0:a05a07cd6fdf 37
va009039 0:a05a07cd6fdf 38 #pragma once
va009039 0:a05a07cd6fdf 39
va009039 0:a05a07cd6fdf 40 #if defined __cplusplus
va009039 0:a05a07cd6fdf 41 extern "C" {
va009039 0:a05a07cd6fdf 42 #endif
va009039 0:a05a07cd6fdf 43
va009039 0:a05a07cd6fdf 44 typedef struct linked_item {
va009039 0:a05a07cd6fdf 45 struct linked_item *next; // <-- next element in list, or NULL
va009039 0:a05a07cd6fdf 46 void *user_data; // <-- pointer to struct base
va009039 0:a05a07cd6fdf 47 } linked_item_t;
va009039 0:a05a07cd6fdf 48
va009039 0:a05a07cd6fdf 49 typedef linked_item_t * linked_list_t;
va009039 0:a05a07cd6fdf 50
va009039 0:a05a07cd6fdf 51 void linked_item_set_user(linked_item_t *item, void *user_data); // <-- set user data
va009039 0:a05a07cd6fdf 52 void * linked_item_get_user(linked_item_t *item); // <-- get user data
va009039 0:a05a07cd6fdf 53 int linked_list_empty(linked_list_t * list);
va009039 0:a05a07cd6fdf 54 void linked_list_add(linked_list_t * list, linked_item_t *item); // <-- add item to list as first element
va009039 0:a05a07cd6fdf 55 void linked_list_add_tail(linked_list_t * list, linked_item_t *item); // <-- add item to list as last element
va009039 0:a05a07cd6fdf 56 int linked_list_remove(linked_list_t * list, linked_item_t *item); // <-- remove item from list
va009039 0:a05a07cd6fdf 57 linked_item_t * linked_list_get_last_item(linked_list_t * list); // <-- find the last item in the list
va009039 0:a05a07cd6fdf 58
va009039 0:a05a07cd6fdf 59 void test_linked_list(void);
va009039 0:a05a07cd6fdf 60
va009039 0:a05a07cd6fdf 61 #if defined __cplusplus
va009039 0:a05a07cd6fdf 62 }
va009039 0:a05a07cd6fdf 63 #endif