Free Pascal Reference guide Reference guide for Free Pascal, version 3.2.2 Document version 3.2.2 May 2021 Michaël Van Canneyt Contents 1 Pascal Tokens 12 1.1 Symbols . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 1.3.1 Turbo Pascal reserved words . . . . . . . . . . . . . . . . . . . . . . . . . . 14 1.3.2 Object Pascal reserved words . . . . . . . . . . . . . . . . . . . . . . . 156 11 Objective-Pascal Classes 159 11.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 159 11.2 Objective-Pascal class declarations . . . . .

Free Pascal User’s Guide User’s Guide for Free Pascal, Version 3.2.2 Document version 3.2.2 May 2021 Michaël Van Canneyt Florian Klämpfl Contents 1 Introduction 7 1.1 About this document . . . . . . . 91 7 Porting and portable code 95 7.1 Free Pascal compiler modes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 7.2 Turbo Pascal . . . . . . . . . . . . . . . . . . . . . . . Things which are extra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98 7.2.3 Turbo Pascal compatibility mode . . . . . . . . . . . . . . . . . . . . . . . . 99 7.2.4 A note on long file

Free Pascal Programmer’s Guide Programmer’s Guide for Free Pascal, Version 3.2.2 Document version 3.2.2 May 2021 Michaël Van Canneyt Contents 1 Compiler directives 14 1.1 Introduction . . . . . . memory under the Go32 extender . . . . . . . . . . . . . . . . . . . . . 115 8.6 When porting Turbo Pascal code . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116 8.7 Memavail and Maxavail . . . . . . . . . . . . . 138 12.3 Using a library in a pascal program . . . . . . . . . . . . . . . . . . . . . . . . . . . 139 12.4 Using a pascal library from a C program . . . . . . . . . . . . . .

today • Very quick review of concurrency and lock-free programming • Review the “bread and butter” of lock-free design patterns • Define wait-free algorithms, understand the definition and practical an elegant wait-free algorithm and wait-free design • Some simple benchmarks Some assumed knowledge • You know what std::atomic does and what it is used for • You’ve heard of lock-free programming and Obstruction free (progress in isolation): A single thread executed in isolation will complete the operation in a bounded number of steps. • Obstruction-free algorithms are immune to deadlock • Lock free (at

CPPCON 2020 / CPPCON 2020 / MACRO-FREE TESTING MACRO-FREE TESTING WITH C++20 WITH C++20 | | | | HTTPS://BOOST-EXT.GITHUB.IO/UT/CPPCON-2020 HTTPS://BOOST-EXT.GITHUB.IO/UT/CPPCON-2020 KRIS@JUSIAK SINGLE (2K LOC) WITH NO EXTERNAL DEPENDENCIES (2K LOC) WITH NO EXTERNAL DEPENDENCIES MACRO-FREE (✔ ) MACRO-FREE (✔ ) (*) LIMITATIONS MAY APPLY (*) LIMITATIONS MAY APPLY HTTPS://GITHUB.COM/BOOST-EXT/UT SINGLE (2K LOC) WITH NO EXTERNAL DEPENDENCIES (2K LOC) WITH NO EXTERNAL DEPENDENCIES MACRO-FREE (✔ ) MACRO-FREE (✔ ) FEATURES ( FEATURES ( , , , , , , , , , , , , , , ) (*) LIMITATIONS MAY APPLY

head) ● Busy polling on full / empty vs. sync using system calls ● Blocking / non blocking / wait-free ● Data ownership or just value propagation 13 CppCon 2024 | Erez Strauss | Lockfree, MPMC Queue instructions ● std::atomic - provides load / store / compare_exchange ● std::atomic::is_always_lock_free ● Load and Store of aligned 8 bytes ● CAS ( old-expected, new-value ) - atomic Compare And Swap

reliable sources such as Boost.Lockfree? ● Writing such a fifo is a fairly gentle introduction to lock free programming. ● There are some interesting performance optimizations that can be made. ● You may net/home/lock-free-algorithms/queues/unbounded-spsc-queue https://www.dpdk.org/ 3● Single producer: one producer (aka writer) thread ● Single consumer: one consumer (aka reader) thread ● Lock-free: it doesn’t doesn’t use mutex locks. At any point of time, some thread will make progress. ● Wait-free: each thread moves forward regardless of other threads. ● [Circular] Fifo [or Queue]: a single, fixed-size buffer

Deferred reclamation, i.e., garbage collection in C++ Some assumed knowledge • You’ve heard of lock-free programming and know what a compare_exchange is • You know roughly what atomic does and what it is Deferred reclamation, i.e., garbage collection in C++ Some assumed knowledge • You’ve heard of lock-free programming and know what a compare_exchange is • You know roughly what atomic does and what it is danielanderson.net std::atomic How many lines does it take to implement a lock-free & memory-safe stack? template struct Stack { struct Node { T t; shared_ptr

FPDoc Free Pascal code documenter: Reference manual Reference manual for FPDoc Document version 3.2.2 May 14, 2021 Michaël Van Canneyt Contents 1 Introduction 5 1.1 About this document . . . . . Specify table caption . . . . . . . . . . . . . . . . . . . . . . . . . 30 5.3.5 code : format as pascal code . . . . . . . . . . . . . . . . . . . . . . . . . . 30 5.3.6 descr : Descriptions . . . . 1 Introduction 1.1 About this document This is the reference manual for FPDOC, a free documentation tool for Pascal units. It describes the usage of FPDOC and how to write documentation with it. It

Free Pascal Resource support (FCL-res): Reference guide. Reference guide for FCL-res units. Document version 3.2.2 May 2021 Giulio Bernardi Contents 0.1 Introduction . . . . . . . . . . . . . . . functions and procedures as they are declared in the units that come standard with the FCL-res (Free Pascal Resource support). Throughout this document, we will refer to functions, types and variables with types or new file readers/writers. Please note that resources aren’t limited to Windows platform: Free Pascal can use them also on ELF and Mach-O targets. Moreover, this library can be useful for cross-compilation