Trending

#Compiler

Latest posts tagged with #Compiler on Bluesky

Latest Top

Posts tagged #Compiler

The Story of Writing
The Story of Writing
@sownow.bsky.social
5 hours ago
was a computer scientist – long before most people even used the word “computer.” At the time, coding required the use of symbols. Hopper thought the computers should translate English into the machine code that told computers how to work. Among her peers, only a few believed that was possible. So, Hopper made what she called a compiler that did what she envisioned. By the mid-50s, Hopper took a leading role in developing new code, including COBOL. It became the most commonly used computer language for businesses. Originally written in the 1950s, COBOL still processes millions of ATM transactions and billions of dollars in purchases – every day.

was a computer scientist – long before most people even used the word “computer.” At the time, coding required the use of symbols. Hopper thought the computers should translate English into the machine code that told computers how to work. Among her peers, only a few believed that was possible. So, Hopper made what she called a compiler that did what she envisioned. By the mid-50s, Hopper took a leading role in developing new code, including COBOL. It became the most commonly used computer language for businesses. Originally written in the 1950s, COBOL still processes millions of ATM transactions and billions of dollars in purchases – every day.

A photo of Grace Hopper, standing in a room full of machines - each one taller than Hopper herself - that were early forms of computers. Image source: Yale News

A photo of Grace Hopper, standing in a room full of machines - each one taller than Hopper herself - that were early forms of computers. Image source: Yale News

On this day in 1959 a group of tech-minded people first got together to talk about creating a new computer programming language. It became the “common business-oriented language” or COBOL.
Its development revolved around Grace Hopper.

#Tech #Coding #Compiler #History #OTD

2 2 0 0
SearchEngine
SearchEngine
@searchengine.activitypub.awakari.com.ap.brid.gy
17 hours ago
Original post on webpronews.com

Intel’s Secret Weapon for GPU Performance: A New Shader Compiler Called Jay Is Taking Shape Inside Mesa Intel engineers are building Jay, a new shader compiler backend within the Mesa 3D graphics...

#DevNews #Intel #Arc #GPU #drivers #Intel #Jay #shader […]

[Original post on webpronews.com]

0 0 0 0
Brian Swetland
Brian Swetland
@swetland.frotz.net
1 day ago
The best method for counting bits in a 32-bit integer v is the following: v = v - ((v >> 1) & 0x55555555); // reuse input as temporary v = (v & 0x33333333) + ((v >> 2) & 0x33333333); // temp c = ((v + (v >> 4) & 0xF0F0F0F) * 0x1010101) >> 24; // count The best bit counting method takes only 12 operations, which is the same as the lookup-table method, but avoids the memory and potential cache misses of a table. It is a hybrid between the purely parallel method above and the earlier methods using multiplies (in the section on counting bits with 64-bit instructions), though it doesn't use 64-bit instructions. The counts of bits set in the bytes is done in parallel, and the sum total of the bits set in the bytes is computed by multiplying by 0x1010101 and shifting right 24 bits.

The best method for counting bits in a 32-bit integer v is the following: v = v - ((v >> 1) & 0x55555555); // reuse input as temporary v = (v & 0x33333333) + ((v >> 2) & 0x33333333); // temp c = ((v + (v >> 4) & 0xF0F0F0F) * 0x1010101) >> 24; // count The best bit counting method takes only 12 operations, which is the same as the lookup-table method, but avoids the memory and potential cache misses of a table. It is a hybrid between the purely parallel method above and the earlier methods using multiplies (in the section on counting bits with 64-bit instructions), though it doesn't use 64-bit instructions. The counts of bits set in the bytes is done in parallel, and the sum total of the bits set in the bytes is computed by multiplying by 0x1010101 and shifting right 24 bits.

Visiting graphics.stanford.edu/~seander/bit... to refresh myself on the Deep Magic of counting bits, trailing zeroes, etc efficiently on architectures not blessed with single instructions for such purposes.

#Projects #Compiler

1 0 0 0
lostjared
lostjared
@lostjared.bsky.social
1 day ago
Post image Post image

Side by Side of MXVM Pascal and its MXVM IR Equivalent.
#softwareengineering #compiler #IR #software

2 0 0 0
Thakee Nathees
Thakee Nathees
@thakee.bsky.social
2 days ago
Post image

