jD91mZM2
d3e4fa71a5
I really really wish I could actually test this on redox. All I know is: it compiles
23 lines
758 B
C
23 lines
758 B
C
#ifndef _BITS_SYS_SELECT_H
|
|
#define _BITS_SYS_SELECT_H
|
|
|
|
#define FD_SETSIZE 1024
|
|
|
|
typedef struct fd_set {
|
|
unsigned long fds_bits[FD_SETSIZE / (8 * sizeof(unsigned long))];
|
|
} fd_set;
|
|
|
|
#define _FD_INDEX(fd) ((fd) / (8 * sizeof(unsigned long)))
|
|
#define _FD_BITMASK(fd) (1UL << ((fd) & (8 * sizeof(unsigned long) - 1)))
|
|
|
|
#define FD_ZERO(set) for (int i = 0; i < sizeof((set)->fds_bits) / sizeof(unsigned long); i += 1) { \
|
|
(set)->fds_bits[i] = 0; \
|
|
}
|
|
|
|
#define FD_SET(fd, set) ((set)->fds_bits[_FD_INDEX(fd)] |= _FD_BITMASK(fd))
|
|
#define FD_CLR(fd, set) ((set)->fds_bits[_FD_INDEX(fd)] &= ~(_FD_BITMASK(fd)))
|
|
|
|
#define FD_ISSET(fd, set) (((set)->fds_bits[_FD_INDEX(fd)] & _FD_BITMASK(fd)) == _FD_BITMASK(fd))
|
|
|
|
#endif
|