2
|
1 |
/*
|
5506
|
2 |
* Copyright (c) 2000, 2003, Oracle and/or its affiliates. All rights reserved.
|
2
|
3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
4 |
*
|
|
5 |
* This code is free software; you can redistribute it and/or modify it
|
|
6 |
* under the terms of the GNU General Public License version 2 only, as
|
5506
|
7 |
* published by the Free Software Foundation. Oracle designates this
|
2
|
8 |
* particular file as subject to the "Classpath" exception as provided
|
5506
|
9 |
* by Oracle in the LICENSE file that accompanied this code.
|
2
|
10 |
*
|
|
11 |
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
12 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
13 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
14 |
* version 2 for more details (a copy is included in the LICENSE file that
|
|
15 |
* accompanied this code).
|
|
16 |
*
|
|
17 |
* You should have received a copy of the GNU General Public License version
|
|
18 |
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
19 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
20 |
*
|
5506
|
21 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
22 |
* or visit www.oracle.com if you need additional information or have any
|
|
23 |
* questions.
|
2
|
24 |
*/
|
|
25 |
|
|
26 |
#warn This file is preprocessed before being compiled
|
|
27 |
|
|
28 |
class XXX {
|
|
29 |
|
|
30 |
#begin
|
|
31 |
|
|
32 |
#if[rw]
|
|
33 |
|
|
34 |
private $type$ get$Type$(long a) {
|
|
35 |
if (unaligned) {
|
|
36 |
$memtype$ x = unsafe.get$Memtype$(a);
|
|
37 |
return $fromBits$(nativeByteOrder ? x : Bits.swap(x));
|
|
38 |
}
|
|
39 |
return Bits.get$Type$(a, bigEndian);
|
|
40 |
}
|
|
41 |
|
|
42 |
public $type$ get$Type$() {
|
|
43 |
return get$Type$(ix(nextGetIndex($BYTES_PER_VALUE$)));
|
|
44 |
}
|
|
45 |
|
|
46 |
public $type$ get$Type$(int i) {
|
|
47 |
return get$Type$(ix(checkIndex(i, $BYTES_PER_VALUE$)));
|
|
48 |
}
|
|
49 |
|
|
50 |
#end[rw]
|
|
51 |
|
|
52 |
private ByteBuffer put$Type$(long a, $type$ x) {
|
|
53 |
#if[rw]
|
|
54 |
if (unaligned) {
|
|
55 |
$memtype$ y = $toBits$(x);
|
|
56 |
unsafe.put$Memtype$(a, (nativeByteOrder ? y : Bits.swap(y)));
|
|
57 |
} else {
|
|
58 |
Bits.put$Type$(a, x, bigEndian);
|
|
59 |
}
|
|
60 |
return this;
|
|
61 |
#else[rw]
|
|
62 |
throw new ReadOnlyBufferException();
|
|
63 |
#end[rw]
|
|
64 |
}
|
|
65 |
|
|
66 |
public ByteBuffer put$Type$($type$ x) {
|
|
67 |
#if[rw]
|
|
68 |
put$Type$(ix(nextPutIndex($BYTES_PER_VALUE$)), x);
|
|
69 |
return this;
|
|
70 |
#else[rw]
|
|
71 |
throw new ReadOnlyBufferException();
|
|
72 |
#end[rw]
|
|
73 |
}
|
|
74 |
|
|
75 |
public ByteBuffer put$Type$(int i, $type$ x) {
|
|
76 |
#if[rw]
|
|
77 |
put$Type$(ix(checkIndex(i, $BYTES_PER_VALUE$)), x);
|
|
78 |
return this;
|
|
79 |
#else[rw]
|
|
80 |
throw new ReadOnlyBufferException();
|
|
81 |
#end[rw]
|
|
82 |
}
|
|
83 |
|
|
84 |
public $Type$Buffer as$Type$Buffer() {
|
|
85 |
int off = this.position();
|
|
86 |
int lim = this.limit();
|
|
87 |
assert (off <= lim);
|
|
88 |
int rem = (off <= lim ? lim - off : 0);
|
|
89 |
|
|
90 |
int size = rem >> $LG_BYTES_PER_VALUE$;
|
|
91 |
if (!unaligned && ((address + off) % $BYTES_PER_VALUE$ != 0)) {
|
|
92 |
return (bigEndian
|
|
93 |
? ($Type$Buffer)(new ByteBufferAs$Type$Buffer$RW$B(this,
|
|
94 |
-1,
|
|
95 |
0,
|
|
96 |
size,
|
|
97 |
size,
|
|
98 |
off))
|
|
99 |
: ($Type$Buffer)(new ByteBufferAs$Type$Buffer$RW$L(this,
|
|
100 |
-1,
|
|
101 |
0,
|
|
102 |
size,
|
|
103 |
size,
|
|
104 |
off)));
|
|
105 |
} else {
|
|
106 |
return (nativeByteOrder
|
|
107 |
? ($Type$Buffer)(new Direct$Type$Buffer$RW$U(this,
|
|
108 |
-1,
|
|
109 |
0,
|
|
110 |
size,
|
|
111 |
size,
|
|
112 |
off))
|
|
113 |
: ($Type$Buffer)(new Direct$Type$Buffer$RW$S(this,
|
|
114 |
-1,
|
|
115 |
0,
|
|
116 |
size,
|
|
117 |
size,
|
|
118 |
off)));
|
|
119 |
}
|
|
120 |
}
|
|
121 |
|
|
122 |
#end
|
|
123 |
|
|
124 |
}
|