Lines Matching defs:bucket
417 unsigned bucket;
484 unsigned bucket, entry;
487 bucket = n >> 32;
490 if (bucket >= ls->ls_rsbtbl_size)
509 tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep;
511 spin_lock(&ls->ls_rsbtbl[bucket].lock);
518 ri->bucket = bucket;
519 spin_unlock(&ls->ls_rsbtbl[bucket].lock);
524 spin_unlock(&ls->ls_rsbtbl[bucket].lock);
527 * move to the first rsb in the next non-empty bucket
534 bucket++;
537 if (bucket >= ls->ls_rsbtbl_size) {
541 tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep;
543 spin_lock(&ls->ls_rsbtbl[bucket].lock);
549 ri->bucket = bucket;
550 spin_unlock(&ls->ls_rsbtbl[bucket].lock);
554 spin_unlock(&ls->ls_rsbtbl[bucket].lock);
566 unsigned bucket;
569 bucket = n >> 32;
572 * move to the next rsb in the same bucket
575 spin_lock(&ls->ls_rsbtbl[bucket].lock);
583 spin_unlock(&ls->ls_rsbtbl[bucket].lock);
588 spin_unlock(&ls->ls_rsbtbl[bucket].lock);
592 * move to the first rsb in the next non-empty bucket
599 bucket++;
602 if (bucket >= ls->ls_rsbtbl_size) {
607 tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep;
609 spin_lock(&ls->ls_rsbtbl[bucket].lock);
615 ri->bucket = bucket;
616 spin_unlock(&ls->ls_rsbtbl[bucket].lock);
620 spin_unlock(&ls->ls_rsbtbl[bucket].lock);