1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
/* Chrysalide - Outil d'analyse de fichiers binaires
* ##FILE## - traduction d'instructions ARMv7
*
* Copyright (C) 2017 Cyrille Bagard
*
* This file is part of Chrysalide.
*
* Chrysalide is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or
* (at your option) any later version.
*
* Chrysalide is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with Chrysalide. If not, see <http://www.gnu.org/licenses/>.
*/
@title PLD, PLDW (register)
@id 127
@desc {
Preload Data signals the memory system that data memory accesses from a specified address are likely in the near future. The memory system can respond by taking actions that are expected to speed up the memory accesses when they do occur, such as pre-loading the cache line containing the specified address into the data cache. On an architecture variant that includes both the PLD and PLDW instructions, the PLD instruction signals that the likely memory access is a read, and the PLDW instruction signals that it is a write. The effect of a PLD or PLDW instruction is IMPLEMENTATION DEFINED. For more information, see Preloading caches on page A3-157 and Behavior of Preload Data (PLD, PLDW) and Preload Instruction (PLI) with caches on page B2-1269.
}
@encoding (T1) {
@word 1 1 1 1 1 0 0 0 0 0 W(1) 1 Rn(4) 1 1 1 1 0 0 0 0 0 0 imm2(2) Rm(4)
@syntax {
@subid 383
@assert {
W == 0
}
@conv {
reg_N = Register(Rn)
reg_M = Register(Rm)
shift = FixedShift(SRType_LSL, imm2)
maccess = MemAccessOffsetExtended(reg_N, reg_M, shift)
}
@asm pld maccess
}
@syntax {
@subid 384
@assert {
W == 1
}
@conv {
reg_N = Register(Rn)
reg_M = Register(Rm)
shift = FixedShift(SRType_LSL, imm2)
maccess = MemAccessOffsetExtended(reg_N, reg_M, shift)
}
@asm pldw maccess
}
}
@encoding (A1) {
@word 1 1 1 1 0 1 1 1 U(1) R(1) 0 1 Rn(4) 1 1 1 1 imm5(5) type(2) 0 Rm(4)
@syntax {
@subid 385
@assert {
R == 1
}
@conv {
reg_N = Register(Rn)
reg_M = Register(Rm)
shift = DecodeImmShift(type, imm5)
maccess = MemAccessOffsetExtended(reg_N, reg_M, shift)
}
@asm pld maccess
}
@syntax {
@subid 386
@assert {
R == 0
}
@conv {
reg_N = Register(Rn)
reg_M = Register(Rm)
shift = DecodeImmShift(type, imm5)
maccess = MemAccessOffsetExtended(reg_N, reg_M, shift)
}
@asm pldw maccess
}
}
|
