Using the powers of mathematics to simplify multi-level comparisons

Date:April 13, 2005 / year-entry #92
Orig Link:
Comments:    15
Summary:What a boring title. Often you'll find yourself needing to perform a multi-level comparison. The most common example of this is performing a version check when there are major and minor version numbers involved. Bad version number checks are one of the most common sources of errors. If you're comparing version numbers, you can use...

What a boring title.

Often you'll find yourself needing to perform a multi-level comparison. The most common example of this is performing a version check when there are major and minor version numbers involved. Bad version number checks are one of the most common sources of errors.

If you're comparing version numbers, you can use the VerifyVersionInfo function to do the version check for you, assuming you don't need to run on operating systems prior to Windows 2000.

Instead of writing a multi-level comparison, you can pack the values into a single comparison. Consider:

inline unsigned __int64
  Value.LowPart = Low;
  Value.HighPart = High;
  return Value.QuadPart;

BOOL IsVersionAtLeast(DWORD Major, DWORD Minor,
                      DWORD MajorDesired, DWORD MinorDesired)
  return MakeUINT64(Minor, Major) >= MakeUINT64(MinorDesired, MajorDesired);

What happened here?

We took the two 32-bit values and combined them into a large 64-bit value, putting the most significant portion in the high-order part and the less significant portion in the lower-order part.

Then we sit back and let the power of mathematics do our work for us. If you remember the rules for comparisons from grade school, you'll realize that they exactly match the rules we want to apply to our multi-level comparison. Compare the major values; if different, then that's the result. Otherwise, compare the minor values.

If you still don't believe it, look at the generated code:

  00000 8b 44 24 04      mov     eax, DWORD PTR _Major$[esp-4]
  00004 3b 44 24 0c      cmp     eax, DWORD PTR _MajorDesired$[esp-4]
  00008 8b 4c 24 08      mov     ecx, DWORD PTR _Minor$[esp-4]
  0000c 8b 54 24 10      mov     edx, DWORD PTR _MinorDesired$[esp-4]
  00010 72 0b            jb      SHORT $L48307
  00012 77 04            ja      SHORT $L48317
  00014 3b ca            cmp     ecx, edx
  00016 72 05            jb      SHORT $L48307
  00018 33 c0            xor     eax, eax
  0001a 40               inc     eax
  0001b eb 02            jmp     SHORT $L48308
  0001d 33 c0            xor     eax, eax
  0001f c2 10 00         ret     16                     ; 00000010H

The code generated by the compiler is equivalent to

BOOL IsVersionAtLeastEquiv(DWORD Major, DWORD Minor,
                      DWORD MajorDesired, DWORD MinorDesired)
 if (Major < MajorDesired) return FALSE;
 if (Major > MajorDesired) return TRUE;
 if (Minor < MinorDesired) return FALSE;
 return TRUE;

In fact, if you had written the code the (error-prone) old-fashioned way, you would have gotten this:

BOOL IsVersionAtLeast2(DWORD Major, DWORD Minor,
                       DWORD MajorDesired, DWORD MinorDesired)
  return Major > MajorDesired ||
   (Major == MajorDesired && Minor >= MinorDesired);

  00000 55               push    ebp
  00001 8b ec            mov     ebp, esp
  00003 8b 45 08         mov     eax, DWORD PTR _Major$[ebp]
  00006 3b 45 10         cmp     eax, DWORD PTR _MajorDesired$[ebp]
  00009 77 0e            ja      SHORT $L48329
  0000b 75 08            jne     SHORT $L48328
  0000d 8b 45 0c         mov     eax, DWORD PTR _Minor$[ebp]
  00010 3b 45 14         cmp     eax, DWORD PTR _MinorDesired$[ebp]
  00013 73 04            jae     SHORT $L48329
  00015 33 c0            xor     eax, eax
  00017 eb 03            jmp     SHORT $L48330
  00019 33 c0            xor     eax, eax
  0001b 40               inc     eax
  0001c 5d               pop     ebp
  0001d c2 10 00         ret     16                     ; 00000010H

which is, as you can see, functionally identical to both previous versions.

