| /external/llvm/lib/Target/ |
| TargetData.cpp | 157 std::pair<StringRef, StringRef> Split = Desc.split('-');
158 StringRef Token = Split.first;
159 Desc = Split.second;
164 Split = Token.split(':');
165 StringRef Specifier = Split.first;
166 Token = Split.second;
178 Split = Token.split(':')
[all...] |
| /external/llvm/utils/TableGen/ |
| StringMatcher.cpp | 57 std::pair<StringRef, StringRef> Split = Code.split('\n');
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/include/llvm/ADT/ |
| DeltaAlgorithm.h | 55 /// Split - Partition a set of changes \arg S into one or two subsets.
56 void Split(const changeset_ty &S, changesetlist_ty &Res);
|
| /external/llvm/lib/Support/ |
| DeltaAlgorithm.cpp | 28 void DeltaAlgorithm::Split(const changeset_ty &S, changesetlist_ty &Res) {
62 Split(*it, SplitSets);
78 Split(*it, Sets);
111 Split(Changes, Sets);
|
| Regex.cpp | 112 std::pair<StringRef, StringRef> Split = Repl.split('\\');
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/ |
| DefaultHdfParser.java | 54 Split split; local
55 if ((split = split(line, "=")) != null) {
57 output.setValue(createFullPath(context, split.left), split.right);
58 } else if ((split = split(line, "<<")) != null) {
63 output.setValue(createFullPath(context, split.left), readToToken(lineReader, split.right))
120 private Split split(String line, String delimiter) { method in class:DefaultHdfParser
[all...] |
| /external/clang/lib/Rewrite/ |
| DeltaTree.cpp | 57 SourceDelta Split;
104 /// split the node, populate InsertRes with info about the split, and return
138 Values[0] = IR.Split;
139 FullDelta = IR.LHS->getFullDelta()+IR.RHS->getFullDelta()+IR.Split.Delta;
180 /// split the node, populate InsertRes with info about the split, and return
216 // Otherwise, if this is leaf is full, split the node at its median, insert
221 if (InsertRes->Split.FileLoc > FileIndex)
233 // Okay, this split the subtree, producing a new value and two children t
[all...] |
| /external/llvm/include/llvm/Target/ |
| TargetCallingConv.h | 37 static const uint64_t Split = 1ULL << 10;
77 bool isSplit() const { return Flags & Split; }
|
| /external/llvm/lib/Transforms/IPO/ |
| LoopExtractor.cpp | 225 // 'invoke', then we want to split the landing pad.
226 bool Split = false;
232 Split = true;
237 if (!Split) continue;
|
| /external/harfbuzz/src/ |
| harfbuzz-indic.cpp | 484 Split,
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, None, Post, Above
1091 const unsigned short *split = split_matras; local
[all...] |
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/String/ |
| 15.5.4.8-3.js | 24 ECMA Section: 15.5.4.8 String.prototype.split( separator )
33 As a special case, if the separator is the empty string, the string is split
40 When the split method is called with one argument separator, the following steps are taken:
72 Note that the split function is intentionally generic; it does not require that its this value be a String
82 var TITLE = "String.prototype.split";
99 "var s = new String(); s.split().length",
101 eval("var s = new String(); s.split().length") );
104 "var s = new String(); s.split()[0]",
106 eval("var s = new String(); s.split()[0]") );
111 "var s = new String(); s.split('').length"
[all...] |
| /external/clang/lib/Driver/ |
| Driver.cpp | 247 std::pair<StringRef, StringRef> Split = CompilerPath.split(':');
248 PrefixDirs.push_back(Split.first);
249 CompilerPath = Split.second;
291 std::pair<StringRef, StringRef> Split = Cur.split(',');
293 if (!Split.first.empty()) {
295 llvm::Triple(Split.first, "", "").getArch();
298 Diag(clang::diag::err_drv_invalid_arch_name) << Split.first;
303 Cur = Split.second
[all...] |
| /external/llvm/lib/MC/ |
| SubtargetFeature.cpp | 67 /// Split - Splits a string of comma separated items in to a vector of strings.
69 static void Split(std::vector<std::string> &V, const StringRef S) {
180 Split(Features, Initial);
|
| /external/v8/src/arm/ |
| full-codegen-arm.cc | 595 Split(ne, if_true, if_false, fall_through);
599 void FullCodeGenerator::Split(Condition cond,
679 Split(eq, if_true, if_false, NULL);
[all...] |
| /external/v8/src/ia32/ |
| full-codegen-ia32.cc | 562 Split(not_zero, if_true, if_false, fall_through);
566 void FullCodeGenerator::Split(Condition cc,
643 Split(equal, if_true, if_false, NULL);
[all...] |
| /external/v8/src/x64/ |
| full-codegen-x64.cc | 566 Split(not_zero, if_true, if_false, fall_through);
570 void FullCodeGenerator::Split(Condition cc,
646 Split(equal, if_true, if_false, NULL);
[all...] |
| /cts/tests/SignatureTest/ |
| Android.mk | 97 # Split up config/api/1.xml by "package" and save the files as the
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| minimize.h | 199 // - loop over states in fst and split on final, creating two blocks
207 // initial split (F, S - F)
219 void Split(ClassId C) {
229 // Now pop arc iterator from queue, split entering equivalence class
267 // split on C, all labels in C
268 Split(C);
|
| /external/v8/test/mjsunit/compiler/ |
| expression-trees.js | 41 // Split the leaves into left and right subtrees in all possible
42 // ways. For each split recursively compute all possible subtrees.
|
| /external/llvm/include/llvm/Analysis/ |
| Dominators.h | 224 // NewBB is split and now it has one successor. Update dominator tree to
227 void Split(DominatorTreeBase<typename GraphT::NodeType>& DT,
539 /// splitBlock - BB is split and now it has one successor. Update dominator
543 this->Split<Inverse<NodeT*>, GraphTraits<Inverse<NodeT*> > >(*this, NewBB);
545 this->Split<NodeT*, GraphTraits<NodeT*> >(*this, NewBB);
811 /// splitBlock - BB is split and now it has one successor. Update dominator
|
| /external/llvm/lib/Transforms/Utils/ |
| InlineFunction.cpp | 113 // split unwind edge and then inlining it; but that can do almost
120 // transforms which split edges deal with that.
161 // Otherwise, we have to split at the first non-dominating block.
179 // br label %split // from lastDominated
184 // br label %split
185 // split:
186 // phis_2 (edge from lastDominated, edge from split)
202 // Split the non-dominated block.
203 BasicBlock *split = local
208 cast<BranchInst>(lastDominated->back()).setSuccessor(0, split);
[all...] |
| /external/freetype/src/smooth/ |
| ftgrays.c | 1017 /* Decide whether to split or draw. See `Rapid Termination */
1063 goto Split;
[all...] |
| /external/llvm/unittests/ADT/ |
| StringRefTest.cpp | 118 TEST(StringRefTest, Split) {
121 Str.split('X'));
123 Str.split('e'));
125 Str.split('h'));
127 Str.split('l'));
129 Str.split('o'));
148 StringRef(",ab,,c,").split(parts, ",", -1, false);
154 StringRef(",ab,,c,").split(parts, ",", -1, true);
159 StringRef("").split(parts, ",", -1, true);
163 StringRef("").split(parts, ",", -1, false)
[all...] |
| /external/v8/src/mips/ |
| full-codegen-mips.cc | 232 // void FullCodeGenerator::Split(Condition cc,
238 void FullCodeGenerator::Split(Condition cc,
|
| /external/v8/tools/gcmole/ |
| gcmole.lua | 92 SOURCES:gmatch "'([^']-)': Split%(\"\"\"(.-)\"\"\"%)" do
|
