Intrinsic Functions - Vector Processing Extensions

[@javidx9]

I will also add that branching can stall a CPU, particularly as processors attempt to "guess" which bit of code will be executed next. If it guesses wrong, it has to effectively "go back", so removing branching is a good strategy for optimisation.

[@Astravall]

@javidx9 ... hmm did you ever calculate _c in your code example? Well it is likely in the git repository ;) but in your video i think that part is missing (e.g. at 54:36 ). I just see comments on what you want to achieve ... or did i overlook that part? Nevertheless a cool video, as a long time ago i programmed in Assembler but nowadays i'm relying on the C#-Compiler ;).

[@dieSpinnt]

C++ 20 brings us [[likely]] and [[unlikely]] that may help to fix a branching conflict. See Jason Turner on this topic at kzbin.info/www/bejne/m6iWqKdmnJ5sock Thank you for the educating video javidx9. Stay safe. P.S.: Isn't it nice that meat-bags(humans) are still useful for optimization work and making videos?:)

[@notnullnotvoid]

@@dieSpinnt It's worth noting that the [[likely]] and [[unlikely]] tags (or the equivalent compiler-specific markup you would have used prior to C++20, such as __builtin_expect) can't really directly help the CPU to predict branches better, they mainly help make correctly-predicted branches perform better, by hinting the compiler to, for example, reorder branches to reduce the overall number of jumps in the expected code path, or improve the cache locality of the expected code path by laying it out contiguously in memory, or to decide whether to use a branch vs. a cmove.

[@Bvic3]

Why is it so hard to find resources about the incredible branching prediction of processors ? I only saw it mentionned in a talk by former Intel/Tesla chief processor architect Jim Keller. It's not just predicting what will be used next, but parallelising automatically by finding independant pieces, like initialising variables can be done before the function is called! It seems that there is a processor inside the processor doing those predictions live depending of the current run time and other threads from other programs. The firmware can optimise machine code live, not following the .exe machine code. And Intel wants to use neural networks to predict branching. That's how they manage go make code run faster without increasing clock speed. Also, there are professional grade Intel compilers with licence prices higher than consumer processors that make much more advanced optimisation than the generic GCC compiler. It seems such a fascinating topic, but surprisingly secret.

[@jon9103]

@@Bvic3 if you're interested in how branch prediction works, you might want to read the Wikipedia article en.m.wikipedia.org/wiki/Branch_predictor. If you look at the reference section you'll find that much if the theory is freely available, what's secret isn't usually really how things work, rather its all the work that goes into implementing something that can actually put it into practice and be competitive. As to the Intel compiler vs GCC, a lot of that is marketing, sometimes Intel does better, sometimes GCC does, it really depends on specifics (i.e. what code is being compiled, how is performance being measured, what system is it running on, what version of the compiler, what compiler options were selected, etc.) Naturally its easy for Intel marketing to cherry pick scenarios that put their compiler in the best light, so its important to understand that your results will vary.

[@NeilRoy]

*head explodes* - I see a lot of basic programming videos online with all the usual fair, and they are very nice. But it's refreshing to see more advanced topics like this covered, and covered so well.

[@adamjansadowski535]

@@esepecesito bisqwit

[@nickscurvy8635]

Fr

[@vklooping]

The most handsome C++ guy that ever walked this planet

[@DlCartof]

if u like javix check out chilli tomato noodle too, for some more sweet c++ 😃

[@mjthebest7294]

Javidx9 and ChiliTomatoNoodle are surely the best C++ teachers I ever had. :)

[@maddjhdhdhdhd6917]

The cherno is also a great guy

[@leocarvalho8051]

Theres also the chinese guy i dont remember the name and Jason

[@92309858]

leo carvalho Thomas Kim or Bo qian?

[@richardbloemenkamp8532]

Both your C++ and your teaching skills are absolutely excellent! They should give you a Bjarne Stroustrup Award.

[@hu-ry]

OMG HE HEARD OUR BEGGING FOR MORE SIMD COVERAGE! Blessed shall you be, you immortal being :D

[@whirvis]

Quite the intrinsic video! I haven't even watched the video long enough to know what it means, but I wanted to use that adjective! :)

[@luisendymion9080]

Good one lol

[@achtsekundenfurz7876]

That's a perfectly cromulent adjective!

[@RichBoud1]

