Write the orchard’s language — Parallax Sketchbook

SKETCHBOOK / 03 Copper Orchard · 2-week chapter

Page 1 of 3: MSL is familiar, not identical

Address spaces carry meaning

MSL is familiar, not identical

Metal Shading Language uses familiar C++ syntax but adds GPU execution semantics and address spaces. A device pointer addresses device-buffer data, constant denotes read-only constant data, thread is per-thread storage, and threadgroup is shared within a threadgroup. These are not decorative keywords. A C++ function using arbitrary heap allocation, operating-system services, or host containers cannot simply be pasted into a GPU shader.

A vertex function produces a position and interpolated outputs; a fragment function consumes the rasterized inputs and returns attachment values. Attributes such as [[position]], [[stage_in]], and [[buffer(0)]] connect the stages and resource bindings. Treat the numeric binding as part of a documented interface. Keep a tiny original shader for the first fruit: a stable transform and a warm gradient, then change one parameter deliberately.

Compile the library and resolve named functions before building a pipeline. Preserve compiler diagnostics and use a last-known-good pipeline during experimentation. For a reproducible release, record how the shader library was built for the target. Runtime compilation is useful for the teaching probe and development experiments; do not silently make every frame recompile the library.

From the page to your own work

Your studio assignment.

Draw a small warm orchard using a verified C++/MSL vertex interface.

A finish line you can see

A three-fruit image, host/shader layout table, and preserved shader diagnostic.

Check record layout at compile time.
Identify whether vertex fetch uses a descriptor or direct indexing.
Match pipeline formats to the drawable/depth targets.
Recover from a shader failure using the previous complete pipeline.

Keep the evidence in your weekly notebook ↗

Explain it like an engineer

Try answering aloud before opening the review notes. Use your own implementation as evidence.

Why can an apparently identical C++ and MSL struct produce broken geometry?

Their vector alignment or padding can differ.
The vertex path may apply a descriptor layout or typed-array stride.
Check offsets, widths, stride, and matrix convention independently.

These prompts support practice; they are not an automatic assessment of your work.

A tip for this exercise

Choose either vertex-descriptor fetch or direct typed indexing for the first fruit. Keeping that choice explicit prevents a C++ record layout and a shader layout from appearing compatible only by accident.

Hints, when you need them.

Try a first step, then reveal as much help as you need. Each hint gets a little more specific.

1Hint 1 · Find a starting point

List the fields the vertex stage reads and how it finds each one. Does a descriptor supply offsets, or does a typed record define them?

2Hint 2 · Choose an approach

Check sizes, offsets, stride, and matrix convention independently. Render one constant-color triangle before adding the three fruit transforms and material values.

3Hint 3 · Check your reasoning

Capture three fruit with a matching layout table and attachment formats. A failed shader candidate should preserve its diagnostic and leave the previous complete pipeline available.

A small creative variation ↗

Add a UV or normal diagnostic palette while preserving the same geometry budget.

Optional. Save it for later if this chapter already feels full.

Coming back after a break? ↩

Draw one constant-color triangle. Confirm its record stride before restoring transforms.

Books & principles behind this study +

Original Parallax explanations and assignments, with these works for further reading.

YOUR MARGIN NOTES

Leave yourself a good question.

What changed your mind? What would you try next?

Notes for Write the orchard’s language

Notes are private to this browser and saved as you write.

A CHECKPOINT, NOT A SCORE

Can you explain the idea and try the exercise yourself?

Completion records your own assessment. It does not compile or test your C++.

Companion source 2 files