Being too perfectionist sometimes

github.com/ThakeeNathee...
#TypeSystem #Compiler

0 0 0 0
Brian Swetland
Brian Swetland
@swetland.frotz.net
3 days ago
Post image

Having fun poking at the IR peephole optimizer. As of this afternoon's changes, IR instructions in md5_step() are reduced by 29% by the peephole optimizer and dead instruction elimination.

Here's a diff of one of the basic blocks in that function before/after optimization.

#Projects #Compiler

1 0 0 0
Wave Foundation
Wave Foundation
@wavefnd.org
1 week ago
Patch #311: Precision in Linking: Introducing -C link-sysroot and Enhanced Validation When building software for different architectures or embedded systems, managing the

This is patch #311

#OpenSource #Wave #Compiler #Patch

blog.wave-lang.dev/post/2026-04...

1 0 0 0
Bongstacks - Fowl Monster, Ranked Dank
Bongstacks - Fowl Monster, Ranked Dank
@bonstackstokin.bsky.social
1 week ago
Post image

Don't fuck with me #NASA

That's just a #COMPILER

#Marathon

0 0 0 0
Gapry
Gapry
@gapry.bsky.social
1 week ago
Gapry's Blog

[ #compiler ] I wrote a study notes blog post on Day 9 of Matt Godbolt's Advent of Compiler Optimisations 2025 series: "Induction variables and loops".

Read more here: gapry.github.io/2026/03/31/A...

1 0 0 0
Gapry
Gapry
@gapry.bsky.social
1 week ago
Gapry's Blog

[ #compiler ] I wrote a study notes blog post on Day 8 of Matt Godbolt's Advent of Compiler Optimisations 2025 series: "Going loopy".

Read more here: gapry.github.io/2026/03/31/A...

0 0 0 0
Gapry
Gapry
@gapry.bsky.social
1 week ago
Gapry's Blog

[ #compiler ] I wrote a study notes blog post on Day 7 of Matt Godbolt's Advent of Compiler Optimisations 2025 series: "Division by a Constant".

Read more here: gapry.github.io/2026/03/31/A...

1 0 0 0
Wave Foundation
Wave Foundation
@wavefnd.org
1 week ago
Patch #310: To the Bare Metal: RISC-V Support and Freestanding Targets As we continue to build Wave into a versatile systems language, our goal is to support not just high-level applications, but also the

This is patch #310

#OpenSource #Wave #Compiler #Patch

blog.wave-lang.dev/post/2026-03...

1 0 0 0
Brian Swetland
Brian Swetland
@swetland.frotz.net
1 week ago

Whee. Compiler stage3 now passes all tests that stage1 and stage2 do, when running the tests via the IR emulator.

Time to start improving the IR, allocating registers, and implementing a backend to generate "real" code from the IR.

#Projects #Compiler

0 0 1 0
2rZiKKbOU3nTafniR2qMMSE0gwZ
2rZiKKbOU3nTafniR2qMMSE0gwZ
@2rzikkbou3ntafnir2qmmse0gwz.activitypub.awakari.com.ap.brid.gy
1 week ago
Original post on hackernoon.com

When Verified Source Lies I deployed a staking vault on Sepolia and got it verified on Etherscan with a green checkmark. The source code contains a storage write that does not exist in the compiled...

#smart-contracts #solidity #blockchain-security #ethereum #cybersecurity […]

0 0 0 0
Wave Foundation
Wave Foundation
@wavefnd.org
1 week ago

This is patch #308

#OpenSource #Wave #Compiler #Patch

blog.wave-lang.dev/patch-308-pr...

1 0 0 0
Brian Swetland
Brian Swetland
@swetland.frotz.net
2 weeks ago
git commit history for a couple changes tidying up the tree and splitting ir-types.spl into ir-instructions.spl and ir-blocks.spl

git commit history for a couple changes tidying up the tree and splitting ir-types.spl into ir-instructions.spl and ir-blocks.spl

Blergh. Did a little tidying up, made a bigger mess, chased down the tiny one-line change that broke everything and hid in the noise, and put it all back together again.

Good: Everything's tidier.

Bad: Did not actually do the thing I set out to do this afternoon.

#Projects #Compiler

0 0 0 0
DragonXI Development fellow
DragonXI Development fellow
@dragonxi.dev
2 weeks ago

¿
Abstraction:
It removes the need for
manual __syncthreads() calls,
as #compiler automatically
manages #thread-synchronization
and #memory-movement.

0 0 0 0
ProgrammerHumor.io
ProgrammerHumor.io
@programmerhumor-io.bsky.social
2 weeks ago
Out Nerded The Source Code

Out Nerded The Source Code

Out Nerded The Source Code

#programming #Parenting #compiler #sourcecode #Family

programmerhumor.io/programming-memes/out-ne...

1 0 1 0
Sam Abbott-Kennedy
Sam Abbott-Kennedy
@samothyk.bsky.social
2 weeks ago
Video

Spent a few days playing with the game of life program, fixed a lot of bugs in the language doing so. I should make more projects like this to stress test the language, any ideas for what else I should try coding?
#compiler #programming #raylib

6 0 0 0
Sam Abbott-Kennedy
Sam Abbott-Kennedy
@samothyk.bsky.social
3 weeks ago
Video

Managed to build a cheeky little game of life simulator in my programming language!
#programming #compiler #raylib

4 0 1 0
Sam Abbott-Kennedy
Sam Abbott-Kennedy
@samothyk.bsky.social
3 weeks ago
A snippet of my programming language showing anonymous structs, multiple return values, and tuples ``` fn multiple_returns(): struct { u32, u32 } { return { 6, 7 } } //accept as anonymous struct fn foo(struct { a: u32, b: u32}) { println(a) println(b) } //accept as tuple fn bar(tup: struct { u32, u32 }) { println(tup.0) println(tup.1) } fn main(): u32 { let x = multiple_returns() foo(x) bar(x) return 0 } ```

A snippet of my programming language showing anonymous structs, multiple return values, and tuples ``` fn multiple_returns(): struct { u32, u32 } { return { 6, 7 } } //accept as anonymous struct fn foo(struct { a: u32, b: u32}) { println(a) println(b) } //accept as tuple fn bar(tup: struct { u32, u32 }) { println(tup.0) println(tup.1) } fn main(): u32 { let x = multiple_returns() foo(x) bar(x) return 0 } ```

Anonymous structs have blown open a whole new slew of features. Multiple return values and tuples basically for free

#compiler #programming

3 1 0 0
Wave Foundation
Wave Foundation
@wavefnd.org
3 weeks ago

Wave v0.1.8-pre-beta is now released!

#OpenSource #Wave #Compiler #Release

blog.wave-lang.dev/wave-languag...

1 0 0 0
Sam Abbott-Kennedy
Sam Abbott-Kennedy
@samothyk.bsky.social
3 weeks ago
A snippet of code in my programming language showing coercion between a named struct and an unnamed struct, as well as promotion of an anonymous struct's fields to the containing struct: ``` struct Foo { { a: u32, b: u32 } } struct Pair { a: u32, b: u32 } fn foo({a: u32, b: u32}, c: u32) { println(a, b, c) } fn main(): u32 { let pair = Pair { 1, 2 } foo(pair, 3) //named struct coerced to anonymous struct let f = Foo { pair } println(f.a) println(f.b) return 0 } ```

A snippet of code in my programming language showing coercion between a named struct and an unnamed struct, as well as promotion of an anonymous struct's fields to the containing struct: ``` struct Foo { { a: u32, b: u32 } } struct Pair { a: u32, b: u32 } fn foo({a: u32, b: u32}, c: u32) { println(a, b, c) } fn main(): u32 { let pair = Pair { 1, 2 } foo(pair, 3) //named struct coerced to anonymous struct let f = Foo { pair } println(f.a) println(f.b) return 0 } ```

The output: ``` 1, 2, 3 1 2 ```

The output: ``` 1, 2, 3 1 2 ```

Been noodling on how my language will handle anonymous structs. They're not done yet but I think they'll be pretty loose, able to coerce between compatible named structs. Plus they'll basically act like tuples once you can create anonymous struct literals, which is nice!

#programming #compiler

1 0 0 0
Xojo
Xojo
@xojo.com
3 weeks ago

Compiler directives give you fine‑grained control over the build process. Use #Pragma to toggle debug‑only code, profile performance hotspots, or conditionally compile for specific platforms (Desktop, Web, Mobile). Do you use any in your projects?

#Compiler #Programming #BuildOptimization

0 0 0 0
Inautilo
Inautilo
@inautilo.bsky.social
3 weeks ago
Preview
Vite 8.0 is out! Vite 8 Release Announcement

#Development #Releases
Vite 8.0 is out · It ships Rolldown for up to 10–30x faster builds ilo.im/16bd5y by Vite

_____
#Vite #Tooling #Builder #Bundlers #Compiler #NodeJS #Rust #WebDev #Frontend

0 0 0 0
aibarcelona.bsky.social
aibarcelona.bsky.social
@aibarcelona.bsky.social
3 weeks ago
Preview
The Future of Software The world of software is undergoing a shift not seen since the advent of compilers in the 1970s. Compilers were the original vibe coding: they automatically generate complex machine code that human pr...

www.inference.vc/the-future-o... #software #machinecode #compiler #future

0 0 0 0
Sam Abbott-Kennedy
Sam Abbott-Kennedy
@samothyk.bsky.social
3 weeks ago
Two files in my language showing a barebones gameboy CPU and raylib draw loop with the gameboy window running, showing a blank screen

Two files in my language showing a barebones gameboy CPU and raylib draw loop with the gameboy window running, showing a blank screen

Getting to the point where I can write semi-serious programs in my language. It's a great way to find a bunch of subtle bugs and missing functionality. E.g. here's a ~totally functioning~ gameboy emulator
#programming #compiler #raylib

6 0 1 0
Sam Abbott-Kennedy
Sam Abbott-Kennedy
@samothyk.bsky.social
3 weeks ago
A program in my language showing function overloads: ``` struct Vec2 { x: u32, y: u32 } struct Vec3 { x: u32, y: u32, z: u32 } fn add(a: Vec2, b: Vec2): Vec2 { return Vec2 { a.x + b.x, a.y + b.y } } fn add(a: Vec3, b: Vec3): Vec3 { return Vec3 { a.x + b.x, a.y + b.y, a.z + b.z } } fn main(): u32 { let v2a = Vec2 { 3, 2 } let v2b = Vec2 { 4, 3 } let v2c = add(v2a, v2b) println(v2c) let v3a = Vec3 { 3, 2, 1 } let v3b = Vec3 { 2, 1, 1 } let v3c: Vec3 = add(v3a, v3b) println(v3c) return 0 } ```

A program in my language showing function overloads: ``` struct Vec2 { x: u32, y: u32 } struct Vec3 { x: u32, y: u32, z: u32 } fn add(a: Vec2, b: Vec2): Vec2 { return Vec2 { a.x + b.x, a.y + b.y } } fn add(a: Vec3, b: Vec3): Vec3 { return Vec3 { a.x + b.x, a.y + b.y, a.z + b.z } } fn main(): u32 { let v2a = Vec2 { 3, 2 } let v2b = Vec2 { 4, 3 } let v2c = add(v2a, v2b) println(v2c) let v3a = Vec3 { 3, 2, 1 } let v3b = Vec3 { 2, 1, 1 } let v3c: Vec3 = add(v3a, v3b) println(v3c) return 0 } ```

The output of the program: ``` { 7, 5 } { 5, 3, 2 } ```

The output of the program: ``` { 7, 5 } { 5, 3, 2 } ```

Had to implement some name mangling when emitting functions to lay the groundwork for interfaces, and I noticed this gave me function overloads for free. Take that, C!
#compiler #programming

1 0 0 0
Inautilo
Inautilo
@inautilo.bsky.social
3 weeks ago
Preview
The CodePen Compiler The CodePen Compiler powers 2.0 editor: process and build your code with configurable blocks.

#Development #Explainers
The CodePen Compiler · The CodePen 2.0 editor has a whole new brain ilo.im/16bcg0 by CodePen

_____
#CodePen #CodeEditor #Compiler #Builder #Website #WebDev #Frontend #HTML #CSS #JavaScript

1 0 0 0
Goblin Zac
Goblin Zac
@goblinzac.bsky.social
3 weeks ago
Post image

#Marathon #Bungie #Fanart #Compiler
Pfhor Tua, Sph't on that thang....

16 3 0 0