Searched refs:words (Results 1 - 25 of 329) sorted by relevance

1234567891011>>

/external/python/cpython2/Demo/pdist/
H A Dmac.py11 words = string.split(line)
12 if not words:
14 if words[0] != 'rcvs':
15 words.insert(0, 'rcvs')
16 sys.argv = words
/external/boringssl/src/crypto/evp/
H A Dscrypt.c31 typedef struct { uint32_t words[16]; } block_t; member in struct:__anon939
45 x.words[4] ^= R(x.words[0] + x.words[12], 7);
46 x.words[8] ^= R(x.words[4] + x.words[0], 9);
47 x.words[12] ^= R(x.words[8] + x.words[
[all...]
/external/valgrind/none/tests/x86/
H A Dcpuid.stdout.exp1 cpuid words (0): 0x........ 0x........ 0x........ 0x........
2 cpuid words (1): 0x........ 0x........ 0x........ 0x........
/external/e2fsprogs/
H A Dwordwrap.pl12 @words = split;
13 while (defined($word = shift @words)) {
/external/toolchain-utils/android_bench_suite/
H A Dparse_result.py30 words = line.split()
31 if 'elapsed' in words:
33 result_dict['total_time_s'] = float(words[3])
45 words = line.split()
46 if 'normalized' in words:
48 accum += float(words[-1])
63 words = line.split()
64 for word in words:
81 words = line.split()
82 if 'elapsed' in words
[all...]
/external/valgrind/memcheck/tests/
H A Dwrap6.c182 UInt* words = calloc(200, sizeof(UInt)); local
183 TRASH_IREGS(r, words);
184 free(words);
208 UInt* words = calloc(200, sizeof(UInt)); local
209 words[1-1] = a1;
210 TRASH_IREGS(r, words);
211 free(words);
235 UInt* words = calloc(200, sizeof(UInt)); local
236 words[1-1] = a1;
237 words[
263 UInt* words = calloc(200, sizeof(UInt)); local
292 UInt* words = calloc(200, sizeof(UInt)); local
322 UInt* words = calloc(200, sizeof(UInt)); local
353 UInt* words = calloc(200, sizeof(UInt)); local
386 UInt* words = calloc(200, sizeof(UInt)); local
422 UInt* words = calloc(200, sizeof(UInt)); local
459 UInt* words = calloc(200, sizeof(UInt)); local
497 UInt* words = calloc(200, sizeof(UInt)); local
536 UInt* words = calloc(200, sizeof(UInt)); local
576 UInt* words = calloc(200, sizeof(UInt)); local
[all...]
/external/autotest/client/tests/unixbench/
H A Dunixbench.py57 def check_for_error(self, words):
58 l = len(words)
59 if l >= 3 and words[-3:l] == ['no', 'measured', 'results']:
61 key = '_'.join(words[:-3])
77 words = line.split()
79 if self.check_for_error(words):
84 if len(words) >= 6:
85 key = '_'.join(words[:-6])
87 value = words[-6]
/external/python/cpython2/Lib/idlelib/
H A DAutoExpand.py1 '''Complete the current word before the cursor with words in the editor.
41 words = self.getwords()
44 words, index, insert, line = self.state
46 words = self.getwords()
48 if not words:
53 newword = words[index]
54 index = (index + 1) % len(words)
60 self.state = words, index, curinsert, curline
64 "Return a list of words that match the prefix before the cursor."
76 words
[all...]
/external/python/cpython2/Modules/
H A Dcgen.py450 words = string.split(line) variable
457 if words == ['%%']:
466 if words and words[0][0] == '%':
467 func = words[0][1:]
468 if (not func) and words[1:]:
469 func = words[1]
475 if not words:
477 elif words[0] == 'if':
480 if words[
485 words = words[2:] variable
[all...]
/external/python/cpython3/Lib/idlelib/
H A Dautoexpand.py1 '''Complete the current word before the cursor with words in the editor.
42 words = self.getwords()
45 words, index, insert, line = self.state
47 words = self.getwords()
49 if not words:
54 newword = words[index]
55 index = (index + 1) % len(words)
61 self.state = words, index, curinsert, curline
65 "Return a list of words that match the prefix before the cursor."
77 words
[all...]
/external/perfetto/src/traced/probes/filesystem/
H A Dfs_mount.cc39 base::StringSplitter words(&lines, ' ');
40 if (!words.Next() || !words.Next()) {
44 const char* mountpoint = words.cur_token();
/external/v8/tools/
H A Dtrace-maps-processor.py90 words = line.split(" ") variable
91 event = words[1]
93 assert words[2] == "map="
94 assert words[4] == "SFI="
95 new_map = AddMap(words[3], "SFI#%s" % words[5])
98 if words[2] == "from=" and words[4] == "to=":
99 from_map = words[3]
100 to_map = words[
[all...]
/external/vulkan-validation-layers/demos/smoke/
H A Dglsl-to-spirv52 # read the temp file into a list of SPIR-V words
53 words = []
61 words.append(struct.unpack(fmt, data[i:(i + 4)])[0])
63 assert(words[0] == SPIRV_MAGIC)
69 return (words, output.rstrip())
72 words, comments = compile_glsl(in_filename, base + ".tmp")
75 for i in range(0, len(words), COLUMNS):
76 columns = ["0x%08x" % word for word in words[i:(i + COLUMNS)]]
88 """ % (comments, identifierize(base), len(words), "\n".join(literals))
/external/mesa3d/src/compiler/glsl/glcpp/tests/
H A D039-func-arg-obj-macro-with-comma.c3 #define bar two,words
20 #define bar_parens (two,words)
/external/toolchain-utils/
H A Dupdate_telemetry_defaults.py145 words = inp.split(' ')
146 option = words[0]
151 if len(words) == 1:
154 self.ListCurrentDefaults(benchmark=words[1])
156 if len(words) < 3:
159 benchmark = words[1]
160 resultList = words[2:]
164 if len(words) != 3:
167 benchmark = words[1]
168 result = words[
[all...]
/external/icu/android_icu4j/src/main/java/android/icu/text/
H A DBurmeseBreakEngine.java22 // How many words in a row are "good enough"?
103 PossibleWord words[] = new PossibleWord[BURMESE_LOOKAHEAD];
105 words[i] = new PossibleWord();
113 //Look for candidate words at the current position
114 int candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
118 wordLength = words[wordsFound%BURMESE_LOOKAHEAD].acceptMarked(fIter);
122 // If there was more than one, see which one can take us forward the most words
129 if (words[(wordsFound+1)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
132 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent();
141 // See if any of the possible second words i
[all...]
H A DKhmerBreakEngine.java22 // How many words in a row are "good enough"?
31 // Minimum number of characters for two words
102 PossibleWord words[] = new PossibleWord[KHMER_LOOKAHEAD];
104 words[i] = new PossibleWord();
113 //Look for candidate words at the current position
114 int candidates = words[wordsFound % KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
118 wordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(fIter);
122 // If there was more than one, see which one can take us forward the most words
129 if (words[(wordsFound+1)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
132 words[wordsFoun
[all...]
H A DLaoBreakEngine.java22 // How many words in a row are "good enough"?
102 PossibleWord words[] = new PossibleWord[LAO_LOOKAHEAD];
104 words[i] = new PossibleWord();
112 //Look for candidate words at the current position
113 int candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
117 wordLength = words[wordsFound%LAO_LOOKAHEAD].acceptMarked(fIter);
121 // If there was more than one, see which one can take us forward the most words
128 if (words[(wordsFound+1)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
131 words[wordsFound%LAO_LOOKAHEAD].markCurrent();
140 // See if any of the possible second words i
[all...]
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DBurmeseBreakEngine.java21 // How many words in a row are "good enough"?
102 PossibleWord words[] = new PossibleWord[BURMESE_LOOKAHEAD];
104 words[i] = new PossibleWord();
112 //Look for candidate words at the current position
113 int candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
117 wordLength = words[wordsFound%BURMESE_LOOKAHEAD].acceptMarked(fIter);
121 // If there was more than one, see which one can take us forward the most words
128 if (words[(wordsFound+1)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
131 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent();
140 // See if any of the possible second words i
[all...]
H A DKhmerBreakEngine.java21 // How many words in a row are "good enough"?
30 // Minimum number of characters for two words
101 PossibleWord words[] = new PossibleWord[KHMER_LOOKAHEAD];
103 words[i] = new PossibleWord();
112 //Look for candidate words at the current position
113 int candidates = words[wordsFound % KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
117 wordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(fIter);
121 // If there was more than one, see which one can take us forward the most words
128 if (words[(wordsFound+1)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
131 words[wordsFoun
[all...]
H A DLaoBreakEngine.java21 // How many words in a row are "good enough"?
101 PossibleWord words[] = new PossibleWord[LAO_LOOKAHEAD];
103 words[i] = new PossibleWord();
111 //Look for candidate words at the current position
112 int candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
116 wordLength = words[wordsFound%LAO_LOOKAHEAD].acceptMarked(fIter);
120 // If there was more than one, see which one can take us forward the most words
127 if (words[(wordsFound+1)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
130 words[wordsFound%LAO_LOOKAHEAD].markCurrent();
139 // See if any of the possible second words i
[all...]
/external/valgrind/helgrind/
H A Dhg_wordset.c3 /*--- Sets of words, with unique set identifiers. ---*/
137 UWord* words; member in struct:__anon29351
192 wv->words = NULL;
195 wv->words = wsu->alloc( wsu->cc, (SizeT)sz * sizeof(UWord) );
203 if (wv->words) {
204 dealloc(wv->words);
228 if (wv1->words[i] == wv2->words[i])
230 if (wv1->words[i] < wv2->words[
447 getPayloadWS( UWord** words, UWord* nWords, WordSetU* wsu, WordSet ws ) argument
[all...]
/external/boringssl/src/crypto/fipsmodule/bn/
H A Drandom.c197 // bn_less_than_word returns one if the number represented by |len| words at |a|
235 // |words| worth of entropy to fill and a mask of bits to clear in the top
237 size_t words = len; local
238 while (words > 0 && max_exclusive[words - 1] == 0) {
239 words--;
241 if (words == 0 ||
242 (words == 1 && max_exclusive[0] <= min_inclusive)) {
246 BN_ULONG mask = max_exclusive[words - 1];
257 // Fill any unused words wit
[all...]
/external/python/cpython2/Tools/framer/framer/
H A Dstructparse.py35 words = line.split()
36 name = words[-1]
37 type = " ".join(words[:-1])
/external/python/cpython2/Tools/scripts/
H A Dlogmerge.py137 words = dateline.split()
139 if len(words) >= 3 and words[0] == 'date:':
140 dateword = words[1]
141 timeword = words[2]
145 if len(words) >= 5 and words[3] == 'author:':
146 author = words[4]
152 words = revline.split()
153 if len(words) >
[all...]

Completed in 1822 milliseconds

1234567891011>>