Page MenuHomeFreeBSD
Differential D16696

Add efidev(4)/efirt(9)
ClosedPublic
Actions

Authored by kevans on Aug 12 2018, 5:39 PM.
Tags
None
Referenced Files
Unknown Object (File)
Mon, Mar 17, 3:31 AM
Unknown Object (File)
Mon, Mar 10, 5:56 PM
Unknown Object (File)
Jan 14 2025, 4:37 PM
Unknown Object (File)
Jan 9 2025, 9:53 AM
Unknown Object (File)
Jan 2 2025, 7:23 AM
Unknown Object (File)
Dec 31 2024, 10:05 PM
Unknown Object (File)
Dec 31 2024, 9:12 PM
Unknown Object (File)
Dec 30 2024, 9:01 PM
View All 95 Files
Subscribers
bjk

Details

Reviewers
kib
imp
• ian
Group Reviewers
manpages
Commits
rS337957: Add efidev(4)/efirt(9)
Summary

Document efidev(4), provider of userland access to EFI Runtime Services. A link is created to efirtc(4), which handles the time-of-day clock side.

efirt(9) is the kernel side of this.

Diff Detail

Repository
rS FreeBSD src repository - subversion
Lint
Lint Skipped
Unit
Tests Skipped
Build Status
Buildable 18750

Event Timeline

kevans created this revision.Aug 12 2018, 5:39 PM
Herald added a reviewer: manpages. · View Herald TranscriptAug 12 2018, 5:39 PM
Harbormaster completed remote builds in B18750: Diff 46604.Aug 12 2018, 5:39 PM
kib added a comment.Aug 12 2018, 5:53 PM

You probably should mention that efirt is only available on amd64 and arm64.

share/man/man4/efidev.4
141

Perhaps this should go into efirt(9) instead.

kevans added inline comments.Aug 12 2018, 7:56 PM
share/man/man4/efidev.4
141

Ahh, good point. I'll split these up tonight, mention the availability, and resubmit.

kevans updated this revision to Diff 46610.Aug 13 2018, 12:37 AM

Split efirt(9) out, leaving efidev(4)/efirtc(4) intact and adding a mention of efirt(9) there.

efirt(9)'s content has been restructured to fit section 9 a little better, but otherwise remains mostly the same as it was worded in efidev(4).

