Update Yasm to 1.2.0 (Yasm Part 1/3)

third_party/yasm/patched-yasm/libyasm/mergesort.c

 /*
  * mergesort() implementation for systems that don't have it.
  *
  * Copyright (c) 1992, 1993
  *      The Regents of the University of California.  All rights reserved.
  *
  * This code is derived from software contributed to Berkeley by
  * Peter McIlroy.
  *
  * Redistribution and use in source and binary forms, with or without
@@ skipping 14 matching lines @@
  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  * SUCH DAMAGE.
  */
 #include "util.h"
-/*@unused@*/ RCSID("$Id: mergesort.c 1893 2007-07-14 03:11:32Z peter $");
 
 #if defined(LIBC_SCCS) && !defined(lint)
 static char sccsid[] = "@(#)merge.c     8.2 (Berkeley) 2/14/94";
 #endif /* LIBC_SCCS and not lint */
 
 #ifdef HAVE_MERGESORT
 #undef yasm__mergesort
 #endif
 
 #ifndef HAVE_MERGESORT
@@ skipping 307 matching lines @@
 
         for (ai = a+size; --n >= 1; ai += size)
                 for (t = ai; t > a; t -= size) {
                         u = t - size;
                         if (cmp(u, t) <= 0)
                                 break;
                         swap(u, t);
                 }
 }
 #endif  /*HAVE_MERGESORT*/