blob: b9b866ea8a32b983d7c30803b148befc8281b699 [file] [log] [blame]
H. Peter Anvin9e6747c2009-06-28 17:13:04 -07001/* ----------------------------------------------------------------------- *
Cyrill Gorcunovf064c1c2009-12-21 19:31:45 +03002 *
H. Peter Anvin9e6747c2009-06-28 17:13:04 -07003 * Copyright 1996-2009 The NASM Authors - All Rights Reserved
4 * See the file AUTHORS included with the NASM distribution for
5 * the specific copyright holders.
H. Peter Anvinea6e34d2002-04-30 20:51:32 +00006 *
H. Peter Anvin9e6747c2009-06-28 17:13:04 -07007 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following
9 * conditions are met:
10 *
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above
14 * copyright notice, this list of conditions and the following
15 * disclaimer in the documentation and/or other materials provided
16 * with the distribution.
Cyrill Gorcunovf064c1c2009-12-21 19:31:45 +030017 *
H. Peter Anvin9e6747c2009-06-28 17:13:04 -070018 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
19 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
20 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
21 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
26 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
29 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
30 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 *
32 * ----------------------------------------------------------------------- */
33
34/*
35 * sync.c the Netwide Disassembler synchronisation processing module
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000036 */
37
H. Peter Anvinfe501952007-10-02 21:53:51 -070038#include "compiler.h"
39
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000040
H. Peter Anvin8d024e72007-09-19 21:41:02 -070041#include "nasmlib.h"
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000042#include "sync.h"
43
Cyrill Gorcunovfaaad6e2009-12-22 23:33:40 +030044#define SYNC_MAX_SHIFT 31
45#define SYNC_MAX_SIZE (1U << SYNC_MAX_SHIFT)
46
47/* initial # of sync points (*must* be power of two)*/
48#define SYNC_INITIAL_CHUNK (1U << 12)
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000049
H. Peter Anvind7ed89e2002-04-30 20:52:08 +000050/*
51 * This lot manages the current set of sync points by means of a
52 * heap (priority queue) structure.
53 */
54
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000055static struct Sync {
Ruslan Kabatsayev3ebed502017-02-12 19:31:19 +030056 uint64_t pos;
Keith Kaniosb7a89542007-04-12 02:40:54 +000057 uint32_t length;
H. Peter Anvin6768eb72002-04-30 20:52:26 +000058} *synx;
Cyrill Gorcunovf064c1c2009-12-21 19:31:45 +030059
Cyrill Gorcunovfaaad6e2009-12-22 23:33:40 +030060static uint32_t max_synx, nsynx;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000061
Cyrill Gorcunov2ec4ad82009-07-11 18:37:08 +040062static inline void swap_sync(uint32_t dst, uint32_t src)
63{
64 struct Sync t = synx[dst];
65 synx[dst] = synx[src];
66 synx[src] = t;
67}
68
H. Peter Anvine2c80182005-01-15 22:15:51 +000069void init_sync(void)
H. Peter Anvineba20a72002-04-30 20:53:55 +000070{
Cyrill Gorcunovfaaad6e2009-12-22 23:33:40 +030071 max_synx = SYNC_INITIAL_CHUNK;
72 synx = nasm_malloc((max_synx + 1) * sizeof(*synx));
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000073 nsynx = 0;
74}
75
Ruslan Kabatsayev3ebed502017-02-12 19:31:19 +030076void add_sync(uint64_t pos, uint32_t length)
H. Peter Anvineba20a72002-04-30 20:53:55 +000077{
Cyrill Gorcunovfaaad6e2009-12-22 23:33:40 +030078 uint32_t i;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000079
H. Peter Anvin8d024e72007-09-19 21:41:02 -070080 if (nsynx >= max_synx) {
Cyrill Gorcunovfaaad6e2009-12-22 23:33:40 +030081 if (max_synx >= SYNC_MAX_SIZE) /* too many sync points! */
82 return;
83 max_synx = (max_synx << 1);
Cyrill Gorcunovf064c1c2009-12-21 19:31:45 +030084 synx = nasm_realloc(synx, (max_synx + 1) * sizeof(*synx));
H. Peter Anvin8d024e72007-09-19 21:41:02 -070085 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000086
87 nsynx++;
88 synx[nsynx].pos = pos;
89 synx[nsynx].length = length;
90
91 for (i = nsynx; i > 1; i /= 2) {
Cyrill Gorcunov2ec4ad82009-07-11 18:37:08 +040092 if (synx[i / 2].pos > synx[i].pos)
93 swap_sync(i / 2, i);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000094 }
95}
96
Ruslan Kabatsayev3ebed502017-02-12 19:31:19 +030097uint64_t next_sync(uint64_t position, uint32_t *length)
H. Peter Anvineba20a72002-04-30 20:53:55 +000098{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000099 while (nsynx > 0 && synx[1].pos + synx[1].length <= position) {
Cyrill Gorcunovfaaad6e2009-12-22 23:33:40 +0300100 uint32_t i, j;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000101
Cyrill Gorcunov2ec4ad82009-07-11 18:37:08 +0400102 swap_sync(nsynx, 1);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000103 nsynx--;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000104
105 i = 1;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000106 while (i * 2 <= nsynx) {
107 j = i * 2;
108 if (synx[j].pos < synx[i].pos &&
109 (j + 1 > nsynx || synx[j + 1].pos > synx[j].pos)) {
Cyrill Gorcunov2ec4ad82009-07-11 18:37:08 +0400110 swap_sync(j, i);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000111 i = j;
112 } else if (j + 1 <= nsynx && synx[j + 1].pos < synx[i].pos) {
Cyrill Gorcunov2ec4ad82009-07-11 18:37:08 +0400113 swap_sync(j + 1, i);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000114 i = j + 1;
115 } else
116 break;
117 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000118 }
119
120 if (nsynx > 0) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000121 if (length)
122 *length = synx[1].length;
123 return synx[1].pos;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000124 } else {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000125 if (length)
126 *length = 0L;
H. Peter Anvin49da4682007-11-20 13:22:58 -0800127 return 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000128 }
129}