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

123

/freebsd-10.0-release/lib/libc/stdlib/
H A Dgetsubopt.c48 getsubopt(optionp, tokens, valuep)
50 char * const *tokens;
93 for (cnt = 0; *tokens; ++tokens, ++cnt)
94 if (!strcmp(suboptarg, *tokens))
/freebsd-10.0-release/contrib/mdocml/
H A Dcompat_getsubopt.c55 getsubopt(char **optionp, char * const *tokens, char **valuep) argument
98 for (cnt = 0; *tokens; ++tokens, ++cnt)
99 if (!strcmp(suboptarg, *tokens))
/freebsd-10.0-release/usr.sbin/asf/
H A Dasf_prog.c53 int tokens; local
65 tokens = tokenize(buf, token, MAXTOKEN);
66 if (tokens < 4)
/freebsd-10.0-release/contrib/ntp/ntpd/
H A Dntp_config.c58 * Entries are processed as multiple tokens separated by white space
330 #define MAXTOKENS 20 /* 20 tokens on line */
520 char *(tokens[MAXTOKENS]);
606 tok = gettokens(fp[includelevel], line, tokens, &ntokens);
609 tok = gettokens_netinfo(config_netinfo, tokens, &ntokens);
638 tokens[0]);
645 switch (matchkey(tokens[istart], addr_type, 0)) {
656 status = getnetnum(tokens[istart], &peeraddr, 0, t_UNK);
733 switch (matchkey(tokens[i], mod_keywords, 1)) {
741 peerversion = atoi(tokens[
2038 char *tokens = val_list[val_index]; local
[all...]
/freebsd-10.0-release/contrib/gcclibs/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. */
/freebsd-10.0-release/contrib/ntp/ntpdate/
H A Dntptime_config.c30 * Entries are processed as multiple tokens separated by white space
109 #define MAXTOKENS 20 /* 20 tokens on line */
157 char *(tokens[MAXTOKENS]);
224 while ((tok = gettokens(fp, line, tokens, &ntokens))
233 tokens[0]);
237 if (!getnetnum(tokens[1], &peeraddr, 1)) {
260 switch (matchkey(tokens[i], mod_keywords)) {
268 peerversion = atoi(tokens[++i]);
273 tokens[i]);
286 /* peerkey = (int)atol(tokens[
[all...]
/freebsd-10.0-release/contrib/subversion/subversion/libsvn_diff/
H A Ddiff_memory.c47 apr_array_header_t *tokens; member in struct:source_tokens_t
61 /* The tokens for each of the sources */
64 /* Normalization buffer; we only ever compare 2 tokens at the same time */
129 if ((apr_size_t)src->tokens->nelts > src->next_token)
131 /* There are actually tokens to be returned */
134 = APR_ARRAY_IDX(src->tokens, src->next_token, svn_string_t *);
183 /* No-op, we have no use for discarded tokens... */
193 tokens allocated, but we're geared toward small in-memory diffs.
209 /* Fill SRC with the diff tokens (e.g. lines).
211 TEXT is assumed to live long enough for the tokens t
267 apr_array_header_t *tokens = btn->sources[i].tokens; local
385 output_unified_token_range(output_baton_t *btn, int tokens, unified_output_e type, apr_off_t until) argument
833 apr_array_header_t *tokens = btn->sources[idx].tokens; local
[all...]
/freebsd-10.0-release/crypto/heimdal/lib/krb5/
H A Dexpand_path.c87 * This is also used to expand a few other tokens on Windows, since
345 } tokens[] = { variable in typeref:struct:token
390 for (i = 0; i < sizeof(tokens)/sizeof(tokens[0]); i++) {
391 if (!strncmp(token+2, tokens[i].tok, (token_end - token) - 2))
392 return tokens[i].exp_func(context, tokens[i].param,
393 tokens[i].postfix, ret);
/freebsd-10.0-release/contrib/openbsm/libbsm/
H A Dbsm_audit.c92 * tokens associated with this record. Descriptors are recyled once the
203 TAILQ_INSERT_TAIL(&rec->token_q, tok, tokens);
213 * Assemble an audit record out of its tokens, including allocating header and
214 * trailer tokens. Does not free the token chain, which must be done by the
288 TAILQ_INSERT_HEAD(&rec->token_q, header, tokens);
289 TAILQ_INSERT_TAIL(&rec->token_q, trailer, tokens);
294 TAILQ_FOREACH(tok, &rec->token_q, tokens) {
313 TAILQ_REMOVE(&rec->token_q, tok, tokens);
335 * Add the header token, identify any missing tokens. Write out the tokens t
[all...]
/freebsd-10.0-release/contrib/libyaml/src/
H A Dscanner.c13 * The Scanner transforms the input stream into a sequence of tokens, while the
14 * parser transform the sequence of tokens produced by the Scanner into a
26 * of all the tokens produced by the Scanner together with short descriptions.
28 * Now, tokens:
52 * The following two tokens are "virtual" tokens denoting the beginning and the
61 * The next two tokens are responsible for tags:
73 * The correspoding sequence of tokens:
82 * Note that the VERSION-DIRECTIVE and TAG-DIRECTIVE tokens occupy a whole
91 * and '...' indicators), no DOCUMENT-START and DOCUMENT-END tokens wil
[all...]
/freebsd-10.0-release/contrib/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...]
/freebsd-10.0-release/contrib/openbsm/bin/auditfilterd/
H A Dauditfilterd.c134 * Parse the BSM into a set of tokens, which will be pased to registered
137 #define MAX_TOKENS 128 /* Maximum tokens we handle per record. */
142 tokenstr_t tokens[MAX_TOKENS]; local
148 if (au_fetch_tok(&tokens[tokencount], data + bytesread,
151 bytesread += tokens[tokencount].len;
157 (am->am_record)(am, ts, tokencount, tokens);
/freebsd-10.0-release/contrib/openbsm/sys/bsm/
H A Daudit_internal.h53 TAILQ_ENTRY(au_token) tokens; member in struct:au_token
59 TAILQ_HEAD(, au_token) token_q; /* Queue of BSM tokens. */
70 * using structures for all tokens. This is not straightforward since these
72 * size (e.g text tokens).
/freebsd-10.0-release/sys/bsm/
H A Daudit_internal.h54 TAILQ_ENTRY(au_token) tokens; member in struct:au_token
60 TAILQ_HEAD(, au_token) token_q; /* Queue of BSM tokens. */
71 * using structures for all tokens. This is not straightforward since these
73 * size (e.g text tokens).
/freebsd-10.0-release/bin/sh/
H A Darith_yylex.c50 #error Arithmetic tokens are out of order.
/freebsd-10.0-release/contrib/ntp/ntpdc/
H A Dntpdc.c170 #define MAXTOKENS (1+1+MAXARGS+MOREARGS+2) /* maximum number of usable tokens */
1183 char *tokens[1+MAXARGS+MOREARGS+2]; local
1194 tokenize(cmdline, tokens, &ntok);
1201 i = findcmd(tokens[0], builtins, opcmds, &xcmd);
1204 tokens[0]);
1208 tokens[0]);
1216 pcmd.keyword = tokens[0];
1227 if ((xcmd->arg[i] & OPT) && (*tokens[i+ti] == '>'))
1229 rval = getarg(tokens[i+ti], (int)xcmd->arg[i], &pcmd.argval[i]);
1244 rval = getarg(tokens[
1295 tokenize( const char *line, char **tokens, int *ntok ) argument
[all...]
/freebsd-10.0-release/sbin/gvinum/
H A Dgvinum.c94 int line, tokens; local
123 tokens = gv_tokenize(buffer, token, GV_MAXARGS);
124 if (tokens)
125 parseline(tokens, token);
180 int sd_in_plex, status, subdisks, tokens, undeffd, volumes; local
261 tokens = gv_tokenize(buf, token, GV_MAXARGS);
262 if (tokens <= 0) {
269 v = gv_new_volume(tokens, token);
294 p = gv_new_plex(tokens, token);
330 s = gv_new_sd(tokens, toke
[all...]
/freebsd-10.0-release/gnu/usr.bin/grep/
H A Ddfa.c476 decide the index in dfa->tokens[]. */
1142 REALLOC_IF_NECESSARY(dfa->tokens, token, dfa->talloc, dfa->tindex);
1143 dfa->tokens[dfa->tindex++] = t;
1202 The parser builds a parse tree in postfix form in an array of tokens. */
1263 /* Return the number of tokens in the given subexpression. */
1269 switch (dfa->tokens[tindex - 1])
1292 addtok(dfa->tokens[tindex + i]);
1523 if (d->tokens[s->elems[j].index] < 0)
1532 d->states[i].first_end = d->tokens[s->elems[j].index];
1534 else if (d->tokens[
[all...]
H A Ddfa.h67 /* The regexp is parsed into an array of tokens in postfix form. Some tokens
211 the constraints corresponding to the special tokens previously defined. */
290 charclass *charclasses; /* Array of character sets for CSET tokens. */
295 token *tokens; /* Postfix parse array. */ member in struct:dfa
296 int tindex; /* Index for adding new tokens. */
297 int talloc; /* Number of tokens currently allocated. */
309 if tokens[i] < NOTCHAR
310 bit 1 : tokens[i] is a singlebyte character, or the last-byte of
312 bit 0 : tokens[
[all...]
/freebsd-10.0-release/usr.sbin/i2c/
H A Di2c.c125 int *tokens, fd, error, i, index, j; local
141 tokens = (int *)malloc((len / 2 + 1) * sizeof(int));
142 if (tokens == NULL) {
143 fprintf(stderr, "Error allocating tokens "
147 index = skip_get_tokens(skip_addr, tokens,
166 if (tokens[j] == i) {
199 free(tokens);
/freebsd-10.0-release/contrib/gcclibs/libcpp/
H A Dmacro.c37 unsigned int count; /* # of tokens in argument. */
38 unsigned int expanded_count; /* # of tokens in expanded argument. */
360 /* Loop, reading in the argument's tokens. */
431 /* Try to paste two tokens. On success, return nonzero. In any
585 /* Collect the tokens making up each argument. We don't yet know
598 /* Require space for 2 new tokens (including a CPP_EOF). */
695 intervening padding tokens. If we find the parenthesis, collect
783 _cpp_push_token_context (pfile, node, macro->exp.tokens, macro->count);
806 tokens in the final expansion as we go. The ordering of the if
810 limit = macro->exp.tokens
[all...]
/freebsd-10.0-release/contrib/ntp/ntpq/
H A Dntpq.c372 #define MAXTOKENS (1+MAXARGS+2) /* maximum number of usable tokens */
1443 char *tokens[1+MAXARGS+2]; local
1452 tokenize(cmdline, tokens, &ntok);
1459 i = findcmd(tokens[0], builtins, opcmds, &xcmd);
1462 tokens[0]);
1466 tokens[0]);
1474 pcmd.keyword = tokens[0];
1484 if ((xcmd->arg[i] & OPT) && (*tokens[i+1] == '>'))
1486 if (!getarg(tokens[i+1], (int)xcmd->arg[i], &pcmd.argval[i]))
1492 if (i < ntok && *tokens[
1532 tokenize( const char *line, char **tokens, int *ntok ) argument
[all...]
/freebsd-10.0-release/gnu/usr.bin/rcs/lib/
H A Drcsbase.h321 enum tokens { enum
324 /* tokens */ COLON, ID, NUM, SEMI, STRING
547 extern enum tokens nexttok;
567 int getlex P((enum tokens));
623 extern enum tokens const ctab[];
H A Drcsmap.c36 enum tokens const ctab[] = {
/freebsd-10.0-release/sbin/ipfw/
H A Dipfw2.h74 enum tokens { enum
170 /* dummynet tokens */

Completed in 233 milliseconds

123