Home
last modified time | relevance | path

Searched refs:matrixInstance (Results 1 – 6 of 6) sorted by relevance

/system/libvintf/analyze_matrix/
Danalyze_matrix.cpp51 mat.forEachInstance([&set](const auto& matrixInstance) { in getInterfaces() argument
52 for (auto minorVer = matrixInstance.versionRange().minMinor; in getInterfaces()
53 minorVer <= matrixInstance.versionRange().maxMinor; ++minorVer) { in getInterfaces()
55 if (!fqInstance.setTo(matrixInstance.package(), matrixInstance.versionRange().majorVer, in getInterfaces()
56 minorVer, matrixInstance.interface())) { in getInterfaces()
57 LOG(ERROR) << "Matrix not valid; '" << matrixInstance.package() << "@" in getInterfaces()
58 << matrixInstance.versionRange().majorVer << "." << minorVer in getInterfaces()
59 << "::" << matrixInstance.interface() << "' is not a valid FQName."; in getInterfaces()
/system/libvintf/
Dmain.cpp201 matrix->forEachInstance([&](const auto& matrixInstance) { in insert() argument
202 for (auto minorVer = matrixInstance.versionRange().minMinor; in insert()
203 minorVer <= matrixInstance.versionRange().maxMinor; ++minorVer) { in insert()
205 matrixInstance.package(), Version{matrixInstance.versionRange().majorVer, minorVer}, in insert()
206 matrixInstance.interface(), in insert()
207 matrixInstance.isRegex() ? matrixInstance.regexPattern() in insert()
208 : matrixInstance.exactInstance()); in insert()
214 if (minorVer == matrixInstance.versionRange().minMinor) { in insert()
215 it->second.required = !matrixInstance.optional(); in insert()
DCompatibilityMatrix.cpp139 existingHal->forEachInstance([&](const auto& matrixInstance) { in splitInstance() argument
140 bool interfaceMatch = matrixInstance.interface() == interface; in splitInstance()
142 if (matrixInstance.isRegex() && isRegex) { in splitInstance()
143 instanceMatch = (matrixInstance.regexPattern() == instanceOrPattern); in splitInstance()
144 } else if (!matrixInstance.isRegex() && !isRegex) { in splitInstance()
145 instanceMatch = (matrixInstance.exactInstance() == instanceOrPattern); in splitInstance()
453 bool cont = hal->forEachInstance([&](const MatrixInstance& matrixInstance) { in forEachInstanceOfVersion() argument
454 if (matrixInstance.versionRange().contains(expectVersion)) { in forEachInstanceOfVersion()
455 return func(matrixInstance); in forEachInstanceOfVersion()
DMatrixHal.cpp106 forEachInstance(vr, [&](const MatrixInstance& matrixInstance) { in isCompatible() argument
112 return matrixInstance.isSatisfiedBy(providedInstance); in isCompatible()
Dparse_string.cpp404 req.forEachInstance(vr, [&](const auto& matrixInstance) { in expandInstances() argument
406 s += toFQNameString(vr, matrixInstance.interface(), in expandInstances()
407 matrixInstance.isRegex() ? matrixInstance.regexPattern() in expandInstances()
408 : matrixInstance.exactInstance()); in expandInstances()
/system/libvintf/test/
Dvintf_object_tests.cpp789 fcm->forEachInstance([&found, &expectInstance](const auto& matrixInstance) { in TEST_F() argument
790 found |= matrixInstance.isSatisfiedBy(expectInstance); in TEST_F()