I was watching this when I couldn't get to sleep. It is so fascinating that I kept watching and watching. It didn't help me get to sleep at all ;-). Thanks for a great lesson.

[@tusharsankhala9521]

Please keep this series of explaining parts used in C++ SIMD to continue, your way of explaining its awesome, Thanks for putting such a high quality content out in public.

[@ademarsj]

Interesting, I watched the video and thought: "Wow, what a amazing teacher, full of content", then i subscribed and check the channel videos and realize that when i was in the beginning of graduation I visited that same channel to see start level content and now, almost finishing the course, here i am, seeing a more complex thing, moral of the history: The channel and his creator is both incredible. Thank you !!! Sorry for my poor english....

[@Cyberspine]

Thank you for this video. I took a CS course in parallel computing this semester, and it demystified a lot of what makes high-performance code tick. This video helped me to connect what I've learned with what is going on in an IDE like Visual Studio.

[@inon4037]

Exactly when I needed it! The timing couldn't be more than perfect

[@pythagorasaurusrex9853]

Hell yeah! I tried those functions myself. Amazing tutorial. The speed gain is insane combined with using threads :) Thank you!

[@rperanen]

Another great video and little trip to memory lane. Few years ago, I had to work image processing with older hardware which did not had any GPU acceleration and some algorithms had to be written with SIMD. After getting mind wrapped to work in vector-oriented mode the project was surprisingly pleasant to code.

[@will1am]

By far the best video about this topic on youtube in overall. I only found much less detailed videos or way too detailed only on some specific parts. Cheers :)

[@wowLinh]

Amazing as usual!! I am simply amazed by the quality of your videos, topics and explanations.

[@javidx9]

Thanks wowLinh - It always pleases me when I see you comment - you've been around a loooong time now XD

[@Kollegah9997]

You sir are a beast! I'm a senior developer coding for 10 years, your knowledge is serios :)

[@Schwuuuuup]

That was great - and now CUDA ;-)

[@Mozartenhimer]

Then PTX assembly.

[@guiorgy]

Recently I had a C# code that would take about 50 minutes to execue and calculate. Running parallel got it to about 5 minutes. Using OpenCL (kinda like CUDA) got it a little under 10 seconds xd Edit: And yes, I did run the code for 50 minutes xd

[@Schwuuuuup]

@@guiorgy I wish I had the time to bring me up to speed with Cuda or Open CL, but besides a little bit of programming Arduinos I'm not a C programmer, and I struggle with basic concepts like 'const * char const' etc. I have a project regarding gamified genetic algorithm which I have done in Java years ago, and someime I have to recode in C, GPU computing and a powerful graphic engine

[@aamirpashah7159]

​@@Schwuuuuupwrite it like this const * char data; this will make more sense

[@Schwuuuuup]

@@aamirpashah7159 dude, my post is over 3 years old

[@adamodimattia]

Incredibly informative, the most hardcore but so enjoyable. Personally, I found masking not the hardest thing in it, instead it was the x positions and offsets, especially 52:04 - 52:12, what a... Fantastic stuff, thanks to your channel I really got more and more interested in more low level coding. The way you present it makes it much less scary, even the assembly code :)

[@jsflood]

Great video, it went from totally cryptic gibberish code to understandable logical code thanks to your elite explaining. Thank you !

[@javidx9]

XD err thanks John!

[@panjak323]

When I first looked on to the intrinsic code, I thought how complicated it was... But you explained perfectly, and something clicked, and I realized how easy it really is. Thanks to the avx, I'm getting double the performance on my Mandelbrot set renderer. The best thing is, it even works on multiple cores with OpenMP directive . The performance on CPU is as good if not better than on GPU.

[@arcadely]

Ha! And here it is: the SIMD video I asked for earlier today, along with plenty of others who asked before that, because I didn't check the post date on the brute forcing video. Great stuff!

[@javidx9]

lol thanks arcade, I was gonna say something earlier, but I figured you'd find it! XD

[@dorjderemnamsraijav5182]

Cant get enough of your videos javidx9! Love your videos man

[@dorjderemnamsraijav5182]

Javidx9, my hero. Why? He read every single comment i wrote on this channel and im sure it applies to everyone else. If I become successful person one day, the reason must be your videos. They are very well made and he explains every single step he made on his videos. I cant help you with financial part right now, but I will make sure pay what you did to me in the future after I get some job. You are very cool man (I cant even describe it with word). And thinking about what you did for me make me so emotional.

