mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-02-07 23:13:34 +00:00
e75ffde09e
You can now build Cosmopolitan with Clang:
make -j8 MODE=llvm
o/llvm/examples/hello.com
The assembler and linker code is now friendly to LLVM too.
So it's not needed to configure Clang to use binutils under
the hood. If you love LLVM then you can now use pure LLVM.
59 lines
3.1 KiB
ArmAsm
59 lines
3.1 KiB
ArmAsm
/*-*- mode:unix-assembly; indent-tabs-mode:t; tab-width:8; coding:utf-8 -*-│
|
|
│vi: set et ft=asm ts=8 tw=8 fenc=utf-8 :vi│
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
|
│ Copyright 2020 Justine Alexandra Roberts Tunney │
|
|
│ │
|
|
│ Permission to use, copy, modify, and/or distribute this software for │
|
|
│ any purpose with or without fee is hereby granted, provided that the │
|
|
│ above copyright notice and this permission notice appear in all copies. │
|
|
│ │
|
|
│ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │
|
|
│ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │
|
|
│ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │
|
|
│ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL │
|
|
│ DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR │
|
|
│ PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER │
|
|
│ TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR │
|
|
│ PERFORMANCE OF THIS SOFTWARE. │
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
|
#include "libc/macros.h"
|
|
#include "libc/notice.inc"
|
|
.source __FILE__
|
|
|
|
// Allocates / resizes / frees memory, e.g.
|
|
//
|
|
// Returns a pointer to a chunk of size n that contains the same data as
|
|
// does chunk p up to the minimum of (n, p's size) bytes, or null if no
|
|
// space is available.
|
|
//
|
|
// If p is NULL, realloc is equivalent to malloc.
|
|
// If p is not NULL and n is 0, realloc is equivalent to free.
|
|
//
|
|
// The returned pointer may or may not be the same as p. The algorithm
|
|
// prefers extending p in most cases when possible, otherwise it employs
|
|
// the equivalent of a malloc-copy-free sequence.
|
|
//
|
|
// Please note that p is NOT free()'d should realloc() fail, thus:
|
|
//
|
|
// if ((p2 = realloc(p, n2))) {
|
|
// p = p2;
|
|
// ...
|
|
// } else {
|
|
// ...
|
|
// }
|
|
//
|
|
// if n is for fewer bytes than already held by p, the newly unused
|
|
// space is lopped off and freed if possible.
|
|
//
|
|
// The old unix realloc convention of allowing the last-free'd chunk to
|
|
// be used as an argument to realloc is not supported.
|
|
//
|
|
// @param rdi (p) is address of current allocation or NULL
|
|
// @param rsi (n) is number of bytes needed
|
|
// @return rax is result, or NULL w/ errno w/o free(p)
|
|
// @note realloc(p=0, n=0) → malloc(32)
|
|
// @note realloc(p≠0, n=0) → free(p)
|
|
// @see dlrealloc()
|
|
realloc:
|
|
jmp *hook_realloc(%rip)
|
|
.endfn realloc,globl
|