Page MenuHomeFreeBSD
Differential D44324

libgcc_s: exclude symbols not present on some arches
ClosedPublic
Actions

Authored by brooks on Mar 12 2024, 9:11 PM.
Tags
None
Referenced Files
Unknown Object (File)
Sun, Mar 16, 6:49 AM
Unknown Object (File)
Tue, Mar 11, 7:17 AM
Unknown Object (File)
Feb 10 2025, 12:57 PM
Unknown Object (File)
Feb 4 2025, 6:05 PM
Unknown Object (File)
Feb 4 2025, 2:55 PM
Unknown Object (File)
Jan 18 2025, 4:40 AM
Unknown Object (File)
Jan 16 2025, 6:25 AM
Unknown Object (File)
Jan 13 2025, 10:12 PM
View All 88 Files
Subscribers
imp

Details

Reviewers
emaste
dim
jrtc27
jhb
Commits
rGb457144ceaf7: libgcc_s: exclude symbols not present on some arches
Summary

arm, aarch64, and riscv lack some/all frame_info interfaces.
arm and powerpc lack some numeric functions.

Diff Detail

Repository
rG FreeBSD src repository
Lint
Lint Not Applicable
Unit
Tests Not Applicable

Revision Contents
Changeset List

PathSize
lib/
libgcc_s/
24 lines

Diff 137189

View Options

lib/libgcc_s/Symbol.map

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