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
|
/*
* Copyright (C) 2011 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef ART_SRC_COMPILER_COMPILER_UTILITY_H_
#define ART_SRC_COMPILER_COMPILER_UTILITY_H_
#include "Dalvik.h"
namespace art {
/* Each arena page has some overhead, so take a few bytes off */
#define ARENA_DEFAULT_SIZE ((256 * 1024) - 256)
/* Allocate the initial memory block for arena-based allocation */
bool oatHeapInit(void);
typedef struct ArenaMemBlock {
size_t blockSize;
size_t bytesAllocated;
struct ArenaMemBlock *next;
char ptr[0];
} ArenaMemBlock;
void* oatNew(size_t size, bool zero);
void oatArenaReset(void);
typedef struct GrowableList {
size_t numAllocated;
size_t numUsed;
intptr_t *elemList;
} GrowableList;
typedef struct GrowableListIterator {
GrowableList* list;
size_t idx;
size_t size;
} GrowableListIterator;
/*
* Expanding bitmap, used for tracking resources. Bits are numbered starting
* from zero.
*
* All operations on a BitVector are unsynchronized.
*/
struct ArenaBitVector {
bool expandable; /* expand bitmap if we run out? */
bool firstDirty; /* when true, don't believe firstBitSet */
bool lastDirty; /* when true, don't believe lastBitSet */
u4 storageSize; /* current size, in 32-bit words */
u4* storage;
/*
* Opportunistically remember first and
* last set bits. This yeilds a performance
* advantage in cases where large
* sparse vectors are repeatedly scanned
* (something that can happen a lot during
* dataflow analysis.
*/
int firstBitSet;
int lastBitSet;
};
/* Handy iterator to walk through the bit positions set to 1 */
struct ArenaBitVectorIterator {
ArenaBitVector* pBits;
u4 idx;
u4 bitSize;
};
#define GET_ELEM_N(LIST, TYPE, N) (((TYPE*) LIST->elemList)[N])
#define BLOCK_NAME_LEN 80
/* Forward declarations */
struct LIR;
struct BasicBlock;
struct CompilationUnit;
void oatInitGrowableList(GrowableList* gList, size_t initLength);
void oatInsertGrowableList(GrowableList* gList, intptr_t elem);
void oatGrowableListIteratorInit(GrowableList* gList,
GrowableListIterator* iterator);
intptr_t oatGrowableListIteratorNext(GrowableListIterator* iterator);
intptr_t oatGrowableListGetElement(const GrowableList* gList, size_t idx);
ArenaBitVector* oatAllocBitVector(unsigned int startBits, bool expandable);
void oatBitVectorIteratorInit(ArenaBitVector* pBits,
ArenaBitVectorIterator* iterator);
int oatBitVectorIteratorNext(ArenaBitVectorIterator* iterator);
bool oatSetBit(ArenaBitVector* pBits, unsigned int num);
bool oatClearBit(ArenaBitVector* pBits, unsigned int num);
void oatMarkAllBits(ArenaBitVector* pBits, bool set);
void oatDebugBitVector(char* msg, const ArenaBitVector* bv, int length);
bool oatIsBitSet(const ArenaBitVector* pBits, unsigned int num);
void oatClearAllBits(ArenaBitVector* pBits);
void oatSetInitialBits(ArenaBitVector* pBits, unsigned int numBits);
void oatCopyBitVector(ArenaBitVector* dest, const ArenaBitVector* src);
bool oatIntersectBitVectors(ArenaBitVector* dest, const ArenaBitVector* src1,
const ArenaBitVector* src2);
bool oatUnifyBitVectors(ArenaBitVector* dest, const ArenaBitVector* src1,
const ArenaBitVector* src2);
bool oatCompareBitVectors(const ArenaBitVector* src1,
const ArenaBitVector* src2);
int oatCountSetBits(const ArenaBitVector* pBits);
void oatDumpLIRInsn(CompilationUnit* cUnit, struct LIR* lir,
unsigned char* baseAddr);
void oatDumpResourceMask(struct LIR* lir, u8 mask, const char* prefix);
void oatDumpBlockBitVector(const GrowableList* blocks, char* msg,
const ArenaBitVector* bv, int length);
void oatGetBlockName(struct BasicBlock* bb, char* name);
const char* oatGetShortyFromTargetIdx(CompilationUnit*, int);
void oatDumpRegLocTable(struct RegLocation*, int);
} // namespace art
#endif // ART_SRC_COMPILER_COMPILER_UTILITY_H_
|