ciere.com Using C libraries in your Modern C++ Embedded Project EtherCAT Stack, C++17, and Modern C++ Idioms ciere consulting Michael Caisse mcaisse@ciere.com Copyright © 2021 Michael Caisse Using Embedded Project ciere.com Beckhoff SSC extern "C" SSC Beckhoff SSC - Slave Stack Code “The EtherCAT Slave Stack Code (SSC) is a code written in ANSI C. Its modular and simple structure enables fast *pdo_out) { // UGLY THINGS WE DON'T PUT ON SLIDES } } extern "C" { // This is the main loop in the SSC stack. void MainLoop(void); } int main() { init(); while (1U) { // The SSC main loop handles the EtherCAT

Web on Reactive Stack Version 5.3.36-SNAPSHOT Table of Contents 1. Spring WebFlux. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 176 This part of the documentation covers support for reactive-stack web applications built on a Reactive Streams API to run on non-blocking servers, such as Netty, reactive WebClient, support for testing, and reactive libraries. For Servlet-stack web applications, see Web on Servlet Stack. 1 Chapter 1. Spring WebFlux The original web framework included in the Spring

Web on Servlet Stack Version 5.3.36-SNAPSHOT Table of Contents 1. Spring Web MVC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 252 This part of the documentation covers support for Servlet-stack web applications built on the Servlet API and deployed to Servlet containers. Individual chapters MVC, View Technologies, CORS Support, and WebSocket Support. For reactive-stack web applications, see Web on Reactive Stack. 1 Chapter 1. Spring Web MVC Spring Web MVC is the original web framework

parametrized family of classes • Let's write a simple stack adaptor with some special features in a header 48 //- header Stack.hpp template class Stack { vector m_data; public: bool is_empty() Copyright © 2021 Bob Steagall 49 Class Templates – Template Parameter Scope template class Stack { vector m_data; public: bool is_empty() const; T const& top() const; void pop(); Copyright © 2021 Bob Steagall 50 Class Templates – Defining Member Functions template class Stack { vector m_data; public: bool is_empty() const; T const& top() const; void pop();

process_file(...) pool.run() _clone … … process_file(...) pool.run() _clone … … Stack Traces for Async Code are Unhelpful Threadpool threads: #0 process_file(...) #5 pool.run() Async frames:• Walk the regular stack… ﹘ …until we find the first async frame So what do we need? • Walk the async stack… ﹘ …until we find the end • Walk the regular stack back to main How? How?0 : :0Walking the stack CPU ret* prev* data frame* instr* process_fileWalking the stack CPU ret* prev* data ret* prev* data frame* instr* process_file coro::resumeWalking the stack CPU ret* prev*

Implementation of Quantifiable Stack/Queue Live DemonstrationMotivation Quantifiability Vector Space Entropy Measurement Design and Implementation of Quantifiable Stack/Queue Live Demonstration Overview Correctness and Performance Engineering Case Study: k-FIFO Queue Design and Implementation of Quantifiable Stack/Queue Live Demonstration Design and Implementation of Highly Scalable Quantifiable Data Structures 2MotivationMotivation Quantifiability Vector Space Entropy Measurement Design and Implementation of Quantifiable Stack/Queue Live Demonstration Correctness Conditions A correctness condition defines correct behavior

user-defined functions, and cross-module inlining, in combination with the preference for value-based, stack-located data types, lead to extremely efficient code. Multi-threading, asynchronous input/output are destroyed when the block is exited. This holds true in principle, and at least for ordinary stack-allocated value variables; however, things are a bit more complicated for references and pointer variables a and b defined in that proc are indeed stack-allocated and local to the scope of that procedure.. The variables a and b are created on the stack when the procedure is called, that is, when its

user-defined functions, and cross-module inlining, in combination with the preference for value-based, stack-located data types, lead to extremely efficient code. Multi-threading, asynchronous input/output are destroyed when the block is exited. This holds true in principle, and at least for ordinary stack-allocated value variables; however, things are a bit more complicated for references and pointer variables a and b defined in that proc are indeed stack-allocated and local to the scope of that procedure.. The variables a and b are created on the stack when the procedure is called, that is, when its

inheritance and polymorphic mechanisms, • Member Data Pointers, • Member Function Pointers, • * Stack Frame / Base Pointer mechanics • * Construction/Destruction order, • * Running code before and after Hood – Stack Frame / Base Pointer Mechanics 121C++ Under the Hood – Stack Frame / Base Pointer Mechanics 122C++ Under the Hood – Stack Frame / Base Pointer Mechanics 123C++ Under the Hood – Stack Frame Hood – Stack Frame / Base Pointer Mechanics 125C++ Under the Hood – Stack Frame / Base Pointer Mechanics 126C++ Under the Hood – Stack Frame / Base Pointer Mechanics 127C++ Under the Hood – Stack Frame

methods[1](arg). 7.4 Stack Splitting The Go language makes it very easy to create a new thread of execution via the go statement. Naturally a new thread of execution must allocate a stack. Making the stack too large large will waste address space. Making the stack too small risks stack overrun. Gccgo address this problem via stack splitting. The start of each func- tion has a short sequence of instructions, typically room on the current stack for the function’s stack frame. If there is not, a new stack segment is automatically al- located, in such a way that when the function returns the stack automatically moves back