| 347 | } |
| 348 | |
| 349 | Kernel |
| 350 | *findKernel( |
| 351 | struct KernelCache *kcache, |
| 352 | solver_id_t sid, |
| 353 | const KernelKey *key, |
| 354 | const void *extraKey) |
| 355 | { |
| 356 | Kernel *kern = NULL; |
| 357 | KcacheKey kkey; |
| 358 | KernelNode *knode; |
| 359 | ListNode *lnode; |
| 360 | |
| 361 | if ((unsigned)sid >= kcache->nrSolvers || key->nrDims > MAX_SUBDIMS) { |
| 362 | return NULL; |
| 363 | } |
| 364 | |
| 365 | kkey.hash = kernHash(key->subdims, key->nrDims); |
| 366 | kkey.extra = extraKey; |
| 367 | |
| 368 | kkey.key.device = key->device; |
| 369 | kkey.key.context = key->context; |
| 370 | kkey.key.nrDims = key->nrDims; |
| 371 | memset(kkey.key.subdims, 0, sizeof(kkey.key.subdims)); |
| 372 | memcpy(kkey.key.subdims, key->subdims, sizeof(SubproblemDim) * kkey.key.nrDims); |
| 373 | |
| 374 | KCACHE_LOCK(kcache); |
| 375 | lnode = listNodeSearch(&kcache->dimKern[sid], &kkey, knodeCmp); |
| 376 | if (lnode) { |
| 377 | knode = container_of(lnode, dimNode, KernelNode); |
| 378 | knode->refcnt++; |
| 379 | kern = &knode->kern; |
| 380 | |
| 381 | // move the kernel to the top of the LRU list |
| 382 | listDel(&knode->lruNode); |
| 383 | listAddToHead(&kcache->lruKern, &knode->lruNode); |
| 384 | } |
| 385 | KCACHE_UNLOCK(kcache); |
| 386 | |
| 387 | return kern; |
| 388 | } |
| 389 | |
| 390 | size_t |
| 391 | availKernelCacheSize(struct KernelCache *kcache) |