You can also pack the values into smaller units, provided you know that there will be no overflow or truncation. For example, if you know that the Major and Minor values will never exceed 65535, you could have used the following:

BOOL SmallIsVersionAtLeast(WORD Major, WORD Minor,
                           WORD MajorDesired, WORD MinorDesired)
 return MAKELONG(Minor, Major) >= MAKELONG(MinorDesired, MajorDesired);

 00000 0f b7 44 24 0c   movzx   eax, WORD PTR _MajorDesired$[esp-4]
 00005 0f b7 4c 24 10   movzx   ecx, WORD PTR _MinorDesired$[esp-4]
 0000a 0f b7 54 24 08   movzx   edx, WORD PTR _Minor$[esp-4]
 0000f c1 e0 10         shl     eax, 16                        ; 00000010H
 00012 0b c1            or      eax, ecx
 00014 0f b7 4c 24 04   movzx   ecx, WORD PTR _Major$[esp-4]
 00019 c1 e1 10         shl     ecx, 16                        ; 00000010H
 0001c 0b ca            or      ecx, edx
 0001e 33 d2            xor     edx, edx
 00020 3b c8            cmp     ecx, eax
 00022 0f 9d c2         setge   dl
 00025 8b c2            mov     eax, edx
 00027 c2 10 00         ret     16                     ; 00000010H

And if you know that the versions will never exceed 255, then you can go even smaller:

BOOL TinyIsVersionAtLeast(BYTE Major, BYTE Minor,
                          BYTE MajorDesired, BYTE MinorDesired)
 return MAKEWORD(Minor, Major) >= MAKEWORD(MinorDesired, MajorDesired);

  00000 33 c0            xor     eax, eax
  00002 8a 64 24 0c      mov     ah, BYTE PTR _MajorDesired$[esp-4]
  00006 33 c9            xor     ecx, ecx
  00008 8a 6c 24 04      mov     ch, BYTE PTR _Major$[esp-4]
  0000c 8a 44 24 10      mov     al, BYTE PTR _MinorDesired$[esp-4]
  00010 8a 4c 24 08      mov     cl, BYTE PTR _Minor$[esp-4]
  00014 66 3b c8         cmp     cx, ax
  00017 1b c0            sbb     eax, eax
  00019 40               inc     eax
  0001a c2 10 00         ret     16                     ; 00000010H

Why would you ever need to go smaller if the original version works anyway? Because you might want to make a three-way or four-way comparison, and packing the values smaller allows you to squeeze more keys into the comparison.

BOOL IsVersionBuildAtLeast(
    WORD Major, WORD Minor, DWORD Build,
    WORD MajorDesired, WORD MinorDesired, DWORD BuildDesired)
 return MakeUINT64(Build, MAKELONG(Minor, Major)) >=
  MakeUINT64(Build, MAKELONG(MinorDesired, MajorDesired));

By packing the major version, minor version, and build number into a single 64-bit value, a single comparison operation will compare all three at once. Compare this to the complicated (and teetering-towards unreadable) chain of comparisons you would normally have to write:

  return Major > MajorDesired ||
   (Major == MajorDesired &&
    (Minor >= MinorDesired ||
     (Minor == MinorDesired && Build >= BuildDesired)));

