Shivanand Gowda
Doubly linked list
Revision 0:a76236b7a8e6, committed 2019-09-16
- Comitter:
- shivanandgowdakr
- Date:
- Mon Sep 16 13:57:00 2019 +0000
- Commit message:
- Doubly Linked List using STM32
Changed in this revision
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/.gitignore Mon Sep 16 13:57:00 2019 +0000 @@ -0,0 +1,4 @@ +.build +.mbed +projectfiles +*.py*
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/CONTRIBUTING.md Mon Sep 16 13:57:00 2019 +0000 @@ -0,0 +1,5 @@ +# Contributing to Mbed OS + +Mbed OS is an open-source, device software platform for the Internet of Things. Contributions are an important part of the platform, and our goal is to make it as simple as possible to become a contributor. + +To encourage productive collaboration, as well as robust, consistent and maintainable code, we have a set of guidelines for [contributing to Mbed OS](https://os.mbed.com/docs/mbed-os/latest/contributing/index.html).
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/README.md Mon Sep 16 13:57:00 2019 +0000 @@ -0,0 +1,152 @@ +# Getting started example for Mbed OS + +This guide reviews the steps required to get Blinky with the addition of dynamic OS statistics working on an Mbed OS platform. (Note: To see a rendered example you can import into the Arm Online Compiler, please see our [quick start](https://os.mbed.com/docs/mbed-os/latest/quick-start/online-with-the-online-compiler.html#importing-the-code).) + +Please install [Mbed CLI](https://github.com/ARMmbed/mbed-cli#installing-mbed-cli). + +## Import the example application + +From the command-line, import the example: + +``` +mbed import mbed-os-example-blinky +cd mbed-os-example-blinky +``` + +### Now compile + +Invoke `mbed compile`, and specify the name of your platform and your favorite toolchain (`GCC_ARM`, `ARM`, `IAR`). For example, for the Arm Compiler: + +``` +mbed compile -m K64F -t ARM +``` + +Your PC may take a few minutes to compile your code. At the end, you see the following result: + +``` +[snip] + +Image: ./BUILD/K64F/GCC_ARM/mbed-os-example-blinky.bin +``` + +### Program your board + +1. Connect your Mbed device to the computer over USB. +1. Copy the binary file to the Mbed device. +1. Press the reset button to start the program. + +The LED on your platform turns on and off. The main thread will additionally take a snapshot of the device's runtime statistics and display it over serial to your PC. The snapshot includes: + +* System Information: + * Mbed OS Version: Will currently default to 999999 + * Compiler ID + * ARM = 1 + * GCC_ARM = 2 + * IAR = 3 + * [CPUID Register Information](#cpuid-register-information) + * [Compiler Version](#compiler-version) +* CPU Statistics + * Percentage of runtime that the device has spent awake versus in sleep +* Heap Statistics + * Current heap size + * Max heap size which refers to the largest the heap has grown to +* Thread Statistics + * Provides information on all running threads in the OS including + * Thread ID + * Thread Name + * Thread State + * Thread Priority + * Thread Stack Size + * Thread Stack Space + +#### Compiler Version + +| Compiler | Version Layout | +| -------- | -------------- | +| ARM | PVVbbbb (P = Major; VV = Minor; bbbb = build number) | +| GCC | VVRRPP (VV = Version; RR = Revision; PP = Patch) | +| IAR | VRRRPPP (V = Version; RRR = Revision; PPP = Patch) | + +#### CPUID Register Information + +| Bit Field | Field Description | Values | +| --------- | ----------------- | ------ | +|[31:24] | Implementer | 0x41 = ARM | +|[23:20] | Variant | Major revision 0x0 = Revision 0 | +|[19:16] | Architecture | 0xC = Baseline Architecture | +| | | 0xF = Constant (Mainline Architecture) | +|[15:4] | Part Number | 0xC20 = Cortex-M0 | +| | | 0xC60 = Cortex-M0+ | +| | | 0xC23 = Cortex-M3 | +| | | 0xC24 = Cortex-M4 | +| | | 0xC27 = Cortex-M7 | +| | | 0xD20 = Cortex-M23 | +| | | 0xD21 = Cortex-M33 | +|[3:0] | Revision | Minor revision: 0x1 = Patch 1 | + + + +You can view individual examples and additional API information of the statistics collection tools at the bottom of the page in the [related links section](#related-links). + + +### Output + +To view the serial output you can use any terminal client of your choosing such as [PuTTY](http://www.putty.org/) or [CoolTerm](http://freeware.the-meiers.org/). Unless otherwise specified, printf defaults to a baud rate of 9600 on Mbed OS. + +You can find more information on the Mbed OS configuration tools and serial communication in Mbed OS in the related [related links section](#related-links). + +The output should contain the following block transmitted at the blinking LED frequency (actual values may vary depending on your target, build profile, and toolchain): + +``` +=============================== SYSTEM INFO ================================ +Mbed OS Version: 999999 +CPU ID: 0x410fc241 +Compiler ID: 2 +Compiler Version: 60300 +RAM0: Start 0x20000000 Size: 0x30000 +RAM1: Start 0x1fff0000 Size: 0x10000 +ROM0: Start 0x0 Size: 0x100000 +================= CPU STATS ================= +Idle: 98% Usage: 2% +================ HEAP STATS ================= +Current heap: 1096 +Max heap size: 1096 +================ THREAD STATS =============== +ID: 0x20001eac +Name: main_thread +State: 2 +Priority: 24 +Stack Size: 4096 +Stack Space: 3296 + +ID: 0x20000f5c +Name: idle_thread +State: 1 +Priority: 1 +Stack Size: 512 +Stack Space: 352 + +ID: 0x20000f18 +Name: timer_thread +State: 3 +Priority: 40 +Stack Size: 768 +Stack Space: 664 + +``` + +## Troubleshooting + +If you have problems, you can review the [documentation](https://os.mbed.com/docs/latest/tutorials/debugging.html) for suggestions on what could be wrong and how to fix it. + +## Related Links + +* [Mbed OS Stats API](https://os.mbed.com/docs/latest/apis/mbed-statistics.html) +* [Mbed OS Configuration](https://os.mbed.com/docs/latest/reference/configuration.html) +* [Mbed OS Serial Communication](https://os.mbed.com/docs/latest/tutorials/serial-communication.html) + +### License and contributions + +The software is provided under Apache-2.0 license. Contributions to this project are accepted under the same license. Please see contributing.md for more info. + +This project contains code from other projects. The original license text is included in those source files. They must comply with our license guide.
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/main.cpp Mon Sep 16 13:57:00 2019 +0000
@@ -0,0 +1,368 @@
+/* mbed Microcontroller Library
+ * Copyright (c) 2018 ARM Limited
+ * SPDX-License-Identifier: Apache-2.0
+ */
+
+#include "mbed.h"
+#include "ThisThread.h"
+#include "stats_report.h"
+
+
+#include <stdio.h>
+#include <stdlib.h>
+
+DigitalOut led1(LED1);
+
+#define SLEEP_TIME 500 // (msec)
+#define PRINT_AFTER_N_LOOPS 20
+
+
+
+struct node
+{
+ struct node *prev;
+ int n;
+ struct node *next;
+}*h,*temp,*temp1,*temp2,*temp4;
+
+void insert1();
+void insert2();
+void insert3();
+void traversebeg();
+void traverseend(int);
+void sort();
+void search();
+void update();
+void d_delete();
+
+int counter = 0;
+
+int main()
+{
+ int ch;
+
+ h = NULL;
+ temp = temp1 = NULL;
+
+ printf("\n 1 - Insert at beginning");
+ printf("\n 2 - Insert at end");
+ printf("\n 3 - Insert at position i");
+ printf("\n 4 - Delete at i");
+ printf("\n 5 - Display from beginning");
+ printf("\n 6 - Display from end");
+ printf("\n 7 - Search for element");
+ printf("\n 8 - Sort the list");
+ printf("\n 9 - Update an element");
+ printf("\n 10 - Exit");
+
+ while (1)
+ {
+ printf("\n Enter choice : ");
+ scanf("%d", &ch);
+ switch (ch)
+ {
+ case 1:
+ insert1();
+ break;
+ case 2:
+ insert2();
+ break;
+ case 3:
+ insert3();
+ break;
+ case 4:
+ d_delete();
+ break;
+ case 5:
+ traversebeg();
+ break;
+ case 6:
+ temp2 = h;
+ if (temp2 == NULL)
+ printf("\n Error : List empty to display ");
+ else
+ {
+ printf("\n Reverse order of linked list is : ");
+ traverseend(temp2->n);
+ }
+ break;
+ case 7:
+ search();
+ break;
+ case 8:
+ sort();
+ break;
+ case 9:
+ update();
+ break;
+ case 10:
+ exit(0);
+ default:
+ printf("\n Wrong choice menu");
+ }
+ }
+}
+
+/* TO create an empty node */
+void create()
+{
+ int data;
+
+ temp =(struct node *)malloc(1*sizeof(struct node));
+ temp->prev = NULL;
+ temp->next = NULL;
+ printf("\n Enter value to node : ");
+ scanf("%d", &data);
+ temp->n = data;
+ counter++;
+}
+
+/* TO insert at beginning */
+void insert1()
+{
+ if (h == NULL)
+ {
+ create();
+ h = temp;
+ temp1 = h;
+ }
+ else
+ {
+ create();
+ temp->next = h;
+ h->prev = temp;
+ h = temp;
+ }
+}
+
+/* To insert at end */
+void insert2()
+{
+ if (h == NULL)
+ {
+ create();
+ h = temp;
+ temp1 = h;
+ }
+ else
+ {
+ create();
+ temp1->next = temp;
+ temp->prev = temp1;
+ temp1 = temp;
+ }
+}
+
+/* To insert at any position */
+void insert3()
+{
+ int pos, i = 2;
+
+ printf("\n Enter position to be inserted : ");
+ scanf("%d", &pos);
+ temp2 = h;
+
+ if ((pos < 1) || (pos >= counter + 1))
+ {
+ printf("\n Position out of range to insert");
+ return;
+ }
+ if ((h == NULL) && (pos != 1))
+ {
+ printf("\n Empty list cannot insert other than 1st position");
+ return;
+ }
+ if ((h == NULL) && (pos == 1))
+ {
+ create();
+ h = temp;
+ temp1 = h;
+ return;
+ }
+ else
+ {
+ while (i < pos)
+ {
+ temp2 = temp2->next;
+ i++;
+ }
+ create();
+ temp->prev = temp2;
+ temp->next = temp2->next;
+ temp2->next->prev = temp;
+ temp2->next = temp;
+ }
+}
+
+/* To delete an element */
+void d_delete()
+{
+ int i = 1, pos;
+
+ printf("\n Enter position to be deleted : ");
+ scanf("%d", &pos);
+ temp2 = h;
+
+ if ((pos < 1) || (pos >= counter + 1))
+ {
+ printf("\n Error : Position out of range to delete");
+ return;
+ }
+ if (h == NULL)
+ {
+ printf("\n Error : Empty list no elements to delete");
+ return;
+ }
+ else
+ {
+ while (i < pos)
+ {
+ temp2 = temp2->next;
+ i++;
+ }
+ if (i == 1)
+ {
+ if (temp2->next == NULL)
+ {
+ printf("Node deleted from list");
+ free(temp2);
+ temp2 = h = NULL;
+ return;
+ }
+ }
+ if (temp2->next == NULL)
+ {
+ temp2->prev->next = NULL;
+ free(temp2);
+ printf("Node deleted from list");
+ return;
+ }
+ temp2->next->prev = temp2->prev;
+ if (i != 1)
+ temp2->prev->next = temp2->next; /* Might not need this statement if i == 1 check */
+ if (i == 1)
+ h = temp2->next;
+ printf("\n Node deleted");
+ free(temp2);
+ }
+ counter--;
+}
+
+/* Traverse from beginning */
+void traversebeg()
+{
+ temp2 = h;
+
+ if (temp2 == NULL)
+ {
+ printf("List empty to display \n");
+ return;
+ }
+ printf("\n Linked list elements from begining : ");
+
+ while (temp2->next != NULL)
+ {
+ printf(" %d ", temp2->n);
+ temp2 = temp2->next;
+ }
+ printf(" %d ", temp2->n);
+}
+
+/* To traverse from end recursively */
+void traverseend(int i)
+{
+ if (temp2 != NULL)
+ {
+ i = temp2->n;
+ temp2 = temp2->next;
+ traverseend(i);
+ printf(" %d ", i);
+ }
+}
+
+/* To search for an element in the list */
+void search()
+{
+ int data, counter = 0;
+ temp2 = h;
+
+ if (temp2 == NULL)
+ {
+ printf("\n Error : List empty to search for data");
+ return;
+ }
+ printf("\n Enter value to search : ");
+ scanf("%d", &data);
+ while (temp2 != NULL)
+ {
+ if (temp2->n == data)
+ {
+ printf("\n Data found in %d position",counter + 1);
+ return;
+ }
+ else
+ temp2 = temp2->next;
+ counter++;
+ }
+ printf("\n Error : %d not found in list", data);
+}
+
+/* To update a node value in the list */
+void update()
+{
+ int data, data1;
+
+ printf("\n Enter node data to be updated : ");
+ scanf("%d", &data);
+ printf("\n Enter new data : ");
+ scanf("%d", &data1);
+ temp2 = h;
+ if (temp2 == NULL)
+ {
+ printf("\n Error : List empty no node to update");
+ return;
+ }
+ while (temp2 != NULL)
+ {
+ if (temp2->n == data)
+ {
+
+ temp2->n = data1;
+ traversebeg();
+ return;
+ }
+ else
+ temp2 = temp2->next;
+ }
+
+ printf("\n Error : %d not found in list to update", data);
+}
+
+/* To sort the linked list */
+void sort()
+{
+ int i, j, x;
+
+ temp2 = h;
+ temp4 = h;
+
+ if (temp2 == NULL)
+ {
+ printf("\n List empty to sort");
+ return;
+ }
+
+ for (temp2 = h; temp2 != NULL; temp2 = temp2->next)
+ {
+ for (temp4 = temp2->next; temp4 != NULL; temp4 = temp4->next)
+ {
+ if (temp2->n > temp4->n)
+ {
+ x = temp2->n;
+ temp2->n = temp4->n;
+ temp4->n = x;
+ }
+ }
+ }
+ traversebeg();
+}
\ No newline at end of file
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/mbed-os.lib Mon Sep 16 13:57:00 2019 +0000 @@ -0,0 +1,1 @@ +https://github.com/ARMmbed/mbed-os/#5941d1718339116cd12914238ec331c84da3d08f
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/mbed_app.json Mon Sep 16 13:57:00 2019 +0000
@@ -0,0 +1,11 @@
+{
+ "target_overrides": {
+ "*": {
+ "platform.stack-stats-enabled": true,
+ "platform.heap-stats-enabled": true,
+ "platform.cpu-stats-enabled": true,
+ "platform.thread-stats-enabled": true,
+ "platform.sys-stats-enabled": true
+ }
+ }
+}
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/stats_report.h Mon Sep 16 13:57:00 2019 +0000
@@ -0,0 +1,133 @@
+/* mbed Microcontroller Library
+ * Copyright (c) 2018 ARM Limited
+ * SPDX-License-Identifier: Apache-2.0
+ */
+
+#ifndef STATS_REPORT_H
+#define STATS_REPORT_H
+
+#include <inttypes.h>
+#include "mbed.h"
+
+/**
+ * System Reporting library. Provides runtime information on device:
+ * - CPU sleep, idle, and wake times
+ * - Heap and stack usage
+ * - Thread information
+ * - Static system information
+ */
+class SystemReport {
+ mbed_stats_heap_t heap_stats;
+ mbed_stats_cpu_t cpu_stats;
+ mbed_stats_sys_t sys_stats;
+
+ mbed_stats_thread_t *thread_stats;
+ uint8_t thread_count;
+ uint8_t max_thread_count;
+ uint32_t sample_time_ms;
+
+public:
+ /**
+ * SystemReport - Sample rate in ms is required to handle the CPU percent awake logic
+ */
+ SystemReport(uint32_t sample_rate) : max_thread_count(8), sample_time_ms(sample_rate)
+ {
+ thread_stats = new mbed_stats_thread_t[max_thread_count];
+
+ // Collect the static system information
+ mbed_stats_sys_get(&sys_stats);
+
+ printf("=============================== SYSTEM INFO ================================\r\n");
+ printf("Mbed OS Version: %" PRIu32 " \r\n", sys_stats.os_version);
+ printf("CPU ID: 0x%" PRIx32 " \r\n", sys_stats.cpu_id);
+ printf("Compiler ID: %d \r\n", sys_stats.compiler_id);
+ printf("Compiler Version: %" PRIu32 " \r\n", sys_stats.compiler_version);
+
+ for (int i = 0; i < MBED_MAX_MEM_REGIONS; i++) {
+ if (sys_stats.ram_size[i] != 0) {
+ printf("RAM%d: Start 0x%" PRIx32 " Size: 0x%" PRIx32 " \r\n", i, sys_stats.ram_start[i], sys_stats.ram_size[i]);
+ }
+ }
+ for (int i = 0; i < MBED_MAX_MEM_REGIONS; i++) {
+ if (sys_stats.rom_size[i] != 0) {
+ printf("ROM%d: Start 0x%" PRIx32 " Size: 0x%" PRIx32 " \r\n", i, sys_stats.rom_start[i], sys_stats.rom_size[i]);
+ }
+ }
+ }
+
+ ~SystemReport(void)
+ {
+ free(thread_stats);
+ }
+
+ /**
+ * Report on each Mbed OS Platform stats API
+ */
+ void report_state(void)
+ {
+ report_cpu_stats();
+ report_heap_stats();
+ report_thread_stats();
+
+ // Clear next line to separate subsequent report logs
+ printf("\r\n");
+ }
+
+ /**
+ * Report CPU idle and awake time in terms of percentage
+ */
+ void report_cpu_stats(void)
+ {
+ static uint64_t prev_idle_time = 0;
+
+ printf("================= CPU STATS =================\r\n");
+
+ // Collect and print cpu stats
+ mbed_stats_cpu_get(&cpu_stats);
+
+ uint64_t diff = (cpu_stats.idle_time - prev_idle_time);
+ uint8_t idle = (diff * 100) / (sample_time_ms * 1000); // usec;
+ uint8_t usage = 100 - ((diff * 100) / (sample_time_ms * 1000)); // usec;;
+ prev_idle_time = cpu_stats.idle_time;
+
+ printf("Idle: %d%% Usage: %d%% \r\n", idle, usage);
+ }
+
+ /**
+ * Report current heap stats. Current heap refers to the current amount of
+ * allocated heap. Max heap refers to the highest amount of heap allocated
+ * since reset.
+ */
+ void report_heap_stats(void)
+ {
+ printf("================ HEAP STATS =================\r\n");
+
+ // Collect and print heap stats
+ mbed_stats_heap_get(&heap_stats);
+
+ printf("Current heap: %" PRIu32 "\r\n", heap_stats.current_size);
+ printf("Max heap size: %" PRIu32 "\r\n", heap_stats.max_size);
+ }
+
+ /**
+ * Report active thread stats
+ */
+ void report_thread_stats(void)
+ {
+ printf("================ THREAD STATS ===============\r\n");
+
+ // Collect and print running thread stats
+ int count = mbed_stats_thread_get_each(thread_stats, max_thread_count);
+
+ for (int i = 0; i < count; i++) {
+ printf("ID: 0x%" PRIx32 " \r\n", thread_stats[i].id);
+ printf("Name: %s \r\n", thread_stats[i].name);
+ printf("State: %" PRIu32 " \r\n", thread_stats[i].state);
+ printf("Priority: %" PRIu32 " \r\n", thread_stats[i].priority);
+ printf("Stack Size: %" PRIu32 " \r\n", thread_stats[i].stack_size);
+ printf("Stack Space: %" PRIu32 " \r\n", thread_stats[i].stack_space);
+ }
+ }
+};
+
+#endif // STATS_REPORT_H
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/tests/README.md Mon Sep 16 13:57:00 2019 +0000 @@ -0,0 +1,12 @@ +# Testing examples + +Examples are tested using tool [htrun](https://github.com/ARMmbed/mbed-os-tools/tree/master/packages/mbed-host-tests) and templated print log. + +To run the test, use following command after you build the example: +``` +mbedhtrun -d D: -p COM4 -m K64F -f .\BUILD\K64F\GCC_ARM\blinky.bin --compare-log tests\blinky.log +``` + + +More details about `htrun` are [here](https://github.com/ARMmbed/mbed-os-tools/tree/master/packages/mbed-host-tests#testing-mbed-os-examples). +
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/tests/blinky.log Mon Sep 16 13:57:00 2019 +0000 @@ -0,0 +1,29 @@ +=============================== SYSTEM INFO ================================ +Mbed OS Version: +CPU ID: 0x[0-9a-fA-F]+ +Compiler ID: \d+ +Compiler Version: +================= CPU STATS ================= +Idle: \d+% Usage: \d+% +================ HEAP STATS ================= +Current heap: \d+ +Max heap size: \d+ +================ THREAD STATS =============== +ID: 0x[0-9a-fA-F]+ +Name: main +State: \d+ +Priority: \d+ +Stack Size: \d+ +Stack Space: \d+ +ID: 0x[0-9a-fA-F]+ +Name: rtx_idle +State: \d+ +Priority: \d+ +Stack Size: \d+ +Stack Space: \d+ +ID: 0x[0-9a-fA-F]+ +Name: rtx_timer +State: \d+ +Priority: \d+ +Stack Size: \d+ +Stack Space: \d+