3D Graphics for Dummies Significant content “borrowed” from Dan Chang @ Nintendo NTD “with permission” Chris Ryan CppCon 2021 github.com/ChrisR98008/CppCon20213 3D Graphics for Dummies4 3D Graphics Dummies5 3D Graphics for Dummies6 3D Graphics for Dummies7 3D Graphics for Dummies8 3D Graphics for Dummies9 3D Graphics for Dummies10 3D Graphics for Dummies11 3D Graphics for Dummies12 3D Graphics Graphics for Dummies13 3D Graphics for Dummies14 3D Graphics for Dummies15 3D Graphics for Dummies Winding / Right Hand Rule Fingers curled in the order of the points, thumb points up Counter clockwise

Build "ARM GNU Toolchain download" 55 Step 2. Find and modify -fno-exceptions → -fexceptionsStep 3: Define low level C API: _sbrk 56 extern "C" { std::array heap_memory {}; std::span -91% size reduction 67Barrier #3 Uses dynamic allocation 68Barrier #3: What is a throw expression in assembly? 0000800c : 800c: b508 push {r3, lr} 800e: 2004 movs <__cxa_allocate_exception> 8014: 2305 movs r3, #5 8016: 4902 ldr r1, [pc, #8] 8018: 6003 str r3, [r0, #0] 801a: 2200 movs r2, #0 801c:

std::endl; } ~Foo() { std::cout << "~Foo()" << std::endl; } }; int main() { Foo a; { Foo b; } } 1 2 3 4 5 6 7 8 9 10 11 21 Constructors & Destructorshttps://godbolt.org/z/ffzG8hPT8 struct Foo { Foo() std::endl; } ~Foo() { std::cout << "~Foo()" << std::endl; } }; int main() { Foo a; { Foo b; } } 1 2 3 4 5 6 7 8 9 10 11 22 Constructors & Destructorshttps://godbolt.org/z/ffzG8hPT8 struct Foo { Foo() ~Foo() { std::cout << "~Foo()" << std::endl; } }; int main() { Foo a; // Foo() { Foo b; } } 1 2 3 4 5 6 7 8 9 10 11 23 Constructors & Destructorshttps://godbolt.org/z/ffzG8hPT8 struct Foo { Foo()

CppCon 2020 - Adventures in SIMD Thinking 2Copyright © 2020 Bob Steagall K E W B C O M P U T I N G 3 CppCon 2020 - Adventures in SIMD Thinking Getting Started #include #include #include load_from(float const* psrc) { return _mm512_loadu_ps(psrc); } m0 m1 m2 m3 m4 m5 m6 m7 m8 m9 m10 m11 m12 m13 m14 m15 m0 m1 m2 m3 m4 m5 m6 m7 m8 m9 m10 m11 m12 m13 m14 m15 psrcCopyright © 2020 Bob Steagall _mm512_mask_loadu_ps(_mm512_set1_ps(fill), (__mmask16) mask, psrc); } m0 m1 m2 m3 m4 m5 m6 m7 m8 m9 m10 m11 m12 m13 m14 m15 f f m2 m3 f f m6 m7 f f f f m12 m13 m14 m15 f 0 0 1 1 0 0 1 1 0 0 0 0 1 1 1 1 fill

• I might have promised too much content in the talk’s abstract. Sorry. Matthias Kretz CppCon ’23 3 GSI Helmholtz Center for Heavy Ion ResearchMotivation std::simd Overview Example: Image Processing Programming execute the same work in less time x0 + a x1 + a x2 + a x3 + a x4 + a x5 + a x6 + a x7 + a x8 + a x9 + a · · · Time x0 + a x1 + a x2 + a x3 + a x4 + a x5 + a x6 + a x7 + a x8 + a x9 + a · · instructions in one CPU cycle, or • execute the same work in even less time x0 + a x1 + a x2 + a x3 + a x4 + a x5 + a x6 + a x7 + a x8 + a x9 + a x10 + a x11 + a x12 + a x13 + a x14 + a x15

robotics startups: Fetch Robotics (2016-2022) Thirdwave.ai (2022-2023) Tortuga AgTech (present) 3About Me Mostly doing: General architecture and frameworks around robot systems Navigation and perception return prev[] # return predecessors to recover path 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 66Dijkstra's algorithm (early stopping) function predecessors to recover path 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 function Dijkstras(Graph, source, target): 1 2 for each vertex v in Graph.Vertices: 3 prev[v] ← UNDEFINED

vertical_center(WidgetContainer const& c) { } 1 2 auto rects = tc::make_vector(tc::transform(c, 3 [](widget const& w) { return w.bounding_box(); } 4 )); 5 // Magic happens 6 tc::for_each(tc::zip(c vertical_center(WidgetContainer const& c) { } 1 2 auto rects = tc::make_vector(tc::transform(c, 3 [](widget const& w) { return w.bounding_box(); } 4 )); 5 // Magic happens 6 tc::for_each(tc::zip(c https://github.com/think-cell/think-cell-library 1 2 void vertical_center(WidgetContainer const& c) { 3 4 5 // Magic happens 6 tc::for_each(tc::zip(c, rects), 7 [&](widget& w, rect r) { 8 widget

have a dynamic allocator we don't have an rtos 3STM32L432KC 26 GPIO 14 communication interfaces (USB, SAI, I2C, CAN, …) Quad SPI memory interface 11 Timers 3 cap-sense channels 1 ADC 2 DAC 4Interruptstime backwards one character at a time. 3. When done, yell "End of Line" Producer ID 2 1. Count the number of people in your row. 2. Tell Ben the count one digit at a time. 3. When done, yell "End of Line" [] { return 42; }, [] { do_something(); }, [] { return 17; }); 1 2 3 4 19schedule Sender Factories Functions that return senders. auto sndr = sched.schedule(); 1 20continue_on

ships there is a plan: much committee work has gone virtual subgroup meetings on going every week 3 virtual plenary sessions / year opened the door to participation! http://wg21.link/P0592 2Status of ships there is a plan: much committee work has gone virtual subgroup meetings on going every week 3 virtual plenary sessions / year opened the door to participation! http://wg21.link/P0592 c++26 schedule missed the train really - there's so much more despite the above 26 will be large cppreference 26 3Priorities for this talk discuss the smaller features focus more on everyday programmer features new

Disable Cuda warnings host device template 3 The dark path Function dispatch triple 4 Cuda proposal Conditional host device Forbid bad cross function calls 3/664/66 Motivation Patterns The dark path proposal Thank you Motivation 1 Motivation Audience etc.. Cuda crash course Quiz time 2 Patterns 3 The dark path 4 Cuda proposal5/66 Motivation Patterns The dark path Cuda proposal Thank you Motivation: � � 1 #include 2 3 __device__ int print () { return 0; } 4 __global__ void kernel () { printf( "%i", print () ); } 5 __host__ void start () { kernel <<< 2, 3 >>>(); } 6 7 int main () { //