lib/libc/citrus/citrus_hash.h

45

#define _CITRUS_HASH_REMOVE(elm, field) LIST_REMOVE(elm, field)

lib/libc/citrus/citrus_hash.h

46

#define _CITRUS_HASH_INSERT(head, elm, field, hashval) \

lib/libc/citrus/citrus_hash.h

47

LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field)

lib/libc/citrus/citrus_hash.h

48

#define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \

lib/libc/citrus/citrus_hash.h

50

LIST_FOREACH((elm), &(head)->chh_table[hashval], field) \

lib/libc/citrus/citrus_hash.h

51

if (matchfunc((elm), key) == 0) \

lib/libssh/openbsd-compat/sys-queue.h

205

#define SLIST_NEXT(elm, field) ((elm)->field.sle_next)

lib/libssh/openbsd-compat/sys-queue.h

224

#define SLIST_INSERT_AFTER(slistelm, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

225

(elm)->field.sle_next = (slistelm)->field.sle_next; \

lib/libssh/openbsd-compat/sys-queue.h

226

(slistelm)->field.sle_next = (elm); \

lib/libssh/openbsd-compat/sys-queue.h

229

#define SLIST_INSERT_HEAD(head, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

230

(elm)->field.sle_next = (head)->slh_first; \

lib/libssh/openbsd-compat/sys-queue.h

231

(head)->slh_first = (elm); \

lib/libssh/openbsd-compat/sys-queue.h

234

#define SLIST_REMOVE_AFTER(elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

235

(elm)->field.sle_next = (elm)->field.sle_next->field.sle_next; \

lib/libssh/openbsd-compat/sys-queue.h

242

#define SLIST_REMOVE(head, elm, type, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

243