Comments (15)
  1. Jonathan says:

    I think there’s a mistake in that last code block (example of the other way to do it). That block looks like if the major and minor match, the build match is ignored.

    This should have the desired result:

    return Major > MajorDesired ||

    (Major == MajorDesired &&

    (Minor > MinorDesired ||

    (Minor == MinorDesired && Build >= BuildDesired)));

    Of course, maybe you just did that to illustrate your point….

  2. Ken says:

    If you are in C++ land, you can do:

    return !std::lexicographical_compare(




    or simply:

    return !(version < desired);

    This assumes the version numbers are packaged up in a standard container, but lexicographical_compare can operate on raw arrays just as well as it can containers, it’s just a little wordy…

    return !std::lexicographical_compare(




  3. asdf says:

    MAKELONG is signed though, you either need another macro or decrease the range of the minor version to 32767.

  4. asdf says:

    Err major version, I’m really not a fan of the ordering of those parameters.

  5. It’s a neat trick, but hailing it as "Using the powers of mathematics!" just sounds waaay too corny.

  6. Diego says:

    I wanted to ask a question; I don’t know if you’ve answered to it already in your huge blog (it’s not a easy search): Why can’t a file be read when someone has opened it? (ie: typical buggy video codecs which don’t allow you to delete the video after you closed all the apps)

    I’m shoked that it doesn’t works that way, it’d make updates more easy – just overwrite the file, and restart the service like other OSes do. I guess there’s a reason for it but I never have found it, only you could answer such question! ;)

  7. Please use the suggestion box for off-topic questions. (Look at the dwShareMode parameter to CreateFile for the answer.)

  8. Ben Wilhelm says:

    My technique for doing the last code block:

    if( Major < MajorDesired ) return false;

    if( Major > MajorDesired ) return true;

    if( Minor < MinorDesired ) return false;

    if( Minor > MinorDesired ) return true;

    if( Build < BuildDesired ) return false;

    if( Build > BuildDesired ) return true;

    return true;

    Simple pattern, easy to see, easy to understand, trivially extendable to as many comparisons as you want.

  9. I believe this is what I suggested in your original post:

    To take this a step further… I required such a solution a long time ago for a video game. It required about 10 or 12 levels of such compares. I decided to use two floating point numbers. They started with the most significant factor. I iteratively went through all the remaining factors, from most significant to least. In the loop, I multiplied the floats by the current factor’s maximum possible value, and then added the value of the factor. The result was two floats that I could compare. As long as each factor never overflowed its known maximum value, it worked.

  10. Centaur says:

    With floats, you can also apply some kind of a monotonous function to fit any float into a finite range. For example, (arctan(x)/pi)+0.5 will map (-infinity, infinity) to (0, 1).

  11. Chris Becke says:

    Oh please dont use floats like that. Theyre lossy. Which means two things: First that two identical version numbers could – depending on the calculation – have slightly different, and thus unequal representations. Next, using a lossy datatype like a float means that your least significant components could drop right off the end, and you’d never know – until the check failed in some horrible way.

  12. Thomas Anderson says:

    is there anything special in this code?

  13. Combining two tricks into one big trick.

  14. Merle says:

    Ben Wilhelm: while your code doesn’t use astounding tricks or anything, I much prefer it. I was trying to decide how to better indent the "complicated
    (and teetering-towards unreadable) chain of comparisons" (which I think could be fixed with proper indentation), but your way is much simpler.

    And I would much rather debug yours. No integer-size issues, either…

  15. Ben Cooke says:

    Similarly, it’s much easier to compare dates if you represent them as year, month, day. How you encode the exact values is up to you, but most people seem to like the idea of using a string of the form YYYY-MM-DD, or an integer which looks like YYYYMMDD when in base 10. You can also pack the binary values into a 32-bit integer if you like that sort of thing.

Comments are closed.

*DISCLAIMER: I DO NOT OWN THIS CONTENT. If you are the owner and would like it removed, please contact me. The content herein is an archived reproduction of entries from Raymond Chen's "Old New Thing" Blog (most recent link is here). It may have slight formatting modifications for consistency and to improve readability.

WHY DID I DUPLICATE THIS CONTENT HERE? Let me first say this site has never had anything to sell and has never shown ads of any kind. I have nothing monetarily to gain by duplicating content here. Because I had made my own local copy of this content throughout the years, for ease of using tools like grep, I decided to put it online after I discovered some of the original content previously and publicly available, had disappeared approximately early to mid 2019. At the same time, I present the content in an easily accessible theme-agnostic way.

The information provided by Raymond's blog is, for all practical purposes, more authoritative on Windows Development than Microsoft's own MSDN documentation and should be considered supplemental reading to that documentation. The wealth of missing details provided by this blog that Microsoft could not or did not document about Windows over the years is vital enough, many would agree an online "backup" of these details is a necessary endeavor. Specifics include:

<-- Back to Old New Thing Archive Index