gcc

Tag

Cards List
#gcc

Computed goto for efficient dispatch tables (2012)

Hacker News Top · 2026-06-17 Cached

Explains the use of GCC's computed goto extension to improve the performance of bytecode VM dispatch tables compared to traditional switch statements, with a simple example.

0 favorites 0 likes
#gcc

Rotation revisited: A shocking discovery about gcc’s unidirectional rotation algorithm

The Old New Thing (Raymond Chen) · 2026-06-03 Cached

Raymond Chen explores gcc libstdc++'s rotation algorithm for random-access iterators, revealing it is fundamentally the same as the forward-iterator rotation algorithm, just viewed from a different perspective. The post is part of a series comparing rotation implementations across compilers.

0 favorites 0 likes
#gcc

BPF support in GCC 16 and beyond

Lobsters Hottest · 2026-06-02 Cached

José Marchesi and the GCC-BPF team provided an update on BPF support in GCC 16, highlighting progress toward feature parity with LLVM and increasing pass rate of the kernel's BPF self-tests.

0 favorites 0 likes
#gcc

On C extensions, portability, and alternative compilers

Lobsters Hottest · 2026-05-25 Cached

This article discusses the practical challenges of writing portable C code due to reliance on non-standard compiler extensions and glibc's conditional headers, illustrating with examples from building a C compiler.

0 favorites 0 likes
#gcc

Host-Tuned GCC for Faster Compilation

Lobsters Hottest · 2026-05-25 Cached

This blog post explains how to build a host-tuned GCC compiler using profile-guided optimization, LTO, and -O3 to achieve faster compilation times, with detailed instructions and benchmarks.

0 favorites 0 likes
#gcc

New features in GCC 16: Improved error messages and SARIF output

Hacker News Top · 2026-05-19 Cached

GCC 16 introduces improved hierarchical error messages for C++ templates and updated SARIF machine-readable diagnostic output, enhancing developer experience.

0 favorites 0 likes
#gcc

When compilers surprise you

Lobsters Hottest · 2026-04-19 Cached

Matt Godbolt explores compiler optimizations that convert an O(n) summation loop into an O(1) closed-form solution, highlighting how Clang and GCC employ sophisticated techniques like loop unrolling and mathematical simplification to dramatically improve code performance.

0 favorites 0 likes
← Back to home

Submit Feedback