| /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 | 116 std::pair<StringRef, StringRef> Split = Repl.split('\\');
119 Res += Split.first;
122 if (Split.second.empty()) {
123 if (Repl.size() != Split.first.size() &&
130 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 | 40 StringArray_t paths = Split(path);
56 StringArray_t paths = Split(path);
72 StringArray_t paths = Split(path);
99 StringArray_t Path::Split() const {
183 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/llvm/lib/IR/ |
| DataLayout.cpp | 196 /// Checked version of split, to ensure mandatory subparts.
197 static std::pair<StringRef, StringRef> split(StringRef Str, char Separator) { function
199 std::pair<StringRef, StringRef> Split = Str.split(Separator);
200 assert((!Split.second.empty() || Split.first == Str) &&
202 return Split;
222 // Split at '-'.
223 std::pair<StringRef, StringRef> Split = split(Desc, '-')
[all...] |
| /external/llvm/lib/MC/ |
| SubtargetFeature.cpp | 54 /// Split - Splits a string of comma separated items in to a vector of strings.
56 static void Split(std::vector<std::string> &V, const StringRef S) {
58 S.split(Tmp, ",", -1, false /* KeepEmpty */);
141 Split(Features, Initial);
|
| /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/chromium_org/third_party/webrtc/video_engine/test/auto_test/primitives/ |
| input_helpers.cc | 123 std::vector<std::string> all_overrides = Split(overrides, ",");
126 std::vector<std::string> key_value = Split(*override, "=");
153 std::vector<std::string> Split(const std::string& to_split,
|
| /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,
64 /// \brief Replaces the whitespace range described by \p Split with a single
67 Split Split,
125 Split getSplit(unsigned LineIndex, unsigned TailOffset
[all...] |
| ContinuationIndenter.cpp | 172 // We need special cases for ">>" which we have split into two ">" while
366 // short. Also always add the penalty if the LHS is split over mutliple lines
704 // Don't allow the RHS of an operator to be split over multiple lines unless
[all...] |
| /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/Transforms/IPO/ |
| LoopExtractor.cpp | 230 // 'invoke', then we want to split the landing pad.
231 bool Split = false;
237 Split = true;
242 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/tools/macho-dump/ |
| macho-dump.cpp | 311 std::pair<StringRef,StringRef> Split = Data.split('\0');
313 outs().write_escaped(Split.first);
315 Data = Split.second;
|
| /hardware/qcom/display/msm8974/libqdutils/ |
| mdp_version.h | 79 struct Split {
82 Split() : mLeft(0), mRight(0){}
117 Split mSplit;
|
| /external/chromium_org/ui/gfx/geometry/ |
| r_tree_base.cc | 201 scoped_ptr<RTreeBase::NodeBase> RTreeBase::Node::Split(size_t min_children,
206 // Determine if we should split along the horizontal or vertical axis.
230 // Choose |end_index| such that both Nodes after the split will have
243 // Choose split index along chosen axis and perform the split.
566 // Split() will create a sibling to insert_parent both of which will have
568 node = insert_parent->Split(min_children_, max_children_);
|
| /external/llvm/include/llvm/Target/ |
| TargetCallingConv.h | 44 static const uint64_t Split = 1ULL<<11;
102 bool isSplit() const { return Flags & Split; }
|
| /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);
|
| /hardware/qcom/display/msm8084/libqdutils/ |
| mdp_version.h | 86 struct Split {
89 Split() : mLeft(0), mRight(0){}
168 Split mSplit;
173 //Additional property on top of source split
|
