__sbitmap_queue_get

Name:__sbitmap_queue_get

Proto:int __sbitmap_queue_get(struct sbitmap_queue *sbq)

Type:int

Parameter:

Type	Parameter	Name
struct sbitmap_queue *	sbq

426

hint = Operations with implied preemption/interrupt protection. These* operations can be used without worrying about preemption or interrupt.( * @alloc_hint: Cache of last successfully allocated or freed bit.* This is per-cpu, which allows multiple users to stick to different* cachelines until the map is exhausted.)

427

depth = READ_ONCE(@depth: Number of bits used in the whole bitmap.)

428

If Value for the false possibility is greater at compile time(hint >= depth) Then

429

hint = If depth Then prandom_u32() % depth Else 0

430

this_cpu_write( * @alloc_hint: Cache of last successfully allocated or freed bit.* This is per-cpu, which allows multiple users to stick to different* cachelines until the map is exhausted., hint)

432

nr = sbitmap_get( & @sb: Scalable bitmap., hint, @round_robin: Allocate bits in strict round-robin order.)

434

If nr == -1 Then

436

this_cpu_write( * @alloc_hint: Cache of last successfully allocated or freed bit.* This is per-cpu, which allows multiple users to stick to different* cachelines until the map is exhausted., 0)

437

Else if nr == hint || Value for the false possibility is greater at compile time(@round_robin: Allocate bits in strict round-robin order.) Then

439

hint = nr + 1

440

If hint >= depth - 1 Then hint = 0

442

this_cpu_write( * @alloc_hint: Cache of last successfully allocated or freed bit.* This is per-cpu, which allows multiple users to stick to different* cachelines until the map is exhausted., hint)

445

Return nr

**Caller**
Name	Describe
kyber_get_domain_token

Source code conversion tool public plug-in interface	X
Support c/c++/esqlc/java Oracle/Informix/Mysql Plug-in can realize: logical Report Code generation and batch code conversion