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
|
/**************************************************************************
*
* Copyright 2007 Tungsten Graphics, Inc., Cedar Park, Texas.
* All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sub license, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice (including the
* next paragraph) shall be included in all copies or substantial portions
* of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
* IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR
* ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
**************************************************************************/
/*
* Authors:
* Zack Rusin zack@tungstengraphics.com
*/
#ifndef STORAGE_H
#define STORAGE_H
#include <map>
#include <set>
#include <stack>
#include <vector>
namespace llvm {
class BasicBlock;
class Constant;
class ConstantInt;
class LoadInst;
class Value;
class VectorType;
}
class Storage
{
public:
Storage(llvm::BasicBlock *block,
llvm::Value *out,
llvm::Value *in, llvm::Value *consts);
llvm::Value *inputPtr() const;
llvm::Value *outputPtr() const;
llvm::Value *constPtr() const;
void setCurrentBlock(llvm::BasicBlock *block);
llvm::ConstantInt *constantInt(int);
llvm::Constant *shuffleMask(int vec);
llvm::Value *inputElement(int idx, llvm::Value *indIdx =0);
llvm::Value *constElement(int idx, llvm::Value *indIdx =0);
llvm::Value *outputElement(int idx, llvm::Value *indIdx =0);
llvm::Value *tempElement(int idx);
void setTempElement(int idx, llvm::Value *val, int mask);
void declareTemp(int idx);
llvm::Value *addrElement(int idx) const;
void setAddrElement(int idx, llvm::Value *val, int mask);
llvm::Value *shuffleVector(llvm::Value *vec, int shuffle);
llvm::Value *extractIndex(llvm::Value *vec);
void store(int dstIdx, llvm::Value *val, int mask);
int numConsts() const;
void pushArguments(llvm::Value *out, llvm::Value *in,
llvm::Value *constPtr);
void popArguments();
private:
llvm::Value *maskWrite(llvm::Value *src, int mask, llvm::Value *templ);
const char *name(const char *prefix);
private:
llvm::BasicBlock *m_block;
llvm::Value *m_OUT;
llvm::Value *m_IN;
llvm::Value *m_CONST;
std::map<int, llvm::ConstantInt*> m_constInts;
std::map<int, llvm::Constant*> m_intVecs;
std::vector<llvm::Value*> m_temps;
std::vector<llvm::Value*> m_addrs;
std::vector<llvm::Value*> m_dstCache;
llvm::VectorType *m_floatVecType;
llvm::VectorType *m_intVecType;
llvm::Value *m_undefFloatVec;
llvm::Value *m_undefIntVec;
llvm::Value *m_extSwizzleVec;
char m_name[32];
int m_idx;
int m_numConsts;
std::map<int, bool > m_destWriteMap;
struct Args {
llvm::Value *out;
llvm::Value *in;
llvm::Value *cst;
};
std::stack<Args> m_argStack;
};
#endif
|