Harbormaster completed remote builds in B18755: Diff 46610.Aug 13 2018, 12:37 AM
kib accepted this revision.Aug 13 2018, 3:26 PM
kib added inline comments.
share/man/man9/efirt.9
77 ↗(On Diff #46610)

function returns 0 if ...

This revision is now accepted and ready to land.Aug 13 2018, 3:26 PM
bjk added a subscriber: bjk.Aug 15 2018, 2:56 AM
bjk added inline comments.
share/man/man9/efirt.9
242 ↗(On Diff #46610)

typo: variable

kevans updated this revision to Diff 46734.Aug 15 2018, 8:02 PM
kevans retitled this revision from efidev(4): Initial stab at a man page to Add efidev(4)/efirt(9).
kevans edited the summary of this revision. (Show Details)

Fix mis-phrasing and typos pointed out by @kib and @bjk, rewrite title and summary.

This revision now requires review to proceed.Aug 15 2018, 8:02 PM
Harbormaster completed remote builds in B18826: Diff 46734.Aug 15 2018, 8:03 PM
imp accepted this revision.Aug 15 2018, 8:10 PM
This revision is now accepted and ready to land.Aug 15 2018, 8:10 PM
Closed by commit rS337957: Add efidev(4)/efirt(9) (authored by kevans). · Explain WhyAug 17 2018, 4:18 AM
This revision was automatically updated to reflect the committed changes.

Revision Contents
Changeset List

PathSize
lib/
libefivar/
2 lines
share/
man/
man4/
7 lines
317 lines

Diff 46604

View Options

lib/libefivar/efivar.3

Show First 20 Lines • Show All 80 Lines • ▼ Show 20 Lines
static __inline uint64_t * \ static __inline uint64_t * \
name##_PCTRIE_PTR2VAL(struct type *ptr) \ name##_PCTRIE_PTR2VAL(struct type *ptr) \
{ \ { \
\ \
return &ptr->field; \ return &ptr->field; \
} \ } \
\ \
static __inline __unused int \ static __inline __unused int \
name##_PCTRIE_INSERT(struct pctrie *ptree, struct type *ptr) \ name##_PCTRIE_INSERT_BASE(struct pctrie *ptree, void *parentp, \
uint64_t *val, uint64_t *found, struct type **found_out) \
{ \ { \
struct pctrie_node *parent; \ struct pctrie_node *parent; \
void *parentp; \
uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \
\ \
parentp = pctrie_insert_lookup_strict(ptree, val); \ if (__predict_false(found != NULL)) { \
if (parentp == NULL) \ *found_out = name##_PCTRIE_VAL2PTR(found); \
return (0); \ return (EEXIST); \
} \
if (parentp != NULL) { \
parent = allocfn(ptree); \ parent = allocfn(ptree); \
if (__predict_false(parent == NULL)) \ if (__predict_false(parent == NULL)) { \
if (found_out != NULL) \
*found_out = NULL; \
return (ENOMEM); \ return (ENOMEM); \
} \
pctrie_insert_node(parentp, parent, val); \ pctrie_insert_node(parentp, parent, val); \
} \
return (0); \ return (0); \
} \ } \
\ \
static __inline __unused int \ static __inline __unused int \
name##_PCTRIE_INSERT(struct pctrie *ptree, struct type *ptr) \
{ \
void *parentp; \
uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \
\
parentp = pctrie_insert_lookup_strict(ptree, val); \
return (name##_PCTRIE_INSERT_BASE(ptree, parentp, val, \
NULL, NULL)); \
} \
\
static __inline __unused int \
name##_PCTRIE_FIND_OR_INSERT(struct pctrie *ptree, struct type *ptr, \ name##_PCTRIE_FIND_OR_INSERT(struct pctrie *ptree, struct type *ptr, \
struct type **found_out_opt) \ struct type **found_out_opt) \
{ \ { \
struct pctrie_node *parent; \
void *parentp; \ void *parentp; \
uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \ uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \
uint64_t *found; \ uint64_t *found; \
\ \
parentp = pctrie_insert_lookup(ptree, val, &found); \ parentp = pctrie_insert_lookup(ptree, val, &found); \
if (found != NULL) { \ return (name##_PCTRIE_INSERT_BASE(ptree, parentp, val, \
if (found_out_opt != NULL) \ found, found_out_opt)); \
*found_out_opt = name##_PCTRIE_VAL2PTR(found); \
return (EEXIST); \
} \ } \
if (parentp == NULL) \
return (0); \
parent = allocfn(ptree); \
if (__predict_false(parent == NULL)) \
return (ENOMEM); \
pctrie_insert_node(parentp, parent, val); \
return (0); \
} \
\ \
static __inline __unused int \ static __inline __unused int \
name##_PCTRIE_INSERT_LOOKUP_GE(struct pctrie *ptree, struct type *ptr, \ name##_PCTRIE_INSERT_LOOKUP_GE(struct pctrie *ptree, struct type *ptr, \
struct type **found_out) \ struct type **found_out) \
{ \ { \
struct pctrie_node *parent, *neighbor; \ struct pctrie_node *neighbor; \
void *parentp; \ void *parentp; \
uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \ uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \
uint64_t *found; \ uint64_t *found; \
int retval; \
\ \
parentp = pctrie_insert_lookup_gt(ptree, val, &found, \ parentp = pctrie_insert_lookup_gt(ptree, val, &found, \
&neighbor); \ &neighbor); \
if (__predict_false(found != NULL)) { \ retval = name##_PCTRIE_INSERT_BASE(ptree, parentp, val, \
*found_out = name##_PCTRIE_VAL2PTR(found); \ found, found_out); \
return (EEXIST); \ if (retval != 0) \
} \ return (retval); \
if (parentp != NULL) { \
parent = allocfn(ptree); \
if (__predict_false(parent == NULL)) { \
*found_out = NULL; \
return (ENOMEM); \
} \
pctrie_insert_node(parentp, parent, val); \
} \
found = pctrie_subtree_lookup_gt(neighbor, *val); \ found = pctrie_subtree_lookup_gt(neighbor, *val); \
*found_out = name##_PCTRIE_VAL2PTR(found); \ *found_out = name##_PCTRIE_VAL2PTR(found); \
pctrie_subtree_lookup_gt_assert(neighbor, *val, ptree, found); \ pctrie_subtree_lookup_gt_assert(neighbor, *val, ptree, found); \
return (0); \ return (0); \
} \ } \
\ \
static __inline __unused int \ static __inline __unused int \
name##_PCTRIE_INSERT_LOOKUP_LE(struct pctrie *ptree, struct type *ptr, \ name##_PCTRIE_INSERT_LOOKUP_LE(struct pctrie *ptree, struct type *ptr, \
struct type **found_out) \ struct type **found_out) \
{ \ { \
struct pctrie_node *parent, *neighbor; \ struct pctrie_node *neighbor; \
void *parentp; \ void *parentp; \
uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \ uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \
uint64_t *found; \ uint64_t *found; \
int retval; \
\ \
parentp = pctrie_insert_lookup_lt(ptree, val, &found, \ parentp = pctrie_insert_lookup_lt(ptree, val, &found, \
&neighbor); \ &neighbor); \
if (__predict_false(found != NULL)) { \ retval = name##_PCTRIE_INSERT_BASE(ptree, parentp, val, \
*found_out = name##_PCTRIE_VAL2PTR(found); \ found, found_out); \
return (EEXIST); \ if (retval != 0) \
} \ return (retval); \
if (parentp != NULL) { \
parent = allocfn(ptree); \
if (__predict_false(parent == NULL)) { \
*found_out = NULL; \
return (ENOMEM); \
} \
pctrie_insert_node(parentp, parent, val); \
} \
found = pctrie_subtree_lookup_lt(neighbor, *val); \ found = pctrie_subtree_lookup_lt(neighbor, *val); \
*found_out = name##_PCTRIE_VAL2PTR(found); \ *found_out = name##_PCTRIE_VAL2PTR(found); \
pctrie_subtree_lookup_lt_assert(neighbor, *val, ptree, found); \ pctrie_subtree_lookup_lt_assert(neighbor, *val, ptree, found); \
return (0); \ return (0); \
} \ } \
\ \
static __inline __unused struct type * \ static __inline __unused struct type * \
name##_PCTRIE_LOOKUP(struct pctrie *ptree, uint64_t key) \ name##_PCTRIE_LOOKUP(struct pctrie *ptree, uint64_t key) \
▲ Show 20 Lines • Show All 297 Lines • Show Last 20 Lines
View Options

