1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
|
/*
* Copyright 2013 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "gl/GrGLExtensions.h"
#include "gl/GrGLDefines.h"
#include "gl/GrGLUtil.h"
#include "SkTSearch.h"
#include "SkTSort.h"
namespace {
inline int extension_compare(const SkString* a, const SkString* b) {
return strcmp(a->c_str(), b->c_str());
}
}
bool GrGLExtensions::init(GrGLBinding binding,
GrGLGetStringProc getString,
GrGLGetStringiProc getStringi,
GrGLGetIntegervProc getIntegerv) {
fStrings.reset();
if (NULL == getString) {
return false;
}
bool indexed = false;
if (kDesktop_GrGLBinding == binding) {
const GrGLubyte* verString = getString(GR_GL_VERSION);
if (NULL == verString) {
return false;
}
GrGLVersion version = GrGLGetVersionFromString((const char*) verString);
indexed = version >= GR_GL_VER(3, 0);
}
if (indexed) {
if (NULL == getStringi || NULL == getIntegerv) {
return false;
}
GrGLint extensionCnt = 0;
getIntegerv(GR_GL_NUM_EXTENSIONS, &extensionCnt);
fStrings.push_back_n(extensionCnt);
for (int i = 0; i < extensionCnt; ++i) {
const char* ext = (const char*) getStringi(GR_GL_EXTENSIONS, i);
fStrings[i] = ext;
}
} else {
const char* extensions = (const char*) getString(GR_GL_EXTENSIONS);
if (NULL == extensions) {
return false;
}
while (true) {
// skip over multiple spaces between extensions
while (' ' == *extensions) {
++extensions;
}
// quit once we reach the end of the string.
if ('\0' == *extensions) {
break;
}
// we found an extension
size_t length = strcspn(extensions, " ");
fStrings.push_back().set(extensions, length);
extensions += length;
}
}
if (0 != fStrings.count()) {
SkTSearchCompareLTFunctor<SkString, extension_compare> cmp;
SkTQSort(&fStrings.front(), &fStrings.back(), cmp);
}
return true;
}
bool GrGLExtensions::has(const char* ext) const {
SkString extensionStr(ext);
int idx = SkTSearch<SkString, extension_compare>(&fStrings.front(),
fStrings.count(),
extensionStr,
sizeof(SkString));
return idx >= 0;
}
|
