HomeSort by relevance Sort by last modified time
    Searched defs:match (Results 226 - 250 of 2151) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/mesa3d/src/mesa/program/
prog_parameter.c 43 * swizzling to find a match.
71 GLuint j, match = 0; local
74 match++;
76 if (match == vSize) {
96 /* see if we can match this constant (with a swizzle) */
98 GLuint match = 0, j, k; local
102 match++;
108 match++;
118 if (match == vSize) {
  /external/nist-sip/java/gov/nist/javax/sip/header/
StatusLine.java 63 /** Match with a template.
64 * Match only the response class if the last two digits of the
65 * match templates are 0's
68 public boolean match(Object matchObj) { method in class:StatusLine
74 return sl.matchExpression.match(this.encode());
96 /** set the flag on a match template.
  /external/oj-libjdwp/src/share/back/
ArrayTypeImpl.c 64 jboolean match; local
67 /* signature must match */
73 match = strcmp(signature, componentSignature) == 0;
79 if (match) {
85 match = isSameObject(env, loader, arrayClassLoader);
88 if (match) {
  /external/python/cpython2/Demo/parser/
example.py 42 found, vars = match(DOCSTRING_STMT_PATTERN[1], tree[1])
44 found, vars = match(DOCSTRING_STMT_PATTERN, tree[3])
49 found, vars = match(COMPOUND_STMT_PATTERN, node)
111 found, vars = match(DOCSTRING_STMT_PATTERN, tree[1])
116 def match(pattern, data, vars=None): function
117 """Match `data' to `pattern', with variable extraction.
120 Pattern to match against, possibly containing variables.
130 are allowed to match anything. The value that is matched is returned as
135 This function returns two values: a boolean indicating whether a match
149 same, vars = match(pattern, data, vars
    [all...]
  /external/python/cpython3/Modules/zlib/
inftrees.c 57 unsigned match; /* use base and extra for symbol >= match */ local
184 match = 20;
189 match = 257;
194 match = 0;
217 if (work[sym] + 1U < match) {
221 else if (work[sym] >= match) {
222 here.op = (unsigned char)(extra[work[sym] - match]);
223 here.val = base[work[sym] - match];
  /external/selinux/gui/
semanagePage.py 95 def match(self, target, filter): member in class:semanagePage
  /external/selinux/python/sepolgen/src/sepolgen/
policygen.py 249 for match in ml.all():
250 ifcall = call_interface(match.interface, ml.av)
251 s.append(' %s # [%d]' % (ifcall.to_string(), match.dist))
335 raw_av = self.match(avs)
357 def match(self, avs): member in class:InterfaceGenerator
  /external/skia/src/core/
SkRecordOpts.cpp 17 // - a Match typedef
18 // - a bool onMatch(SkRceord*, Match*, int begin, int end) method,
22 // It looks for spans which match Pass::Match, and when found calls onMatch() with that pattern,
26 typename Pass::Match match; local
30 while (match.search(record, &begin, &end)) {
31 changed |= pass->onMatch(record, &match, begin, end);
43 Match;
45 bool onMatch(SkRecord* record, Match* pattern, int begin, int end)
    [all...]
SkRecordPattern.h 16 // First, some matchers. These match a single command in the SkRecord,
115 int match(SkRecord*, int i) { return i; } function in class:SkRecords::Pattern
123 SK_ALWAYS_INLINE int match(SkRecord* record, int i) { function in class:SkRecords::Pattern
125 return i > 0 ? fRest.match(record, i) : 0;
132 *end = this->match(record, *begin);
147 // If first isn't a Greedy, try to match at i once.
158 // If first is a Greedy, walk i until it doesn't match.
  /external/skia/tests/
ReadWriteAlphaTest.cpp 57 bool match; local
105 // make sure the original & read back versions match
134 match = true;
135 for (int y = 0; y < Y_SIZE && match; ++y) {
136 for (int x = 0; x < X_SIZE && match; ++x) {
142 match = false;
214 // make sure the original & read back versions match
SkPEGTest.cpp 21 static MatchT Match(const char* in) {
34 static MatchT Match(const char* in) {
54 const auto match = EOS::Match(gTests[i].fInput); local
55 REPORTER_ASSERT(r, match == gTests[i].fMatch);
56 REPORTER_ASSERT(r, match.fNext == (match ? gTests[i].fInput : nullptr));
74 const auto match = LIT<'X'>::Match(gTests[i].fInput); local
75 REPORTER_ASSERT(r, match == gTests[i].fMatch)
109 const auto match = Alpha::Match(gTests[i].fInput); local
135 const auto match = Digit::Match(gTests[i].fInput); local
    [all...]
skbug6653.cpp 85 bool match = true; local
86 for (int y = 0; y < b4.height() && match; ++y) {
87 for (int x = 0; x < b4.width() && match; ++x) {
91 match = false;
96 REPORTER_ASSERT(reporter, match);
  /external/skqp/src/core/
SkRecordOpts.cpp 17 // - a Match typedef
18 // - a bool onMatch(SkRceord*, Match*, int begin, int end) method,
22 // It looks for spans which match Pass::Match, and when found calls onMatch() with that pattern,
26 typename Pass::Match match; local
30 while (match.search(record, &begin, &end)) {
31 changed |= pass->onMatch(record, &match, begin, end);
43 Match;
45 bool onMatch(SkRecord* record, Match* pattern, int begin, int end)
    [all...]
SkRecordPattern.h 16 // First, some matchers. These match a single command in the SkRecord,
115 int match(SkRecord*, int i) { return i; } function in class:SkRecords::Pattern
123 SK_ALWAYS_INLINE int match(SkRecord* record, int i) { function in class:SkRecords::Pattern
125 return i > 0 ? fRest.match(record, i) : 0;
132 *end = this->match(record, *begin);
147 // If first isn't a Greedy, try to match at i once.
158 // If first is a Greedy, walk i until it doesn't match.
  /external/skqp/tests/
ReadWriteAlphaTest.cpp 51 bool match; local
98 // make sure the original & read back versions match
120 match = true;
121 for (int y = 0; y < Y_SIZE && match; ++y) {
122 for (int x = 0; x < X_SIZE && match; ++x) {
128 match = false;
195 // make sure the original & read back versions match
SkPEGTest.cpp 21 static MatchT Match(const char* in) {
34 static MatchT Match(const char* in) {
54 const auto match = EOS::Match(gTests[i].fInput); local
55 REPORTER_ASSERT(r, match == gTests[i].fMatch);
56 REPORTER_ASSERT(r, match.fNext == (match ? gTests[i].fInput : nullptr));
74 const auto match = LIT<'X'>::Match(gTests[i].fInput); local
75 REPORTER_ASSERT(r, match == gTests[i].fMatch)
109 const auto match = Alpha::Match(gTests[i].fInput); local
135 const auto match = Digit::Match(gTests[i].fInput); local
    [all...]
skbug6653.cpp 85 bool match = true; local
86 for (int y = 0; y < b4.height() && match; ++y) {
87 for (int x = 0; x < b4.width() && match; ++x) {
91 match = false;
96 REPORTER_ASSERT(reporter, match);
  /external/skqp/tools/flags/
SkCommonFlags.h 21 DECLARE_string(match); variable
  /external/swiftshader/src/Main/
FrameBufferX11.cpp 56 bool match = (status != 0 && x_visual.blue_mask == 0xFF); // Prefer X8R8G8B8 local
57 Visual *visual = match ? x_visual.visual : libX11->XDefaultVisual(x_display, screen);
  /external/syslinux/com32/modules/
ethersel.c 108 static struct match *parse_config(const char *filename)
112 struct match *list = NULL;
113 struct match **ep = &list;
114 struct match *m;
134 m = malloc(sizeof(struct match));
180 struct match *list, *match; local
188 match = find_pci_device(pci_domain, list);
190 if (match)
191 syslinux_run_command(match->filename)
    [all...]
  /external/tensorflow/tensorflow/contrib/image/kernels/
bipartite_match_op.cc 106 const auto& match = match_queue.top(); variable
107 if (row_to_col_match_vec[match.index1] == -1 &&
108 col_to_row_match_vec[match.index2] == -1) {
109 row_to_col_match_vec[match.index1] = match.index2;
110 col_to_row_match_vec[match.index2] = match.index1;
  /external/tensorflow/tensorflow/core/framework/
shape_inference_testutil.cc 127 " by ShapeHandle, but was expected to not match an input ",
184 err_prefix, " was expected to match the dimension of an input, ",
185 "but did not match any input dimension. The shape ",
246 StringPiece match; local
249 if (!scanner.GetResult(nullptr, &match) ||
250 !strings::safe_strto64(match, &dim_size)) {
  /external/toybox/toys/posix/
cut.c 132 regmatch_t match; local
144 if (regexec(&TT.reg, ss, 1, &match, REG_NOTBOL|REG_NOTEOL)) {
148 if (!match.rm_eo) break; // zero length match == no delimiter
149 ss += (!--start && j) ? match.rm_so : match.rm_eo;
  /external/v8/src/regexp/
regexp-utils.cc 121 Handle<Object> match; local
123 isolate, match,
127 if (!match->IsUndefined(isolate)) return Just(match->BooleanValue());
  /external/webrtc/webrtc/libjingle/xmllite/
xmlnsstack.cc 71 const std::pair<std::string, bool> match = NsForPrefix(prefix); local
72 return match.second && (match.first == ns);

Completed in 916 milliseconds

1 2 3 4 5 6 7 8 91011>>