86 	if (ti->elements[i + 1] == p)  in transaction_all_obs_pkgs()
87 	  queue_push2(pkgs, p, ti->elements[i]);  in transaction_all_obs_pkgs()
90 	solv_sort(pkgs->elements, pkgs->count / 2, 2 * sizeof(Id), obsq_sortcmp, pool);  in transaction_all_obs_pkgs()
92 	pkgs->elements[i / 2] = pkgs->elements[i + 1];  in transaction_all_obs_pkgs()
100 	  if (ti->elements[i] == p)  in transaction_all_obs_pkgs()
101 	    queue_push(pkgs, ti->elements[i + 1]);  in transaction_all_obs_pkgs()
125     if (ti->elements[i] == p)  in transaction_obs_pkg()
126       return ti->elements[i + 1];  in transaction_obs_pkg()
314       q = oq.elements[i];  in transaction_type()
326 	    if (rq.elements[j] == p)  in transaction_type()
416       p = trans->steps.elements[i];  in transaction_classify()
438 …if (classes->elements[j] == SOLVER_TRANSACTION_ARCHCHANGE && classes->elements[j + 2] == v && clas…  in transaction_classify()
448 	    classes->elements[j + 1]++;  in transaction_classify()
458 …if (classes->elements[j] == SOLVER_TRANSACTION_VENDORCHANGE && classes->elements[j + 2] == v && cl…  in transaction_classify()
468 	    classes->elements[j + 1]++;  in transaction_classify()
473     solv_sort(classes->elements, classes->count / 4, 4 * sizeof(Id), classify_cmp, trans);  in transaction_classify()
507       p = trans->steps.elements[i];  in transaction_classify_pkgs()
538     solv_sort(pkgs->elements, pkgs->count, sizeof(Id), classify_cmp_pkgs, trans);  in transaction_classify_pkgs()
557       p = decisionq->elements[i];  in create_transaction_info()
601       solv_sort(ti->elements, ti->count / 2, 2 * sizeof(Id), obsq_sortcmp, pool);  in create_transaction_info()
604 	  if (ti->elements[i] == ti->elements[j - 2] && ti->elements[i + 1] == ti->elements[j - 1])  in create_transaction_info()
606 	  ti->elements[j++] = ti->elements[i];  in create_transaction_info()
607 	  ti->elements[j++] = ti->elements[i + 1];  in create_transaction_info()
617       j = ti->elements[i + 1] - installed->start;  in create_transaction_info()
619 	trans->transaction_installed[j] = ti->elements[i];  in create_transaction_info()
626 	  q[0] = q[2] = ti->elements[i + 1];  in create_transaction_info()
627 	  q[1] = ti->elements[i];  in create_transaction_info()
630 	    trans->transaction_installed[j] = -ti->elements[i];  in create_transaction_info()
653       p = decisionq->elements[i];  in transaction_create_decisionq()
689       p = decisionq->elements[i];  in transaction_create_decisionq()
709       p = trans->steps.elements[i];  in transaction_installedresult()
737       p = trans->steps.elements[i];  in transaction_create_installedmap()
943 	    ret |= addedge(od, ti.elements[i], to, type);  in addedge()
963 	    ret |= addedge(od, from, ti.elements[i], type);  in addedge()
1015       if (ti1.elements[i] == ti2.elements[j])  in havechoice()
1135 		if (pool->solvables[reqq.elements[i]].repo != installed)  in addsolvableedges()
1136 		  reqq.elements[j++] = reqq.elements[i];  in addsolvableedges()
1146 		      if (pool->solvables[reqq.elements[i]].repo == installed)  in addsolvableedges()
1150 			      if (pool->solvables[reqq.elements[j]].repo != installed)  in addsolvableedges()
1152 …	  if (trans->transaction_installed[reqq.elements[i] - pool->installed->start] == reqq.elements[j])  in addsolvableedges()
1155 … -> %s)\n", pool_solvid2str(pool, reqq.elements[i]), pool_dep2str(pool, req), pool_solvid2str(pool…  in addsolvableedges()
1157 …  addedge(od, reqq.elements[i], reqq.elements[j], pre == TYPE_PREREQ ? TYPE_PREREQ_P : TYPE_REQ_P);  in addsolvableedges()
1165 		if (pool->solvables[reqq.elements[i]].repo != installed)  in addsolvableedges()
1166 		  reqq.elements[j++] = reqq.elements[i];  in addsolvableedges()
1174 	      p2 = reqq.elements[i];  in addsolvableedges()
1212 		      if (havechoice(od, p, reqq.elements[i], reqq.elements[j]))  in addsolvableedges()
1268 	  Id tri = reqq.elements[i];  in addsolvableedges()
1385 	    POOL_DEBUG(SOLV_DEBUG_RESULT, "         -%s\n", pool_solvid2str(pool, obsq.elements[j]));  in dump_tes()
1580       p = tr->elements[i];  in transaction_order()
1603       p = tr->elements[i];  in transaction_order()
1613     addsolvableedges(&od, pool->solvables + tr->elements[i]);  in transaction_order()
1669 	if (todo.elements[j] == -i)  in transaction_order()
1676 	if (todo.elements[j] < 0)  in transaction_order()
1677 	  todo.elements[k++] = -todo.elements[j];  in transaction_order()
1683       cycle = todo.elements + cycstart;  in transaction_order()
1713        if (od.cycles.elements[i + 2] >= TYPE_REQ)  in transaction_order()
1714          addcycleedges(&od, od.cyclesdata.elements + od.cycles.elements[i], &todo);  in transaction_order()
1718        if (od.cycles.elements[i + 2] < TYPE_REQ)  in transaction_order()
1719          addcycleedges(&od, od.cyclesdata.elements + od.cycles.elements[i], &todo);  in transaction_order()
1811 	      if (!j || temedianr[todo.elements[j]] < lastmedia)  in transaction_order()
1814 		  lastmedia = temedianr[todo.elements[j]];  in transaction_order()
1817 	  lastrepo = pool->solvables[od.tes[todo.elements[i]].p].repo;  in transaction_order()
1822 	      int k = todo.elements[j];  in transaction_order()
1826 		todo.elements[i++] = k;  in transaction_order()
1967       p = trans->steps.elements[i];  in transaction_add_obsoleted()
1971 	    trans->steps.elements[j++] = p;  in transaction_add_obsoleted()
1974       trans->steps.elements[j++] = p;  in transaction_add_obsoleted()
1979 	  p = obsq.elements[k];  in transaction_add_obsoleted()
1984 	  trans->steps.elements[j++] = p;  in transaction_add_obsoleted()
2084       p = trans->steps.elements[i];  in transaction_check_order()