<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>assembly arithmetic Archives - NeuralLantern.com</title>
	<atom:link href="https://www.NeuralLantern.com/tag/assembly-arithmetic/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.NeuralLantern.com/tag/assembly-arithmetic/</link>
	<description></description>
	<lastBuildDate>Sun, 30 Nov 2025 07:30:57 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.9.4</generator>

<image>
	<url>https://www.NeuralLantern.com/wp-content/uploads/2025/04/cropped-2025-04-04-Lantern-03-32x32.png</url>
	<title>assembly arithmetic Archives - NeuralLantern.com</title>
	<link>https://www.NeuralLantern.com/tag/assembly-arithmetic/</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>x86-64 Assembly: Signed Integer Multiplication and Addition with IMUL &#038; ADD (YASM on Ubuntu Linux)</title>
		<link>https://www.NeuralLantern.com/x86-64-assembly-signed-integer-multiplication-and-addition-with-imul-add-yasm-on-ubuntu-linux/</link>
					<comments>https://www.NeuralLantern.com/x86-64-assembly-signed-integer-multiplication-and-addition-with-imul-add-yasm-on-ubuntu-linux/#respond</comments>
		
		<dc:creator><![CDATA[mike]]></dc:creator>
		<pubDate>Sun, 30 Nov 2025 07:30:56 +0000</pubDate>
				<category><![CDATA[Assembly Language]]></category>
		<category><![CDATA[Coding]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Videos]]></category>
		<category><![CDATA[assembly arithmetic]]></category>
		<category><![CDATA[assembly language programming]]></category>
		<category><![CDATA[cpu registers assembly]]></category>
		<category><![CDATA[imul instruction]]></category>
		<category><![CDATA[intel imul]]></category>
		<category><![CDATA[low level programming]]></category>
		<category><![CDATA[nasm imul]]></category>
		<category><![CDATA[reverse engineering basics]]></category>
		<category><![CDATA[signed multiplication assembly]]></category>
		<category><![CDATA[systems programming]]></category>
		<category><![CDATA[ubuntu assembly]]></category>
		<category><![CDATA[x86_64 tutorial]]></category>
		<category><![CDATA[x86-64 assembly]]></category>
		<category><![CDATA[x86-64 multiplication]]></category>
		<category><![CDATA[Yasm tutorial]]></category>
		<guid isPermaLink="false">https://www.NeuralLantern.com/?p=259</guid>

					<description><![CDATA[<p>Hands-on x86-64 assembly tutorial showing how to perform signed integer multiplication using the IMUL instruction in YASM/NASM on Linux. Covers immediate and global operands, two/three-operand forms, basic addition, with complete working code and live execution.</p>
<p>The post <a href="https://www.NeuralLantern.com/x86-64-assembly-signed-integer-multiplication-and-addition-with-imul-add-yasm-on-ubuntu-linux/">x86-64 Assembly: Signed Integer Multiplication and Addition with IMUL &amp; ADD (YASM on Ubuntu Linux)</a> appeared first on <a href="https://www.NeuralLantern.com">NeuralLantern.com</a>.</p>
]]></description>
										<content:encoded><![CDATA[
<figure class="wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio"><div class="wp-block-embed__wrapper">
<iframe title="x86-64 Assembly: Signed Integer Multiplication and Addition with IMUL &amp; ADD (YASM on Ubuntu Linux)" width="1380" height="776" src="https://www.youtube.com/embed/QmIdCYsxTTM?feature=oembed" frameborder="0" allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share" referrerpolicy="strict-origin-when-cross-origin" allowfullscreen></iframe>
</div></figure>



<p>Want to actually understand how signed integer multiplication works at the CPU level? In this straight-to-the-point x86-64 assembly tutorial we dive into the IMUL instruction &#8211; the proper way to multiply signed integers in YASM/NASM on Linux.</p>



<p>We cover:</p>



<ul class="wp-block-list">
<li>The difference between unsigned (MUL) and signed (IMUL) multiplication</li>



<li>Two-operand vs three-operand IMUL forms</li>



<li>Multiplying immediate values vs global variables</li>



<li>Loading values into registers (mov) and performing fast multiplication</li>



<li>Basic addition with ADD and INC</li>



<li>Full working example that prints results so you can see it in action</li>



<li>Why you should respect the ABI and save callee-saved registers (R12-R15)</li>
</ul>



<p>Everything is built with YASM on Ubuntu, linked with a tiny C driver, and run instantly. No fluff, just real assembly code you can copy and run right now.</p>



<p>Code on screen, calculator verification, and clear explanation of every line. Perfect if you&#8217;re learning low-level programming, reverse engineering, or just want to know what really happens when you write a = b * c; in C.</p>



<p>Introduction to Integer Arithmetic 00:00:00<br>Recommended Book and Resources 00:00:39<br>Instruction Set Overview 00:01:17<br>Addition Instruction (ADD) 00:01:43<br>Unsigned vs Signed Multiplication 00:02:20<br>Signed Multiplication with IMUL 00:03:05<br>IMUL Three-Operand Form 00:03:40<br>IMUL Two-Operand Form 00:04:12<br>Squaring with IMUL 00:04:50<br>Setting Up the Sample Program 00:05:08<br>Data Section and Strings 00:06:13<br>Text Section and External Functions 00:06:58<br>Math Function Entry Point 00:08:01<br>Multiply Test Function Setup 00:08:42<br>Multiplying Immediate Values 00:09:48<br>Printing the Immediate Result 00:10:21<br>Running and Verifying Immediates 00:12:53<br>Multiplying Global Variables 00:13:49<br>Loading Globals into Registers 00:14:07<br>IMUL with Globals Demo 00:14:37<br>Addition with INC and ADD 00:15:36<br>Final Results and Verification 00:17:09<br>Wrap-Up and Closing 00:17:22<br>Outro and Subscribe Request 00:17:44</p>



<p>Thanks for watching!</p>



<p>Find us on other social media here:</p>



<ul class="wp-block-list">
<li>https://www.NeuralLantern.com/social</li>
</ul>



<p>Please help support us!</p>



<ul class="wp-block-list">
<li>Subscribing + Sharing on Social Media</li>



<li>Leaving a comment or suggestion</li>



<li>Subscribing to our Blog</li>



<li>Watching the main &#8220;pinned&#8221; video of this channel for offers and extras</li>
</ul>



<p>okay</p>



<p>hey everybody in this video i&#8217;d like to talk to you a little bit about</p>



<p>integer arithmetic in yasm assembly on an x86-64 system</p>



<p>so what am i talking about well integer arithmetic i want to take integers and i want to add them</p>



<p>together multiply them together whatever this video is mostly going to focus on signed integer</p>



<p>but I&#8217;m going to briefly skim through unsigned integer multiplication and also</p>



<p>addition and anyway so for starters let me go up to this the top of this book</p>



<p>here that I&#8217;ve got I&#8217;m going to show you pages from a book that I really really</p>



<p>love I mentioned it in a lot of my other videos it&#8217;s called x86 64 assembly</p>



<p>language programming with Ubuntu and it is written by a brilliant doctor</p>



<p>professor who is just interested in everyone learning this is an open source</p>



<p>you can get yourself a copy for free just look that title and name up you can find his website</p>



<p>you can grab a copy and you too can become an assembly expert just by reading this book</p>



<p>honestly this book has everything that you really need to to really level yourself off</p>



<p>level yourself up well beyond i think the master&#8217;s level of college probably</p>



<p>not as much as the person who wrote the book but you never know anyway let me uh</p>



<p>I want to go down to section 7 here and it&#8217;s called instruction set overview.</p>



<p>So here you can have like an overview of like all different types of instructions, but I&#8217;m</p>



<p>going to focus on the integer arithmetic instructions.</p>



<p>So I&#8217;m going to go to 7.5.</p>



<p>Notice how the first section in here is addition.</p>



<p>I&#8217;m not going to give you an addition example because it&#8217;s just too easy.</p>



<p>You pretty much use just use the add instruction and then you have a source and destination</p>



<p>comma source in x86 yasm assembly it&#8217;s pretty much the destination is the first operand so uh</p>



<p>that&#8217;s kind of implied usually when you have just like a two operand instruction now we could add</p>



<p>using three operands and the the first one would be the destination and then the other two would</p>



<p>be the sources but i&#8217;m going to scroll down past that to the integer multiplication section 7.5.3</p>



<p>unsigned multiplication is a little tricky and</p>



<p>You kind of have to decide what data size you&#8217;re going to go with and then you use the instruction</p>



<p>uh, and then you end up with some some uh, some answers that are spread across multiple registers</p>



<p>I&#8217;m going to eventually make other videos where I can talk to you about how to manipulate multiple registers or at least know that they&#8217;re there like</p>



<p>not 64-bit registers so if we were clever we could just sort of manipulate those so that</p>



<p>the whole answer showed up on one single 64-bit register if we wanted to but just know you can</p>



<p>multiply unsigned integers it&#8217;s a little bit more complicated than signed integers so in this video</p>



<p>i&#8217;m just going to talk about signed integers let&#8217;s see so signed integer multiplication</p>



<p>so in order that&#8217;s a section 7.5.3.2 if you want to multiply two integers and they&#8217;re signed</p>



<p>and they&#8217;re signed meaning they have a plus or a minus sign meaning they&#8217;re designated as either</p>



<p>positive or negative rather than not designated at all which would usually just mean positive</p>



<p>you can use imall as an instruction and well you can just provide you know one operand two operands</p>



<p>or three operands let&#8217;s do the three operand version first because that&#8217;s probably the easiest</p>



<p>So we would take a number that&#8217;s sitting in a register and then we would multiply it by some immediate.</p>



<p>Notice how IMM is sitting here.</p>



<p>The result of multiplying a register by some number would just go into the destination operand.</p>



<p>So that means you&#8217;d put a register here.</p>



<p>You&#8217;d put a register here.</p>



<p>You&#8217;d put an immediate here in one instruction.</p>



<p>Then you&#8217;d have some sort of an answer on what these two numbers were multiplied against each other.</p>



<p>then you&#8217;re allowed to specify a register for the destination and a register for the source.</p>



<p>But notice how the destination gets overwritten here.</p>



<p>So, you know, it&#8217;s going to multiply this number by this number</p>



<p>and then just store the result in the first register.</p>



<p>So you will kind of overwrite something.</p>



<p>It&#8217;s maybe more convenient for you to use the three operand version</p>



<p>if you only want to multiply by an immediate.</p>



<p>But, you know, anyway, and then for the, let&#8217;s see, let&#8217;s see, I think you can square a number</p>



<p>just by specifying its source here.</p>



<p>It&#8217;ll multiply a number by itself.</p>



<p>And then let me just go down a little bit.</p>



<p>I&#8217;m starting to get lost in this book.</p>



<p>Let me go down a little bit.</p>



<p>Well, I guess that&#8217;s all we really had to say.</p>



<p>Okay, so let me show you a sample program that I&#8217;ve prepared.</p>



<p>that I&#8217;ve prepared so that we can multiply. Okay, sample program. I think I need to rehearse myself</p>



<p>a little bit more before I record videos. Anyway, I&#8217;ve got this empty source code file here. Keep in</p>



<p>mind that I don&#8217;t need that. Keep in mind that I have a sample program here already. I&#8217;m not going</p>



<p>to really focus on the contents of it because this is not what did I do wrong here? Main and math.</p>



<p>main empty no no where&#8217;s my make file oh I forgot to open it this is not a video</p>



<p>about make files or hybrid programs or anything like that that&#8217;s covered in my</p>



<p>other videos so I&#8217;m just gonna say hey I&#8217;ve got a make file that compiles my</p>



<p>assembly source code and then I&#8217;ve got a driver C source code file which its</p>



<p>entire job is just to have the main entry point because I&#8217;m linking against</p>



<p>the GCC libraries and then its job is just a call on a math function which</p>



<p>So now my assembly module is blank.</p>



<p>What should we do?</p>



<p>First I&#8217;m going to copy paste from my solution here, just a bunch of strings.</p>



<p>So I&#8217;ve got a data section that I&#8217;m going to get set up.</p>



<p>This is not a video about the basics of assembly programming.</p>



<p>See my other videos, but for now I&#8217;m just going to say, well, I&#8217;ve got a bunch of strings.</p>



<p>I&#8217;m going to say the result of multiplying immediates is this, the result of multiplying</p>



<p>globals is that.</p>



<p>multiplications and then see the results. Okay, so then a couple more variables</p>



<p>before we&#8217;re finished is I&#8217;m gonna now say that we have a system call for</p>



<p>system right which is not what this video is about. See my other videos for</p>



<p>system calls. Same thing for file descriptors it&#8217;s there I&#8217;m not gonna</p>



<p>explain it too much I&#8217;m just gonna print a standard output and then from this</p>



<p>program we&#8217;re gonna I&#8217;m gonna return just an integer for whatever reason I&#8217;m</p>



<p>for whatever reason. I&#8217;m just saving it as a variable. And then we want to multiply some</p>



<p>integers. So I&#8217;m storing two integers in the global section, you know, still inside of the</p>



<p>dot data section. So that&#8217;s, these are going to be global variables. They&#8217;re going to be both</p>



<p>be quad words. So I can load up into a quad registers or quad word registers. And now I&#8217;m</p>



<p>ready to start my text section. So the first thing that I&#8217;m going to do is just, you know,</p>



<p>that&#8217;s where all of our instructions go and then I&#8217;m going to name two external</p>



<p>symbols don&#8217;t worry about these symbols they are not the point of this video but</p>



<p>you know I have a little library that I wrote that helps me print and and take</p>



<p>input from the user I&#8217;m gonna print an integer I&#8217;m gonna take an input from the</p>



<p>from the user so don&#8217;t worry about that that&#8217;s not the point of this video</p>



<p>really I just want to make it so that when I demo I can just easily type in an</p>



<p>and then just print it to the user.</p>



<p>So let&#8217;s look at our main entry point here.</p>



<p>Remember the driver calls on a function called math.</p>



<p>So I&#8217;m just gonna make an entry point called math,</p>



<p>mark it as global so the driver can call on it.</p>



<p>And then I&#8217;m gonna, whoops, why did I put load here?</p>



<p>Do, I&#8217;m gonna put, I&#8217;m gonna say do it right there.</p>



<p>Let&#8217;s do it.</p>



<p>I&#8217;m just gonna call on a function I wrote</p>



<p>called multiply test, kind of pointless</p>



<p>if you think about the fact that there&#8217;s like no code</p>



<p>in the main function here.</p>



<p>like no code in the main function here but that&#8217;s the way i like to do it when we&#8217;re done we&#8217;re just</p>



<p>going to return our return value that&#8217;s already been defined and so now i&#8217;m ready to start setting</p>



<p>up our multiply test maybe i&#8217;ll just copy paste the header here and i&#8217;ll say this is going to be</p>



<p>a label called multiply test because i&#8217;m going to call on it and try to use it like a function</p>



<p>i&#8217;m going to put a return instruction at the very end so now it really is a function</p>



<p>I&#8217;m going to use these registers.</p>



<p>So I&#8217;m going to use R12, R13, R14, and R15 to hold temporary immediates and globals</p>



<p>just for multiplication.</p>



<p>So I&#8217;m basically going to be using the registers to hold my data.</p>



<p>And because I&#8217;m going to use all of those registers, remember you have to respect the</p>



<p>ABI.</p>



<p>So that means we have to have a push pop pair on all of those registers because they&#8217;re</p>



<p>designated as callee saved.</p>



<p>saved if anyone calls on your functions and you&#8217;re not respecting the abi then you&#8217;re probably about</p>



<p>to crash the program in some way or even if you are the only person who writes any code that your</p>



<p>code calls on or gets called from you&#8217;re probably still going to regret not respecting the abi</p>



<p>eventually when you forget what&#8217;s going on anyway so let&#8217;s multiply some immediates first thing i&#8217;m</p>



<p>and move it into R12 because that&#8217;s where we&#8217;re going to hold some temporary</p>



<p>immediates and then the number 256 put that into R13 and then I&#8217;m going to use</p>



<p>the I&#8217;m all instruction to just multiply those two values together because this</p>



<p>is the two operand version of that instruction the result will also be</p>



<p>stored in R12 so that means 233 will be erased from R12 and the answer that will</p>



<p>the results for the immediate because I like my programs to be pretty. I&#8217;m not just going to print</p>



<p>the numbers and then hope I can remember which number comes first. That&#8217;s usually a huge mistake</p>



<p>if you&#8217;re trying to debug something even a little bit complicated. So I&#8217;m going to print my string,</p>



<p>which I&#8217;m calling the immediate prefix. And if you look back up at the top right here,</p>



<p>it&#8217;s just going to say the result of multiplying immediates is, and then it&#8217;s going to put three</p>



<p>asterisks. And then I&#8217;m going to print the actual result. And then the suffix is just going to be</p>



<p>And then the suffix is just going to be three more asterisks.</p>



<p>So we should basically see the results surrounded by asterisks.</p>



<p>So I&#8217;m doing that.</p>



<p>And then I&#8217;m going to use my library</p>



<p>to call a special printing function</p>



<p>so that I can just print to the result.</p>



<p>So R12 is where the result of the multiplication is.</p>



<p>I&#8217;m going to give that as the first argument,</p>



<p>which is the RDI register, if we&#8217;re talking about integers.</p>



<p>And then I&#8217;m just going to call my function</p>



<p>that&#8217;ll print for me.</p>



<p>for me and then I&#8217;m going to print the suffix so the suffix is just that other</p>



<p>string we talked about just it trails with asterisks I&#8217;m then going to call</p>



<p>on a custom function called crlf all that&#8217;s going to do is just print a new</p>



<p>line I don&#8217;t know why I do that I could easily put that into the string but it&#8217;s</p>



<p>more fun to call functions although to be fair every time you call a function</p>



<p>you are jumping to an instruction elsewhere and so the CPU does pay a</p>



<p>trying to write programs for high performance you might not want to do that anyway so this is pretty</p>



<p>fast because i&#8217;m really just using an immediate and then i&#8217;m loading it into a register i&#8217;m not</p>



<p>actually touching global memory so this should be a lightning fast multiplication operation</p>



<p>let&#8217;s see if this actually works if i didn&#8217;t screw this up whoops what did i what did i do there oh no</p>



<p>i have too many videos now</p>



<p>gosh okay clear and make run oh what have I done undefined symbols CRLF did I</p>



<p>forget oh I forgot to copy paste my CRLF function yeah so again don&#8217;t worry</p>



<p>about CRLF all I&#8217;m doing is just printing a new line carriage return it&#8217;s</p>



<p>just you know this is from another example where I was trying to prove to</p>



<p>somebody you need to preserve registers and respect the ABI so don&#8217;t even worry</p>



<p>you know what I&#8217;m going to leave it as is because if I take that out then I have to take the time</p>



<p>to remove the push pop pair because there&#8217;s no point at that I&#8217;m doing that if I&#8217;m not</p>



<p>messing with those registers forget about that it&#8217;s not part of this video</p>



<p>anyway I&#8217;m going to run the program again and you can see that the result of multiplying</p>



<p>immediates is and so this whole string right here was my prefix so again not really the point of</p>



<p>the point of this video and then this is the result of multiplying those two different numbers</p>



<p>and then the suffix with the stars after so let me just prove this to you where&#8217;s the dang calculator</p>



<p>oh man i need to work on my icons like i just did something screwy and i have like no good icons</p>



<p>anymore on this virtual machine so we were going to multiply 233 by whoops by what was it 256.</p>



<p>five nine six four eight and you can see that&#8217;s on the screen five nine six four eight so we have</p>



<p>successfully multiplied signed integers and since they&#8217;re signed we could multiply negative numbers</p>



<p>if we wanted to i&#8217;m not going to here but you can now the next thing let&#8217;s try is let&#8217;s multiply</p>



<p>stuff sitting in global memory okay so i&#8217;m just going to copy this um where the heck is it</p>



<p>at the top we made two global integers we said integer a is equal to 233 and then 256</p>



<p>those were the same numbers that we just multiplied so we should probably get the same result</p>



<p>if we&#8217;re lucky so i&#8217;m saying i&#8217;m going to move both of these into registers so i&#8217;m going to move</p>



<p>a into r14 and i&#8217;m going to move b into r15 just to prove to you that we can and then</p>



<p>instruction we did before the result is going to go into r14 so let&#8217;s see i&#8217;m gonna print the</p>



<p>prefix real fast here same kind of concept that we talked about before there&#8217;s just going to be</p>



<p>a prefix before the result and then i&#8217;m actually going to print the result with this line right</p>



<p>here or these lines i&#8217;m just going to print r14 which is holding the result at this point</p>



<p>and hey we can trust that R14 wasn&#8217;t killed by the system call because the</p>



<p>system call respects the ABI and then I&#8217;m gonna print my suffix right here and</p>



<p>then a CRLF and that&#8217;s basically the idea let&#8217;s just double check here that</p>



<p>we get the same result twice make run notice how it prints the same result</p>



<p>twice once with globals once with immediates so if you were wondering</p>



<p>before this video how to multiply immediates or how to multiply globals</p>



<p>well there you go just put them into registers first and then call I&#8217;m all</p>



<p>pretty fast let&#8217;s just do one other thing for fun I&#8217;m going to let&#8217;s see add</p>



<p>one number to our 14 so to the result of the multiplication and then I&#8217;m going to</p>



<p>add five to it just to prove to you that we can increase an integer by one and we</p>



<p>we print it before we do the prefix extra stuff just for fun so here I&#8217;m gonna increase r14 and</p>



<p>I&#8217;m gonna say that it is a q word I guess that&#8217;s implied already because r14 is considered a 64-bit</p>



<p>register but if we wanted to increase I don&#8217;t know just for the sake of argument if we wanted</p>



<p>to like increase this right here let me just show you real fast how we do it we would say increase</p>



<p>would say increase q word and then name the integer in global memory so in global memory</p>



<p>the system doesn&#8217;t really know by default if it&#8217;s a one byte integer a two byte integer or four or</p>



<p>eight so you just have to specify the data size so it knows which integers to look at when it&#8217;s</p>



<p>considering what the original value is and how to overflow and when to overflow but you know just</p>



<p>for fun I&#8217;m putting that in here so it&#8217;s going to increase the result by one and then it&#8217;s going to</p>



<p>and it&#8217;s going to do that using the addition instruction.</p>



<p>So we&#8217;re going to add R14 with 5.</p>



<p>We can put an immediate there,</p>



<p>and the result is going to be stored in R14.</p>



<p>So basically R14 is equal to R14 plus 5.</p>



<p>And so overall, when we add those two things in there,</p>



<p>the second result should now be about 6 higher than the first result.</p>



<p>So if you kind of look at this right here,</p>



<p>we have 648, and then we have 644,</p>



<p>which is 6 numbers higher than the original result.</p>



<p>than the original result. So these are the basics of integer arithmetic with</p>



<p>signed multiplication and addition. I think that&#8217;s all I really wanted to show</p>



<p>you. Yeah, okay. So I hope you learned a little bit of stuff from this video. I</p>



<p>hope you had a little bit of fun. Come back, I&#8217;ll see you in the next video and</p>



<p>happy coding! Hey everybody! Thanks for watching this video again from the</p>



<p>appreciate it. I do hope you did learn something and have some fun. If you could do me a please,</p>



<p>a small little favor, could you please subscribe and follow this channel or these videos or</p>



<p>whatever it is you do on the current social media website that you&#8217;re looking at right now.</p>



<p>It would really mean the world to me and it&#8217;ll help make more videos and grow this community.</p>



<p>So we&#8217;ll be able to do more videos, longer videos, better videos, or just I&#8217;ll be able to keep making</p>



<p>kindness and uh and subscribe you know sometimes i&#8217;m sleeping in the middle of the night and i just</p>



<p>wake up because i know somebody subscribed or followed it just wakes me up and i get filled</p>



<p>with joy that&#8217;s exactly what happens every single time so you could do it as a nice favor to me or</p>



<p>you could you could troll me if you want to just wake me up in the middle of the night just subscribe</p>



<p>and then i&#8217;ll i&#8217;ll just wake up i promise that&#8217;s what will happen also uh if you look at the middle</p>



<p>of the screen right now you should see a qr code which you can scan in order to go to the website</p>



<p>which I think is also named somewhere at the bottom of this video.</p>



<p>And it&#8217;ll take you to my main website where you can just kind of like see</p>



<p>all the videos I published and the services and tutorials and things that I offer</p>



<p>and all that good stuff.</p>



<p>And if you have a suggestion for clarifications or errata or just future videos that you want to see,</p>



<p>please leave a comment.</p>



<p>Or if you just want to say, hey, what&#8217;s up? What&#8217;s going on?</p>



<p>You know, just send me a comment, whatever.</p>



<p>I also wake up for those in the middle of the night.</p>



<p>middle of the night I get I wake up in a cold sweat and I&#8217;m like it would really it really</p>



<p>mean the world to me I would really appreciate it so again thank you so much for watching this video</p>



<p>and um enjoy the cool music as as I fade into the darkness which is coming for us all</p>



<p>Thank you.</p>
<p>The post <a href="https://www.NeuralLantern.com/x86-64-assembly-signed-integer-multiplication-and-addition-with-imul-add-yasm-on-ubuntu-linux/">x86-64 Assembly: Signed Integer Multiplication and Addition with IMUL &amp; ADD (YASM on Ubuntu Linux)</a> appeared first on <a href="https://www.NeuralLantern.com">NeuralLantern.com</a>.</p>
]]></content:encoded>
					
					<wfw:commentRss>https://www.NeuralLantern.com/x86-64-assembly-signed-integer-multiplication-and-addition-with-imul-add-yasm-on-ubuntu-linux/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