[@javidx9]

lol, thank you Dode XD

[@gosnooky]

I'm tired and I need sleep. Oh! A new javidx video.

[@londonbobby]

A bit late to the party, but here goes... This video has inspired me to try SIMD programming. I have long been a fan of Mandelbrots and many years ago wrote a program to plot and explore them. Eventually I got myself a PC with an i7 processor and explored making my Mandelbrot program multi-threaded which worked well. Now is the time to upgrade it again with SIMD. Now my cpu is still the same i7 which does not support anything past SSE4, but then compiler of choice is Delphi 6 (don't judge), which completely does not support intrinsic functions at all. However it does have an in-built assembler which supports up to SSE2. So my task has been to translate all this C++ code into Pascal/assembler. I have eventually got this to work - a few radical changes were required - e.g. I only have 8 x 128 bit mmx registers to play with so only 2 pixels at a time, but the speed-up is amazing. My program is rendering full screen images in just a few hundreds of milliseconds (sometimes much less) where it was taking multiple seconds before. The most complex image so far has only taken slightly over a second to process. Thank you so much for explaining this in such simple terms that I was able to do this and learn about SIMD.

[@javidx9]

Hey that's great Bobby! SSE4 is no slouch, and I'm pleased you got it working to your expectations. I must confess I'd not considered the availability of intrinsics in other languages before, so this is quite interesting.

[@Dave_thenerd]

@@javidx9 C# Recently added Intrinsics via the System.Numberics namespace and they work pretty well. See: devblogs.microsoft.com/dotnet/hardware-intrinsics-in-net-core/ and: docs.microsoft.com/en-us/dotnet/api/system.numerics?view=netcore-3.1

[@simonegiuliani4913]

You are very gifted at explaining things.

[@LevPleshkov]

Probably the most valuable video on KZbin so far!

[@Z0MBUSTER]

I showed one of your video to my father to make him believe you were me, we look exactly alike, it took him a good minute to realise it was'nt me !!! We laughed so hard, keep up the good work =)

[@javidx9]

a doppelganger eh?

[@valkarion9]

I will have a Computer Architecture exam next week and a significant chunk of the material is about SIMD extensions but since it's a university course it's all theory, so it's nice to see it in action.

[@danielkrajnik3817]

31:15 just a detail, but I think 'p' in '_mm256_mul_pd' stands for 'packed' not 'parallel'

[@axelanderson2030]

What does epi stand for? I assume 'something packed integer'

[@orbik_fin]

@@axelanderson2030 "extended packed integer", for 128+ bit registers, because _pi* was already taken for MMX.

[@axelanderson2030]

@@orbik_fin thanks

[@mido09z]

Great video and amazing channel. I just want to point out a small note at 41:57 which is n < iterations is not the same as iterations > n because of the case where n = iterations

[@javidx9]

This is a good point Mohamed - combined with the way the loop is structured now, I think this approach always does one further iteration compared with the reference function.

[@achtsekundenfurz7876]

(1) n < iterations (2) iterations > n If n = iterations , both expressions are false, since both comparators exclude equality. They are in fact the same.

[@Gabriel38196]

Thanks for what you are doing for the community javid.

[@karma6746]

Your ability to simplify complicated stuff borders on the divine - Thank You!

[@ddummer]

Just watched Linus tech tips where Anthony mentioned "AVX 512" support on a new macbook and since I recently watched this video I could say "Oh yeah... I understand that... in depth." :)

[@obinator9065]

Yeah thing is... AVX512 takes a way bigger CPU hit, not worth it.

[@lincolnsand5127]

I used to heavily use SSE2. Excited to see you cover AVX256

[@truboxl]

ohhhh.... that's why its called avx2 for short...

[@ilieschamkar6767]

​@@truboxlnow it makes sense to me as well even tho i wouldn't shorten something already short

[@laureven]

Is there space where we can give Ideas for the new videos (so we have a list) and then we can vote witch subject is most selected ...obviously this is Your channel and Your vote is final but one thing is certain. You have a gift and the way and Your voice is just in perfect balance: a very very good teacher. We are very lucky You have time for those videos.

[@javidx9]