share/man/man4/Makefile

Show First 20 Lines • Show All 80 Lines • ▼ Show 20 Lines
static __inline uint64_t * \ static __inline uint64_t * \
name##_PCTRIE_PTR2VAL(struct type *ptr) \ name##_PCTRIE_PTR2VAL(struct type *ptr) \
{ \ { \
\ \
return &ptr->field; \ return &ptr->field; \
} \ } \
\ \
static __inline __unused int \ static __inline __unused int \
name##_PCTRIE_INSERT(struct pctrie *ptree, struct type *ptr) \ name##_PCTRIE_INSERT_BASE(struct pctrie *ptree, void *parentp, \
uint64_t *val, uint64_t *found, struct type **found_out) \
{ \ { \
struct pctrie_node *parent; \ struct pctrie_node *parent; \
void *parentp; \
uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \
\ \
parentp = pctrie_insert_lookup_strict(ptree, val); \ if (__predict_false(found != NULL)) { \
if (parentp == NULL) \ *found_out = name##_PCTRIE_VAL2PTR(found); \
return (0); \ return (EEXIST); \
} \
if (parentp != NULL) { \
parent = allocfn(ptree); \ parent = allocfn(ptree); \
if (__predict_false(parent == NULL)) \ if (__predict_false(parent == NULL)) { \
if (found_out != NULL) \
*found_out = NULL; \
return (ENOMEM); \ return (ENOMEM); \
} \
pctrie_insert_node(parentp, parent, val); \ pctrie_insert_node(parentp, parent, val); \
} \
return (0); \ return (0); \
} \ } \
\ \
static __inline __unused int \ static __inline __unused int \
name##_PCTRIE_INSERT(struct pctrie *ptree, struct type *ptr) \
{ \
void *parentp; \
uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \
\
parentp = pctrie_insert_lookup_strict(ptree, val); \
return (name##_PCTRIE_INSERT_BASE(ptree, parentp, val, \
NULL, NULL)); \
} \
\
static __inline __unused int \
name##_PCTRIE_FIND_OR_INSERT(struct pctrie *ptree, struct type *ptr, \ name##_PCTRIE_FIND_OR_INSERT(struct pctrie *ptree, struct type *ptr, \
struct type **found_out_opt) \ struct type **found_out_opt) \
{ \ { \
struct pctrie_node *parent; \
void *parentp; \ void *parentp; \
uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \ uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \
uint64_t *found; \ uint64_t *found; \
\ \
parentp = pctrie_insert_lookup(ptree, val, &found); \ parentp = pctrie_insert_lookup(ptree, val, &found); \
if (found != NULL) { \ return (name##_PCTRIE_INSERT_BASE(ptree, parentp, val, \
if (found_out_opt != NULL) \ found, found_out_opt)); \
*found_out_opt = name##_PCTRIE_VAL2PTR(found); \
return (EEXIST); \
} \ } \
if (parentp == NULL) \
return (0); \
parent = allocfn(ptree); \
if (__predict_false(parent == NULL)) \
return (ENOMEM); \
pctrie_insert_node(parentp, parent, val); \
return (0); \
} \
\ \
static __inline __unused int \ static __inline __unused int \
name##_PCTRIE_INSERT_LOOKUP_GE(struct pctrie *ptree, struct type *ptr, \ name##_PCTRIE_INSERT_LOOKUP_GE(struct pctrie *ptree, struct type *ptr, \
struct type **found_out) \ struct type **found_out) \
{ \ { \
struct pctrie_node *parent, *neighbor; \ struct pctrie_node *neighbor; \
void *parentp; \ void *parentp; \
uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \ uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \
uint64_t *found; \ uint64_t *found; \
int retval; \
\ \
parentp = pctrie_insert_lookup_gt(ptree, val, &found, \ parentp = pctrie_insert_lookup_gt(ptree, val, &found, \
&neighbor); \ &neighbor); \
if (__predict_false(found != NULL)) { \ retval = name##_PCTRIE_INSERT_BASE(ptree, parentp, val, \
*found_out = name##_PCTRIE_VAL2PTR(found); \ found, found_out); \
return (EEXIST); \ if (retval != 0) \
} \ return (retval); \
if (parentp != NULL) { \
parent = allocfn(ptree); \
if (__predict_false(parent == NULL)) { \
*found_out = NULL; \
return (ENOMEM); \
} \
pctrie_insert_node(parentp, parent, val); \
} \
found = pctrie_subtree_lookup_gt(neighbor, *val); \ found = pctrie_subtree_lookup_gt(neighbor, *val); \
*found_out = name##_PCTRIE_VAL2PTR(found); \ *found_out = name##_PCTRIE_VAL2PTR(found); \
pctrie_subtree_lookup_gt_assert(neighbor, *val, ptree, found); \ pctrie_subtree_lookup_gt_assert(neighbor, *val, ptree, found); \
return (0); \ return (0); \
} \ } \
\ \
static __inline __unused int \ static __inline __unused int \
name##_PCTRIE_INSERT_LOOKUP_LE(struct pctrie *ptree, struct type *ptr, \ name##_PCTRIE_INSERT_LOOKUP_LE(struct pctrie *ptree, struct type *ptr, \
struct type **found_out) \ struct type **found_out) \
{ \ { \
struct pctrie_node *parent, *neighbor; \ struct pctrie_node *neighbor; \
void *parentp; \ void *parentp; \
uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \ uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \
uint64_t *found; \ uint64_t *found; \
int retval; \
\ \
parentp = pctrie_insert_lookup_lt(ptree, val, &found, \ parentp = pctrie_insert_lookup_lt(ptree, val, &found, \
&neighbor); \ &neighbor); \
if (__predict_false(found != NULL)) { \ retval = name##_PCTRIE_INSERT_BASE(ptree, parentp, val, \
*found_out = name##_PCTRIE_VAL2PTR(found); \ found, found_out); \
return (EEXIST); \ if (retval != 0) \
} \ return (retval); \
if (parentp != NULL) { \
parent = allocfn(ptree); \
if (__predict_false(parent == NULL)) { \
*found_out = NULL; \
return (ENOMEM); \
} \
pctrie_insert_node(parentp, parent, val); \
} \
found = pctrie_subtree_lookup_lt(neighbor, *val); \ found = pctrie_subtree_lookup_lt(neighbor, *val); \
*found_out = name##_PCTRIE_VAL2PTR(found); \ *found_out = name##_PCTRIE_VAL2PTR(found); \
pctrie_subtree_lookup_lt_assert(neighbor, *val, ptree, found); \ pctrie_subtree_lookup_lt_assert(neighbor, *val, ptree, found); \
return (0); \ return (0); \
} \ } \
\ \
static __inline __unused struct type * \ static __inline __unused struct type * \
name##_PCTRIE_LOOKUP(struct pctrie *ptree, uint64_t key) \ name##_PCTRIE_LOOKUP(struct pctrie *ptree, uint64_t key) \
▲ Show 20 Lines • Show All 297 Lines • Show Last 20 Lines
View Options

