Symbol: pool
headers/os/media/RealtimeAlloc.h
25
status_t rtm_delete_pool(rtm_pool* pool);
headers/os/media/RealtimeAlloc.h
27
void* rtm_alloc(rtm_pool* pool, size_t size);
headers/os/media/RealtimeAlloc.h
32
size_t rtm_available(rtm_pool* pool);
headers/private/kernel/debug_heap.h
20
void delete_debug_alloc_pool(debug_alloc_pool* pool);
headers/private/kernel/fs/select_sync_pool.h
19
status_t add_select_sync_pool_entry(select_sync_pool **pool, selectsync *sync,
headers/private/kernel/fs/select_sync_pool.h
21
status_t remove_select_sync_pool_entry(select_sync_pool **pool,
headers/private/kernel/fs/select_sync_pool.h
23
void delete_select_sync_pool(select_sync_pool *pool);
headers/private/kernel/fs/select_sync_pool.h
24
void notify_select_event_pool(select_sync_pool *pool, uint8 event);
headers/private/package/hpkg/PoolBuffer.h
51
PoolBufferPutter(BBufferPool* pool, PoolBuffer** owner)
headers/private/package/hpkg/PoolBuffer.h
53
fPool(pool),
headers/private/package/hpkg/PoolBuffer.h
59
PoolBufferPutter(BBufferPool* pool, PoolBuffer* buffer)
headers/private/package/hpkg/PoolBuffer.h
61
fPool(pool),
src/add-ons/kernel/file_systems/netfs/headers/shared/BlockerPool.h
35
BlockerPutter(BlockerPool& pool, Blocker blocker)
src/add-ons/kernel/file_systems/netfs/headers/shared/BlockerPool.h
36
: fPool(pool),
src/add-ons/kernel/file_systems/netfs/server/GlobalBlockerPool.cpp
14
BlockerPool* pool = new(std::nothrow) BlockerPool;
src/add-ons/kernel/file_systems/netfs/server/GlobalBlockerPool.cpp
15
if (!pool)
src/add-ons/kernel/file_systems/netfs/server/GlobalBlockerPool.cpp
18
status_t error = pool->InitCheck();
src/add-ons/kernel/file_systems/netfs/server/GlobalBlockerPool.cpp
20
delete pool;
src/add-ons/kernel/file_systems/netfs/server/GlobalBlockerPool.cpp
24
sPool = pool;
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
109
SemaphorePoolInit(struct SemaphorePool *pool)
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
111
pool->fPool=NULL;
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
112
pool->fPoolCount=0;
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
113
pool->fPoolSize=0;
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
115
pool->fPoolSem=create_sem(1,"semaphore_pool_sem");
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
116
set_sem_owner (pool->fPoolSem,B_SYSTEM_TEAM);
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
120
SemaphorePoolDestroy(struct SemaphorePool *pool)
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
124
for (i=0;i<pool->fPoolCount;i++)
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
125
delete_sem (pool->fPool[i]);
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
127
free (pool->fPool);
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
129
delete_sem (pool->fPoolSem);
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
133
SemaphorePoolGet(struct SemaphorePool *pool)
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
137
while (acquire_sem(pool->fPoolSem)==B_INTERRUPTED)
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
141
if (pool->fPoolCount==0)
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
145
while (release_sem(pool->fPoolSem)==B_INTERRUPTED)
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
152
sem=pool->fPool[pool->fPoolCount-1];
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
153
pool->fPoolCount--;
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
155
while (release_sem(pool->fPoolSem)==B_INTERRUPTED)
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
163
SemaphorePoolPut(struct SemaphorePool *pool, sem_id sem)
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
165
while (acquire_sem(pool->fPoolSem)==B_INTERRUPTED)
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
169
if (pool->fPoolCount+1>pool->fPoolSize)
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
171
pool->fPoolSize+=8;
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
172
pool->fPool=(sem_id *)realloc(pool->fPool,pool->fPoolSize*sizeof(sem_id));
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
175
pool->fPool[pool->fPoolCount]=sem;
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
176
pool->fPoolCount++;
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.c
178
while (release_sem(pool->fPoolSem)==B_INTERRUPTED)
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.h
18
void SemaphorePoolInit (struct SemaphorePool *pool);
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.h
19
void SemaphorePoolDestroy (struct SemaphorePool *pool);
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.h
20
sem_id SemaphorePoolGet(struct SemaphorePool *pool);
src/add-ons/kernel/file_systems/nfs/RPCPendingCalls.h
21
void SemaphorePoolPut (struct SemaphorePool *pool, sem_id sem);
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
21
status_t vnidpool_alloc(struct vnidpool **pool, size_t size)
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
26
if (!pool)
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
39
*pool = p;
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
43
status_t vnidpool_free(struct vnidpool *pool) {
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
45
fprintf(stderr, "vnidpool_free: pool @ %p\n", pool);
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
46
if (!pool)
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
48
if (LOCK(&pool->lock) < B_OK)
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
51
for (i = 0; i < (pool->bmsize % sizeof(BMT)); i++) {
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
52
if (pool->bitmap[i])
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
56
free_lock(&pool->lock);
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
57
free(pool);
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
61
status_t vnidpool_get(struct vnidpool *pool, ino_t *vnid)
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
65
if (!pool)
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
67
if (LOCK(&pool->lock) < B_OK)
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
69
for (i = 0; BM_ISSET(pool, pool->nextvnid) && i < pool->bmsize; pool->nextvnid++, i++) {
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
71
if (!pool->nextvnid)
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
74
if (BM_ISSET(pool, pool->nextvnid))
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
77
BM_SET(pool, pool->nextvnid);
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
78
*vnid = pool->nextvnid++;
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
81
UNLOCK(&pool->lock);
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
85
status_t vnidpool_put(struct vnidpool *pool, ino_t vnid)
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
88
if (!pool)
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
90
if (LOCK(&pool->lock) < B_OK)
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
92
if (!BM_ISSET(pool, vnid))
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
95
BM_UNSET(pool, vnid);
src/add-ons/kernel/file_systems/websearchfs/vnidpool.c
98
UNLOCK(&pool->lock);
src/add-ons/kernel/file_systems/websearchfs/vnidpool.h
17
status_t vnidpool_alloc(struct vnidpool **pool, size_t size);
src/add-ons/kernel/file_systems/websearchfs/vnidpool.h
18
status_t vnidpool_free(struct vnidpool *pool);
src/add-ons/kernel/file_systems/websearchfs/vnidpool.h
19
status_t vnidpool_get(struct vnidpool *pool, ino_t *vnid);
src/add-ons/kernel/file_systems/websearchfs/vnidpool.h
20
status_t vnidpool_put(struct vnidpool *pool, ino_t vnid);
src/apps/cortex/addons/common/RawBuffer.h
93
rtm_pool* pool() const;
src/kits/debugger/debugger_interface/local/LocalDebuggerInterface.cpp
214
DebugContextGetter(DebugContextPool* pool)
src/kits/debugger/debugger_interface/local/LocalDebuggerInterface.cpp
216
fPool(pool),
src/kits/debugger/debugger_interface/local/LocalDebuggerInterface.cpp
217
fContext(pool->GetContext())
src/kits/media/RealtimeAlloc.cpp
156
FreeChunk::Remove(rtm_pool* pool, FreeChunk* previous)
src/kits/media/RealtimeAlloc.cpp
160
FreeChunk* chunk = pool->free_anchor.fNext;
src/kits/media/RealtimeAlloc.cpp
177
FreeChunk::Enqueue(rtm_pool* pool)
src/kits/media/RealtimeAlloc.cpp
179
FreeChunk* chunk = pool->free_anchor.fNext;
src/kits/media/RealtimeAlloc.cpp
180
FreeChunk* last = &pool->free_anchor;
src/kits/media/RealtimeAlloc.cpp
264
while (rtm_pool* pool = iterator.Next()) {
src/kits/media/RealtimeAlloc.cpp
265
if (pool->Contains(buffer))
src/kits/media/RealtimeAlloc.cpp
266
return pool;
src/kits/media/RealtimeAlloc.cpp
279
rtm_pool* pool = (rtm_pool*)malloc(sizeof(rtm_pool));
src/kits/media/RealtimeAlloc.cpp
280
if (pool == NULL)
src/kits/media/RealtimeAlloc.cpp
284
mutex_init_etc(&pool->lock, name, MUTEX_FLAG_CLONE_NAME);
src/kits/media/RealtimeAlloc.cpp
286
mutex_init(&pool->lock, "realtime pool");
src/kits/media/RealtimeAlloc.cpp
289
pool->max_size = (totalSize + sizeof(FreeChunk) - 1 + B_PAGE_SIZE)
src/kits/media/RealtimeAlloc.cpp
292
area_id area = create_area(name, &pool->heap_base, B_ANY_ADDRESS,
src/kits/media/RealtimeAlloc.cpp
293
pool->max_size, B_LAZY_LOCK, B_READ_AREA | B_WRITE_AREA);
src/kits/media/RealtimeAlloc.cpp
295
mutex_destroy(&pool->lock);
src/kits/media/RealtimeAlloc.cpp
296
free(pool);
src/kits/media/RealtimeAlloc.cpp
300
pool->area = area;
src/kits/media/RealtimeAlloc.cpp
301
pool->available = pool->max_size - FreeChunk::NextOffset();
src/kits/media/RealtimeAlloc.cpp
306
FreeChunk* chunk = (FreeChunk*)pool->heap_base;
src/kits/media/RealtimeAlloc.cpp
307
chunk->SetTo(pool->max_size, NULL);
src/kits/media/RealtimeAlloc.cpp
309
pool->free_anchor.SetTo(0, chunk);
src/kits/media/RealtimeAlloc.cpp
311
*_pool = pool;
src/kits/media/RealtimeAlloc.cpp
314
sPools.Add(pool);
src/kits/media/RealtimeAlloc.cpp
320
rtm_delete_pool(rtm_pool* pool)
src/kits/media/RealtimeAlloc.cpp
322
if (pool == NULL)
src/kits/media/RealtimeAlloc.cpp
325
mutex_lock(&pool->lock);
src/kits/media/RealtimeAlloc.cpp
329
sPools.Remove(pool);
src/kits/media/RealtimeAlloc.cpp
332
delete_area(pool->area);
src/kits/media/RealtimeAlloc.cpp
333
mutex_destroy(&pool->lock);
src/kits/media/RealtimeAlloc.cpp
334
free(pool);
src/kits/media/RealtimeAlloc.cpp
341
rtm_alloc(rtm_pool* pool, size_t size)
src/kits/media/RealtimeAlloc.cpp
343
if (pool == NULL)
src/kits/media/RealtimeAlloc.cpp
346
if (pool->heap_base == NULL || size == 0)
src/kits/media/RealtimeAlloc.cpp
349
MutexLocker _(&pool->lock);
src/kits/media/RealtimeAlloc.cpp
354
if (size > pool->available) {
src/kits/media/RealtimeAlloc.cpp
359
FreeChunk* chunk = pool->free_anchor.Next();
src/kits/media/RealtimeAlloc.cpp
360
FreeChunk* last = &pool->free_anchor;
src/kits/media/RealtimeAlloc.cpp
381
freeChunk->Remove(pool, last);
src/kits/media/RealtimeAlloc.cpp
382
freeChunk->Enqueue(pool);
src/kits/media/RealtimeAlloc.cpp
389
pool->available -= size + sizeof(size_t);
src/kits/media/RealtimeAlloc.cpp
405
rtm_pool* pool = pool_for(allocated);
src/kits/media/RealtimeAlloc.cpp
406
if (pool == NULL) {
src/kits/media/RealtimeAlloc.cpp
411
MutexLocker _(&pool->lock);
src/kits/media/RealtimeAlloc.cpp
412
pool->Free(allocated);
src/kits/media/RealtimeAlloc.cpp
428
rtm_pool* pool = pool_for(oldBuffer);
src/kits/media/RealtimeAlloc.cpp
429
if (pool == NULL) {
src/kits/media/RealtimeAlloc.cpp
438
MutexLocker _(&pool->lock);
src/kits/media/RealtimeAlloc.cpp
442
pool->Free(oldBuffer);
src/kits/media/RealtimeAlloc.cpp
46
void Remove(rtm_pool* pool,
src/kits/media/RealtimeAlloc.cpp
462
void* newBuffer = rtm_alloc(pool, newSize);
src/kits/media/RealtimeAlloc.cpp
468
pool->Free(oldBuffer);
src/kits/media/RealtimeAlloc.cpp
48
void Enqueue(rtm_pool* pool);
src/kits/media/RealtimeAlloc.cpp
502
rtm_available(rtm_pool* pool)
src/kits/media/RealtimeAlloc.cpp
504
if (pool == NULL) {
src/kits/media/RealtimeAlloc.cpp
509
return pool->available;
src/kits/media/RealtimeAlloc.cpp
526
void rtm_get_pool(rtm_pool *pool,void *data,int32 param3,int32 param4, ...);
src/kits/package/solver/libsolv/LibsolvSolver.cpp
62
SolvDataIterator(Pool* pool, Repo* repo, Id solvableId, Id keyname,
src/kits/package/solver/libsolv/LibsolvSolver.cpp
65
dataiterator_init(this, pool, repo, solvableId, keyname, match, flags);
src/libs/iconv/iconv.c
635
const char* pool;
src/libs/iconv/iconv.c
677
pool = stringpool;
src/libs/iconv/iconv.c
680
pool = stringpool2;
src/libs/iconv/iconv.c
714
return all_canonical[index] + pool;
src/libs/libsolv/ext/repo_haiku.cpp
117
Pool *pool = repo->pool;
src/libs/libsolv/ext/repo_haiku.cpp
120
Solvable *solvable = pool_id2solvable(pool, solvableId);
src/libs/libsolv/ext/repo_haiku.cpp
125
solvable->name = pool_str2id(pool, name, 1);
src/libs/libsolv/ext/repo_haiku.cpp
131
solvable->arch = pool_str2id(pool,
src/libs/libsolv/ext/repo_haiku.cpp
133
solvable->evr = pool_str2id(pool, packageInfo.Version().ToString(), 1);
src/libs/libsolv/ext/repo_haiku.cpp
134
solvable->vendor = pool_str2id(pool, packageInfo.Vendor(), 1);
src/libs/libsolv/ext/repo_haiku.cpp
135
repodata_set_str(repoData, solvable - pool->solvables, SOLVABLE_SUMMARY,
src/libs/libsolv/ext/repo_haiku.cpp
137
repodata_set_str(repoData, solvable - pool->solvables, SOLVABLE_DESCRIPTION,
src/libs/libsolv/ext/repo_haiku.cpp
139
repodata_set_str(repoData, solvable - pool->solvables, SOLVABLE_PACKAGER,
src/libs/libsolv/ext/repo_haiku.cpp
143
repodata_set_checksum(repoData, solvable - pool->solvables,
src/libs/libsolv/ext/repo_haiku.cpp
147
pool_rel2id(pool, solvable->name, solvable->evr, REL_EQ, 1), 0);
src/libs/libsolv/ext/repo_haiku.cpp
23
Pool *pool = repo->pool;
src/libs/libsolv/ext/repo_haiku.cpp
25
Id dependency = pool_str2id(pool, name, 1);
src/libs/libsolv/ext/repo_haiku.cpp
29
Id versionId = pool_str2id(pool, version, 1);
src/libs/libsolv/ext/repo_haiku.cpp
33
versionId = pool_rel2id(pool, versionId, pool_str2id(pool, compatVersion, 1),
src/libs/libsolv/ext/repo_haiku.cpp
37
dependency = pool_rel2id(pool, dependency, versionId, flags, 1);
src/libs/libsolv/ext/testcase.c
1010
Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
src/libs/libsolv/ext/testcase.c
1015
finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
src/libs/libsolv/ext/testcase.c
1031
repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
src/libs/libsolv/ext/testcase.c
1035
s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
src/libs/libsolv/ext/testcase.c
1044
Pool *pool = repo->pool;
src/libs/libsolv/ext/testcase.c
1107
finish_solvable(pool, data, s, filelist, nfilelist);
src/libs/libsolv/ext/testcase.c
1111
s = pool_id2solvable(pool, repo_add_solvable(repo));
src/libs/libsolv/ext/testcase.c
1112
s->name = pool_str2id(pool, sp[0], 1);
src/libs/libsolv/ext/testcase.c
1116
s->evr = makeevr(pool, sp[1]);
src/libs/libsolv/ext/testcase.c
1117
s->arch = pool_str2id(pool, sp[3], 1);
src/libs/libsolv/ext/testcase.c
1120
repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
src/libs/libsolv/ext/testcase.c
1123
s->vendor = pool_str2id(pool, line + 6, 1);
src/libs/libsolv/ext/testcase.c
1128
repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
src/libs/libsolv/ext/testcase.c
1153
s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
src/libs/libsolv/ext/testcase.c
1181
finish_solvable(pool, data, s, filelist, nfilelist);
src/libs/libsolv/ext/testcase.c
1191
testcase_getpoolflags(Pool *pool)
src/libs/libsolv/ext/testcase.c
1197
v = pool_get_flag(pool, poolflags2str[i].flag);
src/libs/libsolv/ext/testcase.c
1200
str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
src/libs/libsolv/ext/testcase.c
1206
testcase_setpoolflags(Pool *pool, const char *str)
src/libs/libsolv/ext/testcase.c
1230
pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
src/libs/libsolv/ext/testcase.c
1233
pool_set_flag(pool, poolflags2str[i].flag, v);
src/libs/libsolv/ext/testcase.c
1239
testcase_resetpoolflags(Pool *pool)
src/libs/libsolv/ext/testcase.c
1243
pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
src/libs/libsolv/ext/testcase.c
1249
Pool *pool = solv->pool;
src/libs/libsolv/ext/testcase.c
1257
str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
src/libs/libsolv/ext/testcase.c
1287
pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
src/libs/libsolv/ext/testcase.c
1320
s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
src/libs/libsolv/ext/testcase.c
1322
s = pool_tmpjoin(solv->pool, "!", s, 0);
src/libs/libsolv/ext/testcase.c
1331
s = pool_bin2hex(solv->pool, md5, md5l);
src/libs/libsolv/ext/testcase.c
1359
s = pool_bin2hex(solv->pool, md5, 4);
src/libs/libsolv/ext/testcase.c
1379
s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
src/libs/libsolv/ext/testcase.c
1389
s = pool_bin2hex(solv->pool, md5, 4);
src/libs/libsolv/ext/testcase.c
1413
Pool *pool = solv->pool;
src/libs/libsolv/ext/testcase.c
1435
if (pool->installed && pool->solvables[p].repo == pool->installed)
src/libs/libsolv/ext/testcase.c
1437
s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
src/libs/libsolv/ext/testcase.c
1439
s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
src/libs/libsolv/ext/testcase.c
1461
s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
src/libs/libsolv/ext/testcase.c
1472
s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
src/libs/libsolv/ext/testcase.c
1474
s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
src/libs/libsolv/ext/testcase.c
1477
s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
src/libs/libsolv/ext/testcase.c
1478
s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
src/libs/libsolv/ext/testcase.c
1481
s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
src/libs/libsolv/ext/testcase.c
1483
s = pool_tmpjoin(pool, solprefix, " unknown", 0);
src/libs/libsolv/ext/testcase.c
1500
s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
src/libs/libsolv/ext/testcase.c
1515
s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
src/libs/libsolv/ext/testcase.c
1520
s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
src/libs/libsolv/ext/testcase.c
1535
s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
src/libs/libsolv/ext/testcase.c
1551
Pool *pool = solv->pool;
src/libs/libsolv/ext/testcase.c
1568
pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
src/libs/libsolv/ext/testcase.c
1574
const char *name = testcase_repoid2str(pool, repoid);
src/libs/libsolv/ext/testcase.c
1580
out = pool_tmpjoin(pool, name, ".repo", ".gz");
src/libs/libsolv/ext/testcase.c
1581
cmd = pool_tmpjoin(pool, "repo ", name, " ");
src/libs/libsolv/ext/testcase.c
1582
cmd = pool_tmpappend(pool, cmd, priobuf, " ");
src/libs/libsolv/ext/testcase.c
1583
cmd = pool_tmpappend(pool, cmd, "testtags ", out);
src/libs/libsolv/ext/testcase.c
1585
out = pool_tmpjoin(pool, dir, "/", out);
src/libs/libsolv/ext/testcase.c
1588
pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
src/libs/libsolv/ext/testcase.c
1595
pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
src/libs/libsolv/ext/testcase.c
1602
arch = pool->solvables[SYSTEMSOLVABLE].arch;
src/libs/libsolv/ext/testcase.c
1603
for (i = 0; i < pool->lastarch; i++)
src/libs/libsolv/ext/testcase.c
1605
if (pool->id2arch[i] == 1 && !lowscore)
src/libs/libsolv/ext/testcase.c
1607
if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
src/libs/libsolv/ext/testcase.c
1610
lowscore = pool->id2arch[i];
src/libs/libsolv/ext/testcase.c
1613
cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
src/libs/libsolv/ext/testcase.c
1615
if (pool->disttype == disttype2str[i].type)
src/libs/libsolv/ext/testcase.c
1617
pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
src/libs/libsolv/ext/testcase.c
1618
if (pool->installed)
src/libs/libsolv/ext/testcase.c
1619
cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
src/libs/libsolv/ext/testcase.c
1621
s = testcase_getpoolflags(solv->pool);
src/libs/libsolv/ext/testcase.c
1624
cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
src/libs/libsolv/ext/testcase.c
1628
if (pool->vendorclasses)
src/libs/libsolv/ext/testcase.c
1631
for (i = 0; pool->vendorclasses[i]; i++)
src/libs/libsolv/ext/testcase.c
1633
cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
src/libs/libsolv/ext/testcase.c
1634
if (!pool->vendorclasses[i + 1])
src/libs/libsolv/ext/testcase.c
1646
cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
src/libs/libsolv/ext/testcase.c
1651
if (pool->nscallback)
src/libs/libsolv/ext/testcase.c
1655
for (rid = 1; rid < pool->nrels; rid++)
src/libs/libsolv/ext/testcase.c
1657
Reldep *rd = pool->rels + rid;
src/libs/libsolv/ext/testcase.c
1661
d = pool_whatprovides(pool, MAKERELDEP(rid));
src/libs/libsolv/ext/testcase.c
1662
if (!d || !pool->whatprovidesdata[d])
src/libs/libsolv/ext/testcase.c
1664
cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
src/libs/libsolv/ext/testcase.c
1665
cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
src/libs/libsolv/ext/testcase.c
1666
for (; pool->whatprovidesdata[d]; d++)
src/libs/libsolv/ext/testcase.c
1667
cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
src/libs/libsolv/ext/testcase.c
1674
cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
src/libs/libsolv/ext/testcase.c
1675
cmd = pool_tmpjoin(pool, "job ", cmd, 0);
src/libs/libsolv/ext/testcase.c
1685
cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
src/libs/libsolv/ext/testcase.c
1686
cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
src/libs/libsolv/ext/testcase.c
1687
cmd = pool_tmpappend(pool, cmd, " ", resultname);
src/libs/libsolv/ext/testcase.c
1698
cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
src/libs/libsolv/ext/testcase.c
1705
out = pool_tmpjoin(pool, dir, "/", resultname);
src/libs/libsolv/ext/testcase.c
1708
pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
src/libs/libsolv/ext/testcase.c
1715
pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
src/libs/libsolv/ext/testcase.c
1722
pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
src/libs/libsolv/ext/testcase.c
1731
out = pool_tmpjoin(pool, dir, "/", testcasename);
src/libs/libsolv/ext/testcase.c
1734
pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
src/libs/libsolv/ext/testcase.c
1740
pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
src/libs/libsolv/ext/testcase.c
1746
pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
src/libs/libsolv/ext/testcase.c
1839
str2resultflags(Pool *pool, char *s) /* modifies the string! */
src/libs/libsolv/ext/testcase.c
1854
pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
src/libs/libsolv/ext/testcase.c
1861
testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
src/libs/libsolv/ext/testcase.c
1876
pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
src/libs/libsolv/ext/testcase.c
1931
Repo *repo = repo_create(pool, pieces[1]);
src/libs/libsolv/ext/testcase.c
1940
testcase_resetpoolflags(pool); /* hmm */
src/libs/libsolv/ext/testcase.c
1951
const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
src/libs/libsolv/ext/testcase.c
1960
rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
src/libs/libsolv/ext/testcase.c
1965
pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
src/libs/libsolv/ext/testcase.c
1987
pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
src/libs/libsolv/ext/testcase.c
2000
pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown disttype '%s'\n", pieces[2]);
src/libs/libsolv/ext/testcase.c
2001
else if (pool->disttype != disttype2str[i].type)
src/libs/libsolv/ext/testcase.c
2004
pool_setdisttype(pool, disttype2str[i].type);
src/libs/libsolv/ext/testcase.c
2006
pool_debug(pool, SOLV_ERROR, "testcase_read: system: cannot change disttype to '%s'\n", pieces[2]);
src/libs/libsolv/ext/testcase.c
2010
pool_setarch(pool, pieces[1]);
src/libs/libsolv/ext/testcase.c
2012
pool_setarch(pool, 0);
src/libs/libsolv/ext/testcase.c
2015
Repo *repo = testcase_str2repo(pool, pieces[3]);
src/libs/libsolv/ext/testcase.c
2017
pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
src/libs/libsolv/ext/testcase.c
2019
pool_set_installed(pool, repo);
src/libs/libsolv/ext/testcase.c
2028
pool_addfileprovides(pool);
src/libs/libsolv/ext/testcase.c
2029
pool_createwhatprovides(pool);
src/libs/libsolv/ext/testcase.c
2034
addselectionjob(pool, pieces + 1, npieces - 1, job);
src/libs/libsolv/ext/testcase.c
2041
how = testcase_str2job(pool, pieces[1], &what);
src/libs/libsolv/ext/testcase.c
2047
pool_addvendorclass(pool, (const char **)(pieces + 1));
src/libs/libsolv/ext/testcase.c
2055
pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
src/libs/libsolv/ext/testcase.c
2064
name = pool_str2id(pool, pieces[1], 1);
src/libs/libsolv/ext/testcase.c
2065
evr = pool_str2id(pool, s + 1, 1);
src/libs/libsolv/ext/testcase.c
2068
id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
src/libs/libsolv/ext/testcase.c
2070
queue_push(&q, testcase_str2solvid(pool, pieces[i]));
src/libs/libsolv/ext/testcase.c
2074
pool_addfileprovides(pool);
src/libs/libsolv/ext/testcase.c
2075
pool_createwhatprovides(pool);
src/libs/libsolv/ext/testcase.c
2078
pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
src/libs/libsolv/ext/testcase.c
2088
testcase_resetpoolflags(pool); /* hmm */
src/libs/libsolv/ext/testcase.c
2091
testcase_setpoolflags(pool, pieces[i]);
src/libs/libsolv/ext/testcase.c
2098
solv = solver_create(pool);
src/libs/libsolv/ext/testcase.c
2107
int resultflags = str2resultflags(pool, pieces[1]);
src/libs/libsolv/ext/testcase.c
2108
const char *rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
src/libs/libsolv/ext/testcase.c
2115
pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
src/libs/libsolv/ext/testcase.c
2135
pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
src/libs/libsolv/ext/testcase.c
2143
pool_addfileprovides(pool);
src/libs/libsolv/ext/testcase.c
2144
pool_createwhatprovides(pool);
src/libs/libsolv/ext/testcase.c
2148
solv = solver_create(pool);
src/libs/libsolv/ext/testcase.c
275
pool_isknownarch(Pool *pool, Id id)
src/libs/libsolv/ext/testcase.c
281
if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
src/libs/libsolv/ext/testcase.c
287
testcase_str2dep(Pool *pool, char *s)
src/libs/libsolv/ext/testcase.c
295
id = testcase_str2dep(pool, n + 1);
src/libs/libsolv/ext/testcase.c
297
id = pool_rel2id(pool, testcase_str2dep(pool, s), id, REL_OR, 1);
src/libs/libsolv/ext/testcase.c
316
Id archid = pool_strn2id(pool, a + 1, s - (a + 1), 0);
src/libs/libsolv/ext/testcase.c
317
if (pool_isknownarch(pool, archid))
src/libs/libsolv/ext/testcase.c
319
id = pool_strn2id(pool, n, a - n, 1);
src/libs/libsolv/ext/testcase.c
320
id = pool_rel2id(pool, id, archid, REL_ARCH, 1);
src/libs/libsolv/ext/testcase.c
323
id = pool_strn2id(pool, n, s - n, 1);
src/libs/libsolv/ext/testcase.c
326
id = pool_strn2id(pool, n, s - n, 1);
src/libs/libsolv/ext/testcase.c
350
return pool_rel2id(pool, id, pool_strn2id(pool, n, s - n, 1), flags, 1);
src/libs/libsolv/ext/testcase.c
354
testcase_repoid2str(Pool *pool, Id repoid)
src/libs/libsolv/ext/testcase.c
356
Repo *repo = pool_id2repo(pool, repoid);
src/libs/libsolv/ext/testcase.c
359
char *r = pool_tmpjoin(pool, repo->name, 0, 0);
src/libs/libsolv/ext/testcase.c
370
return pool_tmpjoin(pool, buf, 0, 0);
src/libs/libsolv/ext/testcase.c
375
testcase_solvid2str(Pool *pool, Id p)
src/libs/libsolv/ext/testcase.c
377
Solvable *s = pool->solvables + p;
src/libs/libsolv/ext/testcase.c
383
n = pool_id2str(pool, s->name);
src/libs/libsolv/ext/testcase.c
384
e = pool_id2str(pool, s->evr);
src/libs/libsolv/ext/testcase.c
385
a = pool_id2str(pool, s->arch);
src/libs/libsolv/ext/testcase.c
386
str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
src/libs/libsolv/ext/testcase.c
389
return pool_tmpappend(pool, str, "@", 0);
src/libs/libsolv/ext/testcase.c
393
char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
src/libs/libsolv/ext/testcase.c
400
return pool_tmpappend(pool, str, buf, 0);
src/libs/libsolv/ext/testcase.c
404
testcase_str2repo(Pool *pool, const char *str)
src/libs/libsolv/ext/testcase.c
414
if (!str[j] && repoid > 0 && repoid < pool->nrepos)
src/libs/libsolv/ext/testcase.c
415
repo = pool_id2repo(pool, repoid);
src/libs/libsolv/ext/testcase.c
436
if (repoid >= pool->nrepos)
src/libs/libsolv/ext/testcase.c
443
testcase_str2solvid(Pool *pool, const char *str)
src/libs/libsolv/ext/testcase.c
456
if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
src/libs/libsolv/ext/testcase.c
466
arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
src/libs/libsolv/ext/testcase.c
477
nid = pool_strn2id(pool, str, i, 0);
src/libs/libsolv/ext/testcase.c
480
evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
src/libs/libsolv/ext/testcase.c
485
Solvable *s = pool->solvables + p;
src/libs/libsolv/ext/testcase.c
500
testcase_job2str(Pool *pool, Id how, Id what)
src/libs/libsolv/ext/testcase.c
516
pkgstr = testcase_solvid2str(pool, what);
src/libs/libsolv/ext/testcase.c
521
pkgstr = pool_dep2str(pool, what);
src/libs/libsolv/ext/testcase.c
526
pkgstr = pool_dep2str(pool, what);
src/libs/libsolv/ext/testcase.c
533
while ((p = pool->whatprovidesdata[what++]) != 0)
src/libs/libsolv/ext/testcase.c
535
const char *s = testcase_solvid2str(pool, p);
src/libs/libsolv/ext/testcase.c
538
pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
src/libs/libsolv/ext/testcase.c
539
pool_freetmpspace(pool, s);
src/libs/libsolv/ext/testcase.c
549
Repo *repo = pool_id2repo(pool, what);
src/libs/libsolv/ext/testcase.c
555
pkgstr = pool_tmpjoin(pool, buf, 0, 0);
src/libs/libsolv/ext/testcase.c
558
pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
src/libs/libsolv/ext/testcase.c
570
ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
src/libs/libsolv/ext/testcase.c
572
ret = pool_tmpappend(pool, ret, " ", 0);
src/libs/libsolv/ext/testcase.c
575
ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
src/libs/libsolv/ext/testcase.c
581
ret = pool_tmpappend(pool, ret, "]", 0);
src/libs/libsolv/ext/testcase.c
587
str2selflags(Pool *pool, char *s) /* modifies the string! */
src/libs/libsolv/ext/testcase.c
602
pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
src/libs/libsolv/ext/testcase.c
609
str2jobflags(Pool *pool, char *s) /* modifies the string */
src/libs/libsolv/ext/testcase.c
624
pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
src/libs/libsolv/ext/testcase.c
631
testcase_str2job(Pool *pool, const char *str, Id *whatp)
src/libs/libsolv/ext/testcase.c
642
s = pool_tmpjoin(pool, str, 0, 0);
src/libs/libsolv/ext/testcase.c
659
pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
src/libs/libsolv/ext/testcase.c
669
pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
src/libs/libsolv/ext/testcase.c
683
job |= str2jobflags(pool, flags);
src/libs/libsolv/ext/testcase.c
690
pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
src/libs/libsolv/ext/testcase.c
695
what = testcase_str2solvid(pool, pieces[2]);
src/libs/libsolv/ext/testcase.c
698
pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
src/libs/libsolv/ext/testcase.c
721
what = testcase_str2dep(pool, spe + 1);
src/libs/libsolv/ext/testcase.c
724
what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
src/libs/libsolv/ext/testcase.c
728
what = testcase_str2dep(pool, pieces[2]);
src/libs/libsolv/ext/testcase.c
743
Id p = testcase_str2solvid(pool, pieces[i]);
src/libs/libsolv/ext/testcase.c
746
pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
src/libs/libsolv/ext/testcase.c
754
what = pool_queuetowhatprovides(pool, &q);
src/libs/libsolv/ext/testcase.c
762
pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
src/libs/libsolv/ext/testcase.c
766
repo = testcase_str2repo(pool, pieces[2]);
src/libs/libsolv/ext/testcase.c
769
pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
src/libs/libsolv/ext/testcase.c
780
pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
src/libs/libsolv/ext/testcase.c
789
pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
src/libs/libsolv/ext/testcase.c
799
addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
src/libs/libsolv/ext/testcase.c
811
pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
src/libs/libsolv/ext/testcase.c
823
job |= str2jobflags(pool, flags);
src/libs/libsolv/ext/testcase.c
828
pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
src/libs/libsolv/ext/testcase.c
831
selflags = str2selflags(pool, pieces[3]);
src/libs/libsolv/ext/testcase.c
833
r = selection_make(pool, &sel, pieces[2], selflags);
src/libs/libsolv/ext/testcase.c
843
Pool *pool = repo->pool;
src/libs/libsolv/ext/testcase.c
867
idstr = pool_dep2str(pool, id);
src/libs/libsolv/ext/testcase.c
870
Reldep *rd = GETRELDEP(pool, id);
src/libs/libsolv/ext/testcase.c
894
Reldep *mrd = GETRELDEP(pool, rd->evr);
src/libs/libsolv/ext/testcase.c
897
idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
src/libs/libsolv/ext/testcase.c
898
idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
src/libs/libsolv/ext/testcase.c
906
idstr = pool_dep2str(pool, rd->evr);
src/libs/libsolv/ext/testcase.c
912
rd = GETRELDEP(pool, id);
src/libs/libsolv/ext/testcase.c
915
idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
src/libs/libsolv/ext/testcase.c
917
idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
src/libs/libsolv/ext/testcase.c
918
idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
src/libs/libsolv/ext/testcase.c
936
dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
src/libs/libsolv/ext/testcase.c
942
Id id = pool_str2id(pool, s, 0);
src/libs/libsolv/ext/testcase.c
967
Pool *pool = repo->pool;
src/libs/libsolv/ext/testcase.c
980
name = pool_id2str(pool, s->name);
src/libs/libsolv/ext/testcase.c
981
evr = pool_id2str(pool, s->evr);
src/libs/libsolv/ext/testcase.c
982
arch = pool_id2str(pool, s->arch);
src/libs/libsolv/ext/testcase.c
999
fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
src/libs/libsolv/ext/testcase.h
18
extern Id testcase_str2dep(Pool *pool, char *s);
src/libs/libsolv/ext/testcase.h
19
extern const char *testcase_repoid2str(Pool *pool, Id repoid);
src/libs/libsolv/ext/testcase.h
20
extern const char *testcase_solvid2str(Pool *pool, Id p);
src/libs/libsolv/ext/testcase.h
21
extern Repo *testcase_str2repo(Pool *pool, const char *str);
src/libs/libsolv/ext/testcase.h
22
extern Id testcase_str2solvid(Pool *pool, const char *str);
src/libs/libsolv/ext/testcase.h
23
extern const char *testcase_job2str(Pool *pool, Id how, Id what);
src/libs/libsolv/ext/testcase.h
24
extern Id testcase_str2job(Pool *pool, const char *str, Id *whatp);
src/libs/libsolv/ext/testcase.h
32
extern Solver *testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp);
src/libs/libsolv/ext/tools_util.h
17
makeevr(Pool *pool, const char *s)
src/libs/libsolv/ext/tools_util.h
21
return pool_str2id(pool, s, 1);
src/libs/libsolv/solv/dataiterator.h
104
Pool *pool;
src/libs/libsolv/solv/dataiterator.h
162
int dataiterator_init(Dataiterator *di, Pool *pool, struct _Repo *repo, Id p, Id keyname, const char *match, int flags);
src/libs/libsolv/solv/evr.c
312
# define solv_vercmp (*(pool->disttype == DISTTYPE_DEB ? &solv_vercmp_deb : \
src/libs/libsolv/solv/evr.c
313
pool->disttype == DISTTYPE_HAIKU ? solv_vercmp_haiku : \
src/libs/libsolv/solv/evr.c
327
pool_evrcmp_str(const Pool *pool, const char *evr1, const char *evr2, int mode)
src/libs/libsolv/solv/evr.c
369
if (!pool->promoteepoch)
src/libs/libsolv/solv/evr.c
423
if (pool->havedistepoch)
src/libs/libsolv/solv/evr.c
452
pool_evrcmp(const Pool *pool, Id evr1id, Id evr2id, int mode)
src/libs/libsolv/solv/evr.c
457
evr1 = pool_id2str(pool, evr1id);
src/libs/libsolv/solv/evr.c
458
evr2 = pool_id2str(pool, evr2id);
src/libs/libsolv/solv/evr.c
459
return pool_evrcmp_str(pool, evr1, evr2, mode);
src/libs/libsolv/solv/evr.c
463
pool_evrmatch(const Pool *pool, Id evrid, const char *epoch, const char *version, const char *release)
src/libs/libsolv/solv/evr.c
470
evr1 = pool_id2str(pool, evrid);
src/libs/libsolv/solv/evr.h
29
extern int pool_evrcmp_str(const Pool *pool, const char *evr1, const char *evr2, int mode);
src/libs/libsolv/solv/evr.h
30
extern int pool_evrcmp(const Pool *pool, Id evr1id, Id evr2id, int mode);
src/libs/libsolv/solv/evr.h
31
extern int pool_evrmatch(const Pool *pool, Id evrid, const char *epoch, const char *version, const char *release);
src/libs/libsolv/solv/policy.c
102
s = pool->solvables + plist->elements[i];
src/libs/libsolv/solv/policy.c
103
if (s->repo->priority == bestprio || (pool->installed && s->repo == pool->installed))
src/libs/libsolv/solv/policy.c
110
prune_to_highest_prio_per_name(Pool *pool, Queue *plist)
src/libs/libsolv/solv/policy.c
117
solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
src/libs/libsolv/solv/policy.c
119
name = pool->solvables[pq.elements[0]].name;
src/libs/libsolv/solv/policy.c
122
if (pool->solvables[plist->elements[i]].name != name)
src/libs/libsolv/solv/policy.c
125
prune_to_highest_prio(pool, &pq);
src/libs/libsolv/solv/policy.c
130
name = pool->solvables[pq.elements[0]].name;
src/libs/libsolv/solv/policy.c
134
prune_to_highest_prio(pool, &pq);
src/libs/libsolv/solv/policy.c
150
Pool *pool = solv->pool;
src/libs/libsolv/solv/policy.c
156
if (pool->installed)
src/libs/libsolv/solv/policy.c
161
s = pool->solvables + p;
src/libs/libsolv/solv/policy.c
162
if (pool->installed && s->repo == pool->installed)
src/libs/libsolv/solv/policy.c
181
s = pool->solvables + p;
src/libs/libsolv/solv/policy.c
203
s = pool->solvables + p;
src/libs/libsolv/solv/policy.c
204
if (pool->installed && s->repo == pool->installed)
src/libs/libsolv/solv/policy.c
218
s = pool->solvables + plist->elements[k];
src/libs/libsolv/solv/policy.c
219
if (pool->installed && s->repo == pool->installed)
src/libs/libsolv/solv/policy.c
237
s = pool->solvables + p;
src/libs/libsolv/solv/policy.c
238
if (pool->installed && s->repo == pool->installed)
src/libs/libsolv/solv/policy.c
252
s = pool->solvables + plist->elements[k];
src/libs/libsolv/solv/policy.c
253
if (pool->installed && s->repo == pool->installed)
src/libs/libsolv/solv/policy.c
264
prune_to_best_arch(const Pool *pool, Queue *plist)
src/libs/libsolv/solv/policy.c
270
if (!pool->id2arch || plist->count < 2)
src/libs/libsolv/solv/policy.c
275
s = pool->solvables + plist->elements[i];
src/libs/libsolv/solv/policy.c
277
a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
src/libs/libsolv/solv/policy.c
285
s = pool->solvables + plist->elements[i];
src/libs/libsolv/solv/policy.c
287
if (a > pool->lastarch)
src/libs/libsolv/solv/policy.c
289
a = pool->id2arch[a];
src/libs/libsolv/solv/policy.c
301
Pool *pool;
src/libs/libsolv/solv/policy.c
315
Pool *pool = trj->pool;
src/libs/libsolv/solv/policy.c
325
s = pool->solvables + plist->elements[node];
src/libs/libsolv/solv/policy.c
333
Solvable *ps = pool->solvables + p;
src/libs/libsolv/solv/policy.c
336
if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
src/libs/libsolv/solv/policy.c
338
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
src/libs/libsolv/solv/policy.c
36
Pool *pool = dp;
src/libs/libsolv/solv/policy.c
397
prune_obsoleted(Pool *pool, Queue *plist)
src/libs/libsolv/solv/policy.c
411
trj.pool = pool;
src/libs/libsolv/solv/policy.c
42
sa = pool->solvables + a;
src/libs/libsolv/solv/policy.c
420
s = pool->solvables + plist->elements[i];
src/libs/libsolv/solv/policy.c
43
sb = pool->solvables + b;
src/libs/libsolv/solv/policy.c
443
prune_obsoleted_2(Pool *pool, Queue *plist)
src/libs/libsolv/solv/policy.c
453
s = pool->solvables + plist->elements[i];
src/libs/libsolv/solv/policy.c
465
ps = pool->solvables + p;
src/libs/libsolv/solv/policy.c
468
if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
src/libs/libsolv/solv/policy.c
470
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
src/libs/libsolv/solv/policy.c
492
move_installed_to_front(Pool *pool, Queue *plist)
src/libs/libsolv/solv/policy.c
50
na = pool_id2str(pool, sa->name);
src/libs/libsolv/solv/policy.c
500
s = pool->solvables + plist->elements[i];
src/libs/libsolv/solv/policy.c
501
if (s->repo != pool->installed)
src/libs/libsolv/solv/policy.c
505
Solvable *ps = pool->solvables + p;
src/libs/libsolv/solv/policy.c
506
if (s->name == ps->name && ps->repo == pool->installed)
src/libs/libsolv/solv/policy.c
51
nb = pool_id2str(pool, sb->name);
src/libs/libsolv/solv/policy.c
513
if (s->repo == pool->installed)
src/libs/libsolv/solv/policy.c
538
prune_to_best_version(Pool *pool, Queue *plist)
src/libs/libsolv/solv/policy.c
548
solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
src/libs/libsolv/solv/policy.c
55
if (pool->installed)
src/libs/libsolv/solv/policy.c
554
s = pool->solvables + plist->elements[i];
src/libs/libsolv/solv/policy.c
557
pool_solvable2str(pool, s),
src/libs/libsolv/solv/policy.c
558
(pool->installed && s->repo == pool->installed) ? "installed" : "not installed");
src/libs/libsolv/solv/policy.c
569
plist->elements[j++] = best - pool->solvables; /* move old best to front */
src/libs/libsolv/solv/policy.c
57
if (sa->repo == pool->installed)
src/libs/libsolv/solv/policy.c
576
if (pool_evrcmp(pool, best->evr, s->evr, EVRCMP_COMPARE) < 0)
src/libs/libsolv/solv/policy.c
580
plist->elements[j++] = best - pool->solvables; /* finish last group */
src/libs/libsolv/solv/policy.c
588
prune_obsoleted_2(pool, plist);
src/libs/libsolv/solv/policy.c
59
if (sb->repo != pool->installed)
src/libs/libsolv/solv/policy.c
590
prune_obsoleted(pool, plist);
src/libs/libsolv/solv/policy.c
592
if (plist->count > 1 && pool->installed)
src/libs/libsolv/solv/policy.c
593
move_installed_to_front(pool, plist);
src/libs/libsolv/solv/policy.c
602
prune_best_arch_name_version(const Solver *solv, Pool *pool, Queue *plist)
src/libs/libsolv/solv/policy.c
605
prune_to_best_arch(pool, plist);
src/libs/libsolv/solv/policy.c
607
prune_to_best_version(pool, plist);
src/libs/libsolv/solv/policy.c
615
Pool *pool = solv->pool;
src/libs/libsolv/solv/policy.c
62
else if (sb->repo == pool->installed)
src/libs/libsolv/solv/policy.c
621
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/policy.c
622
if (s->repo == pool->installed && (solv->dupmap_all || (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))))
src/libs/libsolv/solv/policy.c
626
Solvable *s2 = pool->solvables + plist->elements[k];
src/libs/libsolv/solv/policy.c
627
if (s2->repo != pool->installed && solvable_identical(s, s2))
src/libs/libsolv/solv/policy.c
647
Pool *pool = solv->pool;
src/libs/libsolv/solv/policy.c
651
prune_to_highest_prio(pool, plist);
src/libs/libsolv/solv/policy.c
653
prune_to_highest_prio_per_name(pool, plist);
src/libs/libsolv/solv/policy.c
656
if (plist->count > 1 && pool->installed && (solv->dupmap_all || solv->dupinvolvedmap.size))
src/libs/libsolv/solv/policy.c
661
prune_best_arch_name_version(solv, pool, plist);
src/libs/libsolv/solv/policy.c
670
Pool *pool = solv->pool;
src/libs/libsolv/solv/policy.c
674
if (a1 == a2 || a1 == pool->noarchid || a2 == pool->noarchid)
src/libs/libsolv/solv/policy.c
676
if (!pool->id2arch)
src/libs/libsolv/solv/policy.c
678
a1 = a1 <= pool->lastarch ? pool->id2arch[a1] : 0;
src/libs/libsolv/solv/policy.c
679
a2 = a2 <= pool->lastarch ? pool->id2arch[a2] : 0;
src/libs/libsolv/solv/policy.c
690
Pool *pool = solv->pool;
src/libs/libsolv/solv/policy.c
694
if (pool->custom_vendorcheck)
src/libs/libsolv/solv/policy.c
695
return pool->custom_vendorcheck(pool, s1, s2);
src/libs/libsolv/solv/policy.c
702
vendormask1 = pool_vendor2mask(pool, v1);
src/libs/libsolv/solv/policy.c
705
vendormask2 = pool_vendor2mask(pool, v2);
src/libs/libsolv/solv/policy.c
717
Pool *pool = solv->pool;
src/libs/libsolv/solv/policy.c
722
if (is->name == s->name && pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE) > 0)
src/libs/libsolv/solv/policy.c
754
Pool *pool = solv->pool;
src/libs/libsolv/solv/policy.c
766
for (i = 1; i < pool->nsolvables; i++)
src/libs/libsolv/solv/policy.c
768
s = pool->solvables + i;
src/libs/libsolv/solv/policy.c
771
if (!pool_installable(pool, s))
src/libs/libsolv/solv/policy.c
778
Solvable *ps = pool->solvables + p;;
src/libs/libsolv/solv/policy.c
783
if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
src/libs/libsolv/solv/policy.c
785
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
src/libs/libsolv/solv/policy.c
80
prune_to_highest_prio(Pool *pool, Queue *plist)
src/libs/libsolv/solv/policy.c
800
for (i = pool->nsolvables - 1; i > 0; i--)
src/libs/libsolv/solv/policy.c
802
s = pool->solvables + i;
src/libs/libsolv/solv/policy.c
805
if (!pool_installable(pool, s))
src/libs/libsolv/solv/policy.c
812
Solvable *ps = pool->solvables + p;;
src/libs/libsolv/solv/policy.c
817
if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
src/libs/libsolv/solv/policy.c
819
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
src/libs/libsolv/solv/policy.c
842
Pool *pool = solv->pool;
src/libs/libsolv/solv/policy.c
861
n = s - pool->solvables;
src/libs/libsolv/solv/policy.c
871
ps = pool->solvables + p;
src/libs/libsolv/solv/policy.c
874
if (!allowdowngrade && pool_evrcmp(pool, s->evr, ps->evr, EVRCMP_COMPARE) > 0)
src/libs/libsolv/solv/policy.c
886
Solvable *ps2 = pool->solvables + p2;
src/libs/libsolv/solv/policy.c
887
if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps2, obs))
src/libs/libsolv/solv/policy.c
889
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps2))
src/libs/libsolv/solv/policy.c
89
s = pool->solvables + plist->elements[i];
src/libs/libsolv/solv/policy.c
90
if (pool->installed && s->repo == pool->installed)
src/libs/libsolv/solv/policy.c
923
ps = pool->solvables + p;
src/libs/libsolv/solv/pool.c
100
pool_freewhatprovides(pool);
src/libs/libsolv/solv/pool.c
101
pool_freeidhashes(pool);
src/libs/libsolv/solv/pool.c
1011
pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
src/libs/libsolv/solv/pool.c
102
pool_freeallrepos(pool, 1);
src/libs/libsolv/solv/pool.c
1023
sid = pool->ss.nstrings + GETRELID(dep);
src/libs/libsolv/solv/pool.c
103
solv_free(pool->id2arch);
src/libs/libsolv/solv/pool.c
1030
rd = GETRELDEP(pool, dep);
src/libs/libsolv/solv/pool.c
104
solv_free(pool->id2color);
src/libs/libsolv/solv/pool.c
105
solv_free(pool->solvables);
src/libs/libsolv/solv/pool.c
1057
pool_addfileprovides_dep(pool, ids, csf, isf);
src/libs/libsolv/solv/pool.c
106
stringpool_free(&pool->ss);
src/libs/libsolv/solv/pool.c
1066
s = pool_id2str(pool, dep);
src/libs/libsolv/solv/pool.c
107
solv_free(pool->rels);
src/libs/libsolv/solv/pool.c
108
pool_setvendorclasses(pool, 0);
src/libs/libsolv/solv/pool.c
109
queue_free(&pool->vendormap);
src/libs/libsolv/solv/pool.c
110
queue_free(&pool->pooljobs);
src/libs/libsolv/solv/pool.c
112
solv_free(pool->tmpspace.buf[i]);
src/libs/libsolv/solv/pool.c
113
for (i = 0; i < pool->nlanguages; i++)
src/libs/libsolv/solv/pool.c
1136
pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
src/libs/libsolv/solv/pool.c
114
free((char *)pool->languages[i]);
src/libs/libsolv/solv/pool.c
1147
if (!pool->urepos)
src/libs/libsolv/solv/pool.c
115
solv_free(pool->languages);
src/libs/libsolv/solv/pool.c
1155
map_init(&cbd->providedids, pool->ss.nstrings);
src/libs/libsolv/solv/pool.c
1158
repo = repoonly ? repoonly : pool->repos[repoid];
src/libs/libsolv/solv/pool.c
1159
map_init(&donemap, pool->nsolvables);
src/libs/libsolv/solv/pool.c
116
solv_free(pool->languagecache);
src/libs/libsolv/solv/pool.c
1166
if (repoonly || ++repoid == pool->nrepos)
src/libs/libsolv/solv/pool.c
1168
repo = pool->repos[repoid];
src/libs/libsolv/solv/pool.c
117
solv_free(pool->errstr);
src/libs/libsolv/solv/pool.c
118
solv_free(pool->rootdir);
src/libs/libsolv/solv/pool.c
119
solv_free(pool);
src/libs/libsolv/solv/pool.c
1191
if (pool->solvables[p].repo == repo)
src/libs/libsolv/solv/pool.c
1222
if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
src/libs/libsolv/solv/pool.c
1223
printf("need complete filelist because of %s\n", pool_id2str(pool, cbd->ids[i]));
src/libs/libsolv/solv/pool.c
1226
if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
src/libs/libsolv/solv/pool.c
123
pool_freeallrepos(Pool *pool, int reuseids)
src/libs/libsolv/solv/pool.c
1236
if (pool->solvables[p].repo == repo)
src/libs/libsolv/solv/pool.c
1250
if (repoonly || ++repoid == pool->nrepos)
src/libs/libsolv/solv/pool.c
1252
repo = pool->repos[repoid];
src/libs/libsolv/solv/pool.c
1260
pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst)
src/libs/libsolv/solv/pool.c
1269
installed = pool->installed;
src/libs/libsolv/solv/pool.c
127
pool_freewhatprovides(pool);
src/libs/libsolv/solv/pool.c
1272
map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
src/libs/libsolv/solv/pool.c
1274
map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
src/libs/libsolv/solv/pool.c
128
for (i = 1; i < pool->nrepos; i++)
src/libs/libsolv/solv/pool.c
1281
for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
src/libs/libsolv/solv/pool.c
1287
pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
src/libs/libsolv/solv/pool.c
1289
pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
src/libs/libsolv/solv/pool.c
129
if (pool->repos[i])
src/libs/libsolv/solv/pool.c
1291
pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
src/libs/libsolv/solv/pool.c
1293
pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
src/libs/libsolv/solv/pool.c
1295
pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
src/libs/libsolv/solv/pool.c
1297
pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
src/libs/libsolv/solv/pool.c
1299
pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
src/libs/libsolv/solv/pool.c
130
repo_freedata(pool->repos[i]);
src/libs/libsolv/solv/pool.c
1309
POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in filelist\n", pool_id2str(pool, sf.ids[i]));
src/libs/libsolv/solv/pool.c
131
pool->repos = solv_free(pool->repos);
src/libs/libsolv/solv/pool.c
1311
pool_addfileprovides_search(pool, &cbd, &sf, 0);
src/libs/libsolv/solv/pool.c
132
pool->nrepos = 0;
src/libs/libsolv/solv/pool.c
133
pool->urepos = 0;
src/libs/libsolv/solv/pool.c
1331
POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in installed filelist\n", pool_id2str(pool, isf.ids[i]));
src/libs/libsolv/solv/pool.c
1334
pool_addfileprovides_search(pool, &cbd, &isf, installed);
src/libs/libsolv/solv/pool.c
1348
pool_freewhatprovides(pool); /* as we have added provides */
src/libs/libsolv/solv/pool.c
135
pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
src/libs/libsolv/solv/pool.c
1353
pool_addfileprovides(Pool *pool)
src/libs/libsolv/solv/pool.c
1355
pool_addfileprovides_queue(pool, 0, 0);
src/libs/libsolv/solv/pool.c
1359
pool_search(Pool *pool, Id p, Id key, const char *match, int flags, int (*callback)(void *cbdata, Solvable *s, struct _Repodata *data, struct _Repokey *key, struct _KeyValue *kv), void *cbdata)
src/libs/libsolv/solv/pool.c
1363
if (pool->solvables[p].repo)
src/libs/libsolv/solv/pool.c
1364
repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
src/libs/libsolv/solv/pool.c
1368
for (p = 1; p < pool->nsolvables; p++)
src/libs/libsolv/solv/pool.c
1369
if (pool->solvables[p].repo)
src/libs/libsolv/solv/pool.c
1370
repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
src/libs/libsolv/solv/pool.c
1374
pool_clear_pos(Pool *pool)
src/libs/libsolv/solv/pool.c
1376
memset(&pool->pos, 0, sizeof(pool->pos));
src/libs/libsolv/solv/pool.c
1381
pool_set_languages(Pool *pool, const char **languages, int nlanguages)
src/libs/libsolv/solv/pool.c
1385
pool->languagecache = solv_free(pool->languagecache);
src/libs/libsolv/solv/pool.c
1386
pool->languagecacheother = 0;
src/libs/libsolv/solv/pool.c
1387
if (pool->nlanguages)
src/libs/libsolv/solv/pool.c
1389
for (i = 0; i < pool->nlanguages; i++)
src/libs/libsolv/solv/pool.c
1390
free((char *)pool->languages[i]);
src/libs/libsolv/solv/pool.c
1391
free(pool->languages);
src/libs/libsolv/solv/pool.c
1393
pool->nlanguages = nlanguages;
src/libs/libsolv/solv/pool.c
1396
pool->languages = solv_calloc(nlanguages, sizeof(const char **));
src/libs/libsolv/solv/pool.c
1397
for (i = 0; i < pool->nlanguages; i++)
src/libs/libsolv/solv/pool.c
1398
pool->languages[i] = solv_strdup(languages[i]);
src/libs/libsolv/solv/pool.c
140
pool_setdisttype(Pool *pool, int disttype)
src/libs/libsolv/solv/pool.c
1402
pool_id2langid(Pool *pool, Id id, const char *lang, int create)
src/libs/libsolv/solv/pool.c
1410
n = pool_id2str(pool, id);
src/libs/libsolv/solv/pool.c
1417
id = pool_str2id(pool, p, create);
src/libs/libsolv/solv/pool.c
142
pool->disttype = disttype;
src/libs/libsolv/solv/pool.c
1424
pool_alloctmpspace(Pool *pool, int len)
src/libs/libsolv/solv/pool.c
1426
int n = pool->tmpspace.n;
src/libs/libsolv/solv/pool.c
1429
if (len > pool->tmpspace.len[n])
src/libs/libsolv/solv/pool.c
1431
pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
src/libs/libsolv/solv/pool.c
1432
pool->tmpspace.len[n] = len + 32;
src/libs/libsolv/solv/pool.c
1434
pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
src/libs/libsolv/solv/pool.c
1435
return pool->tmpspace.buf[n];
src/libs/libsolv/solv/pool.c
1439
pool_alloctmpspace_free(Pool *pool, const char *space, int len)
src/libs/libsolv/solv/pool.c
144
pool->noarchid = ARCH_NOARCH;
src/libs/libsolv/solv/pool.c
1444
n = oldn = pool->tmpspace.n;
src/libs/libsolv/solv/pool.c
1451
if (pool->tmpspace.buf[n] != space)
src/libs/libsolv/solv/pool.c
1453
if (len > pool->tmpspace.len[n])
src/libs/libsolv/solv/pool.c
1455
pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
src/libs/libsolv/solv/pool.c
1456
pool->tmpspace.len[n] = len + 32;
src/libs/libsolv/solv/pool.c
1458
return pool->tmpspace.buf[n];
src/libs/libsolv/solv/pool.c
146
pool->noarchid = ARCH_ALL;
src/libs/libsolv/solv/pool.c
1465
pool_freetmpspace(Pool *pool, const char *space)
src/libs/libsolv/solv/pool.c
1467
int n = pool->tmpspace.n;
src/libs/libsolv/solv/pool.c
1471
if (pool->tmpspace.buf[n] == space)
src/libs/libsolv/solv/pool.c
1472
pool->tmpspace.n = n;
src/libs/libsolv/solv/pool.c
1476
pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
src/libs/libsolv/solv/pool.c
148
pool->noarchid = ARCH_ANY;
src/libs/libsolv/solv/pool.c
1483
s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
src/libs/libsolv/solv/pool.c
150
pool->noarchid = ARCH_ANY;
src/libs/libsolv/solv/pool.c
1504
pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
src/libs/libsolv/solv/pool.c
151
pool->solvables[SYSTEMSOLVABLE].arch = pool->noarchid;
src/libs/libsolv/solv/pool.c
1512
str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
src/libs/libsolv/solv/pool.c
1516
str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
src/libs/libsolv/solv/pool.c
1539
pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
src/libs/libsolv/solv/pool.c
1544
s = pool_alloctmpspace(pool, 2 * len + 1);
src/libs/libsolv/solv/pool.c
156
pool_get_flag(Pool *pool, int flag)
src/libs/libsolv/solv/pool.c
161
return pool->promoteepoch;
src/libs/libsolv/solv/pool.c
1612
compstr = pool_id2str(data->repo->pool, comp);
src/libs/libsolv/solv/pool.c
163
return pool->forbidselfconflicts;
src/libs/libsolv/solv/pool.c
165
return pool->obsoleteusesprovides;
src/libs/libsolv/solv/pool.c
1663
pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
src/libs/libsolv/solv/pool.c
167
return pool->implicitobsoleteusesprovides;
src/libs/libsolv/solv/pool.c
1675
Repo *oldinstalled = pool->installed;
src/libs/libsolv/solv/pool.c
169
return pool->obsoleteusescolors;
src/libs/libsolv/solv/pool.c
171
return pool->noinstalledobsoletes;
src/libs/libsolv/solv/pool.c
173
return pool->havedistepoch;
src/libs/libsolv/solv/pool.c
1754
for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
src/libs/libsolv/solv/pool.c
1777
if (pool->solvables[op].name == s->name)
src/libs/libsolv/solv/pool.c
1802
pool_calc_installsizechange(Pool *pool, Map *installedmap)
src/libs/libsolv/solv/pool.c
1807
Repo *oldinstalled = pool->installed;
src/libs/libsolv/solv/pool.c
1809
for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
src/libs/libsolv/solv/pool.c
181
pool_set_flag(Pool *pool, int flag, int value)
src/libs/libsolv/solv/pool.c
183
int old = pool_get_flag(pool, flag);
src/libs/libsolv/solv/pool.c
1836
static inline Id dep2name(Pool *pool, Id dep)
src/libs/libsolv/solv/pool.c
1840
Reldep *rd = rd = GETRELDEP(pool, dep);
src/libs/libsolv/solv/pool.c
1846
static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
src/libs/libsolv/solv/pool.c
1849
Solvable *sn = pool->solvables + n;
src/libs/libsolv/solv/pool.c
1853
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/pool.c
1858
if (pool_match_nevr(pool, pool->solvables + p, con))
src/libs/libsolv/solv/pool.c
1865
static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *multiversionmap)
src/libs/libsolv/solv/pool.c
187
pool->promoteepoch = value;
src/libs/libsolv/solv/pool.c
1873
if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
src/libs/libsolv/solv/pool.c
1876
if (providedbyinstalled_multiversion(pool, map, p, dep))
src/libs/libsolv/solv/pool.c
1897
pool_trivial_installable_multiversionmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *multiversionmap)
src/libs/libsolv/solv/pool.c
190
pool->forbidselfconflicts = value;
src/libs/libsolv/solv/pool.c
1904
map = solv_calloc(pool->nsolvables, 1);
src/libs/libsolv/solv/pool.c
1905
for (p = 1; p < pool->nsolvables; p++)
src/libs/libsolv/solv/pool.c
1910
s = pool->solvables + p;
src/libs/libsolv/solv/pool.c
1916
dp = pool_whatprovides_ptr(pool, con);
src/libs/libsolv/solv/pool.c
193
pool->obsoleteusesprovides = value;
src/libs/libsolv/solv/pool.c
1936
s = pool->solvables + p;
src/libs/libsolv/solv/pool.c
1945
r = providedbyinstalled(pool, map, req, 0, 0);
src/libs/libsolv/solv/pool.c
196
pool->implicitobsoleteusesprovides = value;
src/libs/libsolv/solv/pool.c
1966
if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
src/libs/libsolv/solv/pool.c
1971
if ((providedbyinstalled(pool, map, con, ispatch, multiversionmap) & 1) != 0)
src/libs/libsolv/solv/pool.c
1979
con = dep2name(pool, con);
src/libs/libsolv/solv/pool.c
1980
if ((providedbyinstalled(pool, map, con, ispatch, multiversionmap) & 1) != 0)
src/libs/libsolv/solv/pool.c
199
pool->obsoleteusescolors = value;
src/libs/libsolv/solv/pool.c
1997
if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
src/libs/libsolv/solv/pool.c
2008
s2 = pool->solvables + p2;
src/libs/libsolv/solv/pool.c
202
pool->noinstalledobsoletes = value;
src/libs/libsolv/solv/pool.c
2042
pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
src/libs/libsolv/solv/pool.c
2044
pool_trivial_installable_multiversionmap(pool, installedmap, pkgs, res, 0);
src/libs/libsolv/solv/pool.c
2048
pool_lookup_str(Pool *pool, Id entry, Id keyname)
src/libs/libsolv/solv/pool.c
205
pool->havedistepoch = value;
src/libs/libsolv/solv/pool.c
2050
if (entry == SOLVID_POS && pool->pos.repo)
src/libs/libsolv/solv/pool.c
2051
return repodata_lookup_str(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
src/libs/libsolv/solv/pool.c
2054
return solvable_lookup_str(pool->solvables + entry, keyname);
src/libs/libsolv/solv/pool.c
2058
pool_lookup_id(Pool *pool, Id entry, Id keyname)
src/libs/libsolv/solv/pool.c
2060
if (entry == SOLVID_POS && pool->pos.repo)
src/libs/libsolv/solv/pool.c
2062
Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
src/libs/libsolv/solv/pool.c
2068
return solvable_lookup_id(pool->solvables + entry, keyname);
src/libs/libsolv/solv/pool.c
2072
pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned long long notfound)
src/libs/libsolv/solv/pool.c
2074
if (entry == SOLVID_POS && pool->pos.repo)
src/libs/libsolv/solv/pool.c
2077
if (repodata_lookup_num(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, &value))
src/libs/libsolv/solv/pool.c
2083
return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
src/libs/libsolv/solv/pool.c
2087
pool_lookup_void(Pool *pool, Id entry, Id keyname)
src/libs/libsolv/solv/pool.c
2089
if (entry == SOLVID_POS && pool->pos.repo)
src/libs/libsolv/solv/pool.c
2090
return repodata_lookup_void(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
src/libs/libsolv/solv/pool.c
2093
return solvable_lookup_void(pool->solvables + entry, keyname);
src/libs/libsolv/solv/pool.c
2097
pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
src/libs/libsolv/solv/pool.c
2099
if (entry == SOLVID_POS && pool->pos.repo)
src/libs/libsolv/solv/pool.c
2100
return repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
src/libs/libsolv/solv/pool.c
2103
return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
src/libs/libsolv/solv/pool.c
2107
pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
src/libs/libsolv/solv/pool.c
2109
if (entry == SOLVID_POS && pool->pos.repo)
src/libs/libsolv/solv/pool.c
2111
const unsigned char *chk = repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
src/libs/libsolv/solv/pool.c
2112
return chk ? repodata_chk2str(pool->pos.repo->repodata + pool->pos.repodataid, *typep, chk) : 0;
src/libs/libsolv/solv/pool.c
2116
return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
src/libs/libsolv/solv/pool.c
2120
pool_lookup_deltalocation(Pool *pool, Id entry, unsigned int *medianrp)
src/libs/libsolv/solv/pool.c
2127
loc = pool_lookup_str(pool, entry, DELTA_LOCATION_DIR);
src/libs/libsolv/solv/pool.c
2128
loc = pool_tmpjoin(pool, loc, loc ? "/" : 0, pool_lookup_str(pool, entry, DELTA_LOCATION_NAME));
src/libs/libsolv/solv/pool.c
2129
loc = pool_tmpappend(pool, loc, "-", pool_lookup_str(pool, entry, DELTA_LOCATION_EVR));
src/libs/libsolv/solv/pool.c
2130
loc = pool_tmpappend(pool, loc, ".", pool_lookup_str(pool, entry, DELTA_LOCATION_SUFFIX));
src/libs/libsolv/solv/pool.c
2135
add_new_provider(Pool *pool, Id id, Id p)
src/libs/libsolv/solv/pool.c
2142
Reldep *rd = GETRELDEP(pool, id);
src/libs/libsolv/solv/pool.c
2147
for (pp = pool->whatprovidesdata + pool->whatprovides[id]; *pp; pp++)
src/libs/libsolv/solv/pool.c
215
pool_add_solvable(Pool *pool)
src/libs/libsolv/solv/pool.c
2163
pool->whatprovides[id] = pool_queuetowhatprovides(pool, &q);
src/libs/libsolv/solv/pool.c
2168
pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
src/libs/libsolv/solv/pool.c
217
pool->solvables = solv_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
src/libs/libsolv/solv/pool.c
2170
int hadhashes = pool->relhashtbl ? 1 : 0;
src/libs/libsolv/solv/pool.c
218
memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
src/libs/libsolv/solv/pool.c
2184
id = pool_rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
src/libs/libsolv/solv/pool.c
2185
s = pool->solvables + p;
src/libs/libsolv/solv/pool.c
2189
if (pool->whatprovides)
src/libs/libsolv/solv/pool.c
219
return pool->nsolvables++;
src/libs/libsolv/solv/pool.c
2190
add_new_provider(pool, fn, p);
src/libs/libsolv/solv/pool.c
2191
if (pool->whatprovides_rel)
src/libs/libsolv/solv/pool.c
2192
pool->whatprovides_rel[GETRELID(id)] = 0; /* clear cache */
src/libs/libsolv/solv/pool.c
2193
s = pool->solvables + q;
src/libs/libsolv/solv/pool.c
2199
pool_freeidhashes(pool);
src/libs/libsolv/solv/pool.c
2203
pool_prepend_rootdir(Pool *pool, const char *path)
src/libs/libsolv/solv/pool.c
2207
if (!pool->rootdir)
src/libs/libsolv/solv/pool.c
2209
return solv_dupjoin(pool->rootdir, "/", *path == '/' ? path + 1 : path);
src/libs/libsolv/solv/pool.c
2213
pool_prepend_rootdir_tmp(Pool *pool, const char *path)
src/libs/libsolv/solv/pool.c
2217
if (!pool->rootdir)
src/libs/libsolv/solv/pool.c
2219
return pool_tmpjoin(pool, pool->rootdir, "/", *path == '/' ? path + 1 : path);
src/libs/libsolv/solv/pool.c
2223
pool_set_rootdir(Pool *pool, const char *rootdir)
src/libs/libsolv/solv/pool.c
2225
solv_free(pool->rootdir);
src/libs/libsolv/solv/pool.c
2226
pool->rootdir = solv_strdup(rootdir);
src/libs/libsolv/solv/pool.c
223
pool_add_solvable_block(Pool *pool, int count)
src/libs/libsolv/solv/pool.c
2230
pool_get_rootdir(Pool *pool)
src/libs/libsolv/solv/pool.c
2232
return pool->rootdir;
src/libs/libsolv/solv/pool.c
2237
pool_set_custom_vendorcheck(Pool *pool, int (*vendorcheck)(Pool *, Solvable *, Solvable *))
src/libs/libsolv/solv/pool.c
2239
pool->custom_vendorcheck = vendorcheck;
src/libs/libsolv/solv/pool.c
225
Id nsolvables = pool->nsolvables;
src/libs/libsolv/solv/pool.c
228
pool->solvables = solv_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
src/libs/libsolv/solv/pool.c
229
memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
src/libs/libsolv/solv/pool.c
230
pool->nsolvables += count;
src/libs/libsolv/solv/pool.c
235
pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
src/libs/libsolv/solv/pool.c
239
if (reuseids && start + count == pool->nsolvables)
src/libs/libsolv/solv/pool.c
242
pool->nsolvables = start;
src/libs/libsolv/solv/pool.c
245
memset(pool->solvables + start, 0, sizeof(Solvable) * count);
src/libs/libsolv/solv/pool.c
250
pool_set_installed(Pool *pool, Repo *installed)
src/libs/libsolv/solv/pool.c
252
if (pool->installed == installed)
src/libs/libsolv/solv/pool.c
254
pool->installed = installed;
src/libs/libsolv/solv/pool.c
255
pool_freewhatprovides(pool);
src/libs/libsolv/solv/pool.c
262
Pool *pool = dp;
src/libs/libsolv/solv/pool.c
264
oa = pool->whatprovides[*(Id *)ap];
src/libs/libsolv/solv/pool.c
265
ob = pool->whatprovides[*(Id *)bp];
src/libs/libsolv/solv/pool.c
268
da = pool->whatprovidesdata + oa;
src/libs/libsolv/solv/pool.c
269
db = pool->whatprovidesdata + ob;
src/libs/libsolv/solv/pool.c
285
pool_shrink_whatprovides(Pool *pool)
src/libs/libsolv/solv/pool.c
293
if (pool->ss.nstrings < 3)
src/libs/libsolv/solv/pool.c
295
sorted = solv_malloc2(pool->ss.nstrings, sizeof(Id));
src/libs/libsolv/solv/pool.c
296
for (i = id = 0; id < pool->ss.nstrings; id++)
src/libs/libsolv/solv/pool.c
297
if (pool->whatprovides[id] >= 4)
src/libs/libsolv/solv/pool.c
300
solv_sort(sorted, n, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
src/libs/libsolv/solv/pool.c
306
o = pool->whatprovides[id];
src/libs/libsolv/solv/pool.c
307
dp = pool->whatprovidesdata + o;
src/libs/libsolv/solv/pool.c
321
pool->whatprovides[id] = -lastid;
src/libs/libsolv/solv/pool.c
325
last = pool->whatprovidesdata + o;
src/libs/libsolv/solv/pool.c
329
dp = pool->whatprovidesdata + 4;
src/libs/libsolv/solv/pool.c
330
for (id = 1; id < pool->ss.nstrings; id++)
src/libs/libsolv/solv/pool.c
332
o = pool->whatprovides[id];
src/libs/libsolv/solv/pool.c
340
pool->whatprovides[id] = pool->whatprovides[i];
src/libs/libsolv/solv/pool.c
345
lp = pool->whatprovidesdata + o;
src/libs/libsolv/solv/pool.c
348
pool->whatprovides[id] = dp - pool->whatprovidesdata;
src/libs/libsolv/solv/pool.c
352
o = dp - pool->whatprovidesdata;
src/libs/libsolv/solv/pool.c
353
POOL_DEBUG(SOLV_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
src/libs/libsolv/solv/pool.c
354
if (pool->whatprovidesdataoff == o)
src/libs/libsolv/solv/pool.c
356
r = pool->whatprovidesdataoff - o;
src/libs/libsolv/solv/pool.c
357
pool->whatprovidesdataoff = o;
src/libs/libsolv/solv/pool.c
358
pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
src/libs/libsolv/solv/pool.c
359
if (r > pool->whatprovidesdataleft)
src/libs/libsolv/solv/pool.c
360
r = pool->whatprovidesdataleft;
src/libs/libsolv/solv/pool.c
361
memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
src/libs/libsolv/solv/pool.c
372
pool_createwhatprovides(Pool *pool)
src/libs/libsolv/solv/pool.c
381
Repo *installed = pool->installed;
src/libs/libsolv/solv/pool.c
385
POOL_DEBUG(SOLV_DEBUG_STATS, "number of solvables: %d, memory used: %d K\n", pool->nsolvables, pool->nsolvables * (int)sizeof(Solvable) / 1024);
src/libs/libsolv/solv/pool.c
386
POOL_DEBUG(SOLV_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
src/libs/libsolv/solv/pool.c
387
POOL_DEBUG(SOLV_DEBUG_STATS, "string memory used: %d K array + %d K data, rel memory used: %d K array\n", pool->ss.nstrings / (1024 / (int)sizeof(Id)), pool->ss.sstrings / 1024, pool->nrels * (int)sizeof(Reldep) / 1024);
src/libs/libsolv/solv/pool.c
388
if (pool->ss.stringhashmask || pool->relhashmask)
src/libs/libsolv/solv/pool.c
389
POOL_DEBUG(SOLV_DEBUG_STATS, "string hash memory: %d K, rel hash memory : %d K\n", (pool->ss.stringhashmask + 1) / (int)(1024/sizeof(Id)), (pool->relhashmask + 1) / (int)(1024/sizeof(Id)));
src/libs/libsolv/solv/pool.c
391
pool_freeidhashes(pool); /* XXX: should not be here! */
src/libs/libsolv/solv/pool.c
392
pool_freewhatprovides(pool);
src/libs/libsolv/solv/pool.c
393
num = pool->ss.nstrings;
src/libs/libsolv/solv/pool.c
394
pool->whatprovides = whatprovides = solv_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
src/libs/libsolv/solv/pool.c
395
pool->whatprovides_rel = solv_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
src/libs/libsolv/solv/pool.c
398
for (i = pool->nsolvables - 1; i > 0; i--)
src/libs/libsolv/solv/pool.c
40
Pool *pool;
src/libs/libsolv/solv/pool.c
401
s = pool->solvables + i;
src/libs/libsolv/solv/pool.c
406
if (s->repo != installed && !pool_installable(pool, s))
src/libs/libsolv/solv/pool.c
413
Reldep *rd = GETRELDEP(pool, id);
src/libs/libsolv/solv/pool.c
43
pool = (Pool *)solv_calloc(1, sizeof(*pool));
src/libs/libsolv/solv/pool.c
435
extra = 2 * pool->nrels;
src/libs/libsolv/solv/pool.c
446
for (i = pool->nsolvables - 1; i > 0; i--)
src/libs/libsolv/solv/pool.c
449
s = pool->solvables + i;
src/libs/libsolv/solv/pool.c
45
stringpool_init (&pool->ss, initpool_data);
src/libs/libsolv/solv/pool.c
452
if (s->repo != installed && !pool_installable(pool, s))
src/libs/libsolv/solv/pool.c
461
Reldep *rd = GETRELDEP(pool, id);
src/libs/libsolv/solv/pool.c
472
pool->whatprovidesdata = whatprovidesdata;
src/libs/libsolv/solv/pool.c
473
pool->whatprovidesdataoff = off;
src/libs/libsolv/solv/pool.c
474
pool->whatprovidesdataleft = extra;
src/libs/libsolv/solv/pool.c
475
pool_shrink_whatprovides(pool);
src/libs/libsolv/solv/pool.c
476
POOL_DEBUG(SOLV_DEBUG_STATS, "whatprovides memory used: %d K id array, %d K data\n", (pool->ss.nstrings + pool->nrels + WHATPROVIDES_BLOCK) / (int)(1024/sizeof(Id)), (pool->whatprovidesdataoff + pool->whatprovidesdataleft) / (int)(1024/sizeof(Id)));
src/libs/libsolv/solv/pool.c
48
pool->rels = solv_extend_resize(0, 1, sizeof(Reldep), REL_BLOCK);
src/libs/libsolv/solv/pool.c
486
pool_freewhatprovides(Pool *pool)
src/libs/libsolv/solv/pool.c
488
pool->whatprovides = solv_free(pool->whatprovides);
src/libs/libsolv/solv/pool.c
489
pool->whatprovides_rel = solv_free(pool->whatprovides_rel);
src/libs/libsolv/solv/pool.c
49
pool->nrels = 1;
src/libs/libsolv/solv/pool.c
490
pool->whatprovidesdata = solv_free(pool->whatprovidesdata);
src/libs/libsolv/solv/pool.c
491
pool->whatprovidesdataoff = 0;
src/libs/libsolv/solv/pool.c
492
pool->whatprovidesdataleft = 0;
src/libs/libsolv/solv/pool.c
50
memset(pool->rels, 0, sizeof(Reldep));
src/libs/libsolv/solv/pool.c
507
pool_queuetowhatprovides(Pool *pool, Queue *q)
src/libs/libsolv/solv/pool.c
518
if (pool->whatprovidesdataleft < count + 1)
src/libs/libsolv/solv/pool.c
521
pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
src/libs/libsolv/solv/pool.c
522
pool->whatprovidesdataleft = count + 4096;
src/libs/libsolv/solv/pool.c
526
off = pool->whatprovidesdataoff;
src/libs/libsolv/solv/pool.c
527
memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
src/libs/libsolv/solv/pool.c
53
pool->solvables = solv_extend_resize(0, 2, sizeof(Solvable), SOLVABLE_BLOCK);
src/libs/libsolv/solv/pool.c
530
pool->whatprovidesdataoff += count;
src/libs/libsolv/solv/pool.c
531
pool->whatprovidesdata[pool->whatprovidesdataoff++] = 0;
src/libs/libsolv/solv/pool.c
532
pool->whatprovidesdataleft -= count + 1;
src/libs/libsolv/solv/pool.c
54
pool->nsolvables = 2;
src/libs/libsolv/solv/pool.c
541
# define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
src/libs/libsolv/solv/pool.c
55
memset(pool->solvables, 0, 2 * sizeof(Solvable));
src/libs/libsolv/solv/pool.c
551
pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
src/libs/libsolv/solv/pool.c
553
Reldep *rd = GETRELDEP(pool, d);
src/libs/libsolv/solv/pool.c
568
return pool_match_nevr(pool, s, name);
src/libs/libsolv/solv/pool.c
57
queue_init(&pool->vendormap);
src/libs/libsolv/solv/pool.c
570
if (pool_match_nevr(pool, s, name))
src/libs/libsolv/solv/pool.c
572
return pool_match_nevr(pool, s, evr);
src/libs/libsolv/solv/pool.c
575
if (!pool_match_nevr(pool, s, name))
src/libs/libsolv/solv/pool.c
577
return pool_match_nevr(pool, s, evr);
src/libs/libsolv/solv/pool.c
582
if (!pool_match_nevr(pool, s, name))
src/libs/libsolv/solv/pool.c
590
switch (pool_evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP))
src/libs/libsolv/solv/pool.c
60
pool->disttype = DISTTYPE_DEB;
src/libs/libsolv/solv/pool.c
61
pool->noarchid = ARCH_ALL;
src/libs/libsolv/solv/pool.c
610
static int pool_match_flags_evr_rel_compat(Pool *pool, Reldep *range, int flags, int evr);
src/libs/libsolv/solv/pool.c
615
pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
src/libs/libsolv/solv/pool.c
628
Reldep *rd = GETRELDEP(pool, pevr);
src/libs/libsolv/solv/pool.c
63
pool->disttype = DISTTYPE_ARCH;
src/libs/libsolv/solv/pool.c
630
return pool_match_flags_evr_rel_compat(pool, rd, flags, evr);
src/libs/libsolv/solv/pool.c
633
switch (pool_evrcmp(pool, pevr, evr, EVRCMP_DEPCMP))
src/libs/libsolv/solv/pool.c
64
pool->noarchid = ARCH_ANY;
src/libs/libsolv/solv/pool.c
653
pool_match_flags_evr_rel_compat(Pool *pool, Reldep *range, int flags, int evr)
src/libs/libsolv/solv/pool.c
659
return pool_match_flags_evr(pool, REL_EQ, range->name, flags, evr);
src/libs/libsolv/solv/pool.c
66
pool->disttype = DISTTYPE_HAIKU;
src/libs/libsolv/solv/pool.c
660
return pool_match_flags_evr(pool, REL_LT | REL_EQ, range->name, flags, evr) &&
src/libs/libsolv/solv/pool.c
661
pool_match_flags_evr(pool, REL_GT | REL_EQ, range->evr, REL_EQ, evr);
src/libs/libsolv/solv/pool.c
668
pool_match_dep(Pool *pool, Id d1, Id d2)
src/libs/libsolv/solv/pool.c
67
pool->noarchid = ARCH_ANY;
src/libs/libsolv/solv/pool.c
678
rd2 = GETRELDEP(pool, d2);
src/libs/libsolv/solv/pool.c
679
return pool_match_dep(pool, d1, rd2->name);
src/libs/libsolv/solv/pool.c
68
pool->obsoleteusesprovides = 1;
src/libs/libsolv/solv/pool.c
681
rd1 = GETRELDEP(pool, d1);
src/libs/libsolv/solv/pool.c
684
return pool_match_dep(pool, rd1->name, d2);
src/libs/libsolv/solv/pool.c
686
rd2 = GETRELDEP(pool, d2);
src/libs/libsolv/solv/pool.c
688
if (!pool_match_dep(pool, rd1->name, rd2->name))
src/libs/libsolv/solv/pool.c
691
return pool_match_flags_evr(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
src/libs/libsolv/solv/pool.c
70
pool->disttype = DISTTYPE_RPM;
src/libs/libsolv/solv/pool.c
703
pool_addrelproviders(Pool *pool, Id d)
src/libs/libsolv/solv/pool.c
705
Reldep *rd = GETRELDEP(pool, d);
src/libs/libsolv/solv/pool.c
71
pool->noarchid = ARCH_NOARCH;
src/libs/libsolv/solv/pool.c
728
wp = pool_whatprovides(pool, name);
src/libs/libsolv/solv/pool.c
729
pp2 = pool_whatprovides_ptr(pool, evr);
src/libs/libsolv/solv/pool.c
730
pp = pool->whatprovidesdata + wp;
src/libs/libsolv/solv/pool.c
743
wp = pool_whatprovides(pool, name);
src/libs/libsolv/solv/pool.c
744
pp = pool->whatprovidesdata + wp;
src/libs/libsolv/solv/pool.c
746
wp = pool_whatprovides(pool, evr);
src/libs/libsolv/solv/pool.c
75
s = pool->solvables + SYSTEMSOLVABLE;
src/libs/libsolv/solv/pool.c
753
pp = pool_whatprovides_ptr(pool, evr);
src/libs/libsolv/solv/pool.c
763
wp = pool_whatprovides(pool, evr);
src/libs/libsolv/solv/pool.c
766
if (pool->nscallback)
src/libs/libsolv/solv/pool.c
77
s->arch = pool->noarchid;
src/libs/libsolv/solv/pool.c
773
p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
src/libs/libsolv/solv/pool.c
788
for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
src/libs/libsolv/solv/pool.c
794
if (pool_disabled_solvable(pool, s))
src/libs/libsolv/solv/pool.c
796
if (pool_match_nevr(pool, s, name))
src/libs/libsolv/solv/pool.c
80
pool->debugmask = SOLV_DEBUG_RESULT; /* FIXME */
src/libs/libsolv/solv/pool.c
801
wp = pool_whatprovides(pool, name);
src/libs/libsolv/solv/pool.c
802
pp = pool->whatprovidesdata + wp;
src/libs/libsolv/solv/pool.c
805
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/pool.c
813
pp = pool_whatprovides_ptr(pool, name);
src/libs/libsolv/solv/pool.c
817
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/pool.c
82
pool->obsoleteusescolors = 1;
src/libs/libsolv/solv/pool.c
835
pool->whatprovides_rel[d] = wp;
src/libs/libsolv/solv/pool.c
843
POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: what provides %s?\n", pool_dep2str(pool, name));
src/libs/libsolv/solv/pool.c
845
pp = pool_whatprovides_ptr(pool, name);
src/libs/libsolv/solv/pool.c
848
rd = GETRELDEP(pool, name);
src/libs/libsolv/solv/pool.c
85
pool->forbidselfconflicts = 1;
src/libs/libsolv/solv/pool.c
853
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/pool.c
857
if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
src/libs/libsolv/solv/pool.c
86
pool->obsoleteusesprovides = 1;
src/libs/libsolv/solv/pool.c
869
if (pool->disttype == DISTTYPE_DEB)
src/libs/libsolv/solv/pool.c
87
pool->implicitobsoleteusesprovides = 1;
src/libs/libsolv/solv/pool.c
873
prd = GETRELDEP(pool, pid);
src/libs/libsolv/solv/pool.c
877
if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
src/libs/libsolv/solv/pool.c
88
pool->havedistepoch = 1;
src/libs/libsolv/solv/pool.c
885
if (plist.count == 0 && !strncmp(pool_id2str(pool, name), "rpmlib(", 7))
src/libs/libsolv/solv/pool.c
892
pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
src/libs/libsolv/solv/pool.c
895
return pool->whatprovides_rel[d];
src/libs/libsolv/solv/pool.c
90
return pool;
src/libs/libsolv/solv/pool.c
901
pool_debug(Pool *pool, int type, const char *format, ...)
src/libs/libsolv/solv/pool.c
908
if ((pool->debugmask & type) == 0)
src/libs/libsolv/solv/pool.c
912
if (!pool->debugcallback)
src/libs/libsolv/solv/pool.c
914
if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0 && !(pool->debugmask & SOLV_DEBUG_TO_STDERR))
src/libs/libsolv/solv/pool.c
922
pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
src/libs/libsolv/solv/pool.c
926
pool_error(Pool *pool, int ret, const char *format, ...)
src/libs/libsolv/solv/pool.c
931
if (!pool->errstr)
src/libs/libsolv/solv/pool.c
933
pool->errstra = 1024;
src/libs/libsolv/solv/pool.c
934
pool->errstr = solv_malloc(pool->errstra);
src/libs/libsolv/solv/pool.c
938
*pool->errstr = 0;
src/libs/libsolv/solv/pool.c
942
l = vsnprintf(pool->errstr, pool->errstra, format, args);
src/libs/libsolv/solv/pool.c
944
if (l >= 0 && l + 1 > pool->errstra)
src/libs/libsolv/solv/pool.c
946
pool->errstra = l + 256;
src/libs/libsolv/solv/pool.c
947
pool->errstr = solv_realloc(pool->errstr, pool->errstra);
src/libs/libsolv/solv/pool.c
949
l = vsnprintf(pool->errstr, pool->errstra, format, args);
src/libs/libsolv/solv/pool.c
953
strcpy(pool->errstr, "unknown error");
src/libs/libsolv/solv/pool.c
954
if (pool->debugmask & SOLV_ERROR)
src/libs/libsolv/solv/pool.c
955
pool_debug(pool, SOLV_ERROR, "%s\n", pool->errstr);
src/libs/libsolv/solv/pool.c
96
pool_free(Pool *pool)
src/libs/libsolv/solv/pool.c
960
pool_errstr(Pool *pool)
src/libs/libsolv/solv/pool.c
962
return pool->errstr ? pool->errstr : "no error";
src/libs/libsolv/solv/pool.c
966
pool_setdebuglevel(Pool *pool, int level)
src/libs/libsolv/solv/pool.c
977
mask |= pool->debugmask & SOLV_DEBUG_TO_STDERR; /* keep bit */
src/libs/libsolv/solv/pool.c
978
pool->debugmask = mask;
src/libs/libsolv/solv/pool.c
981
void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
src/libs/libsolv/solv/pool.c
983
pool->debugcallback = debugcallback;
src/libs/libsolv/solv/pool.c
984
pool->debugcallbackdata = debugcallbackdata;
src/libs/libsolv/solv/pool.c
987
void pool_setdebugmask(Pool *pool, int mask)
src/libs/libsolv/solv/pool.c
989
pool->debugmask = mask;
src/libs/libsolv/solv/pool.c
992
void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
src/libs/libsolv/solv/pool.c
994
pool->loadcallback = cb;
src/libs/libsolv/solv/pool.c
995
pool->loadcallbackdata = loadcbdata;
src/libs/libsolv/solv/pool.h
193
#define GETRELDEP(pool, id) ((pool)->rels + ((id) ^ 0x80000000)) /* returns Reldep* */
src/libs/libsolv/solv/pool.h
213
extern void pool_free(Pool *pool);
src/libs/libsolv/solv/pool.h
214
extern void pool_freeallrepos(Pool *pool, int reuseids);
src/libs/libsolv/solv/pool.h
216
extern void pool_setdebuglevel(Pool *pool, int level);
src/libs/libsolv/solv/pool.h
218
extern void pool_setdisttype(Pool *pool, int disttype);
src/libs/libsolv/solv/pool.h
220
extern int pool_set_flag(Pool *pool, int flag, int value);
src/libs/libsolv/solv/pool.h
221
extern int pool_get_flag(Pool *pool, int flag);
src/libs/libsolv/solv/pool.h
222
extern void pool_setvendorclasses(Pool *pool, const char **vendorclasses);
src/libs/libsolv/solv/pool.h
224
extern void pool_debug(Pool *pool, int type, const char *format, ...) __attribute__((format(printf, 3, 4)));
src/libs/libsolv/solv/pool.h
225
extern void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata);
src/libs/libsolv/solv/pool.h
226
extern void pool_setdebugmask(Pool *pool, int mask);
src/libs/libsolv/solv/pool.h
227
extern void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata);
src/libs/libsolv/solv/pool.h
228
extern void pool_set_custom_vendorcheck(Pool *pool, int (*vendorcheck)(struct _Pool *, Solvable *, Solvable *));
src/libs/libsolv/solv/pool.h
231
extern char *pool_alloctmpspace(Pool *pool, int len);
src/libs/libsolv/solv/pool.h
232
extern void pool_freetmpspace(Pool *pool, const char *space);
src/libs/libsolv/solv/pool.h
233
extern char *pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3);
src/libs/libsolv/solv/pool.h
234
extern char *pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3);
src/libs/libsolv/solv/pool.h
235
extern const char *pool_bin2hex(Pool *pool, const unsigned char *buf, int len);
src/libs/libsolv/solv/pool.h
237
extern void pool_set_installed(Pool *pool, struct _Repo *repo);
src/libs/libsolv/solv/pool.h
239
extern int pool_error(Pool *pool, int ret, const char *format, ...) __attribute__((format(printf, 3, 4)));
src/libs/libsolv/solv/pool.h
240
extern char *pool_errstr(Pool *pool);
src/libs/libsolv/solv/pool.h
242
extern void pool_set_rootdir(Pool *pool, const char *rootdir);
src/libs/libsolv/solv/pool.h
243
extern const char *pool_get_rootdir(Pool *pool);
src/libs/libsolv/solv/pool.h
244
extern char *pool_prepend_rootdir(Pool *pool, const char *dir);
src/libs/libsolv/solv/pool.h
245
extern const char *pool_prepend_rootdir_tmp(Pool *pool, const char *dir);
src/libs/libsolv/solv/pool.h
250
extern Id pool_add_solvable(Pool *pool);
src/libs/libsolv/solv/pool.h
251
extern Id pool_add_solvable_block(Pool *pool, int count);
src/libs/libsolv/solv/pool.h
253
extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
src/libs/libsolv/solv/pool.h
254
static inline Solvable *pool_id2solvable(const Pool *pool, Id p)
src/libs/libsolv/solv/pool.h
256
return pool->solvables + p;
src/libs/libsolv/solv/pool.h
259
extern const char *pool_solvable2str(Pool *pool, Solvable *s);
src/libs/libsolv/solv/pool.h
260
static inline const char *pool_solvid2str(Pool *pool, Id p)
src/libs/libsolv/solv/pool.h
262
return pool_solvable2str(pool, pool->solvables + p);
src/libs/libsolv/solv/pool.h
265
void pool_set_languages(Pool *pool, const char **languages, int nlanguages);
src/libs/libsolv/solv/pool.h
266
Id pool_id2langid(Pool *pool, Id id, const char *lang, int create);
src/libs/libsolv/solv/pool.h
273
void pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap);
src/libs/libsolv/solv/pool.h
275
int pool_match_nevr_rel(Pool *pool, Solvable *s, Id d);
src/libs/libsolv/solv/pool.h
276
int pool_match_dep(Pool *pool, Id d1, Id d2);
src/libs/libsolv/solv/pool.h
278
static inline int pool_match_nevr(Pool *pool, Solvable *s, Id d)
src/libs/libsolv/solv/pool.h
283
return pool_match_nevr_rel(pool, s, d);
src/libs/libsolv/solv/pool.h
290
extern void pool_createwhatprovides(Pool *pool);
src/libs/libsolv/solv/pool.h
291
extern void pool_addfileprovides(Pool *pool);
src/libs/libsolv/solv/pool.h
292
extern void pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst);
src/libs/libsolv/solv/pool.h
293
extern void pool_freewhatprovides(Pool *pool);
src/libs/libsolv/solv/pool.h
294
extern Id pool_queuetowhatprovides(Pool *pool, Queue *q);
src/libs/libsolv/solv/pool.h
296
extern Id pool_addrelproviders(Pool *pool, Id d);
src/libs/libsolv/solv/pool.h
298
static inline Id pool_whatprovides(Pool *pool, Id d)
src/libs/libsolv/solv/pool.h
302
return pool->whatprovides[d];
src/libs/libsolv/solv/pool.h
304
if (pool->whatprovides_rel[v])
src/libs/libsolv/solv/pool.h
305
return pool->whatprovides_rel[v];
src/libs/libsolv/solv/pool.h
306
return pool_addrelproviders(pool, d);
src/libs/libsolv/solv/pool.h
309
static inline Id *pool_whatprovides_ptr(Pool *pool, Id d)
src/libs/libsolv/solv/pool.h
311
Id off = pool_whatprovides(pool, d);
src/libs/libsolv/solv/pool.h
312
return pool->whatprovidesdata + off;
src/libs/libsolv/solv/pool.h
320
void pool_search(Pool *pool, Id p, Id key, const char *match, int flags, int (*callback)(void *cbdata, Solvable *s, struct _Repodata *data, struct _Repokey *key, struct _KeyValue *kv), void *cbdata);
src/libs/libsolv/solv/pool.h
322
void pool_clear_pos(Pool *pool);
src/libs/libsolv/solv/pool.h
331
void pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps);
src/libs/libsolv/solv/pool.h
332
int pool_calc_installsizechange(Pool *pool, Map *installedmap);
src/libs/libsolv/solv/pool.h
333
void pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res);
src/libs/libsolv/solv/pool.h
334
void pool_trivial_installable_multiversionmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *multiversionmap);
src/libs/libsolv/solv/pool.h
336
const char *pool_lookup_str(Pool *pool, Id entry, Id keyname);
src/libs/libsolv/solv/pool.h
337
Id pool_lookup_id(Pool *pool, Id entry, Id keyname);
src/libs/libsolv/solv/pool.h
338
unsigned long long pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned long long notfound);
src/libs/libsolv/solv/pool.h
339
int pool_lookup_void(Pool *pool, Id entry, Id keyname);
src/libs/libsolv/solv/pool.h
340
const unsigned char *pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep);
src/libs/libsolv/solv/pool.h
341
const char *pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep);
src/libs/libsolv/solv/pool.h
342
const char *pool_lookup_deltalocation(Pool *pool, Id entry, unsigned int *medianrp);
src/libs/libsolv/solv/pool.h
344
void pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts);
src/libs/libsolv/solv/pool.h
350
for (vp = pool_whatprovides(pool, d) ; (v = pool->whatprovidesdata[vp++]) != 0; )
src/libs/libsolv/solv/pool.h
354
for (repoid = 1; repoid < pool->nrepos; repoid++) \
src/libs/libsolv/solv/pool.h
355
if ((r = pool->repos[repoid]) == 0) \
src/libs/libsolv/solv/pool.h
360
for (p = 2; p < pool->nsolvables; p++) \
src/libs/libsolv/solv/pool.h
361
if (pool->solvables[p].repo == 0) \
src/libs/libsolv/solv/pool.h
366
#define ISCONDDEP(id) (ISRELDEP(id) && (GETRELDEP(pool, id))->flags == REL_COND)
src/libs/libsolv/solv/pool.h
367
#define MODIFYCONDDEP(id, tst) do { Reldep *condrd = GETRELDEP(pool, id); Id condp, condpp; FOR_PROVIDES(condrd->evr, condp, condpp) if (tst) break; id = condp ? condrd->name : 0;} while(0)
src/libs/libsolv/solv/pool.h
370
#define POOL_DEBUG(type, ...) do {if ((pool->debugmask & (type)) != 0) pool_debug(pool, (type), __VA_ARGS__);} while (0)
src/libs/libsolv/solv/pool.h
371
#define IF_POOLDEBUG(type) if ((pool->debugmask & (type)) != 0)
src/libs/libsolv/solv/poolarch.c
100
pool->lastarch = 0;
src/libs/libsolv/solv/poolarch.c
103
id = pool->noarchid;
src/libs/libsolv/solv/poolarch.c
114
id = pool_strn2id(pool, arch, l, 1);
src/libs/libsolv/solv/poolarch.c
134
pool->id2arch = id2arch;
src/libs/libsolv/solv/poolarch.c
135
pool->lastarch = lastarch;
src/libs/libsolv/solv/poolarch.c
139
pool_arch2color_slow(Pool *pool, Id arch)
src/libs/libsolv/solv/poolarch.c
144
if (arch > pool->lastarch)
src/libs/libsolv/solv/poolarch.c
146
if (!pool->id2color)
src/libs/libsolv/solv/poolarch.c
147
pool->id2color = solv_calloc(pool->lastarch + 1, 1);
src/libs/libsolv/solv/poolarch.c
148
s = pool_id2str(pool, arch);
src/libs/libsolv/solv/poolarch.c
155
pool->id2color[arch] = color;
src/libs/libsolv/solv/poolarch.c
60
pool_setarch(Pool *pool, const char *arch)
src/libs/libsolv/solv/poolarch.c
75
pool_setarchpolicy(pool, arch);
src/libs/libsolv/solv/poolarch.c
88
pool_setarchpolicy(Pool *pool, const char *arch)
src/libs/libsolv/solv/poolarch.c
96
pool->id2arch = solv_free(pool->id2arch);
src/libs/libsolv/solv/poolarch.c
97
pool->id2color = solv_free(pool->id2color);
src/libs/libsolv/solv/poolarch.h
19
extern unsigned char pool_arch2color_slow(Pool *pool, Id arch);
src/libs/libsolv/solv/poolarch.h
25
static inline unsigned char pool_arch2color(Pool *pool, Id arch)
src/libs/libsolv/solv/poolarch.h
27
if (arch > pool->lastarch)
src/libs/libsolv/solv/poolarch.h
29
if (pool->id2color && pool->id2color[arch])
src/libs/libsolv/solv/poolarch.h
30
return pool->id2color[arch];
src/libs/libsolv/solv/poolarch.h
31
return pool_arch2color_slow(pool, arch);
src/libs/libsolv/solv/poolarch.h
34
static inline int pool_colormatch(Pool *pool, Solvable *s1, Solvable *s2)
src/libs/libsolv/solv/poolarch.h
38
if ((pool_arch2color(pool, s1->arch) & pool_arch2color(pool, s2->arch)) != 0)
src/libs/libsolv/solv/poolid.c
101
pool->rels = solv_extend(pool->rels, id, 1, sizeof(Reldep), REL_BLOCK);
src/libs/libsolv/solv/poolid.c
103
ran = pool->rels + id;
src/libs/libsolv/solv/poolid.c
109
if (pool->whatprovides_rel && (id & WHATPROVIDES_BLOCK) == 0)
src/libs/libsolv/solv/poolid.c
111
pool->whatprovides_rel = solv_realloc2(pool->whatprovides_rel, id + (WHATPROVIDES_BLOCK + 1), sizeof(Offset));
src/libs/libsolv/solv/poolid.c
112
memset(pool->whatprovides_rel + id, 0, (WHATPROVIDES_BLOCK + 1) * sizeof(Offset));
src/libs/libsolv/solv/poolid.c
122
pool_id2str(const Pool *pool, Id id)
src/libs/libsolv/solv/poolid.c
126
Reldep *rd = GETRELDEP(pool, id);
src/libs/libsolv/solv/poolid.c
129
return pool->ss.stringspace + pool->ss.strings[rd->name];
src/libs/libsolv/solv/poolid.c
131
return pool->ss.stringspace + pool->ss.strings[id];
src/libs/libsolv/solv/poolid.c
148
pool_id2rel(const Pool *pool, Id id)
src/libs/libsolv/solv/poolid.c
153
rd = GETRELDEP(pool, id);
src/libs/libsolv/solv/poolid.c
167
return pool->disttype == DISTTYPE_DEB ? " >> " : rels[rd->flags];
src/libs/libsolv/solv/poolid.c
169
return pool->disttype == DISTTYPE_DEB ? " << " : rels[rd->flags];
src/libs/libsolv/solv/poolid.c
173
return pool->disttype == DISTTYPE_HAIKU ? " != " : rels[rd->flags];
src/libs/libsolv/solv/poolid.c
200
pool_id2evr(const Pool *pool, Id id)
src/libs/libsolv/solv/poolid.c
205
rd = GETRELDEP(pool, id);
src/libs/libsolv/solv/poolid.c
208
return pool->ss.stringspace + pool->ss.strings[rd->evr];
src/libs/libsolv/solv/poolid.c
212
dep2strlen(const Pool *pool, Id id)
src/libs/libsolv/solv/poolid.c
218
Reldep *rd = GETRELDEP(pool, id);
src/libs/libsolv/solv/poolid.c
220
l += 2 + dep2strlen(pool, rd->name) + strlen(pool_id2rel(pool, id));
src/libs/libsolv/solv/poolid.c
223
return l + strlen(pool->ss.stringspace + pool->ss.strings[id]);
src/libs/libsolv/solv/poolid.c
227
dep2strcpy(const Pool *pool, char *p, Id id, int oldrel)
src/libs/libsolv/solv/poolid.c
231
Reldep *rd = GETRELDEP(pool, id);
src/libs/libsolv/solv/poolid.c
237
dep2strcpy(pool, p, rd->name, rd->flags);
src/libs/libsolv/solv/poolid.c
239
strcpy(p, pool_id2rel(pool, id));
src/libs/libsolv/solv/poolid.c
241
dep2strcpy(pool, p, rd->evr, rd->flags);
src/libs/libsolv/solv/poolid.c
245
dep2strcpy(pool, p, rd->name, rd->flags);
src/libs/libsolv/solv/poolid.c
250
dep2strcpy(pool, p, rd->evr, rd->flags);
src/libs/libsolv/solv/poolid.c
259
strcpy(p, pool_id2rel(pool, id));
src/libs/libsolv/solv/poolid.c
264
strcpy(p, pool->ss.stringspace + pool->ss.strings[id]);
src/libs/libsolv/solv/poolid.c
268
pool_dep2str(Pool *pool, Id id)
src/libs/libsolv/solv/poolid.c
27
pool_str2id(Pool *pool, const char *str, int create)
src/libs/libsolv/solv/poolid.c
272
return pool->ss.stringspace + pool->ss.strings[id];
src/libs/libsolv/solv/poolid.c
273
p = pool_alloctmpspace(pool, dep2strlen(pool, id) + 1);
src/libs/libsolv/solv/poolid.c
274
dep2strcpy(pool, p, id, 0);
src/libs/libsolv/solv/poolid.c
279
pool_shrink_strings(Pool *pool)
src/libs/libsolv/solv/poolid.c
281
stringpool_shrink(&pool->ss);
src/libs/libsolv/solv/poolid.c
285
pool_shrink_rels(Pool *pool)
src/libs/libsolv/solv/poolid.c
287
pool->rels = solv_extend_resize(pool->rels, pool->nrels, sizeof(Reldep), REL_BLOCK);
src/libs/libsolv/solv/poolid.c
29
int oldnstrings = pool->ss.nstrings;
src/libs/libsolv/solv/poolid.c
292
pool_freeidhashes(Pool *pool)
src/libs/libsolv/solv/poolid.c
294
stringpool_freehash(&pool->ss);
src/libs/libsolv/solv/poolid.c
295
pool->relhashtbl = solv_free(pool->relhashtbl);
src/libs/libsolv/solv/poolid.c
296
pool->relhashmask = 0;
src/libs/libsolv/solv/poolid.c
30
Id id = stringpool_str2id(&pool->ss, str, create);
src/libs/libsolv/solv/poolid.c
31
if (create && pool->whatprovides && oldnstrings != pool->ss.nstrings && (id & WHATPROVIDES_BLOCK) == 0)
src/libs/libsolv/solv/poolid.c
34
pool->whatprovides = solv_realloc(pool->whatprovides, (id + (WHATPROVIDES_BLOCK + 1)) * sizeof(Offset));
src/libs/libsolv/solv/poolid.c
35
memset(pool->whatprovides + id, 0, (WHATPROVIDES_BLOCK + 1) * sizeof(Offset));
src/libs/libsolv/solv/poolid.c
41
pool_strn2id(Pool *pool, const char *str, unsigned int len, int create)
src/libs/libsolv/solv/poolid.c
43
int oldnstrings = pool->ss.nstrings;
src/libs/libsolv/solv/poolid.c
44
Id id = stringpool_strn2id(&pool->ss, str, len, create);
src/libs/libsolv/solv/poolid.c
45
if (create && pool->whatprovides && oldnstrings != pool->ss.nstrings && (id & WHATPROVIDES_BLOCK) == 0)
src/libs/libsolv/solv/poolid.c
48
pool->whatprovides = solv_realloc(pool->whatprovides, (id + (WHATPROVIDES_BLOCK + 1)) * sizeof(Offset));
src/libs/libsolv/solv/poolid.c
49
memset(pool->whatprovides + id, 0, (WHATPROVIDES_BLOCK + 1) * sizeof(Offset));
src/libs/libsolv/solv/poolid.c
55
pool_rel2id(Pool *pool, Id name, Id evr, int flags, int create)
src/libs/libsolv/solv/poolid.c
63
hashmask = pool->relhashmask;
src/libs/libsolv/solv/poolid.c
64
hashtbl = pool->relhashtbl;
src/libs/libsolv/solv/poolid.c
65
ran = pool->rels;
src/libs/libsolv/solv/poolid.c
68
if (pool->nrels * 2 > hashmask)
src/libs/libsolv/solv/poolid.c
70
solv_free(pool->relhashtbl);
src/libs/libsolv/solv/poolid.c
71
pool->relhashmask = hashmask = mkmask(pool->nrels + REL_BLOCK);
src/libs/libsolv/solv/poolid.c
72
pool->relhashtbl = hashtbl = solv_calloc(hashmask + 1, sizeof(Id));
src/libs/libsolv/solv/poolid.c
74
for (i = 1; i < pool->nrels; i++)
src/libs/libsolv/solv/poolid.c
99
id = pool->nrels++;
src/libs/libsolv/solv/poolid.h
33
extern Id pool_str2id(Pool *pool, const char *, int);
src/libs/libsolv/solv/poolid.h
34
extern Id pool_strn2id(Pool *pool, const char *, unsigned int, int);
src/libs/libsolv/solv/poolid.h
35
extern Id pool_rel2id(Pool *pool, Id, Id, int, int);
src/libs/libsolv/solv/poolid.h
36
extern const char *pool_id2str(const Pool *pool, Id);
src/libs/libsolv/solv/poolid.h
37
extern const char *pool_id2rel(const Pool *pool, Id);
src/libs/libsolv/solv/poolid.h
38
extern const char *pool_id2evr(const Pool *pool, Id);
src/libs/libsolv/solv/poolid.h
39
extern const char *pool_dep2str(Pool *pool, Id); /* might alloc tmpspace */
src/libs/libsolv/solv/poolid.h
41
extern void pool_shrink_strings(Pool *pool);
src/libs/libsolv/solv/poolid.h
42
extern void pool_shrink_rels(Pool *pool);
src/libs/libsolv/solv/poolid.h
43
extern void pool_freeidhashes(Pool *pool);
src/libs/libsolv/solv/poolvendor.c
100
pool->vendorclasses[i] = *v ? solv_strdup(*v) : 0;
src/libs/libsolv/solv/poolvendor.c
101
pool->vendorclasses[i++] = 0;
src/libs/libsolv/solv/poolvendor.c
102
pool->vendorclasses[i] = 0;
src/libs/libsolv/solv/poolvendor.c
103
queue_empty(&pool->vendormap);
src/libs/libsolv/solv/poolvendor.c
107
pool_addvendorclass(Pool *pool, const char **vendorclass)
src/libs/libsolv/solv/poolvendor.c
116
if (pool->vendorclasses)
src/libs/libsolv/solv/poolvendor.c
118
for (i = 0; pool->vendorclasses[i] || pool->vendorclasses[i + 1]; i++)
src/libs/libsolv/solv/poolvendor.c
123
pool->vendorclasses = solv_realloc2(pool->vendorclasses, i + j + 2, sizeof(const char *));
src/libs/libsolv/solv/poolvendor.c
125
pool->vendorclasses[i++] = solv_strdup(vendorclass[j]);
src/libs/libsolv/solv/poolvendor.c
126
pool->vendorclasses[i++] = 0;
src/libs/libsolv/solv/poolvendor.c
127
pool->vendorclasses[i] = 0;
src/libs/libsolv/solv/poolvendor.c
128
queue_empty(&pool->vendormap);
src/libs/libsolv/solv/poolvendor.c
42
Id pool_vendor2mask(Pool *pool, Id vendor)
src/libs/libsolv/solv/poolvendor.c
49
if (vendor == 0 || !pool->vendorclasses)
src/libs/libsolv/solv/poolvendor.c
51
for (i = 0; i < pool->vendormap.count; i += 2)
src/libs/libsolv/solv/poolvendor.c
52
if (pool->vendormap.elements[i] == vendor)
src/libs/libsolv/solv/poolvendor.c
53
return pool->vendormap.elements[i + 1];
src/libs/libsolv/solv/poolvendor.c
54
vstr = pool_id2str(pool, vendor);
src/libs/libsolv/solv/poolvendor.c
57
for (v = pool->vendorclasses; ; v++)
src/libs/libsolv/solv/poolvendor.c
77
queue_push(&pool->vendormap, vendor);
src/libs/libsolv/solv/poolvendor.c
78
queue_push(&pool->vendormap, mask);
src/libs/libsolv/solv/poolvendor.c
83
pool_setvendorclasses(Pool *pool, const char **vendorclasses)
src/libs/libsolv/solv/poolvendor.c
88
if (pool->vendorclasses)
src/libs/libsolv/solv/poolvendor.c
90
for (v = pool->vendorclasses; v[0] || v[1]; v++)
src/libs/libsolv/solv/poolvendor.c
92
pool->vendorclasses = solv_free(pool->vendorclasses);
src/libs/libsolv/solv/poolvendor.c
98
pool->vendorclasses = solv_calloc(v - vendorclasses + 2, sizeof(const char *));
src/libs/libsolv/solv/poolvendor.h
17
Id pool_vendor2mask(Pool *pool, Id vendor);
src/libs/libsolv/solv/poolvendor.h
18
void pool_setvendorclasses(Pool *pool, const char **vendorclasses);
src/libs/libsolv/solv/poolvendor.h
19
void pool_addvendorclass(Pool *pool, const char **vendorclass);
src/libs/libsolv/solv/problems.c
100
Id name = pool->solvables[-solv->rules[v].p].name;
src/libs/libsolv/solv/problems.c
101
while (v > solv->infarchrules && pool->solvables[-solv->rules[v - 1].p].name == name)
src/libs/libsolv/solv/problems.c
103
for (; v < solv->infarchrules_end && pool->solvables[-solv->rules[v].p].name == name; v++)
src/libs/libsolv/solv/problems.c
109
Pool *pool = solv->pool;
src/libs/libsolv/solv/problems.c
110
Id name = pool->solvables[-solv->rules[v].p].name;
src/libs/libsolv/solv/problems.c
111
while (v > solv->duprules && pool->solvables[-solv->rules[v - 1].p].name == name)
src/libs/libsolv/solv/problems.c
113
for (; v < solv->duprules_end && pool->solvables[-solv->rules[v].p].name == name; v++)
src/libs/libsolv/solv/problems.c
180
Pool *pool = solv->pool;
src/libs/libsolv/solv/problems.c
382
Pool *pool = solv->pool;
src/libs/libsolv/solv/problems.c
403
name = pool->solvables[-solv->rules[why].p].name;
src/libs/libsolv/solv/problems.c
404
while (why > solv->infarchrules && pool->solvables[-solv->rules[why - 1].p].name == name)
src/libs/libsolv/solv/problems.c
407
for (; why < solv->infarchrules_end && pool->solvables[-solv->rules[why].p].name == name; why++)
src/libs/libsolv/solv/problems.c
424
name = pool->solvables[-solv->rules[why].p].name;
src/libs/libsolv/solv/problems.c
425
while (why > solv->duprules && pool->solvables[-solv->rules[why - 1].p].name == name)
src/libs/libsolv/solv/problems.c
428
for (; why < solv->duprules_end && pool->solvables[-solv->rules[why].p].name == name; why++)
src/libs/libsolv/solv/problems.c
46
Pool *pool = solv->pool;
src/libs/libsolv/solv/problems.c
47
Id name = pool->solvables[-solv->rules[v].p].name;
src/libs/libsolv/solv/problems.c
470
if (rp > 0 && solv->decisionmap[rp] > 0 && pool->solvables[rp].repo != solv->installed)
src/libs/libsolv/solv/problems.c
48
while (v > solv->infarchrules && pool->solvables[-solv->rules[v - 1].p].name == name)
src/libs/libsolv/solv/problems.c
50
for (; v < solv->infarchrules_end && pool->solvables[-solv->rules[v].p].name == name; v++)
src/libs/libsolv/solv/problems.c
520
if (rp > 0 && solv->decisionmap[rp] > 0 && pool->solvables[rp].repo != solv->installed)
src/libs/libsolv/solv/problems.c
56
Pool *pool = solv->pool;
src/libs/libsolv/solv/problems.c
57
Id name = pool->solvables[-solv->rules[v].p].name;
src/libs/libsolv/solv/problems.c
58
while (v > solv->duprules && pool->solvables[-solv->rules[v - 1].p].name == name)
src/libs/libsolv/solv/problems.c
585
Pool *pool = solv->pool;
src/libs/libsolv/solv/problems.c
60
for (; v < solv->duprules_end && pool->solvables[-solv->rules[v].p].name == name; v++)
src/libs/libsolv/solv/problems.c
684
memset(solv->decisionmap, 0, pool->nsolvables * sizeof(Id));
src/libs/libsolv/solv/problems.c
823
solv->pool->pooljobs.elements[rp - 1] = SOLVER_NOOP;
src/libs/libsolv/solv/problems.c
824
solv->pool->pooljobs.elements[rp] = 0;
src/libs/libsolv/solv/problems.c
926
if (op > 1 && solv->pool->solvables[op].arch != solv->pool->solvables[-r->p].arch)
src/libs/libsolv/solv/problems.c
939
else if (solv->installed && r->p < 0 && solv->pool->solvables[-r->p].repo == solv->installed && reqset <= 1)
src/libs/libsolv/solv/problems.c
99
Pool *pool = solv->pool;
src/libs/libsolv/solv/repo.c
1062
md.pool = repo->pool;
src/libs/libsolv/solv/repo.c
1076
Pool *pool = repo->pool;
src/libs/libsolv/solv/repo.c
1086
return pool_id2str(pool, pool->solvables[entry].name);
src/libs/libsolv/solv/repo.c
1088
return pool_id2str(pool, pool->solvables[entry].arch);
src/libs/libsolv/solv/repo.c
1090
return pool_id2str(pool, pool->solvables[entry].evr);
src/libs/libsolv/solv/repo.c
1092
return pool_id2str(pool, pool->solvables[entry].vendor);
src/libs/libsolv/solv/repo.c
1153
return repo->pool->solvables[entry].name;
src/libs/libsolv/solv/repo.c
1155
return repo->pool->solvables[entry].arch;
src/libs/libsolv/solv/repo.c
1157
return repo->pool->solvables[entry].evr;
src/libs/libsolv/solv/repo.c
1159
return repo->pool->solvables[entry].vendor;
src/libs/libsolv/solv/repo.c
1199
return lookup_idarray_solvable(repo, repo->pool->solvables[entry].provides, q);
src/libs/libsolv/solv/repo.c
1201
return lookup_idarray_solvable(repo, repo->pool->solvables[entry].obsoletes, q);
src/libs/libsolv/solv/repo.c
1203
return lookup_idarray_solvable(repo, repo->pool->solvables[entry].conflicts, q);
src/libs/libsolv/solv/repo.c
1205
return lookup_idarray_solvable(repo, repo->pool->solvables[entry].requires, q);
src/libs/libsolv/solv/repo.c
1207
return lookup_idarray_solvable(repo, repo->pool->solvables[entry].recommends, q);
src/libs/libsolv/solv/repo.c
1209
return lookup_idarray_solvable(repo, repo->pool->solvables[entry].suggests, q);
src/libs/libsolv/solv/repo.c
1211
return lookup_idarray_solvable(repo, repo->pool->solvables[entry].supplements, q);
src/libs/libsolv/solv/repo.c
1213
return lookup_idarray_solvable(repo, repo->pool->solvables[entry].enhances, q);
src/libs/libsolv/solv/repo.c
122
Pool *pool = repo->pool;
src/libs/libsolv/solv/repo.c
125
if (repo == pool->installed)
src/libs/libsolv/solv/repo.c
126
pool->installed = 0;
src/libs/libsolv/solv/repo.c
128
for (i = 1; i < pool->nrepos; i++) /* find repo in pool */
src/libs/libsolv/solv/repo.c
129
if (pool->repos[i] == repo)
src/libs/libsolv/solv/repo.c
1296
return chk ? pool_bin2hex(repo->pool, chk, solv_chksum_len(*typep)) : 0;
src/libs/libsolv/solv/repo.c
131
if (i == pool->nrepos) /* repo not in pool, return */
src/libs/libsolv/solv/repo.c
133
if (i == pool->nrepos - 1 && reuseids)
src/libs/libsolv/solv/repo.c
134
pool->nrepos--;
src/libs/libsolv/solv/repo.c
136
pool->repos[i] = 0;
src/libs/libsolv/solv/repo.c
137
pool->urepos--;
src/libs/libsolv/solv/repo.c
1406
repo->pool->solvables[p].name = id;
src/libs/libsolv/solv/repo.c
1409
repo->pool->solvables[p].arch = id;
src/libs/libsolv/solv/repo.c
1412
repo->pool->solvables[p].evr = id;
src/libs/libsolv/solv/repo.c
1415
repo->pool->solvables[p].vendor = id;
src/libs/libsolv/solv/repo.c
144
Id p = pool_add_solvable(repo->pool);
src/libs/libsolv/solv/repo.c
1455
repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
src/libs/libsolv/solv/repo.c
1475
repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
src/libs/libsolv/solv/repo.c
1496
Solvable *s = repo->pool->solvables + p;
src/libs/libsolv/solv/repo.c
155
repo->pool->solvables[p].repo = repo;
src/libs/libsolv/solv/repo.c
1577
Solvable *s = repo->pool->solvables + p;
src/libs/libsolv/solv/repo.c
1622
Solvable *s = repo->pool->solvables + p;
src/libs/libsolv/solv/repo.c
166
p = pool_add_solvable_block(repo->pool, count);
src/libs/libsolv/solv/repo.c
177
for (s = repo->pool->solvables + p; count--; s++)
src/libs/libsolv/solv/repo.c
197
for (s = repo->pool->solvables + start, i = count; i--; s++)
src/libs/libsolv/solv/repo.c
199
pool_free_solvable_block(repo->pool, start, count, reuseids);
src/libs/libsolv/solv/repo.c
39
repo_create(Pool *pool, const char *name)
src/libs/libsolv/solv/repo.c
43
pool_freewhatprovides(pool);
src/libs/libsolv/solv/repo.c
45
if (!pool->nrepos)
src/libs/libsolv/solv/repo.c
47
pool->nrepos = 1; /* start with repoid 1 */
src/libs/libsolv/solv/repo.c
48
pool->repos = (Repo **)solv_calloc(2, sizeof(Repo *));
src/libs/libsolv/solv/repo.c
51
pool->repos = (Repo **)solv_realloc2(pool->repos, pool->nrepos + 1, sizeof(Repo *));
src/libs/libsolv/solv/repo.c
52
pool->repos[pool->nrepos] = repo;
src/libs/libsolv/solv/repo.c
53
pool->urepos++;
src/libs/libsolv/solv/repo.c
54
repo->repoid = pool->nrepos++;
src/libs/libsolv/solv/repo.c
56
repo->pool = pool;
src/libs/libsolv/solv/repo.c
57
repo->start = pool->nsolvables;
src/libs/libsolv/solv/repo.c
58
repo->end = pool->nsolvables;
src/libs/libsolv/solv/repo.c
613
Pool *pool = repo->pool;
src/libs/libsolv/solv/repo.c
625
dep = (char *)pool_id2str(pool, id);
src/libs/libsolv/solv/repo.c
634
idp = pool_str2id(pool, dep, 1);
src/libs/libsolv/solv/repo.c
646
idl = pool_str2id(pool, dep, 1);
src/libs/libsolv/solv/repo.c
647
idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
src/libs/libsolv/solv/repo.c
649
id = pool_rel2id(pool, id, idl, REL_OR, 1);
src/libs/libsolv/solv/repo.c
659
idl = pool_str2id(pool, dep, 1);
src/libs/libsolv/solv/repo.c
660
idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
src/libs/libsolv/solv/repo.c
662
id = pool_rel2id(pool, id, idl, REL_OR, 1);
src/libs/libsolv/solv/repo.c
667
id = pool_rel2id(pool, idp, id, REL_AND, 1);
src/libs/libsolv/solv/repo.c
676
idp = pool_str2id(pool, buf, 1);
src/libs/libsolv/solv/repo.c
681
id = pool_str2id(pool, p, 1);
src/libs/libsolv/solv/repo.c
682
id = pool_rel2id(pool, idp, id, REL_WITH, 1);
src/libs/libsolv/solv/repo.c
683
id = pool_rel2id(pool, NAMESPACE_SPLITPROVIDES, id, REL_NAMESPACE, 1);
src/libs/libsolv/solv/repo.c
695
dep = (char *)pool_id2str(pool, id);
src/libs/libsolv/solv/repo.c
705
idp = pool_str2id(pool, buf + 9, 1);
src/libs/libsolv/solv/repo.c
707
id = pool_str2id(pool, p, 1);
src/libs/libsolv/solv/repo.c
708
id = pool_rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
src/libs/libsolv/solv/repo.c
709
id = pool_rel2id(pool, idp, id, REL_AND, 1);
src/libs/libsolv/solv/repo.c
715
id = pool_str2id(pool, p, 1);
src/libs/libsolv/solv/repo.c
716
id = pool_rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
src/libs/libsolv/solv/repo.c
741
idp = pool_str2id(pool, dep, 1);
src/libs/libsolv/solv/repo.c
743
id = pool_rel2id(pool, id, idp, REL_AND, 1);
src/libs/libsolv/solv/repo.c
751
idp = pool_str2id(pool, dep, 1);
src/libs/libsolv/solv/repo.c
753
id = pool_rel2id(pool, id, idp, REL_AND, 1);
src/libs/libsolv/solv/repo.c
765
id = pool_str2id(pool, buf, 1);
src/libs/libsolv/solv/repo.c
766
id = pool_rel2id(pool, NAMESPACE_FILESYSTEM, id, REL_NAMESPACE, 1);
src/libs/libsolv/solv/repo.c
781
idsupp = pool_rel2id(pool, idsupp, repo->idarraydata[i], REL_OR, 1);
src/libs/libsolv/solv/repo.c
788
idfresh = pool_rel2id(pool, idfresh, repo->idarraydata[i], REL_OR, 1);
src/libs/libsolv/solv/repo.c
793
idsupp = pool_rel2id(pool, idsupp, idfresh, REL_AND, 1);
src/libs/libsolv/solv/repo.c
803
Pool *pool = repo->pool;
src/libs/libsolv/solv/repo.c
814
dep = (char *)pool_id2str(pool, id);
src/libs/libsolv/solv/repo.c
82
Pool *pool = repo->pool;
src/libs/libsolv/solv/repo.c
820
id = pool_str2id(pool, buf, 1);
src/libs/libsolv/solv/repo.c
821
id = pool_rel2id(pool, NAMESPACE_OTHERPROVIDERS, id, REL_NAMESPACE, 1);
src/libs/libsolv/solv/repo.c
832
Pool *pool;
src/libs/libsolv/solv/repo.c
850
if (!repodata_stringify(md->pool, data, key, kv, md->flags))
src/libs/libsolv/solv/repo.c
86
pool_freewhatprovides(pool);
src/libs/libsolv/solv/repo.c
87
if (reuseids && repo->end == pool->nsolvables)
src/libs/libsolv/solv/repo.c
897
Pool *pool = repo->pool;
src/libs/libsolv/solv/repo.c
906
for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
src/libs/libsolv/solv/repo.c
91
for (i = repo->end - 1, s = pool->solvables + i; i >= repo->start; i--, s--)
src/libs/libsolv/solv/repo.c
922
s = pool->solvables + p;
src/libs/libsolv/solv/repo.c
94
pool_free_solvable_block(pool, i + 1, repo->end - (i + 1), reuseids);
src/libs/libsolv/solv/repo.c
97
for (i = repo->start, s = pool->solvables + i; i < repo->end; i++, s++)
src/libs/libsolv/solv/repo.h
102
static inline int pool_installable(const Pool *pool, Solvable *s)
src/libs/libsolv/solv/repo.h
108
if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
src/libs/libsolv/solv/repo.h
110
if (pool->considered)
src/libs/libsolv/solv/repo.h
112
Id id = s - pool->solvables;
src/libs/libsolv/solv/repo.h
113
if (!MAPTST(pool->considered, id))
src/libs/libsolv/solv/repo.h
168
for (p = (r)->start, s = (r)->pool->solvables + p; p < (r)->end; p++, s = (r)->pool->solvables + p) \
src/libs/libsolv/solv/repo.h
31
Pool *pool; /* pool containing this repo */
src/libs/libsolv/solv/repo.h
60
extern Repo *repo_create(Pool *pool, const char *name);
src/libs/libsolv/solv/repo.h
84
static inline Repo *pool_id2repo(Pool *pool, Id repoid)
src/libs/libsolv/solv/repo.h
86
return repoid < pool->nrepos ? pool->repos[repoid] : 0;
src/libs/libsolv/solv/repo.h
89
static inline int pool_disabled_solvable(const Pool *pool, Solvable *s)
src/libs/libsolv/solv/repo.h
93
if (pool->considered)
src/libs/libsolv/solv/repo.h
95
Id id = s - pool->solvables;
src/libs/libsolv/solv/repo.h
96
if (!MAPTST(pool->considered, id))
src/libs/libsolv/solv/repo_solv.c
1018
data.error = pool_error(pool, SOLV_ERROR_EOF, "buffer overrun");
src/libs/libsolv/solv/repo_solv.c
1032
data.error = pool_error(pool, SOLV_ERROR_EOF, "unexpected EOF");
src/libs/libsolv/solv/repo_solv.c
1059
data.incoreoffset[(s - pool->solvables) - data.start] = data.incoredatalen;
src/libs/libsolv/solv/repo_solv.c
1088
printf("=> %s %s %p\n", pool_id2str(pool, keys[key].name), pool_id2str(pool, keys[key].type), s);
src/libs/libsolv/solv/repo_solv.c
110
data->error = pool_error(data->repo->pool, SOLV_ERROR_EOF, "unexpected EOF");
src/libs/libsolv/solv/repo_solv.c
1114
POOL_DEBUG(SOLV_DEBUG_STATS, "%s -> %s\n", pool_id2str(pool, id), pool_id2str(pool, did));
src/libs/libsolv/solv/repo_solv.c
1142
data.error = pool_error(pool, SOLV_ERROR_OVERFLOW, "idarray overflow");
src/libs/libsolv/solv/repo_solv.c
1162
POOL_DEBUG(SOLV_DEBUG_STATS, "%s ->\n", pool_id2str(pool, id));
src/libs/libsolv/solv/repo_solv.c
1164
POOL_DEBUG(SOLV_DEBUG_STATS," %s\n", pool_dep2str(pool, repo->idarraydata[ido]));
src/libs/libsolv/solv/repo_solv.c
1173
data.error = pool_error(pool, SOLV_ERROR_OVERFLOW, "array stack overflow");
src/libs/libsolv/solv/repo_solv.c
118
data->error = pool_error(data->repo->pool, SOLV_ERROR_ID_RANGE, "read_id: id too large (%u/%u)", x, max);
src/libs/libsolv/solv/repo_solv.c
1193
data.error = pool_error(pool, SOLV_ERROR_CORRUPT, "inconsistent number of solvables: %d %d", nentries, numsolv);
src/libs/libsolv/solv/repo_solv.c
1198
data.error = pool_error(pool, SOLV_ERROR_CORRUPT, "more than one solvable block");
src/libs/libsolv/solv/repo_solv.c
1202
s = pool_id2solvable(pool, extendstart);
src/libs/libsolv/solv/repo_solv.c
1204
s = pool_id2solvable(pool, repo_add_solvable_block(repo, numsolv));
src/libs/libsolv/solv/repo_solv.c
1205
data.start = s - pool->solvables;
src/libs/libsolv/solv/repo_solv.c
1223
data.incoreoffset[(s - pool->solvables) - data.start] = data.incoredatalen;
src/libs/libsolv/solv/repo_solv.c
1231
data.error = pool_error(pool, SOLV_ERROR_CORRUPT, "illegal fixarray");
src/libs/libsolv/solv/repo_solv.c
125
data->error = pool_error(data->repo->pool, SOLV_ERROR_CORRUPT, "read_id: id too long");
src/libs/libsolv/solv/repo_solv.c
1255
repo->rpmdbid[(s - pool->solvables) - repo->start] = id;
src/libs/libsolv/solv/repo_solv.c
1268
data.error = pool_error(pool, SOLV_ERROR_EOF, "unexpected EOF, depth = %d", keydepth);
src/libs/libsolv/solv/repo_solv.c
1272
data.error = pool_error(pool, SOLV_ERROR_EOF, "buffer overrun");
src/libs/libsolv/solv/repo_solv.c
1317
pool_error(pool, data.error, "repopagestore setup: unexpected EOF");
src/libs/libsolv/solv/repo_solv.c
1319
pool_error(pool, data.error, "repopagestore setup failed");
src/libs/libsolv/solv/repo_solv.c
143
data->error = pool_error(data->repo->pool, SOLV_ERROR_EOF, "unexpected EOF");
src/libs/libsolv/solv/repo_solv.c
154
data->error = pool_error(data->repo->pool, SOLV_ERROR_ID_RANGE, "read_idarray: id too large (%u/%u)", x, max);
src/libs/libsolv/solv/repo_solv.c
161
data->error = pool_error(data->repo->pool, SOLV_ERROR_OVERFLOW, "read_idarray: array overflow");
src/libs/libsolv/solv/repo_solv.c
171
data->error = pool_error(data->repo->pool, SOLV_ERROR_OVERFLOW, "read_idarray: array overflow");
src/libs/libsolv/solv/repo_solv.c
197
data->error = pool_error(data->repo->pool, SOLV_ERROR_ID_RANGE, "data_read_id_max: id too large (%u/%u)", x, max);
src/libs/libsolv/solv/repo_solv.c
222
data->error = pool_error(data->repo->pool, SOLV_ERROR_ID_RANGE, "data_read_idarray: id too large (%u/%u)", x, max);
src/libs/libsolv/solv/repo_solv.c
266
data->error = pool_error(data->repo->pool, SOLV_ERROR_ID_RANGE, "data_read_rel_idarray: id too large (%u/%u)", x, max);
src/libs/libsolv/solv/repo_solv.c
386
data->error = pool_error(data->repo->pool, SOLV_ERROR_ID_RANGE, "incore_map_idarray: id too large (%u/%u)", id, max);
src/libs/libsolv/solv/repo_solv.c
445
Pool *pool = repo->pool;
src/libs/libsolv/solv/repo_solv.c
478
int oldnstrings = pool->ss.nstrings;
src/libs/libsolv/solv/repo_solv.c
479
int oldnrels = pool->nrels;
src/libs/libsolv/solv/repo_solv.c
512
return pool_error(pool, SOLV_ERROR_NOT_SOLV, "not a SOLV file");
src/libs/libsolv/solv/repo_solv.c
519
return pool_error(pool, SOLV_ERROR_UNSUPPORTED, "unsupported SOLV version");
src/libs/libsolv/solv/repo_solv.c
531
return pool_error(pool, SOLV_ERROR_CORRUPT, "bad number of dirs");
src/libs/libsolv/solv/repo_solv.c
534
return pool_error(pool, SOLV_ERROR_CORRUPT, "relations are forbidden in a local pool");
src/libs/libsolv/solv/repo_solv.c
539
return pool_error(pool, SOLV_ERROR_CORRUPT, "sub-repository solvable number does not match main repository (%d - %d)", extendend - extendstart, numsolv);
src/libs/libsolv/solv/repo_solv.c
541
if (pool->solvables[extendstart + i].repo != repo)
src/libs/libsolv/solv/repo_solv.c
542
return pool_error(pool, SOLV_ERROR_CORRUPT, "main repository contains holes, cannot extend");
src/libs/libsolv/solv/repo_solv.c
561
spool = &pool->ss;
src/libs/libsolv/solv/repo_solv.c
597
return pool_error(pool, SOLV_ERROR_EOF, "read error while reading strings");
src/libs/libsolv/solv/repo_solv.c
613
return pool_error(pool, SOLV_ERROR_EOF, "read error while reading strings");
src/libs/libsolv/solv/repo_solv.c
624
return pool_error(pool, SOLV_ERROR_OVERFLOW, "overflow while expanding strings");
src/libs/libsolv/solv/repo_solv.c
63
data->error = pool_error(data->repo->pool, SOLV_ERROR_EOF, "unexpected EOF");
src/libs/libsolv/solv/repo_solv.c
637
return pool_error(pool, SOLV_ERROR_CORRUPT, "expanding strings size mismatch");
src/libs/libsolv/solv/repo_solv.c
654
return pool_error(pool, SOLV_ERROR_CORRUPT, "store strings don't start with an empty string");
src/libs/libsolv/solv/repo_solv.c
661
return pool_error(pool, SOLV_ERROR_OVERFLOW, "not enough strings");
src/libs/libsolv/solv/repo_solv.c
715
return pool_error(pool, SOLV_ERROR_OVERFLOW, "not enough strings %d %d", i, numid);
src/libs/libsolv/solv/repo_solv.c
770
pool->rels = solv_realloc2(pool->rels, pool->nrels + numrel, sizeof(Reldep));
src/libs/libsolv/solv/repo_solv.c
771
ran = pool->rels;
src/libs/libsolv/solv/repo_solv.c
774
hashmask = mkmask(pool->nrels + numrel);
src/libs/libsolv/solv/repo_solv.c
777
POOL_DEBUG(SOLV_DEBUG_STATS, "rel hash buckets: %d, old %d\n", hashmask + 1, pool->relhashmask + 1);
src/libs/libsolv/solv/repo_solv.c
779
if (hashmask > pool->relhashmask)
src/libs/libsolv/solv/repo_solv.c
781
pool->relhashtbl = solv_free(pool->relhashtbl);
src/libs/libsolv/solv/repo_solv.c
782
pool->relhashmask = hashmask;
src/libs/libsolv/solv/repo_solv.c
783
pool->relhashtbl = hashtbl = solv_calloc(hashmask + 1, sizeof(Id));
src/libs/libsolv/solv/repo_solv.c
784
for (i = 1; i < pool->nrels; i++)
src/libs/libsolv/solv/repo_solv.c
795
hashtbl = pool->relhashtbl;
src/libs/libsolv/solv/repo_solv.c
796
hashmask = pool->relhashmask;
src/libs/libsolv/solv/repo_solv.c
822
id = pool->nrels++;
src/libs/libsolv/solv/repo_solv.c
830
if (hashmask > mkmask(pool->nrels + 4096))
src/libs/libsolv/solv/repo_solv.c
832
pool->relhashtbl = solv_free(pool->relhashtbl);
src/libs/libsolv/solv/repo_solv.c
833
pool->relhashmask = 0;
src/libs/libsolv/solv/repo_solv.c
835
pool_shrink_rels(pool); /* vacuum */
src/libs/libsolv/solv/repo_solv.c
841
if (pool->whatprovides && oldnstrings != pool->ss.nstrings)
src/libs/libsolv/solv/repo_solv.c
843
int newlen = (pool->ss.nstrings + WHATPROVIDES_BLOCK) & ~WHATPROVIDES_BLOCK;
src/libs/libsolv/solv/repo_solv.c
844
pool->whatprovides = solv_realloc2(pool->whatprovides, newlen, sizeof(Offset));
src/libs/libsolv/solv/repo_solv.c
845
memset(pool->whatprovides + oldnstrings, 0, (newlen - oldnstrings) * sizeof(Offset));
src/libs/libsolv/solv/repo_solv.c
847
if (pool->whatprovides_rel && oldnrels != pool->nrels)
src/libs/libsolv/solv/repo_solv.c
849
int newlen = (pool->nrels + WHATPROVIDES_BLOCK) & ~WHATPROVIDES_BLOCK;
src/libs/libsolv/solv/repo_solv.c
850
pool->whatprovides_rel = solv_realloc2(pool->whatprovides_rel, newlen, sizeof(Offset));
src/libs/libsolv/solv/repo_solv.c
851
memset(pool->whatprovides_rel + oldnrels, 0, (newlen - oldnrels) * sizeof(Offset));
src/libs/libsolv/solv/repo_solv.c
86
data->error = pool_error(data->repo->pool, SOLV_ERROR_EOF, "unexpected EOF");
src/libs/libsolv/solv/repo_solv.c
884
id = pool_str2id(pool, stringpool_id2str(spool, id), 1);
src/libs/libsolv/solv/repo_solv.c
889
type = pool_str2id(pool, stringpool_id2str(spool, type), 1);
src/libs/libsolv/solv/repo_solv.c
892
data.error = pool_error(pool, SOLV_ERROR_UNSUPPORTED, "unsupported data type '%s'", pool_id2str(pool, type));
src/libs/libsolv/solv/repo_solv.c
903
data.error = pool_error(pool, SOLV_ERROR_UNSUPPORTED, "unsupported storage type %d", keys[i].storage);
src/libs/libsolv/solv/repo_solv.c
907
data.error = pool_error(pool, SOLV_ERROR_UNSUPPORTED, "main solvable data must use incore storage %d", keys[i].storage);
src/libs/libsolv/solv/repo_solv.c
912
data.error = pool_error(pool, SOLV_ERROR_UNSUPPORTED, "type REL_IDARRAY is only supported for STORAGE_SOLVABLE");
src/libs/libsolv/solv/repo_solv.c
915
data.error = pool_error(pool, SOLV_ERROR_UNSUPPORTED, "mapped ids are not supported for STORAGE_VERTICAL_OFFSET");
src/libs/libsolv/solv/repo_solv.c
920
fprintf(stderr, "key %d %s %s %d %d\n", i, pool_id2str(pool,id), pool_id2str(pool, keys[i].type),
src/libs/libsolv/solv/repo_solv.c
984
data.error = pool_error(pool, SOLV_ERROR_EOF, "unexpected EOF");
src/libs/libsolv/solv/repo_write.c
1002
keyname = pool_id2str(repo->pool, key->name);
src/libs/libsolv/solv/repo_write.c
1027
Pool *pool = repo->pool;
src/libs/libsolv/solv/repo_write.c
1266
stringpool_clone(spool, &pool->ss);
src/libs/libsolv/solv/repo_write.c
1273
spool = &pool->ss;
src/libs/libsolv/solv/repo_write.c
1292
fprintf(stderr, " %2d: %s[%d] %d %d %d\n", i, pool_id2str(pool, target.keys[i].name), target.keys[i].name, target.keys[i].type, target.keys[i].size, target.keys[i].storage);
src/libs/libsolv/solv/repo_write.c
1309
key->name = stringpool_str2id(spool, pool_id2str(pool, key->name), 1);
src/libs/libsolv/solv/repo_write.c
1312
key->type = stringpool_str2id(spool, pool_id2str(pool, key->type), 1);
src/libs/libsolv/solv/repo_write.c
1314
key->size = stringpool_str2id(spool, pool_id2str(pool, key->size), 1);
src/libs/libsolv/solv/repo_write.c
1317
key->type = stringpool_str2id(spool, pool_id2str(pool, key->type), 1);
src/libs/libsolv/solv/repo_write.c
1335
needid = calloc(reloff + pool->nrels, sizeof(*needid));
src/libs/libsolv/solv/repo_write.c
1367
for (i = repo->start, s = pool->solvables + i, n = 0; i < repo->end; i++, s++)
src/libs/libsolv/solv/repo_write.c
1397
target.keys[cbdata.keymap[SOLVABLE_PROVIDES]].size += incneedidarray(pool, idarraydata + s->provides, needid);
src/libs/libsolv/solv/repo_write.c
1402
target.keys[cbdata.keymap[SOLVABLE_OBSOLETES]].size += incneedidarray(pool, idarraydata + s->obsoletes, needid);
src/libs/libsolv/solv/repo_write.c
1407
target.keys[cbdata.keymap[SOLVABLE_CONFLICTS]].size += incneedidarray(pool, idarraydata + s->conflicts, needid);
src/libs/libsolv/solv/repo_write.c
1412
target.keys[cbdata.keymap[SOLVABLE_REQUIRES]].size += incneedidarray(pool, idarraydata + s->requires, needid);
src/libs/libsolv/solv/repo_write.c
1417
target.keys[cbdata.keymap[SOLVABLE_RECOMMENDS]].size += incneedidarray(pool, idarraydata + s->recommends, needid);
src/libs/libsolv/solv/repo_write.c
1422
target.keys[cbdata.keymap[SOLVABLE_SUGGESTS]].size += incneedidarray(pool, idarraydata + s->suggests, needid);
src/libs/libsolv/solv/repo_write.c
1427
target.keys[cbdata.keymap[SOLVABLE_SUPPLEMENTS]].size += incneedidarray(pool, idarraydata + s->supplements, needid);
src/libs/libsolv/solv/repo_write.c
1432
target.keys[cbdata.keymap[SOLVABLE_ENHANCES]].size += incneedidarray(pool, idarraydata + s->enhances, needid);
src/libs/libsolv/solv/repo_write.c
150
data->error = pool_error(data->repo->pool, -1, "write error u32: %s", strerror(errno));
src/libs/libsolv/solv/repo_write.c
1558
id = putinownpool(&cbdata, dirpooldata->localpool ? &dirpooldata->spool : &pool->ss, id);
src/libs/libsolv/solv/repo_write.c
1580
for (i = 1; i < reloff + pool->nrels; i++)
src/libs/libsolv/solv/repo_write.c
1590
solv_sort(needid + reloff, pool->nrels, sizeof(*needid), needid_cmp_need, 0);
src/libs/libsolv/solv/repo_write.c
1609
for (i = 0; i < pool->nrels; i++)
src/libs/libsolv/solv/repo_write.c
1655
id = putinownpool(&cbdata, dirpooldata->localpool ? &dirpooldata->spool : &pool->ss, id);
src/libs/libsolv/solv/repo_write.c
166
data->error = pool_error(data->repo->pool, -1, "write error u8: %s", strerror(errno));
src/libs/libsolv/solv/repo_write.c
1693
for (i = repo->start, s = pool->solvables + i, n = 0; i < repo->end; i++, s++)
src/libs/libsolv/solv/repo_write.c
1707
data_addidarray_sort(xd, pool, needid, idarraydata + s->provides, SOLVABLE_FILEMARKER);
src/libs/libsolv/solv/repo_write.c
1709
data_addidarray_sort(xd, pool, needid, idarraydata + s->obsoletes, 0);
src/libs/libsolv/solv/repo_write.c
1711
data_addidarray_sort(xd, pool, needid, idarraydata + s->conflicts, 0);
src/libs/libsolv/solv/repo_write.c
1713
data_addidarray_sort(xd, pool, needid, idarraydata + s->requires, SOLVABLE_PREREQMARKER);
src/libs/libsolv/solv/repo_write.c
1715
data_addidarray_sort(xd, pool, needid, idarraydata + s->recommends, 0);
src/libs/libsolv/solv/repo_write.c
1717
data_addidarray_sort(xd, pool, needid, idarraydata + s->suggests, 0);
src/libs/libsolv/solv/repo_write.c
1719
data_addidarray_sort(xd, pool, needid, idarraydata + s->supplements, 0);
src/libs/libsolv/solv/repo_write.c
1721
data_addidarray_sort(xd, pool, needid, idarraydata + s->enhances, 0);
src/libs/libsolv/solv/repo_write.c
181
data->error = pool_error(data->repo->pool, -1, "write error blob: %s", strerror(errno));
src/libs/libsolv/solv/repo_write.c
1821
ran = pool->rels + (needid[reloff + i].map - reloff);
src/libs/libsolv/solv/repo_write.c
1863
write_idarray(&target, pool, 0, repodata_id2schema(&target, i));
src/libs/libsolv/solv/repo_write.c
207
data->error = pool_error(data->repo->pool, -1, "write error id: %s", strerror(errno));
src/libs/libsolv/solv/repo_write.c
228
data->error = pool_error(data->repo->pool, -1, "write error str: %s", strerror(errno));
src/libs/libsolv/solv/repo_write.c
237
write_idarray(Repodata *data, Pool *pool, NeedId *needid, Id *ids)
src/libs/libsolv/solv/repo_write.c
273
write_idarray_sort(Repodata *data, Pool *pool, NeedId *needid, Id *ids, Id marker)
src/libs/libsolv/solv/repo_write.c
472
data_addidarray_sort(struct extdata *xd, Pool *pool, NeedId *needid, Id *ids, Id marker)
src/libs/libsolv/solv/repo_write.c
53
incneedid(Pool *pool, Id id, NeedId *needid)
src/libs/libsolv/solv/repo_write.c
57
Reldep *rd = GETRELDEP(pool, id);
src/libs/libsolv/solv/repo_write.c
585
int nrels = cbdata->repo->pool->nrels;
src/libs/libsolv/solv/repo_write.c
60
incneedid(pool, rd->evr, needid);
src/libs/libsolv/solv/repo_write.c
605
compid = putinownpool(cbdata, data->localpool ? &data->spool : &data->repo->pool->ss, compid);
src/libs/libsolv/solv/repo_write.c
667
id = putinownpool(cbdata, data->localpool ? &data->spool : &repo->pool->ss, id);
src/libs/libsolv/solv/repo_write.c
668
incneedid(repo->pool, id, cbdata->needid);
src/libs/libsolv/solv/repo_write.c
684
cbdata->target->error = pool_error(cbdata->repo->pool, -1, "nested fixarray structs not yet implemented");
src/libs/libsolv/solv/repo_write.c
69
incneedidarray(Pool *pool, Id *idarray, NeedId *needid)
src/libs/libsolv/solv/repo_write.c
743
fprintf(stderr, "solvable %d (%s): key (%d)%s %d\n", s ? s - repo->pool->solvables : 0, s ? pool_id2str(repo->pool, s->name) : "", key->name, pool_id2str(repo->pool, key->name), key->type);
src/libs/libsolv/solv/repo_write.c
793
id = putinownpool(cbdata, data->localpool ? &data->spool : &data->repo->pool->ss, id);
src/libs/libsolv/solv/repo_write.c
801
id = putinownpool(cbdata, data->localpool ? &data->spool : &data->repo->pool->ss, id);
src/libs/libsolv/solv/repo_write.c
81
Reldep *rd = GETRELDEP(pool, id);
src/libs/libsolv/solv/repo_write.c
84
incneedid(pool, rd->evr, needid);
src/libs/libsolv/solv/repo_write.c
888
cbdata->target->error = pool_error(cbdata->repo->pool, -1, "unknown type for %d: %d\n", key->name, key->type);
src/libs/libsolv/solv/repodata.c
1044
return s->repo->rpmdbid ? s->repo->rpmdbid + (s - s->repo->pool->solvables - s->repo->start) : 0;
src/libs/libsolv/solv/repodata.c
1212
dataiterator_init(Dataiterator *di, Pool *pool, Repo *repo, Id p, Id keyname, const char *match, int flags)
src/libs/libsolv/solv/repodata.c
1215
di->pool = pool;
src/libs/libsolv/solv/repodata.c
1217
if (!pool || (repo && repo->pool != pool))
src/libs/libsolv/solv/repodata.c
1294
if (!di->pool->urepos)
src/libs/libsolv/solv/repodata.c
1302
di->repo = di->pool->repos[di->repoid];
src/libs/libsolv/solv/repodata.c
1440
di->solvid = di->pool->pos.solvid;
src/libs/libsolv/solv/repodata.c
1520
if (di->pool->solvables[di->solvid].repo == di->repo)
src/libs/libsolv/solv/repodata.c
1531
if (di->repoid < di->pool->nrepos)
src/libs/libsolv/solv/repodata.c
1533
di->repo = di->pool->repos[di->repoid];
src/libs/libsolv/solv/repodata.c
1614
di->idp = solvabledata_fetch(di->pool->solvables + di->solvid, &di->kv, di->key->name);
src/libs/libsolv/solv/repodata.c
1649
if (!repodata_stringify(di->pool, di->data, di->key, &di->kv, di->flags))
src/libs/libsolv/solv/repodata.c
1661
repodata_stringify(di->pool, di->data, di->key, &di->kv, di->flags);
src/libs/libsolv/solv/repodata.c
1680
pool_clear_pos(di->pool);
src/libs/libsolv/solv/repodata.c
1683
di->pool->pos.solvid = di->solvid;
src/libs/libsolv/solv/repodata.c
1684
di->pool->pos.repo = di->repo;
src/libs/libsolv/solv/repodata.c
1685
di->pool->pos.repodataid = di->data - di->repo->repodata;
src/libs/libsolv/solv/repodata.c
1686
di->pool->pos.schema = di->kv.id;
src/libs/libsolv/solv/repodata.c
1687
di->pool->pos.dp = (unsigned char *)di->kv.str - di->data->incoredata;
src/libs/libsolv/solv/repodata.c
1695
pool_clear_pos(di->pool);
src/libs/libsolv/solv/repodata.c
1698
di->pool->pos.solvid = di->solvid;
src/libs/libsolv/solv/repodata.c
1699
di->pool->pos.repo = di->repo;
src/libs/libsolv/solv/repodata.c
1700
di->pool->pos.repodataid = di->data - di->repo->repodata;
src/libs/libsolv/solv/repodata.c
1701
di->pool->pos.schema = di->kv.parent->id;
src/libs/libsolv/solv/repodata.c
1702
di->pool->pos.dp = (unsigned char *)di->kv.parent->str - di->data->incoredata;
src/libs/libsolv/solv/repodata.c
1827
di->repo = di->pool->pos.repo;
src/libs/libsolv/solv/repodata.c
1834
di->data = di->repo->repodata + di->pool->pos.repodataid;
src/libs/libsolv/solv/repodata.c
1843
di->repo = di->pool->solvables[solvid].repo;
src/libs/libsolv/solv/repodata.c
1848
if (!di->pool->urepos)
src/libs/libsolv/solv/repodata.c
1854
di->repo = di->pool->repos[di->repoid];
src/libs/libsolv/solv/repodata.c
1880
if (!repodata_stringify(di->pool, di->data, di->key, &di->kv, di->flags))
src/libs/libsolv/solv/repodata.c
2153
id = pool_str2id(data->repo->pool, str, 1);
src/libs/libsolv/solv/repodata.c
2347
return pool_bin2hex(data->repo->pool, buf, l);
src/libs/libsolv/solv/repodata.c
2352
evrid2vrstr(Pool *pool, Id evrid)
src/libs/libsolv/solv/repodata.c
2354
const char *p, *evr = pool_id2str(pool, evrid);
src/libs/libsolv/solv/repodata.c
2369
id = pool_strn2id(data->repo->pool, str, l, 1);
src/libs/libsolv/solv/repodata.c
2390
Pool *pool = data->repo->pool;
src/libs/libsolv/solv/repodata.c
2417
s = pool->solvables + solvid;
src/libs/libsolv/solv/repodata.c
2420
str = pool_id2str(pool, s->arch);
src/libs/libsolv/solv/repodata.c
2427
str = pool_id2str(pool, s->name);
src/libs/libsolv/solv/repodata.c
2432
str = evrid2vrstr(pool, s->evr);
src/libs/libsolv/solv/repodata.c
2437
str = pool_id2str(pool, s->arch);
src/libs/libsolv/solv/repodata.c
2522
Pool *pool = data->repo->pool;
src/libs/libsolv/solv/repodata.c
2523
Solvable *s = pool->solvables + solvid;
src/libs/libsolv/solv/repodata.c
2549
pool = s->repo->pool;
src/libs/libsolv/solv/repodata.c
2551
name = pool_id2str(pool, s->name);
src/libs/libsolv/solv/repodata.c
2555
repodata_set_id(data, solvid, SOLVABLE_SOURCENAME, pool_strn2id(pool, sourcepkg, sevr - sourcepkg - 1, 1));
src/libs/libsolv/solv/repodata.c
2557
evr = evrid2vrstr(pool, s->evr);
src/libs/libsolv/solv/repodata.c
2561
repodata_set_id(data, solvid, SOLVABLE_SOURCEEVR, pool_strn2id(pool, sevr, sarch - sevr - 1, 1));
src/libs/libsolv/solv/repodata.c
2568
repodata_set_constantid(data, solvid, SOLVABLE_SOURCEARCH, pool_strn2id(pool, sarch, strlen(sarch) - 4, 1));
src/libs/libsolv/solv/repodata.c
2643
id = pool_str2id(data->repo->pool, str, 1);
src/libs/libsolv/solv/repodata.c
2914
pool_debug(data->repo->pool, SOLV_FATAL, "fixarray substructs with different schemas\n");
src/libs/libsolv/solv/repodata.c
2959
pool_debug(data->repo->pool, SOLV_FATAL, "don't know how to handle type %d\n", key->type);
src/libs/libsolv/solv/repodata.c
3034
pool_debug(data->repo->pool, SOLV_FATAL, "Inconsistent old data (key occured twice).\n");
src/libs/libsolv/solv/repodata.c
3111
fprintf(stderr, "internalize %d(%d):%s:%s\n", entry, entry + data->start, pool_id2str(data->repo->pool, key->name), pool_id2str(data->repo->pool, key->type));
src/libs/libsolv/solv/repodata.c
313
id = pool_strn2id(data->repo->pool, dir, dire - dir, create);
src/libs/libsolv/solv/repodata.c
3193
Pool *pool = repo->pool;
src/libs/libsolv/solv/repodata.c
3197
if (!pool->loadcallback)
src/libs/libsolv/solv/repodata.c
3205
oldtmpspace = pool->tmpspace;
src/libs/libsolv/solv/repodata.c
3206
memset(&pool->tmpspace, 0, sizeof(pool->tmpspace));
src/libs/libsolv/solv/repodata.c
3208
r = pool->loadcallback(pool, data, pool->loadcallbackdata);
src/libs/libsolv/solv/repodata.c
3212
solv_free(pool->tmpspace.buf[i]);
src/libs/libsolv/solv/repodata.c
3213
pool->tmpspace = oldtmpspace;
src/libs/libsolv/solv/repodata.c
3222
Pool *pool = repo->pool;
src/libs/libsolv/solv/repodata.c
3234
dataiterator_init(&di, pool, repo, SOLVID_META, REPOSITORY_EXTERNAL, 0, 0);
src/libs/libsolv/solv/repodata.c
3255
dataiterator_init(&di, pool, repo, SOLVID_META, REPOSITORY_EXTERNAL, 0, 0);
src/libs/libsolv/solv/repodata.c
350
Pool *pool = data->repo->pool;
src/libs/libsolv/solv/repodata.c
362
comps = stringpool_id2str(data->localpool ? &data->spool : &pool->ss, comp);
src/libs/libsolv/solv/repodata.c
370
p = pool_alloctmpspace(pool, l + 1) + l;
src/libs/libsolv/solv/repodata.c
382
comps = stringpool_id2str(data->localpool ? &data->spool : &pool->ss, comp);
src/libs/libsolv/solv/repodata.c
575
Pool *pool = data->repo->pool;
src/libs/libsolv/solv/repodata.c
576
if (data->repo != pool->pos.repo)
src/libs/libsolv/solv/repodata.c
578
if (data != data->repo->repodata + pool->pos.repodataid)
src/libs/libsolv/solv/repodata.c
580
*schemap = pool->pos.schema;
src/libs/libsolv/solv/repodata.c
581
return data->incoredata + pool->pos.dp;
src/libs/libsolv/solv/repodata.c
678
return pool_id2str(data->repo->pool, id);
src/libs/libsolv/solv/repodata.c
773
return pool_str2id(data->repo->pool, stringpool_id2str(&data->spool, id), create);
src/libs/libsolv/solv/repodata.c
781
return stringpool_str2id(&data->spool, pool_id2str(data->repo->pool, id), create);
src/libs/libsolv/solv/repodata.c
813
repodata_stringify(Pool *pool, Repodata *data, Repokey *key, KeyValue *kv, int flags)
src/libs/libsolv/solv/repodata.c
823
kv->str = pool_id2str(pool, kv->id);
src/libs/libsolv/solv/repodata.c
896
s = data->repo->pool->solvables + solvid;
src/libs/libsolv/solv/repodata.c
984
Pool *pool = data->repo->pool;
src/libs/libsolv/solv/repodata.c
986
pool_clear_pos(pool);
src/libs/libsolv/solv/repodata.c
989
pool->pos.repo = data->repo;
src/libs/libsolv/solv/repodata.c
990
pool->pos.repodataid = data - data->repo->repodata;
src/libs/libsolv/solv/repodata.c
991
pool->pos.dp = (unsigned char *)kv->str - data->incoredata;
src/libs/libsolv/solv/repodata.c
992
pool->pos.schema = kv->id;
src/libs/libsolv/solv/repodata.h
200
int repodata_stringify(Pool *pool, Repodata *data, Repokey *key, struct _KeyValue *kv, int flags);
src/libs/libsolv/solv/rules.c
1011
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
105
x = a->w2 - pool->whatprovidesdata[b->d];
src/libs/libsolv/solv/rules.c
1064
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
1073
for (i = 1; i < pool->nsolvables; i++)
src/libs/libsolv/solv/rules.c
1077
s = pool->solvables + i;
src/libs/libsolv/solv/rules.c
1084
ps = pool->solvables + p;
src/libs/libsolv/solv/rules.c
1092
a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
src/libs/libsolv/solv/rules.c
1093
if (a != 1 && pool->installed && ps->repo == pool->installed)
src/libs/libsolv/solv/rules.c
111
x = pool->whatprovidesdata[a->d] - b->w2;
src/libs/libsolv/solv/rules.c
1113
ps = pool->solvables + p;
src/libs/libsolv/solv/rules.c
1117
a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
src/libs/libsolv/solv/rules.c
1120
if (pool->installed && ps->repo == pool->installed)
src/libs/libsolv/solv/rules.c
1127
aa = (aa <= pool->lastarch) ? pool->id2arch[aa] : 0;
src/libs/libsolv/solv/rules.c
1152
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
1157
if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
src/libs/libsolv/solv/rules.c
116
ad = pool->whatprovidesdata + a->d;
src/libs/libsolv/solv/rules.c
1165
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
117
bd = pool->whatprovidesdata + b->d;
src/libs/libsolv/solv/rules.c
1170
if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
src/libs/libsolv/solv/rules.c
1206
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
1207
Solvable *ps, *s = pool->solvables + p;
src/libs/libsolv/solv/rules.c
1216
ps = pool->solvables + pi;
src/libs/libsolv/solv/rules.c
1224
if (pool->solvables[pi2].repo != installed)
src/libs/libsolv/solv/rules.c
1243
ps = pool->solvables + pi;
src/libs/libsolv/solv/rules.c
1259
Solvable *ps = pool->solvables + pi;
src/libs/libsolv/solv/rules.c
1260
if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
src/libs/libsolv/solv/rules.c
1262
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
src/libs/libsolv/solv/rules.c
1269
if (pool->solvables[pi2].repo != installed)
src/libs/libsolv/solv/rules.c
127
return unifyrules_sortcmp(r1, r2, solv->pool);
src/libs/libsolv/solv/rules.c
1289
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
1295
map_init(&solv->dupmap, pool->nsolvables);
src/libs/libsolv/solv/rules.c
1296
map_init(&solv->dupinvolvedmap, pool->nsolvables);
src/libs/libsolv/solv/rules.c
1308
if (what <= 0 || what > pool->nrepos)
src/libs/libsolv/solv/rules.c
1310
repo = pool_id2repo(pool, what);
src/libs/libsolv/solv/rules.c
1318
if (repo != installed && !pool_installable(pool, s))
src/libs/libsolv/solv/rules.c
1329
if (pool->solvables[p].repo == installed)
src/libs/libsolv/solv/rules.c
1337
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/rules.c
1342
if (s->repo != installed && !pool_installable(pool, s))
src/libs/libsolv/solv/rules.c
1366
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
1372
for (i = 1; i < pool->nsolvables; i++)
src/libs/libsolv/solv/rules.c
1376
s = pool->solvables + i;
src/libs/libsolv/solv/rules.c
1380
ps = pool->solvables + p;
src/libs/libsolv/solv/rules.c
140
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
1400
Solvable *is = pool->solvables + ip;
src/libs/libsolv/solv/rules.c
1423
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
1428
if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
src/libs/libsolv/solv/rules.c
1436
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
1441
if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
src/libs/libsolv/solv/rules.c
1476
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
1479
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/rules.c
148
solv_sort(solv->rules + 1, solv->nrules - 1, sizeof(Rule), unifyrules_sortcmp, solv->pool);
src/libs/libsolv/solv/rules.c
1487
Solvable *ps = pool->solvables + p2;
src/libs/libsolv/solv/rules.c
1490
if (!pool->implicitobsoleteusesprovides && ps->name != s->name)
src/libs/libsolv/solv/rules.c
1492
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
src/libs/libsolv/solv/rules.c
1504
Solvable *ps = pool->solvables + p2;
src/libs/libsolv/solv/rules.c
1507
if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
src/libs/libsolv/solv/rules.c
1509
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
src/libs/libsolv/solv/rules.c
157
if (jr && !unifyrules_sortcmp(ir, jr, pool))
src/libs/libsolv/solv/rules.c
1584
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
1606
Reldep *rd = GETRELDEP(pool, what);
src/libs/libsolv/solv/rules.c
1609
if (pool->disttype != DISTTYPE_DEB)
src/libs/libsolv/solv/rules.c
1611
const char *rel = strrchr(pool_id2str(pool, rd->evr), '-');
src/libs/libsolv/solv/rules.c
1618
rd = GETRELDEP(pool, rd->name);
src/libs/libsolv/solv/rules.c
1630
queue_push2(q, DISABLE_INFARCH, pool->solvables[what].name);
src/libs/libsolv/solv/rules.c
1638
s = pool->solvables + p;
src/libs/libsolv/solv/rules.c
1652
queue_push2(q, DISABLE_DUP, pool->solvables[what].name);
src/libs/libsolv/solv/rules.c
1658
s = pool->solvables + p;
src/libs/libsolv/solv/rules.c
1677
if (pool->solvables[p].repo == installed)
src/libs/libsolv/solv/rules.c
1722
Solvable *is = pool->solvables + q->elements[i + 1];
src/libs/libsolv/solv/rules.c
1726
s = pool->solvables + p;
src/libs/libsolv/solv/rules.c
1739
if (pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE_EVONLY) != 0)
src/libs/libsolv/solv/rules.c
1763
if (pool->solvables[p].repo == installed)
src/libs/libsolv/solv/rules.c
188
dp = solv->pool->whatprovidesdata + r->d;
src/libs/libsolv/solv/rules.c
1967
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
1979
if (p < 0 && d > 0 && (!pool->whatprovidesdata[d] || !pool->whatprovidesdata[d + 1]))
src/libs/libsolv/solv/rules.c
1981
w2 = pool->whatprovidesdata[d];
src/libs/libsolv/solv/rules.c
1997
Id *dp = pool->whatprovidesdata + d;
src/libs/libsolv/solv/rules.c
1998
Id *odp = pool->whatprovidesdata + od;
src/libs/libsolv/solv/rules.c
2007
if (p < 0 && pool->whatprovidesdata[d] < 0)
src/libs/libsolv/solv/rules.c
2009
w2 = pool->whatprovidesdata[d];
src/libs/libsolv/solv/rules.c
2069
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
2088
solver_addrpmrulesforsolvable(solv, pool->solvables - r->p, 0);
src/libs/libsolv/solv/rules.c
2091
solver_addrpmrulesforsolvable(solv, pool->solvables - r->w2, 0);
src/libs/libsolv/solv/rules.c
212
dp = solv->pool->whatprovidesdata + d;
src/libs/libsolv/solv/rules.c
2121
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
2143
solver_addrpmrulesforsolvable(solv, pool->solvables - r->p, 0);
src/libs/libsolv/solv/rules.c
2146
solver_addrpmrulesforsolvable(solv, pool->solvables - r->w2, 0);
src/libs/libsolv/solv/rules.c
2209
*depp = pool->solvables[-r->p].name;
src/libs/libsolv/solv/rules.c
2217
*depp = pool->solvables[-r->p].name;
src/libs/libsolv/solv/rules.c
2264
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
2305
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
2311
ur = solv->rules + solv->updaterules + (pi - pool->installed->start);
src/libs/libsolv/solv/rules.c
2313
ur = solv->rules + solv->featurerules + (pi - pool->installed->start);
src/libs/libsolv/solv/rules.c
2350
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
2363
if (!pool->installed)
src/libs/libsolv/solv/rules.c
2372
map_init(&m, pool->nsolvables);
src/libs/libsolv/solv/rules.c
2373
map_init(&mneg, pool->nsolvables);
src/libs/libsolv/solv/rules.c
2397
s = pool->solvables + p;
src/libs/libsolv/solv/rules.c
2400
if (s->repo == pool->installed)
src/libs/libsolv/solv/rules.c
2409
s2 = pool->solvables + p2;
src/libs/libsolv/solv/rules.c
2410
if (s2->repo != pool->installed)
src/libs/libsolv/solv/rules.c
2412
if (!pool->implicitobsoleteusesprovides && s->name != s2->name)
src/libs/libsolv/solv/rules.c
2414
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
src/libs/libsolv/solv/rules.c
2443
s2 = pool->solvables + p2;
src/libs/libsolv/solv/rules.c
2444
if (s2->repo != pool->installed)
src/libs/libsolv/solv/rules.c
2446
if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
src/libs/libsolv/solv/rules.c
2448
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
src/libs/libsolv/solv/rules.c
2515
ur = solv->rules + solv->updaterules + (qi.elements[i] - pool->installed->start);
src/libs/libsolv/solv/rules.c
2517
ur = solv->rules + solv->featurerules + (qi.elements[i] - pool->installed->start);
src/libs/libsolv/solv/rules.c
2546
if (q.elements[i] != pool->whatprovidesdata[lastaddedd + i])
src/libs/libsolv/solv/rules.c
2551
d = q.count ? pool_queuetowhatprovides(pool, &q) : 0;
src/libs/libsolv/solv/rules.c
2584
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
2589
map_init(&m, pool->nsolvables);
src/libs/libsolv/solv/rules.c
263
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
2644
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
2689
solver_addrule(solv, p2, q.count ? pool_queuetowhatprovides(pool, &q) : 0);
src/libs/libsolv/solv/rules.c
2718
while ((p2 = pool->whatprovidesdata[d++]) != 0)
src/libs/libsolv/solv/rules.c
2756
solver_addrule(solv, p2, q.count ? pool_queuetowhatprovides(pool, &q) : 0);
src/libs/libsolv/solv/rules.c
2791
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
2796
Reldep *rd = GETRELDEP(pool, dep);
src/libs/libsolv/solv/rules.c
2819
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
2824
Reldep *rd = GETRELDEP(pool, dep);
src/libs/libsolv/solv/rules.c
2853
if (p == SYSTEMSOLVABLE || pool->solvables[p].repo == solv->installed)
src/libs/libsolv/solv/rules.c
2894
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
2912
map_init(&im, pool->nsolvables);
src/libs/libsolv/solv/rules.c
2913
map_init(&installedm, pool->nsolvables);
src/libs/libsolv/solv/rules.c
2928
if (pool->solvables[p].repo == installed)
src/libs/libsolv/solv/rules.c
2936
Reldep *rd = GETRELDEP(pool, what);
src/libs/libsolv/solv/rules.c
2959
s = pool->solvables + ip;
src/libs/libsolv/solv/rules.c
2969
printf("xsupp %s from %s\n", pool_dep2str(pool, sup), pool_solvid2str(pool, ip));
src/libs/libsolv/solv/rules.c
297
for (dp = pool->whatprovidesdata + d; *dp; dp++, n++)
src/libs/libsolv/solv/rules.c
2981
dataiterator_init(&di, pool, 0, 0, SOLVABLE_ISVISIBLE, 0, 0);
src/libs/libsolv/solv/rules.c
2987
s = pool->solvables + di.solvid;
src/libs/libsolv/solv/rules.c
2990
if (s->repo != installed && !pool_installable(pool, s))
src/libs/libsolv/solv/rules.c
2992
if (strncmp(pool_id2str(pool, s->name), "pattern:", 8) != 0)
src/libs/libsolv/solv/rules.c
2997
if (pool->solvables[p].repo == installed)
src/libs/libsolv/solv/rules.c
2999
if (strncmp(pool_id2str(pool, pool->solvables[p].name), "pattern", 7) != 0)
src/libs/libsolv/solv/rules.c
3011
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/rules.c
3014
if (!strncmp("product:", pool_id2str(pool, s->name), 8))
src/libs/libsolv/solv/rules.c
3017
if (pool->nscallback)
src/libs/libsolv/solv/rules.c
3019
Id buddy = pool->nscallback(pool, pool->nscallbackdata, NAMESPACE_PRODUCTBUDDY, p);
src/libs/libsolv/solv/rules.c
3020
if (buddy >= installed->start && buddy < installed->end && pool->solvables[buddy].repo == installed)
src/libs/libsolv/solv/rules.c
3037
if (p > 0 && pool->solvables[p].repo == installed)
src/libs/libsolv/solv/rules.c
3050
if (pool->solvables[p].repo != installed)
src/libs/libsolv/solv/rules.c
3072
if (r->d == 0 && r->w2 == 0 && pool->solvables[r->p].repo == installed)
src/libs/libsolv/solv/rules.c
3093
if (pool->solvables[p].repo == installed)
src/libs/libsolv/solv/rules.c
3133
if (pool->solvables[p].repo != installed)
src/libs/libsolv/solv/rules.c
3140
if (pool->solvables[p].repo != installed)
src/libs/libsolv/solv/rules.c
3165
s = pool->solvables + ip;
src/libs/libsolv/solv/rules.c
3189
if (pool->solvables[pqp].repo == installed)
src/libs/libsolv/solv/rules.c
3194
printf("%s supplemented [%s]\n", pool_solvid2str(pool, ip), pool_dep2str(pool, sup));
src/libs/libsolv/solv/rules.c
3204
s = pool->solvables + ip;
src/libs/libsolv/solv/rules.c
3213
printf("removing %s\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/rules.c
3236
printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
src/libs/libsolv/solv/rules.c
3261
printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
src/libs/libsolv/solv/rules.c
327
dp2 = pool->whatprovidesdata + r->d;
src/libs/libsolv/solv/rules.c
3279
if (pool->solvables[p].repo == installed)
src/libs/libsolv/solv/rules.c
328
for (dp = pool->whatprovidesdata + d; *dp; dp++, dp2++)
src/libs/libsolv/solv/rules.c
3304
if (select == SOLVER_SOLVABLE && pool->solvables[what].repo != installed)
src/libs/libsolv/solv/rules.c
3323
s = pool->solvables + ip;
src/libs/libsolv/solv/rules.c
3335
printf("%s supplemented\n", pool_solvid2str(pool, ip));
src/libs/libsolv/solv/rules.c
3345
s = pool->solvables + ip;
src/libs/libsolv/solv/rules.c
3347
printf("adding back %s\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/rules.c
3368
printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
src/libs/libsolv/solv/rules.c
3395
printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
src/libs/libsolv/solv/rules.c
3419
if (pool->solvables[p].repo != installed)
src/libs/libsolv/solv/rules.c
3432
printf(" - %s\n", pool_solvid2str(pool, p));
src/libs/libsolv/solv/rules.c
3511
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
3518
map_init(&installedm, pool->nsolvables);
src/libs/libsolv/solv/rules.c
3520
if (pool->solvables[i].repo == installed)
src/libs/libsolv/solv/rules.c
3543
Solvable *s = pool->solvables + unneededq->elements[i];
src/libs/libsolv/solv/rules.c
3554
Solvable *sp = pool->solvables + p;
src/libs/libsolv/solv/rules.c
3577
printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
src/libs/libsolv/solv/rules.c
3579
printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
src/libs/libsolv/solv/rules.c
3586
Solvable *s = pool->solvables + unneededq->elements[i];
src/libs/libsolv/solv/rules.c
3601
Solvable *sp = pool->solvables + p;
src/libs/libsolv/solv/rules.c
3623
printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
src/libs/libsolv/solv/rules.c
3625
printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
src/libs/libsolv/solv/rules.c
366
r->w2 = pool->whatprovidesdata[d];
src/libs/libsolv/solv/rules.c
403
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
408
sn = pool->solvables + n;
src/libs/libsolv/solv/rules.c
413
s = pool->solvables + p;
src/libs/libsolv/solv/rules.c
418
if (pool_match_nevr(pool, pool->solvables + p, con))
src/libs/libsolv/solv/rules.c
426
return pool_queuetowhatprovides(pool, &q);
src/libs/libsolv/solv/rules.c
45
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
461
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
487
queue_push(&workq, s - pool->solvables); /* push solvable Id to work queue */
src/libs/libsolv/solv/rules.c
50
Reldep *rd = GETRELDEP(pool, dep);
src/libs/libsolv/solv/rules.c
505
s = pool->solvables + n; /* s = Solvable in question */
src/libs/libsolv/solv/rules.c
519
? pool_disabled_solvable(pool, s)
src/libs/libsolv/solv/rules.c
520
: !pool_installable(pool, s))
src/libs/libsolv/solv/rules.c
522
POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable\n", pool_solvable2str(pool, s), (Id)(s - pool->solvables));
src/libs/libsolv/solv/rules.c
528
if (pool->nscallback && !strncmp("product:", pool_id2str(pool, s->name), 8))
src/libs/libsolv/solv/rules.c
530
Id buddy = pool->nscallback(pool, pool->nscallbackdata, NAMESPACE_PRODUCTBUDDY, n);
src/libs/libsolv/solv/rules.c
531
if (buddy > 0 && buddy != SYSTEMSOLVABLE && buddy != n && buddy < pool->nsolvables)
src/libs/libsolv/solv/rules.c
533
addrpmrule(solv, n, -buddy, SOLVER_RULE_RPM_PACKAGE_REQUIRES, solvable_selfprovidedep(pool->solvables + n));
src/libs/libsolv/solv/rules.c
534
addrpmrule(solv, buddy, -n, SOLVER_RULE_RPM_PACKAGE_REQUIRES, solvable_selfprovidedep(pool->solvables + buddy));
src/libs/libsolv/solv/rules.c
553
dp = pool_whatprovides_ptr(pool, req);
src/libs/libsolv/solv/rules.c
568
if (pool->solvables[p].repo == installed)
src/libs/libsolv/solv/rules.c
574
POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "ignoring broken requires %s of installed package %s\n", pool_dep2str(pool, req), pool_solvable2str(pool, s));
src/libs/libsolv/solv/rules.c
582
POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable (%s)\n", pool_solvable2str(pool, s), (Id)(s - pool->solvables), pool_dep2str(pool, req));
src/libs/libsolv/solv/rules.c
589
POOL_DEBUG(SOLV_DEBUG_RULE_CREATION," %s requires %s\n", pool_solvable2str(pool, s), pool_dep2str(pool, req));
src/libs/libsolv/solv/rules.c
591
POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, " provided by %s\n", pool_solvid2str(pool, dp[i]));
src/libs/libsolv/solv/rules.c
596
addrpmrule(solv, -n, dp - pool->whatprovidesdata, SOLVER_RULE_RPM_PACKAGE_REQUIRES, req);
src/libs/libsolv/solv/rules.c
631
if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
src/libs/libsolv/solv/rules.c
640
if (ispatch && !pool_match_nevr(pool, pool->solvables + p, con))
src/libs/libsolv/solv/rules.c
643
if (dontfix && pool->solvables[p].repo == installed)
src/libs/libsolv/solv/rules.c
646
if (p == n && pool->forbidselfconflicts)
src/libs/libsolv/solv/rules.c
650
Reldep *rd = GETRELDEP(pool, con);
src/libs/libsolv/solv/rules.c
672
if ((!installed || s->repo != installed) || !pool->noinstalledobsoletes)
src/libs/libsolv/solv/rules.c
685
Solvable *ps = pool->solvables + p;
src/libs/libsolv/solv/rules.c
690
if (!pool->obsoleteusesprovides /* obsoletes are matched names, not provides */
src/libs/libsolv/solv/rules.c
691
&& !pool_match_nevr(pool, ps, obs))
src/libs/libsolv/solv/rules.c
693
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
src/libs/libsolv/solv/rules.c
711
Solvable *ps = pool->solvables + p;
src/libs/libsolv/solv/rules.c
720
if (!pool->implicitobsoleteusesprovides && s->name != ps->name)
src/libs/libsolv/solv/rules.c
722
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
src/libs/libsolv/solv/rules.c
770
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
776
for (i = n = 1; n < pool->nsolvables; i++, n++)
src/libs/libsolv/solv/rules.c
778
if (i == pool->nsolvables) /* wrap i */
src/libs/libsolv/solv/rules.c
783
s = pool->solvables + i;
src/libs/libsolv/solv/rules.c
786
if (s->repo != pool->installed && !pool_installable(pool, s))
src/libs/libsolv/solv/rules.c
828
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
838
if (!MAPTST(m, s - pool->solvables))
src/libs/libsolv/solv/rules.c
843
solver_addrpmrulesforsolvable(solv, pool->solvables + qs.elements[i], m);
src/libs/libsolv/solv/rules.c
859
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
875
return s - pool->solvables;
src/libs/libsolv/solv/rules.c
879
Solvable *ns = pool->solvables + qs->elements[i];
src/libs/libsolv/solv/rules.c
881
return s - pool->solvables;
src/libs/libsolv/solv/rules.c
89
Pool *pool = dp;
src/libs/libsolv/solv/rules.c
923
Pool *pool = solv->pool;
src/libs/libsolv/solv/rules.c
929
p = s - pool->solvables;
src/libs/libsolv/solv/rules.c
942
d = pool_queuetowhatprovides(pool, &qs);
src/libs/libsolv/solv/rules.c
949
Solvable *ps = pool->solvables + qs.elements[i];
src/libs/libsolv/solv/rules.c
958
(solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, s - pool->solvables - solv->installed->start))))
src/libs/libsolv/solv/rules.c
962
solv->multiversionupdaters[s - pool->solvables - solv->installed->start] = d;
src/libs/libsolv/solv/rules.c
966
queue_push(&solv->orphaned, s - pool->solvables); /* treat as orphaned */
src/libs/libsolv/solv/rules.c
981
d = qs.count ? pool_queuetowhatprovides(pool, &qs) : 0;
src/libs/libsolv/solv/selection.c
120
selection_flatten(Pool *pool, Queue *selection)
src/libs/libsolv/solv/selection.c
135
selection_solvables(pool, selection, &q);
src/libs/libsolv/solv/selection.c
145
selection->elements[1] = pool_queuetowhatprovides(pool, &q);
src/libs/libsolv/solv/selection.c
155
selection_filter_rel(Pool *pool, Queue *selection, Id relflags, Id relevr)
src/libs/libsolv/solv/selection.c
174
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/selection.c
178
rel = pool_rel2id(pool, relname, relevr, relflags, 1);
src/libs/libsolv/solv/selection.c
180
if (pool_match_nevr(pool, s, rel))
src/libs/libsolv/solv/selection.c
195
selection->elements[i + 1] = pool_queuetowhatprovides(pool, &q);
src/libs/libsolv/solv/selection.c
205
Reldep *rd = GETRELDEP(pool, id);
src/libs/libsolv/solv/selection.c
209
selection->elements[i + 1] = pool_rel2id(pool, id, relevr, relflags, 1);
src/libs/libsolv/solv/selection.c
217
if (pool->disttype == DISTTYPE_DEB)
src/libs/libsolv/solv/selection.c
221
const char *rel = strrchr(pool_id2str(pool, relevr), '-');
src/libs/libsolv/solv/selection.c
226
selection_prune(pool, selection);
src/libs/libsolv/solv/selection.c
230
selection_addsrc(Pool *pool, Queue *selection, int flags)
src/libs/libsolv/solv/selection.c
248
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/selection.c
253
if (pool_disabled_solvable(pool, s))
src/libs/libsolv/solv/selection.c
257
else if (s->repo != pool->installed && !pool_installable(pool, s))
src/libs/libsolv/solv/selection.c
27
str2archid(Pool *pool, const char *arch)
src/libs/libsolv/solv/selection.c
271
selection->elements[i + 1] = pool_queuetowhatprovides(pool, &q);
src/libs/libsolv/solv/selection.c
278
selection_depglob(Pool *pool, Queue *selection, const char *name, int flags)
src/libs/libsolv/solv/selection.c
294
if ((flags & SELECTION_INSTALLED_ONLY) != 0 && !pool->installed)
src/libs/libsolv/solv/selection.c
299
id = pool_str2id(pool, name, 0);
src/libs/libsolv/solv/selection.c
307
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/selection.c
310
if ((flags & SELECTION_INSTALLED_ONLY) != 0 && s->repo != pool->installed)
src/libs/libsolv/solv/selection.c
313
id = pool_rel2id(pool, id, ARCH_SRC, REL_ARCH, 1);
src/libs/libsolv/solv/selection.c
316
selection_addsrc(pool, selection, flags);
src/libs/libsolv/solv/selection.c
32
id = pool_str2id(pool, arch, 0);
src/libs/libsolv/solv/selection.c
322
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/selection.c
325
if ((flags & SELECTION_INSTALLED_ONLY) != 0 && s->repo != pool->installed)
src/libs/libsolv/solv/selection.c
327
if (pool_disabled_solvable(pool, s))
src/libs/libsolv/solv/selection.c
330
id = pool_rel2id(pool, id, ARCH_SRC, REL_ARCH, 1);
src/libs/libsolv/solv/selection.c
333
selection_addsrc(pool, selection, flags);
src/libs/libsolv/solv/selection.c
340
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/selection.c
341
if ((flags & SELECTION_INSTALLED_ONLY) != 0 && s->repo != pool->installed)
src/libs/libsolv/solv/selection.c
347
id = pool_rel2id(pool, id, ARCH_SRC, REL_ARCH, 1);
src/libs/libsolv/solv/selection.c
35
if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
src/libs/libsolv/solv/selection.c
350
selection_addsrc(pool, selection, flags);
src/libs/libsolv/solv/selection.c
388
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/selection.c
389
if (s->repo != pool->installed && !pool_installable(pool, s))
src/libs/libsolv/solv/selection.c
393
if (pool_disabled_solvable(pool, s))
src/libs/libsolv/solv/selection.c
396
if ((flags & SELECTION_INSTALLED_ONLY) != 0 && s->repo != pool->installed)
src/libs/libsolv/solv/selection.c
399
if ((doglob ? fnmatch(name, pool_id2str(pool, id), globflags) : strcasecmp(name, pool_id2str(pool, id))) == 0)
src/libs/libsolv/solv/selection.c
402
id = pool_rel2id(pool, id, ARCH_SRC, REL_ARCH, 1);
src/libs/libsolv/solv/selection.c
41
selection_prune(Pool *pool, Queue *selection)
src/libs/libsolv/solv/selection.c
415
selection_addsrc(pool, selection, flags);
src/libs/libsolv/solv/selection.c
422
for (id = 1; id < pool->ss.nstrings; id++)
src/libs/libsolv/solv/selection.c
424
if (!pool->whatprovides[id])
src/libs/libsolv/solv/selection.c
426
if ((doglob ? fnmatch(name, pool_id2str(pool, id), globflags) : strcasecmp(name, pool_id2str(pool, id))) == 0)
src/libs/libsolv/solv/selection.c
431
if (pool->solvables[p].repo == pool->installed)
src/libs/libsolv/solv/selection.c
447
selection_depglob_arch(Pool *pool, Queue *selection, const char *name, int flags)
src/libs/libsolv/solv/selection.c
453
if ((ret = selection_depglob(pool, selection, name, flags)) != 0)
src/libs/libsolv/solv/selection.c
458
if ((r = strrchr(name, '.')) != 0 && r[1] && (archid = str2archid(pool, r + 1)) != 0)
src/libs/libsolv/solv/selection.c
464
if ((ret = selection_depglob(pool, selection, rname, flags)) != 0)
src/libs/libsolv/solv/selection.c
466
selection_filter_rel(pool, selection, REL_ARCH, archid);
src/libs/libsolv/solv/selection.c
476
selection_filelist(Pool *pool, Queue *selection, const char *name, int flags)
src/libs/libsolv/solv/selection.c
486
dataiterator_init(&di, pool, flags & SELECTION_INSTALLED_ONLY ? pool->installed : 0, 0, SOLVABLE_FILELIST, name, type|SEARCH_FILES|SEARCH_COMPLETE_FILELIST);
src/libs/libsolv/solv/selection.c
489
Solvable *s = pool->solvables + di.solvid;
src/libs/libsolv/solv/selection.c
492
if (s->repo != pool->installed && !pool_installable(pool, s))
src/libs/libsolv/solv/selection.c
496
if (pool_disabled_solvable(pool, s))
src/libs/libsolv/solv/selection.c
499
if ((flags & SELECTION_INSTALLED_ONLY) != 0 && s->repo != pool->installed)
src/libs/libsolv/solv/selection.c
508
queue_push2(selection, SOLVER_SOLVABLE_ONE_OF, pool_queuetowhatprovides(pool, &q));
src/libs/libsolv/solv/selection.c
516
selection_rel(Pool *pool, Queue *selection, const char *name, int flags)
src/libs/libsolv/solv/selection.c
54
Repo *repo = pool_id2repo(pool, selection->elements[i + 1]);
src/libs/libsolv/solv/selection.c
557
if ((ret = selection_depglob_arch(pool, selection, rname, flags)) != 0)
src/libs/libsolv/solv/selection.c
560
selection_filter_rel(pool, selection, rflags, pool_str2id(pool, r, 1));
src/libs/libsolv/solv/selection.c
569
# define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
src/libs/libsolv/solv/selection.c
578
selection_filter_evr(Pool *pool, Queue *selection, char *evr)
src/libs/libsolv/solv/selection.c
597
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/selection.c
598
const char *sevr = pool_id2str(pool, s->evr);
src/libs/libsolv/solv/selection.c
607
int r = pool_evrcmp_str(pool, sp != sevr ? sp + 1 : sevr, evr, EVRCMP_DEPCMP);
src/libs/libsolv/solv/selection.c
626
id = pool_str2id(pool, evr, 1); /* no match at all or zero epoch */
src/libs/libsolv/solv/selection.c
633
id = pool_str2id(pool, evrx, 1);
src/libs/libsolv/solv/selection.c
640
selection->elements[j + 1] = pool_queuetowhatprovides(pool, &q);
src/libs/libsolv/solv/selection.c
646
selection_filter_rel(pool, &q, REL_EQ, id);
src/libs/libsolv/solv/selection.c
659
selection_canon(Pool *pool, Queue *selection, const char *name, int flags)
src/libs/libsolv/solv/selection.c
674
if (pool->disttype == DISTTYPE_DEB)
src/libs/libsolv/solv/selection.c
681
if ((ret = selection_depglob(pool, selection, rname, flags)) == 0)
src/libs/libsolv/solv/selection.c
687
if ((r2 = strrchr(r, '_')) != 0 && r[1] && (archid = str2archid(pool, r + 1)) != 0)
src/libs/libsolv/solv/selection.c
690
selection_filter_rel(pool, selection, REL_ARCH, archid);
src/libs/libsolv/solv/selection.c
692
selection_filter_rel(pool, selection, REL_EQ, pool_str2id(pool, r, 1));
src/libs/libsolv/solv/selection.c
697
if (pool->disttype == DISTTYPE_HAIKU)
src/libs/libsolv/solv/selection.c
704
if ((ret = selection_depglob(pool, selection, rname, flags)) == 0)
src/libs/libsolv/solv/selection.c
710
if ((r2 = strrchr(r, '-')) != 0 && r[1] && (archid = str2archid(pool, r + 1)) != 0)
src/libs/libsolv/solv/selection.c
713
selection_filter_rel(pool, selection, REL_ARCH, archid);
src/libs/libsolv/solv/selection.c
715
selection_filter_rel(pool, selection, REL_EQ, pool_str2id(pool, r, 1));
src/libs/libsolv/solv/selection.c
727
if ((r2 = strrchr(r + 1, '.')) != 0 && r2[1] && (archid = str2archid(pool, r2 + 1)) != 0)
src/libs/libsolv/solv/selection.c
733
if ((ret = selection_depglob(pool, selection, rname, flags)) == 0)
src/libs/libsolv/solv/selection.c
744
if ((ret = selection_depglob(pool, selection, rname, flags)) == 0)
src/libs/libsolv/solv/selection.c
751
selection_filter_rel(pool, selection, REL_ARCH, archid);
src/libs/libsolv/solv/selection.c
752
selection_filter_evr(pool, selection, r + 1); /* magic epoch promotion */
src/libs/libsolv/solv/selection.c
758
selection_make(Pool *pool, Queue *selection, const char *name, int flags)
src/libs/libsolv/solv/selection.c
765
ret = selection_filelist(pool, selection, name, flags);
src/libs/libsolv/solv/selection.c
767
ret = selection_rel(pool, selection, name, flags);
src/libs/libsolv/solv/selection.c
769
ret = selection_depglob_arch(pool, selection, name, flags);
src/libs/libsolv/solv/selection.c
771
ret = selection_canon(pool, selection, name, flags);
src/libs/libsolv/solv/selection.c
775
selection_flatten(pool, selection);
src/libs/libsolv/solv/selection.c
780
selection_filter(Pool *pool, Queue *sel1, Queue *sel2)
src/libs/libsolv/solv/selection.c
801
map_init(&m2, pool->nsolvables);
src/libs/libsolv/solv/selection.c
81
selection_solvables(Pool *pool, Queue *selection, Queue *pkgs)
src/libs/libsolv/solv/selection.c
814
Repo *repo = pool_id2repo(pool, sel2->elements[i + 1]);
src/libs/libsolv/solv/selection.c
845
Repo *repo = pool_id2repo(pool, sel1->elements[i + 1]);
src/libs/libsolv/solv/selection.c
875
sel1->elements[j + 1] = pool_queuetowhatprovides(pool, &q1);
src/libs/libsolv/solv/selection.c
890
selection_add(Pool *pool, Queue *sel1, Queue *sel2)
src/libs/libsolv/solv/selection.c
97
Repo *repo = pool_id2repo(pool, selection->elements[i + 1]);
src/libs/libsolv/solv/selection.h
36
extern int selection_make(Pool *pool, Queue *selection, const char *name, int flags);
src/libs/libsolv/solv/selection.h
37
extern void selection_filter(Pool *pool, Queue *sel1, Queue *sel2);
src/libs/libsolv/solv/selection.h
38
extern void selection_add(Pool *pool, Queue *sel1, Queue *sel2);
src/libs/libsolv/solv/selection.h
39
extern void selection_solvables(Pool *pool, Queue *selection, Queue *pkgs);
src/libs/libsolv/solv/solvable.c
105
return repo_lookup_str(s->repo, s - s->repo->pool->solvables, keyname);
src/libs/libsolv/solv/solvable.c
111
Pool *pool;
src/libs/libsolv/solv/solvable.c
119
pool = s->repo->pool;
src/libs/libsolv/solv/solvable.c
128
if (!pool->whatprovides)
src/libs/libsolv/solv/solvable.c
135
s2 = pool->solvables + p;
src/libs/libsolv/solv/solvable.c
154
Pool *pool;
src/libs/libsolv/solv/solvable.c
161
pool = s->repo->pool;
src/libs/libsolv/solv/solvable.c
162
if (!pool->nlanguages)
src/libs/libsolv/solv/solvable.c
164
cols = pool->nlanguages + 1;
src/libs/libsolv/solv/solvable.c
165
if (!pool->languagecache)
src/libs/libsolv/solv/solvable.c
167
pool->languagecache = solv_calloc(cols * ID_NUM_INTERNAL, sizeof(Id));
src/libs/libsolv/solv/solvable.c
168
pool->languagecacheother = 0;
src/libs/libsolv/solv/solvable.c
172
row = pool->languagecache + ID_NUM_INTERNAL * cols;
src/libs/libsolv/solv/solvable.c
173
for (i = 0; i < pool->languagecacheother; i++, row += cols)
src/libs/libsolv/solv/solvable.c
176
if (i >= pool->languagecacheother)
src/libs/libsolv/solv/solvable.c
178
pool->languagecache = solv_realloc2(pool->languagecache, pool->languagecacheother + 1, cols * sizeof(Id));
src/libs/libsolv/solv/solvable.c
179
row = pool->languagecache + cols * (ID_NUM_INTERNAL + pool->languagecacheother++);
src/libs/libsolv/solv/solvable.c
184
row = pool->languagecache + keyname * cols;
src/libs/libsolv/solv/solvable.c
186
for (i = 0; i < pool->nlanguages; i++, row++)
src/libs/libsolv/solv/solvable.c
189
*row = pool_id2langid(pool, keyname, pool->languages[i], 1);
src/libs/libsolv/solv/solvable.c
202
Id id = pool_id2langid(s->repo->pool, keyname, lang, 0);
src/libs/libsolv/solv/solvable.c
216
return repo_lookup_num(s->repo, s - s->repo->pool->solvables, keyname, notfound);
src/libs/libsolv/solv/solvable.c
234
return repo_lookup_void(s->repo, s - s->repo->pool->solvables, keyname);
src/libs/libsolv/solv/solvable.c
243
if (repo_lookup_type(s->repo, s - s->repo->pool->solvables, keyname) == REPOKEY_TYPE_VOID)
src/libs/libsolv/solv/solvable.c
245
return repo_lookup_num(s->repo, s - s->repo->pool->solvables, keyname, 0) == 1;
src/libs/libsolv/solv/solvable.c
258
return repo_lookup_bin_checksum(repo, s - repo->pool->solvables, keyname, typep);
src/libs/libsolv/solv/solvable.c
265
return chk ? pool_bin2hex(s->repo->pool, chk, solv_chksum_len(*typep)) : 0;
src/libs/libsolv/solv/solvable.c
269
evrid2vrstr(Pool *pool, Id evrid)
src/libs/libsolv/solv/solvable.c
271
const char *p, *evr = pool_id2str(pool, evrid);
src/libs/libsolv/solv/solvable.c
28
pool_solvable2str(Pool *pool, Solvable *s)
src/libs/libsolv/solv/solvable.c
282
Pool *pool;
src/libs/libsolv/solv/solvable.c
291
pool = s->repo->pool;
src/libs/libsolv/solv/solvable.c
295
mediadir = pool_id2str(pool, s->arch);
src/libs/libsolv/solv/solvable.c
303
name = pool_id2str(pool, s->name);
src/libs/libsolv/solv/solvable.c
304
evr = evrid2vrstr(pool, s->evr);
src/libs/libsolv/solv/solvable.c
305
arch = pool_id2str(pool, s->arch);
src/libs/libsolv/solv/solvable.c
307
loc = pool_alloctmpspace(pool, l + strlen(name) + strlen(evr) + strlen(arch) + 7);
src/libs/libsolv/solv/solvable.c
318
loc = pool_alloctmpspace(pool, l + strlen(mediafile) + 1);
src/libs/libsolv/solv/solvable.c
33
n = pool_id2str(pool, s->name);
src/libs/libsolv/solv/solvable.c
339
Pool *pool;
src/libs/libsolv/solv/solvable.c
34
e = pool_id2str(pool, s->evr);
src/libs/libsolv/solv/solvable.c
345
pool = s->repo->pool;
src/libs/libsolv/solv/solvable.c
347
name = pool_id2str(pool, s->name);
src/libs/libsolv/solv/solvable.c
354
evr = evrid2vrstr(pool, s->evr);
src/libs/libsolv/solv/solvable.c
36
a = pool_id2str(pool, s->arch);
src/libs/libsolv/solv/solvable.c
360
str = pool_tmpjoin(pool, name, evr ? "-" : 0, evr);
src/libs/libsolv/solv/solvable.c
361
str = pool_tmpappend(pool, str, ".", pool_id2str(pool, archid));
src/libs/libsolv/solv/solvable.c
362
return pool_tmpappend(pool, str, ".rpm", 0);
src/libs/libsolv/solv/solvable.c
371
static inline Id dep2name(Pool *pool, Id dep)
src/libs/libsolv/solv/solvable.c
375
Reldep *rd = rd = GETRELDEP(pool, dep);
src/libs/libsolv/solv/solvable.c
381
static int providedbyinstalled_multiversion(Pool *pool, Map *installed, Id n, Id con)
src/libs/libsolv/solv/solvable.c
384
Solvable *sn = pool->solvables + n;
src/libs/libsolv/solv/solvable.c
388
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/solvable.c
393
if (pool_match_nevr(pool, pool->solvables + p, con))
src/libs/libsolv/solv/solvable.c
40
if (pool->havedistepoch)
src/libs/libsolv/solv/solvable.c
400
static inline int providedbyinstalled(Pool *pool, Map *installed, Id dep, int ispatch, Map *multiversionmap)
src/libs/libsolv/solv/solvable.c
407
if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
src/libs/libsolv/solv/solvable.c
410
if (providedbyinstalled_multiversion(pool, installed, p, dep))
src/libs/libsolv/solv/solvable.c
437
Pool *pool = s->repo->pool;
src/libs/libsolv/solv/solvable.c
444
if (conflictsmap && MAPTST(conflictsmap, s - pool->solvables))
src/libs/libsolv/solv/solvable.c
453
r = providedbyinstalled(pool, installedmap, req, 0, 0);
src/libs/libsolv/solv/solvable.c
464
if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
src/libs/libsolv/solv/solvable.c
469
if (providedbyinstalled(pool, installedmap, con, ispatch, multiversionmap))
src/libs/libsolv/solv/solvable.c
47
p = pool_alloctmpspace(pool, nl + el + al + 3);
src/libs/libsolv/solv/solvable.c
477
con = dep2name(pool, con);
src/libs/libsolv/solv/solvable.c
478
if (providedbyinstalled(pool, installedmap, con, ispatch, multiversionmap))
src/libs/libsolv/solv/solvable.c
495
if (providedbyinstalled(pool, installedmap, obs, 0, 0))
src/libs/libsolv/solv/solvable.c
504
s2 = pool->solvables + p;
src/libs/libsolv/solv/solvable.c
515
p = s - pool->solvables;
src/libs/libsolv/solv/solvable.c
516
for (i = 1; i < pool->nsolvables; i++)
src/libs/libsolv/solv/solvable.c
520
s2 = pool->solvables + i;
src/libs/libsolv/solv/solvable.c
526
dp = pool_whatprovides_ptr(pool, con);
src/libs/libsolv/solv/solvable.c
544
Pool *pool = s->repo->pool;
src/libs/libsolv/solv/solvable.c
550
map_init(&installedmap, pool->nsolvables);
src/libs/libsolv/solv/solvable.c
56
p[nl + el] = pool->disttype == DISTTYPE_HAIKU ? '-' : '.';
src/libs/libsolv/solv/solvable.c
570
Pool *pool = s->repo->pool;
src/libs/libsolv/solv/solvable.c
576
map_init(&installedmap, pool->nsolvables);
src/libs/libsolv/solv/solvable.c
586
pool_illegal_vendorchange(Pool *pool, Solvable *s1, Solvable *s2)
src/libs/libsolv/solv/solvable.c
591
if (pool->custom_vendorcheck)
src/libs/libsolv/solv/solvable.c
592
return pool->custom_vendorcheck(pool, s1, s2);
src/libs/libsolv/solv/solvable.c
598
vendormask1 = pool_vendor2mask(pool, v1);
src/libs/libsolv/solv/solvable.c
601
vendormask2 = pool_vendor2mask(pool, v2);
src/libs/libsolv/solv/solvable.c
612
Pool *pool = s->repo->pool;
src/libs/libsolv/solv/solvable.c
625
rd = GETRELDEP(pool, con);
src/libs/libsolv/solv/solvable.c
633
si = pool->solvables + p;
src/libs/libsolv/solv/solvable.c
634
if (!pool_match_nevr(pool, si, con))
src/libs/libsolv/solv/solvable.c
638
Solvable *s2 = pool->solvables + p2;
src/libs/libsolv/solv/solvable.c
639
if (!pool_match_nevr(pool, s2, rd->name))
src/libs/libsolv/solv/solvable.c
641
if (pool_match_nevr(pool, s2, con))
src/libs/libsolv/solv/solvable.c
649
if (!pool_illegal_vendorchange(pool, si, s2))
src/libs/libsolv/solv/solvable.c
67
return repo_lookup_type(s->repo, s - s->repo->pool->solvables, keyname);
src/libs/libsolv/solv/solvable.c
673
pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap)
src/libs/libsolv/solv/solvable.c
680
map_init(installedmap, pool->nsolvables);
src/libs/libsolv/solv/solvable.c
682
map_init(conflictsmap, pool->nsolvables);
src/libs/libsolv/solv/solvable.c
691
s = pool->solvables + p;
src/libs/libsolv/solv/solvable.c
697
dp = pool_whatprovides_ptr(pool, con);
src/libs/libsolv/solv/solvable.c
75
return repo_lookup_id(s->repo, s - s->repo->pool->solvables, keyname);
src/libs/libsolv/solv/solvable.c
753
Pool *pool;
src/libs/libsolv/solv/solvable.c
759
pool = s->repo->pool;
src/libs/libsolv/solv/solvable.c
767
rd = GETRELDEP(pool, prov);
src/libs/libsolv/solv/solvable.c
772
return pool_rel2id(pool, s->name, s->evr, REL_EQ, 1);
src/libs/libsolv/solv/solvable.c
779
repo_set_id(s->repo, s - s->repo->pool->solvables, keyname, id);
src/libs/libsolv/solv/solvable.c
785
repo_set_num(s->repo, s - s->repo->pool->solvables, keyname, num);
src/libs/libsolv/solv/solvable.c
791
repo_set_str(s->repo, s - s->repo->pool->solvables, keyname, str);
src/libs/libsolv/solv/solvable.c
797
repo_set_poolstr(s->repo, s - s->repo->pool->solvables, keyname, str);
src/libs/libsolv/solv/solvable.c
803
repo_add_poolstr_array(s->repo, s - s->repo->pool->solvables, keyname, str);
src/libs/libsolv/solv/solvable.c
809
repo_add_idarray(s->repo, s - s->repo->pool->solvables, keyname, id);
src/libs/libsolv/solv/solvable.c
815
repo_add_deparray(s->repo, s - s->repo->pool->solvables, keyname, dep, marker);
src/libs/libsolv/solv/solvable.c
821
repo_set_idarray(s->repo, s - s->repo->pool->solvables, keyname, q);
src/libs/libsolv/solv/solvable.c
827
repo_set_deparray(s->repo, s - s->repo->pool->solvables, keyname, q, marker);
src/libs/libsolv/solv/solvable.c
833
repo_unset(s->repo, s - s->repo->pool->solvables, keyname);
src/libs/libsolv/solv/solvable.c
86
return repo_lookup_idarray(s->repo, s - s->repo->pool->solvables, keyname, q);
src/libs/libsolv/solv/solvable.c
97
return repo_lookup_deparray(s->repo, s - s->repo->pool->solvables, keyname, q, marker);
src/libs/libsolv/solv/solver.c
1022
Id name = pool->solvables[-solv->rules[why].p].name;
src/libs/libsolv/solv/solver.c
1023
while (why > solv->infarchrules && pool->solvables[-solv->rules[why - 1].p].name == name)
src/libs/libsolv/solv/solver.c
1028
Id name = pool->solvables[-solv->rules[why].p].name;
src/libs/libsolv/solv/solver.c
1029
while (why > solv->duprules && pool->solvables[-solv->rules[why - 1].p].name == name)
src/libs/libsolv/solv/solver.c
1069
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
1092
map_init(&seen, pool->nsolvables);
src/libs/libsolv/solv/solver.c
1099
dp = d ? pool->whatprovidesdata + d : 0;
src/libs/libsolv/solv/solver.c
111
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
1132
dp = d ? pool->whatprovidesdata + d : 0;
src/libs/libsolv/solv/solver.c
117
Reldep *rd = GETRELDEP(pool, dep);
src/libs/libsolv/solv/solver.c
1217
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
1255
dp = solv->pool->whatprovidesdata + d;
src/libs/libsolv/solv/solver.c
1289
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
1363
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
1376
if (solver_is_supplementing(solv, pool->solvables + dq->elements[i]))
src/libs/libsolv/solv/solver.c
1392
POOL_DEBUG(SOLV_DEBUG_POLICY, "installing %s\n", pool_solvid2str(pool, p));
src/libs/libsolv/solv/solver.c
1416
solver_create(Pool *pool)
src/libs/libsolv/solv/solver.c
1420
solv->pool = pool;
src/libs/libsolv/solv/solver.c
1421
solv->installed = pool->installed;
src/libs/libsolv/solv/solver.c
1444
map_init(&solv->recommendsmap, pool->nsolvables);
src/libs/libsolv/solv/solver.c
1445
map_init(&solv->suggestsmap, pool->nsolvables);
src/libs/libsolv/solv/solver.c
1449
solv->decisionmap = (Id *)solv_calloc(pool->nsolvables, sizeof(Id));
src/libs/libsolv/solv/solver.c
1616
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
168
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
1701
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
1789
Solvable *s = pool->solvables + dq.elements[j];
src/libs/libsolv/solv/solver.c
1843
s = pool->solvables + i;
src/libs/libsolv/solv/solver.c
1872
while ((p = pool->whatprovidesdata[d++]) != 0)
src/libs/libsolv/solv/solver.c
1938
POOL_DEBUG(SOLV_DEBUG_POLICY, "cleandeps erasing %s\n", pool_solvid2str(pool, i));
src/libs/libsolv/solv/solver.c
1946
POOL_DEBUG(SOLV_DEBUG_POLICY, "keeping %s\n", pool_solvid2str(pool, i));
src/libs/libsolv/solv/solver.c
2024
dp = pool->whatprovidesdata + r->d;
src/libs/libsolv/solv/solver.c
2057
if (pool->solvables[dq.elements[j]].repo == installed && MAPTST(&solv->cleandepsmap, dq.elements[j] - installed->start))
src/libs/libsolv/solv/solver.c
2090
s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
2095
POOL_DEBUG(SOLV_DEBUG_POLICY, "cleandeps erasing %s\n", pool_solvid2str(pool, p));
src/libs/libsolv/solv/solver.c
2114
for (i = 1; i < pool->nsolvables; i++)
src/libs/libsolv/solv/solver.c
2122
s = pool->solvables + i;
src/libs/libsolv/solv/solver.c
2141
if (solv->dupmap_all && solv->installed && pool->solvables[p].repo == solv->installed && (solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - solv->installed->start))))
src/libs/libsolv/solv/solver.c
2151
s = pool->solvables + i;
src/libs/libsolv/solv/solver.c
2154
if (!pool_installable(pool, s))
src/libs/libsolv/solv/solver.c
2171
map_init(&obsmap, pool->nsolvables);
src/libs/libsolv/solv/solver.c
2174
s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
2208
s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
2217
s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
2232
s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
2250
s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
2252
if (solv->decisionmap[p2] > 0 && pool->solvables[p2].name == s->name)
src/libs/libsolv/solv/solver.c
2279
POOL_DEBUG(SOLV_DEBUG_POLICY, "installing supplemented %s\n", pool_solvid2str(pool, p));
src/libs/libsolv/solv/solver.c
2281
POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended %s\n", pool_solvid2str(pool, p));
src/libs/libsolv/solv/solver.c
2292
map_init(&dqmap, pool->nsolvables);
src/libs/libsolv/solv/solver.c
2302
POOL_DEBUG(SOLV_DEBUG_POLICY, "installing supplemented %s\n", pool_solvid2str(pool, p));
src/libs/libsolv/solv/solver.c
2325
s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
2354
POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended %s\n", pool_solvid2str(pool, p));
src/libs/libsolv/solv/solver.c
2386
POOL_DEBUG(SOLV_DEBUG_SOLVER, "keeping orphaned %s\n", pool_solvid2str(pool, p));
src/libs/libsolv/solv/solver.c
239
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
2404
POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing orphaned %s\n", pool_solvid2str(pool, p));
src/libs/libsolv/solv/solver.c
2441
POOL_DEBUG(SOLV_DEBUG_SOLVER, "branching with %s\n", pool_solvid2str(pool, p));
src/libs/libsolv/solv/solver.c
2486
POOL_DEBUG(SOLV_DEBUG_SOLVER, "minimizing %d -> %d with %s\n", solv->decisionmap[p], lastl, pool_solvid2str(pool, p));
src/libs/libsolv/solv/solver.c
2536
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
2562
POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing conflict for package %s[%d]\n", pool_solvid2str(pool, -p), -p);
src/libs/libsolv/solv/solver.c
2601
dp = pool->whatprovidesdata + r->d;
src/libs/libsolv/solv/solver.c
2625
POOL_DEBUG(SOLV_DEBUG_SOLVER, "re-conflicting package %s[%d]\n", pool_solvid2str(pool, -new), -new);
src/libs/libsolv/solv/solver.c
2669
solver_calculate_multiversionmap(Pool *pool, Queue *job, Map *multiversionmap)
src/libs/libsolv/solv/solver.c
2682
map_grow(multiversionmap, pool->nsolvables);
src/libs/libsolv/solv/solver.c
2691
Repo *repo = pool_id2repo(pool, what);
src/libs/libsolv/solv/solver.c
2702
solver_calculate_noobsmap(Pool *pool, Queue *job, Map *multiversionmap)
src/libs/libsolv/solv/solver.c
2704
solver_calculate_multiversionmap(pool, job, multiversionmap);
src/libs/libsolv/solv/solver.c
2733
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
2734
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
2749
Solvable *si = pool->solvables + pi;
src/libs/libsolv/solv/solver.c
2772
Solvable *si = pool->solvables + pi;
src/libs/libsolv/solv/solver.c
2777
if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, si, obs))
src/libs/libsolv/solv/solver.c
2779
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, si))
src/libs/libsolv/solv/solver.c
2849
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
2855
for (i = 2, j = solv->rpmrules_end - 1; i < pool->nsolvables && j > 0; j--)
src/libs/libsolv/solv/solver.c
287
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
2876
for (; i < pool->nsolvables; i++)
src/libs/libsolv/solv/solver.c
2880
for (i = 2; i < pool->nsolvables; i++)
src/libs/libsolv/solv/solver.c
2923
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
2943
POOL_DEBUG(SOLV_DEBUG_STATS, "promoteepoch=%d, forbidselfconflicts=%d\n", pool->promoteepoch, pool->forbidselfconflicts);
src/libs/libsolv/solv/solver.c
2944
POOL_DEBUG(SOLV_DEBUG_STATS, "obsoleteusesprovides=%d, implicitobsoleteusesprovides=%d, obsoleteusescolors=%d\n", pool->obsoleteusesprovides, pool->implicitobsoleteusesprovides, pool->obsoleteusescolors);
src/libs/libsolv/solv/solver.c
2948
if (!pool->whatprovides)
src/libs/libsolv/solv/solver.c
2949
pool_createwhatprovides(pool);
src/libs/libsolv/solv/solver.c
2957
solv->pooljobcnt = pool->pooljobs.count;
src/libs/libsolv/solv/solver.c
2958
if (pool->pooljobs.count)
src/libs/libsolv/solv/solver.c
2959
queue_insertn(&solv->job, 0, pool->pooljobs.count, pool->pooljobs.elements);
src/libs/libsolv/solv/solver.c
3028
memset(solv->decisionmap, 0, pool->nsolvables * sizeof(Id));
src/libs/libsolv/solv/solver.c
3055
solver_calculate_multiversionmap(pool, job, &solv->multiversion);
src/libs/libsolv/solv/solver.c
3057
map_init(&addedmap, pool->nsolvables);
src/libs/libsolv/solv/solver.c
3060
map_init(&installcandidatemap, pool->nsolvables);
src/libs/libsolv/solv/solver.c
3092
s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
3114
Repo *repo = pool_id2repo(pool, what);
src/libs/libsolv/solv/solver.c
3142
s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
3201
solver_addrpmrulesforsolvable(solv, pool->solvables + p, &addedmap);
src/libs/libsolv/solv/solver.c
3240
for (i = 1; i < pool->nsolvables; i++)
src/libs/libsolv/solv/solver.c
3242
if (pool_installable(pool, pool->solvables + i))
src/libs/libsolv/solv/solver.c
3281
for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
src/libs/libsolv/solv/solver.c
3307
for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
src/libs/libsolv/solv/solver.c
3360
POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sinstall %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
src/libs/libsolv/solv/solver.c
3379
d = !q.count ? 0 : pool_queuetowhatprovides(pool, &q); /* internalize */
src/libs/libsolv/solv/solver.c
3384
Reldep *rd = GETRELDEP(pool, what);
src/libs/libsolv/solv/solver.c
3401
POOL_DEBUG(SOLV_DEBUG_JOB, "job: %s%serase %s\n", weak ? "weak " : "", how & SOLVER_CLEANDEPS ? "clean deps " : "", solver_select2str(pool, select, what));
src/libs/libsolv/solv/solver.c
3413
Repo *repo = pool_id2repo(pool, what);
src/libs/libsolv/solv/solver.c
3420
s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
3437
s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
345
Solvable *s = solv->pool->solvables + vv;
src/libs/libsolv/solv/solver.c
3457
POOL_DEBUG(SOLV_DEBUG_JOB, "job: %supdate %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
src/libs/libsolv/solv/solver.c
3460
POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sverify %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
src/libs/libsolv/solv/solver.c
3463
POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sweaken deps %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
src/libs/libsolv/solv/solver.c
3466
s = pool->solvables + what;
src/libs/libsolv/solv/solver.c
347
POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "conflicting %s (assertion)\n", pool_solvable2str(solv->pool, s));
src/libs/libsolv/solv/solver.c
3470
POOL_DEBUG(SOLV_DEBUG_JOB, "job: %smultiversion %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
src/libs/libsolv/solv/solver.c
3473
POOL_DEBUG(SOLV_DEBUG_JOB, "job: %slock %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
src/libs/libsolv/solv/solver.c
3477
solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, i, weak);
src/libs/libsolv/solv/solver.c
3481
Repo *repo = pool_id2repo(pool, what);
src/libs/libsolv/solv/solver.c
3484
solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, i, weak);
src/libs/libsolv/solv/solver.c
3487
solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, i, weak);
src/libs/libsolv/solv/solver.c
349
POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "installing %s (assertion)\n", pool_solvable2str(solv->pool, s));
src/libs/libsolv/solv/solver.c
3490
POOL_DEBUG(SOLV_DEBUG_JOB, "job: distupgrade %s\n", solver_select2str(pool, select, what));
src/libs/libsolv/solv/solver.c
3493
POOL_DEBUG(SOLV_DEBUG_JOB, "job: drop orphaned %s\n", solver_select2str(pool, select, what));
src/libs/libsolv/solv/solver.c
3498
s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
3507
POOL_DEBUG(SOLV_DEBUG_JOB, "job: user installed %s\n", solver_select2str(pool, select, what));
src/libs/libsolv/solv/solver.c
3537
if (pool->obsoleteusescolors)
src/libs/libsolv/solv/solver.c
3646
return transaction_create_decisionq(solv->pool, &solv->decisionq, &solv->multiversion);
src/libs/libsolv/solv/solver.c
3657
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
3667
map_init(&obsmap, pool->nsolvables);
src/libs/libsolv/solv/solver.c
3673
s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
3742
s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
3766
for (i = 1; i < pool->nsolvables; i++)
src/libs/libsolv/solv/solver.c
3774
s = pool->solvables + i;
src/libs/libsolv/solv/solver.c
3779
if (!pool_installable(pool, s))
src/libs/libsolv/solv/solver.c
3807
s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
3831
for (i = 1; i < pool->nsolvables; i++)
src/libs/libsolv/solv/solver.c
3839
s = pool->solvables + i;
src/libs/libsolv/solv/solver.c
3844
if (!pool_installable(pool, s))
src/libs/libsolv/solv/solver.c
3881
pool_calc_duchanges(solv->pool, &installedmap, mps, nmps);
src/libs/libsolv/solv/solver.c
3898
change = pool_calc_installsizechange(solv->pool, &installedmap);
src/libs/libsolv/solv/solver.c
3906
pool_create_state_maps(solv->pool, &solv->decisionq, installedmap, conflictsmap);
src/libs/libsolv/solv/solver.c
3912
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
3915
pool_create_state_maps(pool, &solv->decisionq, &installedmap, 0);
src/libs/libsolv/solv/solver.c
3916
pool_trivial_installable_multiversionmap(pool, &installedmap, pkgs, res, solv->multiversion.size ? &solv->multiversion : 0);
src/libs/libsolv/solv/solver.c
3920
Solvable *s = pool->solvables + pkgs->elements[i];
src/libs/libsolv/solv/solver.c
3921
if (!strncmp("patch:", pool_id2str(pool, s->name), 6) && solvable_is_irrelevant_patch(s, &installedmap))
src/libs/libsolv/solv/solver.c
4063
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
4081
for (i = 1; i < pool->nsolvables; i++)
src/libs/libsolv/solv/solver.c
4086
s = pool->solvables + i;
src/libs/libsolv/solv/solver.c
4114
s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
4136
if (pool->solvables[p2].repo == solv->installed)
src/libs/libsolv/solv/solver.c
4163
pool_job2solvables(Pool *pool, Queue *pkgs, Id how, Id what)
src/libs/libsolv/solv/solver.c
4175
Repo *repo = pool_id2repo(pool, what);
src/libs/libsolv/solv/solver.c
4189
pool_isemptyupdatejob(Pool *pool, Id how, Id what)
src/libs/libsolv/solv/solver.c
4197
if (!pool->installed)
src/libs/libsolv/solv/solver.c
4200
if (pool->solvables[p].repo == pool->installed)
src/libs/libsolv/solv/solver.c
4205
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
4208
Solvable *si = pool->solvables + pi;
src/libs/libsolv/solv/solver.c
4209
if (si->repo != pool->installed || si->name != s->name)
src/libs/libsolv/solv/solver.c
4220
Solvable *si = pool->solvables + pi;
src/libs/libsolv/solv/solver.c
4221
if (si->repo != pool->installed)
src/libs/libsolv/solv/solver.c
4223
if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, si, obs))
src/libs/libsolv/solv/solver.c
4225
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, si))
src/libs/libsolv/solv/solver.c
49
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
519
Solvable *s = solv->pool->solvables + vv;
src/libs/libsolv/solv/solver.c
521
POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "conflicting %s (weak assertion)\n", pool_solvable2str(solv->pool, s));
src/libs/libsolv/solv/solver.c
523
POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "installing %s (weak assertion)\n", pool_solvable2str(solv->pool, s));
src/libs/libsolv/solv/solver.c
567
int nsolvables = solv->pool->nsolvables;
src/libs/libsolv/solv/solver.c
58
rd = GETRELDEP(pool, dep);
src/libs/libsolv/solv/solver.c
603
int nsolvables = solv->pool->nsolvables;
src/libs/libsolv/solv/solver.c
642
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
649
Id *watches = solv->watches + pool->nsolvables; /* place ptr in middle */
src/libs/libsolv/solv/solver.c
65
s = pool->solvables + p;
src/libs/libsolv/solv/solver.c
737
for (dp = pool->whatprovidesdata + r->d; (p = *dp++) != 0;)
src/libs/libsolv/solv/solver.c
754
POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " -> move w%d to %s\n", (pkg == r->w1 ? 1 : 2), pool_solvid2str(pool, p));
src/libs/libsolv/solv/solver.c
756
POOL_DEBUG(SOLV_DEBUG_PROPAGATE," -> move w%d to !%s\n", (pkg == r->w1 ? 1 : 2), pool_solvid2str(pool, -p));
src/libs/libsolv/solv/solver.c
803
POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " -> decided to install %s\n", pool_solvid2str(pool, other_watch));
src/libs/libsolv/solv/solver.c
805
POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " -> decided to conflict %s\n", pool_solvid2str(pool, -other_watch));
src/libs/libsolv/solv/solver.c
82
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
830
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
844
map_init(&seen, pool->nsolvables);
src/libs/libsolv/solv/solver.c
852
dp = d ? pool->whatprovidesdata + d : 0;
src/libs/libsolv/solv/solver.c
87
Reldep *rd = GETRELDEP(pool, dep);
src/libs/libsolv/solv/solver.c
930
*dr = pool_queuetowhatprovides(pool, &r);
src/libs/libsolv/solv/solver.c
959
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.c
99
if (p == SYSTEMSOLVABLE || (solv->installed && pool->solvables[p].repo == solv->installed))
src/libs/libsolv/solv/solver.c
994
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver.h
276
extern Solver *solver_create(Pool *pool);
src/libs/libsolv/solv/solver.h
296
extern void solver_calculate_multiversionmap(Pool *pool, Queue *job, Map *multiversionmap);
src/libs/libsolv/solv/solver.h
297
extern void solver_calculate_noobsmap(Pool *pool, Queue *job, Map *multiversionmap); /* obsolete */
src/libs/libsolv/solv/solver.h
30
Pool *pool; /* back pointer to pool */
src/libs/libsolv/solv/solver.h
307
void pool_job2solvables(Pool *pool, Queue *pkgs, Id how, Id what);
src/libs/libsolv/solv/solver.h
308
int pool_isemptyupdatejob(Pool *pool, Id how, Id what);
src/libs/libsolv/solv/solver.h
314
pool->whatprovidesdata[pp++]))
src/libs/libsolv/solv/solver.h
328
pool_whatprovides(pool, what)), \
src/libs/libsolv/solv/solver.h
329
p = (select == SOLVER_SOLVABLE ? what : pool->whatprovidesdata[pp++]); \
src/libs/libsolv/solv/solver.h
330
p ; p = pool->whatprovidesdata[pp++]) \
src/libs/libsolv/solv/solver.h
332
pool_match_nevr(pool, pool->solvables + p, what) == 0) \
src/libs/libsolv/solv/solver_private.h
25
Pool *pool = solv->pool;
src/libs/libsolv/solv/solver_private.h
30
Reldep *rd = GETRELDEP(pool, dep);
src/libs/libsolv/solv/solverdebug.c
1003
return pool_tmpjoin(pool, "nothing provides requested ", pool_dep2str(pool, dep), 0);
src/libs/libsolv/solv/solverdebug.c
1005
return pool_tmpjoin(pool, pool_dep2str(pool, dep), " is provided by the system", 0);
src/libs/libsolv/solv/solverdebug.c
1009
return pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), " is not installable");
src/libs/libsolv/solv/solverdebug.c
1011
s = pool_tmpjoin(pool, "nothing provides ", pool_dep2str(pool, dep), 0);
src/libs/libsolv/solv/solverdebug.c
1012
return pool_tmpappend(pool, s, " needed by ", pool_solvid2str(pool, source));
src/libs/libsolv/solv/solverdebug.c
1014
s = pool_tmpjoin(pool, "cannot install both ", pool_solvid2str(pool, source), 0);
src/libs/libsolv/solv/solverdebug.c
1015
return pool_tmpappend(pool, s, " and ", pool_solvid2str(pool, target));
src/libs/libsolv/solv/solverdebug.c
1017
s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), 0);
src/libs/libsolv/solv/solverdebug.c
1018
s = pool_tmpappend(pool, s, " conflicts with ", pool_dep2str(pool, dep));
src/libs/libsolv/solv/solverdebug.c
1019
return pool_tmpappend(pool, s, " provided by ", pool_solvid2str(pool, target));
src/libs/libsolv/solv/solverdebug.c
1021
s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), 0);
src/libs/libsolv/solv/solverdebug.c
1022
s = pool_tmpappend(pool, s, " obsoletes ", pool_dep2str(pool, dep));
src/libs/libsolv/solv/solverdebug.c
1023
return pool_tmpappend(pool, s, " provided by ", pool_solvid2str(pool, target));
src/libs/libsolv/solv/solverdebug.c
1025
s = pool_tmpjoin(pool, "installed package ", pool_solvid2str(pool, source), 0);
src/libs/libsolv/solv/solverdebug.c
1026
s = pool_tmpappend(pool, s, " obsoletes ", pool_dep2str(pool, dep));
src/libs/libsolv/solv/solverdebug.c
1027
return pool_tmpappend(pool, s, " provided by ", pool_solvid2str(pool, target));
src/libs/libsolv/solv/solverdebug.c
1029
s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), 0);
src/libs/libsolv/solv/solverdebug.c
1030
s = pool_tmpappend(pool, s, " implicitly obsoletes ", pool_dep2str(pool, dep));
src/libs/libsolv/solv/solverdebug.c
1031
return pool_tmpappend(pool, s, " provided by ", pool_solvid2str(pool, target));
src/libs/libsolv/solv/solverdebug.c
1033
s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), " requires ");
src/libs/libsolv/solv/solverdebug.c
1034
return pool_tmpappend(pool, s, pool_dep2str(pool, dep), ", but none of the providers can be installed");
src/libs/libsolv/solv/solverdebug.c
1036
s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), " conflicts with ");
src/libs/libsolv/solv/solverdebug.c
1037
return pool_tmpappend(pool, s, pool_dep2str(pool, dep), " provided by itself");
src/libs/libsolv/solv/solverdebug.c
1046
Pool *pool = solv->pool;
src/libs/libsolv/solv/solverdebug.c
1054
return pool_tmpjoin(pool, "do not ask to ", pool_job2str(pool, how, what, 0), 0);
src/libs/libsolv/solv/solverdebug.c
1058
Solvable *s = pool->solvables + rp;
src/libs/libsolv/solv/solverdebug.c
1060
return pool_tmpjoin(pool, "keep ", pool_solvable2str(pool, s), " despite the inferior architecture");
src/libs/libsolv/solv/solverdebug.c
1062
return pool_tmpjoin(pool, "install ", pool_solvable2str(pool, s), " despite the inferior architecture");
src/libs/libsolv/solv/solverdebug.c
1066
Solvable *s = pool->solvables + rp;
src/libs/libsolv/solv/solverdebug.c
1068
return pool_tmpjoin(pool, "keep obsolete ", pool_solvable2str(pool, s), 0);
src/libs/libsolv/solv/solverdebug.c
1070
return pool_tmpjoin(pool, "install ", pool_solvable2str(pool, s), " from excluded repository");
src/libs/libsolv/solv/solverdebug.c
1074
Solvable *s = pool->solvables + rp;
src/libs/libsolv/solv/solverdebug.c
1076
return pool_tmpjoin(pool, "keep old ", pool_solvable2str(pool, s), 0);
src/libs/libsolv/solv/solverdebug.c
1078
return pool_tmpjoin(pool, "install ", pool_solvable2str(pool, s), " despite the old version");
src/libs/libsolv/solv/solverdebug.c
108
Solvable *ps = pool->solvables + p;
src/libs/libsolv/solv/solverdebug.c
1081
return pool_tmpjoin(pool, "allow deinstallation of ", pool_solvid2str(pool, p), 0);
src/libs/libsolv/solv/solverdebug.c
1084
const char *sp = pool_solvid2str(pool, p);
src/libs/libsolv/solv/solverdebug.c
1085
const char *srp = pool_solvid2str(pool, rp);
src/libs/libsolv/solv/solverdebug.c
1086
const char *str = pool_tmpjoin(pool, "allow replacement of ", sp, 0);
src/libs/libsolv/solv/solverdebug.c
1087
return pool_tmpappend(pool, str, " with ", srp);
src/libs/libsolv/solv/solverdebug.c
109
if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
src/libs/libsolv/solv/solverdebug.c
1096
Pool *pool = solv->pool;
src/libs/libsolv/solv/solverdebug.c
1100
str = pool_tmpjoin(pool, "downgrade of ", pool_solvable2str(pool, s), 0);
src/libs/libsolv/solv/solverdebug.c
1101
return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
src/libs/libsolv/solv/solverdebug.c
1105
str = pool_tmpjoin(pool, "name change of ", pool_solvable2str(pool, s), 0);
src/libs/libsolv/solv/solverdebug.c
1106
return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
src/libs/libsolv/solv/solverdebug.c
111
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
src/libs/libsolv/solv/solverdebug.c
1110
str = pool_tmpjoin(pool, "architecture change of ", pool_solvable2str(pool, s), 0);
src/libs/libsolv/solv/solverdebug.c
1111
return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
src/libs/libsolv/solv/solverdebug.c
1115
str = pool_tmpjoin(pool, "vendor change from '", pool_id2str(pool, s->vendor), "' (");
src/libs/libsolv/solv/solverdebug.c
1118
str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to '");
src/libs/libsolv/solv/solverdebug.c
1119
str = pool_tmpappend(pool, str, pool_id2str(pool, rs->vendor), "' (");
src/libs/libsolv/solv/solverdebug.c
1122
str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to no vendor (");
src/libs/libsolv/solv/solverdebug.c
1123
return pool_tmpappend(pool, str, pool_solvable2str(pool, rs), ")");
src/libs/libsolv/solv/solverdebug.c
113
if (pool->solvables[p].repo == installed && !obsoletesmap[p])
src/libs/libsolv/solv/solverdebug.c
128
Pool *pool = solv->pool;
src/libs/libsolv/solv/solverdebug.c
132
s = pool->solvables + -v;
src/libs/libsolv/solv/solverdebug.c
133
POOL_DEBUG(type, " !%s [%d]", pool_solvable2str(pool, s), -v);
src/libs/libsolv/solv/solverdebug.c
137
s = pool->solvables + v;
src/libs/libsolv/solv/solverdebug.c
138
POOL_DEBUG(type, " %s [%d]", pool_solvable2str(pool, s), v);
src/libs/libsolv/solv/solverdebug.c
140
if (pool->installed && s->repo == pool->installed)
src/libs/libsolv/solv/solverdebug.c
149
if (solv->decisionmap[s - pool->solvables] > 0)
src/libs/libsolv/solv/solverdebug.c
150
POOL_DEBUG(type, " Install.level%d", solv->decisionmap[s - pool->solvables]);
src/libs/libsolv/solv/solverdebug.c
151
if (solv->decisionmap[s - pool->solvables] < 0)
src/libs/libsolv/solv/solverdebug.c
152
POOL_DEBUG(type, " Conflict.level%d", -solv->decisionmap[s - pool->solvables]);
src/libs/libsolv/solv/solverdebug.c
164
Pool *pool = solv->pool;
src/libs/libsolv/solv/solverdebug.c
190
v = solv->pool->whatprovidesdata[d + i - 1];
src/libs/libsolv/solv/solverdebug.c
201
Pool *pool = solv->pool;
src/libs/libsolv/solv/solverdebug.c
229
Pool *pool = solv->pool;
src/libs/libsolv/solv/solverdebug.c
254
Pool *pool = solv->pool;
src/libs/libsolv/solv/solverdebug.c
258
for (counter = -(pool->nsolvables - 1); counter < pool->nsolvables; counter++)
src/libs/libsolv/solv/solverdebug.c
259
POOL_DEBUG(type, " solvable [%d] -- rule [%d]\n", counter, solv->watches[counter + pool->nsolvables]);
src/libs/libsolv/solv/solverdebug.c
265
Pool *pool = solv->pool;
src/libs/libsolv/solv/solverdebug.c
274
POOL_DEBUG(type, "%d %d install %s, ", i, solv->decisionmap[p], pool_solvid2str(pool, p));
src/libs/libsolv/solv/solverdebug.c
276
POOL_DEBUG(type, "%d %d conflict %s, ", i, -solv->decisionmap[-p], pool_solvid2str(pool, -p));
src/libs/libsolv/solv/solverdebug.c
300
Pool *pool = solv->pool;
src/libs/libsolv/solv/solverdebug.c
318
s = pool->solvables + p;
src/libs/libsolv/solv/solverdebug.c
323
POOL_DEBUG(SOLV_DEBUG_RESULT, " multi install %s", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
326
POOL_DEBUG(SOLV_DEBUG_RESULT, " multi reinstall %s", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
329
POOL_DEBUG(SOLV_DEBUG_RESULT, " install %s", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
332
POOL_DEBUG(SOLV_DEBUG_RESULT, " reinstall %s", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
335
POOL_DEBUG(SOLV_DEBUG_RESULT, " downgrade %s", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
338
POOL_DEBUG(SOLV_DEBUG_RESULT, " change %s", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
342
POOL_DEBUG(SOLV_DEBUG_RESULT, " upgrade %s", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
345
POOL_DEBUG(SOLV_DEBUG_RESULT, " erase %s", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
368
POOL_DEBUG(SOLV_DEBUG_RESULT, " %s", pool_solvid2str(pool, iq.elements[j]));
src/libs/libsolv/solv/solverdebug.c
390
s = pool->solvables + recommendations.elements[i];
src/libs/libsolv/solv/solverdebug.c
394
POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (installed)\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
396
POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (selected)\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
399
POOL_DEBUG(SOLV_DEBUG_RESULT, " %s\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
409
s = pool->solvables + suggestions.elements[i];
src/libs/libsolv/solv/solverdebug.c
413
POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (installed)\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
415
POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (selected)\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
418
POOL_DEBUG(SOLV_DEBUG_RESULT, " %s\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
427
s = pool->solvables + orphaned.elements[i];
src/libs/libsolv/solv/solverdebug.c
429
POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (kept)\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
431
POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (erased)\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
442
const char *id2strnone(Pool *pool, Id id)
src/libs/libsolv/solv/solverdebug.c
444
return !id || id == 1 ? "(none)" : pool_id2str(pool, id);
src/libs/libsolv/solv/solverdebug.c
450
Pool *pool = trans->pool;
src/libs/libsolv/solv/solverdebug.c
47
Pool *pool = solv->pool;
src/libs/libsolv/solv/solverdebug.c
485
POOL_DEBUG(SOLV_DEBUG_RESULT, "%d vendor changes from '%s' to '%s':\n", cnt, id2strnone(pool, classes.elements[i + 2]), id2strnone(pool, classes.elements[i + 3]));
src/libs/libsolv/solv/solverdebug.c
488
POOL_DEBUG(SOLV_DEBUG_RESULT, "%d arch changes from %s to %s:\n", cnt, pool_id2str(pool, classes.elements[i + 2]), pool_id2str(pool, classes.elements[i + 3]));
src/libs/libsolv/solv/solverdebug.c
502
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/solverdebug.c
509
s2 = pool->solvables + transaction_obs_pkg(trans, p);
src/libs/libsolv/solv/solverdebug.c
510
POOL_DEBUG(SOLV_DEBUG_RESULT, " - %s -> %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, s2));
src/libs/libsolv/solv/solverdebug.c
514
n = pool_id2str(pool, s->name);
src/libs/libsolv/solv/solverdebug.c
53
obsoletesmap = (Id *)solv_calloc(pool->nsolvables, sizeof(Id));
src/libs/libsolv/solv/solverdebug.c
537
POOL_DEBUG(SOLV_DEBUG_RESULT, " - %s\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
552
Pool *pool = solv->pool;
src/libs/libsolv/solv/solverdebug.c
558
POOL_DEBUG(SOLV_DEBUG_RESULT, "%s does not belong to a distupgrade repository\n", pool_solvid2str(pool, source));
src/libs/libsolv/solv/solverdebug.c
561
POOL_DEBUG(SOLV_DEBUG_RESULT, "%s has inferior architecture\n", pool_solvid2str(pool, source));
src/libs/libsolv/solv/solverdebug.c
564
POOL_DEBUG(SOLV_DEBUG_RESULT, "problem with installed package %s\n", pool_solvid2str(pool, source));
src/libs/libsolv/solv/solverdebug.c
570
POOL_DEBUG(SOLV_DEBUG_RESULT, "nothing provides requested %s\n", pool_dep2str(pool, dep));
src/libs/libsolv/solv/solverdebug.c
573
POOL_DEBUG(SOLV_DEBUG_RESULT, "%s is provided by the system\n", pool_dep2str(pool, dep));
src/libs/libsolv/solv/solverdebug.c
579
POOL_DEBUG(SOLV_DEBUG_RESULT, "package %s is not installable\n", pool_solvid2str(pool, source));
src/libs/libsolv/solv/solverdebug.c
582
POOL_DEBUG(SOLV_DEBUG_RESULT, "nothing provides %s needed by %s\n", pool_dep2str(pool, dep), pool_solvid2str(pool, source));
src/libs/libsolv/solv/solverdebug.c
585
POOL_DEBUG(SOLV_DEBUG_RESULT, "cannot install both %s and %s\n", pool_solvid2str(pool, source), pool_solvid2str(pool, target));
src/libs/libsolv/solv/solverdebug.c
588
POOL_DEBUG(SOLV_DEBUG_RESULT, "package %s conflicts with %s provided by %s\n", pool_solvid2str(pool, source), pool_dep2str(pool, dep), pool_solvid2str(pool, target));
src/libs/libsolv/solv/solverdebug.c
591
POOL_DEBUG(SOLV_DEBUG_RESULT, "package %s obsoletes %s provided by %s\n", pool_solvid2str(pool, source), pool_dep2str(pool, dep), pool_solvid2str(pool, target));
src/libs/libsolv/solv/solverdebug.c
594
POOL_DEBUG(SOLV_DEBUG_RESULT, "installed package %s obsoletes %s provided by %s\n", pool_solvid2str(pool, source), pool_dep2str(pool, dep), pool_solvid2str(pool, target));
src/libs/libsolv/solv/solverdebug.c
597
POOL_DEBUG(SOLV_DEBUG_RESULT, "package %s implicitly obsoletes %s provided by %s\n", pool_solvid2str(pool, source), pool_dep2str(pool, dep), pool_solvid2str(pool, target));
src/libs/libsolv/solv/solverdebug.c
600
POOL_DEBUG(SOLV_DEBUG_RESULT, "package %s requires %s, but none of the providers can be installed\n", pool_solvid2str(pool, source), pool_dep2str(pool, dep));
src/libs/libsolv/solv/solverdebug.c
603
POOL_DEBUG(SOLV_DEBUG_RESULT, "package %s conflicts with %s provided by itself\n", pool_solvid2str(pool, source), pool_dep2str(pool, dep));
src/libs/libsolv/solv/solverdebug.c
652
Pool *pool = solv->pool;
src/libs/libsolv/solv/solverdebug.c
66
s = pool->solvables + n;
src/libs/libsolv/solv/solverdebug.c
670
if (select == SOLVER_SOLVABLE && solv->installed && pool->solvables[what].repo == solv->installed)
src/libs/libsolv/solv/solverdebug.c
671
POOL_DEBUG(SOLV_DEBUG_RESULT, " - do not keep %s installed\n", pool_solvid2str(pool, what));
src/libs/libsolv/solv/solverdebug.c
673
POOL_DEBUG(SOLV_DEBUG_RESULT, " - do not install a solvable %s\n", solver_select2str(pool, select, what));
src/libs/libsolv/solv/solverdebug.c
675
POOL_DEBUG(SOLV_DEBUG_RESULT, " - do not install %s\n", solver_select2str(pool, select, what));
src/libs/libsolv/solv/solverdebug.c
678
if (select == SOLVER_SOLVABLE && !(solv->installed && pool->solvables[what].repo == solv->installed))
src/libs/libsolv/solv/solverdebug.c
679
POOL_DEBUG(SOLV_DEBUG_RESULT, " - do not forbid installation of %s\n", pool_solvid2str(pool, what));
src/libs/libsolv/solv/solverdebug.c
681
POOL_DEBUG(SOLV_DEBUG_RESULT, " - do not deinstall all solvables %s\n", solver_select2str(pool, select, what));
src/libs/libsolv/solv/solverdebug.c
683
POOL_DEBUG(SOLV_DEBUG_RESULT, " - do not deinstall %s\n", solver_select2str(pool, select, what));
src/libs/libsolv/solv/solverdebug.c
686
POOL_DEBUG(SOLV_DEBUG_RESULT, " - do not install most recent version of %s\n", solver_select2str(pool, select, what));
src/libs/libsolv/solv/solverdebug.c
689
POOL_DEBUG(SOLV_DEBUG_RESULT, " - do not lock %s\n", solver_select2str(pool, select, what));
src/libs/libsolv/solv/solverdebug.c
698
s = pool->solvables + rp;
src/libs/libsolv/solv/solverdebug.c
700
POOL_DEBUG(SOLV_DEBUG_RESULT, " - keep %s despite the inferior architecture\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
702
POOL_DEBUG(SOLV_DEBUG_RESULT, " - install %s despite the inferior architecture\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
706
s = pool->solvables + rp;
src/libs/libsolv/solv/solverdebug.c
708
POOL_DEBUG(SOLV_DEBUG_RESULT, " - keep obsolete %s\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
710
POOL_DEBUG(SOLV_DEBUG_RESULT, " - install %s from excluded repository\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
714
s = pool->solvables + rp;
src/libs/libsolv/solv/solverdebug.c
716
POOL_DEBUG(SOLV_DEBUG_RESULT, " - keep old %s\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
718
POOL_DEBUG(SOLV_DEBUG_RESULT, " - install %s despite the old version\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
72
Solvable *ps = pool->solvables + p;
src/libs/libsolv/solv/solverdebug.c
723
s = pool->solvables + p;
src/libs/libsolv/solv/solverdebug.c
724
sd = rp ? pool->solvables + rp : 0;
src/libs/libsolv/solv/solverdebug.c
729
POOL_DEBUG(SOLV_DEBUG_RESULT, " - allow downgrade of %s to %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, sd));
src/libs/libsolv/solv/solverdebug.c
731
POOL_DEBUG(SOLV_DEBUG_RESULT, " - allow name change of %s to %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, sd));
src/libs/libsolv/solv/solverdebug.c
733
POOL_DEBUG(SOLV_DEBUG_RESULT, " - allow architecture change of %s to %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, sd));
src/libs/libsolv/solv/solverdebug.c
737
POOL_DEBUG(SOLV_DEBUG_RESULT, " - allow vendor change from '%s' (%s) to '%s' (%s)\n", pool_id2str(pool, s->vendor), pool_solvable2str(pool, s), pool_id2str(pool, sd->vendor), pool_solvable2str(pool, sd));
src/libs/libsolv/solv/solverdebug.c
739
POOL_DEBUG(SOLV_DEBUG_RESULT, " - allow vendor change from '%s' (%s) to no vendor (%s)\n", pool_id2str(pool, s->vendor), pool_solvable2str(pool, s), pool_solvable2str(pool, sd));
src/libs/libsolv/solv/solverdebug.c
742
POOL_DEBUG(SOLV_DEBUG_RESULT, " - allow replacement of %s with %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, sd));
src/libs/libsolv/solv/solverdebug.c
746
POOL_DEBUG(SOLV_DEBUG_RESULT, " - allow deinstallation of %s\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/solverdebug.c
75
if (!pool->implicitobsoleteusesprovides && s->name != ps->name)
src/libs/libsolv/solv/solverdebug.c
755
Pool *pool = solv->pool;
src/libs/libsolv/solv/solverdebug.c
77
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
src/libs/libsolv/solv/solverdebug.c
785
Pool *pool = solv->pool;
src/libs/libsolv/solv/solverdebug.c
793
for (p = 1, s = pool->solvables + p; p < solv->pool->nsolvables; p++, s++)
src/libs/libsolv/solv/solverdebug.c
795
n = pool_id2str(pool, s->name);
src/libs/libsolv/solv/solverdebug.c
809
POOL_DEBUG(SOLV_DEBUG_RESULT, " %s: %d\n", pool_solvid2str(pool, in.elements[i]), out.elements[i]);
src/libs/libsolv/solv/solverdebug.c
816
solver_select2str(Pool *pool, Id select, Id what)
src/libs/libsolv/solv/solverdebug.c
822
return pool_solvid2str(pool, what);
src/libs/libsolv/solv/solverdebug.c
824
return pool_dep2str(pool, what);
src/libs/libsolv/solv/solverdebug.c
827
s = pool_dep2str(pool, what);
src/libs/libsolv/solv/solverdebug.c
828
b = pool_alloctmpspace(pool, 11 + strlen(s));
src/libs/libsolv/solv/solverdebug.c
836
while ((p = pool->whatprovidesdata[what++]) != 0)
src/libs/libsolv/solv/solverdebug.c
838
s = pool_solvid2str(pool, p);
src/libs/libsolv/solv/solverdebug.c
840
b = pool_tmpappend(pool, b, ", ", s);
src/libs/libsolv/solv/solverdebug.c
842
b = pool_tmpjoin(pool, s, 0, 0);
src/libs/libsolv/solv/solverdebug.c
843
pool_freetmpspace(pool, s);
src/libs/libsolv/solv/solverdebug.c
849
b = pool_alloctmpspace(pool, 20);
src/libs/libsolv/solv/solverdebug.c
859
pool_job2str(Pool *pool, Id how, Id what, Id flagmask)
src/libs/libsolv/solv/solverdebug.c
871
if (select == SOLVER_SOLVABLE && pool->installed && pool->solvables[what].repo == pool->installed)
src/libs/libsolv/solv/solverdebug.c
881
if (select == SOLVER_SOLVABLE && !(pool->installed && pool->solvables[what].repo == pool->installed))
src/libs/libsolv/solv/solverdebug.c
916
s = pool_tmpjoin(pool, strstart, solver_select2str(pool, select, what), strend);
src/libs/libsolv/solv/solverdebug.c
921
s = pool_tmpappend(pool, s, " ", 0);
src/libs/libsolv/solv/solverdebug.c
923
s = pool_tmpappend(pool, s, ",weak", 0);
src/libs/libsolv/solv/solverdebug.c
925
s = pool_tmpappend(pool, s, ",essential", 0);
src/libs/libsolv/solv/solverdebug.c
927
s = pool_tmpappend(pool, s, ",cleandeps", 0);
src/libs/libsolv/solv/solverdebug.c
929
s = pool_tmpappend(pool, s, ",setev", 0);
src/libs/libsolv/solv/solverdebug.c
931
s = pool_tmpappend(pool, s, ",setevr", 0);
src/libs/libsolv/solv/solverdebug.c
933
s = pool_tmpappend(pool, s, ",setarch", 0);
src/libs/libsolv/solv/solverdebug.c
935
s = pool_tmpappend(pool, s, ",setvendor", 0);
src/libs/libsolv/solv/solverdebug.c
937
s = pool_tmpappend(pool, s, ",setrepo", 0);
src/libs/libsolv/solv/solverdebug.c
939
s = pool_tmpappend(pool, s, ",noautoset", 0);
src/libs/libsolv/solv/solverdebug.c
941
s = pool_tmpappend(pool, s, ",?", 0);
src/libs/libsolv/solv/solverdebug.c
943
return pool_tmpappend(pool, s, "]", 0);
src/libs/libsolv/solv/solverdebug.c
947
pool_selection2str(Pool *pool, Queue *selection, Id flagmask)
src/libs/libsolv/solv/solverdebug.c
952
s = pool_tmpjoin(pool, 0, 0, 0);
src/libs/libsolv/solv/solverdebug.c
957
s = pool_tmpappend(pool, s, " + ", 0);
src/libs/libsolv/solv/solverdebug.c
958
s2 = solver_select2str(pool, how & SOLVER_SELECTMASK, selection->elements[i + 1]);
src/libs/libsolv/solv/solverdebug.c
959
s = pool_tmpappend(pool, s, s2, 0);
src/libs/libsolv/solv/solverdebug.c
96
s = pool->solvables + n;
src/libs/libsolv/solv/solverdebug.c
960
pool_freetmpspace(pool, s2);
src/libs/libsolv/solv/solverdebug.c
965
s = pool_tmpappend(pool, s, " ", 0);
src/libs/libsolv/solv/solverdebug.c
967
s = pool_tmpappend(pool, s, ",setev", 0);
src/libs/libsolv/solv/solverdebug.c
969
s = pool_tmpappend(pool, s, ",setevr", 0);
src/libs/libsolv/solv/solverdebug.c
971
s = pool_tmpappend(pool, s, ",setarch", 0);
src/libs/libsolv/solv/solverdebug.c
973
s = pool_tmpappend(pool, s, ",setvendor", 0);
src/libs/libsolv/solv/solverdebug.c
975
s = pool_tmpappend(pool, s, ",setrepo", 0);
src/libs/libsolv/solv/solverdebug.c
977
s = pool_tmpappend(pool, s, ",noautoset", 0);
src/libs/libsolv/solv/solverdebug.c
979
s = pool_tmpappend(pool, s, ",?", 0);
src/libs/libsolv/solv/solverdebug.c
981
s = pool_tmpappend(pool, s, "]", 0);
src/libs/libsolv/solv/solverdebug.c
990
Pool *pool = solv->pool;
src/libs/libsolv/solv/solverdebug.c
995
return pool_tmpjoin(pool, pool_solvid2str(pool, source), " does not belong to a distupgrade repository", 0);
src/libs/libsolv/solv/solverdebug.c
997
return pool_tmpjoin(pool, pool_solvid2str(pool, source), " has inferior architecture", 0);
src/libs/libsolv/solv/solverdebug.c
999
return pool_tmpjoin(pool, "problem with installed package ", pool_solvid2str(pool, source), 0);
src/libs/libsolv/solv/solverdebug.h
41
extern const char *solver_select2str(Pool *pool, Id select, Id what);
src/libs/libsolv/solv/solverdebug.h
42
extern const char *pool_job2str(Pool *pool, Id how, Id what, Id flagmask);
src/libs/libsolv/solv/solverdebug.h
43
extern const char *pool_selection2str(Pool *pool, Queue *selection, Id flagmask);
src/libs/libsolv/solv/transaction.c
1001
if (trans->transaction_installed[q1 - pool->installed->start] == 0)
src/libs/libsolv/solv/transaction.c
1003
if (trans->transaction_installed[q2 - pool->installed->start] == 0)
src/libs/libsolv/solv/transaction.c
1005
if (trans->transaction_installed[q1 - pool->installed->start] == trans->transaction_installed[q2 - pool->installed->start])
src/libs/libsolv/solv/transaction.c
1007
if (trans->transaction_installed[q1 - pool->installed->start] > 0 && trans->transaction_installed[q2 - pool->installed->start] > 0)
src/libs/libsolv/solv/transaction.c
1029
havescripts(Pool *pool, Id solvid)
src/libs/libsolv/solv/transaction.c
1031
Solvable *s = pool->solvables + solvid;
src/libs/libsolv/solv/transaction.c
1047
dep = pool_id2str(pool, req);
src/libs/libsolv/solv/transaction.c
1059
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
1063
Repo *installed = pool->installed;
src/libs/libsolv/solv/transaction.c
1069
printf("addsolvableedges %s\n", pool_solvable2str(pool, s));
src/libs/libsolv/solv/transaction.c
1071
p = s - pool->solvables;
src/libs/libsolv/solv/transaction.c
1088
if (trans->transaction_installed[p - pool->installed->start])
src/libs/libsolv/solv/transaction.c
1097
s2 = pool->solvables + p2;
src/libs/libsolv/solv/transaction.c
1107
printf("IGNORE inst provides %s by %s\n", pool_dep2str(pool, req), pool_solvable2str(pool, s2));
src/libs/libsolv/solv/transaction.c
111
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
112
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/transaction.c
1135
if (pool->solvables[reqq.elements[i]].repo != installed)
src/libs/libsolv/solv/transaction.c
1146
if (pool->solvables[reqq.elements[i]].repo == installed)
src/libs/libsolv/solv/transaction.c
1150
if (pool->solvables[reqq.elements[j]].repo != installed)
src/libs/libsolv/solv/transaction.c
1152
if (trans->transaction_installed[reqq.elements[i] - pool->installed->start] == reqq.elements[j])
src/libs/libsolv/solv/transaction.c
1155
printf("add interrreq uninst->inst edge (%s -> %s -> %s)\n", pool_solvid2str(pool, reqq.elements[i]), pool_dep2str(pool, req), pool_solvid2str(pool, reqq.elements[j]));
src/libs/libsolv/solv/transaction.c
1165
if (pool->solvables[reqq.elements[i]].repo != installed)
src/libs/libsolv/solv/transaction.c
1175
if (pool->solvables[p2].repo != installed)
src/libs/libsolv/solv/transaction.c
1179
if (pool->solvables[p].repo != installed)
src/libs/libsolv/solv/transaction.c
118
if (s->repo == pool->installed)
src/libs/libsolv/solv/transaction.c
1182
printf("add inst->inst edge choice %d (%s -> %s -> %s)\n", choice, pool_solvid2str(pool, p), pool_dep2str(pool, req), pool_solvid2str(pool, p2));
src/libs/libsolv/solv/transaction.c
1189
printf("add uninst->inst edge choice %d (%s -> %s -> %s)\n", choice, pool_solvid2str(pool, p), pool_dep2str(pool, req), pool_solvid2str(pool, p2));
src/libs/libsolv/solv/transaction.c
120
p = trans->transaction_installed[p - pool->installed->start];
src/libs/libsolv/solv/transaction.c
1200
if (trans->transaction_installed[p - installed->start] && !havescripts(pool, p))
src/libs/libsolv/solv/transaction.c
1217
printf("add uninst->uninst edge choice %d (%s -> %s -> %s)\n", choice, pool_solvid2str(pool, p), pool_dep2str(pool, req), pool_solvid2str(pool, p2));
src/libs/libsolv/solv/transaction.c
1233
s2 = pool->solvables + p2;
src/libs/libsolv/solv/transaction.c
1242
printf("add conflict uninst->inst edge (%s -> %s -> %s)\n", pool_solvid2str(pool, p2), pool_dep2str(pool, con), pool_solvid2str(pool, p));
src/libs/libsolv/solv/transaction.c
1253
printf("add conflict uninst->inst edge (%s -> %s -> %s)\n", pool_solvid2str(pool, p), pool_dep2str(pool, con), pool_solvid2str(pool, p2));
src/libs/libsolv/solv/transaction.c
1273
s2 = pool->solvables + p2;
src/libs/libsolv/solv/transaction.c
1282
printf("add trigger uninst->inst edge (%s -> %s -> %s)\n", pool_solvid2str(pool, p2), pool_dep2str(pool, tri), pool_solvid2str(pool, p));
src/libs/libsolv/solv/transaction.c
1297
Pool *pool = od->trans->pool;
src/libs/libsolv/solv/transaction.c
1317
if (havescripts(pool, od->tes[cycle[l]].p) && !havescripts(pool, od->tes[cycle[k]].p))
src/libs/libsolv/solv/transaction.c
1360
POOL_DEBUG(SOLV_DEBUG_STATS, "%s ##%x##> ", pool_solvid2str(pool, te->p), od->edgedata[cycle[k + 1] + 1]);
src/libs/libsolv/solv/transaction.c
1362
POOL_DEBUG(SOLV_DEBUG_STATS, "%s --%x--> ", pool_solvid2str(pool, te->p), od->edgedata[cycle[k + 1] + 1]);
src/libs/libsolv/solv/transaction.c
1370
Pool *pool = od->trans->pool;
src/libs/libsolv/solv/transaction.c
1378
Solvable *s = pool->solvables + te->p;
src/libs/libsolv/solv/transaction.c
1379
POOL_DEBUG(SOLV_DEBUG_RESULT, "TE %4d: %c%s\n", i, s->repo == pool->installed ? '-' : '+', pool_solvable2str(pool, s));
src/libs/libsolv/solv/transaction.c
138
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
1380
if (s->repo != pool->installed)
src/libs/libsolv/solv/transaction.c
1385
POOL_DEBUG(SOLV_DEBUG_RESULT, " -%s\n", pool_solvid2str(pool, obsq.elements[j]));
src/libs/libsolv/solv/transaction.c
1391
POOL_DEBUG(SOLV_DEBUG_RESULT, " --%x--> TE %4d: %s\n", od->edgedata[j + 1], od->edgedata[j], pool_solvid2str(pool, te2->p));
src/libs/libsolv/solv/transaction.c
1393
POOL_DEBUG(SOLV_DEBUG_RESULT, " ##%x##> TE %4d: %s\n", od->edgedata[j + 1], od->edgedata[j], pool_solvid2str(pool, te2->p));
src/libs/libsolv/solv/transaction.c
1429
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
1440
printf("cycle %s\n", pool_solvid2str(pool, od->tes[j].p));
src/libs/libsolv/solv/transaction.c
146
if (pool->installed && pool->solvables[p].repo == pool->installed)
src/libs/libsolv/solv/transaction.c
1488
printf("adding TO TAIL cycle edge %d->%d %s->%s!\n", i, tail, pool_solvid2str(pool, od->tes[i].p), pool_solvid2str(pool, od->tes[tail].p));
src/libs/libsolv/solv/transaction.c
151
s = pool->solvables + p;
src/libs/libsolv/solv/transaction.c
152
s2 = pool->solvables + p2;
src/libs/libsolv/solv/transaction.c
1535
printf("adding FROM HEAD cycle edge %d->%d %s->%s [%s]!\n", head, k, pool_solvid2str(pool, od->tes[head].p), pool_solvid2str(pool, od->tes[k].p), pool_solvid2str(pool, od->tes[cycle[i]].p));
src/libs/libsolv/solv/transaction.c
1548
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
1550
Repo *installed = pool->installed;
src/libs/libsolv/solv/transaction.c
157
r = pool_evrcmp(pool, s->evr, s2->evr, EVRCMP_COMPARE);
src/libs/libsolv/solv/transaction.c
1581
s = pool->solvables + p;
src/libs/libsolv/solv/transaction.c
1604
s = pool->solvables + p;
src/libs/libsolv/solv/transaction.c
1613
addsolvableedges(&od, pool->solvables + tr->elements[i]);
src/libs/libsolv/solv/transaction.c
173
s = pool->solvables + p;
src/libs/libsolv/solv/transaction.c
174
s2 = pool->solvables + p2;
src/libs/libsolv/solv/transaction.c
1776
if (installed && pool->solvables[te->p].repo == installed)
src/libs/libsolv/solv/transaction.c
179
r = pool_evrcmp(pool, s->evr, s2->evr, EVRCMP_COMPARE);
src/libs/libsolv/solv/transaction.c
1792
Solvable *s = pool->solvables + od.tes[i].p;
src/libs/libsolv/solv/transaction.c
1817
lastrepo = pool->solvables[od.tes[todo.elements[i]].p].repo;
src/libs/libsolv/solv/transaction.c
1823
if (temedianr[k] == lastmedia && pool->solvables[od.tes[k].p].repo == lastrepo)
src/libs/libsolv/solv/transaction.c
1839
printf("do %s [%d]\n", pool_solvid2str(pool, te->p), temedianr[i]);
src/libs/libsolv/solv/transaction.c
1841
s = pool->solvables + te->p;
src/libs/libsolv/solv/transaction.c
1848
Solvable *s = pool->solvables + te2->p;
src/libs/libsolv/solv/transaction.c
1850
printf("free %s [%d]\n", pool_solvid2str(pool, te2->p), temedianr[od.invedgedata[j]]);
src/libs/libsolv/solv/transaction.c
1941
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
1942
Repo *installed = pool->installed;
src/libs/libsolv/solv/transaction.c
1968
if (pool->solvables[p].repo == installed)
src/libs/libsolv/solv/transaction.c
1970
if (!trans->transaction_installed[p - pool->installed->start])
src/libs/libsolv/solv/transaction.c
1997
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
2005
s = pool->solvables + pkg;
src/libs/libsolv/solv/transaction.c
2007
printf("- %*s%c%s\n", depth * 2, "", s->repo == pool->installed ? '-' : '+', pool_solvable2str(pool, s));
src/libs/libsolv/solv/transaction.c
201
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
202
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/transaction.c
2023
if (!strncmp(pool_id2str(pool, req), "rpmlib(", 7))
src/libs/libsolv/solv/transaction.c
2042
if (pool->solvables[p].repo == pool->installed)
src/libs/libsolv/solv/transaction.c
2060
POOL_DEBUG(SOLV_DEBUG_RESULT, " %c%s: nothing provides %s needed by %c%s\n", pool->solvables[tepkg].repo == pool->installed ? '-' : '+', pool_solvid2str(pool, tepkg), pool_dep2str(pool, req), s->repo == pool->installed ? '-' : '+', pool_solvable2str(pool, s));
src/libs/libsolv/solv/transaction.c
2069
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
2076
map_init(&ins, pool->nsolvables);
src/libs/libsolv/solv/transaction.c
2077
map_init(&seen, pool->nsolvables);
src/libs/libsolv/solv/transaction.c
2078
if (pool->installed)
src/libs/libsolv/solv/transaction.c
2079
FOR_REPO_SOLVABLES(pool->installed, p, s)
src/libs/libsolv/solv/transaction.c
2085
s = pool->solvables + p;
src/libs/libsolv/solv/transaction.c
2086
if (s->repo != pool->installed)
src/libs/libsolv/solv/transaction.c
2088
if (s->repo != pool->installed)
src/libs/libsolv/solv/transaction.c
2090
if (havescripts(pool, p))
src/libs/libsolv/solv/transaction.c
2095
if (s->repo == pool->installed)
src/libs/libsolv/solv/transaction.c
213
const char *n = pool_id2str(pool, s->name);
src/libs/libsolv/solv/transaction.c
230
if (s->repo == pool->installed)
src/libs/libsolv/solv/transaction.c
260
if (s->repo == pool->installed && (mode & SOLVER_TRANSACTION_SHOW_ACTIVE) == 0)
src/libs/libsolv/solv/transaction.c
267
if (s->repo != pool->installed && (mode & SOLVER_TRANSACTION_SHOW_ACTIVE) != 0)
src/libs/libsolv/solv/transaction.c
290
Solvable *sq = pool->solvables + q;
src/libs/libsolv/solv/transaction.c
294
if (s->repo == pool->installed)
src/libs/libsolv/solv/transaction.c
317
Solvable *sq = pool->solvables + q;
src/libs/libsolv/solv/transaction.c
32
Pool *pool = dp;
src/libs/libsolv/solv/transaction.c
346
if (s->repo == pool->installed)
src/libs/libsolv/solv/transaction.c
363
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
373
return a[2] && b[2] ? strcmp(pool_id2str(pool, a[2]), pool_id2str(pool, b[2])) : r;
src/libs/libsolv/solv/transaction.c
376
return a[3] && b[3] ? strcmp(pool_id2str(pool, a[3]), pool_id2str(pool, b[3])) : r;
src/libs/libsolv/solv/transaction.c
384
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
389
sa = pool->solvables + a;
src/libs/libsolv/solv/transaction.c
390
sb = pool->solvables + b;
src/libs/libsolv/solv/transaction.c
392
return strcmp(pool_id2str(pool, sa->name), pool_id2str(pool, sb->name));
src/libs/libsolv/solv/transaction.c
395
int r = pool_evrcmp(pool, sa->evr, sb->evr, EVRCMP_COMPARE);
src/libs/libsolv/solv/transaction.c
405
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
417
s = pool->solvables + p;
src/libs/libsolv/solv/transaction.c
420
if (!pool->installed || s->repo != pool->installed)
src/libs/libsolv/solv/transaction.c
429
sq = pool->solvables + q;
src/libs/libsolv/solv/transaction.c
44
s = pool->solvables + a;
src/libs/libsolv/solv/transaction.c
45
oas = pool->solvables + oa;
src/libs/libsolv/solv/transaction.c
46
obs = pool->solvables + ob;
src/libs/libsolv/solv/transaction.c
499
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
508
s = pool->solvables + p;
src/libs/libsolv/solv/transaction.c
516
if (!pool->installed || s->repo != pool->installed)
src/libs/libsolv/solv/transaction.c
521
sq = pool->solvables + q;
src/libs/libsolv/solv/transaction.c
53
return strcmp(pool_id2str(pool, oas->name), pool_id2str(pool, obs->name));
src/libs/libsolv/solv/transaction.c
544
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
546
Repo *installed = pool->installed;
src/libs/libsolv/solv/transaction.c
55
r = pool_evrcmp(pool, oas->evr, obs->evr, EVRCMP_COMPARE);
src/libs/libsolv/solv/transaction.c
560
s = pool->solvables + p;
src/libs/libsolv/solv/transaction.c
568
s2 = pool->solvables + p2;
src/libs/libsolv/solv/transaction.c
573
if (!pool->implicitobsoleteusesprovides && s->name != s2->name)
src/libs/libsolv/solv/transaction.c
575
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
src/libs/libsolv/solv/transaction.c
586
s2 = pool->solvables + p2;
src/libs/libsolv/solv/transaction.c
589
if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
src/libs/libsolv/solv/transaction.c
591
if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
src/libs/libsolv/solv/transaction.c
601
solv_sort(ti->elements, ti->count / 2, 2 * sizeof(Id), obsq_sortcmp, pool);
src/libs/libsolv/solv/transaction.c
629
if (obsq_sortcmp(q, q + 2, pool) < 0)
src/libs/libsolv/solv/transaction.c
637
transaction_create_decisionq(Pool *pool, Queue *decisionq, Map *multiversionmap)
src/libs/libsolv/solv/transaction.c
639
Repo *installed = pool->installed;
src/libs/libsolv/solv/transaction.c
64
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
645
trans = transaction_create(pool);
src/libs/libsolv/solv/transaction.c
649
map_init(&trans->transactsmap, pool->nsolvables);
src/libs/libsolv/solv/transaction.c
65
Solvable *s = pool->solvables + p;
src/libs/libsolv/solv/transaction.c
654
s = pool->solvables + (p > 0 ? p : -p);
src/libs/libsolv/solv/transaction.c
662
const char *n = pool_id2str(pool, s->name);
src/libs/libsolv/solv/transaction.c
699
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
700
Repo *installed = pool->installed;
src/libs/libsolv/solv/transaction.c
710
s = pool->solvables + p;
src/libs/libsolv/solv/transaction.c
728
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
729
Repo *installed = pool->installed;
src/libs/libsolv/solv/transaction.c
73
if (s->repo == pool->installed)
src/libs/libsolv/solv/transaction.c
734
map_init(installedmap, pool->nsolvables);
src/libs/libsolv/solv/transaction.c
738
s = pool->solvables + p;
src/libs/libsolv/solv/transaction.c
75
q = trans->transaction_installed[p - pool->installed->start];
src/libs/libsolv/solv/transaction.c
757
change = pool_calc_installsizechange(trans->pool, &installedmap);
src/libs/libsolv/solv/transaction.c
768
pool_calc_duchanges(trans->pool, &installedmap, mps, nmps);
src/libs/libsolv/solv/transaction.c
800
transaction_create(Pool *pool)
src/libs/libsolv/solv/transaction.c
803
trans->pool = pool;
src/libs/libsolv/solv/transaction.c
810
Transaction *trans = transaction_create(srctrans->pool);
src/libs/libsolv/solv/transaction.c
815
Repo *installed = srctrans->pool->installed;
src/libs/libsolv/solv/transaction.c
90
solv_sort(pkgs->elements, pkgs->count / 2, 2 * sizeof(Id), obsq_sortcmp, pool);
src/libs/libsolv/solv/transaction.c
922
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.c
928
s = pool->solvables + from;
src/libs/libsolv/solv/transaction.c
929
if (s->repo == pool->installed && trans->transaction_installed[from - pool->installed->start])
src/libs/libsolv/solv/transaction.c
932
if (trans->transaction_installed[from - pool->installed->start] > 0)
src/libs/libsolv/solv/transaction.c
933
from = trans->transaction_installed[from - pool->installed->start];
src/libs/libsolv/solv/transaction.c
948
s = pool->solvables + to;
src/libs/libsolv/solv/transaction.c
949
if (s->repo == pool->installed && trans->transaction_installed[to - pool->installed->start])
src/libs/libsolv/solv/transaction.c
952
if (trans->transaction_installed[to - pool->installed->start] > 0)
src/libs/libsolv/solv/transaction.c
953
to = trans->transaction_installed[to - pool->installed->start];
src/libs/libsolv/solv/transaction.c
991
Pool *pool = trans->pool;
src/libs/libsolv/solv/transaction.h
29
struct _Pool *pool; /* back pointer to pool */
src/libs/libsolv/solv/transaction.h
87
extern Transaction *transaction_create(struct _Pool *pool);
src/libs/libsolv/solv/transaction.h
88
extern Transaction *transaction_create_decisionq(struct _Pool *pool, Queue *decisionq, Map *multiversionmap);
src/system/kernel/arch/arm/paging/32bit/ARMPagingMethod32Bit.cpp
168
slot->pool = this;
src/system/kernel/arch/arm/paging/32bit/ARMPagingMethod32Bit.cpp
197
PhysicalPageSlotPool* pool = new(std::nothrow) PhysicalPageSlotPool;
src/system/kernel/arch/arm/paging/32bit/ARMPagingMethod32Bit.cpp
198
if (pool == NULL)
src/system/kernel/arch/arm/paging/32bit/ARMPagingMethod32Bit.cpp
200
ObjectDeleter<PhysicalPageSlotPool> poolDeleter(pool);
src/system/kernel/arch/arm/paging/32bit/ARMPagingMethod32Bit.cpp
247
pool->Init(dataArea, data, virtualArea, (addr_t)virtualBase);
src/system/kernel/arch/arm/paging/32bit/ARMPagingMethod32Bit.cpp
249
_pool = pool;
src/system/kernel/arch/arm/paging/32bit/ARMPagingMethod32Bit.cpp
291
PhysicalPageSlotPool* pool = PhysicalPageSlotPool::sInitialPhysicalPagePool;
src/system/kernel/arch/arm/paging/32bit/ARMPagingMethod32Bit.cpp
294
new(&pool[i]) PhysicalPageSlotPool;
src/system/kernel/arch/arm/paging/32bit/ARMPagingMethod32Bit.cpp
295
status_t error = pool[i].InitInitial(args);
src/system/kernel/arch/arm/paging/32bit/ARMPagingMethod32Bit.cpp
304
large_memory_physical_page_ops_init(args, pool, poolCount, sizeof(*pool),
src/system/kernel/arch/arm/paging/arm_physical_page_mapper_large_memory.cpp
186
pool->Map(physicalAddress, address);
src/system/kernel/arch/arm/paging/arm_physical_page_mapper_large_memory.cpp
711
PhysicalPageSlotPool* pool = fNonEmptyPools.Head();
src/system/kernel/arch/arm/paging/arm_physical_page_mapper_large_memory.cpp
712
if (pool == NULL) {
src/system/kernel/arch/arm/paging/arm_physical_page_mapper_large_memory.cpp
718
status_t error = fInitialPool->AllocatePool(pool);
src/system/kernel/arch/arm/paging/arm_physical_page_mapper_large_memory.cpp
723
fNonEmptyPools.Add(pool);
src/system/kernel/arch/arm/paging/arm_physical_page_mapper_large_memory.cpp
724
pool = fNonEmptyPools.Head();
src/system/kernel/arch/arm/paging/arm_physical_page_mapper_large_memory.cpp
727
slot = pool->GetSlot();
src/system/kernel/arch/arm/paging/arm_physical_page_mapper_large_memory.cpp
729
if (pool->IsEmpty()) {
src/system/kernel/arch/arm/paging/arm_physical_page_mapper_large_memory.cpp
730
fNonEmptyPools.Remove(pool);
src/system/kernel/arch/arm/paging/arm_physical_page_mapper_large_memory.cpp
731
fEmptyPools.Add(pool);
src/system/kernel/arch/arm/paging/arm_physical_page_mapper_large_memory.cpp
743
PhysicalPageSlotPool* pool = slot->pool;
src/system/kernel/arch/arm/paging/arm_physical_page_mapper_large_memory.cpp
744
if (pool->IsEmpty()) {
src/system/kernel/arch/arm/paging/arm_physical_page_mapper_large_memory.cpp
745
fEmptyPools.Remove(pool);
src/system/kernel/arch/arm/paging/arm_physical_page_mapper_large_memory.cpp
746
fNonEmptyPools.Add(pool);
src/system/kernel/arch/arm/paging/arm_physical_page_mapper_large_memory.cpp
749
pool->PutSlot(slot);
src/system/kernel/arch/arm/paging/arm_physical_page_mapper_large_memory.h
36
PhysicalPageSlotPool* pool;
src/system/kernel/arch/m68k/paging/040/M68KPagingMethod040.cpp
237
slot->pool = this;
src/system/kernel/arch/m68k/paging/040/M68KPagingMethod040.cpp
264
PhysicalPageSlotPool* pool = new(std::nothrow) PhysicalPageSlotPool;
src/system/kernel/arch/m68k/paging/040/M68KPagingMethod040.cpp
265
if (pool == NULL)
src/system/kernel/arch/m68k/paging/040/M68KPagingMethod040.cpp
267
ObjectDeleter<PhysicalPageSlotPool> poolDeleter(pool);
src/system/kernel/arch/m68k/paging/040/M68KPagingMethod040.cpp
319
pool->Init(dataArea, data, virtualArea, (addr_t)virtualBase);
src/system/kernel/arch/m68k/paging/040/M68KPagingMethod040.cpp
321
_pool = pool;
src/system/kernel/arch/m68k/paging/040/M68KPagingMethod040.cpp
378
PhysicalPageSlotPool* pool
src/system/kernel/arch/m68k/paging/040/M68KPagingMethod040.cpp
381
status_t error = pool->InitInitial(args);
src/system/kernel/arch/m68k/paging/040/M68KPagingMethod040.cpp
389
large_memory_physical_page_ops_init(args, pool, fPhysicalPageMapper,
src/system/kernel/arch/m68k/paging/m68k_physical_page_mapper_large_memory.cpp
191
pool->Map(physicalAddress, address);
src/system/kernel/arch/m68k/paging/m68k_physical_page_mapper_large_memory.cpp
709
PhysicalPageSlotPool* pool = fNonEmptyPools.Head();
src/system/kernel/arch/m68k/paging/m68k_physical_page_mapper_large_memory.cpp
710
if (pool == NULL) {
src/system/kernel/arch/m68k/paging/m68k_physical_page_mapper_large_memory.cpp
716
status_t error = fInitialPool->AllocatePool(pool);
src/system/kernel/arch/m68k/paging/m68k_physical_page_mapper_large_memory.cpp
721
fNonEmptyPools.Add(pool);
src/system/kernel/arch/m68k/paging/m68k_physical_page_mapper_large_memory.cpp
722
pool = fNonEmptyPools.Head();
src/system/kernel/arch/m68k/paging/m68k_physical_page_mapper_large_memory.cpp
725
slot = pool->GetSlot();
src/system/kernel/arch/m68k/paging/m68k_physical_page_mapper_large_memory.cpp
727
if (pool->IsEmpty()) {
src/system/kernel/arch/m68k/paging/m68k_physical_page_mapper_large_memory.cpp
728
fNonEmptyPools.Remove(pool);
src/system/kernel/arch/m68k/paging/m68k_physical_page_mapper_large_memory.cpp
729
fEmptyPools.Add(pool);
src/system/kernel/arch/m68k/paging/m68k_physical_page_mapper_large_memory.cpp
741
PhysicalPageSlotPool* pool = slot->pool;
src/system/kernel/arch/m68k/paging/m68k_physical_page_mapper_large_memory.cpp
742
if (pool->IsEmpty()) {
src/system/kernel/arch/m68k/paging/m68k_physical_page_mapper_large_memory.cpp
743
fEmptyPools.Remove(pool);
src/system/kernel/arch/m68k/paging/m68k_physical_page_mapper_large_memory.cpp
744
fNonEmptyPools.Add(pool);
src/system/kernel/arch/m68k/paging/m68k_physical_page_mapper_large_memory.cpp
747
pool->PutSlot(slot);
src/system/kernel/arch/m68k/paging/m68k_physical_page_mapper_large_memory.h
27
PhysicalPageSlotPool* pool;
src/system/kernel/arch/ppc/paging/460/PPCPagingMethod460.cpp
122
PhysicalPageSlotPool* pool
src/system/kernel/arch/ppc/paging/460/PPCPagingMethod460.cpp
125
status_t error = pool->InitInitial(args);
src/system/kernel/arch/ppc/paging/460/PPCPagingMethod460.cpp
133
large_memory_physical_page_ops_init(args, pool, fPhysicalPageMapper,
src/system/kernel/arch/ppc/paging/classic/PPCPagingMethodClassic.cpp
122
PhysicalPageSlotPool* pool
src/system/kernel/arch/ppc/paging/classic/PPCPagingMethodClassic.cpp
125
status_t error = pool->InitInitial(args);
src/system/kernel/arch/ppc/paging/classic/PPCPagingMethodClassic.cpp
133
large_memory_physical_page_ops_init(args, pool, fPhysicalPageMapper,
src/system/kernel/arch/x86/paging/32bit/X86PagingMethod32Bit.cpp
168
slot->pool = this;
src/system/kernel/arch/x86/paging/32bit/X86PagingMethod32Bit.cpp
195
PhysicalPageSlotPool* pool = new(std::nothrow) PhysicalPageSlotPool;
src/system/kernel/arch/x86/paging/32bit/X86PagingMethod32Bit.cpp
196
if (pool == NULL)
src/system/kernel/arch/x86/paging/32bit/X86PagingMethod32Bit.cpp
198
ObjectDeleter<PhysicalPageSlotPool> poolDeleter(pool);
src/system/kernel/arch/x86/paging/32bit/X86PagingMethod32Bit.cpp
246
pool->Init(dataArea, data, virtualArea, (addr_t)virtualBase);
src/system/kernel/arch/x86/paging/32bit/X86PagingMethod32Bit.cpp
248
_pool = pool;
src/system/kernel/arch/x86/paging/32bit/X86PagingMethod32Bit.cpp
313
PhysicalPageSlotPool* pool = PhysicalPageSlotPool::sInitialPhysicalPagePool;
src/system/kernel/arch/x86/paging/32bit/X86PagingMethod32Bit.cpp
316
new(&pool[i]) PhysicalPageSlotPool;
src/system/kernel/arch/x86/paging/32bit/X86PagingMethod32Bit.cpp
317
status_t error = pool[i].InitInitial(args);
src/system/kernel/arch/x86/paging/32bit/X86PagingMethod32Bit.cpp
326
large_memory_physical_page_ops_init(args, pool, poolCount, sizeof(*pool),
src/system/kernel/arch/x86/paging/pae/X86PagingMethodPAE.cpp
478
slot->pool = this;
src/system/kernel/arch/x86/paging/pae/X86PagingMethodPAE.cpp
505
PhysicalPageSlotPool* pool = new(std::nothrow) PhysicalPageSlotPool;
src/system/kernel/arch/x86/paging/pae/X86PagingMethodPAE.cpp
506
if (pool == NULL)
src/system/kernel/arch/x86/paging/pae/X86PagingMethodPAE.cpp
508
ObjectDeleter<PhysicalPageSlotPool> poolDeleter(pool);
src/system/kernel/arch/x86/paging/pae/X86PagingMethodPAE.cpp
556
pool->Init(dataArea, (pae_page_table_entry*)data, virtualArea,
src/system/kernel/arch/x86/paging/pae/X86PagingMethodPAE.cpp
559
_pool = pool;
src/system/kernel/arch/x86/paging/pae/X86PagingMethodPAE.cpp
605
PhysicalPageSlotPool* pool = PhysicalPageSlotPool::sInitialPhysicalPagePool;
src/system/kernel/arch/x86/paging/pae/X86PagingMethodPAE.cpp
608
new(&pool[i]) PhysicalPageSlotPool;
src/system/kernel/arch/x86/paging/pae/X86PagingMethodPAE.cpp
609
status_t error = pool[i].InitInitial(this, args);
src/system/kernel/arch/x86/paging/pae/X86PagingMethodPAE.cpp
618
large_memory_physical_page_ops_init(args, pool, poolCount, sizeof(*pool),
src/system/kernel/arch/x86/paging/x86_physical_page_mapper_large_memory.cpp
184
pool->Map(physicalAddress, address);
src/system/kernel/arch/x86/paging/x86_physical_page_mapper_large_memory.cpp
706
PhysicalPageSlotPool* pool = fNonEmptyPools.Head();
src/system/kernel/arch/x86/paging/x86_physical_page_mapper_large_memory.cpp
707
if (pool == NULL) {
src/system/kernel/arch/x86/paging/x86_physical_page_mapper_large_memory.cpp
713
status_t error = fInitialPool->AllocatePool(pool);
src/system/kernel/arch/x86/paging/x86_physical_page_mapper_large_memory.cpp
718
fNonEmptyPools.Add(pool);
src/system/kernel/arch/x86/paging/x86_physical_page_mapper_large_memory.cpp
719
pool = fNonEmptyPools.Head();
src/system/kernel/arch/x86/paging/x86_physical_page_mapper_large_memory.cpp
722
slot = pool->GetSlot();
src/system/kernel/arch/x86/paging/x86_physical_page_mapper_large_memory.cpp
724
if (pool->IsEmpty()) {
src/system/kernel/arch/x86/paging/x86_physical_page_mapper_large_memory.cpp
725
fNonEmptyPools.Remove(pool);
src/system/kernel/arch/x86/paging/x86_physical_page_mapper_large_memory.cpp
726
fEmptyPools.Add(pool);
src/system/kernel/arch/x86/paging/x86_physical_page_mapper_large_memory.cpp
738
PhysicalPageSlotPool* pool = slot->pool;
src/system/kernel/arch/x86/paging/x86_physical_page_mapper_large_memory.cpp
739
if (pool->IsEmpty()) {
src/system/kernel/arch/x86/paging/x86_physical_page_mapper_large_memory.cpp
740
fEmptyPools.Remove(pool);
src/system/kernel/arch/x86/paging/x86_physical_page_mapper_large_memory.cpp
741
fNonEmptyPools.Add(pool);
src/system/kernel/arch/x86/paging/x86_physical_page_mapper_large_memory.cpp
744
pool->PutSlot(slot);
src/system/kernel/arch/x86/paging/x86_physical_page_mapper_large_memory.h
36
PhysicalPageSlotPool* pool;
src/system/kernel/debug/debug_heap.cpp
239
DebugAllocPool* pool = sCurrentPool->CreateChildPool();
src/system/kernel/debug/debug_heap.cpp
240
if (pool == NULL)
src/system/kernel/debug/debug_heap.cpp
243
sCurrentPool = pool;
src/system/kernel/debug/debug_heap.cpp
249
delete_debug_alloc_pool(debug_alloc_pool* pool)
src/system/kernel/debug/debug_heap.cpp
251
if (pool == NULL || sCurrentPool == NULL)
src/system/kernel/debug/debug_heap.cpp
256
while (otherPool != NULL && otherPool != pool)
src/system/kernel/debug/debug_heap.cpp
263
sCurrentPool = pool->Parent();
src/system/kernel/debug/debug_heap.cpp
264
pool->Destroy();
src/system/kernel/debug/debug_heap.cpp
266
if (pool != &sInitialPool)
src/system/kernel/debug/debug_heap.cpp
267
debug_free(pool);
src/system/kernel/debug/debug_heap.cpp
61
DebugAllocPool* pool
src/system/kernel/debug/debug_heap.cpp
63
if (pool == NULL)
src/system/kernel/debug/debug_heap.cpp
68
Free(pool);
src/system/kernel/debug/debug_heap.cpp
75
pool->Init(header + 1, header->size * 8);
src/system/kernel/debug/debug_heap.cpp
76
pool->fParent = this;
src/system/kernel/debug/debug_heap.cpp
78
return fChild = pool;
src/system/kernel/events/wait_for_objects.cpp
768
find_select_sync_pool_entry(select_sync_pool *pool, selectsync *sync)
src/system/kernel/events/wait_for_objects.cpp
770
for (SelectSyncPoolEntryList::Iterator it = pool->entries.GetIterator();
src/system/kernel/events/wait_for_objects.cpp
782
add_select_sync_pool_entry(select_sync_pool *pool, selectsync *sync,
src/system/kernel/events/wait_for_objects.cpp
786
select_sync_pool_entry *entry = find_select_sync_pool_entry(pool, sync);
src/system/kernel/events/wait_for_objects.cpp
795
pool->entries.Add(entry);
src/system/kernel/events/wait_for_objects.cpp
809
select_sync_pool *pool = *_pool;
src/system/kernel/events/wait_for_objects.cpp
810
if (!pool) {
src/system/kernel/events/wait_for_objects.cpp
811
pool = new (std::nothrow) select_sync_pool;
src/system/kernel/events/wait_for_objects.cpp
812
if (!pool)
src/system/kernel/events/wait_for_objects.cpp
815
*_pool = pool;
src/system/kernel/events/wait_for_objects.cpp
819
status_t error = add_select_sync_pool_entry(pool, sync, event);
src/system/kernel/events/wait_for_objects.cpp
822
if (pool->entries.IsEmpty()) {
src/system/kernel/events/wait_for_objects.cpp
823
delete pool;
src/system/kernel/events/wait_for_objects.cpp
835
select_sync_pool *pool = *_pool;
src/system/kernel/events/wait_for_objects.cpp
836
if (!pool)
src/system/kernel/events/wait_for_objects.cpp
841
for (SelectSyncPoolEntryList::Iterator it = pool->entries.GetIterator();
src/system/kernel/events/wait_for_objects.cpp
860
if (pool->entries.IsEmpty()) {
src/system/kernel/events/wait_for_objects.cpp
861
delete pool;
src/system/kernel/events/wait_for_objects.cpp
870
delete_select_sync_pool(select_sync_pool *pool)
src/system/kernel/events/wait_for_objects.cpp
872
if (!pool)
src/system/kernel/events/wait_for_objects.cpp
875
while (select_sync_pool_entry *entry = pool->entries.Head()) {
src/system/kernel/events/wait_for_objects.cpp
876
pool->entries.Remove(entry);
src/system/kernel/events/wait_for_objects.cpp
880
delete pool;
src/system/kernel/events/wait_for_objects.cpp
885
notify_select_event_pool(select_sync_pool *pool, uint8 event)
src/system/kernel/events/wait_for_objects.cpp
887
if (!pool)
src/system/kernel/events/wait_for_objects.cpp
890
FUNCTION(("notify_select_event_pool(%p, %u)\n", pool, event));
src/system/kernel/events/wait_for_objects.cpp
892
for (SelectSyncPoolEntryList::Iterator it = pool->entries.GetIterator();
src/system/kernel/fs/fifo.cpp
887
select_sync_pool** pool;
src/system/kernel/fs/fifo.cpp
891
pool = &fReadSelectSyncPool;
src/system/kernel/fs/fifo.cpp
894
pool = &fWriteSelectSyncPool;
src/system/kernel/fs/fifo.cpp
898
if (add_select_sync_pool_entry(pool, sync, event) != B_OK)
src/system/kernel/fs/fifo.cpp
923
select_sync_pool** pool;
src/system/kernel/fs/fifo.cpp
926
pool = &fReadSelectSyncPool;
src/system/kernel/fs/fifo.cpp
928
pool = &fWriteSelectSyncPool;
src/system/kernel/fs/fifo.cpp
932
remove_select_sync_pool_entry(pool, sync, event);
src/system/kernel/vm/vm.cpp
4431
vm_try_reserve_internal(int64& pool, uint32 resource,
src/system/kernel/vm/vm.cpp
4436
TRACE(("try to reserve %lu bytes, %Lu left\n", amount, pool));
src/system/kernel/vm/vm.cpp
4444
if (atomic_get64(&pool) > (amountPlusReserve + amount)) {
src/system/kernel/vm/vm.cpp
4445
if (atomic_add64(&pool, -amount) >= amountPlusReserve)
src/system/kernel/vm/vm.cpp
4449
atomic_add64(&pool, amount);
src/system/kernel/vm/vm.cpp
4455
if (pool >= amountPlusReserve) {
src/system/kernel/vm/vm.cpp
4456
pool -= amount;
src/system/kernel/vm/vm.cpp
4469
uint64 requirement = sNeededMemory - (pool - reserve);
src/system/kernel/vm/vm.cpp
4477
if (pool >= amountPlusReserve) {
src/system/kernel/vm/vm.cpp
4478
pool -= amount;
src/system/libroot/posix/malloc/openbsd/malloc.c
1379
omalloc(struct dir_info *pool, size_t sz, int zero_fill)
src/system/libroot/posix/malloc/openbsd/malloc.c
1391
p = map(pool, psz, zero_fill);
src/system/libroot/posix/malloc/openbsd/malloc.c
1398
caller = pool->caller;
src/system/libroot/posix/malloc/openbsd/malloc.c
1400
if (insert(pool, p, sz, caller)) {
src/system/libroot/posix/malloc/openbsd/malloc.c
1401
unmap(pool, p, psz, 0);
src/system/libroot/posix/malloc/openbsd/malloc.c
1408
wrterror(pool, "mprotect");
src/system/libroot/posix/malloc/openbsd/malloc.c
1409
STATS_ADD(pool->malloc_guarded, mopts.malloc_guard);
src/system/libroot/posix/malloc/openbsd/malloc.c
1414
if (pool->malloc_junk == 2)
src/system/libroot/posix/malloc/openbsd/malloc.c
1419
if (zero_fill && pool->malloc_junk == 2)
src/system/libroot/posix/malloc/openbsd/malloc.c
1422
if (pool->malloc_junk == 2) {
src/system/libroot/posix/malloc/openbsd/malloc.c
1437
p = malloc_bytes(pool, sz);
src/system/libroot/posix/malloc/openbsd/malloc.c
1624
struct dir_info *pool = argpool;
src/system/libroot/posix/malloc/openbsd/malloc.c
1625
struct region_info *r = find(pool, p);
src/system/libroot/posix/malloc/openbsd/malloc.c
1654
pool->active--;
src/system/libroot/posix/malloc/openbsd/malloc.c
1655
_MALLOC_UNLOCK(pool->mutex);
src/system/libroot/posix/malloc/openbsd/malloc.c
1656
pool = mopts.malloc_pool[j];
src/system/libroot/posix/malloc/openbsd/malloc.c
1657
_MALLOC_LOCK(pool->mutex);
src/system/libroot/posix/malloc/openbsd/malloc.c
1658
pool->active++;
src/system/libroot/posix/malloc/openbsd/malloc.c
1659
r = find(pool, p);
src/system/libroot/posix/malloc/openbsd/malloc.c
1661
*saved_function = pool->func;
src/system/libroot/posix/malloc/openbsd/malloc.c
1662
pool->func = argpool->func;
src/system/libroot/posix/malloc/openbsd/malloc.c
1672
*foundpool = pool;
src/system/libroot/posix/malloc/openbsd/malloc.c
1680
struct dir_info *pool;
src/system/libroot/posix/malloc/openbsd/malloc.c
1684
r = findpool(p, *argpool, &pool, &saved_function);
src/system/libroot/posix/malloc/openbsd/malloc.c
1687
if (pool->mmap_flag) {
src/system/libroot/posix/malloc/openbsd/malloc.c
1701
find_chunknum(pool, info, p, 0);
src/system/libroot/posix/malloc/openbsd/malloc.c
1704
wrterror(pool, "recorded size %hu"
src/system/libroot/posix/malloc/openbsd/malloc.c
1710
wrterror(pool, "chunk size %zu < %zu",
src/system/libroot/posix/malloc/openbsd/malloc.c
1714
wrterror(pool, "recorded size %zu < %zu",
src/system/libroot/posix/malloc/openbsd/malloc.c
1721
wrterror(pool, "bogus pointer %p", p);
src/system/libroot/posix/malloc/openbsd/malloc.c
1723
validate_canary(pool, p,
src/system/libroot/posix/malloc/openbsd/malloc.c
1729
wrterror(pool, "bogus moved pointer %p", p);
src/system/libroot/posix/malloc/openbsd/malloc.c
1734
wrterror(pool, "guard size");
src/system/libroot/posix/malloc/openbsd/malloc.c
1739
wrterror(pool, "mprotect");
src/system/libroot/posix/malloc/openbsd/malloc.c
1741
STATS_SUB(pool->malloc_guarded, mopts.malloc_guard);
src/system/libroot/posix/malloc/openbsd/malloc.c
1743
unmap(pool, p, PAGEROUND(sz), clear ? argsz : 0);
src/system/libroot/posix/malloc/openbsd/malloc.c
1744
delete(pool, r);
src/system/libroot/posix/malloc/openbsd/malloc.c
1752
wrterror(pool, "internal struct corrupt");
src/system/libroot/posix/malloc/openbsd/malloc.c
1753
find_chunknum(pool, info, p, mopts.chunk_canaries);
src/system/libroot/posix/malloc/openbsd/malloc.c
1757
tmp = pool->delayed_chunks[i];
src/system/libroot/posix/malloc/openbsd/malloc.c
1759
wrterror(pool,
src/system/libroot/posix/malloc/openbsd/malloc.c
1764
r = find(pool, tmp);
src/system/libroot/posix/malloc/openbsd/malloc.c
1766
wrterror(pool,
src/system/libroot/posix/malloc/openbsd/malloc.c
1770
validate_junk(pool, tmp, tmpsz);
src/system/libroot/posix/malloc/openbsd/malloc.c
1777
junk_free(pool->malloc_junk, p, sz);
src/system/libroot/posix/malloc/openbsd/malloc.c
1779
i = getrbyte(pool) & MALLOC_DELAYED_CHUNK_MASK;
src/system/libroot/posix/malloc/openbsd/malloc.c
1781
p = pool->delayed_chunks[i];
src/system/libroot/posix/malloc/openbsd/malloc.c
1783
wrterror(pool, "double free %p", p);
src/system/libroot/posix/malloc/openbsd/malloc.c
1784
pool->delayed_chunks[i] = tmp;
src/system/libroot/posix/malloc/openbsd/malloc.c
1786
r = find(pool, p);
src/system/libroot/posix/malloc/openbsd/malloc.c
1788
wrterror(pool,
src/system/libroot/posix/malloc/openbsd/malloc.c
1792
validate_junk(pool, p, sz);
src/system/libroot/posix/malloc/openbsd/malloc.c
1794
free_bytes(pool, r, p);
src/system/libroot/posix/malloc/openbsd/malloc.c
1798
if (*argpool != pool) {
src/system/libroot/posix/malloc/openbsd/malloc.c
1799
pool->func = saved_function;
src/system/libroot/posix/malloc/openbsd/malloc.c
1800
*argpool = pool;
src/system/libroot/posix/malloc/openbsd/malloc.c
1875
struct dir_info *pool;
src/system/libroot/posix/malloc/openbsd/malloc.c
1891
r = findpool(p, *argpool, &pool, &saved_function);
src/system/libroot/posix/malloc/openbsd/malloc.c
1897
chunknum = find_chunknum(pool, info, p, 0);
src/system/libroot/posix/malloc/openbsd/malloc.c
1904
wrterror(pool, "guard size");
src/system/libroot/posix/malloc/openbsd/malloc.c
1912
forced = mopts.malloc_realloc || pool->mmap_flag;
src/system/libroot/posix/malloc/openbsd/malloc.c
1933
STATS_INC(pool->cheap_realloc_tries);
src/system/libroot/posix/malloc/openbsd/malloc.c
1935
__MAP_NOREPLACE | pool->mmap_flag);
src/system/libroot/posix/malloc/openbsd/malloc.c
1937
STATS_ADD(pool->malloc_used, needed);
src/system/libroot/posix/malloc/openbsd/malloc.c
1938
if (pool->malloc_junk == 2)
src/system/libroot/posix/malloc/openbsd/malloc.c
1950
STATS_INC(pool->cheap_reallocs);
src/system/libroot/posix/malloc/openbsd/malloc.c
1961
wrterror(pool, "mprotect");
src/system/libroot/posix/malloc/openbsd/malloc.c
1964
wrterror(pool, "munmap %p", (char *)r->p +
src/system/libroot/posix/malloc/openbsd/malloc.c
1966
STATS_SUB(pool->malloc_used, roldsz - rnewsz);
src/system/libroot/posix/malloc/openbsd/malloc.c
1989
if (newsz > oldsz && pool->malloc_junk == 2)
src/system/libroot/posix/malloc/openbsd/malloc.c
2005
if (pool->malloc_junk == 2)
src/system/libroot/posix/malloc/openbsd/malloc.c
2016
q = omalloc(pool, newsz, 0);
src/system/libroot/posix/malloc/openbsd/malloc.c
2023
ofree(&pool, p, 0, 0, 0);
src/system/libroot/posix/malloc/openbsd/malloc.c
2028
wrterror(pool, "realloc internal inconsistency");
src/system/libroot/posix/malloc/openbsd/malloc.c
2034
if (*argpool != pool) {
src/system/libroot/posix/malloc/openbsd/malloc.c
2035
pool->func = saved_function;
src/system/libroot/posix/malloc/openbsd/malloc.c
2036
*argpool = pool;
src/system/libroot/posix/malloc/openbsd/malloc.c
2061
struct dir_info *pool;
src/system/libroot/posix/malloc/openbsd/malloc.c
2065
r = findpool(p, *argpool, &pool, &saved_function);
src/system/libroot/posix/malloc/openbsd/malloc.c
2069
if (*argpool != pool) {
src/system/libroot/posix/malloc/openbsd/malloc.c
2070
pool->func = saved_function;
src/system/libroot/posix/malloc/openbsd/malloc.c
2071
*argpool = pool;
src/system/libroot/posix/malloc/openbsd/malloc.c
2162
struct dir_info *pool;
src/system/libroot/posix/malloc/openbsd/malloc.c
2173
r = findpool(p, *argpool, &pool, &saved_function);
src/system/libroot/posix/malloc/openbsd/malloc.c
2179
uint32_t chunknum = find_chunknum(pool, info, p, 0);
src/system/libroot/posix/malloc/openbsd/malloc.c
2182
wrterror(pool, "recorded size %hu != %zu",
src/system/libroot/posix/malloc/openbsd/malloc.c
2187
wrterror(pool, "chunk size %zu < %zu",
src/system/libroot/posix/malloc/openbsd/malloc.c
2192
wrterror(pool, "recorded size %zu < %zu",
src/system/libroot/posix/malloc/openbsd/malloc.c
2195
wrterror(pool,
src/system/libroot/posix/malloc/openbsd/malloc.c
2200
newptr = omalloc(pool, newsize, 0);
src/system/libroot/posix/malloc/openbsd/malloc.c
2210
ofree(&pool, p, 1, 0, oldsize);
src/system/libroot/posix/malloc/openbsd/malloc.c
2213
if (*argpool != pool) {
src/system/libroot/posix/malloc/openbsd/malloc.c
2214
pool->func = saved_function;
src/system/libroot/posix/malloc/openbsd/malloc.c
2215
*argpool = pool;
src/system/libroot/posix/malloc/openbsd/malloc.c
2351
omemalign(struct dir_info *pool, size_t alignment, size_t sz, int zero_fill)
src/system/libroot/posix/malloc/openbsd/malloc.c
2374
return omalloc(pool, pof2, zero_fill);
src/system/libroot/posix/malloc/openbsd/malloc.c
2387
p = mapalign(pool, alignment, psz, zero_fill);
src/system/libroot/posix/malloc/openbsd/malloc.c
2395
caller = pool->caller;
src/system/libroot/posix/malloc/openbsd/malloc.c
2397
if (insert(pool, p, sz, caller)) {
src/system/libroot/posix/malloc/openbsd/malloc.c
2398
unmap(pool, p, psz, 0);
src/system/libroot/posix/malloc/openbsd/malloc.c
2406
wrterror(pool, "mprotect");
src/system/libroot/posix/malloc/openbsd/malloc.c
2407
STATS_ADD(pool->malloc_guarded, mopts.malloc_guard);
src/system/libroot/posix/malloc/openbsd/malloc.c
2410
if (pool->malloc_junk == 2) {
src/system/libroot/posix/malloc/openbsd/malloc.c
2528
print_chunk_details(struct dir_info *pool, void *p, size_t sz, size_t index)
src/system/libroot/posix/malloc/openbsd/malloc.c
2539
r = find(pool, p);
src/system/libroot/posix/malloc/openbsd/malloc.c
2541
chunknum = find_chunknum(pool, chunkinfo, p, 0);
src/system/libroot/posix/malloc/openbsd/malloc.c
2556
wrterror(pool,
src/system/libroot/posix/malloc/openbsd/malloc.c
2845
malloc_dump0(int poolno, struct dir_info *pool, struct leaktree *leaks)
src/system/libroot/posix/malloc/openbsd/malloc.c
2851
if (pool == NULL || pool->r == NULL)
src/system/libroot/posix/malloc/openbsd/malloc.c
2854
p = pool->delayed_chunks[i];
src/system/libroot/posix/malloc/openbsd/malloc.c
2857
r = find(pool, p);
src/system/libroot/posix/malloc/openbsd/malloc.c
2859
wrterror(pool, "bogus pointer in malloc_dump %p", p);
src/system/libroot/posix/malloc/openbsd/malloc.c
2860
free_bytes(pool, r, p);
src/system/libroot/posix/malloc/openbsd/malloc.c
2861
pool->delayed_chunks[i] = NULL;
src/system/libroot/posix/malloc/openbsd/malloc.c
2863
malloc_dump1(poolno, pool, leaks);
src/system/libroot/posix/malloc/openbsd/malloc.c
803
validate_junk(struct dir_info *pool, void *p, size_t argsz)
src/system/libroot/posix/malloc/openbsd/malloc.c
808
if (pool->malloc_junk == 0 || argsz == 0)
src/system/libroot/posix/malloc/openbsd/malloc.c
811
if (pool->malloc_junk == 1) {
src/system/libroot/posix/malloc/openbsd/malloc.c
823
print_chunk_details(pool, lp, argsz, i);
src/system/libroot/posix/malloc/openbsd/malloc.c
826
wrterror(pool,
src/tests/add-ons/kernel/file_systems/bfs/bufferPool/main.cpp
18
BufferPool &pool = *(BufferPool *)_pool;
src/tests/add-ons/kernel/file_systems/bfs/bufferPool/main.cpp
27
if ((status = pool.GetBuffer(&buffer)) != B_OK) {
src/tests/add-ons/kernel/file_systems/bfs/bufferPool/main.cpp
33
pool.PutBuffer(buffer);
src/tests/add-ons/kernel/file_systems/bfs/bufferPool/main.cpp
43
BufferPool pool;
src/tests/add-ons/kernel/file_systems/bfs/bufferPool/main.cpp
46
if (pool.RequestBuffers(BLOCK_SIZE) == B_OK) {
src/tests/add-ons/kernel/file_systems/bfs/bufferPool/main.cpp
48
thread[i] = spawn_thread(allocator, "", B_NORMAL_PRIORITY, (void *)&pool);
src/tests/add-ons/kernel/file_systems/bfs/bufferPool/main.cpp
59
pool.ReleaseBuffers();