Hi Marcin - kind of, but mostly no - On the discord we have a requests board, though fundamentally it requires that I feel confident enough about the subject matter to demonstrate it. I simply wont make videos about subjects I dont have a good understanding/experience of, they wouldn't help anybody! Also, I often disappoint people with timing of videos, since this is a hobby for me, it helps if the video i'm making is related to some project I'm working on at the time. In the case of intrinsics for example, I've been using them a lot in a different project which isnt a video, so its fresh in my mind. But always happy to see a comment from your good self, a long time supporter and I thank you for that!

[@notnullnotvoid]

I'm not quite sure why you talked about cache locality when you did, as it's unrelated to the loop unrolling optimization. The cache behavior of the loop is the same either way - the reason it gets unrolled is just to reduce loop overhead (fewer compare and branch instructions per iteration). Other than that, this seems like a great video for introducing people to SIMD programming. Your explanations of lanes vs. register width, masking, and the utility of intrinsics in general, are all very clear, concise, and thorough. Good stuff!

[@javidx9]

Thanks Not Null - I kind of agree with you, I wanted to fit in locality somewhere, and there is some truth to unrolling being advantageous to cache usage, for the reason you describe in fact - aside from branching having its own overhead which you want to reduce, and of course branch prediction being a factor, the branch test itself could potentially pollute the cache. SIMD stuff works best when streamed, and there are in fact cache organisation intrinsic functions to hint where the data should be moved to before the next set of instructions. Streaming of course works best with contiguous data in memory, and typically such memory is moved around "together". Once that extension pipeline is fired up, you want to cram as much data through it as possible, so I dont agree that its unrelated, but I do concede it is secondary to chaos branching can cause.

[@notnullnotvoid]

@@javidx9 Doesn't the loop condition (at least in this case) just come down to a compare instruction and a conditional jump on the relevant flag bit? I don't see how that would pollute the cache, but I might be missing something.

[@javidx9]

@@notnullnotvoid On powerful processors such as desktop ones, its not quite that simple. Yes, the condition is based off a single bit, but 2 things, firstly the pipelined nature of the processor requires branch prediction, and flushing out the pipeline is undesirable for performance, secondly the arguments for the condition itself may require memory to be read, thus potentially polluting the cache.

[@toma.a7146]

It is nice to see more complicated stuff like this on KZbin!

[@qwedschy8285]

Spending my summer break learning more about coding, but what can I say, these videos are too good! Thank you.

[@spinthma]

Thank you for the insights to programming with intrinsics!

[@Mrav79]

So this eases the old school approach of having an __asm {} block to optimize what logic the compiler would not be able to do like we find in some older open sourced e.g. games engines, with organized instrinsic functions for exposing modern cpu instructions via modern compilers. Nice.

[@Dr10na1995]

So that is why these AVX flags are used in GCC! Thank you for the explanation :)

[@nishantraj8391]

Are you a wizard? I was trying to learn about this just recently, and then your video comes out. Thank You

[@hippzhipos2385]

You are an absolute legend. I was wondering how much experience one needs to have to get that good

[@47Mortuus]

44:34 ++++ You don't need to use the comparison mask to select/blend between '0' and '1'. Since 'all ones' is the two's complement representation of '-1', you can simply subtract the mask from your iteration counter (x + 1 x - (-1) AND x + 0 x - 0). You could've explained the blend intrinsic with this code segment, going from where you were with your AND equivalent, but also showing off the trick I mentioned afterwards.

[@leonbutlermusic]

Excellent explanation

[@tmbarral664]

Bow to you, Sir, for the quality of your explanation. I love how your mind works.

[@rotemlv]

22:24 Just letting you know, the compiler is actually smarter than it seems. In this example you will get the desired behavior by using a different "branching" technique: for(...) arr3[i] = arr1[i] + arr2[i] * (arr1[i]!=23); This way the compiler uses ymm and moves them 8 at a time. Can't say how wasteful it may be, as it fills the whole ymm6 with 0x17's (23's) for parallel comparisons, but still, impressive imo.

[@darkobakula5190]

As always, the best content one can find on KZbin!

[@malstroemphi1096]

I believe "pd" stands for "packed double" and not "parallel double"

[@cracksoftcond]

wonderful thank you!

[@jayasribhattacharya2048]

You are just awesome. I have learned many things from your videos. 😍😀 thank you so much 😊.

[@javidx9]

Thanks Jayasri!

[@duality4y]

need more of this

[@dozafixusa]

At 49:40, it is also possible to use _mm256_extract_epi64 to get simple types out of a register again, which would get rid of the ifdef Having done some intrinsic programming before, and i think that your video is an amazing ressource on how you programm with it's quirks in minds Well, all of your videos are an amazing ressource - keep up the good work! :)

[@javidx9]

Cheers buddy, The problem I find with intrinsics is there are so many functions, but Ive not found a sensible "high level" list of function catagories XD so thanks!

[@Drunkenkatana]

Thanks for your videos! I love the way you explain things!

[@hl2mukkel]

Thank you so much for this video, I learned so much! You truly are a blessing for the C++ KZbin community :-)

