| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
| radeon_swizzle.h | 51 * Determine how to split access to the masked channels of the
54 void (*Split)(struct rc_src_register reg, unsigned int mask, struct rc_swizzle_split * split);
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_swizzle.h | 51 * Determine how to split access to the masked channels of the
54 void (*Split)(struct rc_src_register reg, unsigned int mask, struct rc_swizzle_split * split);
|
| /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 | 114 std::pair<StringRef, StringRef> Split = Repl.split('\\');
117 Res += Split.first;
120 if (Split.second.empty()) {
121 if (Repl.size() != Split.first.size() &&
128 Repl = Split.second;
|
| /external/llvm/lib/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/chromium_org/native_client_sdk/src/libraries/nacl_io/ |
| path.cc | 44 StringArray_t paths = Split(path);
57 StringArray_t paths = Split(path);
69 StringArray_t paths = Split(path);
94 StringArray_t Path::Split() const {
174 StringArray_t Path::Split(const std::string& path) {
|
| /external/chromium_org/third_party/re2/re2/testing/ |
| regexp_generator.cc | 228 // Split s into an vector of strings, one for each UTF-8 character.
242 // Split string everywhere a substring is found, returning
244 vector<string> Split(const StringPiece& sep, const StringPiece& s) {
|
| /external/clang/lib/Format/ |
| BreakableToken.h | 36 /// \brief Contains starting character index and length of split.
37 typedef std::pair<StringRef::size_type, unsigned> Split;
57 virtual Split getSplit(unsigned LineIndex, unsigned TailOffset,
60 /// \brief Emits the previously retrieved \p Split via \p Whitespaces.
61 virtual void insertBreak(unsigned LineIndex, unsigned TailOffset, Split Split,
112 virtual Split getSplit(unsigned LineIndex, unsigned TailOffset,
114 virtual void insertBreak(unsigned LineIndex, unsigned TailOffset, Split Split,
127 virtual Split getSplit(unsigned LineIndex, unsigned TailOffset
[all...] |
| /external/llvm/lib/IR/ |
| DataLayout.cpp | 179 /// Checked version of split, to ensure mandatory subparts.
180 static std::pair<StringRef, StringRef> split(StringRef Str, char Separator) { function
182 std::pair<StringRef, StringRef> Split = Str.split(Separator);
183 assert((!Split.second.empty() || Split.first == Str) &&
185 return Split;
204 // Split at '-'.
205 std::pair<StringRef, StringRef> Split = split(Desc, '-')
[all...] |
| /external/regex-re2/re2/testing/ |
| regexp_generator.cc | 228 // Split s into an vector of strings, one for each UTF-8 character.
242 // Split string everywhere a substring is found, returning
244 vector<string> Split(const StringPiece& sep, const StringPiece& s) {
|
| /external/chromium_org/net/http/ |
| http_security_headers.cc | 107 StringPair Split(const std::string& source, char delimiter) {
289 StringPair semicolon = Split(source, ';');
292 StringPair equals = Split(semicolon.first, '=');
|
| /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/llvm/lib/MC/ |
| 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) {
180 Split(Features, Initial);
|
| /external/llvm/lib/Transforms/IPO/ |
| LoopExtractor.cpp | 226 // 'invoke', then we want to split the landing pad.
227 bool Split = false;
233 Split = true;
238 if (!Split) continue;
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| page_heap.cc | 146 Span* PageHeap::Split(Span* span, Length n) {
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| page_heap.cc | 145 Span* PageHeap::Split(Span* span, Length n) {
|
| /external/clang/lib/Rewrite/Core/ |
| DeltaTree.cpp | 57 SourceDelta Split;
104 /// split the node, populate InsertRes with info about the split, and return
136 Values[0] = IR.Split;
137 FullDelta = IR.LHS->getFullDelta()+IR.RHS->getFullDelta()+IR.Split.Delta;
177 /// split the node, populate InsertRes with info about the split, and return
213 // Otherwise, if this is leaf is full, split the node at its median, insert
218 if (InsertRes->Split.FileLoc > FileIndex)
230 // Okay, this split the subtree, producing a new value and two children t
[all...] |
| /external/llvm/include/llvm/Target/ |
| TargetCallingConv.h | 43 static const uint64_t Split = 1ULL<<11;
86 bool isSplit() const { return Flags & Split; }
|
| /external/llvm/tools/macho-dump/ |
| macho-dump.cpp | 321 std::pair<StringRef,StringRef> Split = Data.split('\0');
323 outs().write_escaped(Split.first);
325 Data = Split.second;
|
| /hardware/qcom/display/msm8974/libqdutils/ |
| mdp_version.h | 79 struct Split {
82 Split() : mLeft(0), mRight(0){}
117 Split mSplit;
|
| /external/openfst/src/include/fst/ |
| minimize.h | 212 // - loop over states in fst and split on final, creating two blocks
220 // initial split (F, S - F)
232 void Split(ClassId C) {
242 // Now pop arc iterator from queue, split entering equivalence class
280 // split on C, all labels in C
281 Split(C);
|
| /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/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/ |
| bezier.c | 67 static INLINE void split(struct bezier *bez, function
127 /* split, second half of the bezier goes lower into the stack */
128 split(b, b+1, b);
147 split(bez, &left, &right); /* split in two */
246 Split,
266 return Split;
273 return Split;
560 split(b, b+1, b);
569 /* if res isn't Ok or Split then *o is undefined *
[all...] |
| /external/clang/lib/Frontend/ |
| CompilerInvocation.cpp | 247 checkerList.split(checkers, ",");
261 configList.split(configVals, ",");
264 llvm::tie(key, val) = configVals[i].split("=");
[all...] |
| /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...] |
