OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Cur
(Results
1 - 16
of
16
) sorted by null
/external/llvm/include/llvm/Support/
circular_raw_ostream.h
58
///
Cur
- Pointer to the current output point in BufferArray.
60
char *
Cur
;
77
TheStream->write(
Cur
, BufferArray + BufferSize -
Cur
);
79
TheStream->write(BufferArray,
Cur
- BufferArray);
80
Cur
= BufferArray;
120
Cur
= BufferArray;
130
Cur
= BufferArray;
Registry.h
69
for (listener *
Cur
= ListenerHead;
Cur
;
Cur
=
Cur
->Next)
70
Cur
->registered(E);
104
const node *
Cur
;
107
explicit iterator(const node *N) :
Cur
(N) {}
109
bool operator==(const iterator &That) const { return
Cur
== That.
Cur
; }
110
bool operator!=(const iterator &That) const { return
Cur
!= That.Cur;
[
all
...]
/external/clang/lib/AST/
TypeLoc.cpp
101
TypeLoc
Cur
= *this;
102
TypeLoc LeftMost =
Cur
;
104
switch (
Cur
.getTypeLocClass()) {
106
LeftMost =
Cur
;
109
if (
Cur
.castAs<FunctionProtoTypeLoc>().getTypePtr()
111
LeftMost =
Cur
;
122
Cur
=
Cur
.getNextTypeLoc();
125
if (!
Cur
.getLocalSourceRange().getBegin().isInvalid())
126
LeftMost =
Cur
;
[
all
...]
Type.cpp
247
QualType
Cur
= T;
249
const Type *CurTy = Qs.strip(
Cur
);
257
Cur
= Ty->desugar(); \
314
template<typename T> static const T *getAsSugar(const Type *
Cur
) {
316
if (const T *Sugar = dyn_cast<T>(
Cur
))
318
switch (
Cur
->getTypeClass()) {
322
const Class##Type *Ty = cast<Class##Type>(
Cur
); \
324
Cur
= Ty->desugar().getTypePtr(); \
344
const Type *
Cur
= this;
347
switch (
Cur
->getTypeClass())
[
all
...]
/external/llvm/lib/Target/ARM/
ARMJITInfo.cpp
144
uint8_t *
Cur
= Buffer;
145
MachineCodeEmitter::emitWordLEInto(
Cur
, (intptr_t)Ptr);
/external/clang/lib/Driver/
ArgList.cpp
301
StringRef
Cur
= getArgString(Index);
302
if (
Cur
.size() == LHS.size() + RHS.size() &&
303
Cur
.startswith(LHS) &&
Cur
.endswith(RHS))
304
return
Cur
.data();
/external/clang/lib/Sema/
IdentifierResolver.cpp
51
IdDeclInfoPool *
Cur
= CurPool;
52
while (IdDeclInfoPool *P =
Cur
) {
53
Cur
=
Cur
->Next;
SemaDecl.cpp
[
all
...]
/external/llvm/lib/IR/
DebugLoc.cpp
221
MDNode *
Cur
= get();
225
assert(Ctx->ScopeRecordIdx[
Cur
] == Idx && "Mapping out of date!");
226
Ctx->ScopeRecordIdx.erase(
Cur
);
Metadata.cpp
56
MDNodeOperand *
Cur
= this;
58
while (
Cur
->getValPtrInt() != 1)
59
--
Cur
;
61
assert(
Cur
->getValPtrInt() == 1 &&
63
return reinterpret_cast<MDNode*>(
Cur
) - 1;
/external/llvm/lib/Option/
ArgList.cpp
286
StringRef
Cur
= getArgString(Index);
287
if (
Cur
.size() == LHS.size() + RHS.size() &&
288
Cur
.startswith(LHS) &&
Cur
.endswith(RHS))
289
return
Cur
.data();
/external/llvm/lib/Target/X86/
X86JITInfo.cpp
447
uint8_t *
Cur
= Buffer;
448
MachineCodeEmitter::emitWordLEInto(
Cur
, (unsigned)(intptr_t)ptr);
449
MachineCodeEmitter::emitWordLEInto(
Cur
, (unsigned)(((intptr_t)ptr) >> 32));
453
uint8_t *
Cur
= Buffer;
454
MachineCodeEmitter::emitWordLEInto(
Cur
, (intptr_t)ptr);
/external/llvm/lib/Transforms/Utils/
LowerSwitch.cpp
86
BasicBlock *
Cur
= I++; // Advance over block so we don't traverse new blocks
88
if (SwitchInst *SI = dyn_cast<SwitchInst>(
Cur
->getTerminator())) {
/external/llvm/tools/llvm-diff/
DifferenceEngine.cpp
499
DiffEntry *
Cur
= Paths1.data();
510
Cur
[I].Cost = I * LeftCost;
512
Cur
[I].Path.push_back(DC_left);
517
Next[0] =
Cur
[0];
524
Next[Index] =
Cur
[Index-1];
528
} else if (Next[Index-1].Cost <=
Cur
[Index].Cost) {
533
Next[Index] =
Cur
[Index];
539
std::swap(
Cur
, Next);
546
SmallVectorImpl<char> &Path =
Cur
[NL].Path;
/external/llvm/utils/TableGen/
RegisterInfoEmitter.cpp
573
uint16_t
Cur
= List[i];
574
V.push_back(
Cur
- Val);
575
Val =
Cur
;
586
uint16_t
Cur
= (*I)->EnumValue;
587
V.push_back(
Cur
- Val);
588
Val =
Cur
;
[
all
...]
/external/llvm/lib/MC/
MCAssembler.cpp
99
MCFragment *
Cur
= LastValidFragment[&SD];
100
if (!
Cur
)
101
Cur
= &*SD.begin();
103
Cur
=
Cur
->getNextNode();
107
assert(
Cur
&& "Layout bookkeeping error");
108
const_cast<MCAsmLayout*>(this)->layoutFragment(
Cur
);
109
Cur
=
Cur
->getNextNode();
[
all
...]
Completed in 311 milliseconds