init commit of examples
This commit is contained in:
@@ -0,0 +1,46 @@
|
||||
/**
|
||||
* \file
|
||||
*
|
||||
* \brief Asserts related functionality.
|
||||
*
|
||||
* Copyright (c) 2014-2018 Microchip Technology Inc. and its subsidiaries.
|
||||
*
|
||||
* \asf_license_start
|
||||
*
|
||||
* \page License
|
||||
*
|
||||
* Subject to your compliance with these terms, you may use Microchip
|
||||
* software and any derivatives exclusively with Microchip products.
|
||||
* It is your responsibility to comply with third party license terms applicable
|
||||
* to your use of third party software (including open source software) that
|
||||
* may accompany Microchip software.
|
||||
*
|
||||
* THIS SOFTWARE IS SUPPLIED BY MICROCHIP "AS IS". NO WARRANTIES,
|
||||
* WHETHER EXPRESS, IMPLIED OR STATUTORY, APPLY TO THIS SOFTWARE,
|
||||
* INCLUDING ANY IMPLIED WARRANTIES OF NON-INFRINGEMENT, MERCHANTABILITY,
|
||||
* AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT WILL MICROCHIP BE
|
||||
* LIABLE FOR ANY INDIRECT, SPECIAL, PUNITIVE, INCIDENTAL OR CONSEQUENTIAL
|
||||
* LOSS, DAMAGE, COST OR EXPENSE OF ANY KIND WHATSOEVER RELATED TO THE
|
||||
* SOFTWARE, HOWEVER CAUSED, EVEN IF MICROCHIP HAS BEEN ADVISED OF THE
|
||||
* POSSIBILITY OR THE DAMAGES ARE FORESEEABLE. TO THE FULLEST EXTENT
|
||||
* ALLOWED BY LAW, MICROCHIP'S TOTAL LIABILITY ON ALL CLAIMS IN ANY WAY
|
||||
* RELATED TO THIS SOFTWARE WILL NOT EXCEED THE AMOUNT OF FEES, IF ANY,
|
||||
* THAT YOU HAVE PAID DIRECTLY TO MICROCHIP FOR THIS SOFTWARE.
|
||||
*
|
||||
* \asf_license_stop
|
||||
*
|
||||
*/
|
||||
|
||||
#include <utils_assert.h>
|
||||
|
||||
/**
|
||||
* \brief Assert function
|
||||
*/
|
||||
void assert(const bool condition, const char *const file, const int line)
|
||||
{
|
||||
if (!(condition)) {
|
||||
__asm("BKPT #0");
|
||||
}
|
||||
(void)file;
|
||||
(void)line;
|
||||
}
|
||||
125
Examples/SPISLAVEDMA/SPISLAVEDMA(3)/hal/utils/src/utils_event.c
Normal file
125
Examples/SPISLAVEDMA/SPISLAVEDMA(3)/hal/utils/src/utils_event.c
Normal file
@@ -0,0 +1,125 @@
|
||||
/**
|
||||
* \file
|
||||
*
|
||||
* \brief Events implementation.
|
||||
*
|
||||
* Copyright (c) 2015-2018 Microchip Technology Inc. and its subsidiaries.
|
||||
*
|
||||
* \asf_license_start
|
||||
*
|
||||
* \page License
|
||||
*
|
||||
* Subject to your compliance with these terms, you may use Microchip
|
||||
* software and any derivatives exclusively with Microchip products.
|
||||
* It is your responsibility to comply with third party license terms applicable
|
||||
* to your use of third party software (including open source software) that
|
||||
* may accompany Microchip software.
|
||||
*
|
||||
* THIS SOFTWARE IS SUPPLIED BY MICROCHIP "AS IS". NO WARRANTIES,
|
||||
* WHETHER EXPRESS, IMPLIED OR STATUTORY, APPLY TO THIS SOFTWARE,
|
||||
* INCLUDING ANY IMPLIED WARRANTIES OF NON-INFRINGEMENT, MERCHANTABILITY,
|
||||
* AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT WILL MICROCHIP BE
|
||||
* LIABLE FOR ANY INDIRECT, SPECIAL, PUNITIVE, INCIDENTAL OR CONSEQUENTIAL
|
||||
* LOSS, DAMAGE, COST OR EXPENSE OF ANY KIND WHATSOEVER RELATED TO THE
|
||||
* SOFTWARE, HOWEVER CAUSED, EVEN IF MICROCHIP HAS BEEN ADVISED OF THE
|
||||
* POSSIBILITY OR THE DAMAGES ARE FORESEEABLE. TO THE FULLEST EXTENT
|
||||
* ALLOWED BY LAW, MICROCHIP'S TOTAL LIABILITY ON ALL CLAIMS IN ANY WAY
|
||||
* RELATED TO THIS SOFTWARE WILL NOT EXCEED THE AMOUNT OF FEES, IF ANY,
|
||||
* THAT YOU HAVE PAID DIRECTLY TO MICROCHIP FOR THIS SOFTWARE.
|
||||
*
|
||||
* \asf_license_stop
|
||||
*
|
||||
*/
|
||||
|
||||
#include <utils_event.h>
|
||||
#include <utils_assert.h>
|
||||
#include <string.h>
|
||||
|
||||
#define EVENT_WORD_BITS (sizeof(event_word_t) * 8)
|
||||
|
||||
static struct list_descriptor events;
|
||||
static uint8_t subscribed[EVENT_MASK_SIZE];
|
||||
|
||||
int32_t event_subscribe(struct event *const event, const event_id_t id, event_cb_t cb)
|
||||
{
|
||||
/* get byte and bit number of the given event in the event mask */
|
||||
const uint8_t position = id >> 3;
|
||||
const uint8_t mask = 1 << (id & 0x7);
|
||||
|
||||
ASSERT(event && cb && (id < EVENT_MAX_AMOUNT));
|
||||
|
||||
if (event->mask[position] & mask) {
|
||||
return ERR_NO_CHANGE; /* Already subscribed */
|
||||
}
|
||||
|
||||
if (!is_list_element(&events, event)) {
|
||||
memset(event->mask, 0, EVENT_MASK_SIZE);
|
||||
list_insert_as_head(&events, event);
|
||||
}
|
||||
event->cb = cb;
|
||||
event->mask[position] |= mask;
|
||||
|
||||
subscribed[position] |= mask;
|
||||
|
||||
return ERR_NONE;
|
||||
}
|
||||
|
||||
int32_t event_unsubscribe(struct event *const event, const event_id_t id)
|
||||
{
|
||||
/* get byte and bit number of the given event in the event mask */
|
||||
const uint8_t position = id >> 3;
|
||||
const uint8_t mask = 1 << (id & 0x7);
|
||||
const struct event *current;
|
||||
uint8_t i;
|
||||
|
||||
ASSERT(event && (id < EVENT_MAX_AMOUNT));
|
||||
|
||||
if (!(event->mask[position] & mask)) {
|
||||
return ERR_NO_CHANGE; /* Already unsubscribed */
|
||||
}
|
||||
|
||||
event->mask[position] &= ~mask;
|
||||
|
||||
/* Check if there are more subscribers */
|
||||
for ((current = (const struct event *)list_get_head(&events)); current;
|
||||
current = (const struct event *)list_get_next_element(current)) {
|
||||
if (current->mask[position] & mask) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (!current) {
|
||||
subscribed[position] &= ~mask;
|
||||
}
|
||||
|
||||
/* Remove event from the list. Can be unsave, document it! */
|
||||
for (i = 0; i < ARRAY_SIZE(event->mask); i++) {
|
||||
if (event->mask[i]) {
|
||||
return ERR_NONE;
|
||||
}
|
||||
}
|
||||
list_delete_element(&events, event);
|
||||
|
||||
return ERR_NONE;
|
||||
}
|
||||
|
||||
void event_post(const event_id_t id, const event_data_t data)
|
||||
{
|
||||
/* get byte and bit number of the given event in the event mask */
|
||||
const uint8_t position = id >> 3;
|
||||
const uint8_t mask = 1 << (id & 0x7);
|
||||
const struct event *current;
|
||||
|
||||
ASSERT((id < EVENT_MAX_AMOUNT));
|
||||
|
||||
if (!(subscribed[position] & mask)) {
|
||||
return; /* No subscribers */
|
||||
}
|
||||
|
||||
/* Find all subscribers */
|
||||
for ((current = (const struct event *)list_get_head(&events)); current;
|
||||
current = (const struct event *)list_get_next_element(current)) {
|
||||
if (current->mask[position] & mask) {
|
||||
current->cb(id, data);
|
||||
}
|
||||
}
|
||||
}
|
||||
136
Examples/SPISLAVEDMA/SPISLAVEDMA(3)/hal/utils/src/utils_list.c
Normal file
136
Examples/SPISLAVEDMA/SPISLAVEDMA(3)/hal/utils/src/utils_list.c
Normal file
@@ -0,0 +1,136 @@
|
||||
/**
|
||||
* \file
|
||||
*
|
||||
* \brief List functionality implementation.
|
||||
*
|
||||
* Copyright (c) 2014-2018 Microchip Technology Inc. and its subsidiaries.
|
||||
*
|
||||
* \asf_license_start
|
||||
*
|
||||
* \page License
|
||||
*
|
||||
* Subject to your compliance with these terms, you may use Microchip
|
||||
* software and any derivatives exclusively with Microchip products.
|
||||
* It is your responsibility to comply with third party license terms applicable
|
||||
* to your use of third party software (including open source software) that
|
||||
* may accompany Microchip software.
|
||||
*
|
||||
* THIS SOFTWARE IS SUPPLIED BY MICROCHIP "AS IS". NO WARRANTIES,
|
||||
* WHETHER EXPRESS, IMPLIED OR STATUTORY, APPLY TO THIS SOFTWARE,
|
||||
* INCLUDING ANY IMPLIED WARRANTIES OF NON-INFRINGEMENT, MERCHANTABILITY,
|
||||
* AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT WILL MICROCHIP BE
|
||||
* LIABLE FOR ANY INDIRECT, SPECIAL, PUNITIVE, INCIDENTAL OR CONSEQUENTIAL
|
||||
* LOSS, DAMAGE, COST OR EXPENSE OF ANY KIND WHATSOEVER RELATED TO THE
|
||||
* SOFTWARE, HOWEVER CAUSED, EVEN IF MICROCHIP HAS BEEN ADVISED OF THE
|
||||
* POSSIBILITY OR THE DAMAGES ARE FORESEEABLE. TO THE FULLEST EXTENT
|
||||
* ALLOWED BY LAW, MICROCHIP'S TOTAL LIABILITY ON ALL CLAIMS IN ANY WAY
|
||||
* RELATED TO THIS SOFTWARE WILL NOT EXCEED THE AMOUNT OF FEES, IF ANY,
|
||||
* THAT YOU HAVE PAID DIRECTLY TO MICROCHIP FOR THIS SOFTWARE.
|
||||
*
|
||||
* \asf_license_stop
|
||||
*
|
||||
*/
|
||||
|
||||
#include <utils_list.h>
|
||||
#include <utils_assert.h>
|
||||
|
||||
/**
|
||||
* \brief Check whether element belongs to list
|
||||
*/
|
||||
bool is_list_element(const struct list_descriptor *const list, const void *const element)
|
||||
{
|
||||
struct list_element *it;
|
||||
for (it = list->head; it; it = it->next) {
|
||||
if (it == element) {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
/**
|
||||
* \brief Insert an element as list head
|
||||
*/
|
||||
void list_insert_as_head(struct list_descriptor *const list, void *const element)
|
||||
{
|
||||
ASSERT(!is_list_element(list, element));
|
||||
|
||||
((struct list_element *)element)->next = list->head;
|
||||
list->head = (struct list_element *)element;
|
||||
}
|
||||
|
||||
/**
|
||||
* \brief Insert an element after the given list element
|
||||
*/
|
||||
void list_insert_after(void *const after, void *const element)
|
||||
{
|
||||
((struct list_element *)element)->next = ((struct list_element *)after)->next;
|
||||
((struct list_element *)after)->next = (struct list_element *)element;
|
||||
}
|
||||
|
||||
/**
|
||||
* \brief Insert an element at list end
|
||||
*/
|
||||
void list_insert_at_end(struct list_descriptor *const list, void *const element)
|
||||
{
|
||||
struct list_element *it = list->head;
|
||||
|
||||
ASSERT(!is_list_element(list, element));
|
||||
|
||||
if (!list->head) {
|
||||
list->head = (struct list_element *)element;
|
||||
((struct list_element *)element)->next = NULL;
|
||||
return;
|
||||
}
|
||||
|
||||
while (it->next) {
|
||||
it = it->next;
|
||||
}
|
||||
it->next = (struct list_element *)element;
|
||||
((struct list_element *)element)->next = NULL;
|
||||
}
|
||||
|
||||
/**
|
||||
* \brief Removes list head
|
||||
*/
|
||||
void *list_remove_head(struct list_descriptor *const list)
|
||||
{
|
||||
if (list->head) {
|
||||
struct list_element *tmp = list->head;
|
||||
|
||||
list->head = list->head->next;
|
||||
return (void *)tmp;
|
||||
}
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
/**
|
||||
* \brief Removes list element
|
||||
*/
|
||||
bool list_delete_element(struct list_descriptor *const list, const void *const element)
|
||||
{
|
||||
if (!element) {
|
||||
return false;
|
||||
}
|
||||
|
||||
if (list->head == element) {
|
||||
list->head = list->head->next;
|
||||
return true;
|
||||
} else {
|
||||
struct list_element *it = list->head;
|
||||
|
||||
while (it && it->next != element) {
|
||||
it = it->next;
|
||||
}
|
||||
if (it) {
|
||||
it->next = ((struct list_element *)element)->next;
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
//@}
|
||||
@@ -0,0 +1,152 @@
|
||||
/**
|
||||
* \file
|
||||
*
|
||||
* \brief Syscalls for SAM0 (GCC).
|
||||
*
|
||||
* Copyright (c) 2015-2018 Microchip Technology Inc. and its subsidiaries.
|
||||
*
|
||||
* \asf_license_start
|
||||
*
|
||||
* \page License
|
||||
*
|
||||
* Subject to your compliance with these terms, you may use Microchip
|
||||
* software and any derivatives exclusively with Microchip products.
|
||||
* It is your responsibility to comply with third party license terms applicable
|
||||
* to your use of third party software (including open source software) that
|
||||
* may accompany Microchip software.
|
||||
*
|
||||
* THIS SOFTWARE IS SUPPLIED BY MICROCHIP "AS IS". NO WARRANTIES,
|
||||
* WHETHER EXPRESS, IMPLIED OR STATUTORY, APPLY TO THIS SOFTWARE,
|
||||
* INCLUDING ANY IMPLIED WARRANTIES OF NON-INFRINGEMENT, MERCHANTABILITY,
|
||||
* AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT WILL MICROCHIP BE
|
||||
* LIABLE FOR ANY INDIRECT, SPECIAL, PUNITIVE, INCIDENTAL OR CONSEQUENTIAL
|
||||
* LOSS, DAMAGE, COST OR EXPENSE OF ANY KIND WHATSOEVER RELATED TO THE
|
||||
* SOFTWARE, HOWEVER CAUSED, EVEN IF MICROCHIP HAS BEEN ADVISED OF THE
|
||||
* POSSIBILITY OR THE DAMAGES ARE FORESEEABLE. TO THE FULLEST EXTENT
|
||||
* ALLOWED BY LAW, MICROCHIP'S TOTAL LIABILITY ON ALL CLAIMS IN ANY WAY
|
||||
* RELATED TO THIS SOFTWARE WILL NOT EXCEED THE AMOUNT OF FEES, IF ANY,
|
||||
* THAT YOU HAVE PAID DIRECTLY TO MICROCHIP FOR THIS SOFTWARE.
|
||||
*
|
||||
* \asf_license_stop
|
||||
*
|
||||
*/
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <sys/types.h>
|
||||
#include <sys/stat.h>
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
#undef errno
|
||||
extern int errno;
|
||||
extern int _end;
|
||||
|
||||
extern caddr_t _sbrk(int incr);
|
||||
extern int link(char *old, char *_new);
|
||||
extern int _close(int file);
|
||||
extern int _fstat(int file, struct stat *st);
|
||||
extern int _isatty(int file);
|
||||
extern int _lseek(int file, int ptr, int dir);
|
||||
extern void _exit(int status);
|
||||
extern void _kill(int pid, int sig);
|
||||
extern int _getpid(void);
|
||||
|
||||
/**
|
||||
* \brief Replacement of C library of _sbrk
|
||||
*/
|
||||
extern caddr_t _sbrk(int incr)
|
||||
{
|
||||
static unsigned char *heap = NULL;
|
||||
unsigned char * prev_heap;
|
||||
|
||||
if (heap == NULL) {
|
||||
heap = (unsigned char *)&_end;
|
||||
}
|
||||
prev_heap = heap;
|
||||
|
||||
heap += incr;
|
||||
|
||||
return (caddr_t)prev_heap;
|
||||
}
|
||||
|
||||
/**
|
||||
* \brief Replacement of C library of link
|
||||
*/
|
||||
extern int link(char *old, char *_new)
|
||||
{
|
||||
(void)old, (void)_new;
|
||||
return -1;
|
||||
}
|
||||
|
||||
/**
|
||||
* \brief Replacement of C library of _close
|
||||
*/
|
||||
extern int _close(int file)
|
||||
{
|
||||
(void)file;
|
||||
return -1;
|
||||
}
|
||||
|
||||
/**
|
||||
* \brief Replacement of C library of _fstat
|
||||
*/
|
||||
extern int _fstat(int file, struct stat *st)
|
||||
{
|
||||
(void)file;
|
||||
st->st_mode = S_IFCHR;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/**
|
||||
* \brief Replacement of C library of _isatty
|
||||
*/
|
||||
extern int _isatty(int file)
|
||||
{
|
||||
(void)file;
|
||||
return 1;
|
||||
}
|
||||
|
||||
/**
|
||||
* \brief Replacement of C library of _lseek
|
||||
*/
|
||||
extern int _lseek(int file, int ptr, int dir)
|
||||
{
|
||||
(void)file, (void)ptr, (void)dir;
|
||||
return 0;
|
||||
}
|
||||
|
||||
/**
|
||||
* \brief Replacement of C library of _exit
|
||||
*/
|
||||
extern void _exit(int status)
|
||||
{
|
||||
printf("Exiting with status %d.\n", status);
|
||||
|
||||
for (;;)
|
||||
;
|
||||
}
|
||||
|
||||
/**
|
||||
* \brief Replacement of C library of _kill
|
||||
*/
|
||||
extern void _kill(int pid, int sig)
|
||||
{
|
||||
(void)pid, (void)sig;
|
||||
return;
|
||||
}
|
||||
|
||||
/**
|
||||
* \brief Replacement of C library of _getpid
|
||||
*/
|
||||
extern int _getpid(void)
|
||||
{
|
||||
return -1;
|
||||
}
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
Reference in New Issue
Block a user