mirror of
git://git.sv.gnu.org/emacs.git
synced 2026-01-04 02:51:31 -08:00
266228be7c
Correcting design documentation relating to stacks. Referencing hot and cold end concepts from glossary entry for control stacks. Copied from Perforce Change: 189320 ServerID: perforce.ravenbrook.com
109 lines
5 KiB
C
109 lines
5 KiB
C
/* ssw3i6mv.c: STACK SCANNING FOR WIN64 WITH MICROSOFT C
|
|
*
|
|
* $Id$
|
|
* Copyright (c) 2001-2014 Ravenbrook Limited. See end of file for license.
|
|
*
|
|
* This scans the stack and fixes the registers which may contain roots.
|
|
* See <design/thread-manager/>. It's unlikely that the callee-save
|
|
* registers contain mutator roots by the time this function is called, but
|
|
* we can't be certain, so we must scan them anyway.
|
|
*
|
|
* REFERENCES
|
|
*
|
|
* "Overview of x64 Calling Conventions"; MSDN; Microsoft Corporation;
|
|
* <http://msdn.microsoft.com/en-us/library/ms235286%28v=vs.100%29.aspx>.
|
|
*
|
|
* "Caller/Callee Saved Registers"; MSDN; Microsoft Corporation;
|
|
* <http://msdn.microsoft.com/en-us/library/6t169e9c%28v=vs.100%29.aspx>.
|
|
*
|
|
* "Register Usage"; MSDN; Microsoft Corporation;
|
|
* <http://msdn.microsoft.com/en-us/library/9z1stfyw%28v=vs.100%29.aspx>.
|
|
*
|
|
* "Calling conventions for different C++ compilers and operating systems";
|
|
* Agner Fog; Copenhagen University College of Engineering; 2012-02-29;
|
|
* <http://agner.org./optimize/calling_conventions.pdf>.
|
|
*/
|
|
|
|
#include "mpm.h"
|
|
#include <setjmp.h>
|
|
|
|
SRCID(ssw3i6mv, "$Id$");
|
|
|
|
|
|
Res StackScan(ScanState ss, Word *stackCold,
|
|
mps_area_scan_t scan_area,
|
|
void *closure, size_t closure_size)
|
|
{
|
|
jmp_buf jb;
|
|
|
|
/* We rely on the fact that Microsoft C's setjmp stores the callee-save
|
|
registers in the jmp_buf. */
|
|
(void)setjmp(jb);
|
|
|
|
/* These checks will just serve to warn us at compile-time if the
|
|
setjmp.h header changes to indicate that the registers we want aren't
|
|
saved any more. */
|
|
AVER(sizeof(((_JUMP_BUFFER *)jb)->Rbx) == sizeof(Word));
|
|
AVER(sizeof(((_JUMP_BUFFER *)jb)->Rsp) == sizeof(Word));
|
|
AVER(sizeof(((_JUMP_BUFFER *)jb)->Rbp) == sizeof(Word));
|
|
AVER(sizeof(((_JUMP_BUFFER *)jb)->Rsi) == sizeof(Word));
|
|
AVER(sizeof(((_JUMP_BUFFER *)jb)->Rdi) == sizeof(Word));
|
|
AVER(sizeof(((_JUMP_BUFFER *)jb)->R12) == sizeof(Word));
|
|
AVER(sizeof(((_JUMP_BUFFER *)jb)->R13) == sizeof(Word));
|
|
AVER(sizeof(((_JUMP_BUFFER *)jb)->R14) == sizeof(Word));
|
|
AVER(sizeof(((_JUMP_BUFFER *)jb)->R15) == sizeof(Word));
|
|
|
|
/* The layout of the jmp_buf forces us to harmlessly scan Rsp as well. */
|
|
AVER(offsetof(_JUMP_BUFFER, Rsp) == offsetof(_JUMP_BUFFER, Rbx) + 8);
|
|
AVER(offsetof(_JUMP_BUFFER, Rbp) == offsetof(_JUMP_BUFFER, Rbx) + 16);
|
|
AVER(offsetof(_JUMP_BUFFER, Rsi) == offsetof(_JUMP_BUFFER, Rbx) + 24);
|
|
AVER(offsetof(_JUMP_BUFFER, Rdi) == offsetof(_JUMP_BUFFER, Rbx) + 32);
|
|
AVER(offsetof(_JUMP_BUFFER, R12) == offsetof(_JUMP_BUFFER, Rbx) + 40);
|
|
AVER(offsetof(_JUMP_BUFFER, R13) == offsetof(_JUMP_BUFFER, Rbx) + 48);
|
|
AVER(offsetof(_JUMP_BUFFER, R14) == offsetof(_JUMP_BUFFER, Rbx) + 56);
|
|
AVER(offsetof(_JUMP_BUFFER, R15) == offsetof(_JUMP_BUFFER, Rbx) + 64);
|
|
|
|
return StackScanInner(ss, stackCold, (Word *)&((_JUMP_BUFFER *)jb)->Rbx, 9,
|
|
scan_area, closure, closure_size);
|
|
}
|
|
|
|
/* C. COPYRIGHT AND LICENSE
|
|
*
|
|
* Copyright (C) 2001-2014 Ravenbrook Limited <http://www.ravenbrook.com/>.
|
|
* All rights reserved. This is an open source license. Contact
|
|
* Ravenbrook for commercial licensing options.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are
|
|
* met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* 3. Redistributions in any form must be accompanied by information on how
|
|
* to obtain complete source code for this software and any accompanying
|
|
* software that uses this software. The source code must either be
|
|
* included in the distribution or be available for no more than the cost
|
|
* of distribution plus a nominal fee, and must be freely redistributable
|
|
* under reasonable conditions. For an executable file, complete source
|
|
* code means the source code for all modules it contains. It does not
|
|
* include source code for modules or files that typically accompany the
|
|
* major components of the operating system on which the executable file
|
|
* runs.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
|
|
* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
|
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
|
|
* PURPOSE, OR NON-INFRINGEMENT, ARE DISCLAIMED. IN NO EVENT SHALL THE
|
|
* COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
|
|
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
|
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|