mirror of
https://github.com/RGBCube/serenity
synced 2025-07-27 17:37:34 +00:00
Everywhere: Run clang-format
This commit is contained in:
parent
0376c127f6
commit
086969277e
1665 changed files with 8479 additions and 8479 deletions
|
@ -19,7 +19,7 @@ struct PthreadFunctions {
|
|||
int (*pthread_once)(pthread_once_t*, void (*)(void));
|
||||
|
||||
int (*pthread_cond_broadcast)(pthread_cond_t*);
|
||||
int (*pthread_cond_init)(pthread_cond_t*, const pthread_condattr_t*);
|
||||
int (*pthread_cond_init)(pthread_cond_t*, pthread_condattr_t const*);
|
||||
int (*pthread_cond_signal)(pthread_cond_t*);
|
||||
int (*pthread_cond_wait)(pthread_cond_t*, pthread_mutex_t*);
|
||||
int (*pthread_cond_destroy)(pthread_cond_t*);
|
||||
|
|
|
@ -18,7 +18,7 @@ void __pthread_fork_atfork_register_prepare(void (*)(void));
|
|||
void __pthread_fork_atfork_register_parent(void (*)(void));
|
||||
void __pthread_fork_atfork_register_child(void (*)(void));
|
||||
|
||||
int __pthread_mutex_init(pthread_mutex_t*, const pthread_mutexattr_t*);
|
||||
int __pthread_mutex_init(pthread_mutex_t*, pthread_mutexattr_t const*);
|
||||
int __pthread_mutex_lock(pthread_mutex_t*);
|
||||
int __pthread_mutex_trylock(pthread_mutex_t*);
|
||||
int __pthread_mutex_lock_pessimistic_np(pthread_mutex_t*);
|
||||
|
@ -29,7 +29,7 @@ typedef void (*KeyDestructor)(void*);
|
|||
int __pthread_key_create(pthread_key_t*, KeyDestructor);
|
||||
int __pthread_key_delete(pthread_key_t);
|
||||
void* __pthread_getspecific(pthread_key_t);
|
||||
int __pthread_setspecific(pthread_key_t, const void*);
|
||||
int __pthread_setspecific(pthread_key_t, void const*);
|
||||
|
||||
int __pthread_self(void);
|
||||
|
||||
|
|
|
@ -9,10 +9,10 @@
|
|||
// This is technically an implementation detail, but we require this for testing.
|
||||
// The key always has to be the first struct member.
|
||||
struct search_tree_node {
|
||||
const void* key;
|
||||
void const* key;
|
||||
struct search_tree_node* left;
|
||||
struct search_tree_node* right;
|
||||
};
|
||||
|
||||
struct search_tree_node* new_tree_node(const void* key);
|
||||
struct search_tree_node* new_tree_node(void const* key);
|
||||
void delete_node_recursive(struct search_tree_node* node);
|
||||
|
|
|
@ -46,7 +46,7 @@ public:
|
|||
void clear_err() { m_error = 0; }
|
||||
|
||||
size_t read(u8*, size_t);
|
||||
size_t write(const u8*, size_t);
|
||||
size_t write(u8 const*, size_t);
|
||||
|
||||
template<typename CharType>
|
||||
bool gets(CharType*, size_t);
|
||||
|
@ -84,7 +84,7 @@ private:
|
|||
bool is_not_empty() const { return m_ungotten || !m_empty; }
|
||||
size_t buffered_size() const;
|
||||
|
||||
const u8* begin_dequeue(size_t& available_size) const;
|
||||
u8 const* begin_dequeue(size_t& available_size) const;
|
||||
void did_dequeue(size_t actual_size);
|
||||
|
||||
u8* begin_enqueue(size_t& available_size) const;
|
||||
|
@ -114,7 +114,7 @@ private:
|
|||
|
||||
// Read or write using the underlying fd, bypassing the buffer.
|
||||
ssize_t do_read(u8*, size_t);
|
||||
ssize_t do_write(const u8*, size_t);
|
||||
ssize_t do_write(u8 const*, size_t);
|
||||
|
||||
// Read some data into the buffer.
|
||||
bool read_into_buffer();
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue