Lines Matching refs:Ci
125 StorageIndex* Ci = C.innerIndexPtr();
149 if(Ci[p]==i)
200 Cp[j] = Ci[p]; /* save first entry of object */
201 Ci[p] = amd_flip (j); /* first entry is now amd_flip(j) */
206 if((j = amd_flip (Ci[p++])) >= 0) /* found object j */
208 Ci[q] = Cp[j]; /* restore first entry of object */
210 for(k3 = 0; k3 < len[j]-1; k3++) Ci[q++] = Ci[p++];
213 cnz = q; /* Ci[cnz...nzmax-1] now free */
227 pj = p; /* list of nodes starts at Ci[pj]*/
232 e = Ci[p++]; /* search the nodes in e */
238 i = Ci[pj++];
242 Ci[pk2++] = i; /* place i in Lk */
259 if(elenk != 0) cnz = pk2; /* Ci[cnz...nzmax] is free */
261 Cp[k] = pk1; /* element k is in Ci[pk1..pk2-1] */
269 i = Ci[pk];
275 e = Ci[p];
290 i = Ci[pk]; /* consider node i in Lk */
296 e = Ci[p];
303 Ci[pn++] = e; /* keep e in Ei */
318 j = Ci[p];
321 Ci[pn++] = j; /* place j in node list of i */
337 Ci[pn] = Ci[p3]; /* move first node to end */
338 Ci[p3] = Ci[p1]; /* move 1st el. to end of Ei */
339 Ci[p1] = k; /* add k as 1st element in of Ei */
354 i = Ci[pk];
363 for(p = Cp[i]+1; p <= Cp[i] + ln-1; p++) w[Ci[p]] = mark;
370 if(w[Ci[p]] != mark) ok = 0; /* compare i and j*/
393 i = Ci[pk];
404 Ci[p++] = i; /* place i in Lk */
