/external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/String/ |
H A D | 15.5.4.8-3.js | 181 function Split( string, separator ) { function
|
/external/llvm/lib/TableGen/ |
H A D | StringMatcher.cpp | 57 std::pair<StringRef, StringRef> Split = Code.split('\n'); local 58 OS << Indent << Split.first << "\t // \"" << Matches[0]->first << "\"\n"; 60 Code = Split.second; 62 Split = Code.split('\n'); 63 OS << Indent << Split.first << "\n"; 64 Code = Split.second;
|
/external/llvm/lib/Support/ |
H A D | DeltaAlgorithm.cpp | 28 void DeltaAlgorithm::Split(const changeset_ty &S, changesetlist_ty &Res) { function in class:DeltaAlgorithm 62 Split(*it, SplitSets); 78 Split(*it, Sets); 111 Split(Changes, Sets);
|
H A D | Regex.cpp | 112 std::pair<StringRef, StringRef> Split = Repl.split('\\'); local 115 Res += Split.first; 118 if (Split.second.empty()) { 119 if (Repl.size() != Split.first.size() && 126 Repl = Split.second;
|
/external/jsilver/src/com/google/clearsilver/jsilver/data/ |
H A D | DefaultHdfParser.java | 54 Split split; 118 * Split a line in two, based on a delimiter. If the delimiter is not found, null is returned. 120 private Split split(String line, String delimiter) { 123 Split result = new Split(); 132 private static class Split { class in class:DefaultHdfParser
|
/external/clang/lib/Rewrite/Core/ |
H A D | DeltaTree.cpp | 57 SourceDelta Split; member in struct:__anon3686::DeltaTreeNode::InsertResult 138 Values[0] = IR.Split; 139 FullDelta = IR.LHS->getFullDelta()+IR.RHS->getFullDelta()+IR.Split.Delta; 221 if (InsertRes->Split.FileLoc > FileIndex) 247 Values[i] = InsertRes->Split; 257 SourceDelta SubSplit = InsertRes->Split; 264 if (SubSplit.FileLoc < InsertRes->Split.FileLoc) 293 /// DoSplit - Split the currently full node (which has 2*WidthFactor-1 values) 331 InsertRes.Split = Values[WidthFactor-1];
|
/external/llvm/include/llvm/Target/ |
H A D | TargetCallingConv.h | 41 static const uint64_t Split = 1ULL << 10; member in struct:llvm::ISD::ArgFlagsTy 81 bool isSplit() const { return Flags & Split; }
|
/external/llvm/lib/MC/ |
H A D | SubtargetFeature.cpp | 66 /// Split - Splits a string of comma separated items in to a vector of strings. 68 static void Split(std::vector<std::string> &V, const StringRef S) { function 179 Split(Features, Initial);
|
/external/llvm/lib/Transforms/IPO/ |
H A D | LoopExtractor.cpp | 227 bool Split = false; local 233 Split = true; 238 if (!Split) continue;
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | minimize.h | 219 void Split(ClassId C) { function in class:fst::CyclicMinimizer 268 Split(C);
|
/external/llvm/lib/Target/ |
H A D | TargetData.cpp | 165 std::pair<StringRef, StringRef> Split = Desc.split('-'); local 166 StringRef Token = Split.first; 167 Desc = Split.second; 172 Split = Token.split(':'); 173 StringRef Specifier = Split.first; 174 Token = Split.second; 189 Split = Token.split(':'); 190 int PointerMemSizeBits = getInt(Split.first); 197 Split = Split [all...] |
/external/llvm/lib/Transforms/Utils/ |
H A D | InlineFunction.cpp | 108 // Split the landing pad. 188 BasicBlock *Split = BB->splitBasicBlock(CI, CI->getName()+".noexc"); local 196 InvokeInst *II = InvokeInst::Create(CI->getCalledValue(), Split, 207 Split->getInstList().pop_front(); 766 // Split the basic block. This guarantees that no PHI nodes will have to be
|
/external/openfst/src/include/fst/ |
H A D | minimize.h | 232 void Split(ClassId C) { function in class:fst::CyclicMinimizer 281 Split(C);
|
/external/clang/lib/AST/ |
H A D | TypePrinter.cpp | 230 SplitQualType Split = T.split(); local 234 Qualifiers Quals = Split.Quals; 236 dyn_cast<SubstTemplateTypeParmType>(Split.Ty)) 239 printBefore(Split.Ty, Quals, OS);
|
/external/clang/lib/Driver/ |
H A D | Driver.cpp | 257 std::pair<StringRef, StringRef> Split = CompilerPath.split(':'); local 258 PrefixDirs.push_back(Split.first); 259 CompilerPath = Split.second; 301 std::pair<StringRef, StringRef> Split = Cur.split(','); local 303 if (!Split.first.empty()) { 305 llvm::Triple(Split.first, "", "").getArch(); 308 Diag(clang::diag::err_drv_invalid_arch_name) << Split.first; 313 Cur = Split.second; 1516 std::pair<StringRef, StringRef> Split = Name.split('.'); local 1518 GetTemporaryPath(Split 1561 std::pair<StringRef, StringRef> Split = Name.split('.'); local [all...] |
/external/clang/lib/Frontend/ |
H A D | CompilerInvocation.cpp | 2244 std::pair<StringRef,StringRef> Split = local 2247 if (Split.second.empty()) { 2252 Opts.addRemappedFile(Split.first, Split.second);
|
/external/clang/lib/Sema/ |
H A D | SemaStmtAsm.cpp | 396 std::pair<StringRef,StringRef> Split = Asm.split(' '); local 399 Pieces.push_back(Split.first); 400 Asm = Split.second; 404 Split = Asm.split(", "); 405 Pieces.push_back(Split.first); 406 Asm = Split.second;
|
/external/harfbuzz/src/ |
H A D | harfbuzz-indic.cpp | 484 Split, enumerator in enum:Position 556 Pre, None, None, Split, 557 Split, Below, None, None, 679 Split, None, None, Split, 680 Split, None, None, None, 720 Pre, None, Split, Split, 721 Split, Halant, None, None, 761 Split, Non [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | Dominators.h | 239 void Split(DominatorTreeBase<typename GraphT::NodeType>& DT, function in class:llvm::DominatorTreeBase 539 this->Split<Inverse<NodeT*>, GraphTraits<Inverse<NodeT*> > >(*this, NewBB); 541 this->Split<NodeT*, GraphTraits<NodeT*> >(*this, NewBB);
|
/external/v8/src/arm/ |
H A D | full-codegen-arm.cc | 696 Split(ne, if_true, if_false, fall_through); 700 void FullCodeGenerator::Split(Condition cond, function in class:v8::internal::FullCodeGenerator 786 Split(eq, if_true, if_false, NULL); 2498 Split(eq, if_true, if_false, fall_through); 2519 Split(eq, if_true, if_false, fall_through); 2552 Split(le, if_true, if_false, fall_through); 2574 Split(ge, if_true, if_false, fall_through); 2598 Split(ne, if_true, if_false, fall_through); 2706 Split(eq, if_true, if_false, fall_through); 2728 Split(e [all...] |
/external/v8/src/ia32/ |
H A D | full-codegen-ia32.cc | 674 Split(not_zero, if_true, if_false, fall_through); 678 void FullCodeGenerator::Split(Condition cc, function in class:v8::internal::FullCodeGenerator 760 Split(equal, if_true, if_false, NULL); 2437 Split(zero, if_true, if_false, fall_through); 2458 Split(zero, if_true, if_false, fall_through); 2490 Split(below_equal, if_true, if_false, fall_through); 2512 Split(above_equal, if_true, if_false, fall_through); 2536 Split(not_zero, if_true, if_false, fall_through); 2642 Split(equal, if_true, if_false, fall_through); 2664 Split(equa [all...] |
/external/v8/src/mips/ |
H A D | full-codegen-mips.cc | 703 Split(ne, v0, Operand(at), if_true, if_false, fall_through); 707 void FullCodeGenerator::Split(Condition cc, function in class:v8::internal::FullCodeGenerator 793 Split(eq, a0, Operand(t0), if_true, if_false, NULL); 2522 Split(eq, t0, Operand(zero_reg), if_true, if_false, fall_through); 2543 Split(eq, at, Operand(zero_reg), if_true, if_false, fall_through); 2573 Split(le, a1, Operand(LAST_NONCALLABLE_SPEC_OBJECT_TYPE), 2596 Split(ge, a1, Operand(FIRST_SPEC_OBJECT_TYPE), 2621 Split(ne, at, Operand(zero_reg), if_true, if_false, fall_through); 2749 Split(eq, a1, Operand(JS_ARRAY_TYPE), 2772 Split(e [all...] |
/external/v8/src/x64/ |
H A D | full-codegen-x64.cc | 615 Split(not_zero, if_true, if_false, fall_through); 619 void FullCodeGenerator::Split(Condition cc, function in class:v8::internal::FullCodeGenerator 700 Split(equal, if_true, if_false, NULL); 2352 Split(non_negative_smi, if_true, if_false, fall_through); 2384 Split(below_equal, if_true, if_false, fall_through); 2406 Split(above_equal, if_true, if_false, fall_through); 2430 Split(not_zero, if_true, if_false, fall_through); 2535 Split(equal, if_true, if_false, fall_through); 2557 Split(equal, if_true, if_false, fall_through); 2579 Split(equa [all...] |
/external/clang/lib/Serialization/ |
H A D | ASTReader.cpp | 207 std::pair<StringRef,StringRef> Split = local 209 StringRef Left = Split.first, Right = Split.second;
|
/external/v8/src/ |
H A D | jsregexp.cc | 4171 void CharacterRange::Split(ZoneList<CharacterRange>* base, function in class:v8::internal::CharacterRange
|