Showing
2 changed files
with
5 additions
and
5 deletions
| ... | ... | @@ -39,11 +39,11 @@ struct memSegment |
| 39 | 39 | }; |
| 40 | 40 | |
| 41 | 41 | /** |
| 42 | - * I found this at stanford.edu: | |
| 42 | + * I found this at stanford.edu: | |
| 43 | 43 | * https://graphics.stanford.edu/~seander/bithacks.html#IntegerLogLookup |
| 44 | 44 | * |
| 45 | 45 | * Really cool way of dealing with this. The oneat stanford.edu is slightly |
| 46 | - * different as ist deals only with 32bit values. I need a 64bit version | |
| 46 | + * different as ist deals only with 32bit values. I need a 64bit version | |
| 47 | 47 | * because on a 64bit system size_t is also 64bit and thus it is possible |
| 48 | 48 | * to allocate that much amount of memory theoretically. |
| 49 | 49 | */ | ... | ... |
| ... | ... | @@ -196,7 +196,7 @@ TR_malloc(size_t size) |
| 196 | 196 | // size if not a multiple of pagesize so bring it to one. |
| 197 | 197 | idx++; |
| 198 | 198 | size = idx * psize; |
| 199 | - } | |
| 199 | + } | |
| 200 | 200 | |
| 201 | 201 | idx += psize_width - MIN_BITS; |
| 202 | 202 | } else { |
| ... | ... | @@ -297,11 +297,11 @@ char * |
| 297 | 297 | TR_strdup(const char * src) |
| 298 | 298 | { |
| 299 | 299 | char * dup; |
| 300 | - | |
| 300 | + | |
| 301 | 301 | if (NULL == src) { |
| 302 | 302 | return NULL; |
| 303 | 303 | } |
| 304 | - | |
| 304 | + | |
| 305 | 305 | dup = TR_malloc(strlen(src)+1); |
| 306 | 306 | strcpy(dup, src); |
| 307 | 307 | ... | ... |
Please
register
or
login
to post a comment