Added functionality for creating a task structure

Added code describing the structure of the task image (plus headers and a draft of the sch_assertion notification system). Also, in the example on the STM32, the current interface for creating the structure of an executable procedure is considered (adding priority, IRQ, handler function (writing the initialization function, that is, automatic initialization of the task, is postponed for the future))

Author: drowsymike

.gitignore

@@ -0,0 +1,3 @@
+*.hex
+*.bin
+*.elf

.vscode/c_cpp_properties.json

@@ -3,11 +3,13 @@
         {
             "name": "STM32F4",
             "includePath": [
-                "${workspaceFolder}/examples/stm32_f4x/config",
-                "${workspaceFolder}/examples/stm32_f4x/app/inc",
-                "${workspaceFolder}/examples/stm32_f4x/platform/hal/Inc",
-                "${workspaceFolder}/examples/stm32_f4x/platform/cmsis/CMSIS/Include",
-                "${workspaceFolder}/examples/stm32_f4x/platform/cmsis/CMSIS/Device/ST/STM32F4xx/Include",
+                "${workspaceFolder}/examples/stm32f4x/config",
+                "${workspaceFolder}/examples/stm32f4x/app/inc",
+                "${workspaceFolder}/examples/stm32f4x/platform/hal/Inc",
+                "${workspaceFolder}/examples/stm32f4x/platform/cmsis/CMSIS/Include",
+                "${workspaceFolder}/examples/stm32f4x/platform/cmsis/CMSIS/Device/ST/STM32F4xx/Include",
+                "${workspaceFolder}/scheduler/inc",
+                "${workspaceFolder}/scheduler/src",
                 "${workspaceFolder}/**"
             ],
             "defines": [

doc/glossary.md

@@ -0,0 +1,8 @@
+# Definitions
+OSEK/VDX - a standart what defines the image of systems of timer divining in RTU (in taskers)  
+  
+BCC - a standart what defines types of RTU systems and schedulers. There're:  
+1. BCC1 - supports basic tasks and one activation (one other processing task)
+2. BCC2 - supports basic tasks and undefined quantity of other processing tasks
+3. ECC1 - supports basic tasks, undefined quantity of other processing tasks and advanced tasks
+4. ECC2 - supports basic tasks, undefined quantity of other processing tasks, advanced tasks, events and waitings

doc/sst_review.md

@@ -0,0 +1,38 @@
+# Foreword
+You can see the SST project following the link: https://github.com/QuantumLeaps/Super-Simple-Tasker/  
+  
+# Global architecture
+`dbc_assert.h` consists of a lot of basic definitions what're used in source files
+SST provides to you a fucntional for:
+1. Changing the module's name;
+2. Checking the main assesrtionts about hardware parameters and task parameters (existion, usage and etc.);
+3. Creating the queue of processing tasks;
+4. Doing some arbitration between all of these tasks, what're storing in the queue
+
+## Structure  
+### Modules  
+SST contains a lot of modules. The module within the framework of the topic of SST - is every .c-file with
+appropriate to it .h-file. `main.c` - is a module, `sst.c` is a module too. And looking ahead, SST provides
+some functions for debugging - they can show messages about errors in concrete modules. So, there's a global
+'list' of modules
+  
+`DBC` - is a system (what's described in `dbc_assertionb.h`, as far as I remember) for debugging and showing
+some debug messages about errors during the processing of some task  
+DBC includes macroses `DBC_MODULE_NAME`, `DBC_ASSERT`, `DBC_ALLEGE`, `DBC_ERROR`, `DBC_REQUIRE`, `DBC_ENSURE`,
+`DBC_INVARIANT` and all of it only for checking of asserting the user about some errors
+  
+`SST` - the scheduler itself. In repo there're two variations of it: `sst0` and `sst` (first is the scheduler
+what's built following the standart BCC0, and the second one - by BCC2)  
+  
+  
+### Tasks  
+Within the framework of the topic of SST task is a fucntion. A task must be framed by preconditions and
+postconditions. It helps to scheduler to check the execution of tasks at the time of context switching or 
+other interruptions
+  
+  
+### The process of handling
+The sequence:
+1. At the start - some quantity of active tasks
+2. Sorting tasks by theirs prioroty
+3. Processing