mirrors/SDL
1
0
Fork 0
mirror of https://github.com/libsdl-org/SDL.git synced 2026-02-16 08:34:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

Formatting spaces around pointer symbol.

Browse Source
This commit is contained in:
Petar Popovic
2025-02-04 01:14:56 +01:00
committed by Sam Lantinga
parent 94409d3504
commit 8ccf85c59e
15 changed files with 57 additions and 57 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/stdlib/SDL_malloc.c
View File

@@ -6324,10 +6324,10 @@ History:
#endif /* !HAVE_MALLOC */
#ifdef HAVE_MALLOC
static void* SDLCALL real_malloc(size_t s) { return malloc(s); }
static void* SDLCALL real_calloc(size_t n, size_t s) { return calloc(n, s); }
static void* SDLCALL real_realloc(void *p, size_t s) { return realloc(p,s); }
static void SDLCALL real_free(void *p) { free(p); }
static void * SDLCALL real_malloc(size_t s) { return malloc(s); }
static void * SDLCALL real_calloc(size_t n, size_t s) { return calloc(n, s); }
static void * SDLCALL real_realloc(void *p, size_t s) { return realloc(p,s); }
static void SDLCALL real_free(void *p) { free(p); }
#else
#define real_malloc dlmalloc
#define real_calloc dlcalloc

8
src/stdlib/SDL_qsort.c
View File

@@ -361,7 +361,7 @@ typedef struct { char * first; char * last; } stack_entry;
/* ---------------------------------------------------------------------- */
static char * pivot_big(char *first, char *mid, char *last, size_t size,
int (SDLCALL * compare)(void *, const void *, const void *), void *userdata) {
int (SDLCALL *compare)(void *, const void *, const void *), void *userdata) {
size_t d=(((last-first)/size)>>3)*size;
#ifdef DEBUG_QSORT
fprintf(stderr, "pivot_big: first=%p last=%p size=%lu n=%lu\n", first, (unsigned long)last, size, (unsigned long)((last-first+1)/size));
@@ -402,7 +402,7 @@ fprintf(stderr,"-> %d %d %d @ %p %p %p\n",*(int*)m1,*(int*)m2,*(int*)m3, m1,m2,m
/* ---------------------------------------------------------------------- */
static void qsort_r_nonaligned(void *base, size_t nmemb, size_t size,
int (SDLCALL * compare)(void *, const void *, const void *), void *userdata) {
int (SDLCALL *compare)(void *, const void *, const void *), void *userdata) {
stack_entry stack[STACK_SIZE];
int stacktop=0;
@@ -433,7 +433,7 @@ static void qsort_r_nonaligned(void *base, size_t nmemb, size_t size,
}
static void qsort_r_aligned(void *base, size_t nmemb, size_t size,
int (SDLCALL * compare)(void *,const void *, const void *), void *userdata) {
int (SDLCALL *compare)(void *,const void *, const void *), void *userdata) {
stack_entry stack[STACK_SIZE];
int stacktop=0;
@@ -464,7 +464,7 @@ static void qsort_r_aligned(void *base, size_t nmemb, size_t size,
}
static void qsort_r_words(void *base, size_t nmemb,
int (SDLCALL * compare)(void *,const void *, const void *), void *userdata) {
int (SDLCALL *compare)(void *,const void *, const void *), void *userdata) {
stack_entry stack[STACK_SIZE];
int stacktop=0;