Security Beyond Memory SafetyPerspective Security Beyond Memory Safety Using Modern C++ to Avoid Vulnerabilities by DesignMax Hoffmann Security Beyond Memory Safety CppCon 2024 2 Security Beyond Memory Safety Using Modern C++ to Security Beyond Memory Safety CppCon 2024 3 FIFTY SHADES OF SHOOTING YOURSELF IN THE FOOT WITH A RAILGUNMax Hoffmann Security Beyond Memory Safety CppCon 2024 4Max Hoffmann Security Beyond Memory Safety CppCon Security Beyond Memory Safety CppCon 2024 6Max Hoffmann Security Beyond Memory Safety CppCon 2024 7Max Hoffmann Security Beyond Memory Safety CppCon 2024 8Max Hoffmann Security Beyond Memory Safety CppCon0 码力 | 79 页 | 4.15 MB | 6 月前3
A Relaxed Guide to memory_order_relaxedA Relaxed Guide to memory_order_relaxed Hans Boehm Paul E. McKenney Google Facebook CPPCON 2020std::atomic/std::atomic_ref and memory_order_relaxed ● C++ atomic sacrificing the simple threads-as-interleaving semantics ● by passing memory_order enum values to explicit atomic operations. ● In particular, memory_order_relaxed allows arbitrary visibility reordering with respect About memory_order_relaxed? ● Just a load, just a store: Full control, excellent efficiency and scalability! ○ Assuming aligned machine-sized atomic objects, that is…What is Not to Like About memory_order_relaxed0 码力 | 32 页 | 278.53 KB | 6 月前3
Installing Ubuntu from a USB memory stickUbuntu from a USB memory stick This guide will help you install Ubuntu on your computer by using a USB memory stick. USB memory sticks are sometimes known as flash drives, memory pens or USB Mass Storage Storage devices. Installing from a memory stick is useful if you have a computer without a CD drive (like a netbook), or prefer the convenience of a memory stick. Alternative methods are available, are running Windows. 1. What do I need to get started? To install Ubuntu from a USB memory stick you need: • A memory stick with a capacity of at least 2GB. It will be formatted (erased) during this process0 码力 | 3 页 | 128.18 KB | 1 年前3
Practical memory pool based allocators for Modern C++© 2019 Apex.AI, Inc. Safe and certified software for autonomous mobility TM Practical memory pool based allocators for Modern C++ by Misha Shalem misha.shalem@apex.ai © 2020 Apex.AI, Inc.● CppCon Andreas Pasternak ● Quote: “Memory pools and allocators are only one piece of the solution” Today we going to talk about this one piece in (more) depth © 2020 Apex.AI, Inc.Memory allocations in real-time practically for C++ memory allocations? We asked an independent 3rd party safety assessor and the answer was “It should comply to Autosar C++ 14 Coding Guidelines regarding memory allocations” © 20200 码力 | 49 页 | 986.95 KB | 6 月前3
Object Introspection: A Revolutionary Memory Profiler for C++ ObjectsBar std::string Bar std::string Bar std::stringObject Introspection (OI) Goals • Byte level memory footprint analysis for objects • Complete object type hierarchies • Dynamic allocations and containers hierarchy from a given root type • Understand the layout in memory of the entire hierarchy • Understand how to interpret data at memory offsets • Understand containers • Compiler generated debug Object Introspection Measurement Code Code GenerationApplied Example 1 • Unused container memory: Unused Sz = (C.capacity() - C.size()) * sizeof(element) Name TypeName Number ElemStatSz Length0 码力 | 62 页 | 2.24 MB | 6 月前3
C++ Memory Model: from C++11 to C++23Memory Model C++11 – C++23About Me: alex.dathskovsky@speedata.io www.linkedin.com/in/alexdathskovsky https://www.cppnext.comAlex Dathskovsky | alex.dathskovsky@speedata.io | www.linkedin.com/in/a hazards • an instruction can be executed when its operands have been calculated or loaded from memory • an instruction stalls if operands are not availableAlex Dathskovsky | alex.dathskovsky@speedata com/in/alexdathskovsky Reordering Types • Data dependencies must be honored • C++ compiler may reorder any memory access under the as-if rule • Different processors have different reordering guarantiesAlex0 码力 | 112 页 | 5.17 MB | 6 月前3
Go 101 (Golang 101) v1.21.0Explain Panic/Recover Mechanism in Detail - also explains exiting phases of function calls. §32. Code Blocks and Identifier Scopes §33. Expression Evaluation Orders §34. Value Copy Costs in Go §35. Bounds Check sync/atomic standard package. §41. Memory Order Guarantees in Go §42. Common Concurrent Programming Mistakes Memory Related §43. Memory Blocks §44. Memory Layouts §45. Memory Leaking Scenarios Some Summaries language, Go is flexible as many dynamic script languages is the main selling point of Go language. Memory saving, fast program warming-up, fast code execution speed and fast compilations combined is another0 码力 | 610 页 | 945.17 KB | 1 年前3
Go 101 (Golang 101) v1.21.0Explain Panic/Recover Mechanism in Detail - also explains exiting phases of function calls. §32. Code Blocks and Identifier Scopes §33. Expression Evaluation Orders §34. Value Copy Costs in Go §35. Bounds sync/atomic standard package. §41. Memory Order Guarantees in Go §42. Common Concurrent Programming Mistakes Memory Related §43. Memory Blocks §44. Memory Layouts §45. Memory Leaking Scenarios Some Summaries as many dynamic script languages is the main selling point of Go language. §0. About Go 101 5 Memory saving, fast program warming-up, fast code execution speed and fast compilations combined is another0 码力 | 630 页 | 3.77 MB | 1 年前3
Go 101 (Golang 101) v1.21.0Explain Panic/Recover Mechanism in Detail - also explains exiting phases of function calls. §32. Code Blocks and Identifier Scopes §33. Expression Evaluation Orders §34. Value Copy Costs in Go §35. Bounds Check sync/atomic standard package. §41. Memory Order Guarantees in Go §42. Common Concurrent Programming Mistakes Memory Related §43. Memory Blocks §44. Memory Layouts §45. Memory Leaking Scenarios Some Summaries language, Go is flexible as many dynamic script languages is the main selling point of Go language. Memory saving, fast program warming-up, fast code execution speed and fast compilations combined is another0 码力 | 880 页 | 833.34 KB | 1 年前3
Computer Programming with the Nim Programming Language
interface (FFI) to create bindings to C libraries, and internal compiler details like the various memory management options and all the pragmas.[1] Also, we do not intend to fill the book with redundant in Nim 2.0 is that ORC memory management has become the default indicating that it is considered ready for use in production. ORC gives us GC-like, fully deterministic memory management with minimal to manual memory handling. It reduces the maximal memory consumption of apps, avoids GC-generated delays, and may increase the performance of our programs. Additionally, ARC and ORC memory management0 码力 | 865 页 | 7.45 MB | 1 年前3
共 1000 条
- 1
- 2
- 3
- 4
- 5
- 6
- 100













