Searched refs:tokens (Results 1 - 25 of 78) sorted by relevance

1234

/openbsd-current/gnu/llvm/clang/bindings/python/tests/cindex/
H A Dtest_tokens.py22 tokens = list(tu.get_tokens(extent=r))
24 self.assertEqual(len(tokens), 4)
25 self.assertEqual(tokens[1].spelling, 'i')
26 self.assertEqual(tokens[1].kind, TokenKind.IDENTIFIER)
28 cursor = tokens[1].cursor
30 self.assertEqual(tokens[1].cursor, tokens[2].cursor)
38 tokens = list(tu.get_tokens(extent=r))
39 self.assertEqual(len(tokens), 4)
41 loc = tokens[
[all...]
H A Dtest_translation_unit.py309 tokens = list(tu.get_tokens(extent=r))
311 self.assertEqual(tokens[0].spelling, 'int')
313 self.assertEqual(tokens[0].spelling, 'int')
315 del tokens[1]
317 self.assertEqual(tokens[0].spelling, 'int')
320 del tokens
/openbsd-current/usr.sbin/acme-client/
H A Djsmn.c28 jsmntok_t *tokens, size_t num_tokens) {
33 tok = &tokens[parser->toknext++];
57 size_t len, jsmntok_t *tokens, size_t num_tokens) {
85 if (tokens == NULL) {
89 token = jsmn_alloc_token(parser, tokens, num_tokens);
106 size_t len, jsmntok_t *tokens, size_t num_tokens) {
119 if (tokens == NULL) {
122 token = jsmn_alloc_token(parser, tokens, num_tokens);
170 * Parse JSON string and fill tokens.
173 jsmntok_t *tokens, unsigne
27 jsmn_alloc_token(jsmn_parser *parser, jsmntok_t *tokens, size_t num_tokens) argument
56 jsmn_parse_primitive(jsmn_parser *parser, const char *js, size_t len, jsmntok_t *tokens, size_t num_tokens) argument
105 jsmn_parse_string(jsmn_parser *parser, const char *js, size_t len, jsmntok_t *tokens, size_t num_tokens) argument
172 jsmn_parse(jsmn_parser *parser, const char *js, size_t len, jsmntok_t *tokens, unsigned int num_tokens) argument
[all...]
H A Djsmn.h47 /* Not enough tokens were provided */
82 * Create JSON parser over an array of tokens
87 * Run JSON parser. It parses a JSON data string into and array of tokens, each describing
91 jsmntok_t *tokens, unsigned int num_tokens);
/openbsd-current/gnu/usr.bin/perl/cpan/CPAN/lib/CPAN/FTP/
H A Dnetrc.pm25 my(@tokens) = split " ", $_;
26 TOKEN: while (@tokens) {
27 my($t) = shift @tokens;
34 push @machines, shift @tokens;
/openbsd-current/lib/libc/stdlib/
H A Dgetsubopt.c45 getsubopt(char **optionp, char * const *tokens, char **valuep) argument
88 for (cnt = 0; *tokens; ++tokens, ++cnt)
89 if (!strcmp(suboptarg, *tokens))
/openbsd-current/libexec/tradcpp/
H A Deval.c63 enum tokens { enum
94 enum tokens tok;
109 enum tokens tok;
132 enum tokens tok;
138 static struct tokenarray tokens; variable in typeref:struct:tokenarray
142 token_create(const struct place *p, enum tokens tok, int val)
170 fprintf(stderr, "tokens:");
171 num = tokenarray_num(&tokens);
173 t = tokenarray_get(&tokens, i);
209 isuop(enum tokens to
[all...]
/openbsd-current/gnu/llvm/llvm/tools/llvm-c-test/
H A Ddisassemble.c65 static void handle_line(char **tokens, int ntokens) { argument
68 const char *triple = tokens[0];
69 const char *features = tokens[1];
77 disbuf[disbuflen++] = strtol(tokens[i], NULL, 16);
H A Dllvm-c-test.h24 void llvm_tokenize_stdin(void (*cb)(char **tokens, int ntokens));
H A Dcalc.c41 static LLVMValueRef build_from_tokens(char **tokens, int ntokens, argument
49 char tok = tokens[i][0];
86 long val = strtol(tokens[i], &end, 0);
113 static void handle_line(char **tokens, int ntokens) { argument
114 char *name = tokens[0];
131 res = build_from_tokens(tokens + 1, ntokens - 1, builder, param);
H A Dhelpers.c20 void llvm_tokenize_stdin(void (*cb)(char **tokens, int ntokens)) { argument
/openbsd-current/gnu/llvm/lld/ELF/
H A DScriptLexer.cpp47 StringRef tok = tokens[pos - 1];
60 StringRef tok = tokens[pos - 1];
84 StringRef tok = tokens[pos - 1];
107 // Split S into linker script tokens.
120 // because, in a glob match context, only unquoted tokens are interpreted
121 // as glob patterns. Double-quoted tokens are literal patterns in that
137 // Some operators form separate tokens.
150 // Unquoted token. This is more relaxed than tokens in C-like language,
164 tokens.insert(tokens
[all...]
H A DScriptLexer.h37 std::vector<StringRef> tokens; member in class:lld::elf::ScriptLexer
/openbsd-current/gnu/gcc/libcpp/include/
H A Dcpp-id-data.h46 /* Replacement tokens (ISO) or replacement text (traditional). See
51 cpp_token * GTY ((tag ("0"), length ("%0.count"))) tokens; member in union:cpp_macro_u
58 /* Number of tokens in expansion, or bytes for traditional macros. */
/openbsd-current/gnu/usr.bin/perl/
H A Dregen_perly.pl104 our %tokens;
137 my $tokens;
151 print $h_fh <<i for sort grep $tokens{$_} eq 'opval', keys %tokens;
171 $_ .= "\n/* Tokens. */\n$tokens";
175 $tokens .= "#define $tok $val\n" if $tok;
285 my %tokens;
307 $tokens{$_} = $3;
314 *tokens = \%just_tokens; # perly.h needs this
327 (defined $tokens{
[all...]
/openbsd-current/sys/dev/microcode/siop/
H A Dncr53cxxx.c47 } tokens[MAXTOKENS]; variable in typeref:struct:__anon2
432 fprintf (listfp, " %d tokens\n", ntokens);
435 if (tokens[i].type)
436 fprintf (listfp,"'%c'\n", tokens[i].type);
438 fprintf (listfp, "%s\n", tokens[i].name);
441 if (ntokens >= 2 && tokens[0].type == 0 &&
442 tokens[1].type == ':') {
443 define_symbol (tokens[0].name, dsps, S_LABEL, F_DEFINED);
581 tokens[ntokens].name = malloc (len);
582 strlcpy (tokens[ntoken
[all...]
/openbsd-current/gnu/llvm/clang/utils/
H A Dtoken-delta.py111 p = subprocess.Popen(['clang','-dump-raw-tokens',path],
117 tokens = []
128 tokens.append(Token(*kTokenRE.match(ln).groups()))
130 return tokens
155 for i,(file,tokens) in enumerate(self.tokenLists):
158 f.write(tokens[j])
175 sys.stderr.write('%s:%d tokens: [' % (file,len(byFile[i])))
188 print(', '.join(['%s:%d tokens' % (file, len(byFile[i]))
201 print('\nSUCCESS (%d tokens)' % len(changes))
209 for i,(file,tokens) i
[all...]
/openbsd-current/gnu/usr.bin/perl/cpan/Test-Harness/lib/TAP/Parser/
H A DGrammar.pm37 constructs L<TAP::Parser::Result> subclasses to represent the tokens.
217 tokens => \%v12,
220 tokens => \%v13,
248 $self->{tokens} = $language->{tokens};
262 # Optimization to put the most frequent tokens first.
266 my %copy = %{ $self->{tokens} };
315 Returns the different types of tokens which this grammar can parse.
321 return keys %{ $self->{tokens} };
339 return $self->{tokens}
[all...]
/openbsd-current/gnu/llvm/llvm/utils/lit/lit/
H A DBooleanExpression.py38 self.tokens = BooleanExpression.tokenize(string)
73 self.token = next(self.tokens)
81 self.token = next(self.tokens)
103 self.token = next(self.tokens)
139 self.token = next(self.tokens)
H A DShUtil.py58 # we don't have to track whitespace tokens.
193 self.tokens = ShLexer(data, win32Escapes = win32Escapes).lex()
196 for item in self.tokens:
203 self.tokens = itertools.chain([token], self.tokens)
/openbsd-current/gnu/usr.bin/texinfo/makeinfo/
H A Ddefun.c37 char **tokens; member in struct:token_accumulator
45 accumulator->tokens = NULL;
54 accumulator->tokens = xrealloc (accumulator->tokens,
57 accumulator->tokens[accumulator->index] = token;
100 /* Return a list of tokens from the contents of STRING.
101 Commands and brace-delimited groups count as single tokens.
124 /* Commands count as single tokens. */
174 /* Make commas separate tokens so to differentiate them from
227 return accumulator.tokens;
[all...]
/openbsd-current/gnu/usr.bin/perl/cpan/Test-Harness/lib/TAP/Parser/Result/
H A DUnknown.pm31 tokens.
/openbsd-current/gnu/usr.bin/perl/regen/
H A DHeaderParser.pm180 # this parses the expression into an array of tokens
186 delete $self->{tokens};
190 my @tokens;
192 push @tokens, {%+} if defined $+{'term'};
194 $self->{tokens}= \@tokens;
199 return \@tokens;
347 # entry point into parsing the tokens, checks that we actually parsed everything
359 if (@{ $self->{tokens} }) {
362 confess "Unparsed tokens
[all...]
/openbsd-current/sys/dev/fdt/
H A Damliic.c171 uint64_t tokens = 0; local
180 tokens |= (((uint64_t)(t)) << ((i) * 4))
226 /* Write slave address, tokens and data to hardware. */
227 HWRITE4(sc, I2C_M_TOKEN_LIST0, tokens);
228 HWRITE4(sc, I2C_M_TOKEN_LIST1, tokens >> 32);
256 /* Reset tokens. */
257 tokens = 0;
/openbsd-current/gnu/llvm/clang/lib/StaticAnalyzer/Core/
H A DCheckerHelpers.cpp124 FilteredTokens.reserve(MI->tokens().size());
125 for (auto &T : MI->tokens())

Completed in 203 milliseconds

1234