[@benjaminshinar9509]

I will need to watch this again in the future.

[@mycotina6438]

Loved it! Simple, easy to understand yet complete. Thank you!

[@jordanclarke7283]

Mind blown! 🤯 Excellent video!

[@dieSpinnt]

!!!Beware!!! Don't ship into dangerous waters. Rule 16 Do not use identifiers which begin with one or two underscores (`_' or `__'). > The use of two underscores (`__') in identifiers is reserved for the compiler's internal use according to the ANSI-C standard. > Underscores (`_') are often used in names of library functions (such as "_main" and "_exit"). In order to avoid collisions, do not begin an identifier with an underscore. via www.doc.ic.ac.uk/lab/cplus/c++.rules/chap5.html Just my two nit-picky cents:P

[@yuushabio4529]

Finally, a video on KZbin i can relate to 😆

[@zubble7144]

It might be instructional to add the benefit of using intrinsics by showing a sid-by-side video of the fractal generations. IOW a "what is there to gain" for all your extra coding efforts. Well done, I have recommended this on IDZ

[@javidx9]

Hi Zubble and thanks - In principle this was a follow up to the previous video that did show the the difference with/without intrinsics, its just that one did not show the intrinsic code in detail.

[@zrodger2296]

I think I found a really cool problem that could use intrinsics so I'm excited. A couple of other optimizations and I'm aiming to solve out to 1 million instead if grinding it out to 50 thousand or so. Great video!

[@alexkval]

Thank you very much for such a detailed explanation 👍

[@JackPunter2012]

Great video as always! For those who want a more detailed look at the difference in timings for cache vs Memory vs Hard drive I recommend the talk "Getting Nowhere Faster" By Chandler Carruth at Cppcon 2017.

[@darthxertor3617]

So THIS is an actual practical use of bit masks. Very good to know, thank you!

[@jajwarehouse1]

It would be very interesting to see this programmed for CUDA processing.

[@judgeomega]

gpu optimization information is rare and valuable. i dont know if hed be willing to expose such secrets of the dark arts.

[@michelefaedi]

Simd is better than cuda in some cases. It don't need to transfer the data to the GPU and the loop is faster with simd(is complicated to explain why)

[@karma6746]

@@michelefaedi Oh but you do need to transfer data to the GPU anyways. GPU is the one that actually does the drawing, isn't it?

[@michelefaedi]

@@karma6746 only if you consider the graphics calculation. CUDA can do any algorithms you want. Even the one that don't require the video directly

[@achtsekundenfurz7876]

Fractals and similar iterations sound like a close second to me. There's very little to be transferred into the GPU, and very little back out. Moving the heavy lifting into the GPU could be very profitable, even more so since modern GPUs tend to have 100s of cores, even the better consumer-grade models. Not exactly your everyday algorithm, but even if you want to save the data to disk, it looks very promising. If you don't, real-time animation in full HD is definitely on the horizon thanks to Cuda. For other stuff, it can be the other way around. Instead of freeing CPU cores, it could tie cores down with management duties (or even worse: tie ONE core and block the others out), which is probably a workload for which most modern OSes are not optimized (unlike processing in the CPU or pure output generation in the GPU).

[@rhutajoshi9288]

This is so well explained!! Thank you!

[@JonnyRobbie]

Jesus Christ, you've outdone yourself. But thank you, I like videos where I learn something new and this certainly exceeded that by a long shot.

[@achtsekundenfurz7876]

_in be4_ "Jesus take the mousewheel"

[@brainplot]

Hi Javid! Nice video, I really like this stuff! I have a question. Would these functions fail to compile on CPUs that don't support the required extensions or would they compile and cause erratic behavior at runtime?

[@javidx9]

Thanks Gianluca! They would compile just fine, but under normal circumstances you would not be able to launch the executable program, as a quick check is made at the start to see if it contains unsupported instructions.

[@brainplot]

@@javidx9 Awesome, thanks!

[@miguel_franca]

Loved it! Clear explanations, awesome video

[@coder2k]

I would really like to know how you discovered/learned all that stuff. What/who did "bring this to you"?

[@boltstrikes429]

for an actual answer: most likely went to college

[@Unit_00]

@ not that I know how javidx9 did learn cpp, but I wanted to highlight a bit of a logical fallacy you're falling on. The original comment asks about how did javidx9 (he in particular) learned cpp. Bolt Strikes said that he likely went to college (which I guess is likely). You are saying that going to college is not a requirement to have good programming skills, which I definitely agree, but that's besides the point. The question here is "how did javidx9 learn cpp", not "is it possible to learn cpp without going to college".

[@NolePTR]

I'd love more technical videos like this in the future. It's hard to get tutorials for this type of stuff.

[@christophfriedrich5092]

Love your vids. Even if I don't understand them the first time I watch because I'm just a simple web developer (PHP, NodeJS) but the way you explain helps me to understand more of our computers and the way programs work (and I hope they make me a better programmer - even on simpler stuff ^^)

[@josedejesuslopezdiaz]

thank u for your amazing content.

You’re such a smart dude.

[@londospark7813]

While we're on the optimisation train is there any chance of you doing an easy (or as easy as is reasonable) to understand video about things like Data Oriented Design, SoA vs AoS and when to choose which?

[@londospark7813]

And yes: I know that DoD is not just using SoA.

[@javidx9]

Hey Gareth, it's interesting stuff, but maybe a little difficult to demonstrate easily in a video. I don't mean the concept in this instance, but its efficacy without resorting to deliberately contrived scenarios. I'll add it to me "thonk" list XD

[@akhial]

Awesome! Thanks for this!

[@peterbonnema8913]

Yes! This is great. More advanced topics please!!

[@000TheMatheus000]

i have some questions... what if the x axis width is not divisible by 4? the compiler knows how to get the next value from the next line? also i missed a demonstrations of the assembli code at the end.. i totally believe you that it is probably the way it shoul be but i would like to have seen it, other than that, nice video, very advanced

[@javidx9]

Thanks Matheus! On the whole, if you are using these extensions, its better to work with data that is multiples of the register size you are using - it just makes life easier, so waste a few bytes of memory if required. It doesnt really matter in the case of the fractal example if the x-axis width is not a multiple of 4, it would just wrap around and do a few pixels on the next line. If you really cant clamp your array to a multiple, then it can get fiddly, and you may be better off recognizing that as a special case, and just hand processing those remaining elements.

[@Wayne-wo1wc]

Thank you Dave

[@markv559]

Premature optimization might be the root of all evil, but watching this video is pre-premature optimization and is very enjoyable!

[@tharinlnhein7806]

Hi javidx9, thanks for all your videos, it's great work and always so pleasant to watch! A little question here: how do you manage to show a preview of your current file on the right side of your screen? Is that an extension, or a feature I'm not able to find in the endless universe of visual studio's options? The split functionality only splits horizontally, and doesn't allow a different zoom value for the 2 resulting windows, so I guess it's a completely different thing...

[@Koldulok]

An ALU "It's the thong that does the stuff" - OLC 2020 (7:20) I love it

[@achtsekundenfurz7876]

"thong" ? hahah Anyway, yeah that's a good quote; should be on a t-shirt: "It's the thing that does the stuff" - Programming Bible, Javi 7:20

[@TOMMYMAJORS]

incredible video, thank you

[@nonchip]

i like how VS shows a small "

[@Spikehead777]

Intrinsics look scary. They're not as scary now that I've seen this video!

[@motbus3]

still the best c++ videos

[@Bjarkediedrage]

Hello javidx9, referring to 1:58 I'm a little annoyed, and would like to complain about the fact that you unnecessarily free up the heap allocated arrays before the program terminates, as the memory will be freed anyway when the program exists. It will just make exiting the the program slower.

[@sbfk6799]

While technically this is true, I would argue that the benefits of consistently freeing resources after use (so it becomes habit) far outweight the cost of freeing some memory, even in a small demo like this. Explicitly freeing all allocated memory can also make it easier to catch subtle bugs (e.g. segfaults) and will keep your static/dynamic analysis tools happy (if you're using any that is).

[@karma6746]

@@sbfk6799 Relax bro, he's trolling :)

[@sasuke2910]

@@sbfk6799 This thought process eventually leads to RAII because things become too complex. Applications generally handle data in batches, allocate everything at the start, throw it all away at the end. If you wanted to be pedantic you could argue that he should of allocated everything in some kinda arena then freed that at the end. But telling people to delete 3 arrays at the end of a 100 line demo program is bad dogmatic advice.

[@srccde]

Am I missing something or why do you assume that the allocated memory is freed anyway when the program exits? Whilst that is practically certainly true because a modern OS is smarter than most programmers, it is still implementation-defined (or OS-specific) behaviour and therefore non-standard. Unfreed memory, per standard, is leaked memory which is why him explicitly freeing (or deleting) it is absolutely correct and fine. Considering there's much more the OS has to do anyway whenever a program exits, the slowdown induced by a couple of frees is entirely negligible. I argue it's not even measurable. Also, for C++, not deleting a non-trivial (i.e. non-pod) object (or array of objects) means that the destructor(s) aren't called either. And that's undefined behaviour.

[@Bjarkediedrage]

​@@srccde I was mostly just trolling -_- But yes, that's a very good point you make.

[@timcain1418]

That was a very interesting video - you have a rare knack for hitting a happy medium in the conflict between "informative" and "comprehensible". Your vids are usually pretty entertainig too, so double thanks. I was wondering - having taken the fractal rendering so far with intrinsics and multithreading, Could yoU Devise An even more hardcore strategy to get even higher performance?

[@javidx9]

Thanks Tim, the next stage would realistically be GPU computation, SIMD devices can do this sort of thing orders of magnitude more performant.

[@GNARGNARHEAD]

incredibly helpful, thanks :)

[@atrumluminarium]

Yes! Thank you for the video

[@rachelmaxwell4936]

An excellent video! Thank you for taking the time to respond to user feedback. Appreciate the details about masks and how to use them to perform logical operations. I've beem learning x64 programming via "Beginning x64 Assembly Programming: From Novice to AVX Professional" by Jo Van Hoey and this is an incredible suppliment to the C/C++ side of things.

[@Andrew90046zero]

I think what there needs to be is a nice api that allowed you to "agnostically" use the SIMD extensions without needing to know which ones your cpu support. And the api will provide a way to manually leverage the registers in a more human-readable way without having to pay attention to choosing the right set for your cpu. It just generates the right intrinsics for your system. And you won't need to think about if the registers are 128, 256, or 512. The system will pack in the data automatically and its up to you to manually use it to process data in bulk.

[@federicopanichi9874]

nice, nice, nice !!!! More of those Hardcore videos. Pleeaaase :)

[@Dilandau89]

Realy nice and clear Explanation. Question: Did you miss setting _c by logic AND _mask2 and _one?

[@iDeathHD]

he did forget in the video, yes, the github code seems to be correct though.

[@racorescript]

Great video as always but I have a doubt. I'm not sure why the compiler, (in release mode), did not optimized out the whole code in main since the result is never used. Is it because the arrays are allocated in the heap? Thank you in advance

[@lolerie]

This is most certainly because it is not GCC it is Microsoft shitty compiler.

[@javidx9]

Just to extinguish any compiler fanboi wars before they start XD, I think you are correct with your assessment of the arrays being dynamically allocated. It is very possible something else could be using that memory, therefore the compiler has to be safe (a multithreaded app, or some IPC for example) - one of the reasons I didnt allocate them on the stack.

[@racorescript]

​@@javidx9 Yeah. I'm not interested in wars as well :) Just to clarify (even if it should be obvious), my question was not why you did allocate the array on the heap, but why the compiler did not optimized away the code and your answer of possible shared memory between proceses or threads makes perfect sense. Thank you

[@lolerie]

@@racorescript there is godbolt.org/ you can check yourself with ten different compilers nd various versions of them.

[@leepro]

_c missed in the video but I found it in the github repo. Thanks for the video!!!

[@JanHorcicka]

Great video! Thank you very much.

[@paulmoore7964]

one of the biggest issues today is that cpu % meters do not show stall time. SO you can have a horrifically inefficient data layout and be running at 5% cpu speed but the cpu meter will show 100%, I am amazed that there is still no way in perfmon, VS ,... to see the real cpu load. I did not realize how truly huge the impact was