Good day.
Recently, I needed to write bare-metal, an application for one of my projects, and accordingly I needed an allocator.
And as it was chosen
https://github.com/axriosn/slab_allocator_rs.git.
Tell me, can I use methods like Box :: New, with its help?
Also startups are getting the biggest benefit from this budget as they're the major source of tech jobs atm in India. Plus corporate India already got its biggest reform by giving them tax cuts. That should help them towards their capex, EBIT and Profit.
A char array has the terminating \0 byte at the last index, so you can easily iterate through it. I can access the array by using it's address, stored in a pointer variable. The pointer is just a number, and by adding digits i can get any array index i want.
Integer arrays do not have a terminating byte and there is no information about the size in the pointer address. So how does for example free() know what to free?
“CIRCLE OF DEATH!”
Keira spun her greatsword in a wide arc, cleaving through both the Blightspawn in front of her and the one that had been attempting to sneak up from behind. Her blade split open mutated flesh like it was a knife cutting hot butter, scoring deep lines across the Blightspawn’s torsos that wept gray blood. Keira didn’t bother feeling triumphant – considering how effective the abominations’ regeneration was, those wounds were barely worth the 50 MP she’d spent to inflict them.
Knocking both creatures away from her, thereby giving her a much-needed moment to focus on one? Now that was worth 50 MP.
“POWER SLASH!” Keira slammed her beloved partner down onto the first Blightspawn’s back, piercing through its body and into the ground. The beast, a crocodile-thing with two heads and serrated skin, writhed frantically as it struggled in vain to escape from the slab of steel that was pinning it in place. As the second Blightspawn rallied to its friend’s aid, claws outstretched towards Keira's unprotected back, Keira used the momentum of her swing to vault herself straight over the first Blightspawn and land behind its tail. With both creatures taken off guard, and one heavily injured, Keira ripped her greatsword out of the crocodile-thing’s back and beat the everloving shit out of it until it stopped moving.
Reached Level 41!
5 Stat Points Gained!
Warrior Level Increased! 37 → 38
4 Points in Strength, 1 in Vitality. For once, her allocation choice wasn’t based solely on her personal preferences – raw power was the key to killing monstrosities that were fueled by Blight-born vitality. The remaining Blightspawn warbled in outrage as it spewed fire, breathing gusts of flame out from compressed sacks of air embedded within its skin. Danger Sense guided Keira’s steps as she jumped to the side well before its attack reached her. She eyed her MP, currently sitting at 150, and decided: fuck it.
“SPEAR OF STEEL!” Keira launched her greatsword like a javelin, crushing the Blightspawn’s head into a gooey red paste. She rushed forward as the blade reappeared back in her hand, preparing a follow-up attack to prevent the beast from regaining its footing.
Then Meyneth tore its spine out.
Keira skidded to a halt. She stared at the Dragonkin in utter bafflement, her posture frozen in the middle of executing a sword strike. Meyneth definitely hadn’t been there a moment ago. Yet there she was, tearing the Blightspawn to shreds as she bellowe
... keep reading on reddit ➡I was just sitting here, getting my desktop updated again after a ~2½ month hiatus due to moving country. And I'm looking through the kernel option as I'm compiling the desktop's new 4.8 Liquorix kernel. And the SLAB allocators apparently got a new sibling: SLOB. Now, SLOB is almost certainly not the right choice for a gaming rig! But looking up what SLOB is about, I came across someone saying that that SLAB is faster than SLUB on multi-CPU systems, giving the below as their source:
> SLUB is simpler than SLAB, but that simplicity hurts workloads that involve allocating on one NUMA node and freeing on another - which is a common behaviour when doing network or file I/O on a system with more than one processor package. Most distributions therefore still use SLAB. > > It's possible that there could be some benefit from using SLUB for the uniprocessor configurations. (source)
I've never given this much thought before, but now I'm curious: which of SLAB or SLUB gives better performance for gaming on Linux? Does multi vs. uni processors matter if the applications running do not really employ multithreading? (Is the state of multithreading in games better on Linux/for Linux ports than on Windows?)
Post scriptum: Yes, I realise that of all the variables relating to game performance, the choice of SLAB allocator is such a tiny, tiny, tiny microscopic minuscule variable. Still, I'm curious and it's all good fun. :)
I don't want to step on anybody's toes here, but the amount of non-dad jokes here in this subreddit really annoys me. First of all, dad jokes CAN be NSFW, it clearly says so in the sub rules. Secondly, it doesn't automatically make it a dad joke if it's from a conversation between you and your child. Most importantly, the jokes that your CHILDREN tell YOU are not dad jokes. The point of a dad joke is that it's so cheesy only a dad who's trying to be funny would make such a joke. That's it. They are stupid plays on words, lame puns and so on. There has to be a clever pun or wordplay for it to be considered a dad joke.
Again, to all the fellow dads, I apologise if I'm sounding too harsh. But I just needed to get it off my chest.
I have an HPE DL380 Gen 10 in my lab and I noticed the ARC size isn't growing beyond 64GB despite having plenty of memory available.
Version: TrueNAS-SCALE-22.02-RC.2 (LAB environment)
Current workload: ISCSI only. zvol to lab vmware cluster with about 15 running machines. 70/30 mixed read write typically.
Any ideas why the ARC would not grow beyond 62.7? It has been running with this workload for ~20 days. it isn't causing any issues or anything as far as I know. I'm just testing SCALE out in the lab and noticed this. If this might be a bug or something I'd be happy to work with someone or file a report with IXSystems if it can help.
Machine specs:
CPU: Xeon Bronze 3104
Memory: 128GB (HPE certified)
ARCL2: None
SLOG: HPE 16GB NVDIMM
Sync=always
Disks: 24x 1.2TB 10k RPM SAS (2x raidz2 vdev's)
Controller: HPE Smart Array P816i-a SR Gen10 (Drives are passed to the OS)
ZFS Subsystem Report Fri Jan 14 08:01:07 2022
Linux 5.10.81+truenas 2.1.1-1
Machine: labtruenasscaletest01.fakedomain.local (x86_64) 2.1.1-1
ARC status: HEALTHY
Memory throttle count: 0
ARC size (current): 99.2 % 62.2 GiB
Target size (adaptive): 100.0 % 62.7 GiB
Min size (hard limit): 6.2 % 3.9 GiB
Max size (high water): 16:1 62.7 GiB
Most Frequently Used (MFU) cache size: 45.0 % 27.8 GiB
Most Recently Used (MRU) cache size: 55.0 % 34.0 GiB
Metadata cache size (hard limit): 75.0 % 47.1 GiB
Metadata cache size (current): 4.5 % 2.1 GiB
Dnode cache size (hard limit): 10.0 % 4.7 GiB
Dnode cache size (current): 1.1 % 53.4 MiB
ARC hash breakdown:
Elements max: 2.3M
Elements current: 56.5 % 1.3M
Collisions: 22.2M
Chain max: 5
Chains: Do your worst!
I'm surprised it hasn't decade.
They were cooked in Greece.
I am writing the basics of my language and I have a question about dynamicacally typed language heap objects
Say I have this struct (c / c++)
struct HeapObject
{
int type;
int ref_count; // for garbage collection
};
The reasion type is int is I want to have a lookup array of all the knowns types, and to get the actual type just I just do
type_array[object->idx]
And all of the HeapObject types just subclass this struct. This just 8 bytes but would require me to break my brain with this array lookup stuff.
Is there any way I could leave the struct's size at 8 bytes and have a pointer and a 3-4 byte integer there? Perhaps with using the fact that pointer just stores the 48 first bits
For context I'm a Refuse Driver (Garbage man) & today I was on food waste. After I'd tipped I was checking the wagon for any defects when I spotted a lone pea balanced on the lifts.
I said "hey look, an escaPEA"
No one near me but it didn't half make me laugh for a good hour or so!
Edit: I can't believe how much this has blown up. Thank you everyone I've had a blast reading through the replies 😂
It really does, I swear!
Because she wanted to see the task manager.
Heard they've been doing some shady business.
but then I remembered it was ground this morning.
Edit: Thank you guys for the awards, they're much nicer than the cardboard sleeve I've been using and reassures me that my jokes aren't stale
Edit 2: I have already been made aware that Men In Black 3 has told a version of this joke before. If the joke is not new to you, please enjoy any of the single origin puns in the comments
They’re on standbi
A play on words.
Pilot on me!!
Nothing, he was gladiator.
I have a scenario that calls for a kind of "memory pool" design. By "kind of" I mean a container of buffers that are allocated at initialization time. When a process needs a buffer it gets one from the free buffer pool "per say". Then when that process is finished with the buffer it free's it by returning it back to the free buffer pool. Basically, allocation is happening only once (at init time).
I've found a few examples of some "memory pool" designs but its acting more like a dynamic memory manager at run time. I don't need that. I just need to create a pool of buffers and then manage that pool to some regard like i mentioned above.
I can't seem to search using the right words on finding a design implementation that addresses this. Is there some other kind of design pattern here that I should be searching for? This is quite basic to do but I'm a bit confused on the mechanics of how I should be maintaining this pool and how I could make it thread safe. Therefore, was hoping there be an article or write-up on this implementation.