share/man/man4/efidev.4

Show First 20 Lines • Show All 80 Lines • ▼ Show 20 Lines
static __inline uint64_t * \ static __inline uint64_t * \
name##_PCTRIE_PTR2VAL(struct type *ptr) \ name##_PCTRIE_PTR2VAL(struct type *ptr) \
{ \ { \
\ \
return &ptr->field; \ return &ptr->field; \
} \ } \
\ \
static __inline __unused int \ static __inline __unused int \
name##_PCTRIE_INSERT(struct pctrie *ptree, struct type *ptr) \ name##_PCTRIE_INSERT_BASE(struct pctrie *ptree, void *parentp, \
uint64_t *val, uint64_t *found, struct type **found_out) \
{ \ { \
struct pctrie_node *parent; \ struct pctrie_node *parent; \
void *parentp; \
uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \
\ \
parentp = pctrie_insert_lookup_strict(ptree, val); \ if (__predict_false(found != NULL)) { \
if (parentp == NULL) \ *found_out = name##_PCTRIE_VAL2PTR(found); \
return (0); \ return (EEXIST); \
} \
if (parentp != NULL) { \
parent = allocfn(ptree); \ parent = allocfn(ptree); \
if (__predict_false(parent == NULL)) \ if (__predict_false(parent == NULL)) { \
if (found_out != NULL) \
*found_out = NULL; \
return (ENOMEM); \ return (ENOMEM); \
} \
pctrie_insert_node(parentp, parent, val); \ pctrie_insert_node(parentp, parent, val); \
} \
return (0); \ return (0); \
} \ } \
\ \
static __inline __unused int \ static __inline __unused int \
name##_PCTRIE_INSERT(struct pctrie *ptree, struct type *ptr) \
{ \
void *parentp; \
uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \
\
parentp = pctrie_insert_lookup_strict(ptree, val); \
return (name##_PCTRIE_INSERT_BASE(ptree, parentp, val, \
NULL, NULL)); \
} \
\
static __inline __unused int \
name##_PCTRIE_FIND_OR_INSERT(struct pctrie *ptree, struct type *ptr, \ name##_PCTRIE_FIND_OR_INSERT(struct pctrie *ptree, struct type *ptr, \
struct type **found_out_opt) \ struct type **found_out_opt) \
{ \ { \
struct pctrie_node *parent; \
void *parentp; \ void *parentp; \
uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \ uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \
uint64_t *found; \ uint64_t *found; \
\ \
parentp = pctrie_insert_lookup(ptree, val, &found); \ parentp = pctrie_insert_lookup(ptree, val, &found); \
if (found != NULL) { \ return (name##_PCTRIE_INSERT_BASE(ptree, parentp, val, \
if (found_out_opt != NULL) \ found, found_out_opt)); \
*found_out_opt = name##_PCTRIE_VAL2PTR(found); \
return (EEXIST); \
} \ } \
if (parentp == NULL) \
return (0); \
parent = allocfn(ptree); \
if (__predict_false(parent == NULL)) \
return (ENOMEM); \
pctrie_insert_node(parentp, parent, val); \
return (0); \
} \
\ \
static __inline __unused int \ static __inline __unused int \
name##_PCTRIE_INSERT_LOOKUP_GE(struct pctrie *ptree, struct type *ptr, \ name##_PCTRIE_INSERT_LOOKUP_GE(struct pctrie *ptree, struct type *ptr, \
struct type **found_out) \ struct type **found_out) \
{ \ { \
struct pctrie_node *parent, *neighbor; \ struct pctrie_node *neighbor; \
void *parentp; \ void *parentp; \
uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \ uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \
uint64_t *found; \ uint64_t *found; \
int retval; \
\ \
parentp = pctrie_insert_lookup_gt(ptree, val, &found, \ parentp = pctrie_insert_lookup_gt(ptree, val, &found, \
&neighbor); \ &neighbor); \
if (__predict_false(found != NULL)) { \ retval = name##_PCTRIE_INSERT_BASE(ptree, parentp, val, \
*found_out = name##_PCTRIE_VAL2PTR(found); \ found, found_out); \
return (EEXIST); \ if (retval != 0) \
} \ return (retval); \
if (parentp != NULL) { \
parent = allocfn(ptree); \
if (__predict_false(parent == NULL)) { \
*found_out = NULL; \
return (ENOMEM); \
} \
pctrie_insert_node(parentp, parent, val); \
} \
found = pctrie_subtree_lookup_gt(neighbor, *val); \ found = pctrie_subtree_lookup_gt(neighbor, *val); \
*found_out = name##_PCTRIE_VAL2PTR(found); \ *found_out = name##_PCTRIE_VAL2PTR(found); \
pctrie_subtree_lookup_gt_assert(neighbor, *val, ptree, found); \ pctrie_subtree_lookup_gt_assert(neighbor, *val, ptree, found); \
return (0); \ return (0); \
} \ } \
\ \
static __inline __unused int \ static __inline __unused int \
name##_PCTRIE_INSERT_LOOKUP_LE(struct pctrie *ptree, struct type *ptr, \ name##_PCTRIE_INSERT_LOOKUP_LE(struct pctrie *ptree, struct type *ptr, \
struct type **found_out) \ struct type **found_out) \
{ \ { \
struct pctrie_node *parent, *neighbor; \ struct pctrie_node *neighbor; \
void *parentp; \ void *parentp; \
uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \ uint64_t *val = name##_PCTRIE_PTR2VAL(ptr); \
uint64_t *found; \ uint64_t *found; \
int retval; \
\ \
parentp = pctrie_insert_lookup_lt(ptree, val, &found, \ parentp = pctrie_insert_lookup_lt(ptree, val, &found, \
&neighbor); \ &neighbor); \
if (__predict_false(found != NULL)) { \ retval = name##_PCTRIE_INSERT_BASE(ptree, parentp, val, \
*found_out = name##_PCTRIE_VAL2PTR(found); \ found, found_out); \
return (EEXIST); \ if (retval != 0) \
} \ return (retval); \
if (parentp != NULL) { \
parent = allocfn(ptree); \
if (__predict_false(parent == NULL)) { \
*found_out = NULL; \
return (ENOMEM); \
} \
pctrie_insert_node(parentp, parent, val); \
} \
found = pctrie_subtree_lookup_lt(neighbor, *val); \ found = pctrie_subtree_lookup_lt(neighbor, *val); \
*found_out = name##_PCTRIE_VAL2PTR(found); \ *found_out = name##_PCTRIE_VAL2PTR(found); \
pctrie_subtree_lookup_lt_assert(neighbor, *val, ptree, found); \ pctrie_subtree_lookup_lt_assert(neighbor, *val, ptree, found); \
return (0); \ return (0); \
} \ } \
\ \
static __inline __unused struct type * \ static __inline __unused struct type * \
name##_PCTRIE_LOOKUP(struct pctrie *ptree, uint64_t key) \ name##_PCTRIE_LOOKUP(struct pctrie *ptree, uint64_t key) \
▲ Show 20 Lines • Show All 297 Lines • Show Last 20 Lines