OpenGrok
Home
Sort by:
relevance
|
last modified time
|
path
Full Search
in project(s):
src
xsrc
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:StrLen
(Results
1 - 20
of
20
) sorted by relevancy
/src/sys/external/bsd/gnu-efi/dist/lib/
console.c
38
IN UINTN
StrLen
40
// Input a string at the current cursor location, for
StrLen
47
StrLen
57
IN UINTN
StrLen
59
// Input a string at the current cursor location, for
StrLen
93
if (Len <
StrLen
-1) {
str.c
181
StrLen
(
print.c
326
len =
StrLen
(Buffer);
368
newlen = spc->len +
StrLen
(Buffer) + 1;
1416
UINTN x =
StrLen
(Buffer);
/src/external/apache2/llvm/dist/llvm/lib/Target/BPF/
BTF.h
85
uint32_t
StrLen
; ///< Length of string section
BTFDebug.cpp
792
uint32_t TypeLen = 0,
StrLen
;
795
StrLen
= StringTable.getSize();
800
OS.emitInt32(
StrLen
);
/src/common/dist/zlib/contrib/pascal/
example.pas
61
len :=
StrLen
(hello)+1;
90
len :=
StrLen
(hello)+1;
162
uncomprLen :=
StrLen
(PChar(uncompr));
189
len :=
StrLen
(hello)+1;
373
len :=
StrLen
(hello)+1;
461
err := deflateSetDictionary(c_stream, dictionary,
StrLen
(dictionary));
469
c_stream.avail_in :=
StrLen
(hello)+1;
513
err := inflateSetDictionary(d_stream, dictionary,
StrLen
(dictionary));
/src/external/apache2/llvm/dist/clang/include/clang/Basic/
IdentifierTable.h
148
template <std::size_t
StrLen
>
149
bool isStr(const char (&Str)[
StrLen
]) const {
150
return getLength() ==
StrLen
-1 &&
151
memcmp(getNameStart(), Str,
StrLen
-1) == 0;
/src/external/gpl3/binutils/dist/zlib/contrib/pascal/
example.pas
61
len :=
StrLen
(hello)+1;
90
len :=
StrLen
(hello)+1;
162
uncomprLen :=
StrLen
(PChar(uncompr));
189
len :=
StrLen
(hello)+1;
373
len :=
StrLen
(hello)+1;
461
err := deflateSetDictionary(c_stream, dictionary,
StrLen
(dictionary));
469
c_stream.avail_in :=
StrLen
(hello)+1;
513
err := inflateSetDictionary(d_stream, dictionary,
StrLen
(dictionary));
/src/external/gpl3/binutils.old/dist/zlib/contrib/pascal/
example.pas
61
len :=
StrLen
(hello)+1;
90
len :=
StrLen
(hello)+1;
162
uncomprLen :=
StrLen
(PChar(uncompr));
189
len :=
StrLen
(hello)+1;
373
len :=
StrLen
(hello)+1;
461
err := deflateSetDictionary(c_stream, dictionary,
StrLen
(dictionary));
469
c_stream.avail_in :=
StrLen
(hello)+1;
513
err := inflateSetDictionary(d_stream, dictionary,
StrLen
(dictionary));
/src/external/gpl3/gdb/dist/zlib/contrib/pascal/
example.pas
61
len :=
StrLen
(hello)+1;
90
len :=
StrLen
(hello)+1;
162
uncomprLen :=
StrLen
(PChar(uncompr));
189
len :=
StrLen
(hello)+1;
373
len :=
StrLen
(hello)+1;
461
err := deflateSetDictionary(c_stream, dictionary,
StrLen
(dictionary));
469
c_stream.avail_in :=
StrLen
(hello)+1;
513
err := inflateSetDictionary(d_stream, dictionary,
StrLen
(dictionary));
/src/external/gpl3/gdb.old/dist/zlib/contrib/pascal/
example.pas
61
len :=
StrLen
(hello)+1;
90
len :=
StrLen
(hello)+1;
162
uncomprLen :=
StrLen
(PChar(uncompr));
189
len :=
StrLen
(hello)+1;
373
len :=
StrLen
(hello)+1;
461
err := deflateSetDictionary(c_stream, dictionary,
StrLen
(dictionary));
469
c_stream.avail_in :=
StrLen
(hello)+1;
513
err := inflateSetDictionary(d_stream, dictionary,
StrLen
(dictionary));
/src/external/apache2/llvm/dist/clang/include/clang/Sema/
TypoCorrection.h
207
template<std::size_t
StrLen
>
208
bool isKeyword(const char (&Str)[
StrLen
]) const {
/src/external/apache2/llvm/dist/clang/lib/Basic/
Diagnostic.cpp
559
template <std::size_t
StrLen
>
561
const char (&Str)[
StrLen
]) {
562
return
StrLen
-1 == ModifierLen && memcmp(Modifier, Str,
StrLen
-1) == 0;
922
OutStr.append(S, S +
strlen
(S));
993
OutStr.append(S, S +
strlen
(S));
/src/sys/external/bsd/gnu-efi/dist/inc/
efilib.h
376
StrLen
(
516
IN UINTN
StrLen
525
IN UINTN
StrLen
/src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
SimplifyLibCalls.cpp
226
// memory is to be moved to. We just generate a call to
strlen
.
314
if (CharC->isZero()) // strchr(p, 0) -> p +
strlen
(p)
315
if (Value *
StrLen
= emitStrLen(SrcStr, B, DL, TLI))
316
return B.CreateGEP(B.getInt8Ty(), SrcStr,
StrLen
, "strchr");
321
// zero (a weird way to spell
strlen
).
523
if (Dst == Src) { // stpcpy(x,x) -> x+
strlen
(x)
524
Value *
StrLen
= emitStrLen(Src, B, DL, TLI);
525
return
StrLen
? B.CreateInBoundsGEP(B.getInt8Ty(), Dst,
StrLen
) : nullptr;
616
// Constant folding:
strlen
("xyz") ->
[
all
...]
/src/external/apache2/llvm/dist/llvm/lib/InterfaceStub/
ELFObjHandler.cpp
352
size_t
StrLen
= StrEnd - Offset;
353
return Str.substr(Offset,
StrLen
);
/src/external/apache2/llvm/dist/clang/lib/Sema/
SemaChecking.cpp
597
// - Evaluate
strlen
of strcpy arguments, use as object size.
636
size_t
StrLen
=
639
H, FormatBytes, FormatBytes +
StrLen
, getLangOpts(),
688
// Whether these functions overflow depends on the runtime
strlen
of the
767
FunctionName = FunctionName.drop_front(std::
strlen
("__builtin___"));
768
FunctionName = FunctionName.drop_back(std::
strlen
("_chk"));
770
FunctionName = FunctionName.drop_front(std::
strlen
("__builtin_"));
9266
size_t
StrLen
= std::min(std::max(TypeSize, size_t(1)) - 1, StrRef.size());
9271
Str, Str +
StrLen
, S.getLangOpts(), S.Context.getTargetInfo()))
9287
if (
StrLen
== 0 && numDataArgs > 0)
[
all
...]
SemaInit.cpp
2915
uint64_t
StrLen
= SL->getLength();
2916
if (cast<ConstantArrayType>(AT)->getSize().ult(
StrLen
))
2917
StrLen
= cast<ConstantArrayType>(AT)->getSize().getZExtValue();
2918
StructuredList->resizeInits(Context,
StrLen
);
2922
for (unsigned i = 0, e =
StrLen
; i != e; ++i) {
2938
uint64_t
StrLen
= Str.size();
2939
if (cast<ConstantArrayType>(AT)->getSize().ult(
StrLen
))
2940
StrLen
= cast<ConstantArrayType>(AT)->getSize().getZExtValue();
2941
StructuredList->resizeInits(Context,
StrLen
);
2945
for (unsigned i = 0, e =
StrLen
; i != e; ++i)
[
all
...]
/src/external/apache2/llvm/dist/llvm/lib/Analysis/
ConstantFolding.cpp
704
size_t
StrLen
= Str.size();
708
if ((NumBits >> 3) ==
StrLen
+ 1 && (NumBits & 7) == 0 &&
/src/external/apache2/llvm/dist/clang/lib/AST/
ItaniumMangle.cpp
3440
Out <<
strlen
(BaseName) +
strlen
(EltName);
5965
template <std::size_t
StrLen
>
5967
const char (&Str)[
StrLen
]) {
Completed in 84 milliseconds
Indexes created Wed Jun 17 00:25:26 UTC 2026