<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>rpm: rpmdb/merge.c Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.4.7 -->
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="modules.html"><span>Modules</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li id="current"><a href="files.html"><span>Files</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
</ul></div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul></div>
<h1>rpmdb/merge.c</h1><a href="merge_8c.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*@-bounds -mustmod -sizeoftype @*/</span>
<a name="l00002"></a>00002 <span class="preprocessor">#ifndef __APPLE__</span>
<a name="l00003"></a>00003 <span class="preprocessor"></span><span class="comment">/*-</span>
<a name="l00004"></a>00004 <span class="comment"> * Copyright (c) 1992, 1993</span>
<a name="l00005"></a>00005 <span class="comment"> * The Regents of the University of California. All rights reserved.</span>
<a name="l00006"></a>00006 <span class="comment"> *</span>
<a name="l00007"></a>00007 <span class="comment"> * This code is derived from software contributed to Berkeley by</span>
<a name="l00008"></a>00008 <span class="comment"> * Peter McIlroy.</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span>
<a name="l00011"></a>00011 <span class="comment"> * modification, are permitted provided that the following conditions</span>
<a name="l00012"></a>00012 <span class="comment"> * are met:</span>
<a name="l00013"></a>00013 <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span>
<a name="l00014"></a>00014 <span class="comment"> * notice, this list of conditions and the following disclaimer.</span>
<a name="l00015"></a>00015 <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span>
<a name="l00016"></a>00016 <span class="comment"> * notice, this list of conditions and the following disclaimer in the</span>
<a name="l00017"></a>00017 <span class="comment"> * documentation and/or other materials provided with the distribution.</span>
<a name="l00018"></a>00018 <span class="comment"> * 3. All advertising materials mentioning features or use of this software</span>
<a name="l00019"></a>00019 <span class="comment"> * must display the following acknowledgement:</span>
<a name="l00020"></a>00020 <span class="comment"> * This product includes software developed by the University of</span>
<a name="l00021"></a>00021 <span class="comment"> * California, Berkeley and its contributors.</span>
<a name="l00022"></a>00022 <span class="comment"> * 4. Neither the name of the University nor the names of its contributors</span>
<a name="l00023"></a>00023 <span class="comment"> * may be used to endorse or promote products derived from this software</span>
<a name="l00024"></a>00024 <span class="comment"> * without specific prior written permission.</span>
<a name="l00025"></a>00025 <span class="comment"> *</span>
<a name="l00026"></a>00026 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND</span>
<a name="l00027"></a>00027 <span class="comment"> * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE</span>
<a name="l00028"></a>00028 <span class="comment"> * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE</span>
<a name="l00029"></a>00029 <span class="comment"> * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE</span>
<a name="l00030"></a>00030 <span class="comment"> * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL</span>
<a name="l00031"></a>00031 <span class="comment"> * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS</span>
<a name="l00032"></a>00032 <span class="comment"> * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)</span>
<a name="l00033"></a>00033 <span class="comment"> * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT</span>
<a name="l00034"></a>00034 <span class="comment"> * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY</span>
<a name="l00035"></a>00035 <span class="comment"> * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF</span>
<a name="l00036"></a>00036 <span class="comment"> * SUCH DAMAGE.</span>
<a name="l00037"></a>00037 <span class="comment"> */</span>
<a name="l00038"></a>00038
<a name="l00039"></a>00039 <span class="preprocessor">#if defined(LIBC_SCCS) && !defined(lint)</span>
<a name="l00040"></a>00040 <span class="preprocessor"></span><span class="keyword">static</span> <span class="keywordtype">char</span> sccsid[] = <span class="stringliteral">"@(#)merge.c 8.2 (Berkeley) 2/14/94"</span>;
<a name="l00041"></a>00041 <span class="preprocessor">#endif </span><span class="comment">/* LIBC_SCCS and not lint */</span>
<a name="l00042"></a>00042
<a name="l00043"></a>00043 <span class="comment">/*</span>
<a name="l00044"></a>00044 <span class="comment"> * Hybrid exponential search/linear search merge sort with hybrid</span>
<a name="l00045"></a>00045 <span class="comment"> * natural/pairwise first pass. Requires about .3% more comparisons</span>
<a name="l00046"></a>00046 <span class="comment"> * for random data than LSMS with pairwise first pass alone.</span>
<a name="l00047"></a>00047 <span class="comment"> * It works for objects as small as two bytes.</span>
<a name="l00048"></a>00048 <span class="comment"> */</span>
<a name="l00049"></a>00049
<a name="l00050"></a><a class="code" href="merge_8c.html#008f768518a29d3ec0dd62981e3c5f4c">00050</a> <span class="preprocessor">#define NATURAL</span>
<a name="l00051"></a><a class="code" href="merge_8c.html#4679d8ea8690999a6c6c7c0cb245c879">00051</a> <span class="preprocessor"></span><span class="preprocessor">#define THRESHOLD 16 </span><span class="comment">/* Best choice for natural merge cut-off. */</span>
<a name="l00052"></a>00052
<a name="l00053"></a>00053 <span class="comment">/* #define NATURAL to get hybrid natural merge.</span>
<a name="l00054"></a>00054 <span class="comment"> * (The default is pairwise merging.)</span>
<a name="l00055"></a>00055 <span class="comment"> */</span>
<a name="l00056"></a>00056
<a name="l00057"></a>00057 <span class="preprocessor">#include "<a class="code" href="system_8h.html">system.h</a>"</span>
<a name="l00058"></a>00058
<a name="l00059"></a><a class="code" href="merge_8c.html#311b7c01b830d898020683c59ece61c4">00059</a> <span class="preprocessor">#define ISIZE sizeof(int)</span>
<a name="l00060"></a><a class="code" href="merge_8c.html#69beff7cd62d1ee993c21243761488ca">00060</a> <span class="preprocessor"></span><span class="preprocessor">#define PSIZE sizeof(unsigned char *)</span>
<a name="l00061"></a><a class="code" href="merge_8c.html#051a432779099bda80967c93826ae722">00061</a> <span class="preprocessor"></span><span class="preprocessor">#define ICOPY_LIST(src, dst, last) \</span>
<a name="l00062"></a>00062 <span class="preprocessor"> do \</span>
<a name="l00063"></a>00063 <span class="preprocessor"> *(int*)dst = *(int*)src, src += ISIZE, dst += ISIZE; \</span>
<a name="l00064"></a>00064 <span class="preprocessor"> while(src < last)</span>
<a name="l00065"></a><a class="code" href="merge_8c.html#aca9f4885070ac1e9a163486c14fd8f9">00065</a> <span class="preprocessor"></span><span class="preprocessor">#define ICOPY_ELT(src, dst, i) \</span>
<a name="l00066"></a>00066 <span class="preprocessor"> do \</span>
<a name="l00067"></a>00067 <span class="preprocessor"> *(int*) dst = *(int*) src, src += ISIZE, dst += ISIZE; \</span>
<a name="l00068"></a>00068 <span class="preprocessor"> while (i -= ISIZE)</span>
<a name="l00069"></a>00069 <span class="preprocessor"></span>
<a name="l00070"></a><a class="code" href="merge_8c.html#eec7783cc7cadd1f0685befbeaed6417">00070</a> <span class="preprocessor">#define CCOPY_LIST(src, dst, last) \</span>
<a name="l00071"></a>00071 <span class="preprocessor"> do \</span>
<a name="l00072"></a>00072 <span class="preprocessor"> *dst++ = *src++; \</span>
<a name="l00073"></a>00073 <span class="preprocessor"> while (src < last)</span>
<a name="l00074"></a><a class="code" href="merge_8c.html#fbfba72834d31331a1681825083e73d6">00074</a> <span class="preprocessor"></span><span class="preprocessor">#define CCOPY_ELT(src, dst, i) \</span>
<a name="l00075"></a>00075 <span class="preprocessor"> do \</span>
<a name="l00076"></a>00076 <span class="preprocessor"> *dst++ = *src++; \</span>
<a name="l00077"></a>00077 <span class="preprocessor"> while (i -= 1)</span>
<a name="l00078"></a>00078 <span class="preprocessor"></span>
<a name="l00079"></a>00079 <span class="comment">/*</span>
<a name="l00080"></a>00080 <span class="comment"> * Find the next possible pointer head. (Trickery for forcing an array</span>
<a name="l00081"></a>00081 <span class="comment"> * to do double duty as a linked list when objects do not align with word</span>
<a name="l00082"></a>00082 <span class="comment"> * boundaries.</span>
<a name="l00083"></a>00083 <span class="comment"> */</span>
<a name="l00084"></a>00084 <span class="comment">/* Assumption: PSIZE is a power of 2. */</span>
<a name="l00085"></a><a class="code" href="merge_8c.html#09f20f7fa7a47004956e714043a1ab91">00085</a> <span class="preprocessor">#define EVAL(p) (unsigned char **) \</span>
<a name="l00086"></a>00086 <span class="preprocessor"> ((unsigned char *)0 + \</span>
<a name="l00087"></a>00087 <span class="preprocessor"> (((unsigned char *)p + PSIZE - 1 - (unsigned char *) 0) & ~(PSIZE - 1)))</span>
<a name="l00088"></a>00088 <span class="preprocessor"></span>
<a name="l00089"></a><a class="code" href="merge_8c.html#3ca5ecd34b04d6a243c054ac3a57f68d">00089</a> <span class="preprocessor">#define swap(a, b) { \</span>
<a name="l00090"></a>00090 <span class="preprocessor"> s = b; \</span>
<a name="l00091"></a>00091 <span class="preprocessor"> i = size; \</span>
<a name="l00092"></a>00092 <span class="preprocessor"> do { \</span>
<a name="l00093"></a>00093 <span class="preprocessor"> tmp = *a; *a++ = *s; *s++ = tmp; \</span>
<a name="l00094"></a>00094 <span class="preprocessor"> } while (--i); \</span>
<a name="l00095"></a>00095 <span class="preprocessor"> a -= size; \</span>
<a name="l00096"></a>00096 <span class="preprocessor"> }</span>
<a name="l00097"></a><a class="code" href="merge_8c.html#418487752a9b9a1497617db75cb34920">00097</a> <span class="preprocessor"></span><span class="preprocessor">#define reverse(bot, top) { \</span>
<a name="l00098"></a>00098 <span class="preprocessor"> s = top; \</span>
<a name="l00099"></a>00099 <span class="preprocessor"> do { \</span>
<a name="l00100"></a>00100 <span class="preprocessor"> i = size; \</span>
<a name="l00101"></a>00101 <span class="preprocessor"> do { \</span>
<a name="l00102"></a>00102 <span class="preprocessor"> tmp = *bot; *bot++ = *s; *s++ = tmp; \</span>
<a name="l00103"></a>00103 <span class="preprocessor"> } while (--i); \</span>
<a name="l00104"></a>00104 <span class="preprocessor"> s -= size2; \</span>
<a name="l00105"></a>00105 <span class="preprocessor"> } while(bot < s); \</span>
<a name="l00106"></a>00106 <span class="preprocessor">}</span>
<a name="l00107"></a>00107 <span class="preprocessor"></span>
<a name="l00108"></a>00108 <span class="comment">/*</span>
<a name="l00109"></a>00109 <span class="comment"> * This is to avoid out-of-bounds addresses in sorting the</span>
<a name="l00110"></a>00110 <span class="comment"> * last 4 elements.</span>
<a name="l00111"></a>00111 <span class="comment"> */</span>
<a name="l00112"></a>00112 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00113"></a><a class="code" href="merge_8c.html#b7718abfd6a277cf9f7018f395f0d9b7">00113</a> <a class="code" href="merge_8c.html#b7718abfd6a277cf9f7018f395f0d9b7">insertionsort</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *a, size_t n, size_t size,
<a name="l00114"></a>00114 <span class="keywordtype">int</span> (*cmp) (<span class="keyword">const</span> <span class="keywordtype">void</span> *, <span class="keyword">const</span> <span class="keywordtype">void</span> *))
<a name="l00115"></a>00115 <span class="comment">/*@modifies *a @*/</span>
<a name="l00116"></a>00116 {
<a name="l00117"></a>00117 u_char *ai, *s, *t, *u, tmp;
<a name="l00118"></a>00118 <span class="keywordtype">int</span> i;
<a name="l00119"></a>00119
<a name="l00120"></a>00120 <span class="keywordflow">for</span> (ai = a+size; --n >= 1; ai += size)
<a name="l00121"></a>00121 <span class="keywordflow">for</span> (t = ai; t > a; t -= size) {
<a name="l00122"></a>00122 u = t - size;
<a name="l00123"></a>00123 <span class="keywordflow">if</span> (cmp(u, t) <= 0)
<a name="l00124"></a>00124 <span class="comment">/*@innerbreak@*/</span> <span class="keywordflow">break</span>;
<a name="l00125"></a>00125 <a class="code" href="merge_8c.html#3ca5ecd34b04d6a243c054ac3a57f68d">swap</a>(u, t);
<a name="l00126"></a>00126 }
<a name="l00127"></a>00127 }
<a name="l00128"></a>00128
<a name="l00129"></a>00129 <span class="comment">/*</span>
<a name="l00130"></a>00130 <span class="comment"> * Optional hybrid natural/pairwise first pass. Eats up list1 in runs of</span>
<a name="l00131"></a>00131 <span class="comment"> * increasing order, list2 in a corresponding linked list. Checks for runs</span>
<a name="l00132"></a>00132 <span class="comment"> * when THRESHOLD/2 pairs compare with same sense. (Only used when NATURAL</span>
<a name="l00133"></a>00133 <span class="comment"> * is defined. Otherwise simple pairwise merging is used.)</span>
<a name="l00134"></a>00134 <span class="comment"> */</span>
<a name="l00135"></a>00135 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00136"></a><a class="code" href="merge_8c.html#7751dc5dca053b7c9f76ac43f415de4a">00136</a> <a class="code" href="merge_8c.html#7751dc5dca053b7c9f76ac43f415de4a">setup</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *list1, <span class="comment">/*@out@*/</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *list2,
<a name="l00137"></a>00137 size_t n, size_t size, <span class="keywordtype">int</span> (*cmp) (<span class="keyword">const</span> <span class="keywordtype">void</span> *, <span class="keyword">const</span> <span class="keywordtype">void</span> *))
<a name="l00138"></a>00138 <span class="comment">/*@modifies list1, list2 @*/</span>
<a name="l00139"></a>00139 {
<a name="l00140"></a>00140 <span class="keywordtype">int</span> i, length, size2, tmp, sense;
<a name="l00141"></a>00141 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *f1, *f2, *s, *l2, *last, *p2;
<a name="l00142"></a>00142
<a name="l00143"></a>00143 size2 = size*2;
<a name="l00144"></a>00144 <span class="keywordflow">if</span> (n <= 5) {
<a name="l00145"></a>00145 <a class="code" href="merge_8c.html#b7718abfd6a277cf9f7018f395f0d9b7">insertionsort</a>(list1, n, size, cmp);
<a name="l00146"></a>00146 *<a class="code" href="merge_8c.html#09f20f7fa7a47004956e714043a1ab91">EVAL</a>(list2) = (<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>*) list2 + n*size;
<a name="l00147"></a>00147 <span class="keywordflow">return</span>;
<a name="l00148"></a>00148 }
<a name="l00149"></a>00149 <span class="comment">/*</span>
<a name="l00150"></a>00150 <span class="comment"> * Avoid running pointers out of bounds; limit n to evens</span>
<a name="l00151"></a>00151 <span class="comment"> * for simplicity.</span>
<a name="l00152"></a>00152 <span class="comment"> */</span>
<a name="l00153"></a>00153 i = 4 + (n & 1);
<a name="l00154"></a>00154 <a class="code" href="merge_8c.html#b7718abfd6a277cf9f7018f395f0d9b7">insertionsort</a>(list1 + (n - i) * size, i, size, cmp);
<a name="l00155"></a>00155 last = list1 + size * (n - i);
<a name="l00156"></a>00156 *<a class="code" href="merge_8c.html#09f20f7fa7a47004956e714043a1ab91">EVAL</a>(list2 + (last - list1)) = list2 + n * size;
<a name="l00157"></a>00157
<a name="l00158"></a>00158 <span class="preprocessor">#ifdef NATURAL</span>
<a name="l00159"></a>00159 <span class="preprocessor"></span> p2 = list2;
<a name="l00160"></a>00160 f1 = list1;
<a name="l00161"></a>00161 sense = (cmp(f1, f1 + size) > 0);
<a name="l00162"></a>00162 <span class="keywordflow">for</span> (; f1 < last; sense = !sense) {
<a name="l00163"></a>00163 length = 2;
<a name="l00164"></a>00164 <span class="comment">/* Find pairs with same sense. */</span>
<a name="l00165"></a>00165 <span class="keywordflow">for</span> (f2 = f1 + size2; f2 < last; f2 += size2) {
<a name="l00166"></a>00166 <span class="keywordflow">if</span> ((cmp(f2, f2+ size) > 0) != sense)
<a name="l00167"></a>00167 <span class="comment">/*@innerbreak@*/</span> <span class="keywordflow">break</span>;
<a name="l00168"></a>00168 length += 2;
<a name="l00169"></a>00169 }
<a name="l00170"></a>00170 <span class="keywordflow">if</span> (length < <a class="code" href="merge_8c.html#4679d8ea8690999a6c6c7c0cb245c879">THRESHOLD</a>) { <span class="comment">/* Pairwise merge */</span>
<a name="l00171"></a>00171 <span class="keywordflow">do</span> {
<a name="l00172"></a>00172 p2 = *<a class="code" href="merge_8c.html#09f20f7fa7a47004956e714043a1ab91">EVAL</a>(p2) = f1 + size2 - list1 + list2;
<a name="l00173"></a>00173 <span class="keywordflow">if</span> (sense > 0)
<a name="l00174"></a>00174 <a class="code" href="merge_8c.html#3ca5ecd34b04d6a243c054ac3a57f68d">swap</a> (f1, f1 + size);
<a name="l00175"></a>00175 } <span class="keywordflow">while</span> ((f1 += size2) < f2);
<a name="l00176"></a>00176 } <span class="keywordflow">else</span> { <span class="comment">/* Natural merge */</span>
<a name="l00177"></a>00177 l2 = f2;
<a name="l00178"></a>00178 <span class="keywordflow">for</span> (f2 = f1 + size2; f2 < l2; f2 += size2) {
<a name="l00179"></a>00179 <span class="keywordflow">if</span> ((cmp(f2-size, f2) > 0) != sense) {
<a name="l00180"></a>00180 p2 = *<a class="code" href="merge_8c.html#09f20f7fa7a47004956e714043a1ab91">EVAL</a>(p2) = f2 - list1 + list2;
<a name="l00181"></a>00181 <span class="keywordflow">if</span> (sense > 0)
<a name="l00182"></a>00182 <a class="code" href="merge_8c.html#418487752a9b9a1497617db75cb34920">reverse</a>(f1, f2-size);
<a name="l00183"></a>00183 f1 = f2;
<a name="l00184"></a>00184 }
<a name="l00185"></a>00185 }
<a name="l00186"></a>00186 <span class="keywordflow">if</span> (sense > 0)
<a name="l00187"></a>00187 <a class="code" href="merge_8c.html#418487752a9b9a1497617db75cb34920">reverse</a> (f1, f2-size);
<a name="l00188"></a>00188 f1 = f2;
<a name="l00189"></a>00189 <span class="keywordflow">if</span> (f2 < last || cmp(f2 - size, f2) > 0)
<a name="l00190"></a>00190 p2 = *<a class="code" href="merge_8c.html#09f20f7fa7a47004956e714043a1ab91">EVAL</a>(p2) = f2 - list1 + list2;
<a name="l00191"></a>00191 <span class="keywordflow">else</span>
<a name="l00192"></a>00192 p2 = *<a class="code" href="merge_8c.html#09f20f7fa7a47004956e714043a1ab91">EVAL</a>(p2) = list2 + n*size;
<a name="l00193"></a>00193 }
<a name="l00194"></a>00194 }
<a name="l00195"></a>00195 <span class="preprocessor">#else </span><span class="comment">/* pairwise merge only. */</span>
<a name="l00196"></a>00196 <span class="keywordflow">for</span> (f1 = list1, p2 = list2; f1 < last; f1 += size2) {
<a name="l00197"></a>00197 p2 = *<a class="code" href="merge_8c.html#09f20f7fa7a47004956e714043a1ab91">EVAL</a>(p2) = p2 + size2;
<a name="l00198"></a>00198 <span class="keywordflow">if</span> (cmp (f1, f1 + size) > 0)
<a name="l00199"></a>00199 <a class="code" href="merge_8c.html#3ca5ecd34b04d6a243c054ac3a57f68d">swap</a>(f1, f1 + size);
<a name="l00200"></a>00200 }
<a name="l00201"></a>00201 <span class="preprocessor">#endif </span><span class="comment">/* NATURAL */</span>
<a name="l00202"></a>00202 }
<a name="l00203"></a>00203
<a name="l00204"></a>00204 <span class="comment">/*</span>
<a name="l00205"></a>00205 <span class="comment"> * Arguments are as for qsort.</span>
<a name="l00206"></a>00206 <span class="comment"> */</span>
<a name="l00207"></a>00207 <span class="keywordtype">int</span>
<a name="l00208"></a><a class="code" href="rpmdb_8h.html#d5b80d228a80a7b24e0013b92005fd95">00208</a> <a class="code" href="merge_8c.html#d5b80d228a80a7b24e0013b92005fd95">mergesort</a>(<span class="keywordtype">void</span> *base, size_t nmemb, size_t size,
<a name="l00209"></a>00209 <span class="keywordtype">int</span> (*cmp) (<span class="keyword">const</span> <span class="keywordtype">void</span> *, <span class="keyword">const</span> <span class="keywordtype">void</span> *))
<a name="l00210"></a>00210 {
<a name="l00211"></a>00211 <span class="keyword">register</span> <span class="keywordtype">int</span> i, sense;
<a name="l00212"></a>00212 <span class="keywordtype">int</span> big, iflag;
<a name="l00213"></a>00213 <span class="keyword">register</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *f1, *f2, *t, *b, *q, *l1, *l2;
<a name="l00214"></a>00214 <span class="comment">/*@dependent@*/</span>
<a name="l00215"></a>00215 <span class="keyword">register</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *tp2;
<a name="l00216"></a>00216 <span class="comment">/*@owned@*/</span>
<a name="l00217"></a>00217 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *list2;
<a name="l00218"></a>00218 <span class="comment">/*@dependent@*/</span>
<a name="l00219"></a>00219 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *list1;
<a name="l00220"></a>00220 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *p2, *p, *last, **p1;
<a name="l00221"></a>00221
<a name="l00222"></a>00222 <span class="keywordflow">if</span> (size < <a class="code" href="merge_8c.html#69beff7cd62d1ee993c21243761488ca">PSIZE</a> / 2) { <span class="comment">/* Pointers must fit into 2 * size. */</span>
<a name="l00223"></a>00223 <a class="code" href="system_8h.html#d65a8842cc674e3ddf69355898c0ecbf">errno</a> = EINVAL;
<a name="l00224"></a>00224 <span class="keywordflow">return</span> (-1);
<a name="l00225"></a>00225 }
<a name="l00226"></a>00226
<a name="l00227"></a>00227 <span class="keywordflow">if</span> (nmemb == 0)
<a name="l00228"></a>00228 <span class="keywordflow">return</span> (0);
<a name="l00229"></a>00229
<a name="l00230"></a>00230 <span class="comment">/*</span>
<a name="l00231"></a>00231 <span class="comment"> * XXX</span>
<a name="l00232"></a>00232 <span class="comment"> * Stupid subtraction for the Cray.</span>
<a name="l00233"></a>00233 <span class="comment"> */</span>
<a name="l00234"></a>00234 iflag = 0;
<a name="l00235"></a>00235 <span class="keywordflow">if</span> (!(size % <a class="code" href="merge_8c.html#311b7c01b830d898020683c59ece61c4">ISIZE</a>) && !(((<span class="keywordtype">char</span> *)base - (<span class="keywordtype">char</span> *)0) % <a class="code" href="merge_8c.html#311b7c01b830d898020683c59ece61c4">ISIZE</a>))
<a name="l00236"></a>00236 iflag = 1;
<a name="l00237"></a>00237
<a name="l00238"></a>00238 <span class="keywordflow">if</span> ((list2 = malloc(nmemb * size + <a class="code" href="merge_8c.html#69beff7cd62d1ee993c21243761488ca">PSIZE</a>)) == NULL)
<a name="l00239"></a>00239 <span class="keywordflow">return</span> (-1);
<a name="l00240"></a>00240
<a name="l00241"></a>00241 list1 = base;
<a name="l00242"></a>00242 <a class="code" href="merge_8c.html#7751dc5dca053b7c9f76ac43f415de4a">setup</a>(list1, list2, nmemb, size, cmp);
<a name="l00243"></a>00243 last = list2 + nmemb * size;
<a name="l00244"></a>00244 i = big = 0;
<a name="l00245"></a>00245 <span class="comment">/*@-branchstate@*/</span>
<a name="l00246"></a>00246 <span class="keywordflow">while</span> (*<a class="code" href="merge_8c.html#09f20f7fa7a47004956e714043a1ab91">EVAL</a>(list2) != last) {
<a name="l00247"></a>00247 l2 = list1;
<a name="l00248"></a>00248 p1 = <a class="code" href="merge_8c.html#09f20f7fa7a47004956e714043a1ab91">EVAL</a>(list1);
<a name="l00249"></a>00249 <span class="keywordflow">for</span> (tp2 = p2 = list2; p2 != last; p1 = <a class="code" href="merge_8c.html#09f20f7fa7a47004956e714043a1ab91">EVAL</a>(l2)) {
<a name="l00250"></a>00250 p2 = *<a class="code" href="merge_8c.html#09f20f7fa7a47004956e714043a1ab91">EVAL</a>(p2);
<a name="l00251"></a>00251 f1 = l2;
<a name="l00252"></a>00252 f2 = l1 = list1 + (p2 - list2);
<a name="l00253"></a>00253 <span class="keywordflow">if</span> (p2 != last)
<a name="l00254"></a>00254 p2 = *<a class="code" href="merge_8c.html#09f20f7fa7a47004956e714043a1ab91">EVAL</a>(p2);
<a name="l00255"></a>00255 l2 = list1 + (p2 - list2);
<a name="l00256"></a>00256 <span class="keywordflow">while</span> (f1 < l1 && f2 < l2) {
<a name="l00257"></a>00257 <span class="keywordflow">if</span> ((*cmp)(f1, f2) <= 0) {
<a name="l00258"></a>00258 q = f2;
<a name="l00259"></a>00259 b = f1, t = l1;
<a name="l00260"></a>00260 sense = -1;
<a name="l00261"></a>00261 } <span class="keywordflow">else</span> {
<a name="l00262"></a>00262 q = f1;
<a name="l00263"></a>00263 b = f2, t = l2;
<a name="l00264"></a>00264 sense = 0;
<a name="l00265"></a>00265 }
<a name="l00266"></a>00266 <span class="keywordflow">if</span> (!big) { <span class="comment">/* here i = 0 */</span>
<a name="l00267"></a>00267 <span class="keywordflow">while</span> ((b += size) < t && cmp(q, b) >sense)
<a name="l00268"></a>00268 <span class="keywordflow">if</span> (++i == 6) {
<a name="l00269"></a>00269 big = 1;
<a name="l00270"></a>00270 <span class="keywordflow">goto</span> EXPONENTIAL;
<a name="l00271"></a>00271 }
<a name="l00272"></a>00272 } <span class="keywordflow">else</span> {
<a name="l00273"></a>00273 <span class="comment">/*@-shiftimplementation@*/</span>
<a name="l00274"></a>00274 EXPONENTIAL: <span class="keywordflow">for</span> (i = size; ; i <<= 1)
<a name="l00275"></a>00275 <span class="keywordflow">if</span> ((p = (b + i)) >= t) {
<a name="l00276"></a>00276 <span class="keywordflow">if</span> ((p = t - size) > b &&
<a name="l00277"></a>00277 (*cmp)(q, p) <= sense)
<a name="l00278"></a>00278 t = p;
<a name="l00279"></a>00279 <span class="keywordflow">else</span>
<a name="l00280"></a>00280 b = p;
<a name="l00281"></a>00281 <span class="comment">/*@innerbreak@*/</span> <span class="keywordflow">break</span>;
<a name="l00282"></a>00282 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*cmp)(q, p) <= sense) {
<a name="l00283"></a>00283 t = p;
<a name="l00284"></a>00284 <span class="keywordflow">if</span> (i == size)
<a name="l00285"></a>00285 big = 0;
<a name="l00286"></a>00286 <span class="keywordflow">goto</span> FASTCASE;
<a name="l00287"></a>00287 } <span class="keywordflow">else</span>
<a name="l00288"></a>00288 b = p;
<a name="l00289"></a>00289 <span class="comment">/*@-infloopsuncon@*/</span>
<a name="l00290"></a>00290 <span class="keywordflow">while</span> (t > b+size) {
<a name="l00291"></a>00291 i = (((t - b) / size) >> 1) * size;
<a name="l00292"></a>00292 <span class="keywordflow">if</span> ((*cmp)(q, p = b + i) <= sense)
<a name="l00293"></a>00293 t = p;
<a name="l00294"></a>00294 <span class="keywordflow">else</span>
<a name="l00295"></a>00295 b = p;
<a name="l00296"></a>00296 }
<a name="l00297"></a>00297 <span class="keywordflow">goto</span> COPY;
<a name="l00298"></a>00298 FASTCASE: <span class="keywordflow">while</span> (i > size)
<a name="l00299"></a>00299 <span class="keywordflow">if</span> ((*cmp)(q,
<a name="l00300"></a>00300 p = b + (i >>= 1)) <= sense)
<a name="l00301"></a>00301 t = p;
<a name="l00302"></a>00302 <span class="keywordflow">else</span>
<a name="l00303"></a>00303 b = p;
<a name="l00304"></a>00304 <span class="comment">/*@=infloopsuncon@*/</span>
<a name="l00305"></a>00305 <span class="comment">/*@=shiftimplementation@*/</span>
<a name="l00306"></a>00306 COPY: b = t;
<a name="l00307"></a>00307 }
<a name="l00308"></a>00308 i = size;
<a name="l00309"></a>00309 <span class="keywordflow">if</span> (q == f1) {
<a name="l00310"></a>00310 <span class="keywordflow">if</span> (iflag) {
<a name="l00311"></a>00311 <a class="code" href="merge_8c.html#051a432779099bda80967c93826ae722">ICOPY_LIST</a>(f2, tp2, b);
<a name="l00312"></a>00312 <a class="code" href="merge_8c.html#aca9f4885070ac1e9a163486c14fd8f9">ICOPY_ELT</a>(f1, tp2, i);
<a name="l00313"></a>00313 } <span class="keywordflow">else</span> {
<a name="l00314"></a>00314 <a class="code" href="merge_8c.html#eec7783cc7cadd1f0685befbeaed6417">CCOPY_LIST</a>(f2, tp2, b);
<a name="l00315"></a>00315 <a class="code" href="merge_8c.html#fbfba72834d31331a1681825083e73d6">CCOPY_ELT</a>(f1, tp2, i);
<a name="l00316"></a>00316 }
<a name="l00317"></a>00317 } <span class="keywordflow">else</span> {
<a name="l00318"></a>00318 <span class="keywordflow">if</span> (iflag) {
<a name="l00319"></a>00319 <a class="code" href="merge_8c.html#051a432779099bda80967c93826ae722">ICOPY_LIST</a>(f1, tp2, b);
<a name="l00320"></a>00320 <a class="code" href="merge_8c.html#aca9f4885070ac1e9a163486c14fd8f9">ICOPY_ELT</a>(f2, tp2, i);
<a name="l00321"></a>00321 } <span class="keywordflow">else</span> {
<a name="l00322"></a>00322 <a class="code" href="merge_8c.html#eec7783cc7cadd1f0685befbeaed6417">CCOPY_LIST</a>(f1, tp2, b);
<a name="l00323"></a>00323 <a class="code" href="merge_8c.html#fbfba72834d31331a1681825083e73d6">CCOPY_ELT</a>(f2, tp2, i);
<a name="l00324"></a>00324 }
<a name="l00325"></a>00325 }
<a name="l00326"></a>00326 }
<a name="l00327"></a>00327 <span class="keywordflow">if</span> (f2 < l2) {
<a name="l00328"></a>00328 <span class="keywordflow">if</span> (iflag)
<a name="l00329"></a>00329 <a class="code" href="merge_8c.html#051a432779099bda80967c93826ae722">ICOPY_LIST</a>(f2, tp2, l2);
<a name="l00330"></a>00330 <span class="keywordflow">else</span>
<a name="l00331"></a>00331 <a class="code" href="merge_8c.html#eec7783cc7cadd1f0685befbeaed6417">CCOPY_LIST</a>(f2, tp2, l2);
<a name="l00332"></a>00332 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (f1 < l1) {
<a name="l00333"></a>00333 <span class="keywordflow">if</span> (iflag)
<a name="l00334"></a>00334 <a class="code" href="merge_8c.html#051a432779099bda80967c93826ae722">ICOPY_LIST</a>(f1, tp2, l1);
<a name="l00335"></a>00335 <span class="keywordflow">else</span>
<a name="l00336"></a>00336 <a class="code" href="merge_8c.html#eec7783cc7cadd1f0685befbeaed6417">CCOPY_LIST</a>(f1, tp2, l1);
<a name="l00337"></a>00337 }
<a name="l00338"></a>00338 *p1 = l2;
<a name="l00339"></a>00339 }
<a name="l00340"></a>00340 <span class="comment">/*@-dependenttrans@*/</span>
<a name="l00341"></a>00341 tp2 = list1; <span class="comment">/* swap list1, list2 */</span>
<a name="l00342"></a>00342 list1 = list2;
<a name="l00343"></a>00343 list2 = tp2;
<a name="l00344"></a>00344 <span class="comment">/*@=dependenttrans@*/</span>
<a name="l00345"></a>00345 last = list2 + nmemb*size;
<a name="l00346"></a>00346 }
<a name="l00347"></a>00347 <span class="comment">/*@=branchstate@*/</span>
<a name="l00348"></a>00348 <span class="keywordflow">if</span> (base == list2) {
<a name="l00349"></a>00349 memmove(list2, list1, nmemb*size);
<a name="l00350"></a>00350 list2 = list1;
<a name="l00351"></a>00351 }
<a name="l00352"></a>00352 <span class="comment">/*@-usereleased@*/</span>
<a name="l00353"></a>00353 free(list2);
<a name="l00354"></a>00354 <span class="comment">/*@=usereleased@*/</span>
<a name="l00355"></a>00355 <span class="keywordflow">return</span> (0);
<a name="l00356"></a>00356 }
<a name="l00357"></a>00357 <span class="preprocessor">#else</span>
<a name="l00358"></a>00358 <span class="preprocessor"></span><span class="comment">/* mergesort is implemented in System on Mac OS X */</span>
<a name="l00359"></a>00359 <span class="preprocessor">#endif </span><span class="comment">/* __APPLE__ */</span>
<a name="l00360"></a>00360 <span class="comment">/*@=bounds =mustmod =sizeoftype @*/</span>
</pre></div><hr size="1"><address style="align: right;"><small>Generated on 1 Oct 2013 for rpm by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.7 </small></address>
</body>
</html>
distrib
>
CentOS
>
5
>
i386
>
media
>
os
>
by-pkgid
>
608068f228165b6e5a4f2c11fda54521
>
files
>
429
