<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>DSDP: src/vecmat/sdpsymb.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">DSDP</div>
</td>
</tr>
</tbody>
</table>
</div>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</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 class="current"><a href="files.html"><span>Files</span></a></li>
<li><a href="dirs.html"><span>Directories</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_23046874d7fed141927c769a66d8e3a5.html">src</a> </li>
<li class="navelem"><a class="el" href="dir_9706e2f7b84d8f85001c7784fc3e51fe.html">vecmat</a> </li>
</ul>
</div>
</div>
<div class="header">
<div class="headertitle">
<div class="title">sdpsymb.c</div> </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="preprocessor">#include "numchol.h"</span>
<a name="l00002"></a>00002
<a name="l00003"></a>00003 <span class="keywordtype">int</span> IptAlloc(<span class="keywordtype">int</span> m,
<a name="l00004"></a>00004 <span class="keywordtype">int</span> n,
<a name="l00005"></a>00005 <span class="keywordtype">int</span> *ipt[],
<a name="l00006"></a>00006 <span class="keywordtype">char</span> *info)
<a name="l00007"></a>00007 {
<a name="l00008"></a>00008 <span class="keywordtype">int</span> i;
<a name="l00009"></a>00009
<a name="l00010"></a>00010 <span class="keywordflow">if</span> (n) {
<a name="l00011"></a>00011 <span class="keywordflow">for</span> (i=0; i<m; i++) {
<a name="l00012"></a>00012 ipt[i]=(<span class="keywordtype">int</span>*)calloc(n,<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));
<a name="l00013"></a>00013 <span class="keywordflow">if</span> (!ipt[i]){
<a name="l00014"></a>00014 ExitProc(OutOfSpc,info);
<a name="l00015"></a>00015 <span class="keywordflow">return</span> 1;
<a name="l00016"></a>00016 }
<a name="l00017"></a>00017 }
<a name="l00018"></a>00018 }
<a name="l00019"></a>00019 <span class="keywordflow">return</span> 0;
<a name="l00020"></a>00020 } <span class="comment">/* AllocIptr */</span>
<a name="l00021"></a>00021
<a name="l00022"></a>00022 <span class="keywordtype">void</span> IptFree(<span class="keywordtype">int</span> m,
<a name="l00023"></a>00023 <span class="keywordtype">int</span> *ipt[])
<a name="l00024"></a>00024 {
<a name="l00025"></a>00025 <span class="keywordtype">int</span> i;
<a name="l00026"></a>00026
<a name="l00027"></a>00027 <span class="keywordflow">for</span> (i=0; i<m; i++)
<a name="l00028"></a>00028 iFree(&ipt[i]);
<a name="l00029"></a>00029 } <span class="comment">/* IptFree */</span>
<a name="l00030"></a>00030
<a name="l00031"></a>00031 <span class="keywordtype">int</span> LocIntPos(<span class="keywordtype">int</span> n,
<a name="l00032"></a>00032 <span class="keywordtype">int</span> i,
<a name="l00033"></a>00033 <span class="keywordtype">int</span> *v)
<a name="l00034"></a>00034 {
<a name="l00035"></a>00035 <span class="keywordtype">int</span> j;
<a name="l00036"></a>00036
<a name="l00037"></a>00037 <span class="keywordflow">for</span>(j=0; j<n && i!=v[j]; ++j);
<a name="l00038"></a>00038 <span class="keywordflow">return</span> (j);
<a name="l00039"></a>00039 } <span class="comment">/* LocIntPos */</span>
<a name="l00040"></a>00040
<a name="l00041"></a>00041 <span class="keyword">static</span> <span class="keywordtype">void</span> InsertDplRow(<span class="keywordtype">int</span> i,
<a name="l00042"></a>00042 <span class="keywordtype">int</span> ifir,
<a name="l00043"></a>00043 <span class="keywordtype">int</span> *ifirst,
<a name="l00044"></a>00044 <span class="keywordtype">int</span> *ilink)
<a name="l00045"></a>00045 {
<a name="l00046"></a>00046 <span class="keywordtype">int</span> temp;
<a name="l00047"></a>00047
<a name="l00048"></a>00048 temp=ifirst[ifir];
<a name="l00049"></a>00049 ifirst[ifir]=i;
<a name="l00050"></a>00050 ilink[i]=temp;
<a name="l00051"></a>00051 } <span class="comment">/* InsertDplRow */</span>
<a name="l00052"></a>00052
<a name="l00053"></a>00053 <span class="keywordtype">void</span> PermTransSym(<span class="keywordtype">int</span> nrow,
<a name="l00054"></a>00054 <span class="keywordtype">int</span> *fir,
<a name="l00055"></a>00055 <span class="keywordtype">int</span> *nnz,
<a name="l00056"></a>00056 <span class="keywordtype">int</span> *sub,
<a name="l00057"></a>00057 <span class="keywordtype">int</span> *p,
<a name="l00058"></a>00058 <span class="keywordtype">int</span> rowwise,
<a name="l00059"></a>00059 <span class="keywordtype">int</span> *firt,
<a name="l00060"></a>00060 <span class="keywordtype">int</span> *nnzt,
<a name="l00061"></a>00061 <span class="keywordtype">int</span> *subt)
<a name="l00062"></a>00062 {
<a name="l00063"></a>00063 <span class="keywordtype">int</span> i,j,s,t,stopt;
<a name="l00064"></a>00064
<a name="l00065"></a>00065 iZero(nrow,nnzt,NULL);
<a name="l00066"></a>00066
<a name="l00067"></a>00067 <span class="keywordflow">if</span> (rowwise) {
<a name="l00068"></a>00068 <span class="keywordflow">if</span> (p) {
<a name="l00069"></a>00069 <span class="keywordflow">for</span>(s=0; s<nrow; ++s) {
<a name="l00070"></a>00070 j =p[s];
<a name="l00071"></a>00071 <span class="keywordflow">for</span>(t=fir[s], stopt=t+nnz[s]; t<stopt; ++t) {
<a name="l00072"></a>00072 i=p[sub[t]];
<a name="l00073"></a>00073 nnzt[max(i,j)]++;
<a name="l00074"></a>00074 }
<a name="l00075"></a>00075 }
<a name="l00076"></a>00076 }
<a name="l00077"></a>00077 <span class="keywordflow">else</span> {
<a name="l00078"></a>00078 <span class="keywordflow">for</span>(j=0; j<nrow; ++j) {
<a name="l00079"></a>00079 <span class="keywordflow">for</span>(t=fir[j], stopt=t+nnz[j]; t<stopt; ++t) {
<a name="l00080"></a>00080 i=sub[t];
<a name="l00081"></a>00081 nnzt[max(i,j)]++;
<a name="l00082"></a>00082 }
<a name="l00083"></a>00083 }
<a name="l00084"></a>00084 }
<a name="l00085"></a>00085 }
<a name="l00086"></a>00086
<a name="l00087"></a>00087 <span class="keywordflow">else</span> {
<a name="l00088"></a>00088 <span class="keywordflow">if</span> (p) {
<a name="l00089"></a>00089 <span class="keywordflow">for</span>(s=0; s<nrow; ++s) {
<a name="l00090"></a>00090 j =p[s];
<a name="l00091"></a>00091 <span class="keywordflow">for</span>(t=fir[s], stopt=t+nnz[s]; t<stopt; ++t) {
<a name="l00092"></a>00092 i=p[sub[t]];
<a name="l00093"></a>00093 nnzt[min(i,j)]++;
<a name="l00094"></a>00094 }
<a name="l00095"></a>00095 }
<a name="l00096"></a>00096 }
<a name="l00097"></a>00097 <span class="keywordflow">else</span> {
<a name="l00098"></a>00098 <span class="keywordflow">for</span>(j=0; j<nrow; ++j) {
<a name="l00099"></a>00099 <span class="keywordflow">for</span>(t=fir[j], stopt=t+nnz[j]; t<stopt; ++t) {
<a name="l00100"></a>00100 i=sub[t];
<a name="l00101"></a>00101 nnzt[min(i,j)]++;
<a name="l00102"></a>00102 }
<a name="l00103"></a>00103 }
<a name="l00104"></a>00104 }
<a name="l00105"></a>00105 }
<a name="l00106"></a>00106
<a name="l00107"></a>00107 firt[0]=0;
<a name="l00108"></a>00108 <span class="keywordflow">for</span>(i=1; i<nrow; ++i) {
<a name="l00109"></a>00109 firt[i] =firt[i-1] + nnzt[i-1];
<a name="l00110"></a>00110 nnzt[i-1]=0;
<a name="l00111"></a>00111 }
<a name="l00112"></a>00112 nnzt[nrow-1]=0;
<a name="l00113"></a>00113
<a name="l00114"></a>00114 <span class="keywordflow">if</span> (rowwise) {
<a name="l00115"></a>00115 <span class="keywordflow">if</span> (p) {
<a name="l00116"></a>00116 <span class="keywordflow">for</span>(s=0; s<nrow; ++s) {
<a name="l00117"></a>00117 j=p[s];
<a name="l00118"></a>00118 <span class="keywordflow">for</span>(t=fir[s], stopt=t+nnz[s]; t<stopt; ++t) {
<a name="l00119"></a>00119 i=p[sub[t]];
<a name="l00120"></a>00120 <span class="keywordflow">if</span> (i>j) {
<a name="l00121"></a>00121 subt[firt[i]+nnzt[i]]=j;
<a name="l00122"></a>00122 nnzt[i]++;
<a name="l00123"></a>00123 }
<a name="l00124"></a>00124 <span class="keywordflow">else</span> {
<a name="l00125"></a>00125 subt[firt[j]+nnzt[j]]=i;
<a name="l00126"></a>00126 nnzt[j]++;
<a name="l00127"></a>00127 }
<a name="l00128"></a>00128 }
<a name="l00129"></a>00129 }
<a name="l00130"></a>00130 }
<a name="l00131"></a>00131 <span class="keywordflow">else</span> {
<a name="l00132"></a>00132 <span class="keywordflow">for</span>(j=0; j<nrow; ++j) {
<a name="l00133"></a>00133 <span class="keywordflow">for</span>(t=fir[j], stopt=t+nnz[j]; t<stopt; ++t) {
<a name="l00134"></a>00134 i=sub[t];
<a name="l00135"></a>00135 <span class="keywordflow">if</span> (i>j) {
<a name="l00136"></a>00136 subt[firt[i]+nnzt[i]]=j;
<a name="l00137"></a>00137 nnzt[i]++;
<a name="l00138"></a>00138 }
<a name="l00139"></a>00139 <span class="keywordflow">else</span> {
<a name="l00140"></a>00140 subt[firt[j]+nnzt[j]]=i;
<a name="l00141"></a>00141 nnzt[j]++;
<a name="l00142"></a>00142 }
<a name="l00143"></a>00143 }
<a name="l00144"></a>00144 }
<a name="l00145"></a>00145 }
<a name="l00146"></a>00146 }
<a name="l00147"></a>00147
<a name="l00148"></a>00148 <span class="keywordflow">else</span> {
<a name="l00149"></a>00149 <span class="keywordflow">if</span> (p) {
<a name="l00150"></a>00150 <span class="keywordflow">for</span>(s=0; s<nrow; ++s) {
<a name="l00151"></a>00151 j=p[s];
<a name="l00152"></a>00152 <span class="keywordflow">for</span>(t=fir[s], stopt=t+nnz[s]; t<stopt; ++t) {
<a name="l00153"></a>00153 i=p[sub[t]];
<a name="l00154"></a>00154 <span class="keywordflow">if</span> (i<j) {
<a name="l00155"></a>00155 subt[firt[i]+nnzt[i]]=j;
<a name="l00156"></a>00156 nnzt[i]++;
<a name="l00157"></a>00157 }
<a name="l00158"></a>00158 <span class="keywordflow">else</span> {
<a name="l00159"></a>00159 subt[firt[j]+nnzt[j]]=i;
<a name="l00160"></a>00160 nnzt[j]++;
<a name="l00161"></a>00161 }
<a name="l00162"></a>00162 }
<a name="l00163"></a>00163 }
<a name="l00164"></a>00164 }
<a name="l00165"></a>00165 <span class="keywordflow">else</span> {
<a name="l00166"></a>00166 <span class="keywordflow">for</span>(j=0; j<nrow; ++j) {
<a name="l00167"></a>00167 <span class="keywordflow">for</span>(t=fir[j], stopt=t+nnz[j]; t<stopt; ++t) {
<a name="l00168"></a>00168 i=sub[t];
<a name="l00169"></a>00169 <span class="keywordflow">if</span> (i<j) {
<a name="l00170"></a>00170 subt[firt[i]+nnzt[i]]=j;
<a name="l00171"></a>00171 nnzt[i]++;
<a name="l00172"></a>00172 }
<a name="l00173"></a>00173 <span class="keywordflow">else</span> {
<a name="l00174"></a>00174 subt[firt[j]+nnzt[j]]=i;
<a name="l00175"></a>00175 nnzt[j]++;
<a name="l00176"></a>00176 }
<a name="l00177"></a>00177 }
<a name="l00178"></a>00178 }
<a name="l00179"></a>00179 }
<a name="l00180"></a>00180 }
<a name="l00181"></a>00181 } <span class="comment">/* PermTransSym */</span>
<a name="l00182"></a>00182
<a name="l00183"></a>00183 <span class="keyword">static</span> <span class="keywordtype">void</span> LocDplRow(<span class="keywordtype">int</span> nrow,
<a name="l00184"></a>00184 <span class="keywordtype">int</span> ncol,
<a name="l00185"></a>00185 <span class="keywordtype">int</span> fir[],
<a name="l00186"></a>00186 <span class="keywordtype">int</span> sze[],
<a name="l00187"></a>00187 <span class="keywordtype">int</span> *sub,
<a name="l00188"></a>00188 <span class="keywordtype">int</span> map[],
<a name="l00189"></a>00189 <span class="keywordtype">int</span> ifirst[],
<a name="l00190"></a>00190 <span class="keywordtype">int</span> ilink[],
<a name="l00191"></a>00191 <span class="keywordtype">int</span> ilist[],
<a name="l00192"></a>00192 <span class="keywordtype">int</span> *icount,
<a name="l00193"></a>00193 <span class="keywordtype">int</span> i1nrow[])
<a name="l00194"></a>00194 {
<a name="l00195"></a>00195 <span class="keywordtype">int</span> i,rnew,n,oisze,isze,s,count,
<a name="l00196"></a>00196 temp,k,nexti,*cur=i1nrow;
<a name="l00197"></a>00197
<a name="l00198"></a>00198 n =nrow;
<a name="l00199"></a>00199 *icount=0;
<a name="l00200"></a>00200
<a name="l00201"></a>00201 <span class="keywordflow">for</span> (i=0; i<nrow; i++) {
<a name="l00202"></a>00202 cur[i] =0;
<a name="l00203"></a>00203 ilink[i]=n;
<a name="l00204"></a>00204 ilist[i]=n;
<a name="l00205"></a>00205 }
<a name="l00206"></a>00206 iSet(ncol,n,ifirst,NULL);
<a name="l00207"></a>00207
<a name="l00208"></a>00208 isze =0;
<a name="l00209"></a>00209 count=0;
<a name="l00210"></a>00210 oisze=isze;
<a name="l00211"></a>00211 rnew =n;
<a name="l00212"></a>00212 <span class="keywordflow">for</span>(i=0; i<nrow; ++i) {
<a name="l00213"></a>00213 <span class="keywordflow">if</span> (map)
<a name="l00214"></a>00214 <span class="keywordflow">for</span>(; cur[i]<sze[i] && !map[sub[fir[i]+cur[i]]]; ++cur[i]);
<a name="l00215"></a>00215
<a name="l00216"></a>00216 <span class="keywordflow">if</span> ( cur[i]<sze[i] ) {
<a name="l00217"></a>00217 s=sub[fir[i]+cur[i]];
<a name="l00218"></a>00218 <span class="keywordflow">if</span> ( ifirst[s]==n )
<a name="l00219"></a>00219 ilist[isze++]=s;
<a name="l00220"></a>00220
<a name="l00221"></a>00221 InsertDplRow(i,s,ifirst,ilink);
<a name="l00222"></a>00222
<a name="l00223"></a>00223 cur[i]++;
<a name="l00224"></a>00224 }
<a name="l00225"></a>00225
<a name="l00226"></a>00226 <span class="keywordflow">else</span> {
<a name="l00227"></a>00227 temp =rnew;
<a name="l00228"></a>00228 rnew =i;
<a name="l00229"></a>00229 ilink[i]=temp;
<a name="l00230"></a>00230 }
<a name="l00231"></a>00231 }
<a name="l00232"></a>00232
<a name="l00233"></a>00233 <span class="keywordflow">for</span>(k=oisze; k<isze; ++k) {
<a name="l00234"></a>00234 temp =ifirst[ilist[k]];
<a name="l00235"></a>00235 ifirst[ilist[k]]=n;
<a name="l00236"></a>00236 ilist[k] =temp;
<a name="l00237"></a>00237 }
<a name="l00238"></a>00238
<a name="l00239"></a>00239 <span class="keywordflow">if</span> (rnew!=n) {
<a name="l00240"></a>00240 count++;
<a name="l00241"></a>00241 ilist[nrow-count]=rnew;
<a name="l00242"></a>00242 }
<a name="l00243"></a>00243
<a name="l00244"></a>00244 <span class="keywordflow">while</span>(isze) {
<a name="l00245"></a>00245 isze--;
<a name="l00246"></a>00246 oisze =isze;
<a name="l00247"></a>00247
<a name="l00248"></a>00248 i =ilist[isze];
<a name="l00249"></a>00249 ilist[isze]=n;
<a name="l00250"></a>00250
<a name="l00251"></a>00251 <span class="keywordflow">if</span> (i==n)
<a name="l00252"></a>00252 exit(0);
<a name="l00253"></a>00253
<a name="l00254"></a>00254 rnew=n;
<a name="l00255"></a>00255 <span class="keywordflow">if</span> (ilink[i]==n)
<a name="l00256"></a>00256 rnew=i;
<a name="l00257"></a>00257 <span class="keywordflow">else</span> {
<a name="l00258"></a>00258 <span class="keywordflow">for</span>(; i!=n; i=nexti) {
<a name="l00259"></a>00259 nexti =ilink[i];
<a name="l00260"></a>00260 ilink[i]=n;
<a name="l00261"></a>00261
<a name="l00262"></a>00262 <span class="keywordflow">if</span> ( map )
<a name="l00263"></a>00263 <span class="keywordflow">for</span>(; cur[i]<sze[i] && !map[sub[fir[i]+cur[i]]]; ++cur[i]);
<a name="l00264"></a>00264
<a name="l00265"></a>00265 <span class="keywordflow">if</span> (cur[i]<sze[i]) {
<a name="l00266"></a>00266 s =sub[fir[i]+cur[i]];
<a name="l00267"></a>00267 cur[i]++;
<a name="l00268"></a>00268
<a name="l00269"></a>00269 <span class="keywordflow">if</span> (ifirst[s]==n)
<a name="l00270"></a>00270 ilist[isze++]=s;
<a name="l00271"></a>00271
<a name="l00272"></a>00272 temp =ifirst[s];
<a name="l00273"></a>00273 ifirst[s]=i;
<a name="l00274"></a>00274 ilink[i] =temp;
<a name="l00275"></a>00275 }
<a name="l00276"></a>00276
<a name="l00277"></a>00277 <span class="keywordflow">else</span> {
<a name="l00278"></a>00278 temp =rnew;
<a name="l00279"></a>00279 rnew =i;
<a name="l00280"></a>00280 ilink[i]=temp;
<a name="l00281"></a>00281 }
<a name="l00282"></a>00282 }
<a name="l00283"></a>00283 }
<a name="l00284"></a>00284
<a name="l00285"></a>00285 <span class="keywordflow">for</span>(k=oisze; k<isze; ++k) {
<a name="l00286"></a>00286 temp =ifirst[ilist[k]];
<a name="l00287"></a>00287 ifirst[ilist[k]]=n;
<a name="l00288"></a>00288 ilist[k] =temp;
<a name="l00289"></a>00289 }
<a name="l00290"></a>00290
<a name="l00291"></a>00291 <span class="keywordflow">if</span> (rnew!=n) {
<a name="l00292"></a>00292 count++;
<a name="l00293"></a>00293 ilist[nrow-count]=rnew;
<a name="l00294"></a>00294 }
<a name="l00295"></a>00295 }
<a name="l00296"></a>00296
<a name="l00297"></a>00297 *icount=count;
<a name="l00298"></a>00298 <span class="keywordflow">for</span>(k=0; k<count; ++k)
<a name="l00299"></a>00299 ilist[k]=ilist[nrow-count+k];
<a name="l00300"></a>00300 } <span class="comment">/* LocDplRow */</span>
<a name="l00301"></a>00301
<a name="l00302"></a>00302 <span class="keyword">static</span> <span class="keywordtype">int</span> CompIntElem(<span class="keyword">const</span> <span class="keywordtype">void</span> *e1,
<a name="l00303"></a>00303 <span class="keyword">const</span> <span class="keywordtype">void</span> *e2)
<a name="l00304"></a>00304 {
<a name="l00305"></a>00305 <span class="keywordtype">int</span> *i1,*i2;
<a name="l00306"></a>00306
<a name="l00307"></a>00307 i1=(<span class="keywordtype">int</span> *) e1;
<a name="l00308"></a>00308 i2=(<span class="keywordtype">int</span> *) e2;
<a name="l00309"></a>00309
<a name="l00310"></a>00310 <span class="keywordflow">if</span> (*i1<*i2)
<a name="l00311"></a>00311 <span class="keywordflow">return</span> (-1);
<a name="l00312"></a>00312 <span class="keywordflow">else</span> <span class="keywordflow">if</span>(*i1>*i2)
<a name="l00313"></a>00313 <span class="keywordflow">return</span> (1);
<a name="l00314"></a>00314 <span class="keywordflow">return</span> (0);
<a name="l00315"></a>00315 } <span class="comment">/* CompIntElem */</span>
<a name="l00316"></a>00316
<a name="l00317"></a>00317 <span class="keyword">static</span> <span class="keywordtype">void</span> iSort(<span class="keywordtype">int</span> n,
<a name="l00318"></a>00318 <span class="keywordtype">int</span> *x)
<a name="l00319"></a>00319 {
<a name="l00320"></a>00320 qsort((<span class="keywordtype">void</span> *)x,n,<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>),CompIntElem);
<a name="l00321"></a>00321 } <span class="comment">/* iSort */</span>
<a name="l00322"></a>00322
<a name="l00323"></a>00323 <span class="keyword">static</span> <span class="keywordtype">void</span> DetectDenseNodes(chfac *sf,
<a name="l00324"></a>00324 <span class="keywordtype">int</span> *i1nrow,
<a name="l00325"></a>00325 <span class="keywordtype">int</span> *i2nrow,
<a name="l00326"></a>00326 <span class="keywordtype">int</span> *i3nrow,
<a name="l00327"></a>00327 <span class="keywordtype">int</span> *i4nrow,
<a name="l00328"></a>00328 <span class="keywordtype">int</span> *i5nrow,
<a name="l00329"></a>00329 <span class="keywordtype">int</span> *i6nrow)
<a name="l00330"></a>00330 {
<a name="l00331"></a>00331 <span class="keywordtype">int</span> ierr=0,j,k,l,t,ndens,nil=sf->nrow,
<a name="l00332"></a>00332 *subg=sf->subg,*ujbeg=sf->ujbeg,
<a name="l00333"></a>00333 *ujsze=sf->ujsze,*usub=sf->usub,
<a name="l00334"></a>00334 *fir,*sze,*ilist,*ilink;
<a name="l00335"></a>00335
<a name="l00336"></a>00336 <span class="keywordflow">if</span> (!sf->nsnds||
<a name="l00337"></a>00337 !i1nrow || !i2nrow || !i3nrow ||
<a name="l00338"></a>00338 !i4nrow || !i5nrow || !i6nrow) {
<a name="l00339"></a>00339 sf->sdens=FALSE;
<a name="l00340"></a>00340 <span class="keywordflow">return</span>;
<a name="l00341"></a>00341 }
<a name="l00342"></a>00342
<a name="l00343"></a>00343 sf->sdens =TRUE;
<a name="l00344"></a>00344 fir =i1nrow;
<a name="l00345"></a>00345 sze =i2nrow;
<a name="l00346"></a>00346 ilist =i3nrow;
<a name="l00347"></a>00347 ilink =i4nrow;
<a name="l00348"></a>00348
<a name="l00349"></a>00349 sf->nsndn=0;
<a name="l00350"></a>00350
<a name="l00351"></a>00351 l=subg[sf->nsnds-1];
<a name="l00352"></a>00352 <span class="keywordflow">for</span>(k=0; k+1<sf->nsnds; ++k) {
<a name="l00353"></a>00353 j=subg[k];
<a name="l00354"></a>00354 <span class="keywordflow">for</span>(t=0; t<ujsze[j] && usub[ujbeg[j]+t]<l; ++t);
<a name="l00355"></a>00355
<a name="l00356"></a>00356 fir[k] =ujbeg[j]+t;
<a name="l00357"></a>00357 sze[k] =ujsze[j]-t;
<a name="l00358"></a>00358 }
<a name="l00359"></a>00359
<a name="l00360"></a>00360 LocDplRow(sf->nsnds-1,sf->nrow,fir,sze,usub,
<a name="l00361"></a>00361 NULL,
<a name="l00362"></a>00362 i6nrow,ilink,ilist,&ndens,i5nrow);
<a name="l00363"></a>00363
<a name="l00364"></a>00364 ierr=iAlloc(ndens+1, <span class="stringliteral">"sf->dhead, DetectDenseNodes"</span>,&sf->dhead);<span class="keywordflow">if</span>(ierr) <span class="keywordflow">return</span>;
<a name="l00365"></a>00365 ierr=iAlloc(sf->nsnds,<span class="stringliteral">"sf->dsub, DetectDenseNodes"</span>,&sf->dsub);<span class="keywordflow">if</span>(ierr) <span class="keywordflow">return</span>;
<a name="l00366"></a>00366 ierr=iAlloc(sf->nsnds,<span class="stringliteral">"sf->dbeg, DetectDenseNodes"</span>,&sf->dbeg);<span class="keywordflow">if</span>(ierr) <span class="keywordflow">return</span>;
<a name="l00367"></a>00367
<a name="l00368"></a>00368 nil =sf->nsnds-1;
<a name="l00369"></a>00369 sf->ndens =0;
<a name="l00370"></a>00370 sf->nsndn =0;
<a name="l00371"></a>00371 sf->dhead[0]=0;
<a name="l00372"></a>00372
<a name="l00373"></a>00373 <span class="keywordflow">for</span>(k=0; k<ndens; ++k) {
<a name="l00374"></a>00374 j=ilist[k];
<a name="l00375"></a>00375 <span class="keywordflow">if</span> ( sze[j] ) {
<a name="l00376"></a>00376 sf->dhead[sf->ndens+1]=sf->dhead[sf->ndens];
<a name="l00377"></a>00377 sf->ndens++;
<a name="l00378"></a>00378 <span class="keywordflow">for</span>(; j!=nil; j=ilink[j]) {
<a name="l00379"></a>00379 sf->nsndn += sf->subg[j+1]-sf->subg[j];
<a name="l00380"></a>00380 sf->dsub[sf->dhead[sf->ndens]]=j;
<a name="l00381"></a>00381 sf->dbeg[sf->dhead[sf->ndens]]=fir[j]-ujbeg[subg[j]];
<a name="l00382"></a>00382 sf->dhead[sf->ndens]++;
<a name="l00383"></a>00383 }
<a name="l00384"></a>00384 iSort(sf->dhead[sf->ndens]-sf->dhead[sf->ndens-1],
<a name="l00385"></a>00385 sf->dsub+sf->dhead[sf->ndens-1]);
<a name="l00386"></a>00386
<a name="l00387"></a>00387 <span class="keywordflow">for</span>(t=sf->dhead[sf->ndens-1]; t<sf->dhead[sf->ndens]; ++t)
<a name="l00388"></a>00388 sf->dbeg[t]=fir[sf->dsub[t]]-ujbeg[subg[sf->dsub[t]]];
<a name="l00389"></a>00389 }
<a name="l00390"></a>00390 }
<a name="l00391"></a>00391 } <span class="comment">/* DetectDenseNodes */</span>
<a name="l00392"></a>00392
<a name="l00393"></a>00393 <span class="keyword">static</span> <span class="keywordtype">int</span> ChlSymb(chfac *sf,
<a name="l00394"></a>00394 <span class="keywordtype">int</span> ulnnz)
<a name="l00395"></a>00395 {
<a name="l00396"></a>00396 <span class="keywordtype">int</span> ierr=0,chksn,i,j,t,stopt,sze,first,cur,k,
<a name="l00397"></a>00397 ffree=0,ipos,nrow=sf->nrow,nil=nrow,
<a name="l00398"></a>00398 *nnz,*fir,*pssub,*link,*buf,*mask,
<a name="l00399"></a>00399 *usub,*tusub,*i1nrow,*i2nrow,*i3nrow,
<a name="l00400"></a>00400 *i4nrow,*p=sf->perm,*invp=sf->invp,
<a name="l00401"></a>00401 *ujbeg=sf->ujbeg,*ujsze=sf->ujsze,
<a name="l00402"></a>00402 *subg=sf->subg;
<a name="l00403"></a>00403
<a name="l00404"></a>00404 ierr=iAlloc(sf->snnz,<span class="stringliteral">"pssub, ChlSymb"</span>,&pssub);<span class="keywordflow">if</span>(ierr) <span class="keywordflow">return</span> FALSE;
<a name="l00405"></a>00405
<a name="l00406"></a>00406 <span class="keywordflow">for</span>(i=0; i<nrow; ++i)
<a name="l00407"></a>00407 invp[p[i]]=i;
<a name="l00408"></a>00408
<a name="l00409"></a>00409 nnz=sf->uhead;
<a name="l00410"></a>00410 fir=sf->subg;
<a name="l00411"></a>00411
<a name="l00412"></a>00412 PermTransSym(nrow,sf->shead,sf->ssize,sf->ssub,
<a name="l00413"></a>00413 invp,TRUE,fir,nnz,pssub);
<a name="l00414"></a>00414
<a name="l00415"></a>00415 PermTransSym(nrow,fir,nnz,pssub,NULL,FALSE,
<a name="l00416"></a>00416 sf->shead,sf->ssize,sf->ssub);
<a name="l00417"></a>00417
<a name="l00418"></a>00418 iFree(&pssub);
<a name="l00419"></a>00419
<a name="l00420"></a>00420 k =ulnnz+nrow;
<a name="l00421"></a>00421 ierr =iAlloc(k,<span class="stringliteral">"usub, ChlSymb"</span>,&usub);<span class="keywordflow">if</span>(ierr) <span class="keywordflow">return</span> FALSE;
<a name="l00422"></a>00422 buf =usub+ulnnz;
<a name="l00423"></a>00423
<a name="l00424"></a>00424 mask=sf->uhead;
<a name="l00425"></a>00425
<a name="l00426"></a>00426 link=invp;
<a name="l00427"></a>00427
<a name="l00428"></a>00428 iZero(nrow,mask,NULL);
<a name="l00429"></a>00429 iSet(nrow,nil,link,NULL);
<a name="l00430"></a>00430
<a name="l00431"></a>00431 ffree =0;
<a name="l00432"></a>00432 sf->nsnds=0;
<a name="l00433"></a>00433 subg[0] =0;
<a name="l00434"></a>00434 <span class="keywordflow">for</span>(i=0; i<nrow; ++i) {
<a name="l00435"></a>00435 sze =sf->ssize[i];
<a name="l00436"></a>00436 first=nil;
<a name="l00437"></a>00437 cur =link[i];
<a name="l00438"></a>00438 chksn=FALSE;
<a name="l00439"></a>00439
<a name="l00440"></a>00440 <span class="keywordflow">if</span> (cur==nil) {
<a name="l00441"></a>00441
<a name="l00442"></a>00442 subg[sf->nsnds+1] =1 + subg[sf->nsnds];
<a name="l00443"></a>00443 ujsze[i] =sze;
<a name="l00444"></a>00444 ujbeg[i] =ffree;
<a name="l00445"></a>00445 ffree += sze;
<a name="l00446"></a>00446
<a name="l00447"></a>00447 iCopy(sze,sf->ssub+sf->shead[i],usub+ujbeg[i]);
<a name="l00448"></a>00448 <span class="keywordflow">if</span> (sze) {
<a name="l00449"></a>00449 first=usub[ujbeg[i]];
<a name="l00450"></a>00450 <span class="keywordflow">for</span>(cur=first; link[cur]!=nil; cur=link[cur]);
<a name="l00451"></a>00451 link[cur] =sf->nsnds;
<a name="l00452"></a>00452 link[sf->nsnds]=nil;
<a name="l00453"></a>00453 }
<a name="l00454"></a>00454 sf->nsnds++;
<a name="l00455"></a>00455 }
<a name="l00456"></a>00456
<a name="l00457"></a>00457 <span class="keywordflow">else</span> {
<a name="l00458"></a>00458 mask[i]=1;
<a name="l00459"></a>00459
<a name="l00460"></a>00460 iCopy(sze,sf->ssub+sf->shead[i],buf);
<a name="l00461"></a>00461 iSet(sze,1,mask,buf);
<a name="l00462"></a>00462
<a name="l00463"></a>00463 <span class="keywordflow">for</span>(; cur!=nil; cur=link[cur]) {
<a name="l00464"></a>00464 chksn |= (1+cur==sf->nsnds);
<a name="l00465"></a>00465 k =subg[cur];
<a name="l00466"></a>00466
<a name="l00467"></a>00467 <span class="keywordflow">for</span>(t=ujbeg[k], stopt=t+ujsze[k]; t<stopt; ++t) {
<a name="l00468"></a>00468 j=usub[t];
<a name="l00469"></a>00469 <span class="keywordflow">if</span> ( j>i && !mask[j] ) {
<a name="l00470"></a>00470 buf[sze]=j;
<a name="l00471"></a>00471 mask[j] =1;
<a name="l00472"></a>00472 sze++;
<a name="l00473"></a>00473 }
<a name="l00474"></a>00474 }
<a name="l00475"></a>00475 }
<a name="l00476"></a>00476
<a name="l00477"></a>00477 <span class="keywordflow">if</span> (chksn) {
<a name="l00478"></a>00478 k =subg[sf->nsnds-1];
<a name="l00479"></a>00479 chksn=sze==( ujsze[k]-(subg[sf->nsnds]-subg[sf->nsnds-1]) );
<a name="l00480"></a>00480 }
<a name="l00481"></a>00481
<a name="l00482"></a>00482 first =nrow;
<a name="l00483"></a>00483 mask[i]=0;
<a name="l00484"></a>00484 <span class="keywordflow">for</span>(t=0; t<sze; ++t) {
<a name="l00485"></a>00485 j =buf[t];
<a name="l00486"></a>00486 mask[j]=0;
<a name="l00487"></a>00487 first =min(j,first);
<a name="l00488"></a>00488 }
<a name="l00489"></a>00489
<a name="l00490"></a>00490 <span class="keywordflow">if</span> (chksn) {
<a name="l00491"></a>00491 ipos=LocIntPos(ujsze[i-1],i,usub+ujbeg[i-1]);
<a name="l00492"></a>00492
<a name="l00493"></a>00493 <span class="keywordflow">if</span> (ipos==ujsze[i-1])
<a name="l00494"></a>00494 ExitProc(SysError,NULL);
<a name="l00495"></a>00495
<a name="l00496"></a>00496 iSwap(ujbeg[i-1],ipos+ujbeg[i-1],usub);
<a name="l00497"></a>00497
<a name="l00498"></a>00498 subg[sf->nsnds]++;
<a name="l00499"></a>00499 ujbeg[i] =ujbeg[i-1]+1;
<a name="l00500"></a>00500 ujsze[i] =ujsze[i-1]-1;
<a name="l00501"></a>00501
<a name="l00502"></a>00502 <span class="keywordflow">if</span> (usub[ujbeg[i]-1]!=i)
<a name="l00503"></a>00503 ExitProc(SysError,NULL);
<a name="l00504"></a>00504
<a name="l00505"></a>00505 <span class="keywordflow">if</span> ( first!=nil ) {
<a name="l00506"></a>00506 <span class="keywordflow">for</span>(cur=first; link[cur]!=nil; cur=link[cur]);
<a name="l00507"></a>00507 link[cur] =sf->nsnds-1;
<a name="l00508"></a>00508 link[sf->nsnds-1]=nil;
<a name="l00509"></a>00509 }
<a name="l00510"></a>00510 }
<a name="l00511"></a>00511
<a name="l00512"></a>00512 <span class="keywordflow">else</span> {
<a name="l00513"></a>00513 subg[sf->nsnds+1] =1 + subg[sf->nsnds];
<a name="l00514"></a>00514 ujbeg[i] =ffree;
<a name="l00515"></a>00515 ujsze[i] =sze;
<a name="l00516"></a>00516 ffree += sze;
<a name="l00517"></a>00517
<a name="l00518"></a>00518 <span class="keywordflow">if</span> (ffree>ulnnz)
<a name="l00519"></a>00519 ExitProc(SysError,NULL);
<a name="l00520"></a>00520
<a name="l00521"></a>00521 iCopy(sze,buf,usub+ujbeg[i]);
<a name="l00522"></a>00522
<a name="l00523"></a>00523 <span class="keywordflow">if</span> ( first!=nil ) {
<a name="l00524"></a>00524 <span class="keywordflow">for</span>(cur=first; link[cur]!=nil; cur=link[cur]);
<a name="l00525"></a>00525 link[cur] =sf->nsnds;
<a name="l00526"></a>00526 link[sf->nsnds]=nil;
<a name="l00527"></a>00527 }
<a name="l00528"></a>00528 sf->nsnds++;
<a name="l00529"></a>00529 }
<a name="l00530"></a>00530 }
<a name="l00531"></a>00531
<a name="l00532"></a>00532 <span class="keywordflow">if</span> (ujsze[i]+1==nrow-i)
<a name="l00533"></a>00533 <span class="keywordflow">break</span>;
<a name="l00534"></a>00534 }
<a name="l00535"></a>00535
<a name="l00536"></a>00536 <span class="keywordflow">for</span>(++i; i<nrow; ++i) {
<a name="l00537"></a>00537 ujsze[i] =ujsze[i-1]-1;
<a name="l00538"></a>00538 ujbeg[i]=ujbeg[i-1]+1;
<a name="l00539"></a>00539
<a name="l00540"></a>00540 subg[sf->nsnds]++;
<a name="l00541"></a>00541 }
<a name="l00542"></a>00542
<a name="l00543"></a>00543 ierr=iAlloc(ffree,<span class="stringliteral">"tusub, ChlSymb"</span>,&tusub);<span class="keywordflow">if</span>(ierr) <span class="keywordflow">return</span> FALSE;
<a name="l00544"></a>00544
<a name="l00545"></a>00545 fir=buf;
<a name="l00546"></a>00546 nnz=sf->uhead;
<a name="l00547"></a>00547
<a name="l00548"></a>00548 iZero(nrow,nnz,NULL);
<a name="l00549"></a>00549
<a name="l00550"></a>00550 <span class="keywordflow">for</span>(k=0; k<sf->nsnds; ++k) {
<a name="l00551"></a>00551 j=subg[k];
<a name="l00552"></a>00552 plusXs(ujsze[j],nnz,usub+ujbeg[j]);
<a name="l00553"></a>00553 }
<a name="l00554"></a>00554
<a name="l00555"></a>00555 fir[0]=0;
<a name="l00556"></a>00556 <span class="keywordflow">for</span>(k=1; k<nrow; ++k)
<a name="l00557"></a>00557 fir[k]=fir[k-1] + nnz[k-1];
<a name="l00558"></a>00558
<a name="l00559"></a>00559 iZero(nrow,nnz,NULL);
<a name="l00560"></a>00560
<a name="l00561"></a>00561 <span class="keywordflow">for</span>(k=0; k<sf->nsnds; ++k) {
<a name="l00562"></a>00562 j=subg[k];
<a name="l00563"></a>00563 <span class="keywordflow">for</span>(t=ujbeg[j], stopt=t+ujsze[j]; t<stopt; ++t) {
<a name="l00564"></a>00564 i =usub[t];
<a name="l00565"></a>00565 tusub[fir[i]+nnz[i]] =j;
<a name="l00566"></a>00566 nnz[i]++;
<a name="l00567"></a>00567 }
<a name="l00568"></a>00568 ujsze[j]=0;
<a name="l00569"></a>00569 }
<a name="l00570"></a>00570
<a name="l00571"></a>00571 <span class="keywordflow">for</span>(i=0; i<nrow; ++i) {
<a name="l00572"></a>00572 <span class="keywordflow">for</span>(t=fir[i], stopt=t+nnz[i]; t<stopt; ++t) {
<a name="l00573"></a>00573 j =tusub[t];
<a name="l00574"></a>00574 usub[ujbeg[j]+ujsze[j]] =i;
<a name="l00575"></a>00575 ujsze[j]++;
<a name="l00576"></a>00576 }
<a name="l00577"></a>00577 }
<a name="l00578"></a>00578
<a name="l00579"></a>00579 iFree(&tusub);
<a name="l00580"></a>00580
<a name="l00581"></a>00581 <span class="keywordflow">if</span> (ffree<=sf->ujnz) {
<a name="l00582"></a>00582 iCopy(ffree,usub,sf->usub);
<a name="l00583"></a>00583 iFree(&usub);
<a name="l00584"></a>00584 }
<a name="l00585"></a>00585
<a name="l00586"></a>00586 <span class="keywordflow">else</span> {
<a name="l00587"></a>00587 sf->ujnz=0;
<a name="l00588"></a>00588 iFree(&sf->usub);
<a name="l00589"></a>00589
<a name="l00590"></a>00590 ierr=iAlloc(ffree,<span class="stringliteral">"sf->usub, ChlSymb"</span>,&sf->usub);<span class="keywordflow">if</span>(ierr) <span class="keywordflow">return</span> FALSE;
<a name="l00591"></a>00591 iCopy(ffree,usub,sf->usub);
<a name="l00592"></a>00592
<a name="l00593"></a>00593 sf->ujnz=ffree;
<a name="l00594"></a>00594 iFree(&usub);
<a name="l00595"></a>00595 }
<a name="l00596"></a>00596
<a name="l00597"></a>00597 ierr=iAlloc(4*nrow,<span class="stringliteral">"i1nrow, ChlSymb"</span>,&i1nrow);<span class="keywordflow">if</span>(ierr) <span class="keywordflow">return</span> FALSE;
<a name="l00598"></a>00598 i2nrow=i1nrow+nrow;
<a name="l00599"></a>00599 i3nrow=i2nrow+nrow;
<a name="l00600"></a>00600 i4nrow=i3nrow+nrow;
<a name="l00601"></a>00601
<a name="l00602"></a>00602 DetectDenseNodes(sf,sf->uhead,sf->invp,
<a name="l00603"></a>00603 i1nrow,i2nrow,i3nrow,i4nrow);
<a name="l00604"></a>00604
<a name="l00605"></a>00605 iFree(&i1nrow);
<a name="l00606"></a>00606
<a name="l00607"></a>00607 sf->uhead[0]=0;
<a name="l00608"></a>00608 <span class="keywordflow">for</span>(i=1; i<nrow; ++i)
<a name="l00609"></a>00609 sf->uhead[i]=sf->uhead[i-1]+sf->ujsze[i-1];
<a name="l00610"></a>00610
<a name="l00611"></a>00611 <span class="keywordflow">for</span>(i=0; i<nrow; ++i)
<a name="l00612"></a>00612 invp[p[i]]=i;
<a name="l00613"></a>00613
<a name="l00614"></a>00614 <span class="keywordflow">for</span>(k=0; k<sf->nsnds; ++k)
<a name="l00615"></a>00615 <span class="keywordflow">if</span> ( subg[k]+1!=subg[k+1] )
<a name="l00616"></a>00616 <span class="keywordflow">break</span>;
<a name="l00617"></a>00617
<a name="l00618"></a>00618 ierr=iAlloc(3*sf->n,NULL,&sf->iw);<span class="keywordflow">if</span>(ierr) <span class="keywordflow">return</span> FALSE;
<a name="l00619"></a>00619 ierr=dAlloc(2*sf->n,NULL,&sf->rw);<span class="keywordflow">if</span>(ierr) <span class="keywordflow">return</span> FALSE;
<a name="l00620"></a>00620 sf->factor=0;
<a name="l00621"></a>00621
<a name="l00622"></a>00622 <span class="keywordflow">return</span> TRUE;
<a name="l00623"></a>00623 } <span class="comment">/* ChlSymb */</span>
<a name="l00624"></a>00624
<a name="l00625"></a>00625 <span class="keywordtype">int</span> SymbProc(<span class="keywordtype">int</span>* isze,
<a name="l00626"></a>00626 <span class="keywordtype">int</span>* jsub,
<a name="l00627"></a>00627 <span class="keywordtype">int</span> n,
<a name="l00628"></a>00628 chfac** sf)
<a name="l00629"></a>00629 {
<a name="l00630"></a>00630 <span class="keywordtype">int</span> ierr,i,k,t,snnz,lnnz,*nnzi,nrow,resp;
<a name="l00631"></a>00631 chfac* cf;
<a name="l00632"></a>00632 order *od;
<a name="l00633"></a>00633
<a name="l00634"></a>00634 <span class="comment">/*</span>
<a name="l00635"></a>00635 <span class="comment"> * set data for symmetric matrix to be factorized</span>
<a name="l00636"></a>00636 <span class="comment"> */</span>
<a name="l00637"></a>00637 ierr=CfcAlloc(n,<span class="stringliteral">"sdt->sf, SymbProc"</span>,&cf);<span class="keywordflow">if</span>(ierr) <span class="keywordflow">return</span> FALSE;
<a name="l00638"></a>00638
<a name="l00639"></a>00639 nrow=cf->nrow;
<a name="l00640"></a>00640 <span class="keywordflow">for</span> (snnz=0,i=0; i<nrow; i++)
<a name="l00641"></a>00641 snnz+=isze[i];
<a name="l00642"></a>00642 <span class="comment">/*</span>
<a name="l00643"></a>00643 <span class="comment"> if (!snnz)</span>
<a name="l00644"></a>00644 <span class="comment"> return TRUE;</span>
<a name="l00645"></a>00645 <span class="comment"> */</span>
<a name="l00646"></a>00646 ierr=iAlloc(snnz,<span class="stringliteral">"cf, SymbProc"</span>,&cf->ssub); <span class="keywordflow">if</span>(ierr) <span class="keywordflow">return</span> FALSE;
<a name="l00647"></a>00647 cf->snnz=snnz;
<a name="l00648"></a>00648
<a name="l00649"></a>00649 nnzi=cf->perm;
<a name="l00650"></a>00650 iZero(nrow,nnzi,NULL);
<a name="l00651"></a>00651
<a name="l00652"></a>00652 k=0;
<a name="l00653"></a>00653 <span class="keywordflow">for</span> (i=0; i<nrow; i++) {
<a name="l00654"></a>00654 snnz =isze[i];
<a name="l00655"></a>00655 cf->shead[i]=k;
<a name="l00656"></a>00656 cf->ssize[i]=snnz;
<a name="l00657"></a>00657 k+=snnz;
<a name="l00658"></a>00658 }
<a name="l00659"></a>00659 iCopy(k,jsub,cf->ssub);
<a name="l00660"></a>00660
<a name="l00661"></a>00661 nnzi=cf->perm;
<a name="l00662"></a>00662 iZero(nrow,nnzi,NULL);
<a name="l00663"></a>00663
<a name="l00664"></a>00664 <span class="keywordflow">for</span> (i=0; i<nrow; i++) {
<a name="l00665"></a>00665 nnzi[i]+=cf->ssize[i];
<a name="l00666"></a>00666 plusXs(cf->ssize[i],nnzi,cf->ssub+cf->shead[i]);
<a name="l00667"></a>00667 }
<a name="l00668"></a>00668
<a name="l00669"></a>00669 ierr=OdAlloc(nrow,2*cf->snnz,<span class="stringliteral">"od, PspSymbo"</span>,&od); <span class="keywordflow">if</span>(ierr) <span class="keywordflow">return</span> FALSE;
<a name="l00670"></a>00670 nnzi=cf->perm;
<a name="l00671"></a>00671
<a name="l00672"></a>00672 OdInit(od,nnzi);
<a name="l00673"></a>00673 <span class="keywordflow">for</span> (i=0; i<nrow; i++)
<a name="l00674"></a>00674 <span class="keywordflow">for</span> (t=0; t<cf->ssize[i]; ++t)
<a name="l00675"></a>00675 OdIndex(od,i,cf->ssub[cf->shead[i]+t]);
<a name="l00676"></a>00676
<a name="l00677"></a>00677 GetOrder(od,cf->perm);
<a name="l00678"></a>00678
<a name="l00679"></a>00679 lnnz=od->ntot;
<a name="l00680"></a>00680 OdFree(&od);
<a name="l00681"></a>00681
<a name="l00682"></a>00682 resp=ChlSymb(cf,lnnz);
<a name="l00683"></a>00683 LvalAlloc(cf,<span class="stringliteral">"cf, PspSymb"</span>);
<a name="l00684"></a>00684 <span class="comment">/* sdt->sf=cf; */</span>
<a name="l00685"></a>00685
<a name="l00686"></a>00686 *sf=cf;
<a name="l00687"></a>00687 <span class="keywordflow">return</span> resp;
<a name="l00688"></a>00688 } <span class="comment">/* SymbProc */</span>
<a name="l00689"></a>00689
<a name="l00690"></a>00690 <span class="keywordtype">int</span> MchlSetup2(<span class="keywordtype">int</span> m, chfac** A)
<a name="l00691"></a>00691 {
<a name="l00692"></a>00692 <span class="keywordtype">int</span> ierr,i,j,k,lnnz,mnnz;
<a name="l00693"></a>00693 chfac *mf;
<a name="l00694"></a>00694
<a name="l00695"></a>00695 ierr =CfcAlloc(m,NULL,&mf); <span class="keywordflow">if</span>(ierr) <span class="keywordflow">return</span> 1;
<a name="l00696"></a>00696 *A=mf;
<a name="l00697"></a>00697
<a name="l00698"></a>00698 mnnz=m*(m-1)/2;
<a name="l00699"></a>00699 <span class="keywordflow">if</span> (!mnnz && m>1)
<a name="l00700"></a>00700 <span class="keywordflow">return</span> TRUE;
<a name="l00701"></a>00701
<a name="l00702"></a>00702 lnnz=mnnz;
<a name="l00703"></a>00703 ierr=iAlloc(mnnz,NULL,&mf->ssub);<span class="keywordflow">if</span>(ierr) <span class="keywordflow">return</span> 1;
<a name="l00704"></a>00704
<a name="l00705"></a>00705 mf->snnz=mnnz;
<a name="l00706"></a>00706 k=0;
<a name="l00707"></a>00707 <span class="keywordflow">for</span> (i=0; i<m; i++)
<a name="l00708"></a>00708 {
<a name="l00709"></a>00709 mnnz =m-(i+1);
<a name="l00710"></a>00710 mf->shead[i] =k;
<a name="l00711"></a>00711 mf->ssize[i] =mnnz;
<a name="l00712"></a>00712 <span class="keywordflow">for</span> (j=0; j<mnnz; j++)
<a name="l00713"></a>00713 mf->ssub[k+j]=(j+1+i);
<a name="l00714"></a>00714 k +=mnnz;
<a name="l00715"></a>00715 mf->perm[i]=i;
<a name="l00716"></a>00716 }
<a name="l00717"></a>00717
<a name="l00718"></a>00718
<a name="l00719"></a>00719 k=ChlSymb(mf,lnnz);
<a name="l00720"></a>00720
<a name="l00721"></a>00721 iFree(&mf->ssub);
<a name="l00722"></a>00722 iFree(&mf->shead);
<a name="l00723"></a>00723 iFree(&mf->ssize);
<a name="l00724"></a>00724
<a name="l00725"></a>00725 <span class="comment">/* This part is different */</span>
<a name="l00726"></a>00726 mf->alldense=1;
<a name="l00727"></a>00727 iFree(&mf->invp);
<a name="l00728"></a>00728 mf->invp=mf->perm;
<a name="l00729"></a>00729
<a name="l00730"></a>00730 iFree(&mf->ujbeg);
<a name="l00731"></a>00731 mf->ujbeg=mf->perm;
<a name="l00732"></a>00732
<a name="l00733"></a>00733 iFree(&mf->usub);
<a name="l00734"></a>00734 mf->usub=mf->perm+1;
<a name="l00735"></a>00735
<a name="l00736"></a>00736 ierr=LvalAlloc(mf,<span class="stringliteral">"cf, PspSymb"</span>);<span class="keywordflow">if</span>(ierr) <span class="keywordflow">return</span> 1;
<a name="l00737"></a>00737
<a name="l00738"></a>00738 <span class="keywordflow">return</span> 0;
<a name="l00739"></a>00739
<a name="l00740"></a>00740 } <span class="comment">/* MchlSetup2 */</span>
</pre></div></div>
</div>
<hr class="footer"/><address class="footer"><small>Generated on Wed Jun 8 2011 for DSDP by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </small></address>
</body>
</html>
