| /xsrc/external/mit/xorg-server/dist/hw/xfree86/common/ |
| xf86MatchDrivers.h | 30 char *matches[MATCH_DRIVERS_LIMIT]; member in struct:_XF86MatchedDrivers
|
| xf86AutoConfig.c | 158 if (xf86NameCmp(md->matches[j], driver) == 0) {
165 md->matches[nmatches] = xnfstrdup(driver);
195 md.matches[i], 0, md.matches[i]);
198 md.matches[i], 0, md.matches[i], 0);
205 md.matches[i], 0);
211 free(md.matches[i]);
445 md.matches[i], i);
460 ptr->driver = md.matches[0]
[all...] |
| /xsrc/external/mit/brotli/dist/c/enc/ |
| static_dict.c | 27 uint32_t* matches) {
29 matches[len] = BROTLI_MIN(uint32_t, matches[len], match);
79 size_t min_length, size_t max_length, uint32_t* matches) {
100 AddMatch(id, l, l, matches);
106 AddMatch(id + 12 * n, l - 1, l, matches);
110 AddMatch(id + 49 * n, l + 3, l, matches);
122 AddMatch(id + transform_id * n, len, l, matches);
131 AddMatch(id + n, l + 1, l, matches);
134 AddMatch(id + 28 * n, l + 3, l, matches);
[all...] |
| static_dict.h | 24 /* Matches data against static dictionary words, and for each length l,
25 for which a match is found, updates matches[l] to be the minimum possible
27 Returns 1 if matches have been found, otherwise 0.
29 matches array is at least BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN + 1 long
34 uint32_t* matches);
|
| hash_to_binary_tree_inc.h | 104 hash bucket's binary tree is searched for matches and is re-rooted at the
108 current position is searched for matches, but the state of the hash table
117 BackwardMatch* BROTLI_RESTRICT matches) {
163 if (matches && len > *best_len) {
165 InitBackwardMatch(matches++, backward, len);
191 return matches;
194 /* Finds all backward matches of &data[cur_ix & ring_buffer_mask] up to the
197 Sets *num_matches to the number of matches found, and stores the found
198 matches in matches[0] to matches[*num_matches - 1]. The matches will b
[all...] |
| backward_references_hq.c | 407 const BackwardMatch* matches, const ZopfliCostModel* model,
443 /* Look for last distance matches using the distance cache from this
500 /* At higher iterations look only for new last distance matches, since
509 BackwardMatch match = matches[j];
513 /* We already tried all possible last distance matches, so we can use
620 const BackwardMatch* matches, ZopfliNode* nodes) {
633 num_matches[i], &matches[cur_match_pos], model, &queue, nodes);
637 BackwardMatchLength(&matches[cur_match_pos - 1]) > max_zopfli_len) {
639 BackwardMatchLength(&matches[cur_match_pos - 1]), skip);
666 BackwardMatch matches[2 * (MAX_NUM_MATCHES_H10 + 64)] local
758 BackwardMatch* matches = BROTLI_ALLOC(m, BackwardMatch, matches_size); local
[all...] |
| /xsrc/external/mit/xorg-server.old/dist/hw/xfree86/common/ |
| xf86AutoConfig.c | 98 static void listPossibleVideoDrivers(char *matches[], int nmatches);
199 listPossibleVideoDrivers(char *matches[], int nmatches)
204 matches[i] = NULL;
210 matches[i++] = xnfstrdup("chips");
211 matches[i++] = xnfstrdup("igs");
213 matches[i++] = xnfstrdup("crime");
214 matches[i++] = xnfstrdup("newport");
240 matches[i++] = xnfstrdup(sbusDeviceTable[dev].driverName);
276 matches[i++] = xnfstrdup("nvidia");
290 matches[i++] = vendorName
382 char *matches[20]; \/* If we have more than 20 drivers we're in trouble *\/ local
[all...] |
| xf86pciBus.h | 40 int xf86PciMatchDriver(char* matches[], int nmatches);
|
| xf86pciBus.c | 385 * xf86CheckPciMemBase() checks that the memory base value matches one of the
599 Bool claimed; /* BusID matches with a device section */
1196 matchDriverFromFiles (char** matches, uint16_t match_vendor, uint16_t match_chip)
1260 while (matches[i]) {
1263 matches[i] = (char*)malloc(sizeof(char) * strlen(direntry->d_name) - 3);
1264 if (!matches[i]) {
1273 matches[i][j] = '\0';
1276 matches[i][j] = direntry->d_name[j];
1279 xf86Msg(X_INFO, "Matched %s from file name %s\n", matches[i], direntry->d_name);
1300 xf86PciMatchDriver(char* matches[], int nmatches)
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r300/compiler/tests/ |
| rc_test_helpers.c | 76 static int match_length(regmatch_t * matches, int index)
78 return matches[index].rm_eo - matches[index].rm_so;
84 regmatch_t * matches,
99 err_code = regexec(®ex, search_str, num_matches, matches, 0);
103 matches[i].rm_so, matches[i].rm_eo);
140 regmatch_t matches[REGEX_SRC_MATCHES]; local
146 if (!regex_helper(regex_str, src_str, matches, REGEX_SRC_MATCHES)) {
152 tokens.Negate.String = src_str + matches[1].rm_so
269 regmatch_t matches[REGEX_DST_MATCHES]; local
375 regmatch_t matches[REGEX_INST_MATCHES]; local
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r300/compiler/tests/ |
| rc_test_helpers.c | 76 static int match_length(regmatch_t * matches, int index)
78 return matches[index].rm_eo - matches[index].rm_so;
84 regmatch_t * matches,
99 err_code = regexec(®ex, search_str, num_matches, matches, 0);
103 matches[i].rm_so, matches[i].rm_eo);
140 regmatch_t matches[REGEX_SRC_MATCHES]; local
146 if (!regex_helper(regex_str, src_str, matches, REGEX_SRC_MATCHES)) {
152 tokens.Negate.String = src_str + matches[1].rm_so
269 regmatch_t matches[REGEX_DST_MATCHES]; local
375 regmatch_t matches[REGEX_INST_MATCHES]; local
[all...] |
| /xsrc/external/mit/xterm/dist/vttests/ |
| closest-rgb.pl | 53 -i reverse comparison, look for rgb matches in xterm's palette
|
| /xsrc/external/mit/MesaLib/dist/src/compiler/glsl/ |
| ir_function.cpp | 99 * be exact matches.
123 /* Classes of parameter match, sorted (mostly) best matches first.
202 ir_function_signature **matches,
221 for (ir_function_signature **other = matches;
222 other < matches + num_matches; other++) {
263 ir_function_signature **matches,
270 return *matches;
273 * there is no overload resolution among multiple inexact matches. Note
280 for (ir_function_signature **sig = matches; sig < matches + num_matches; sig++)
[all...] |
| link_varyings.cpp | 1816 } *matches;
1819 * The number of elements in the \c matches array that are currently in
1825 * The number of elements that were set aside for the \c matches array when
1855 this->matches = (match *)
1856 malloc(sizeof(*this->matches) * this->matches_capacity);
1863 free(this->matches);
1951 this->matches = (match *)
1952 realloc(this->matches,
1953 sizeof(*this->matches) * this->matches_capacity);
1980 this->matches[this->num_matches].packing_clas
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/glsl/ |
| ir_function.cpp | 98 * be exact matches.
122 /* Classes of parameter match, sorted (mostly) best matches first.
201 ir_function_signature **matches,
220 for (ir_function_signature **other = matches;
221 other < matches + num_matches; other++) {
262 ir_function_signature **matches,
269 return *matches;
272 * there is no overload resolution among multiple inexact matches. Note
279 for (ir_function_signature **sig = matches; sig < matches + num_matches; sig++)
[all...] |
| link_varyings.cpp | 1681 } *matches; member in class:__anon3331::varying_matches
1684 * The number of elements in the \c matches array that are currently in
1690 * The number of elements that were set aside for the \c matches array when
1718 this->matches = (match *)
1719 malloc(sizeof(*this->matches) * this->matches_capacity);
1726 free(this->matches);
1813 this->matches = (match *)
1814 realloc(this->matches,
1815 sizeof(*this->matches) * this->matches_capacity);
1845 this->matches[this->num_matches].packing_clas
[all...] |
| /xsrc/external/mit/libX11/dist/src/ |
| ParseCmd.c | 90 int matches; local
114 matches = 0;
132 /* give preference to exact matches, StickyArg and IsArg */
133 matches = 1;
140 matches++;
153 if (matches == 1) {
|
| /xsrc/external/mit/MesaLib.old/dist/src/util/xmlpool/ |
| gen_xmlpool.py | 109 # Expand matches. The first match is always a DESC or DESC_BEGIN match.
110 # Subsequent matches are ENUM matches.
114 def expandMatches(matches, translations, outfile, end=None):
115 assert len(matches) > 0
124 if len(matches) == 1 and i < len(translations) and \
125 not matches[0].expand(r'\7').endswith('\\'):
128 matches[0].expand (r'\5'))))
129 text = (matches[0].expand(r'\1' + lang + r'\3"' + text + r'"\7') + suffix)
134 for match in matches[1:]
[all...] |
| /xsrc/external/mit/xedit/dist/lisp/modules/ |
| syntax.lsp | 80 is a rule to match only EOL, but some other rule matches up to the end
100 currently does not have rules for matches in the format RE/TRAILING, as
113 Token1 matches "int" and token2 matches "integer", but since token2 is
281 ;; Don't allow a regex that matches the null string enter the
284 #+xedit (error "SYNTOKEN: regex matches empty string ~S" regex)
769 ;; Matches for the current list of tokens.
770 matches
782 ;; Use cache as a list of matches to avoid repetitive
857 ;; If empty line, and current table does not have matches fo
[all...] |
| /xsrc/external/mit/xedit/dist/lisp/ |
| debugger.c | 347 int i = 0, frame, matches, action = -1, subaction = 0; local
408 for (i = matches = 0; i < sizeof(commands) / sizeof(commands[0]);
420 matches = 1;
423 ++matches;
426 if (matches == 0) {
432 else if (matches > 1) {
450 for (i = matches = 0;
463 matches = 1;
466 ++matches;
469 if (matches == 0)
[all...] |
| pathname.c | 174 char *sep, *base, *ptr, **dirs, **matches, local
256 matches = NULL;
355 matches = LispRealloc(matches, sizeof(char*) *
357 matches[nmatches++] = LispStrdup(ptr);
386 strlen(matches[j]) + 1);
387 sprintf(dirs[i + j], "%s%s", dirs[i], matches[j]);
390 length + strlen(matches[0]) + 1);
391 strcpy(dirs[i] + length, matches[0]);
396 LispFree(matches[j])
[all...] |
| /xsrc/external/mit/xedit/dist/ |
| commands.c | 678 char **matches, *save, *dir_name, *file_name, match[257]; local
741 matches = NULL;
852 matches = (char **)XtRealloc((char*)matches, sizeof(char**)
856 matches[n_matches] = XtMalloc(d_namlen + 2);
857 strcpy(matches[n_matches], ent->d_name);
858 strcat(matches[n_matches], "/");
862 matches[n_matches] = XtNewString(ent->d_name);
920 matches = (char **)XtRealloc((char*)matches, sizeof(char**
[all...] |
| /xsrc/external/mit/xorg-server/dist/config/ |
| fdi2iclass.py | 144 matches = []
149 matches.append((key, value))
162 return matches
166 def print_section(matches, driver, ignore, options):
172 for m, v in matches:
183 '''Parse x11 matches from fdi'''
195 matches = parse_all_matches(match_node)
198 print_section(matches, driver, ignore, options)
|
| /xsrc/external/mit/xorg-server.old/dist/config/ |
| fdi2iclass.py | 144 matches = []
149 matches.append((key, value))
162 return matches
166 def print_section(matches, driver, ignore, options):
172 for m, v in matches:
183 '''Parse x11 matches from fdi'''
195 matches = parse_all_matches(match_node)
198 print_section(matches, driver, ignore, options)
|
| /xsrc/external/mit/xorg-server/dist/hw/xfree86/os-support/linux/ |
| systemd-logind.c | 175 int matches = 0; local
184 matches++;
187 if (matches > 1) {
|
