diff options
| author | Szabolcs Nagy <szabolcs.nagy@arm.com> | 2021-07-12 11:11:05 +0100 |
|---|---|---|
| committer | Szabolcs Nagy <szabolcs.nagy@arm.com> | 2022-11-22 14:31:25 +0000 |
| commit | c0ba8ad1fe451f2849ce7c6fdb477c94471d5d25 (patch) | |
| tree | b5e7be1fb5d879369110427ca55f7a3cb33c14d2 /misc | |
| parent | cf95053a832df4dc3c6f72de76d366856cdf7eae (diff) | |
| download | glibc-c0ba8ad1fe451f2849ce7c6fdb477c94471d5d25.tar.gz glibc-c0ba8ad1fe451f2849ce7c6fdb477c94471d5d25.tar.xz glibc-c0ba8ad1fe451f2849ce7c6fdb477c94471d5d25.zip | |
cheri: fix pointer tagging in tsearch
USE_MALLOC_LOW_BIT should work for capabilities too, but we need to ensure that pointer provenance is right: the red/black flag is computed as uintptr_t, but with uintptr_t | uintptr_t it's not clear which side provides the provenance. So use unsigned int type for the flag (which is the type used in case of !USE_MALLOC_LOW_BIT anyway), then unsigned int | uintptr_t works. The type of RED is corrected too to match unsigned int.
Diffstat (limited to 'misc')
| -rw-r--r-- | misc/tsearch.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/misc/tsearch.c b/misc/tsearch.c index 852cadf7b9..1787cf4991 100644 --- a/misc/tsearch.c +++ b/misc/tsearch.c @@ -131,15 +131,15 @@ typedef struct node_t uintptr_t right_node; } *node; -#define RED(N) (node)((N)->left_node & ((uintptr_t) 0x1)) +#define RED(N) (unsigned int)((N)->left_node & ((uintptr_t) 0x1)) #define SETRED(N) (N)->left_node |= ((uintptr_t) 0x1) #define SETBLACK(N) (N)->left_node &= ~((uintptr_t) 0x1) -#define SETNODEPTR(NP,P) (*NP) = (node)((((uintptr_t)(*NP)) \ +#define SETNODEPTR(NP,P) (*NP) = (node)((unsigned int)(((uintptr_t)(*NP)) \ & (uintptr_t) 0x1) | (uintptr_t)(P)) #define LEFT(N) (node)((N)->left_node & ~((uintptr_t) 0x1)) #define LEFTPTR(N) (node *)(&(N)->left_node) -#define SETLEFT(N,L) (N)->left_node = (((N)->left_node & (uintptr_t) 0x1) \ - | (uintptr_t)(L)) +#define SETLEFT(N,L) (N)->left_node = ((unsigned int)((N)->left_node \ + & (uintptr_t) 0x1) | (uintptr_t)(L)) #define RIGHT(N) (node)((N)->right_node) #define RIGHTPTR(N) (node *)(&(N)->right_node) #define SETRIGHT(N,R) (N)->right_node = (uintptr_t)(R) |