made you look
Yeah, I was prescribed them when I was younger (The wonders of living in a state that still doesn’t fluoridate the water supply). They were small little red pills that you had to chew on and then rub the “paste” on your teeth with your tongue.
Imagine basically dehydrated toothpaste, had a chalky texture, not the greatest.
Explain to me the science of how swallowing fluoride protects teeth.
Easy, you don’t swallow them.
They’re chewables.
From a quick search it seems that the mobo uses a Realtek audio chip, which is probably the actual problem. My current system build uses one and it barely worked under Windows, it’d randomly remap the channels, sometimes it just wouldn’t come up properly (Showed as only a microphone, etc.), had lots of static noise, would constantly think I was unplugging and replugging headphones in, etc. Just a terrible experience compared to the Intel audio system the build before this used.
As much as “just buy another bit of hardware” is an awful bit of advice, I’d recommend getting a USB DAC/soundcard, I bought a cheap soundblaster one and it fixed all my problems. USB audio is a well-defined standardised protocol that’s supported by just about everything, does away with any driver issues or incompatibilities, can be moved between devices, etc. Mine’s a “gaming” model so it’s just a USB port on one side and a headset jack on the other, but you can also get ones with proper inbuilt amplifiers to run full speaker kits, etc.
So one of the problems is the size of a “physical page”, on a stock x86 system that’s only 4KiB. If you allocate just 1MiB of RAM you need to back that with 256 “page table entries”, and to then load a virtual address within that allocation you need to walk that list of 256 entries to find the physical address in RAM that the CPU needs to request.
Of course these days an app is more likely to use 1 GiB of RAM, that’s a mere 262,144 page table entries to scan through, on each memory load.
Oh but then we’re also not running a single process, there’s multiple processes on the system, so there will be several million of these entries, each one indexed by address (Which can be duplicated, each process has its own private view of the address space), and then by process ID to disambiguate which entry belongs to each process.
That’s where the TLB comes in handy, to avoid the million or so indexing operations on each and every memory load.
But caching alone can’t solve everything, you need a smarter way to perform bookkeeping than simply using a flat list for when you don’t have a cached result. So the OS breaks down those mappings into smaller chunks and then provides a table that maps address ranges to those chunks. An OS might cap a list of PTEs at 4096 and have another table index that, so to resolve an address the CPU checks which block of PTEs to load from the first table and then only has to scan the list it points to.
Like this, this is a 2 level scheme that Intel CPUs used before the Pentium Pro (iirc), the top 10 bits of an address selected an entry in the “page directory”, the CPU loads that and uses the next 10 bits to select the group of PTEs from that list, following that link that it finds the actual PTEs that describe the mappings and then it can scan that list to find the specific matching entry that describes the physical address to load (And it then promptly caches the result to avoid doing that again)
So yes, for a given page size and CPU you have a fixed number of walks regardless of where the address lives in memory, but we also have more memory now. And much like a hoarder, the more space we have to store things, the more things we do store, and the more disorganised it gets. And even if you do clear a spot, the next thing you want to store might not fit there and you end up storing it someplace else. If you end up bouncing around looking for things you end up thrashing the TLB, throwing out cached entries you still need so now need to perform the entire table walk again (Just to invariably throw that result away soon after).
Basically, you need to defrag your RAM periodically so that the mappings don’t get too complex and slow things down (Same is true for SSDs btw, you still need to defrag them to clean up the filesystem metadata itself, just less often than HDDs). Meta have been working on improvements to how Linux handles all this stuff (page table layout and memory compaction) for a while because they were seeing some of their long-lived servers ending up spending about 20% of CPU time simply wasted on doing repetitive walks due to a highly fragmented address space.
The RA in RAM stands for random access; there is no seeking necessary.
Well there is, CPUs need to map virtual addresses to physical ones. And the more RAM you have the more management of that memory you need to do (e.g. modern Intel and AMD CPUs have 5 levels of indirection between a virtual and physical address)
But it also caches those address mappings, as long as your TLB is happy, you’re happy. An alternative is to use larger page sizes (A page being the smallest amount of RAM you can address), the larger the page the less you need recurse into the page tables to actually find said page, but you also can end up wasting RAM if you’re not careful.
TypeScript is actually pretty nice, it’d be JScript instead.
I remember one of the modders behind a UI overhaul talking about the response to paid mods, when users kept saying that a donation system was better, that in the entire time they’d been making the mod they’d only gotten like $50 in donations total.
Edit: And seeing modders use patreon now for support, and those mods still getting “pirated”, I don’t think the issue was ever about Bethesda or how they handled it.
Yeah, the days of end users installing their own OS is in the past, PCs are appliances for most people now.
moot created the site in response to lowtax banning hentai on Something Awful, I’m not sure I’d call that “innocent”
That’s “Extended ASCII”, basic ASCII only has upper and lowercase latin characters and things like <, =, >, and ?
And probably half of the control codes are still used, mostly in their original form too, teletype systems. They’re just virtual these days.
A place I worked at did it by duplicating and modifying a function, then commenting out the existing one. The dev would leave their name and date each time, because they never deleted the old commented out functions of course, history is important.
They’d also copy the source tree around on burnt CDs, so good luck finding out who had the latest copy at any one point (Hint: It was always the lead dev, because they wouldn’t share their code, so “merging to main” involved giving them a copy of your source tree on a burnt disk)
Is it really malicious if you do it by yourself, to yourself?
What’s creating these shortcuts though, and why isn’t that considered a risk?
For a while Google let you blacklist domains from search results, fantastic feature so of course they killed it off.
How about a 6.4TB sqlite database?
They’d run afoul of the whole “editing your own article” restrictions.
The “attack” is from the host side, any remote attack is theoretical and would depend on exploiting the software on the host first to then gain access to the BT chip.
I take that there isn’t much motivation in moving to 128 because it’s big enough; it’s only 8 cycles (?) to fill a 512 (that can’t be right?).
8 cycles would be an eternity on a modern CPU, they can achieve multiple register sized loads per cycle.
If we do see a CPU with 128 bit addresses anytime soon, it’ll be something like CHERI, where the extra bits are used for flags.
I think CHERI is the only real attempt at a 128 bit system, but it uses the upper 64 bits for metadata, so the address space is still 64 bits.
Also fewer syllables, which apparently has a noticeable impact.