OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Parts
(Results
1 - 7
of
7
) sorted by null
/external/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGBuilder.cpp
99
const SDValue *
Parts
, unsigned NumParts,
102
/// getCopyFromParts - Create a value that contains the specified legal
parts
103
/// combined into the value they represent. If the
parts
combine to a type
108
const SDValue *
Parts
,
113
return getCopyFromPartsVector(DAG, DL,
Parts
, NumParts,
116
assert(NumParts > 0 && "No
parts
to assemble!");
118
SDValue Val =
Parts
[0];
121
// Assemble the value from multiple
parts
.
137
Lo = getCopyFromParts(DAG, DL,
Parts
, RoundParts / 2,
139
Hi = getCopyFromParts(DAG, DL,
Parts
+ RoundParts / 2
[
all
...]
LegalizeTypesGeneric.cpp
323
SDValue
Parts
[2];
327
SplitInteger(Op,
Parts
[0],
Parts
[1]);
329
std::swap(
Parts
[0],
Parts
[1]);
330
IntegerToVector(
Parts
[0], NumElements, Ops, EltVT);
331
IntegerToVector(
Parts
[1], NumElements, Ops, EltVT);
341
// Make a two element vector out of the expanded
parts
and convert that
LegalizeFloatTypes.cpp
[
all
...]
DAGCombiner.cpp
[
all
...]
/external/llvm/lib/Target/MSP430/
MSP430ISelLowering.cpp
327
unsigned
Parts
= ArgsParts[i];
329
if (!UseStack &&
Parts
<= RegsLeft) {
331
for (unsigned j = 0; j <
Parts
; j++) {
340
std::reverse(B, B +
Parts
);
343
for (unsigned j = 0; j <
Parts
; j++)
[
all
...]
/external/llvm/include/llvm/TableGen/
Record.h
[
all
...]
/external/llvm/utils/TableGen/
CodeGenRegisters.cpp
72
std::vector<Record*>
Parts
=
74
if (!
Parts
.empty()) {
75
if (
Parts
.size() < 2)
79
for (unsigned i = 0, e =
Parts
.size(); i != e; ++i)
80
IdxParts.push_back(RegBank.getSubRegIdx(
Parts
[i]));
345
SmallVector<CodeGenSubRegIndex*, 8>
Parts
;
347
Parts
.push_back(getSubRegIndex(SR->ExplicitSubRegs[j]));
349
// Offer this as an existing spelling for the concatenation of
Parts
.
350
RegBank.addConcatSubRegIndex(
Parts
, ExplicitSubRegIndices[i]);
428
SmallVector<CodeGenSubRegIndex*, 8>
Parts
(1, I->first)
[
all
...]
Completed in 341 milliseconds