____rb_erase

Name:Inline version for rb_erase() use - we want to be able to inline* and eliminate the dummy_rotate callback there

Proto:static __always_inline void ____rb_erase_color(struct rb_node *parent, struct rb_root *root, void (*augment_rotate)(struct rb_node *old, struct rb_node *new))

Type:void

Parameter:

Type	Parameter	Name
struct rb_node *	parent
struct rb_root *	root
void (*	augment_rotate

240

sibling = rb_right

241

If node != sibling Then

242

If rb_is_red(sibling) Then

252

tmp1 = rb_left

253

WRITE_ONCE(rb_right, tmp1)

254

WRITE_ONCE(rb_left, parent)

255

rb_set_parent_color(tmp1, parent, RB_BLACK)

256

Helper function for rotations:* - old's parent and color get assigned to new* - old gets assigned new as a parent and 'color' as a color.

258

augment_rotate(parent, sibling)

259

sibling = tmp1

261

tmp1 = rb_right

262

If Not tmp1 || rb_is_black(tmp1) Then

263

tmp2 = rb_left

264

If Not tmp2 || rb_is_black(tmp2) Then

280

rb_set_parent_color(sibling, parent, RB_RED)

282

If rb_is_red(parent) Then Notes on lockless lookups:* All stores to the tree structure (rb_left and rb_right) must be done using* WRITE_ONCE()

284

Else

285

node = parent

286

parent = rb_parent(node)

287

If parent Then Continue

290

Break

319

tmp1 = rb_right

320

WRITE_ONCE(rb_left, tmp1)

321

WRITE_ONCE(rb_right, sibling)

322

WRITE_ONCE(rb_right, tmp2)

323

If tmp1 Then rb_set_parent_color(tmp1, sibling, RB_BLACK)

326

augment_rotate(sibling, tmp2)

327

tmp1 = sibling

328

sibling = tmp2

342

tmp2 = rb_left

343

WRITE_ONCE(rb_right, tmp2)

344

WRITE_ONCE(rb_left, parent)

345

rb_set_parent_color(tmp1, sibling, RB_BLACK)

346

If tmp2 Then rb_set_parent(tmp2, parent)

348

Helper function for rotations:* - old's parent and color get assigned to new* - old gets assigned new as a parent and 'color' as a color.

350

augment_rotate(parent, sibling)

351

Break

352

Else

353

sibling = rb_left

354

If rb_is_red(sibling) Then

356

tmp1 = rb_right

357

WRITE_ONCE(rb_left, tmp1)

358

WRITE_ONCE(rb_right, parent)

359

rb_set_parent_color(tmp1, parent, RB_BLACK)

360

Helper function for rotations:* - old's parent and color get assigned to new* - old gets assigned new as a parent and 'color' as a color.

362

augment_rotate(parent, sibling)

363

sibling = tmp1

365

tmp1 = rb_left

366

If Not tmp1 || rb_is_black(tmp1) Then

367

tmp2 = rb_right

368

If Not tmp2 || rb_is_black(tmp2) Then

370

rb_set_parent_color(sibling, parent, RB_RED)

372

If rb_is_red(parent) Then Notes on lockless lookups:* All stores to the tree structure (rb_left and rb_right) must be done using* WRITE_ONCE()

374

Else

375

node = parent

376

parent = rb_parent(node)

377

If parent Then Continue

380

Break

383

tmp1 = rb_left

384

WRITE_ONCE(rb_right, tmp1)

385

WRITE_ONCE(rb_left, sibling)

386

WRITE_ONCE(rb_left, tmp2)

387

If tmp1 Then rb_set_parent_color(tmp1, sibling, RB_BLACK)

390

augment_rotate(sibling, tmp2)

391

tmp1 = sibling

392

sibling = tmp2

395

tmp2 = rb_right

396

WRITE_ONCE(rb_left, tmp2)

397

WRITE_ONCE(rb_right, parent)

398

rb_set_parent_color(tmp1, sibling, RB_BLACK)

399

If tmp2 Then rb_set_parent(tmp2, parent)

401

Helper function for rotations:* - old's parent and color get assigned to new* - old gets assigned new as a parent and 'color' as a color.

403

augment_rotate(parent, sibling)

404

Break

Name	Describe
__rb_erase_color	Non-inline version for rb_erase_augmented() use
rb_erase

Function report