if ((head)->slh_first == (elm)) { \

lib/libssh/openbsd-compat/sys-queue.h

248

while (curelm->field.sle_next != (elm)) \

lib/libssh/openbsd-compat/sys-queue.h

253

_Q_INVALIDATE((elm)->field.sle_next); \

lib/libssh/openbsd-compat/sys-queue.h

279

#define LIST_NEXT(elm, field) ((elm)->field.le_next)

lib/libssh/openbsd-compat/sys-queue.h

298

#define LIST_INSERT_AFTER(listelm, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

299

if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \

lib/libssh/openbsd-compat/sys-queue.h

301

&(elm)->field.le_next; \

lib/libssh/openbsd-compat/sys-queue.h

302

(listelm)->field.le_next = (elm); \

lib/libssh/openbsd-compat/sys-queue.h

303

(elm)->field.le_prev = &(listelm)->field.le_next; \

lib/libssh/openbsd-compat/sys-queue.h

306

#define LIST_INSERT_BEFORE(listelm, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

307

(elm)->field.le_prev = (listelm)->field.le_prev; \

lib/libssh/openbsd-compat/sys-queue.h

308

(elm)->field.le_next = (listelm); \

lib/libssh/openbsd-compat/sys-queue.h

309

*(listelm)->field.le_prev = (elm); \

lib/libssh/openbsd-compat/sys-queue.h

310

(listelm)->field.le_prev = &(elm)->field.le_next; \

lib/libssh/openbsd-compat/sys-queue.h

313

#define LIST_INSERT_HEAD(head, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

314

if (((elm)->field.le_next = (head)->lh_first) != NULL) \

lib/libssh/openbsd-compat/sys-queue.h

315

(head)->lh_first->field.le_prev = &(elm)->field.le_next;\

lib/libssh/openbsd-compat/sys-queue.h

316

(head)->lh_first = (elm); \

lib/libssh/openbsd-compat/sys-queue.h

317

(elm)->field.le_prev = &(head)->lh_first; \

lib/libssh/openbsd-compat/sys-queue.h

320

#define LIST_REMOVE(elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

321

if ((elm)->field.le_next != NULL) \

lib/libssh/openbsd-compat/sys-queue.h

322

(elm)->field.le_next->field.le_prev = \

lib/libssh/openbsd-compat/sys-queue.h

323

(elm)->field.le_prev; \

lib/libssh/openbsd-compat/sys-queue.h

324

*(elm)->field.le_prev = (elm)->field.le_next; \

lib/libssh/openbsd-compat/sys-queue.h

325

_Q_INVALIDATE((elm)->field.le_prev); \

lib/libssh/openbsd-compat/sys-queue.h

326

_Q_INVALIDATE((elm)->field.le_next); \

lib/libssh/openbsd-compat/sys-queue.h

329

#define LIST_REPLACE(elm, elm2, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

330

if (((elm2)->field.le_next = (elm)->field.le_next) != NULL) \

lib/libssh/openbsd-compat/sys-queue.h

333

(elm2)->field.le_prev = (elm)->field.le_prev; \

lib/libssh/openbsd-compat/sys-queue.h

335

_Q_INVALIDATE((elm)->field.le_prev); \

lib/libssh/openbsd-compat/sys-queue.h

336

_Q_INVALIDATE((elm)->field.le_next); \

lib/libssh/openbsd-compat/sys-queue.h

362

#define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next)

lib/libssh/openbsd-compat/sys-queue.h

382

#define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

383

if (((elm)->field.sqe_next = (head)->sqh_first) == NULL) \

lib/libssh/openbsd-compat/sys-queue.h

384

(head)->sqh_last = &(elm)->field.sqe_next; \

lib/libssh/openbsd-compat/sys-queue.h

385

(head)->sqh_first = (elm); \

lib/libssh/openbsd-compat/sys-queue.h

388

#define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

389

(elm)->field.sqe_next = NULL; \

lib/libssh/openbsd-compat/sys-queue.h

390

*(head)->sqh_last = (elm); \

lib/libssh/openbsd-compat/sys-queue.h

391

(head)->sqh_last = &(elm)->field.sqe_next; \

lib/libssh/openbsd-compat/sys-queue.h

394

#define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

395

if (((elm)->field.sqe_next = (listelm)->field.sqe_next) == NULL)\

lib/libssh/openbsd-compat/sys-queue.h

396

(head)->sqh_last = &(elm)->field.sqe_next; \

lib/libssh/openbsd-compat/sys-queue.h

397

(listelm)->field.sqe_next = (elm); \

lib/libssh/openbsd-compat/sys-queue.h

405

#define SIMPLEQ_REMOVE_AFTER(head, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

406

if (((elm)->field.sqe_next = (elm)->field.sqe_next->field.sqe_next) \

lib/libssh/openbsd-compat/sys-queue.h

408

(head)->sqh_last = &(elm)->field.sqe_next; \

lib/libssh/openbsd-compat/sys-queue.h

442

#define XSIMPLEQ_NEXT(head, elm, field) XSIMPLEQ_XOR(head, ((elm)->field.sqx_next))

lib/libssh/openbsd-compat/sys-queue.h

464

#define XSIMPLEQ_INSERT_HEAD(head, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

465

if (((elm)->field.sqx_next = (head)->sqx_first) == \

lib/libssh/openbsd-compat/sys-queue.h

467

(head)->sqx_last = XSIMPLEQ_XOR(head, &(elm)->field.sqx_next); \

lib/libssh/openbsd-compat/sys-queue.h

468

(head)->sqx_first = XSIMPLEQ_XOR(head, (elm)); \

lib/libssh/openbsd-compat/sys-queue.h

471

#define XSIMPLEQ_INSERT_TAIL(head, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

472

(elm)->field.sqx_next = XSIMPLEQ_XOR(head, NULL); \

lib/libssh/openbsd-compat/sys-queue.h

473

*(XSIMPLEQ_XOR(head, (head)->sqx_last)) = XSIMPLEQ_XOR(head, (elm)); \

lib/libssh/openbsd-compat/sys-queue.h

474

(head)->sqx_last = XSIMPLEQ_XOR(head, &(elm)->field.sqx_next); \

lib/libssh/openbsd-compat/sys-queue.h

477

#define XSIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

478

if (((elm)->field.sqx_next = (listelm)->field.sqx_next) == \

lib/libssh/openbsd-compat/sys-queue.h

480

(head)->sqx_last = XSIMPLEQ_XOR(head, &(elm)->field.sqx_next); \

lib/libssh/openbsd-compat/sys-queue.h

481

(listelm)->field.sqx_next = XSIMPLEQ_XOR(head, (elm)); \

lib/libssh/openbsd-compat/sys-queue.h

490

#define XSIMPLEQ_REMOVE_AFTER(head, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

491

if (((elm)->field.sqx_next = XSIMPLEQ_XOR(head, \

lib/libssh/openbsd-compat/sys-queue.h

492

(elm)->field.sqx_next)->field.sqx_next) \

lib/libssh/openbsd-compat/sys-queue.h

495

XSIMPLEQ_XOR(head, &(elm)->field.sqx_next); \

lib/libssh/openbsd-compat/sys-queue.h

522

#define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)

lib/libssh/openbsd-compat/sys-queue.h

526

#define TAILQ_PREV(elm, headname, field) \

lib/libssh/openbsd-compat/sys-queue.h

527

(*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))

lib/libssh/openbsd-compat/sys-queue.h

562

#define TAILQ_INSERT_HEAD(head, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

563

if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \

lib/libssh/openbsd-compat/sys-queue.h

565

&(elm)->field.tqe_next; \

lib/libssh/openbsd-compat/sys-queue.h

567

(head)->tqh_last = &(elm)->field.tqe_next; \

lib/libssh/openbsd-compat/sys-queue.h

568

(head)->tqh_first = (elm); \

lib/libssh/openbsd-compat/sys-queue.h

569

(elm)->field.tqe_prev = &(head)->tqh_first; \

lib/libssh/openbsd-compat/sys-queue.h

572

#define TAILQ_INSERT_TAIL(head, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

573

(elm)->field.tqe_next = NULL; \

lib/libssh/openbsd-compat/sys-queue.h

574

(elm)->field.tqe_prev = (head)->tqh_last; \

lib/libssh/openbsd-compat/sys-queue.h

575

*(head)->tqh_last = (elm); \

lib/libssh/openbsd-compat/sys-queue.h

576

(head)->tqh_last = &(elm)->field.tqe_next; \

lib/libssh/openbsd-compat/sys-queue.h

579

#define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

580

if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\

lib/libssh/openbsd-compat/sys-queue.h

581

(elm)->field.tqe_next->field.tqe_prev = \

lib/libssh/openbsd-compat/sys-queue.h

582

&(elm)->field.tqe_next; \

lib/libssh/openbsd-compat/sys-queue.h

584

(head)->tqh_last = &(elm)->field.tqe_next; \

lib/libssh/openbsd-compat/sys-queue.h

585

(listelm)->field.tqe_next = (elm); \

lib/libssh/openbsd-compat/sys-queue.h

586

(elm)->field.tqe_prev = &(listelm)->field.tqe_next; \

lib/libssh/openbsd-compat/sys-queue.h

589

#define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

590

(elm)->field.tqe_prev = (listelm)->field.tqe_prev; \

lib/libssh/openbsd-compat/sys-queue.h

591

(elm)->field.tqe_next = (listelm); \

lib/libssh/openbsd-compat/sys-queue.h

592

*(listelm)->field.tqe_prev = (elm); \

lib/libssh/openbsd-compat/sys-queue.h

593

(listelm)->field.tqe_prev = &(elm)->field.tqe_next; \

lib/libssh/openbsd-compat/sys-queue.h

596

#define TAILQ_REMOVE(head, elm, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

597

if (((elm)->field.tqe_next) != NULL) \

lib/libssh/openbsd-compat/sys-queue.h

598

(elm)->field.tqe_next->field.tqe_prev = \

lib/libssh/openbsd-compat/sys-queue.h

599

(elm)->field.tqe_prev; \

lib/libssh/openbsd-compat/sys-queue.h

601

(head)->tqh_last = (elm)->field.tqe_prev; \

lib/libssh/openbsd-compat/sys-queue.h

602

*(elm)->field.tqe_prev = (elm)->field.tqe_next; \

lib/libssh/openbsd-compat/sys-queue.h

603

_Q_INVALIDATE((elm)->field.tqe_prev); \

lib/libssh/openbsd-compat/sys-queue.h

604

_Q_INVALIDATE((elm)->field.tqe_next); \

lib/libssh/openbsd-compat/sys-queue.h

607

#define TAILQ_REPLACE(head, elm, elm2, field) do { \

lib/libssh/openbsd-compat/sys-queue.h

608

if (((elm2)->field.tqe_next = (elm)->field.tqe_next) != NULL) \

lib/libssh/openbsd-compat/sys-queue.h

613

(elm2)->field.tqe_prev = (elm)->field.tqe_prev; \

lib/libssh/openbsd-compat/sys-queue.h

615

_Q_INVALIDATE((elm)->field.tqe_prev); \

lib/libssh/openbsd-compat/sys-queue.h

616

_Q_INVALIDATE((elm)->field.tqe_next); \

lib/libssh/openbsd-compat/sys-tree.h

129

name##_SPLAY_FIND(struct name *head, struct type *elm) \

lib/libssh/openbsd-compat/sys-tree.h

133

name##_SPLAY(head, elm); \

lib/libssh/openbsd-compat/sys-tree.h

134

if ((cmp)(elm, (head)->sph_root) == 0) \

lib/libssh/openbsd-compat/sys-tree.h

140

name##_SPLAY_NEXT(struct name *head, struct type *elm) \

lib/libssh/openbsd-compat/sys-tree.h

142

name##_SPLAY(head, elm); \

lib/libssh/openbsd-compat/sys-tree.h

143

if (SPLAY_RIGHT(elm, field) != NULL) { \

lib/libssh/openbsd-compat/sys-tree.h

144

elm = SPLAY_RIGHT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

145

while (SPLAY_LEFT(elm, field) != NULL) { \

lib/libssh/openbsd-compat/sys-tree.h

146

elm = SPLAY_LEFT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

149

elm = NULL; \

lib/libssh/openbsd-compat/sys-tree.h

150

return (elm); \

lib/libssh/openbsd-compat/sys-tree.h

165

name##_SPLAY_INSERT(struct name *head, struct type *elm) \

lib/libssh/openbsd-compat/sys-tree.h

168

SPLAY_LEFT(elm, field) = SPLAY_RIGHT(elm, field) = NULL; \

lib/libssh/openbsd-compat/sys-tree.h

171

name##_SPLAY(head, elm); \

lib/libssh/openbsd-compat/sys-tree.h

172

__comp = (cmp)(elm, (head)->sph_root); \

lib/libssh/openbsd-compat/sys-tree.h

174

SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\

lib/libssh/openbsd-compat/sys-tree.h

175

SPLAY_RIGHT(elm, field) = (head)->sph_root; \

lib/libssh/openbsd-compat/sys-tree.h

178

SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\

lib/libssh/openbsd-compat/sys-tree.h

179

SPLAY_LEFT(elm, field) = (head)->sph_root; \

lib/libssh/openbsd-compat/sys-tree.h

184

(head)->sph_root = (elm); \

lib/libssh/openbsd-compat/sys-tree.h

189

name##_SPLAY_REMOVE(struct name *head, struct type *elm) \

lib/libssh/openbsd-compat/sys-tree.h

194

name##_SPLAY(head, elm); \

lib/libssh/openbsd-compat/sys-tree.h

195

if ((cmp)(elm, (head)->sph_root) == 0) { \

lib/libssh/openbsd-compat/sys-tree.h

201

name##_SPLAY(head, elm); \

lib/libssh/openbsd-compat/sys-tree.h

204

return (elm); \

lib/libssh/openbsd-compat/sys-tree.h

210

name##_SPLAY(struct name *head, struct type *elm) \

lib/libssh/openbsd-compat/sys-tree.h

218

while ((__comp = (cmp)(elm, (head)->sph_root))) { \

lib/libssh/openbsd-compat/sys-tree.h

223

if ((cmp)(elm, __tmp) < 0){ \

lib/libssh/openbsd-compat/sys-tree.h

233

if ((cmp)(elm, __tmp) > 0){ \

lib/libssh/openbsd-compat/sys-tree.h

320

#define RB_LEFT(elm, field) (elm)->field.rbe_left

lib/libssh/openbsd-compat/sys-tree.h

321

#define RB_RIGHT(elm, field) (elm)->field.rbe_right

lib/libssh/openbsd-compat/sys-tree.h

322

#define RB_PARENT(elm, field) (elm)->field.rbe_parent

lib/libssh/openbsd-compat/sys-tree.h

323

#define RB_COLOR(elm, field) (elm)->field.rbe_color

lib/libssh/openbsd-compat/sys-tree.h

327

#define RB_SET(elm, parent, field) do { \

lib/libssh/openbsd-compat/sys-tree.h

328

RB_PARENT(elm, field) = parent; \

lib/libssh/openbsd-compat/sys-tree.h

329

RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \

lib/libssh/openbsd-compat/sys-tree.h

330

RB_COLOR(elm, field) = RB_RED; \

lib/libssh/openbsd-compat/sys-tree.h

342

#define RB_ROTATE_LEFT(head, elm, tmp, field) do { \

lib/libssh/openbsd-compat/sys-tree.h

343

(tmp) = RB_RIGHT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

344

if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field))) { \

lib/libssh/openbsd-compat/sys-tree.h

345

RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \

lib/libssh/openbsd-compat/sys-tree.h

347

RB_AUGMENT(elm); \

lib/libssh/openbsd-compat/sys-tree.h

348

if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field))) { \

lib/libssh/openbsd-compat/sys-tree.h

349

if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \

lib/libssh/openbsd-compat/sys-tree.h

350

RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \

lib/libssh/openbsd-compat/sys-tree.h

352

RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \

lib/libssh/openbsd-compat/sys-tree.h

355

RB_LEFT(tmp, field) = (elm); \

lib/libssh/openbsd-compat/sys-tree.h

356

RB_PARENT(elm, field) = (tmp); \

lib/libssh/openbsd-compat/sys-tree.h

362

#define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \

lib/libssh/openbsd-compat/sys-tree.h

363

(tmp) = RB_LEFT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

364

if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field))) { \

lib/libssh/openbsd-compat/sys-tree.h

365

RB_PARENT(RB_RIGHT(tmp, field), field) = (elm); \

lib/libssh/openbsd-compat/sys-tree.h

367

RB_AUGMENT(elm); \

lib/libssh/openbsd-compat/sys-tree.h

368

if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field))) { \

lib/libssh/openbsd-compat/sys-tree.h

369

if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \

lib/libssh/openbsd-compat/sys-tree.h

370

RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \

lib/libssh/openbsd-compat/sys-tree.h

372

RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \

lib/libssh/openbsd-compat/sys-tree.h

375

RB_RIGHT(tmp, field) = (elm); \

lib/libssh/openbsd-compat/sys-tree.h

376

RB_PARENT(elm, field) = (tmp); \

lib/libssh/openbsd-compat/sys-tree.h

408

name##_RB_INSERT_COLOR(struct name *head, struct type *elm) \

lib/libssh/openbsd-compat/sys-tree.h

411

while ((parent = RB_PARENT(elm, field)) && \

lib/libssh/openbsd-compat/sys-tree.h

419

elm = gparent; \

lib/libssh/openbsd-compat/sys-tree.h

422

if (RB_RIGHT(parent, field) == elm) { \

lib/libssh/openbsd-compat/sys-tree.h

425

parent = elm; \

lib/libssh/openbsd-compat/sys-tree.h

426

elm = tmp; \

lib/libssh/openbsd-compat/sys-tree.h

435

elm = gparent; \

lib/libssh/openbsd-compat/sys-tree.h

438

if (RB_LEFT(parent, field) == elm) { \

lib/libssh/openbsd-compat/sys-tree.h

441

parent = elm; \

lib/libssh/openbsd-compat/sys-tree.h

442

elm = tmp; \

lib/libssh/openbsd-compat/sys-tree.h

452

name##_RB_REMOVE_COLOR(struct name *head, struct type *parent, struct type *elm) \

lib/libssh/openbsd-compat/sys-tree.h

455

while ((elm == NULL || RB_COLOR(elm, field) == RB_BLACK) && \

lib/libssh/openbsd-compat/sys-tree.h

456

elm != RB_ROOT(head)) { \

lib/libssh/openbsd-compat/sys-tree.h

457

if (RB_LEFT(parent, field) == elm) { \

lib/libssh/openbsd-compat/sys-tree.h

469

elm = parent; \

lib/libssh/openbsd-compat/sys-tree.h

470

parent = RB_PARENT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

486

elm = RB_ROOT(head); \

lib/libssh/openbsd-compat/sys-tree.h

501

elm = parent; \

lib/libssh/openbsd-compat/sys-tree.h

502

parent = RB_PARENT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

518

elm = RB_ROOT(head); \

lib/libssh/openbsd-compat/sys-tree.h

523

if (elm) \

lib/libssh/openbsd-compat/sys-tree.h

524

RB_COLOR(elm, field) = RB_BLACK; \

lib/libssh/openbsd-compat/sys-tree.h

528

name##_RB_REMOVE(struct name *head, struct type *elm) \

lib/libssh/openbsd-compat/sys-tree.h

530

struct type *child, *parent, *old = elm; \

lib/libssh/openbsd-compat/sys-tree.h

532

if (RB_LEFT(elm, field) == NULL) \

lib/libssh/openbsd-compat/sys-tree.h

533

child = RB_RIGHT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

534

else if (RB_RIGHT(elm, field) == NULL) \

lib/libssh/openbsd-compat/sys-tree.h

535

child = RB_LEFT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

538

elm = RB_RIGHT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

539

while ((left = RB_LEFT(elm, field))) \

lib/libssh/openbsd-compat/sys-tree.h

540

elm = left; \

lib/libssh/openbsd-compat/sys-tree.h

541

child = RB_RIGHT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

542

parent = RB_PARENT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

543

color = RB_COLOR(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

547

if (RB_LEFT(parent, field) == elm) \

lib/libssh/openbsd-compat/sys-tree.h

554

if (RB_PARENT(elm, field) == old) \

lib/libssh/openbsd-compat/sys-tree.h

555

parent = elm; \

lib/libssh/openbsd-compat/sys-tree.h

556

(elm)->field = (old)->field; \

lib/libssh/openbsd-compat/sys-tree.h

559

RB_LEFT(RB_PARENT(old, field), field) = elm;\

lib/libssh/openbsd-compat/sys-tree.h

561

RB_RIGHT(RB_PARENT(old, field), field) = elm;\

lib/libssh/openbsd-compat/sys-tree.h

564

RB_ROOT(head) = elm; \

lib/libssh/openbsd-compat/sys-tree.h

565

RB_PARENT(RB_LEFT(old, field), field) = elm; \

lib/libssh/openbsd-compat/sys-tree.h

567

RB_PARENT(RB_RIGHT(old, field), field) = elm; \

lib/libssh/openbsd-compat/sys-tree.h

576

parent = RB_PARENT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

577

color = RB_COLOR(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

581

if (RB_LEFT(parent, field) == elm) \

lib/libssh/openbsd-compat/sys-tree.h

596

name##_RB_INSERT(struct name *head, struct type *elm) \

lib/libssh/openbsd-compat/sys-tree.h

604

comp = (cmp)(elm, parent); \

lib/libssh/openbsd-compat/sys-tree.h

612

RB_SET(elm, parent, field); \

lib/libssh/openbsd-compat/sys-tree.h

615

RB_LEFT(parent, field) = elm; \

lib/libssh/openbsd-compat/sys-tree.h

617

RB_RIGHT(parent, field) = elm; \

lib/libssh/openbsd-compat/sys-tree.h

620

RB_ROOT(head) = elm; \

lib/libssh/openbsd-compat/sys-tree.h

621

name##_RB_INSERT_COLOR(head, elm); \

lib/libssh/openbsd-compat/sys-tree.h

627

name##_RB_FIND(struct name *head, struct type *elm) \

lib/libssh/openbsd-compat/sys-tree.h

632

comp = cmp(elm, tmp); \

lib/libssh/openbsd-compat/sys-tree.h

645

name##_RB_NFIND(struct name *head, struct type *elm) \

lib/libssh/openbsd-compat/sys-tree.h

651

comp = cmp(elm, tmp); \

lib/libssh/openbsd-compat/sys-tree.h

666

name##_RB_NEXT(struct type *elm) \

lib/libssh/openbsd-compat/sys-tree.h

668

if (RB_RIGHT(elm, field)) { \

lib/libssh/openbsd-compat/sys-tree.h

669

elm = RB_RIGHT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

670

while (RB_LEFT(elm, field)) \

lib/libssh/openbsd-compat/sys-tree.h

671

elm = RB_LEFT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

673

if (RB_PARENT(elm, field) && \

lib/libssh/openbsd-compat/sys-tree.h

674

(elm == RB_LEFT(RB_PARENT(elm, field), field))) \

lib/libssh/openbsd-compat/sys-tree.h

675

elm = RB_PARENT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

677

while (RB_PARENT(elm, field) && \

lib/libssh/openbsd-compat/sys-tree.h

678

(elm == RB_RIGHT(RB_PARENT(elm, field), field)))\

lib/libssh/openbsd-compat/sys-tree.h

679

elm = RB_PARENT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

680

elm = RB_PARENT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

683

return (elm); \

lib/libssh/openbsd-compat/sys-tree.h

688

name##_RB_PREV(struct type *elm) \

lib/libssh/openbsd-compat/sys-tree.h

690

if (RB_LEFT(elm, field)) { \

lib/libssh/openbsd-compat/sys-tree.h

691

elm = RB_LEFT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

692

while (RB_RIGHT(elm, field)) \

lib/libssh/openbsd-compat/sys-tree.h

693

elm = RB_RIGHT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

695

if (RB_PARENT(elm, field) && \

lib/libssh/openbsd-compat/sys-tree.h

696

(elm == RB_RIGHT(RB_PARENT(elm, field), field))) \

lib/libssh/openbsd-compat/sys-tree.h

697

elm = RB_PARENT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

699

while (RB_PARENT(elm, field) && \

lib/libssh/openbsd-compat/sys-tree.h

700

(elm == RB_LEFT(RB_PARENT(elm, field), field)))\

lib/libssh/openbsd-compat/sys-tree.h

701

elm = RB_PARENT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

702

elm = RB_PARENT(elm, field); \

lib/libssh/openbsd-compat/sys-tree.h

705

return (elm); \

lib/libssh/openbsd-compat/sys-tree.h

82

#define SPLAY_LEFT(elm, field) (elm)->field.spe_left

lib/libssh/openbsd-compat/sys-tree.h

83

#define SPLAY_RIGHT(elm, field) (elm)->field.spe_right

libexec/rtld-elf/map_object.c

396

Objlist_Entry *elm;

libexec/rtld-elf/map_object.c

411

elm = STAILQ_FIRST(&obj->dldags);

libexec/rtld-elf/map_object.c

413

free(elm);

libexec/rtld-elf/map_object.c

416

elm = STAILQ_FIRST(&obj->dagmembers);

libexec/rtld-elf/map_object.c

418

free(elm);

libexec/rtld-elf/rtld.c

1828

const Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

1845

STAILQ_FOREACH(elm, &root->dagmembers, link) {

libexec/rtld-elf/rtld.c

1846

for (needed = elm->obj->needed; needed != NULL; needed = needed->next) {

libexec/rtld-elf/rtld.c

1859

const Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

1866

STAILQ_FOREACH(elm, &root->dagmembers, link) {

libexec/rtld-elf/rtld.c

1867

if (elm->obj != NULL && elm->obj->z_nodelete &&

libexec/rtld-elf/rtld.c

1868

!elm->obj->ref_nodel) {

libexec/rtld-elf/rtld.c

1869

dbg("obj %s nodelete", elm->obj->path);

libexec/rtld-elf/rtld.c

1870

init_dag(elm->obj);

libexec/rtld-elf/rtld.c

1871

ref_dag(elm->obj);

libexec/rtld-elf/rtld.c

1872

elm->obj->ref_nodel = true;

libexec/rtld-elf/rtld.c

2337

Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

2350

STAILQ_FOREACH(elm, list, link) {

libexec/rtld-elf/rtld.c

2351

if (root != NULL && (elm->obj->refcount != 1 ||

libexec/rtld-elf/rtld.c

2352

objlist_find(&root->dagmembers, elm->obj) == NULL))

libexec/rtld-elf/rtld.c

2356

STAILQ_REMOVE(list, elm, Struct_Objlist_Entry, link);

libexec/rtld-elf/rtld.c

2373

fini_addr = (Elf_Addr *)elm->obj->fini_array;

libexec/rtld-elf/rtld.c

2374

if (fini_addr != NULL && elm->obj->fini_array_num > 0) {

libexec/rtld-elf/rtld.c

2375

for (index = elm->obj->fini_array_num - 1; index >= 0; index--) {

libexec/rtld-elf/rtld.c

2378

elm->obj->path, (void *)fini_addr[index]);

libexec/rtld-elf/rtld.c

2379

LD_UTRACE(UTRACE_FINI_CALL, elm->obj,

libexec/rtld-elf/rtld.c

2380

(void *)fini_addr[index], 0, 0, elm->obj->path);

libexec/rtld-elf/rtld.c

2381

call_initfini_pointer(elm->obj, fini_addr[index]);

libexec/rtld-elf/rtld.c

2385

if (elm->obj->fini != (Elf_Addr)NULL) {

libexec/rtld-elf/rtld.c

2386

dbg("calling fini function for %s at %p", elm->obj->path,

libexec/rtld-elf/rtld.c

2387

(void *)elm->obj->fini);

libexec/rtld-elf/rtld.c

2388

LD_UTRACE(UTRACE_FINI_CALL, elm->obj, (void *)elm->obj->fini,

libexec/rtld-elf/rtld.c

2389

0, 0, elm->obj->path);

libexec/rtld-elf/rtld.c

2390

call_initfini_pointer(elm->obj, elm->obj->fini);

libexec/rtld-elf/rtld.c

2395

free(elm);

libexec/rtld-elf/rtld.c

2403

} while (elm != NULL);

libexec/rtld-elf/rtld.c

2415

Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

2434

STAILQ_FOREACH(elm, list, link) {

libexec/rtld-elf/rtld.c

2435

if (elm->obj->init_done) /* Initialized early. */

libexec/rtld-elf/rtld.c

2443

elm->obj->init_done = true;

libexec/rtld-elf/rtld.c

2452

if (elm->obj->init != (Elf_Addr)NULL) {

libexec/rtld-elf/rtld.c

2453

dbg("calling init function for %s at %p", elm->obj->path,

libexec/rtld-elf/rtld.c

2454

(void *)elm->obj->init);

libexec/rtld-elf/rtld.c

2455

LD_UTRACE(UTRACE_INIT_CALL, elm->obj, (void *)elm->obj->init,

libexec/rtld-elf/rtld.c

2456

0, 0, elm->obj->path);

libexec/rtld-elf/rtld.c

2457

call_initfini_pointer(elm->obj, elm->obj->init);

libexec/rtld-elf/rtld.c

2459

init_addr = (Elf_Addr *)elm->obj->init_array;

libexec/rtld-elf/rtld.c

2461

for (index = 0; index < elm->obj->init_array_num; index++) {

libexec/rtld-elf/rtld.c

2463

dbg("calling init array function for %s at %p", elm->obj->path,

libexec/rtld-elf/rtld.c

2465

LD_UTRACE(UTRACE_INIT_CALL, elm->obj,

libexec/rtld-elf/rtld.c

2466

(void *)init_addr[index], 0, 0, elm->obj->path);

libexec/rtld-elf/rtld.c

2467

call_init_pointer(elm->obj, init_addr[index]);

libexec/rtld-elf/rtld.c

2479

Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

2482

elm = STAILQ_FIRST(list);

libexec/rtld-elf/rtld.c

2484

free(elm);

libexec/rtld-elf/rtld.c

2491

Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

2493

STAILQ_FOREACH(elm, list, link)

libexec/rtld-elf/rtld.c

2494

if (elm->obj == obj)

libexec/rtld-elf/rtld.c

2495

return elm;

libexec/rtld-elf/rtld.c

2508

Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

2510

elm = NEW(Objlist_Entry);

libexec/rtld-elf/rtld.c

2511

elm->obj = obj;

libexec/rtld-elf/rtld.c

2512

STAILQ_INSERT_HEAD(list, elm, link);

libexec/rtld-elf/rtld.c

2518

Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

2520

elm = NEW(Objlist_Entry);

libexec/rtld-elf/rtld.c

2521

elm->obj = obj;

libexec/rtld-elf/rtld.c

2522

STAILQ_INSERT_TAIL(list, elm, link);

libexec/rtld-elf/rtld.c

2528

Objlist_Entry *elm, *listelm;

libexec/rtld-elf/rtld.c

2534

elm = NEW(Objlist_Entry);

libexec/rtld-elf/rtld.c

2535

elm->obj = obj;

libexec/rtld-elf/rtld.c

2537

STAILQ_INSERT_AFTER(list, listelm, elm, link);

libexec/rtld-elf/rtld.c

2539

STAILQ_INSERT_TAIL(list, elm, link);

libexec/rtld-elf/rtld.c

2545

Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

2547

if ((elm = objlist_find(list, obj)) != NULL) {

libexec/rtld-elf/rtld.c

2548

STAILQ_REMOVE(list, elm, Struct_Objlist_Entry, link);

libexec/rtld-elf/rtld.c

2549

free(elm);

libexec/rtld-elf/rtld.c

2562

Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

2566

STAILQ_FOREACH(elm, &root->dagmembers, link) {

libexec/rtld-elf/rtld.c

2567

error = relocate_object(elm->obj, bind_now, rtldobj, flags,

libexec/rtld-elf/rtld.c

2767

Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

2769

STAILQ_FOREACH(elm, list, link) {

libexec/rtld-elf/rtld.c

2770

if (resolve_object_ifunc(elm->obj, bind_now, flags,

libexec/rtld-elf/rtld.c

3803

const Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

3821

STAILQ_FOREACH(elm, &list_global, link) {

libexec/rtld-elf/rtld.c

3825

res = symlook_list(&req1, &elm->obj->dagmembers, donelist);

libexec/rtld-elf/rtld.c

3877

const Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

3897

STAILQ_FOREACH(elm, &refobj->dldags, link) {

libexec/rtld-elf/rtld.c

3901

res = symlook_list(&req1, &elm->obj->dagmembers, &donelist);

libexec/rtld-elf/rtld.c

3933

const Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

3939

STAILQ_FOREACH(elm, objlist, link) {

libexec/rtld-elf/rtld.c

3940

if (donelist_check(dlp, elm->obj))

libexec/rtld-elf/rtld.c

3943

if ((res = symlook_obj(&req1, elm->obj)) == 0) {

libexec/rtld-elf/rtld.c

4375

Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

4382

STAILQ_FOREACH(elm, &root->dagmembers, link) {

libexec/rtld-elf/rtld.c

4383

objlist_remove(&elm->obj->dldags, root);

libexec/rtld-elf/rtld.c

4384

if (elm->obj != root)

libexec/rtld-elf/rtld.c

4385

unlink_object(elm->obj);

libexec/rtld-elf/rtld.c

4393

Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

4396

STAILQ_FOREACH(elm, &root->dagmembers, link)

libexec/rtld-elf/rtld.c

4397

elm->obj->refcount++;

libexec/rtld-elf/rtld.c

4403

Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

4406

STAILQ_FOREACH(elm, &root->dagmembers, link)

libexec/rtld-elf/rtld.c

4407

elm->obj->refcount--;

libexec/rtld-elf/rtld.c

4943

Objlist_Entry *elm;

libexec/rtld-elf/rtld.c

4961

STAILQ_FOREACH(elm, list, link) {

libexec/rtld-elf/rtld.c

4962

obj = elm->obj;

sbin/hammer/cmd_blockmap.c

280

hammer_btree_elm_t elm;

sbin/hammer/cmd_blockmap.c

315

elm = &node->elms[i];

sbin/hammer/cmd_blockmap.c

319

if (elm->internal.subtree_offset) {

sbin/hammer/cmd_blockmap.c

320

collect_btree_internal(elm);

sbin/hammer/cmd_blockmap.c

321

check_btree_node(elm->internal.subtree_offset,

sbin/hammer/cmd_blockmap.c

326

if (elm->leaf.data_offset)

sbin/hammer/cmd_blockmap.c

327

collect_btree_leaf(elm);

sbin/hammer/cmd_blockmap.c

411

collect_btree_internal(hammer_btree_elm_t elm)

sbin/hammer/cmd_blockmap.c

413

collect_blockmap(elm->internal.subtree_offset,

sbin/hammer/cmd_blockmap.c

420

collect_btree_leaf(hammer_btree_elm_t elm)

sbin/hammer/cmd_blockmap.c

424

switch (elm->base.rec_type) {

sbin/hammer/cmd_blockmap.c

436

zone = hammer_data_zone_index(elm->leaf.data_len);

sbin/hammer/cmd_blockmap.c

442

collect_blockmap(elm->leaf.data_offset,

sbin/hammer/cmd_blockmap.c

443

HAMMER_DATA_DOALIGN(elm->leaf.data_len), zone);

sbin/hammer/cmd_blockmap.c

73

static __inline void collect_btree_internal(hammer_btree_elm_t elm);

sbin/hammer/cmd_blockmap.c

74

static __inline void collect_btree_leaf(hammer_btree_elm_t elm);

sbin/hammer/cmd_dedup.c

821

data.elm = leaf->base;

sbin/hammer/cmd_dedup.c

870

struct hammer_btree_leaf_elm elm;

sbin/hammer/cmd_dedup.c

951

elm = mrec->rec.leaf;

sbin/hammer/cmd_dedup.c

952

if (elm.base.btype != HAMMER_BTREE_TYPE_RECORD)

sbin/hammer/cmd_dedup.c

954

if (elm.base.rec_type != HAMMER_RECTYPE_DATA)

sbin/hammer/cmd_dedup.c

958

if (elm.data_crc < DedupCrcStart)

sbin/hammer/cmd_dedup.c

961

elm.data_crc >= DedupCrcEnd) {

sbin/hammer/cmd_dedup.c

965

func(&elm, 0);

sbin/hammer/cmd_recover.c

286

hammer_btree_elm_t elm;

sbin/hammer/cmd_recover.c

305

elm = &node->elms[i];

sbin/hammer/cmd_recover.c

306

if (elm->base.btype == HAMMER_BTREE_TYPE_RECORD)

sbin/hammer/cmd_recover.c

307

recover_elm(&elm->leaf);

sbin/hammer/cmd_show.c

1008

test_btree_match(hammer_btree_elm_t elm)

sbin/hammer/cmd_show.c

1010

if (test_btree_search(elm) == 0)

sbin/hammer/cmd_show.c

1017

test_btree_out_of_range(hammer_btree_elm_t elm)

sbin/hammer/cmd_show.c

1019

if (test_btree_search(elm) > 0)

sbin/hammer/cmd_show.c

1023

if (test_btree_search(elm + 1) <= 0)

sbin/hammer/cmd_show.c

1026

if (test_btree_search(elm + 1) < 0)

sbin/hammer/cmd_show.c

159

print_subtree(hammer_btree_elm_t elm)

sbin/hammer/cmd_show.c

161

hammer_btree_internal_elm_t i = &elm->internal;

sbin/hammer/cmd_show.c

162

print_btree_node(i->subtree_offset, i->mirror_tid, elm);

sbin/hammer/cmd_show.c

172

hammer_btree_elm_t elm;

sbin/hammer/cmd_show.c

216

elm = &node->elms[i];

sbin/hammer/cmd_show.c

221

if (!test_btree_out_of_range(elm))

sbin/hammer/cmd_show.c

225

if (test_btree_match(elm))

sbin/hammer/cmd_show.c

230

print_btree_elm(node, node_offset, elm, lbe, ext);

sbin/hammer/cmd_show.c

234

elm = &node->elms[i];

sbin/hammer/cmd_show.c

235

print_btree_elm(node, node_offset, elm, lbe, NULL);

sbin/hammer/cmd_show.c

241

elm = &node->elms[i];

sbin/hammer/cmd_show.c

243

if (test_btree_out_of_range(elm))

sbin/hammer/cmd_show.c

246

if (elm->internal.subtree_offset) {

sbin/hammer/cmd_show.c

247

print_subtree(elm);

sbin/hammer/cmd_show.c

293

is_root_btree_beg(uint8_t type, int i, hammer_btree_elm_t elm)

sbin/hammer/cmd_show.c

301

elm->base.localization == HAMMER_MIN_ONDISK_LOCALIZATION &&

sbin/hammer/cmd_show.c

302

elm->base.obj_id == (int64_t)HAMMER_MIN_OBJID &&

sbin/hammer/cmd_show.c

303

elm->base.key == (int64_t)HAMMER_MIN_KEY &&

sbin/hammer/cmd_show.c

304

elm->base.create_tid == 1 &&

sbin/hammer/cmd_show.c

305

elm->base.delete_tid == 1 &&

sbin/hammer/cmd_show.c

306

elm->base.rec_type == HAMMER_MIN_RECTYPE &&

sbin/hammer/cmd_show.c

307

elm->base.obj_type == 0 &&

sbin/hammer/cmd_show.c

308

elm->base.btype != HAMMER_BTREE_TYPE_NONE);

sbin/hammer/cmd_show.c

313

is_root_btree_end(uint8_t type, int i, hammer_btree_elm_t elm)

sbin/hammer/cmd_show.c

317

elm->base.localization == HAMMER_MAX_ONDISK_LOCALIZATION &&

sbin/hammer/cmd_show.c

318

elm->base.obj_id == HAMMER_MAX_OBJID &&

sbin/hammer/cmd_show.c

319

elm->base.key == HAMMER_MAX_KEY &&

sbin/hammer/cmd_show.c

320

elm->base.create_tid == HAMMER_MAX_TID &&

sbin/hammer/cmd_show.c

321

elm->base.delete_tid == 0 &&

sbin/hammer/cmd_show.c

322

elm->base.rec_type == HAMMER_MAX_RECTYPE &&

sbin/hammer/cmd_show.c

323

elm->base.obj_type == 0 &&

sbin/hammer/cmd_show.c

324

elm->base.btype == HAMMER_BTREE_TYPE_NONE);

sbin/hammer/cmd_show.c

330

hammer_btree_elm_t elm, hammer_btree_elm_t lbe, const char *ext)

sbin/hammer/cmd_show.c

339

int i = ((char*)elm - (char*)node) / (int)sizeof(*elm) - 1;

sbin/hammer/cmd_show.c

341

flags = get_elm_flags(node, node_offset, elm, lbe);

sbin/hammer/cmd_show.c

359

if (is_root_btree_beg(node->type, i, elm))

sbin/hammer/cmd_show.c

361

else if (is_root_btree_end(node->type, i, elm))

sbin/hammer/cmd_show.c

366

if (elm->base.delete_tid)

sbin/hammer/cmd_show.c

377

INDENT, flagstr, label, i, hammer_elm_btype(elm));

sbin/hammer/cmd_show.c

379

elm->base.localization,

sbin/hammer/cmd_show.c

380

(uintmax_t)elm->base.obj_id,

sbin/hammer/cmd_show.c

381

elm->base.rec_type,

sbin/hammer/cmd_show.c

382

(uintmax_t)elm->base.key,

sbin/hammer/cmd_show.c

383

(uintmax_t)elm->base.create_tid);

sbin/hammer/cmd_show.c

387

(uintmax_t)elm->base.delete_tid,

sbin/hammer/cmd_show.c

388

elm->base.obj_type);

sbin/hammer/cmd_show.c

393

(uintmax_t)elm->internal.subtree_offset,

sbin/hammer/cmd_show.c

394

(uintmax_t)elm->internal.mirror_tid);

sbin/hammer/cmd_show.c

399

switch(elm->base.btype) {

sbin/hammer/cmd_show.c

402

(uintmax_t)elm->leaf.data_offset,

sbin/hammer/cmd_show.c

403

elm->leaf.data_len);

sbin/hammer/cmd_show.c

404

p = check_data_crc(elm, &which);

sbin/hammer/cmd_show.c

405

printf(" %scrc=%08x", which, elm->leaf.data_crc);

sbin/hammer/cmd_show.c

411

print_bigblock_fill(elm->leaf.data_offset);

sbin/hammer/cmd_show.c

413

print_record(elm);

sbin/hammer/cmd_show.c

416

elm->leaf.data_offset,

sbin/hammer/cmd_show.c

417

elm->leaf.data_len);

sbin/hammer/cmd_show.c

421

printf(" badtype=%d", elm->base.btype);

sbin/hammer/cmd_show.c

434

hammer_btree_elm_t elm, hammer_btree_elm_t lbe)

sbin/hammer/cmd_show.c

438

int i = ((char*)elm - (char*)node) / (int)sizeof(*elm) - 1;

sbin/hammer/cmd_show.c

442

child_offset = elm->internal.subtree_offset;

sbin/hammer/cmd_show.c

443

if (elm->internal.mirror_tid > node->mirror_tid)

sbin/hammer/cmd_show.c

449

switch(elm->base.btype) {

sbin/hammer/cmd_show.c

451

flags |= test_rbn_lr(elm, lbe);

sbin/hammer/cmd_show.c

470

switch(elm->base.btype) {

sbin/hammer/cmd_show.c

473

flags |= test_lr(elm, lbe);

sbin/hammer/cmd_show.c

482

if (elm->leaf.data_offset == 0)

sbin/hammer/cmd_show.c

484

if (elm->leaf.data_len == 0)

sbin/hammer/cmd_show.c

491

if (elm->base.create_tid && node->mirror_tid &&

sbin/hammer/cmd_show.c

492

elm->base.create_tid > node->mirror_tid) {

sbin/hammer/cmd_show.c

495

if (elm->base.delete_tid && node->mirror_tid &&

sbin/hammer/cmd_show.c

496

elm->base.delete_tid > node->mirror_tid) {

sbin/hammer/cmd_show.c

499

switch(elm->base.btype) {

sbin/hammer/cmd_show.c

501

flags |= test_lr(elm, lbe);

sbin/hammer/cmd_show.c

558

test_lr(hammer_btree_elm_t elm, hammer_btree_elm_t lbe)

sbin/hammer/cmd_show.c

56

static __inline void print_subtree(hammer_btree_elm_t elm);

sbin/hammer/cmd_show.c

562

if (hammer_btree_cmp(&elm->base, &lbe->base) < 0)

sbin/hammer/cmd_show.c

564

if (hammer_btree_cmp(&elm->base, &rbe->base) >= 0)

sbin/hammer/cmd_show.c

61

hammer_btree_elm_t elm, hammer_btree_elm_t lbe, const char *ext);

sbin/hammer/cmd_show.c

617

check_data_crc(hammer_btree_elm_t elm, const char **whichp)

sbin/hammer/cmd_show.c

622

if (elm->leaf.data_offset == 0 || elm->leaf.data_len == 0)

sbin/hammer/cmd_show.c

625

switch (elm->leaf.base.rec_type) {

sbin/hammer/cmd_show.c

627

if (elm->leaf.data_len != sizeof(struct hammer_inode_data))

sbin/hammer/cmd_show.c

629

crc = get_inode_crc(&elm->leaf, whichp);

sbin/hammer/cmd_show.c

63

hammer_btree_elm_t elm, hammer_btree_elm_t lbe);

sbin/hammer/cmd_show.c

632

crc = get_buf_crc(&elm->leaf, whichp);

sbin/hammer/cmd_show.c

638

if (crc != elm->leaf.data_crc)

sbin/hammer/cmd_show.c

64

static int test_lr(hammer_btree_elm_t elm, hammer_btree_elm_t lbe);

sbin/hammer/cmd_show.c

65

static int test_rbn_lr(hammer_btree_elm_t elm, hammer_btree_elm_t lbe);

sbin/hammer/cmd_show.c

67

static const char *check_data_crc(hammer_btree_elm_t elm, const char **whichp);

sbin/hammer/cmd_show.c

72

static void print_record(hammer_btree_elm_t elm);

sbin/hammer/cmd_show.c

74

static int test_btree_search(hammer_btree_elm_t elm);

sbin/hammer/cmd_show.c

749

print_record(hammer_btree_elm_t elm)

sbin/hammer/cmd_show.c

75

static __inline int test_btree_match(hammer_btree_elm_t elm);

sbin/hammer/cmd_show.c

758

data_offset = elm->leaf.data_offset;

sbin/hammer/cmd_show.c

759

data_len = elm->leaf.data_len;

sbin/hammer/cmd_show.c

76

static int test_btree_out_of_range(hammer_btree_elm_t elm);

sbin/hammer/cmd_show.c

767

switch(elm->leaf.base.rec_type) {

sbin/hammer/cmd_show.c

806

switch(elm->leaf.base.key) {

sbin/hammer/cmd_show.c

958

test_btree_search(hammer_btree_elm_t elm)

sbin/hammer/cmd_show.c

960

hammer_base_elm_t base1 = &elm->base;

sbin/hammer/cmd_softprune.c

481

struct hammer_ioc_prune_elm *elm;

sbin/hammer/cmd_softprune.c

486

sizeof(*elm) * scan->maxelms);

sbin/hammer/cmd_softprune.c

493

elm = &scan->prune.elms[scan->prune.nelms];

sbin/hammer/cmd_softprune.c

494

elm->beg_tid = tid;

sbin/hammer/cmd_softprune.c

495

elm->end_tid = 0;

sbin/hammer/cmd_softprune.c

496

elm->mod_tid = 0;

sbin/hammer/cmd_softprune.c

498

elm->mod_tid = ct;

sbin/hammer/cmd_softprune.c

500

elm->mod_tid = mt;

sbin/hammer/cmd_softprune.c

529

struct hammer_ioc_prune_elm *elm;

sbin/hammer/cmd_softprune.c

544

qsort(scan->prune.elms, scan->prune.nelms, sizeof(*elm),

sbin/hammer/cmd_softprune.c

548

elm = &scan->prune.elms[i];

sbin/hammer/cmd_softprune.c

553

elm->end_tid = HAMMER_MAX_TID;

sbin/hammer/cmd_softprune.c

554

} else if (elm[0].beg_tid == elm[-1].beg_tid) {

sbin/hammer/cmd_softprune.c

560

bcopy(elm + 1, elm,

sbin/hammer/cmd_softprune.c

561

(scan->prune.nelms - i) * sizeof(*elm));

sbin/hammer/cmd_softprune.c

569

elm->end_tid = elm[-1].beg_tid;

sbin/hammer/cmd_softprune.c

581

elm = &scan->prune.elms[i];

sbin/hammer/cmd_softprune.c

582

if (elm->mod_tid == 0)

sbin/hammer/cmd_softprune.c

584

delta = (long)(t - (time_t)elm->mod_tid);

sbin/hammer/cmd_softprune.c

617

elm = &scan->prune.elms[scan->prune.nelms];

sbin/hammer/cmd_softprune.c

618

elm->beg_tid = 1;

sbin/hammer/cmd_softprune.c

619

elm->end_tid = elm[-1].beg_tid;

sbin/hammer/cmd_softprune.c

627

elm = &scan->prune.elms[i];

sbin/hammer/cmd_softprune.c

628

elm->mod_tid = elm->end_tid - elm->beg_tid;

sbin/hammer/cmd_softprune.c

630

(uintmax_t)elm->beg_tid, (uintmax_t)elm->end_tid);

sbin/hammer/hammer.c

242

char *elm, *dup;

sbin/hammer/hammer.c

245

while ((elm = strsep(&ptr, ",")) != NULL) {

sbin/hammer/hammer.c

246

if (strcmp(av[0], elm) == 0)

sbin/hammer/hammer.c

249

if (elm == NULL) {

sbin/newfs_hammer/newfs_hammer.c

680

hammer_btree_elm_t elm;

sbin/newfs_hammer/newfs_hammer.c

731

elm = &bnode->elms[0];

sbin/newfs_hammer/newfs_hammer.c

732

elm->leaf.base.btype = HAMMER_BTREE_TYPE_RECORD;

sbin/newfs_hammer/newfs_hammer.c

733

elm->leaf.base.localization = HAMMER_DEF_LOCALIZATION |

sbin/newfs_hammer/newfs_hammer.c

735

elm->leaf.base.obj_id = HAMMER_OBJID_ROOT;

sbin/newfs_hammer/newfs_hammer.c

736

elm->leaf.base.key = 0;

sbin/newfs_hammer/newfs_hammer.c

737

elm->leaf.base.create_tid = create_tid;

sbin/newfs_hammer/newfs_hammer.c

738

elm->leaf.base.delete_tid = 0;

sbin/newfs_hammer/newfs_hammer.c

739

elm->leaf.base.rec_type = HAMMER_RECTYPE_INODE;

sbin/newfs_hammer/newfs_hammer.c

740

elm->leaf.base.obj_type = HAMMER_OBJTYPE_DIRECTORY;

sbin/newfs_hammer/newfs_hammer.c

741

elm->leaf.create_ts = (uint32_t)time(NULL);

sbin/newfs_hammer/newfs_hammer.c

743

elm->leaf.data_offset = idata_off;

sbin/newfs_hammer/newfs_hammer.c

744

elm->leaf.data_len = sizeof(*idata);

sbin/newfs_hammer/newfs_hammer.c

745

hammer_crc_set_leaf(HammerVersion, idata, &elm->leaf);

sbin/newfs_hammer/newfs_hammer.c

752

elm = &bnode->elms[1];

sbin/newfs_hammer/newfs_hammer.c

753

elm->leaf.base.btype = HAMMER_BTREE_TYPE_RECORD;

sbin/newfs_hammer/newfs_hammer.c

754

elm->leaf.base.localization = HAMMER_DEF_LOCALIZATION |

sbin/newfs_hammer/newfs_hammer.c

756

elm->leaf.base.obj_id = HAMMER_OBJID_ROOT;

sbin/newfs_hammer/newfs_hammer.c

757

elm->leaf.base.key = 0;

sbin/newfs_hammer/newfs_hammer.c

758

elm->leaf.base.create_tid = create_tid;

sbin/newfs_hammer/newfs_hammer.c

759

elm->leaf.base.delete_tid = 0;

sbin/newfs_hammer/newfs_hammer.c

760

elm->leaf.base.rec_type = HAMMER_RECTYPE_PFS;

sbin/newfs_hammer/newfs_hammer.c

761

elm->leaf.base.obj_type = HAMMER_OBJTYPE_DIRECTORY;

sbin/newfs_hammer/newfs_hammer.c

762

elm->leaf.create_ts = (uint32_t)time(NULL);

sbin/newfs_hammer/newfs_hammer.c

764

elm->leaf.data_offset = pfsd_off;

sbin/newfs_hammer/newfs_hammer.c

765

elm->leaf.data_len = sizeof(*pfsd);

sbin/newfs_hammer/newfs_hammer.c

766

hammer_crc_set_leaf(HammerVersion, pfsd, &elm->leaf);

stand/lib/hammer1.c

270

hammer_btree_search_node(hammer_base_elm_t elm, hammer_node_ondisk_t node)

stand/lib/hammer1.c

284

r = hammer_btree_cmp(elm, &node->elms[i].leaf.base);

sys/bus/cam/scsi/scsi_ses.c

1408

ses_decode(char *b, int amt, uint8_t *ep, int elt, int elm, SesComStat *sp)

sys/bus/cam/scsi/scsi_ses.c

1430

if (elm >= ep[elt])

sys/bus/cam/scsi/scsi_ses.c

1449

idx += (4 * elm);

sys/bus/cam/scsi/scsi_ses.c

1465

PRINTF("Get Elt 0x%x Elm 0x%x (idx %d)\n", elt, elm, idx-4);

sys/bus/cam/scsi/scsi_ses.c

1478

ses_encode(char *b, int amt, uint8_t *ep, int elt, int elm, SesComStat *sp)

sys/bus/cam/scsi/scsi_ses.c

1502

if (elm >= ep[elt])

sys/bus/cam/scsi/scsi_ses.c

1521

idx += (4 * elm);

sys/bus/cam/scsi/scsi_ses.c

1540

elt, elm, idx, sp->comstatus, sp->comstat[0],

sys/dev/drm/amd/display/dc/dce/dce_transform.c

1102

const struct out_csc_color_matrix *elm;

sys/dev/drm/amd/display/dc/dce/dce_transform.c

1116

elm = &global_color_matrix[i];

sys/dev/drm/amd/display/dc/dce/dce_transform.c

1117

if (elm->color_space != default_adjust->out_color_space)

sys/dev/drm/amd/display/dc/dce/dce_transform.c

1121

program_color_matrix(xfm_dce, elm, option);

sys/dev/drm/amd/display/dc/dce110/dce110_opp_csc_v.c

680

const struct out_csc_color_matrix *elm;

sys/dev/drm/amd/display/dc/dce110/dce110_opp_csc_v.c

694

elm = &global_color_matrix[i];

sys/dev/drm/amd/display/dc/dce110/dce110_opp_csc_v.c

695

if (elm->color_space != default_adjust->out_color_space)

sys/dev/drm/amd/display/dc/dce110/dce110_opp_csc_v.c

700

program_color_matrix_v(xfm_dce, elm, option);

sys/dev/drm/linux_rcu.c

165

rcu_elm_t *elm;

sys/dev/drm/linux_rcu.c

175

elm = &rcu->elms[rcu->e & rcu->mask];

sys/dev/drm/linux_rcu.c

178

elm->type = RCU_FREE;

sys/dev/drm/linux_rcu.c

179

elm->ticks = ticks;

sys/dev/drm/linux_rcu.c

180

elm->ptr = ptr;

sys/dev/drm/linux_rcu.c

190

rcu_elm_t *elm;

sys/dev/drm/linux_rcu.c

200

elm = &rcu->elms[rcu->e & rcu->mask];

sys/dev/drm/linux_rcu.c

203

elm->type = RCU_CALL;

sys/dev/drm/linux_rcu.c

204

elm->ticks = ticks;

sys/dev/drm/linux_rcu.c

205

elm->func = func;

sys/dev/drm/linux_rcu.c

206

elm->ptr = head;

sys/dev/drm/linux_rcu.c

75

rcu_elm_t *elm;

sys/dev/drm/linux_rcu.c

80

elm = &rcu->elms[rcu->s & rcu->mask];

sys/dev/drm/linux_rcu.c

81

delta = ticks - elm->ticks; /* 2s compl underflow */

sys/dev/drm/linux_rcu.c

85

switch(elm->type) {

sys/dev/drm/linux_rcu.c

89

elm->func(elm->ptr);

sys/dev/drm/linux_rcu.c

92

kfree(elm->ptr);

sys/dev/drm/linux_rcu.c

95

elm->type = RCU_NULL;

sys/dev/raid/asr/asr.c

3154

} * elm;

sys/dev/raid/asr/asr.c

3343

if ((elm = (struct ioctlSgList_S *)kmalloc (

sys/dev/raid/asr/asr.c

3344

sizeof(*elm) - sizeof(elm->KernelSpace) + len,

sys/dev/raid/asr/asr.c

3351

SLIST_INSERT_HEAD(&sgList, elm, link);

sys/dev/raid/asr/asr.c

3352

elm->FlagsCount = sg->FlagsCount;

sys/dev/raid/asr/asr.c

3353

elm->UserSpace = (caddr_t)

sys/dev/raid/asr/asr.c

3355

v = elm->KernelSpace;

sys/dev/raid/asr/asr.c

3357

if ((error = copyin (elm->UserSpace, (caddr_t)v, len))

sys/dev/raid/asr/asr.c

3395

&(elm->FlagsCount));

sys/dev/raid/asr/asr.c

3460

while ((elm = SLIST_FIRST(&sgList)) != NULL) {

sys/dev/raid/asr/asr.c

3462

kfree(elm, M_TEMP);

sys/dev/raid/asr/asr.c

3476

while ((elm = SLIST_FIRST(&sgList)) != NULL) {

sys/dev/raid/asr/asr.c

3478

kfree(elm, M_TEMP);

sys/dev/raid/asr/asr.c

3512

while ((elm = SLIST_FIRST(&sgList)) != NULL) {

sys/dev/raid/asr/asr.c

3514

kfree(elm, M_TEMP);

sys/dev/raid/asr/asr.c

3560

while ((elm = SLIST_FIRST(&sgList)) != NULL) {

sys/dev/raid/asr/asr.c

3564

&& ((I2O_FLAGS_COUNT_getFlags(&(elm->FlagsCount))

sys/dev/raid/asr/asr.c

3566

error = copyout((caddr_t)(elm->KernelSpace),

sys/dev/raid/asr/asr.c

3567

elm->UserSpace,

sys/dev/raid/asr/asr.c

3568

I2O_FLAGS_COUNT_getCount(&(elm->FlagsCount)));

sys/dev/raid/asr/asr.c

3571

kfree(elm, M_TEMP);

sys/dev/raid/mfi/mfi.c

1551

struct mfi_evt_queue_elm *elm;

sys/dev/raid/mfi/mfi.c

1554

elm = kmalloc(sizeof(*elm), M_MFIBUF, M_NOWAIT | M_ZERO);

sys/dev/raid/mfi/mfi.c

1555

if (elm == NULL)

sys/dev/raid/mfi/mfi.c

1557

memcpy(&elm->detail, detail, sizeof(*detail));

sys/dev/raid/mfi/mfi.c

1558

TAILQ_INSERT_TAIL(&sc->mfi_evt_queue, elm, link);

sys/dev/raid/mfi/mfi.c

1567

struct mfi_evt_queue_elm *elm;

sys/dev/raid/mfi/mfi.c

1574

while ((elm = TAILQ_FIRST(&queue)) != NULL) {

sys/dev/raid/mfi/mfi.c

1575

TAILQ_REMOVE(&queue, elm, link);

sys/dev/raid/mfi/mfi.c

1576

mfi_decode_evt(sc, &elm->detail);

sys/dev/raid/mfi/mfi.c

1577

kfree(elm, M_MFIBUF);

sys/kern/kern_caps.c

229

__syscapelm_t elm;

sys/kern/kern_caps.c

243

elm = cred->cr_caps.caps[i];

sys/kern/kern_caps.c

244

elm = ((elm & __SYSCAP_EXECMASK) >> 1) |

sys/kern/kern_caps.c

245

(elm & __SYSCAP_EXECMASK);

sys/kern/kern_caps.c

246

if (elm != cred->cr_caps.caps[i])

sys/kern/kern_caps.c

257

elm = cred->cr_caps.caps[i];

sys/kern/kern_caps.c

258

elm = ((elm & __SYSCAP_EXECMASK) >> 1) |

sys/kern/kern_caps.c

259

(elm & __SYSCAP_EXECMASK);

sys/kern/kern_caps.c

260

cred->cr_caps.caps[i] = elm;

sys/kern/kern_caps.c

290

__syscapelm_t elm;

sys/kern/kern_caps.c

297

elm = (__syscapelm_t)flags << __SYSCAP_SHIFT(SYSCAP_ANY);

sys/kern/kern_caps.c

298

atomic_set_64(&cred->cr_caps.caps[0], elm);

sys/kern/kern_caps.c

299

elm = (__syscapelm_t)flags << __SYSCAP_SHIFT(cap);

sys/kern/kern_caps.c

300

atomic_set_64(&cred->cr_caps.caps[ __SYSCAP_INDEX(cap)], elm);

sys/kern/kern_caps.c

65

__syscapelm_t elm;

sys/kern/kern_caps.c

68

elm = cred->cr_caps.caps[__SYSCAP_INDEX(cap)];

sys/kern/kern_caps.c

70

return ((int)(elm >> __SYSCAP_SHIFT(cap)) & __SYSCAP_ALL);

sys/kern/kern_lockf.c

848

lf_insert(struct lockf_range_list *list, struct lockf_range *elm,

sys/kern/kern_lockf.c

85

struct lockf_range *elm,

sys/kern/kern_lockf.c

851

while (insert_point && insert_point->lf_start < elm->lf_start)

sys/kern/kern_lockf.c

854

TAILQ_INSERT_BEFORE(insert_point, elm, lf_link);

sys/kern/kern_lockf.c

856

TAILQ_INSERT_TAIL(list, elm, lf_link);

sys/kern/vfs_cache.c

1000

struct mntcache_elm *elm;

sys/kern/vfs_cache.c

1009

elm = _cache_mntcache_hash(ncp);

sys/kern/vfs_cache.c

1011

if (elm->ncp == ncp) {

sys/kern/vfs_cache.c

1012

ncpr = atomic_swap_ptr((void *)&elm->ncp, NULL);

sys/kern/vfs_cache.c

1020

++elm;

sys/kern/vfs_cache.c

1034

struct mntcache_elm *elm;

sys/kern/vfs_cache.c

1053

elm = _cache_mntcache_hash(nch->ncp);

sys/kern/vfs_cache.c

1054

best = elm;

sys/kern/vfs_cache.c

1056

if (elm->ncp == NULL) {

sys/kern/vfs_cache.c

1057

ncpr = atomic_swap_ptr((void *)&elm->ncp, nch->ncp);

sys/kern/vfs_cache.c

1059

elm->ticks = ticks;

sys/kern/vfs_cache.c

1067

delta2 = ticks - elm->ticks;

sys/kern/vfs_cache.c

1069

best = elm;

sys/kern/vfs_cache.c

1070

++elm;

sys/kern/vfs_cache.c

378

struct mntcache_elm *elm;

sys/kern/vfs_cache.c

382

elm = &pcpu_mntcache[mycpu->gd_cpuid].array[hv & ~(MNTCACHE_SET - 1)];

sys/kern/vfs_cache.c

384

return elm;

sys/kern/vfs_cache.c

391

struct mntcache_elm *elm;

sys/kern/vfs_cache.c

395

elm = _cache_mntcache_hash(mp);

sys/kern/vfs_cache.c

397

if (elm->mp == mp) {

sys/kern/vfs_cache.c

398

mpr = atomic_swap_ptr((void *)&elm->mp, NULL);

sys/kern/vfs_cache.c

404

++elm;

sys/kern/vfs_cache.c

413

struct mntcache_elm *elm;

sys/kern/vfs_cache.c

420

elm = _cache_mntcache_hash(mp);

sys/kern/vfs_cache.c

421

best = elm;

sys/kern/vfs_cache.c

423

if (elm->mp == NULL) {

sys/kern/vfs_cache.c

424

mpr = atomic_swap_ptr((void *)&elm->mp, mp);

sys/kern/vfs_cache.c

428

elm->ticks = ticks;

sys/kern/vfs_cache.c

432

delta2 = ticks - elm->ticks;

sys/kern/vfs_cache.c

434

best = elm;

sys/kern/vfs_cache.c

435

++elm;

sys/kern/vfs_cache.c

455

struct mntcache_elm *elm;

sys/kern/vfs_cache.c

461

elm = &cache->array[i];

sys/kern/vfs_cache.c

462

if (elm->mp) {

sys/kern/vfs_cache.c

463

mp = atomic_swap_ptr((void *)&elm->mp, NULL);

sys/kern/vfs_cache.c

467

if (elm->ncp) {

sys/kern/vfs_cache.c

468

ncp = atomic_swap_ptr((void *)&elm->ncp, NULL);

sys/net/pf/pf_ioctl.c

784

#define PF_MD5_UPD(st, elm) \

sys/net/pf/pf_ioctl.c

785

MD5Update(ctx, (u_int8_t *) &(st)->elm, sizeof((st)->elm))

sys/net/pf/pf_ioctl.c

787

#define PF_MD5_UPD_STR(st, elm) \

sys/net/pf/pf_ioctl.c

788

MD5Update(ctx, (u_int8_t *) (st)->elm, strlen((st)->elm))

sys/net/pf/pf_ioctl.c

790

#define PF_MD5_UPD_HTONL(st, elm, stor) do { \

sys/net/pf/pf_ioctl.c

791

(stor) = htonl((st)->elm); \

sys/net/pf/pf_ioctl.c

795

#define PF_MD5_UPD_HTONS(st, elm, stor) do { \

sys/net/pf/pf_ioctl.c

796

(stor) = htons((st)->elm); \

sys/sys/dmsg.h

315

#define DMSG_HDR_ENCODE(elm) (((uint32_t)sizeof(struct elm) + \

sys/sys/dmsg.h

319

#define DMSG_LNK(cmd, elm) (DMSG_PROTO_LNK | \

sys/sys/dmsg.h

321

DMSG_HDR_ENCODE(elm))

sys/sys/dmsg.h

323

#define DMSG_DBG(cmd, elm) (DMSG_PROTO_DBG | \

sys/sys/dmsg.h

325

DMSG_HDR_ENCODE(elm))

sys/sys/dmsg.h

327

#define DMSG_HM2(cmd, elm) (DMSG_PROTO_HM2 | \

sys/sys/dmsg.h

329

DMSG_HDR_ENCODE(elm))

sys/sys/dmsg.h

331

#define DMSG_BLK(cmd, elm) (DMSG_PROTO_BLK | \

sys/sys/dmsg.h

333

DMSG_HDR_ENCODE(elm))

sys/sys/dmsg.h

335

#define DMSG_VOP(cmd, elm) (DMSG_PROTO_VOP | \

sys/sys/dmsg.h

337

DMSG_HDR_ENCODE(elm))

sys/sys/queue.h

196

#define SLIST_INSERT_AFTER(slistelm, elm, field) do { \

sys/sys/queue.h

197

SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \

sys/sys/queue.h

198

SLIST_NEXT((slistelm), field) = (elm); \

sys/sys/queue.h

201

#define SLIST_INSERT_HEAD(head, elm, field) do { \

sys/sys/queue.h

202

SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \

sys/sys/queue.h

203

SLIST_FIRST((head)) = (elm); \

sys/sys/queue.h

206

#define SLIST_NEXT(elm, field) ((elm)->field.sle_next)

sys/sys/queue.h

208

#define SLIST_REMOVE(head, elm, type, field) do { \

sys/sys/queue.h

209

QMD_SAVELINK(oldnext, (elm)->field.sle_next); \

sys/sys/queue.h

210

if (SLIST_FIRST((head)) == (elm)) { \

sys/sys/queue.h

215

while (SLIST_NEXT(curelm, field) != (elm)) \

sys/sys/queue.h

222

#define SLIST_REMOVE_AFTER(elm, field) do { \

sys/sys/queue.h

223

SLIST_NEXT(elm, field) = \

sys/sys/queue.h

224

SLIST_NEXT(SLIST_NEXT(elm, field), field); \

sys/sys/queue.h

294

#define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \

sys/sys/queue.h

295

if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\

sys/sys/queue.h

296

(head)->stqh_last = &STAILQ_NEXT((elm), field); \

sys/sys/queue.h

297

STAILQ_NEXT((tqelm), field) = (elm); \

sys/sys/queue.h

300

#define STAILQ_INSERT_HEAD(head, elm, field) do { \

sys/sys/queue.h

301

if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \

sys/sys/queue.h

302

(head)->stqh_last = &STAILQ_NEXT((elm), field); \

sys/sys/queue.h

303

STAILQ_FIRST((head)) = (elm); \

sys/sys/queue.h

306

#define STAILQ_INSERT_TAIL(head, elm, field) do { \

sys/sys/queue.h

307

STAILQ_NEXT((elm), field) = NULL; \

sys/sys/queue.h

308

*(head)->stqh_last = (elm); \

sys/sys/queue.h

309

(head)->stqh_last = &STAILQ_NEXT((elm), field); \

sys/sys/queue.h

317

#define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next)

sys/sys/queue.h

319

#define STAILQ_REMOVE(head, elm, type, field) do { \

sys/sys/queue.h

320

QMD_SAVELINK(oldnext, (elm)->field.stqe_next); \

sys/sys/queue.h

321

if (STAILQ_FIRST((head)) == (elm)) { \

sys/sys/queue.h

326

while (STAILQ_NEXT(curelm, field) != (elm)) \

sys/sys/queue.h

339

#define STAILQ_REMOVE_AFTER(head, elm, field) do { \

sys/sys/queue.h

340

if ((STAILQ_NEXT(elm, field) = \

sys/sys/queue.h

341

STAILQ_NEXT(STAILQ_NEXT(elm, field), field)) == NULL) \

sys/sys/queue.h

342

(head)->stqh_last = &STAILQ_NEXT((elm), field); \

sys/sys/queue.h

388

#define QMD_LIST_CHECK_NEXT(elm, field) do { \

sys/sys/queue.h

389

if (LIST_NEXT((elm), field) != NULL && \

sys/sys/queue.h

390

LIST_NEXT((elm), field)->field.le_prev != \

sys/sys/queue.h

391

&((elm)->field.le_next)) \

sys/sys/queue.h

392

panic("Bad link elm %p next->prev != elm", (elm)); \

sys/sys/queue.h

395

#define QMD_LIST_CHECK_PREV(elm, field) do { \

sys/sys/queue.h

396

if (*(elm)->field.le_prev != (elm)) \

sys/sys/queue.h

397

panic("Bad link elm %p prev->next != elm", (elm)); \

sys/sys/queue.h

401

#define QMD_LIST_CHECK_NEXT(elm, field)

sys/sys/queue.h

402

#define QMD_LIST_CHECK_PREV(elm, field)

sys/sys/queue.h

433

#define LIST_INSERT_AFTER(listelm, elm, field) do { \

sys/sys/queue.h

435

if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\

sys/sys/queue.h

437

&LIST_NEXT((elm), field); \

sys/sys/queue.h

438

LIST_NEXT((listelm), field) = (elm); \

sys/sys/queue.h

439

(elm)->field.le_prev = &LIST_NEXT((listelm), field); \

sys/sys/queue.h

442

#define LIST_INSERT_BEFORE(listelm, elm, field) do { \

sys/sys/queue.h

444

(elm)->field.le_prev = (listelm)->field.le_prev; \

sys/sys/queue.h

445

LIST_NEXT((elm), field) = (listelm); \

sys/sys/queue.h

446

*(listelm)->field.le_prev = (elm); \

sys/sys/queue.h

447

(listelm)->field.le_prev = &LIST_NEXT((elm), field); \

sys/sys/queue.h

450

#define LIST_INSERT_HEAD(head, elm, field) do { \

sys/sys/queue.h

452

if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \

sys/sys/queue.h

453

LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\

sys/sys/queue.h

454

LIST_FIRST((head)) = (elm); \

sys/sys/queue.h

455

(elm)->field.le_prev = &LIST_FIRST((head)); \

sys/sys/queue.h

458

#define LIST_NEXT(elm, field) ((elm)->field.le_next)

sys/sys/queue.h

460

#define LIST_REMOVE(elm, field) do { \

sys/sys/queue.h

461

QMD_SAVELINK(oldnext, (elm)->field.le_next); \

sys/sys/queue.h

462

QMD_SAVELINK(oldprev, (elm)->field.le_prev); \

sys/sys/queue.h

463

QMD_LIST_CHECK_NEXT(elm, field); \

sys/sys/queue.h

464

QMD_LIST_CHECK_PREV(elm, field); \

sys/sys/queue.h

465

if (LIST_NEXT((elm), field) != NULL) \

sys/sys/queue.h

466

LIST_NEXT((elm), field)->field.le_prev = \

sys/sys/queue.h

467

(elm)->field.le_prev; \

sys/sys/queue.h

468

*(elm)->field.le_prev = LIST_NEXT((elm), field); \

sys/sys/queue.h

521

#define QMD_TAILQ_CHECK_NEXT(elm, field) do { \

sys/sys/queue.h

522

if (TAILQ_NEXT((elm), field) != NULL && \

sys/sys/queue.h

523

TAILQ_NEXT((elm), field)->field.tqe_prev != \

sys/sys/queue.h

524

&((elm)->field.tqe_next)) \

sys/sys/queue.h

525

panic("Bad link elm %p next->prev != elm", (elm)); \

sys/sys/queue.h

528

#define QMD_TAILQ_CHECK_PREV(elm, field) do { \

sys/sys/queue.h

529

if (*(elm)->field.tqe_prev != (elm)) \

sys/sys/queue.h

530

panic("Bad link elm %p prev->next != elm", (elm)); \

sys/sys/queue.h

535

#define QMD_TAILQ_CHECK_NEXT(elm, field)

sys/sys/queue.h

536

#define QMD_TAILQ_CHECK_PREV(elm, field)

sys/sys/queue.h

590

#define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \

sys/sys/queue.h

592

if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\

sys/sys/queue.h

593

TAILQ_NEXT((elm), field)->field.tqe_prev = \

sys/sys/queue.h

594

&TAILQ_NEXT((elm), field); \

sys/sys/queue.h

596

(head)->tqh_last = &TAILQ_NEXT((elm), field); \

sys/sys/queue.h

599

TAILQ_NEXT((listelm), field) = (elm); \

sys/sys/queue.h

600

(elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \

sys/sys/queue.h

601

QMD_TRACE_ELEM(&(elm)->field); \

sys/sys/queue.h

605

#define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \

sys/sys/queue.h

607

(elm)->field.tqe_prev = (listelm)->field.tqe_prev; \

sys/sys/queue.h

608

TAILQ_NEXT((elm), field) = (listelm); \

sys/sys/queue.h

609

*(listelm)->field.tqe_prev = (elm); \

sys/sys/queue.h

610

(listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \

sys/sys/queue.h

611

QMD_TRACE_ELEM(&(elm)->field); \

sys/sys/queue.h

615

#define TAILQ_INSERT_HEAD(head, elm, field) do { \

sys/sys/queue.h

617

if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \

sys/sys/queue.h

619

&TAILQ_NEXT((elm), field); \

sys/sys/queue.h

621

(head)->tqh_last = &TAILQ_NEXT((elm), field); \

sys/sys/queue.h

622

TAILQ_FIRST((head)) = (elm); \

sys/sys/queue.h

623

(elm)->field.tqe_prev = &TAILQ_FIRST((head)); \

sys/sys/queue.h

625

QMD_TRACE_ELEM(&(elm)->field); \

sys/sys/queue.h

628

#define TAILQ_INSERT_TAIL(head, elm, field) do { \

sys/sys/queue.h

630

TAILQ_NEXT((elm), field) = NULL; \

sys/sys/queue.h

631

(elm)->field.tqe_prev = (head)->tqh_last; \

sys/sys/queue.h

632

*(head)->tqh_last = (elm); \

sys/sys/queue.h

633

(head)->tqh_last = &TAILQ_NEXT((elm), field); \

sys/sys/queue.h

635

QMD_TRACE_ELEM(&(elm)->field); \

sys/sys/queue.h

641

#define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)

sys/sys/queue.h

643

#define TAILQ_PREV(elm, headname, field) \

sys/sys/queue.h

644

(*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))

sys/sys/queue.h

646

#define TAILQ_REMOVE(head, elm, field) do { \

sys/sys/queue.h

647

QMD_SAVELINK(oldnext, (elm)->field.tqe_next); \

sys/sys/queue.h

648

QMD_SAVELINK(oldprev, (elm)->field.tqe_prev); \

sys/sys/queue.h

649

QMD_TAILQ_CHECK_NEXT(elm, field); \

sys/sys/queue.h

650

QMD_TAILQ_CHECK_PREV(elm, field); \

sys/sys/queue.h

651

if ((TAILQ_NEXT((elm), field)) != NULL) \

sys/sys/queue.h

652

TAILQ_NEXT((elm), field)->field.tqe_prev = \

sys/sys/queue.h

653

(elm)->field.tqe_prev; \

sys/sys/queue.h

655

(head)->tqh_last = (elm)->field.tqe_prev; \

sys/sys/queue.h

658

*(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \

sys/sys/queue.h

661

QMD_TRACE_ELEM(&(elm)->field); \

sys/sys/tree.h

1022

#define RB_INSERT(name, root, elm) name##_RB_INSERT(root, elm)

sys/sys/tree.h

1023

#define RB_REMOVE(name, root, elm) name##_RB_REMOVE(root, elm)

sys/sys/tree.h

1024

#define RB_FIND(name, root, elm) name##_RB_FIND(root, elm)

sys/sys/tree.h

1032

#define RB_NEXT(name, root, elm) name##_RB_NEXT(elm)

sys/sys/tree.h

1033

#define RB_PREV(name, root, elm) name##_RB_PREV(elm)

sys/sys/tree.h

130

name##_SPLAY_FIND(struct name *head, struct type *elm) \

sys/sys/tree.h

134

name##_SPLAY(head, elm); \

sys/sys/tree.h

135

if ((cmp)(elm, (head)->sph_root) == 0) \

sys/sys/tree.h

141

name##_SPLAY_NEXT(struct name *head, struct type *elm) \

sys/sys/tree.h

143

name##_SPLAY(head, elm); \

sys/sys/tree.h

144

if (SPLAY_RIGHT(elm, field) != NULL) { \

sys/sys/tree.h

145

elm = SPLAY_RIGHT(elm, field); \

sys/sys/tree.h

146

while (SPLAY_LEFT(elm, field) != NULL) { \

sys/sys/tree.h

147

elm = SPLAY_LEFT(elm, field); \

sys/sys/tree.h

150

elm = NULL; \

sys/sys/tree.h

151

return (elm); \

sys/sys/tree.h

166

name##_SPLAY_INSERT(struct name *head, struct type *elm) \

sys/sys/tree.h

169

SPLAY_LEFT(elm, field) = SPLAY_RIGHT(elm, field) = NULL; \

sys/sys/tree.h

172

name##_SPLAY(head, elm); \

sys/sys/tree.h

173

__comp = (cmp)(elm, (head)->sph_root); \

sys/sys/tree.h

175

SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\

sys/sys/tree.h

176

SPLAY_RIGHT(elm, field) = (head)->sph_root; \

sys/sys/tree.h

179

SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\

sys/sys/tree.h

180

SPLAY_LEFT(elm, field) = (head)->sph_root; \

sys/sys/tree.h

185

(head)->sph_root = (elm); \

sys/sys/tree.h

190

name##_SPLAY_REMOVE(struct name *head, struct type *elm) \

sys/sys/tree.h

195

name##_SPLAY(head, elm); \

sys/sys/tree.h

196

if ((cmp)(elm, (head)->sph_root) == 0) { \

sys/sys/tree.h

202

name##_SPLAY(head, elm); \

sys/sys/tree.h

205

return (elm); \

sys/sys/tree.h

211

name##_SPLAY(struct name *head, struct type *elm) \

sys/sys/tree.h

219

while ((__comp = (cmp)(elm, (head)->sph_root)) != 0) { \

sys/sys/tree.h

224

if ((cmp)(elm, __tmp) < 0){ \

sys/sys/tree.h

234

if ((cmp)(elm, __tmp) > 0){ \

sys/sys/tree.h

341

#define RB_LEFT(elm, field) (elm)->field.rbe_left

sys/sys/tree.h

342

#define RB_RIGHT(elm, field) (elm)->field.rbe_right

sys/sys/tree.h

343

#define RB_PARENT(elm, field) (elm)->field.rbe_parent

sys/sys/tree.h

344

#define RB_COLOR(elm, field) (elm)->field.rbe_color

sys/sys/tree.h

349

#define RB_SET(elm, parent, field) do { \

sys/sys/tree.h

350

RB_PARENT(elm, field) = parent; \

sys/sys/tree.h

351

RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \

sys/sys/tree.h

352

RB_COLOR(elm, field) = RB_RED; \

sys/sys/tree.h

364

#define RB_ROTATE_LEFT(head, elm, tmp, field) do { \

sys/sys/tree.h

365

(tmp) = RB_RIGHT(elm, field); \

sys/sys/tree.h

366

if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field)) != NULL) { \

sys/sys/tree.h

367

RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \

sys/sys/tree.h

369

RB_AUGMENT(elm); \

sys/sys/tree.h

370

if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field)) != NULL) { \

sys/sys/tree.h

371

if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \

sys/sys/tree.h

372

RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \

sys/sys/tree.h

374

RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \

sys/sys/tree.h

377

RB_LEFT(tmp, field) = (elm); \

sys/sys/tree.h

378

RB_PARENT(elm, field) = (tmp); \

sys/sys/tree.h

384

#define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \

sys/sys/tree.h

385

(tmp) = RB_LEFT(elm, field); \

sys/sys/tree.h

386

if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field)) != NULL) { \

sys/sys/tree.h

387

RB_PARENT(RB_RIGHT(tmp, field), field) = (elm); \

sys/sys/tree.h

389

RB_AUGMENT(elm); \

sys/sys/tree.h

390

if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field)) != NULL) { \

sys/sys/tree.h

391

if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \

sys/sys/tree.h

392

RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \

sys/sys/tree.h

394

RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \

sys/sys/tree.h

397

RB_RIGHT(tmp, field) = (elm); \

sys/sys/tree.h

398

RB_PARENT(elm, field) = (tmp); \

sys/sys/tree.h

462

name##_RB_INSERT_COLOR(struct name *head, struct type *elm) \

sys/sys/tree.h

465

while ((parent = RB_PARENT(elm, field)) != NULL && \

sys/sys/tree.h

473

elm = gparent; \

sys/sys/tree.h

476

if (RB_RIGHT(parent, field) == elm) { \

sys/sys/tree.h

479

parent = elm; \

sys/sys/tree.h

480

elm = tmp; \

sys/sys/tree.h

489

elm = gparent; \

sys/sys/tree.h

492

if (RB_LEFT(parent, field) == elm) { \

sys/sys/tree.h

495

parent = elm; \

sys/sys/tree.h

496

elm = tmp; \

sys/sys/tree.h

507

struct type *elm) \

sys/sys/tree.h

510

while ((elm == NULL || RB_COLOR(elm, field) == RB_BLACK) && \

sys/sys/tree.h

511

elm != RB_ROOT(head)) { \

sys/sys/tree.h

512

if (RB_LEFT(parent, field) == elm) { \

sys/sys/tree.h

524

elm = parent; \

sys/sys/tree.h

525

parent = RB_PARENT(elm, field); \

sys/sys/tree.h

542

elm = RB_ROOT(head); \

sys/sys/tree.h

557

elm = parent; \

sys/sys/tree.h

558

parent = RB_PARENT(elm, field); \

sys/sys/tree.h

575

elm = RB_ROOT(head); \

sys/sys/tree.h

580

if (elm) \

sys/sys/tree.h

581

RB_COLOR(elm, field) = RB_BLACK; \

sys/sys/tree.h

585

name##_RB_REMOVE(struct name *head, struct type *elm) \

sys/sys/tree.h

592

if (inprog->node == elm) \

sys/sys/tree.h

593

inprog->node = RB_NEXT(name, head, elm); \

sys/sys/tree.h

596

old = elm; \

sys/sys/tree.h

597

if (RB_LEFT(elm, field) == NULL) \

sys/sys/tree.h

598

child = RB_RIGHT(elm, field); \

sys/sys/tree.h

599

else if (RB_RIGHT(elm, field) == NULL) \

sys/sys/tree.h

600

child = RB_LEFT(elm, field); \

sys/sys/tree.h

603

elm = RB_RIGHT(elm, field); \

sys/sys/tree.h

604

while ((left = RB_LEFT(elm, field)) != NULL) \

sys/sys/tree.h

605

elm = left; \

sys/sys/tree.h

606

child = RB_RIGHT(elm, field); \

sys/sys/tree.h

607

parent = RB_PARENT(elm, field); \

sys/sys/tree.h

608

color = RB_COLOR(elm, field); \

sys/sys/tree.h

612

if (RB_LEFT(parent, field) == elm) \

sys/sys/tree.h

619

if (RB_PARENT(elm, field) == old) \

sys/sys/tree.h

620

parent = elm; \

sys/sys/tree.h

621

(elm)->field = (old)->field; \

sys/sys/tree.h

624

RB_LEFT(RB_PARENT(old, field), field) = elm;\

sys/sys/tree.h

626

RB_RIGHT(RB_PARENT(old, field), field) = elm;\

sys/sys/tree.h

629

RB_ROOT(head) = elm; \

sys/sys/tree.h

630

RB_PARENT(RB_LEFT(old, field), field) = elm; \

sys/sys/tree.h

632

RB_PARENT(RB_RIGHT(old, field), field) = elm; \

sys/sys/tree.h

641

parent = RB_PARENT(elm, field); \

sys/sys/tree.h

642

color = RB_COLOR(elm, field); \

sys/sys/tree.h

646

if (RB_LEFT(parent, field) == elm) \

sys/sys/tree.h

661

name##_RB_INSERT(struct name *head, struct type *elm) \

sys/sys/tree.h

669

comp = (cmp)(elm, parent); \

sys/sys/tree.h

677

RB_SET(elm, parent, field); \

sys/sys/tree.h

680

RB_LEFT(parent, field) = elm; \

sys/sys/tree.h

682

RB_RIGHT(parent, field) = elm; \

sys/sys/tree.h

685

RB_ROOT(head) = elm; \

sys/sys/tree.h

686

name##_RB_INSERT_COLOR(head, elm); \

sys/sys/tree.h

692

name##_RB_FIND(struct name *head, struct type *elm) \

sys/sys/tree.h

697

comp = cmp(elm, tmp); \

sys/sys/tree.h

815

name##_RB_NEXT(struct type *elm) \

sys/sys/tree.h

817

if (RB_RIGHT(elm, field)) { \

sys/sys/tree.h

818

elm = RB_RIGHT(elm, field); \

sys/sys/tree.h

819

while (RB_LEFT(elm, field)) \

sys/sys/tree.h

820

elm = RB_LEFT(elm, field); \

sys/sys/tree.h

822

if (RB_PARENT(elm, field) && \

sys/sys/tree.h

823

(elm == RB_LEFT(RB_PARENT(elm, field), field))) \

sys/sys/tree.h

824

elm = RB_PARENT(elm, field); \

sys/sys/tree.h

826

while (RB_PARENT(elm, field) && \

sys/sys/tree.h

827

(elm == RB_RIGHT(RB_PARENT(elm, field), field)))\

sys/sys/tree.h

828

elm = RB_PARENT(elm, field); \

sys/sys/tree.h

829

elm = RB_PARENT(elm, field); \

sys/sys/tree.h

83

#define SPLAY_LEFT(elm, field) (elm)->field.spe_left

sys/sys/tree.h

832

return (elm); \

sys/sys/tree.h

837

name##_RB_PREV(struct type *elm) \

sys/sys/tree.h

839

if (RB_LEFT(elm, field)) { \

sys/sys/tree.h

84

#define SPLAY_RIGHT(elm, field) (elm)->field.spe_right

sys/sys/tree.h

840

elm = RB_LEFT(elm, field); \

sys/sys/tree.h

841

while (RB_RIGHT(elm, field)) \

sys/sys/tree.h

842

elm = RB_RIGHT(elm, field); \

sys/sys/tree.h

844

if (RB_PARENT(elm, field) && \

sys/sys/tree.h

845

(elm == RB_RIGHT(RB_PARENT(elm, field), field))) \

sys/sys/tree.h

846

elm = RB_PARENT(elm, field); \

sys/sys/tree.h

848

while (RB_PARENT(elm, field) && \

sys/sys/tree.h

849

(elm == RB_LEFT(RB_PARENT(elm, field), field)))\

sys/sys/tree.h

850

elm = RB_PARENT(elm, field); \

sys/sys/tree.h

851

elm = RB_PARENT(elm, field); \

sys/sys/tree.h

854

return (elm); \

sys/vfs/hammer/hammer.h

1114

hammer_btree_leaf_elm_t elm, int *doprop);

sys/vfs/hammer/hammer.h

1125

hammer_btree_elm_t elm);

sys/vfs/hammer/hammer.h

1140

int hammer_btree_search_node(hammer_base_elm_t elm, hammer_node_ondisk_t node);

sys/vfs/hammer/hammer.h

1146

void hammer_print_btree_elm(hammer_btree_elm_t elm);

sys/vfs/hammer/hammer_btree.c

1092

elm = &node->elms[i];

sys/vfs/hammer/hammer_btree.c

1093

r = hammer_btree_cmp(&cursor->key_beg, &elm->base);

sys/vfs/hammer/hammer_btree.c

1101

KKASSERT(elm->base.create_tid != 1);

sys/vfs/hammer/hammer_btree.c

1102

cursor->create_check = elm->base.create_tid - 1;

sys/vfs/hammer/hammer_btree.c

1132

elm = &node->elms[0];

sys/vfs/hammer/hammer_btree.c

1193

elm = &node->elms[i];

sys/vfs/hammer/hammer_btree.c

1196

&elm->base, sizeof(elm->base));

sys/vfs/hammer/hammer_btree.c

1197

elm->base = *cursor->right_bound;

sys/vfs/hammer/hammer_btree.c

1209

elm = &node->elms[i];

sys/vfs/hammer/hammer_btree.c

1212

hammer_debug_btree_elm(cursor, elm, "RESULT-I", 0xffff);

sys/vfs/hammer/hammer_btree.c

1218

KKASSERT(elm->internal.subtree_offset != 0);

sys/vfs/hammer/hammer_btree.c

127

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_btree.c

1292

elm = &node->elms[i];

sys/vfs/hammer/hammer_btree.c

1294

r = hammer_btree_cmp(&cursor->key_beg, &elm->leaf.base);

sys/vfs/hammer/hammer_btree.c

1305

KKASSERT (elm->leaf.base.btype == HAMMER_BTREE_TYPE_RECORD);

sys/vfs/hammer/hammer_btree.c

1390

hammer_btree_search_node(hammer_base_elm_t elm, hammer_node_ondisk_t node)

sys/vfs/hammer/hammer_btree.c

1405

r = hammer_btree_cmp(elm, &node->elms[i].leaf.base);

sys/vfs/hammer/hammer_btree.c

1443

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_btree.c

1452

const int esize = sizeof(*elm);

sys/vfs/hammer/hammer_btree.c

1551

elm = &ondisk->elms[split];

sys/vfs/hammer/hammer_btree.c

1552

bcopy(elm, &new_node->ondisk->elms[0],

sys/vfs/hammer/hammer_btree.c

1566

elm->base.btype = HAMMER_BTREE_TYPE_NONE;

sys/vfs/hammer/hammer_btree.c

1567

elm->internal.subtree_offset = 0;

sys/vfs/hammer/hammer_btree.c

1587

parent_elm->internal.base = elm->base; /* separator P */

sys/vfs/hammer/hammer_btree.c

1601

elm = &new_node->ondisk->elms[i];

sys/vfs/hammer/hammer_btree.c

1602

error = btree_set_parent_of_child(cursor->trans, new_node, elm);

sys/vfs/hammer/hammer_btree.c

1686

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_btree.c

1693

const size_t esize = sizeof(*elm);

sys/vfs/hammer/hammer_btree.c

1735

elm = &ondisk->elms[split];

sys/vfs/hammer/hammer_btree.c

1737

KKASSERT(hammer_btree_cmp(cursor->left_bound, &elm[-1].leaf.base) <= 0);

sys/vfs/hammer/hammer_btree.c

1738

KKASSERT(hammer_btree_cmp(cursor->left_bound, &elm->leaf.base) <= 0);

sys/vfs/hammer/hammer_btree.c

1739

KKASSERT(hammer_btree_cmp(cursor->right_bound, &elm->leaf.base) > 0);

sys/vfs/hammer/hammer_btree.c

1740

KKASSERT(hammer_btree_cmp(cursor->right_bound, &elm[1].leaf.base) > 0);

sys/vfs/hammer/hammer_btree.c

1802

elm = &ondisk->elms[split];

sys/vfs/hammer/hammer_btree.c

1803

bcopy(elm, &new_leaf->ondisk->elms[0], (ondisk->count - split) * esize);

sys/vfs/hammer/hammer_btree.c

1842

hammer_make_separator(&elm[-1].base, &elm[0].base, &parent_elm->base);

sys/vfs/hammer/hammer_btree.c

1941

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_btree.c

1944

const int esize = sizeof(*elm);

sys/vfs/hammer/hammer_btree.c

2050

elm = &ondisk->elms[cursor->parent_index];

sys/vfs/hammer/hammer_btree.c

2051

KKASSERT(elm->internal.subtree_offset == node->node_offset);

sys/vfs/hammer/hammer_btree.c

2067

if (elm[-1].internal.mirror_tid <

sys/vfs/hammer/hammer_btree.c

2068

elm[0].internal.mirror_tid) {

sys/vfs/hammer/hammer_btree.c

2069

elm[-1].internal.mirror_tid =

sys/vfs/hammer/hammer_btree.c

2070

elm[0].internal.mirror_tid;

sys/vfs/hammer/hammer_btree.c

2073

if (elm[1].internal.mirror_tid <

sys/vfs/hammer/hammer_btree.c

2074

elm[0].internal.mirror_tid) {

sys/vfs/hammer/hammer_btree.c

2075

elm[1].internal.mirror_tid =

sys/vfs/hammer/hammer_btree.c

2076

elm[0].internal.mirror_tid;

sys/vfs/hammer/hammer_btree.c

2084

bcopy(&elm[1], &elm[0],

sys/vfs/hammer/hammer_btree.c

214

elm = &node->elms[cursor->index];

sys/vfs/hammer/hammer_btree.c

216

r = hammer_btree_cmp(&cursor->key_end, &elm[0].base);

sys/vfs/hammer/hammer_btree.c

2166

hammer_btree_internal_elm_t elm;

sys/vfs/hammer/hammer_btree.c

217

s = hammer_btree_cmp(&cursor->key_beg, &elm[1].base);

sys/vfs/hammer/hammer_btree.c

219

hammer_debug_btree_elm(cursor, elm, "BRACKETL", r);

sys/vfs/hammer/hammer_btree.c

2198

elm = &node->ondisk->elms[cursor->index].internal;

sys/vfs/hammer/hammer_btree.c

2199

if (elm->mirror_tid >= mirror_tid)

sys/vfs/hammer/hammer_btree.c

220

hammer_debug_btree_elm(cursor, elm + 1, "BRACKETR", s);

sys/vfs/hammer/hammer_btree.c

2201

hammer_modify_node(cursor->trans, node, &elm->mirror_tid,

sys/vfs/hammer/hammer_btree.c

2202

sizeof(elm->mirror_tid));

sys/vfs/hammer/hammer_btree.c

2203

elm->mirror_tid = mirror_tid;

sys/vfs/hammer/hammer_btree.c

2242

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_btree.c

2279

elm = &parent->ondisk->elms[i];

sys/vfs/hammer/hammer_btree.c

2280

if (elm->internal.subtree_offset == node->node_offset)

sys/vfs/hammer/hammer_btree.c

2303

hammer_btree_elm_t elm)

sys/vfs/hammer/hammer_btree.c

2310

if (hammer_is_internal_node_elm(elm)) {

sys/vfs/hammer/hammer_btree.c

2311

child = hammer_get_node(trans, elm->internal.subtree_offset,

sys/vfs/hammer/hammer_btree.c

236

KKASSERT(elm->internal.subtree_offset != 0);

sys/vfs/hammer/hammer_btree.c

2408

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_btree.c

2429

elm = &ondisk->elms[i];

sys/vfs/hammer/hammer_btree.c

2431

elm->internal.subtree_offset,

sys/vfs/hammer/hammer_btree.c

2442

elm = &ondisk->elms[i];

sys/vfs/hammer/hammer_btree.c

2444

KKASSERT(elm->internal.subtree_offset != 0);

sys/vfs/hammer/hammer_btree.c

2446

elm->internal.subtree_offset,

sys/vfs/hammer/hammer_btree.c

2478

if (depth > 1 && elm->base.btype == HAMMER_BTREE_TYPE_INTERNAL) {

sys/vfs/hammer/hammer_btree.c

248

if (elm->internal.mirror_tid <

sys/vfs/hammer/hammer_btree.c

2756

hammer_print_btree_elm(hammer_btree_elm_t elm)

sys/vfs/hammer/hammer_btree.c

2758

kprintf("\tobj_id = %016jx\n", (intmax_t)elm->base.obj_id);

sys/vfs/hammer/hammer_btree.c

2759

kprintf("\tkey = %016jx\n", (intmax_t)elm->base.key);

sys/vfs/hammer/hammer_btree.c

276

elm = &node->elms[cursor->index];

sys/vfs/hammer/hammer_btree.c

2760

kprintf("\tcreate_tid = %016jx\n", (intmax_t)elm->base.create_tid);

sys/vfs/hammer/hammer_btree.c

2761

kprintf("\tdelete_tid = %016jx\n", (intmax_t)elm->base.delete_tid);

sys/vfs/hammer/hammer_btree.c

2762

kprintf("\trec_type = %04x\n", elm->base.rec_type);

sys/vfs/hammer/hammer_btree.c

2763

kprintf("\tobj_type = %02x\n", elm->base.obj_type);

sys/vfs/hammer/hammer_btree.c

2764

kprintf("\tbtype = %02x (%c)\n", elm->base.btype,

sys/vfs/hammer/hammer_btree.c

2765

hammer_elm_btype(elm));

sys/vfs/hammer/hammer_btree.c

2766

kprintf("\tlocalization = %08x\n", elm->base.localization);

sys/vfs/hammer/hammer_btree.c

2768

if (hammer_is_internal_node_elm(elm)) {

sys/vfs/hammer/hammer_btree.c

277

r = hammer_btree_cmp(&cursor->key_end, &elm->base);

sys/vfs/hammer/hammer_btree.c

2770

(intmax_t)elm->internal.subtree_offset);

sys/vfs/hammer/hammer_btree.c

2771

} else if (hammer_is_leaf_node_elm(elm)) {

sys/vfs/hammer/hammer_btree.c

2773

(intmax_t)elm->leaf.data_offset);

sys/vfs/hammer/hammer_btree.c

2774

kprintf("\tdata_len = %08x\n", elm->leaf.data_len);

sys/vfs/hammer/hammer_btree.c

2775

kprintf("\tdata_crc = %08x\n", elm->leaf.data_crc);

sys/vfs/hammer/hammer_btree.c

2781

hammer_debug_btree_elm(hammer_cursor_t cursor, hammer_btree_elm_t elm,

sys/vfs/hammer/hammer_btree.c

279

hammer_debug_btree_elm(cursor, elm, "ELEMENT", r);

sys/vfs/hammer/hammer_btree.c

2790

hammer_elm_btype(elm),

sys/vfs/hammer/hammer_btree.c

2791

elm->base.localization,

sys/vfs/hammer/hammer_btree.c

2792

(intmax_t)elm->base.obj_id,

sys/vfs/hammer/hammer_btree.c

2793

elm->base.rec_type,

sys/vfs/hammer/hammer_btree.c

2794

(intmax_t)elm->base.key,

sys/vfs/hammer/hammer_btree.c

2795

(intmax_t)elm->base.create_tid,

sys/vfs/hammer/hammer_btree.c

2804

hammer_btree_elm_t elm =

sys/vfs/hammer/hammer_btree.c

2812

hammer_elm_btype(elm),

sys/vfs/hammer/hammer_btree.c

2814

(intmax_t)elm->internal.base.obj_id,

sys/vfs/hammer/hammer_btree.c

2816

(intmax_t)(elm + 1)->internal.base.obj_id,

sys/vfs/hammer/hammer_btree.c

2818

elm,

sys/vfs/hammer/hammer_btree.c

2820

elm + 1);

sys/vfs/hammer/hammer_btree.c

304

&elm->base);

sys/vfs/hammer/hammer_btree.c

317

switch(elm->leaf.base.btype) {

sys/vfs/hammer/hammer_btree.c

320

hammer_btree_chkts(cursor->asof, &elm->base)) {

sys/vfs/hammer/hammer_btree.c

338

elm = &cursor->node->ondisk->elms[cursor->index];

sys/vfs/hammer/hammer_btree.c

339

hammer_debug_btree_elm(cursor, elm, "ITERATE", 0xffff);

sys/vfs/hammer/hammer_btree.c

358

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_btree.c

366

elm = &ondisk->elms[cursor->index];

sys/vfs/hammer/hammer_btree.c

370

cmirror->skip_beg = elm->internal.base;

sys/vfs/hammer/hammer_btree.c

372

if (elm->internal.mirror_tid >= cmirror->mirror_tid)

sys/vfs/hammer/hammer_btree.c

375

++elm;

sys/vfs/hammer/hammer_btree.c

380

cmirror->skip_end = elm->internal.base;

sys/vfs/hammer/hammer_btree.c

399

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_btree.c

464

elm = &node->elms[cursor->index];

sys/vfs/hammer/hammer_btree.c

466

r = hammer_btree_cmp(&cursor->key_end, &elm[0].base);

sys/vfs/hammer/hammer_btree.c

467

s = hammer_btree_cmp(&cursor->key_beg, &elm[1].base);

sys/vfs/hammer/hammer_btree.c

469

hammer_debug_btree_elm(cursor, elm, "BRACKETL", r);

sys/vfs/hammer/hammer_btree.c

470

hammer_debug_btree_elm(cursor, elm + 1, "BRACKETR", s);

sys/vfs/hammer/hammer_btree.c

487

KKASSERT(elm->internal.subtree_offset != 0);

sys/vfs/hammer/hammer_btree.c

500

elm = &node->elms[cursor->index];

sys/vfs/hammer/hammer_btree.c

501

s = hammer_btree_cmp(&cursor->key_beg, &elm->base);

sys/vfs/hammer/hammer_btree.c

503

hammer_debug_btree_elm(cursor, elm, "ELEMENTR", s);

sys/vfs/hammer/hammer_btree.c

519

switch(elm->leaf.base.btype) {

sys/vfs/hammer/hammer_btree.c

522

hammer_btree_chkts(cursor->asof, &elm->base)) {

sys/vfs/hammer/hammer_btree.c

540

elm = &cursor->node->ondisk->elms[cursor->index];

sys/vfs/hammer/hammer_btree.c

541

hammer_debug_btree_elm(cursor, elm, "ITERATER", 0xffff);

sys/vfs/hammer/hammer_btree.c

684

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_btree.c

704

elm = &node->elms[cursor->index];

sys/vfs/hammer/hammer_btree.c

718

cursor->leaf = &elm->leaf;

sys/vfs/hammer/hammer_btree.c

726

if (elm->leaf.base.btype != HAMMER_BTREE_TYPE_RECORD)

sys/vfs/hammer/hammer_btree.c

728

data_off = elm->leaf.data_offset;

sys/vfs/hammer/hammer_btree.c

729

data_len = elm->leaf.data_len;

sys/vfs/hammer/hammer_btree.c

746

switch(elm->leaf.base.rec_type) {

sys/vfs/hammer/hammer_btree.c

765

hammer_crc_test_leaf(hmp->version, cursor->data, &elm->leaf) == 0) {

sys/vfs/hammer/hammer_btree.c

767

(intmax_t)elm->leaf.data_offset, elm->leaf.data_len);

sys/vfs/hammer/hammer_btree.c

792

hammer_btree_insert(hammer_cursor_t cursor, hammer_btree_leaf_elm_t elm,

sys/vfs/hammer/hammer_btree.c

816

KKASSERT(elm->base.btype != 0);

sys/vfs/hammer/hammer_btree.c

821

(node->count - i) * sizeof(*elm));

sys/vfs/hammer/hammer_btree.c

823

node->elms[i].leaf = *elm;

sys/vfs/hammer/hammer_btree.c

831

if (node->mirror_tid < elm->base.delete_tid) {

sys/vfs/hammer/hammer_btree.c

832

node->mirror_tid = elm->base.delete_tid;

sys/vfs/hammer/hammer_btree.c

835

if (node->mirror_tid < elm->base.create_tid) {

sys/vfs/hammer/hammer_btree.c

836

node->mirror_tid = elm->base.create_tid;

sys/vfs/hammer/hammer_btree.c

844

KKASSERT(hammer_btree_cmp(cursor->left_bound, &elm->base) <= 0);

sys/vfs/hammer/hammer_btree.c

845

KKASSERT(hammer_btree_cmp(cursor->right_bound, &elm->base) > 0);

sys/vfs/hammer/hammer_btree.c

847

KKASSERT(hammer_btree_cmp(&node->elms[i-1].leaf.base, &elm->base) < 0);

sys/vfs/hammer/hammer_btree.c

850

KKASSERT(hammer_btree_cmp(&node->elms[i+1].leaf.base, &elm->base) > 0);

sys/vfs/hammer/hammer_btree.c

94

hammer_btree_elm_t elm, const char *s, int res);

sys/vfs/hammer/hammer_btree.c

983

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_btree.h

256

hammer_is_internal_node_elm(hammer_btree_elm_t elm)

sys/vfs/hammer/hammer_btree.h

258

switch (elm->base.btype) {

sys/vfs/hammer/hammer_btree.h

272

hammer_is_leaf_node_elm(hammer_btree_elm_t elm)

sys/vfs/hammer/hammer_btree.h

274

switch (elm->base.btype) {

sys/vfs/hammer/hammer_btree.h

296

hammer_elm_btype(hammer_btree_elm_t elm)

sys/vfs/hammer/hammer_btree.h

298

switch(elm->base.btype) {

sys/vfs/hammer/hammer_btree.h

303

return(elm->base.btype); /* ascii */

sys/vfs/hammer/hammer_cursor.c

495

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_cursor.c

507

elm = &parent->ondisk->elms[parent_index];

sys/vfs/hammer/hammer_cursor.c

510

cursor->left_bound = &elm[0].internal.base;

sys/vfs/hammer/hammer_cursor.c

511

cursor->right_bound = &elm[1].internal.base;

sys/vfs/hammer/hammer_cursor.c

618

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_cursor.c

639

elm = &node->ondisk->elms[cursor->parent_index];

sys/vfs/hammer/hammer_cursor.c

645

KKASSERT(elm->internal.subtree_offset != 0);

sys/vfs/hammer/hammer_cursor.c

646

cursor->left_bound = &elm[0].internal.base;

sys/vfs/hammer/hammer_cursor.c

647

cursor->right_bound = &elm[1].internal.base;

sys/vfs/hammer/hammer_cursor.c

649

elm->internal.subtree_offset, 0, &error);

sys/vfs/hammer/hammer_cursor.c

651

KASSERT(elm->base.btype == node->ondisk->type,

sys/vfs/hammer/hammer_cursor.c

653

elm->base.btype, node->ondisk->type, node));

sys/vfs/hammer/hammer_ioctl.c

1072

cursor.key_beg = data->elm;

sys/vfs/hammer/hammer_ioctl.c

280

hammer_btree_elm_t elm);

sys/vfs/hammer/hammer_ioctl.c

288

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_ioctl.c

388

elm = &cursor.node->ondisk->elms[cursor.index];

sys/vfs/hammer/hammer_ioctl.c

390

add_history(ip, hist, elm);

sys/vfs/hammer/hammer_ioctl.c

413

hammer_btree_elm_t elm)

sys/vfs/hammer/hammer_ioctl.c

417

if (elm->base.btype != HAMMER_BTREE_TYPE_RECORD)

sys/vfs/hammer/hammer_ioctl.c

424

if (hist->nxt_key > elm->leaf.base.key - elm->leaf.data_len &&

sys/vfs/hammer/hammer_ioctl.c

425

hist->key < elm->leaf.base.key - elm->leaf.data_len) {

sys/vfs/hammer/hammer_ioctl.c

426

hist->nxt_key = elm->leaf.base.key - elm->leaf.data_len;

sys/vfs/hammer/hammer_ioctl.c

428

if (hist->nxt_key > elm->leaf.base.key)

sys/vfs/hammer/hammer_ioctl.c

429

hist->nxt_key = elm->leaf.base.key;

sys/vfs/hammer/hammer_ioctl.c

435

if (elm->leaf.base.key >= MAXPHYS &&

sys/vfs/hammer/hammer_ioctl.c

436

elm->leaf.base.key - MAXPHYS > hist->key) {

sys/vfs/hammer/hammer_ioctl.c

443

if (elm->leaf.base.key - elm->leaf.data_len > hist->key)

sys/vfs/hammer/hammer_ioctl.c

450

if (hist->nxt_key > elm->leaf.base.key &&

sys/vfs/hammer/hammer_ioctl.c

451

hist->key < elm->leaf.base.key) {

sys/vfs/hammer/hammer_ioctl.c

452

hist->nxt_key = elm->leaf.base.key;

sys/vfs/hammer/hammer_ioctl.c

458

if (elm->leaf.base.key > hist->key)

sys/vfs/hammer/hammer_ioctl.c

467

elm->leaf.base.create_tid != hist->hist_ary[i - 1].tid) &&

sys/vfs/hammer/hammer_ioctl.c

468

elm->leaf.base.create_tid >= hist->beg_tid &&

sys/vfs/hammer/hammer_ioctl.c

469

elm->leaf.base.create_tid < hist->end_tid) {

sys/vfs/hammer/hammer_ioctl.c

471

hist->nxt_tid = elm->leaf.base.create_tid;

sys/vfs/hammer/hammer_ioctl.c

475

hist->hist_ary[i].tid = elm->leaf.base.create_tid;

sys/vfs/hammer/hammer_ioctl.c

476

hist->hist_ary[i].time32 = elm->leaf.create_ts;

sys/vfs/hammer/hammer_ioctl.c

490

if (elm->leaf.base.delete_tid &&

sys/vfs/hammer/hammer_ioctl.c

491

elm->leaf.base.delete_tid >= hist->beg_tid &&

sys/vfs/hammer/hammer_ioctl.c

492

elm->leaf.base.delete_tid < hist->end_tid) {

sys/vfs/hammer/hammer_ioctl.c

494

hist->nxt_tid = elm->leaf.base.delete_tid;

sys/vfs/hammer/hammer_ioctl.c

498

hist->hist_ary[i].tid = elm->leaf.base.delete_tid;

sys/vfs/hammer/hammer_ioctl.c

499

hist->hist_ary[i].time32 = elm->leaf.delete_ts;

sys/vfs/hammer/hammer_ioctl.h

458

struct hammer_base_elm elm; /* btree key to lookup */

sys/vfs/hammer/hammer_mirror.c

185

elm = &cursor.node->ondisk->elms[cursor.index].leaf;

sys/vfs/hammer/hammer_mirror.c

186

mirror->key_cur = elm->base;

sys/vfs/hammer/hammer_mirror.c

192

if (elm->base.create_tid > mirror->tid_end) {

sys/vfs/hammer/hammer_mirror.c

212

if (elm->base.create_tid < mirror->tid_beg) {

sys/vfs/hammer/hammer_mirror.c

225

mrec.rec.leaf = *elm;

sys/vfs/hammer/hammer_mirror.c

243

data_len = (elm->data_offset) ? elm->data_len : 0;

sys/vfs/hammer/hammer_mirror.c

274

mrec.rec.leaf = *elm;

sys/vfs/hammer/hammer_mirror.c

276

if (elm->base.delete_tid > mirror->tid_end)

sys/vfs/hammer/hammer_mirror.c

731

hammer_btree_leaf_elm_t elm;

sys/vfs/hammer/hammer_mirror.c

736

elm = &cursor->node->ondisk->elms[cursor->index].leaf;

sys/vfs/hammer/hammer_mirror.c

737

KKASSERT(elm->base.btype == HAMMER_BTREE_TYPE_RECORD);

sys/vfs/hammer/hammer_mirror.c

743

if (hammer_mirror_nomirror(&elm->base)) {

sys/vfs/hammer/hammer_mirror.c

752

if (elm->base.delete_tid == 0 &&

sys/vfs/hammer/hammer_mirror.c

753

elm->base.create_tid < mirror->tid_end) {

sys/vfs/hammer/hammer_mirror.c

79

hammer_btree_leaf_elm_t elm;

sys/vfs/hammer/hammer_object.c

104

hammer_rec_cmp(hammer_base_elm_t elm, hammer_record_t rec)

sys/vfs/hammer/hammer_object.c

106

if (elm->rec_type < rec->leaf.base.rec_type)

sys/vfs/hammer/hammer_object.c

108

if (elm->rec_type > rec->leaf.base.rec_type)

sys/vfs/hammer/hammer_object.c

111

if (elm->key < rec->leaf.base.key)

sys/vfs/hammer/hammer_object.c

113

if (elm->key > rec->leaf.base.key)

sys/vfs/hammer/hammer_object.c

1480

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_object.c

1504

elm = &cursor->node->ondisk->elms[cursor->index];

sys/vfs/hammer/hammer_object.c

1505

r = hammer_btree_cmp(&elm->base, &cursor->iprec->leaf.base);

sys/vfs/hammer/hammer_object.c

1589

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_object.c

1649

elm = &cursor->node->ondisk->elms[cursor->index];

sys/vfs/hammer/hammer_object.c

1650

r = hammer_btree_cmp(&elm->base,

sys/vfs/hammer/hammer_object.c

1734

elm = &cursor->node->ondisk->elms[cursor->index];

sys/vfs/hammer/hammer_object.c

1735

r = hammer_btree_cmp(&elm->base, &cursor->iprec->leaf.base);

sys/vfs/hammer/hammer_object.c

1746

int64_t base1 = elm->leaf.base.key - elm->leaf.data_len;

sys/vfs/hammer/hammer_object.c

2431

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_object.c

2446

elm = &node->ondisk->elms[cursor->index];

sys/vfs/hammer/hammer_object.c

2447

leaf = &elm->leaf;

sys/vfs/hammer/hammer_object.c

2448

KKASSERT(elm->base.btype == HAMMER_BTREE_TYPE_RECORD);

sys/vfs/hammer/hammer_object.c

2460

if (elm->base.rec_type == HAMMER_RECTYPE_INODE) {

sys/vfs/hammer/hammer_object.c

2461

if (elm->leaf.base.delete_tid == 0 && delete_tid)

sys/vfs/hammer/hammer_object.c

2463

if (elm->leaf.base.delete_tid && delete_tid == 0)

sys/vfs/hammer/hammer_object.c

2467

hammer_modify_node(trans, node, elm, sizeof(*elm));

sys/vfs/hammer/hammer_object.c

2468

elm->leaf.base.delete_tid = delete_tid;

sys/vfs/hammer/hammer_object.c

2469

elm->leaf.delete_ts = delete_ts;

sys/vfs/hammer/hammer_object.c

2472

if (elm->leaf.base.delete_tid > node->ondisk->mirror_tid) {

sys/vfs/hammer/hammer_object.c

2474

node->ondisk->mirror_tid = elm->leaf.base.delete_tid;

sys/vfs/hammer/hammer_object.c

2479

(intmax_t)elm->leaf.base.delete_tid,

sys/vfs/hammer/hammer_object.c

2501

KKASSERT(elm->leaf.base.delete_tid !=

sys/vfs/hammer/hammer_object.c

2502

elm->leaf.base.create_tid);

sys/vfs/hammer/hammer_object.c

2512

data_offset = elm->leaf.data_offset;

sys/vfs/hammer/hammer_object.c

2513

data_len = elm->leaf.data_len;

sys/vfs/hammer/hammer_object.c

2515

save_leaf = elm->leaf;

sys/vfs/hammer/hammer_object.c

2518

if (elm->base.rec_type == HAMMER_RECTYPE_INODE &&

sys/vfs/hammer/hammer_object.c

2519

elm->leaf.base.delete_tid == 0) {

sys/vfs/hammer/hammer_pfs.c

510

hammer_btree_leaf_elm_t elm;

sys/vfs/hammer/hammer_pfs.c

513

elm = &cursor->node->ondisk->elms[cursor->index].leaf;

sys/vfs/hammer/hammer_pfs.c

514

if (elm->base.create_tid < trunc_tid &&

sys/vfs/hammer/hammer_pfs.c

515

elm->base.delete_tid < trunc_tid) {

sys/vfs/hammer/hammer_pfs.c

519

if (elm->base.create_tid >= trunc_tid) {

sys/vfs/hammer/hammer_pfs.c

524

} else if (elm->base.delete_tid >= trunc_tid) {

sys/vfs/hammer/hammer_prune.c

153

elm = &cursor.node->ondisk->elms[cursor.index].leaf;

sys/vfs/hammer/hammer_prune.c

154

prune->key_cur = elm->base;

sys/vfs/hammer/hammer_prune.c

170

if (prune->stat_oldest_tid > elm->base.create_tid)

sys/vfs/hammer/hammer_prune.c

171

prune->stat_oldest_tid = elm->base.create_tid;

sys/vfs/hammer/hammer_prune.c

175

(intmax_t)elm->base.obj_id,

sys/vfs/hammer/hammer_prune.c

176

(intmax_t)elm->base.key,

sys/vfs/hammer/hammer_prune.c

177

(intmax_t)elm->base.create_tid,

sys/vfs/hammer/hammer_prune.c

178

(intmax_t)elm->base.delete_tid);

sys/vfs/hammer/hammer_prune.c

181

if (prune_should_delete(prune, elm)) {

sys/vfs/hammer/hammer_prune.c

184

(intmax_t)elm->base.obj_id,

sys/vfs/hammer/hammer_prune.c

185

(intmax_t)elm->base.key);

sys/vfs/hammer/hammer_prune.c

198

isdir = (elm->base.rec_type == HAMMER_RECTYPE_DIRENTRY);

sys/vfs/hammer/hammer_prune.c

227

prune_check_nlinks(&cursor, elm);

sys/vfs/hammer/hammer_prune.c

231

(intmax_t)elm->base.obj_id,

sys/vfs/hammer/hammer_prune.c

232

(intmax_t)elm->base.key);

sys/vfs/hammer/hammer_prune.c

273

prune_should_delete(struct hammer_ioc_prune *prune, hammer_btree_leaf_elm_t elm)

sys/vfs/hammer/hammer_prune.c

283

if (elm->base.delete_tid != 0)

sys/vfs/hammer/hammer_prune.c

294

if (elm->base.create_tid >= scan->end_tid ||

sys/vfs/hammer/hammer_prune.c

295

elm->base.delete_tid > scan->end_tid) {

sys/vfs/hammer/hammer_prune.c

302

if (elm->base.delete_tid &&

sys/vfs/hammer/hammer_prune.c

303

elm->base.create_tid >= scan->beg_tid &&

sys/vfs/hammer/hammer_prune.c

304

elm->base.delete_tid <= scan->end_tid &&

sys/vfs/hammer/hammer_prune.c

305

(elm->base.create_tid - scan->beg_tid) / scan->mod_tid ==

sys/vfs/hammer/hammer_prune.c

306

(elm->base.delete_tid - scan->beg_tid) / scan->mod_tid) {

sys/vfs/hammer/hammer_prune.c

321

prune_check_nlinks(hammer_cursor_t cursor, hammer_btree_leaf_elm_t elm)

sys/vfs/hammer/hammer_prune.c

326

if (elm->base.rec_type != HAMMER_RECTYPE_INODE)

sys/vfs/hammer/hammer_prune.c

328

if (elm->base.delete_tid != 0)

sys/vfs/hammer/hammer_prune.c

335

ip = hammer_get_inode(cursor->trans, NULL, elm->base.obj_id,

sys/vfs/hammer/hammer_prune.c

337

elm->base.localization & HAMMER_LOCALIZE_PSEUDOFS_MASK,

sys/vfs/hammer/hammer_prune.c

342

(intmax_t)elm->base.obj_id);

sys/vfs/hammer/hammer_prune.c

348

(intmax_t)elm->base.obj_id);

sys/vfs/hammer/hammer_prune.c

48

hammer_btree_leaf_elm_t elm);

sys/vfs/hammer/hammer_prune.c

50

hammer_btree_leaf_elm_t elm);

sys/vfs/hammer/hammer_prune.c

57

hammer_btree_leaf_elm_t elm;

sys/vfs/hammer/hammer_rebalance.c

194

elm = &cursor.node->ondisk->elms[cursor.index].leaf;

sys/vfs/hammer/hammer_rebalance.c

195

rebal->key_cur = elm->base;

sys/vfs/hammer/hammer_rebalance.c

274

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_rebalance.c

378

elm = &lockroot.node->ondisk->elms[

sys/vfs/hammer/hammer_rebalance.c

381

elm = &node->ondisk->elms[i];

sys/vfs/hammer/hammer_rebalance.c

383

rebalance_closeout(base_item, base_count, elm);

sys/vfs/hammer/hammer_rebalance.c

40

hammer_btree_elm_t elm);

sys/vfs/hammer/hammer_rebalance.c

406

elm = &base_item->copy->elms[base_count];

sys/vfs/hammer/hammer_rebalance.c

407

*elm = node->ondisk->elms[i];

sys/vfs/hammer/hammer_rebalance.c

475

elm = &lockroot.node->ondisk->elms[lockroot.node->ondisk->count];

sys/vfs/hammer/hammer_rebalance.c

476

rebalance_closeout(base_item, base_count, elm);

sys/vfs/hammer/hammer_rebalance.c

480

lockroot.copy->elms[root_count] = *elm;

sys/vfs/hammer/hammer_rebalance.c

527

hammer_btree_elm_t elm)

sys/vfs/hammer/hammer_rebalance.c

566

if (bcmp(base_elm, elm, sizeof(*elm)) != 0 ||

sys/vfs/hammer/hammer_rebalance.c

567

elm->internal.subtree_offset ||

sys/vfs/hammer/hammer_rebalance.c

568

elm->internal.mirror_tid ||

sys/vfs/hammer/hammer_rebalance.c

569

elm->base.btype) {

sys/vfs/hammer/hammer_rebalance.c

570

*base_elm = *elm;

sys/vfs/hammer/hammer_rebalance.c

59

hammer_btree_leaf_elm_t elm;

sys/vfs/hammer/hammer_rebalance.c

590

if (bcmp(&rbound_elm->base, &elm->base, sizeof(elm->base)) != 0) {

sys/vfs/hammer/hammer_rebalance.c

592

rbound_elm->base = elm->base;

sys/vfs/hammer/hammer_reblock.c

147

elm = &cursor.node->ondisk->elms[cursor.index];

sys/vfs/hammer/hammer_reblock.c

148

reblock->key_cur.obj_id = elm->base.obj_id;

sys/vfs/hammer/hammer_reblock.c

149

reblock->key_cur.localization = elm->base.localization;

sys/vfs/hammer/hammer_reblock.c

197

error = hammer_reblock_helper(reblock, &cursor, elm);

sys/vfs/hammer/hammer_reblock.c

260

hammer_cursor_t cursor, hammer_btree_elm_t elm)

sys/vfs/hammer/hammer_reblock.c

281

if (elm->leaf.base.btype != HAMMER_BTREE_TYPE_RECORD)

sys/vfs/hammer/hammer_reblock.c

283

tmp_offset = elm->leaf.data_offset;

sys/vfs/hammer/hammer_reblock.c

299

switch(elm->leaf.base.rec_type) {

sys/vfs/hammer/hammer_reblock.c

321

reblock->data_byte_count += elm->leaf.data_len;

sys/vfs/hammer/hammer_reblock.c

344

leaf = elm->leaf;

sys/vfs/hammer/hammer_reblock.c

356

elm = &ondisk->elms[cursor->index];

sys/vfs/hammer/hammer_reblock.c

364

} else if (bcmp(&elm->leaf, &leaf, sizeof(leaf))) {

sys/vfs/hammer/hammer_reblock.c

373

cursor, elm);

sys/vfs/hammer/hammer_reblock.c

377

reblock->data_byte_moves += elm->leaf.data_len;

sys/vfs/hammer/hammer_reblock.c

422

elm = &cursor->parent->ondisk->elms[cursor->parent_index];

sys/vfs/hammer/hammer_reblock.c

424

elm = NULL;

sys/vfs/hammer/hammer_reblock.c

429

reblock, cursor, elm);

sys/vfs/hammer/hammer_reblock.c

433

reblock, cursor, elm);

sys/vfs/hammer/hammer_reblock.c

455

hammer_cursor_t cursor, hammer_btree_elm_t elm)

sys/vfs/hammer/hammer_reblock.c

467

ndata = hammer_alloc_data(cursor->trans, elm->leaf.data_len,

sys/vfs/hammer/hammer_reblock.c

468

elm->leaf.base.rec_type,

sys/vfs/hammer/hammer_reblock.c

48

hammer_btree_elm_t elm);

sys/vfs/hammer/hammer_reblock.c

487

bcopy(cursor->data, ndata, elm->leaf.data_len);

sys/vfs/hammer/hammer_reblock.c

489

&elm->leaf);

sys/vfs/hammer/hammer_reblock.c

494

elm->leaf.data_offset, elm->leaf.data_len);

sys/vfs/hammer/hammer_reblock.c

497

&elm->leaf.data_offset, sizeof(hammer_off_t));

sys/vfs/hammer/hammer_reblock.c

498

odata_offset = elm->leaf.data_offset;

sys/vfs/hammer/hammer_reblock.c

499

elm->leaf.data_offset = ndata_offset;

sys/vfs/hammer/hammer_reblock.c

50

hammer_cursor_t cursor, hammer_btree_elm_t elm);

sys/vfs/hammer/hammer_reblock.c

500

elm->leaf.data_crc = ncrc;

sys/vfs/hammer/hammer_reblock.c

505

(elm ? elm->base.localization : -1),

sys/vfs/hammer/hammer_reblock.c

52

hammer_cursor_t cursor, hammer_btree_elm_t elm);

sys/vfs/hammer/hammer_reblock.c

523

hammer_cursor_t cursor, hammer_btree_elm_t elm)

sys/vfs/hammer/hammer_reblock.c

54

hammer_cursor_t cursor, hammer_btree_elm_t elm);

sys/vfs/hammer/hammer_reblock.c

542

hammer_move_node(cursor, elm, onode, nnode);

sys/vfs/hammer/hammer_reblock.c

55

static void hammer_move_node(hammer_cursor_t cursor, hammer_btree_elm_t elm,

sys/vfs/hammer/hammer_reblock.c

555

(elm ? elm->base.localization : -1),

sys/vfs/hammer/hammer_reblock.c

577

hammer_cursor_t cursor, hammer_btree_elm_t elm)

sys/vfs/hammer/hammer_reblock.c

602

hammer_move_node(cursor, elm, onode, nnode);

sys/vfs/hammer/hammer_reblock.c

615

(elm ? elm->base.localization : -1),

sys/vfs/hammer/hammer_reblock.c

63

hammer_btree_elm_t elm;

sys/vfs/hammer/hammer_reblock.c

636

hammer_move_node(hammer_cursor_t cursor, hammer_btree_elm_t elm,

sys/vfs/hammer/hammer_reblock.c

646

if (elm) {

sys/vfs/hammer/hammer_reblock.c

650

KKASSERT(hammer_is_internal_node_elm(elm));

sys/vfs/hammer/hammer_reblock.c

652

&elm->internal.subtree_offset,

sys/vfs/hammer/hammer_reblock.c

653

sizeof(elm->internal.subtree_offset));

sys/vfs/hammer/hammer_reblock.c

654

elm->internal.subtree_offset = nnode->node_offset;

sys/vfs/hammer2/hammer2.h

1609

hammer2_blockref_t *elm);

sys/vfs/hammer2/hammer2_chain.c

5115

hammer2_blockref_t *elm = &chain->bref;

sys/vfs/hammer2/hammer2_chain.c

5128

elm->key, elm->key);

sys/vfs/hammer2/hammer2_chain.c

5131

scan->key != elm->key ||

sys/vfs/hammer2/hammer2_chain.c

5133

scan->keybits != elm->keybits)) {

sys/vfs/hammer2/hammer2_chain.c

5136

base, i, count, elm);

sys/vfs/hammer2/hammer2_chain.c

5225

hammer2_chain_t *chain, hammer2_blockref_t *elm)

sys/vfs/hammer2/hammer2_chain.c

5244

elm->key, elm->key);

sys/vfs/hammer2/hammer2_chain.c

5261

if ((int)(elm->data_off & HAMMER2_OFF_MASK_RADIX)) {

sys/vfs/hammer2/hammer2_chain.c

5263

(int)(elm->data_off & HAMMER2_OFF_MASK_RADIX);

sys/vfs/hammer2/hammer2_chain.c

5265

switch(elm->type) {

sys/vfs/hammer2/hammer2_chain.c

5274

if (elm->type != HAMMER2_BREF_TYPE_DATA) {

sys/vfs/hammer2/hammer2_chain.c

5276

elm->embed.stats.data_count;

sys/vfs/hammer2/hammer2_chain.c

5278

elm->embed.stats.inode_count;

sys/vfs/hammer2/hammer2_chain.c

5280

if (elm->type == HAMMER2_BREF_TYPE_INODE)

sys/vfs/hammer2/hammer2_chain.c

5282

if (parent->bref.leaf_count + elm->leaf_count <

sys/vfs/hammer2/hammer2_chain.c

5284

parent->bref.leaf_count += elm->leaf_count;

sys/vfs/hammer2/hammer2_chain.c

5303

base[i] = *elm;

sys/vfs/hammer2/hammer2_chain.c

5307

xkey = elm->key + ((hammer2_key_t)1 << elm->keybits) - 1;

sys/vfs/hammer2/hammer2_chain.c

5308

if (i != count && (base[i].key < elm->key || xkey >= base[i].key)) {

sys/vfs/hammer2/hammer2_chain.c

5311

base, i, elm);

sys/vfs/hammer2/hammer2_chain.c

5323

base[j] = *elm;

sys/vfs/hammer2/hammer2_chain.c

5327

base[i - 1] = *elm;

sys/vfs/hammer2/hammer2_chain.c

5335

base[i] = *elm;

sys/vfs/hammer2/hammer2_vfsops.c

2173

struct hammer2_recovery_elm *elm;

sys/vfs/hammer2/hammer2_vfsops.c

2198

while ((elm = TAILQ_FIRST(&info.list)) != NULL) {

sys/vfs/hammer2/hammer2_vfsops.c

2199

TAILQ_REMOVE(&info.list, elm, entry);

sys/vfs/hammer2/hammer2_vfsops.c

2200

parent = elm->chain;

sys/vfs/hammer2/hammer2_vfsops.c

2201

sync_tid = elm->sync_tid;

sys/vfs/hammer2/hammer2_vfsops.c

2202

kfree(elm, M_HAMMER2);

sys/vfs/hammer2/hammer2_vfsops.c

2282

struct hammer2_recovery_elm *elm;

sys/vfs/hammer2/hammer2_vfsops.c

2284

elm = kmalloc(sizeof(*elm), M_HAMMER2, M_ZERO | M_WAITOK);

sys/vfs/hammer2/hammer2_vfsops.c

2285

elm->chain = parent;

sys/vfs/hammer2/hammer2_vfsops.c

2286

elm->sync_tid = sync_tid;

sys/vfs/hammer2/hammer2_vfsops.c

2288

TAILQ_INSERT_TAIL(&info->list, elm, entry);

test/debug/vmpagehash.c

160

struct vm_page_hash_elm *elm;

test/debug/vmpagehash.c

162

elm = &vm_page_hash[i];

test/debug/vmpagehash.c

165

if (elm[0].m && elm[1].m && elm[2].m && elm[3].m)

test/debug/vmpagehash.c

169

printf(" %016jx %9d ", elm->m, elm->ticks);

test/debug/vmpagehash.c

171

if (elm->m) {

test/debug/vmpagehash.c

172

kkread_vmpage(kd, (u_long)elm->m, &m);

test/debug/vmpagehash.c

175

checkpage(kd, elm->m, &m, &obj);

test/sysperf/exec1.c

20

char *elm;

test/sysperf/exec1.c

22

if ((elm = strrchr(Av0, '/')) == NULL)

test/sysperf/exec1.c

23

elm = Av0;

test/sysperf/exec1.c

25

++elm;

test/sysperf/exec1.c

28

execl(Av0, elm, "dummy", NULL);

usr.bin/flame_graph/process.c

125

elm_t *elm;

usr.bin/flame_graph/process.c

129

for (elm = elm_hash_array[i]; elm; elm = elm->next) {

usr.bin/flame_graph/process.c

131

elm->ticks,

usr.bin/flame_graph/process.c

132

(double)elm->ticks * 100.0 /

usr.bin/flame_graph/process.c

134

(int)elm->idlen, (int)elm->idlen, elm->id);

usr.bin/flame_graph/process.c

38

struct elm *next;

usr.bin/flame_graph/process.c

59

elm_t *elm;

usr.bin/flame_graph/process.c

70

elm = elm_lookup(s);

usr.bin/flame_graph/process.c

72

++elm->ticks;

usr.bin/monitor/monitor.c

121

monitor_elm_t elm;

usr.bin/monitor/monitor.c

125

elm = malloc(sizeof(*elm));

usr.bin/monitor/monitor.c

126

bzero(elm, sizeof(*elm));

usr.bin/monitor/monitor.c

127

elm->path = path;

usr.bin/monitor/monitor.c

128

elm->fd = open(path, O_RDONLY);

usr.bin/monitor/monitor.c

129

if (elm->fd < 0) {

usr.bin/monitor/monitor.c

133

EV_SET(&kev, elm->fd, EVFILT_VNODE, EV_ADD|EV_ENABLE|EV_CLEAR,

usr.bin/monitor/monitor.c

143

if (elm->fd >= NumFiles) {

usr.bin/monitor/monitor.c

144

MaxFiles = (elm->fd + 16) * 3 / 2;

usr.bin/monitor/monitor.c

145

Elms = realloc(Elms, MaxFiles * sizeof(elm));

usr.bin/monitor/monitor.c

146

bzero(&Elms[NumFiles], (MaxFiles - NumFiles) * sizeof(elm));

usr.bin/monitor/monitor.c

149

Elms[elm->fd] = elm;

usr.bin/monitor/monitor.c

158

monitor_elm_t elm;

usr.bin/monitor/monitor.c

167

elm = Elms[kev->ident];

usr.bin/monitor/monitor.c

168

printf("%-23s", elm->path);

usr.bin/systat/netbw.c

164

static void netbwline(int row, struct mytcpcb *elm, double delta_time);

usr.bin/systat/netbw.c

173

((double)(tcp_seq_diff_t)(elm->xtcp.field - \

usr.bin/systat/netbw.c

174

elm->last_xtcp.field) / \

usr.bin/systat/netbw.c

178

((double)((tcp_seq_diff_t)(elm->xtcp.field - \

usr.bin/systat/netbw.c

179

elm->last_xtcp.field) << scale) / \

usr.bin/systat/netbw.c

284

struct mytcpcb *elm;

usr.bin/systat/netbw.c

304

RB_FOREACH(elm, mytcpcb_tree, &mytcp_tree) {

usr.bin/systat/netbw.c

310

if (elm->seq == tcp_pcb_seq &&

usr.bin/systat/netbw.c

311

(elm->xtcp.xt_socket.so_rcv.sb_cc ||

usr.bin/systat/netbw.c

312

elm->xtcp.xt_socket.so_snd.sb_cc ||

usr.bin/systat/netbw.c

317

netbwline(row, elm, delta_time);

usr.bin/systat/netbw.c

319

} else if (elm->seq != tcp_pcb_seq) {

usr.bin/systat/netbw.c

320

delm = elm;

usr.bin/systat/netbw.c

338

netbwline(int row, struct mytcpcb *elm, double delta_time)

usr.bin/systat/netbw.c

346

elm->xtcp.xt_inp.inp_af,

usr.bin/systat/netbw.c

347

&elm->xtcp.xt_inp.inp_inc.inc_ie.

usr.bin/systat/netbw.c

349

ntohs(elm->xtcp.xt_inp.inp_inc.inc_ie.ie_lport)),

usr.bin/systat/netbw.c

351

elm->xtcp.xt_inp.inp_af,

usr.bin/systat/netbw.c

352

&elm->xtcp.xt_inp.inp_inc.inc_ie.

usr.bin/systat/netbw.c

354

ntohs(elm->xtcp.xt_inp.inp_inc.inc_ie.ie_fport)),

usr.bin/systat/netbw.c

361

(elm->xtcp.xt_socket.so_rcv.sb_cc > 15000 ?

usr.bin/systat/netbw.c

363

(elm->xtcp.xt_socket.so_snd.sb_cc > 15000 ?

usr.bin/systat/netbw.c

365

((elm->xtcp.xt_tp.t_flags & TF_NODELAY) ?

usr.bin/systat/netbw.c

367

((elm->xtcp.xt_tp.t_flags & TF_RCVD_TSTMP) ?

usr.bin/systat/netbw.c

369

((elm->xtcp.xt_tp.t_flags &

usr.bin/systat/netbw.c

372

((elm->xtcp.xt_tp.t_flags & TF_RCVD_SCALE) ?

usr.bin/systat/netbw.c

374

((elm->xtcp.xt_tp.t_flags & TF_FASTRECOVERY) ?

usr.bin/systat/netbw.c

473

struct mytcpcb *elm;

usr.bin/systat/netbw.c

476

if ((elm = RB_FIND(mytcpcb_tree, &mytcp_tree, &dummy)) == NULL) {

usr.bin/systat/netbw.c

477

elm = malloc(sizeof(*elm));

usr.bin/systat/netbw.c

478

bzero(elm, sizeof(*elm));

usr.bin/systat/netbw.c

479

elm->xtcp = *xtcp;

usr.bin/systat/netbw.c

480

elm->last_xtcp = *xtcp;

usr.bin/systat/netbw.c

481

RB_INSERT(mytcpcb_tree, &mytcp_tree, elm);

usr.bin/systat/netbw.c

483

elm->last_xtcp = elm->xtcp;

usr.bin/systat/netbw.c

484

elm->xtcp = *xtcp;

usr.bin/systat/netbw.c

486

elm->seq = tcp_pcb_seq;

usr.bin/systat/pftop.c

197

(be64toh(*(uint64_t *)elm->state.field))

usr.bin/systat/pftop.c

199

((double)(be64toh(*(uint64_t *)elm->state.field) - \

usr.bin/systat/pftop.c

200

be64toh(*(uint64_t *)elm->last_state.field)) / delta_time)

usr.bin/systat/pftop.c

296

struct mypfstate *elm;

usr.bin/systat/pftop.c

321

RB_FOREACH(elm, mypfstate_tree, &mypf_tree) {

usr.bin/systat/pftop.c

328

if (elm->seq == tcp_pcb_seq && elm->save_bw > 0) {

usr.bin/systat/pftop.c

329

array[i++] = elm;

usr.bin/systat/pftop.c

334

} else if (elm->seq != tcp_pcb_seq) {

usr.bin/systat/pftop.c

335

delm = elm;

usr.bin/systat/pftop.c

350

elm = array[i];

usr.bin/systat/pftop.c

351

if (elm->state.direction == PF_OUT) {

usr.bin/systat/pftop.c

352

nk = &elm->state.key[PF_SK_WIRE];

usr.bin/systat/pftop.c

356

nk = &elm->state.key[PF_SK_STACK];

usr.bin/systat/pftop.c

365

statestr(elm->state.proto),

usr.bin/systat/pftop.c

366

netaddrstr(elm->state.af, &nk->addr[0], nk->port[0]),

usr.bin/systat/pftop.c

367

netaddrstr(elm->state.af, &nk->addr[1], nk->port[1]),

usr.bin/systat/pftop.c

377

statestr(elm->state.proto),

usr.bin/systat/pftop.c

378

netaddrstr(elm->state.af, &nk->addr[0], nk->port[0]),

usr.bin/systat/pftop.c

379

netaddrstr(elm->state.af, &nk->addr[1], nk->port[1]),

usr.bin/systat/pftop.c

380

be64toh(*(uint64_t *)elm->state.bytes[0]),

usr.bin/systat/pftop.c

381

be64toh(*(uint64_t *)elm->last_state.bytes[0]),

usr.bin/systat/pftop.c

382

be64toh(*(uint64_t *)elm->state.bytes[1]),

usr.bin/systat/pftop.c

383

be64toh(*(uint64_t *)elm->last_state.bytes[1])

usr.bin/systat/pftop.c

520

struct mypfstate *elm;

usr.bin/systat/pftop.c

523

if ((elm = RB_FIND(mypfstate_tree, &mypf_tree, &dummy)) == NULL) {

usr.bin/systat/pftop.c

524

elm = malloc(sizeof(*elm));

usr.bin/systat/pftop.c

525

bzero(elm, sizeof(*elm));

usr.bin/systat/pftop.c

526

elm->state = *state;

usr.bin/systat/pftop.c

527

elm->last_state = *state;

usr.bin/systat/pftop.c

528

elm->best_bw = DELTARATE(bytes[0]) + DELTARATE(bytes[1]);

usr.bin/systat/pftop.c

529

elm->save_bw = elm->best_bw;

usr.bin/systat/pftop.c

530

bzero(elm->last_state.bytes,

usr.bin/systat/pftop.c

531

sizeof(elm->last_state.bytes));

usr.bin/systat/pftop.c

532

bzero(elm->last_state.packets,

usr.bin/systat/pftop.c

533

sizeof(elm->last_state.packets));

usr.bin/systat/pftop.c

534

RB_INSERT(mypfstate_tree, &mypf_tree, elm);

usr.bin/systat/pftop.c

535

if (highestbw < elm->save_bw)

usr.bin/systat/pftop.c

536

highestbw = elm->save_bw;

usr.bin/systat/pftop.c

538

elm->last_state = elm->state;

usr.bin/systat/pftop.c

539

elm->state = *state;

usr.bin/systat/pftop.c

540

elm->best_bw = DELTARATE(bytes[0]) + DELTARATE(bytes[1]);

usr.bin/systat/pftop.c

541

if (elm->save_bw < elm->best_bw)

usr.bin/systat/pftop.c

542

elm->save_bw = elm->best_bw;

usr.bin/systat/pftop.c

544

elm->save_bw = (elm->save_bw * 7 + elm->best_bw) / 8;

usr.bin/systat/pftop.c

545

if (highestbw < elm->save_bw)

usr.bin/systat/pftop.c

546

highestbw = elm->save_bw;

usr.bin/systat/pftop.c

548

elm->seq = tcp_pcb_seq;

usr.bin/undo/undo.c

414

const char *elm;

usr.bin/undo/undo.c

453

if ((elm = strrchr(filename, '/')) != NULL)

usr.bin/undo/undo.c

454

++elm;

usr.bin/undo/undo.c

456

elm = filename;

usr.bin/undo/undo.c

463

asprintf(&path, OutFileName, elm);

usr.sbin/makefs/hammer2/hammer2.h

1657

hammer2_blockref_t *elm);

usr.sbin/makefs/hammer2/hammer2_chain.c

5121

hammer2_blockref_t *elm = &chain->bref;

usr.sbin/makefs/hammer2/hammer2_chain.c

5134

elm->key, elm->key);

usr.sbin/makefs/hammer2/hammer2_chain.c

5137

scan->key != elm->key ||

usr.sbin/makefs/hammer2/hammer2_chain.c

5139

scan->keybits != elm->keybits)) {

usr.sbin/makefs/hammer2/hammer2_chain.c

5142

base, i, count, elm);

usr.sbin/makefs/hammer2/hammer2_chain.c

5231

hammer2_chain_t *chain, hammer2_blockref_t *elm)

usr.sbin/makefs/hammer2/hammer2_chain.c

5250

elm->key, elm->key);

usr.sbin/makefs/hammer2/hammer2_chain.c

5267

if ((int)(elm->data_off & HAMMER2_OFF_MASK_RADIX)) {

usr.sbin/makefs/hammer2/hammer2_chain.c

5269

(int)(elm->data_off & HAMMER2_OFF_MASK_RADIX);

usr.sbin/makefs/hammer2/hammer2_chain.c

5271

switch(elm->type) {

usr.sbin/makefs/hammer2/hammer2_chain.c

5280

if (elm->type != HAMMER2_BREF_TYPE_DATA) {

usr.sbin/makefs/hammer2/hammer2_chain.c

5282

elm->embed.stats.data_count;

usr.sbin/makefs/hammer2/hammer2_chain.c

5284

elm->embed.stats.inode_count;

usr.sbin/makefs/hammer2/hammer2_chain.c

5286

if (elm->type == HAMMER2_BREF_TYPE_INODE)

usr.sbin/makefs/hammer2/hammer2_chain.c

5288

if (parent->bref.leaf_count + elm->leaf_count <

usr.sbin/makefs/hammer2/hammer2_chain.c

5290

parent->bref.leaf_count += elm->leaf_count;

usr.sbin/makefs/hammer2/hammer2_chain.c

5309

base[i] = *elm;

usr.sbin/makefs/hammer2/hammer2_chain.c

5313

xkey = elm->key + ((hammer2_key_t)1 << elm->keybits) - 1;

usr.sbin/makefs/hammer2/hammer2_chain.c

5314

if (i != count && (base[i].key < elm->key || xkey >= base[i].key)) {

usr.sbin/makefs/hammer2/hammer2_chain.c

5317

base, i, elm);

usr.sbin/makefs/hammer2/hammer2_chain.c

5329

base[j] = *elm;

usr.sbin/makefs/hammer2/hammer2_chain.c

5333

base[i - 1] = *elm;

usr.sbin/makefs/hammer2/hammer2_chain.c

5341

base[i] = *elm;

usr.sbin/makefs/hammer2/hammer2_vfsops.c

2139

struct hammer2_recovery_elm *elm;

usr.sbin/makefs/hammer2/hammer2_vfsops.c

2164

while ((elm = TAILQ_FIRST(&info.list)) != NULL) {

usr.sbin/makefs/hammer2/hammer2_vfsops.c

2165

TAILQ_REMOVE(&info.list, elm, entry);

usr.sbin/makefs/hammer2/hammer2_vfsops.c

2166

parent = elm->chain;

usr.sbin/makefs/hammer2/hammer2_vfsops.c

2167

sync_tid = elm->sync_tid;

usr.sbin/makefs/hammer2/hammer2_vfsops.c

2168

kfree(elm, M_HAMMER2);

usr.sbin/makefs/hammer2/hammer2_vfsops.c

2248

struct hammer2_recovery_elm *elm;

usr.sbin/makefs/hammer2/hammer2_vfsops.c

2250

elm = kmalloc(sizeof(*elm), M_HAMMER2, M_ZERO | M_WAITOK);

usr.sbin/makefs/hammer2/hammer2_vfsops.c

2251

elm->chain = parent;

usr.sbin/makefs/hammer2/hammer2_vfsops.c

2252

elm->sync_tid = sync_tid;

usr.sbin/makefs/hammer2/hammer2_vfsops.c

2254

TAILQ_INSERT_TAIL(&info->list, elm, entry);