I don't think APFS was designed or tuned with HDDs in mind, but it will work just fine. Especially for backups where random read/write performance is not important.
I would not recommend using an APFS formatted HDD for Time Machine. It's painfully slow. With my Samsung T7 the hourly Time Machine backups are usually finished after a couple of minutes. Using my older HDD they can easily take 20 minutes to half an hour.
While time machine used to be snappy on HDD it was build out of one of the weirdest little hacks hard links in folders. The new Time Machine might front a similar front end but under the hood its a different beast. You're having to mount snapshots as you move through time.
It's definitely APFS. I've had the pleasure* of HFS+ and APFS on the same external HDD and APFS is horrible. Given it is optimised for solid-state drives[0], it's understandable there'd be some slack but it is absolute horse paste.
(If I could create an encrypted external HFS+ volume, I would but macOS hasn't allowed that for a while as far as my experience goes - it's non-encrypted HFS+ or encrypted APFS.)
My point is that while the old HFS+ based Time Machine was performing ok on spinning disks, the new APFS based TM backups are excruciatingly slow and take ages to finish. I did actually compare both types on the same hard drive and even then the difference was very obvious.
Apple sold iMacs for many years that had a completely separate SSD and HDD, and CoreStorage was used to combine them into a single block device which was then partitioned and formatted as HFS+ or APFS.
It is in-scope for a security update, and they say one will be coming.
They just couldn’t modify cert.pem without a security update like they did for their own SSL APIs. Hopefully a security update will be coming soon.
Specifically the iMac has a 24" 4.5K panel (4480x2520), and supports P3 color. And if the glass front is a problem, nano-texture glass is available for an extra $200 (although only on the higher-end config).
I am not sure. I agree one should minimize macros in C, but for some things a small macro layer still beats the complexity of C++ and is not inferior in my opinion.
C++ templates are far cleaner, easier to debug, and produce more comprehensible errors than C macros. And C++ templates are rightly famous for being terrible at all of the above.
Hey, I agree about your second sentence but I do not really see the first. Alone that I can directly inspect the result of the preprocessor makes macros easier to debug than templates in my experience.
What you're saying is like saying "C can be expanded to assembly, and that makes it easier to debug". If you need to do that, the entire process has failed.
> I can directly inspect the result of the preprocessor makes macros easier to debug
Tangential note but: why does this require a separate re-invocation of the compiler with the '-E' flag? Say I have this silly example with a comma instead of the semicolon inside W() macro:
#define W(a, b) b, int a
#define X(a, b) W(b, a)
int kekw(int x) {
int z = X(23, k) = x;
return z + k;
}
When I shove it into GCC without -E, it says
<source>: In function 'int kekw(int)':
<source>:1:21: error: expected unqualified-id before 'int'
1 | #define W(a, b) b, int a
| ^~~
<source>:2:18: note: in expansion of macro 'W'
2 | #define X(a, b) W(b, a)
| ^
<source>:5:13: note: in expansion of macro 'X'
5 | int z = X(23, k) = x;
| ^
<source>:6:16: error: 'k' was not declared in this scope
6 | return z + k;
|
instead of, you know, showing me the expanded text so that I could see what's actually wrong with the generated variable declarations? Something like
<source>: In function 'int kekw(int)':
<source>:1:21: error: expected unqualified-id before 'int'
1 | #define W(a, b) b, int a
| ^~~
<source>:2:18: note: in expansion of macro 'W'
2 | #define X(a, b) W(b, a)
| ^
<source>:5:13: note: in expansion of macro 'X'
5 | int z = X(23, k) = x;
| ^
<source>:5:-: note: the expanded source text is
| int z = 23, int k = x;
| ^~~
<source>:6:16: error: 'k' was not declared in this scope
6 | return z + k;
|
perhaps? I understand that tracking the lines/columns inside the expanded text is highly non-trivial (although collapsing them all onto the position of the top-level macro is already just as non-trivial), but still. Show me what the source that you actually can't compile, not the three-steps removed precursor to it — I sure as hell can't expand macros in my head.
Also, what is this first error message about in the first place? Why the hell does it expect unqualified-id before "int"? If you put "int" after the unqualified-id, it still would be illegal; and an unqualified-id is not the only thing that can follow the comma in this context anyway.
During translation of source text to a C program, the source text goes through several phases. It turns raw bytes into preprocessor tokens, then preprocessor tokens get expanded into more preprocessor tokens and then preprocessor tokens get translated into C tokens, which are fed into the C parser. There is no “expanded text”, only expanded tokens. Generally this is implemented as a state machine that produces tokens on demand, so there is no expanded text. When GCC shows you that error message, it uses the recorded source location and looks it up in the original source file. This is trivial to do. Expanding just one line of the source file would either require re-invoking the preprocessor from the beginning or storing already consumed preprocessor tokens.
Obviously this is possible, but no one has gotten around to implementing this feature and it’s not clear you would want either solution: buffering preprocessor tokens in case you need to expand a line for an error message greatly increases memory usage and the vast majority of compilations are successful ones with no errors, slowing down the normal case. And re-invoking the preprocessor to show you one line on every error message makes error reporting slow.
> There is no “expanded text”, only expanded tokens.
If the compiler supports "-E", there absolutely is some equivalent of the expanded text, with (somewhat limited) whitespace info available: if you insert whitespace into between "b" and the comma in "b,", then "-E" invocation will dutifully show it. Yes, multiple spaces are collapsed into one, but their presence/absence is tracked already.
> Expanding just one line of the source file would either require re-invoking the preprocessor from the beginning or storing already consumed preprocessor tokens.
Yeah, keep the whole expansion of the latest top-level (not nested) macro. I believe some bytecode-like compression scheme (a replay of that state machine you mentioned) à la LZ would work fairly well, with minor additional memory necessary. Hell, scratch that: since #define/#undef are impossible inside a macro, you don't even need to remember the expansion of the macro, you simply need to keep the current macro definitions and remember what was the last macro you tried to expand — if your error happened inside its expansion, just re-expand again. Zero additional memory needed, since this information is already stored for the current way of error reporting — you can see in the current output that it remembers what macros it expanded and where, the whole path down to the offending token: at 1:21 "in expansion of macro 'W'" which was at 2:18 "in expansion of macro 'X'" which was at 5:13.
> And re-invoking the preprocessor to show you one line on every error message makes error reporting slow.
Eh, it's on the whole faster than making the programmer re-run with "-E" option manually.
> If the compiler supports "-E", there absolutely is some equivalent of the expanded text, with (somewhat limited) whitespace info available: if you insert whitespace into between "b" and the comma in "b,", then "-E" invocation will dutifully show it. Yes, multiple spaces are collapsed into one, but their presence/absence is tracked already.
Whitespace is significant in the preprocessor so of course it tracks whitespace. Whitespace isn’t dropped until phase 7 when pp-tokens are converted to C tokens.
As I said it’s not impossible, write the patch and see if GCC accepts it.
Also the position in the original source code is tracked.
In fact, this enhancement should be doable. Please file a bug. But the answer why something is not done in a C compiler is usually: Nobody did substantial investments on it in the last two decades. So if you want to see improvements, usually one has to submit a patch.
No, this is not true. macOS 10.15 included Python 2.7 as part of the OS, and it was removed in macOS 12.2 IIRC.
Python 3.9 is still included in Xcode and the Command Line Tools, but not the OS itself. It’s only for running scripts (and for supporting LLDB I think), applications cannot link against it like they could with the old OS-bundled 2.7.
Python 3.9 is getting conspicuously old though, I was a bit surprised Apple didn’t update it in Xcode 27.
The docs are pretty clear that it’s experimental, and it’s not even exported from a DLL. It’ll be hilarious if some application depends on it and they have to keep it though
I didn't intend to give the impression that Apple was definitely going to use jxl-rs. You're correct; there's been total radio silence from the Safari/WebKit team regarding anything related to Rust.
But it makes so much sense for Apple, Mozilla, and Google to support jxl-rs. Of course, that doesn't mean it's going to happen.
Keeping quiet and then adding jxl-rs to a dot release like Safari 27.4 or something is also a very Apple thing to do.
Are sandbox profiles (or how to use them) officially documented anywhere (as non-deprecated)?
They just got burned by the documented usage of sandbox_init() going away (which didn’t even get a mention in the release notes), I can understand why they’d be unexcited about moving to a different deprecated/undocumented API.