| /external/webrtc/talk/app/webrtc/objc/ |
| RTCICECandidate+Internal.h | 35 webrtc::IceCandidateInterface* candidate; variable
37 - (id)initWithCandidate:(const webrtc::IceCandidateInterface*)candidate;
|
| /external/vogar/src/vogar/ |
| ClassAnalyzer.java | 32 Method candidate = klass.getMethod(name, parameters); local
33 int modifier = candidate.getModifiers();
34 Class<?> actualReturnType = candidate.getReturnType();
|
| /external/webrtc/webrtc/examples/objc/AppRTCDemo/ |
| ARDSignalingMessage.h | 34 @property(nonatomic, readonly) RTCICECandidate *candidate; variable
36 - (instancetype)initWithCandidate:(RTCICECandidate *)candidate;
|
| /frameworks/av/drm/libmediadrm/ |
| PluginMetricsReporting.cpp | 57 char candidate = input[i]; local
58 if ((candidate >= 'a' && candidate <= 'z') ||
59 (candidate >= 'A' && candidate <= 'Z') ||
60 (candidate >= '0' && candidate <= '9')) {
61 output.append(&candidate, 1);
|
| /art/compiler/optimizing/ |
| ssa_phi_elimination.cc | 164 HInstruction* candidate = nullptr; local
177 } else if (candidate == nullptr) {
178 candidate = input;
179 } else if (candidate != input) {
180 candidate = nullptr;
185 // If we haven't found a candidate, check for a phi cycle. Note that we need to detect
188 if (candidate == nullptr) {
207 } else if (candidate == nullptr) {
208 candidate = input;
209 } else if (candidate != input)
[all...] |
| instruction_simplifier_x86_shared.cc | 67 HInstruction* candidate = nullptr; local
72 candidate = left;
75 candidate = right;
78 if (candidate != nullptr && candidate->HasOnlyOneNonEnvironmentUse()) {
83 DCHECK(!candidate->HasUses());
84 candidate->GetBlock()->RemoveInstruction(candidate);
103 HInstruction* candidate = nullptr; local
105 candidate = left
[all...] |
| /art/test/150-loadlibrary/src/ |
| Main.java | 36 String candidate = p + libName; local
37 if (new File(candidate).exists()) {
38 fileName = candidate;
|
| /external/deqp-deps/glslang/glslang/MachineIndependent/ |
| LiveTraverser.h | 75 TIntermAggregate* candidate = globals[f]->getAsAggregate(); local
76 if (candidate && candidate->getOp() == EOpFunction && candidate->getName() == name) {
77 functions.push_back(candidate);
|
| ParseContextBase.cpp | 318 // * list of candidate signatures to select from
331 // * best matching candidate (or none, if no viable candidates found)
346 // where each viable candidate has
356 // 3. If there is only one viable candidate, it is the best match.
358 // 4. If there are multiple viable candidates, select the first viable candidate
359 // as the incumbent. Compare the incumbent to the next viable candidate, and if
360 // that candidate is better (bullets below), make it the incumbent. Repeat, with
361 // a linear walk through the viable candidate list. The final incumbent will be
362 // returned as the best match. A viable candidate is better than the incumbent if
367 // candidate, for either in or out (as needed
380 const TFunction& candidate = *(*it); local
445 const TFunction& candidate = *(*it); local
454 const TFunction& candidate = *(*it); local
[all...] |
| SymbolTable.cpp | 237 tLevel::const_iterator candidate = level.lower_bound(name); local
238 while (candidate != level.end()) {
239 const TString& candidateName = (*candidate).first;
242 TFunction* function = (*candidate).second->getAsFunction();
246 ++candidate;
254 tLevel::const_iterator candidate = level.lower_bound(name); local
255 while (candidate != level.end()) {
256 const TString& candidateName = (*candidate).first;
259 TSymbol* symbol = candidate->second;
263 ++candidate;
[all...] |
| /external/v8/src/ |
| version.cc | 30 const char* candidate = IsCandidate() ? " (candidate)" : ""; local
33 GetPatch(), GetEmbedder(), candidate);
36 GetEmbedder(), candidate);
45 const char* candidate = IsCandidate() ? "-candidate" : ""; local
48 GetBuild(), GetPatch(), GetEmbedder(), candidate);
51 GetEmbedder(), candidate);
|
| /external/webrtc/talk/app/webrtc/ |
| jsepicecandidate.h | 36 #include "webrtc/p2p/base/candidate.h"
45 const cricket::Candidate& candidate);
49 void SetCandidate(const cricket::Candidate& candidate) {
50 candidate_ = candidate;
55 virtual const cricket::Candidate& candidate() const { function in class:webrtc::JsepIceCandidate
64 cricket::Candidate candidate_;
77 virtual bool HasCandidate(const IceCandidateInterface* candidate) const
[all...] |
| /frameworks/av/services/oboeservice/ |
| AAudioStreamTracker.cpp | 72 auto candidate = it->second; local
73 if (candidate->getPortHandle() == portHandle) {
74 serviceStream = candidate;
|
| /external/desugar/java/com/google/devtools/common/options/ |
| GenericTypeHelper.java | 91 Type candidate = matchTypeVariable(type, variable); local
92 if (candidate != null) {
93 return candidate;
98 candidate = matchTypeVariable(interfaceType, variable);
99 if (candidate != null) {
100 return candidate;
|
| /external/guava/guava/src/com/google/common/collect/ |
| RegularImmutableSet.java | 50 Object candidate = table[i & mask]; local
51 if (candidate == null) {
54 if (candidate.equals(target)) {
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_program_pair.c | 42 int candidate = -1; local
88 candidate = i;
93 candidate = RC_PAIR_PRESUB_SRC;
94 } else if (candidate < 0 || (rgb && rgb_used > 2)
99 /* candidate >= 0 */
102 pair->RGB.Src[candidate].Used = 1;
103 pair->RGB.Src[candidate].File = file;
104 pair->RGB.Src[candidate].Index = index;
105 if (candidate == RC_PAIR_PRESUB_SRC) {
115 pair->Alpha.Src[candidate].Used = 1
[all...] |
| /external/icu/icu4c/source/common/ |
| static_unicode_sets.cpp | 37 UnicodeSet* candidate = gUnicodeSets[key]; local
38 if (candidate == nullptr) {
41 return candidate;
|
| /external/objenesis/tck/src/main/java/org/objenesis/tck/ |
| CandidateLoader.java | 24 * Loads a set of candidate classes from a properties file into the TCK.
42 * Called whenever, trying to retrieve a candidate class from its name, a
45 * @param name Candidate class name
102 * Load a candidate property file
123 Class<?> candidate = Class.forName(key, true, classloader); local
124 tck.registerCandidate(candidate, value);
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| clone_constants_for_better_clustering.cc | 29 string candidate; local
31 candidate = absl::StrCat(prefix, "/clone_", unique_name_counter_++);
32 } while (name_set.contains(candidate));
33 return candidate;
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| partitioning_utils.cc | 136 const string candidate = strings::StrCat(name_, "_", counter_); local
137 if (flib_def_->Find(candidate) == nullptr) {
138 return candidate;
|
| /external/tensorflow/tensorflow/core/graph/ |
| optimizer_cse.cc | 179 // candidate for a given node hash value. This may cause us to
203 Node** candidate = &available[h]; local
204 if (*candidate == nullptr) {
206 *candidate = n;
207 } else if (Equivalent(*candidate, n, &scratch)) {
208 VLOG(1) << "CSE: equivalent: " << (*candidate)->name() << " and "
210 // *candidate and n are equivalent. Therefore, we can replace
211 // n with *candidate by fixing up outgoing edges from "n" to instead
212 // come from "*candidate", and then delete n from the graph
214 g_->AddEdge(*candidate, e->src_output(), e->dst(), e->dst_input())
[all...] |
| /external/v8/src/compiler/ |
| instruction-scheduler.cc | 18 // the next best candidate to schedule.
31 auto candidate = nodes_.end(); local
35 candidate = iterator;
40 if (candidate != nodes_.end()) {
41 ScheduleGraphNode *result = *candidate;
42 nodes_.erase(candidate);
54 auto candidate = nodes_.begin(); local
55 std::advance(candidate, isolate()->random_number_generator()->NextInt(
57 ScheduleGraphNode *result = *candidate;
58 nodes_.erase(candidate);
224 ScheduleGraphNode* candidate = ready_list.PopBestCandidate(cycle); local
[all...] |
| /external/v8/src/heap/ |
| objects-visiting.cc | 36 // Check whether to keep the candidate in the list.
37 T* candidate = reinterpret_cast<T*>(list); local
42 list = WeakListVisitor<T>::WeakNext(candidate);
62 candidate = reinterpret_cast<T*>(retained);
63 tail = candidate;
69 WeakListVisitor<T>::VisitPhantomObject(heap, candidate);
83 T* candidate = reinterpret_cast<T*>(list); local
84 list = WeakListVisitor<T>::WeakNext(candidate);
85 WeakListVisitor<T>::SetWeakNext(candidate, undefined);
|
| /art/test/674-hiddenapi/src-art/ |
| Main.java | 138 String candidate = p + libName; local
139 if (new File(candidate).exists()) {
140 nativeLibFileName = candidate;
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| CollectionBenchmarkSampleData.java | 88 Element candidate = newElement(); local
89 if (!elementsInSet.contains(candidate)) {
90 queryList.add(candidate);
|
