/freebsd-9.3-release/contrib/ntp/libjsmn/ |
H A D | jsmn.c | 9 jsmntok_t *tokens, size_t num_tokens) { 14 tok = &tokens[parser->toknext++]; 38 size_t len, jsmntok_t *tokens, size_t num_tokens) { 66 if (tokens == NULL) { 70 token = jsmn_alloc_token(parser, tokens, num_tokens); 87 size_t len, jsmntok_t *tokens, size_t num_tokens) { 100 if (tokens == NULL) { 103 token = jsmn_alloc_token(parser, tokens, num_tokens); 151 * Parse JSON string and fill tokens. 154 jsmntok_t *tokens, unsigne 8 jsmn_alloc_token(jsmn_parser *parser, jsmntok_t *tokens, size_t num_tokens) argument 37 jsmn_parse_primitive(jsmn_parser *parser, const char *js, size_t len, jsmntok_t *tokens, size_t num_tokens) argument 86 jsmn_parse_string(jsmn_parser *parser, const char *js, size_t len, jsmntok_t *tokens, size_t num_tokens) argument 153 jsmn_parse(jsmn_parser *parser, const char *js, size_t len, jsmntok_t *tokens, unsigned int num_tokens) argument [all...] |
H A D | jsmn_test.c | 86 jsmntok_t tokens[10]; local 91 r = jsmn_parse(&p, js, strlen(js), tokens, 10); 93 check(TOKEN_EQ(tokens[0], 0, 8, JSMN_OBJECT)); 94 check(TOKEN_EQ(tokens[1], 2, 3, JSMN_STRING)); 95 check(TOKEN_EQ(tokens[2], 6, 7, JSMN_PRIMITIVE)); 97 check(TOKEN_STRING(js, tokens[0], js)); 98 check(TOKEN_STRING(js, tokens[1], "a")); 99 check(TOKEN_STRING(js, tokens[2], "0")); 103 r = jsmn_parse(&p, js, strlen(js), tokens, 10); 108 r = jsmn_parse(&p, js, strlen(js), tokens, 1 335 jsmntok_t tokens[10]; local 364 jsmntok_t tokens[128]; local 396 jsmntok_t tokens[10]; local 442 jsmntok_t tokens[10]; local 507 jsmntok_t tokens[10]; local 572 jsmntok_t tokens[10]; local [all...] |
H A D | jsmn.h | 25 /* Not enough tokens were provided */ 60 * Create JSON parser over an array of tokens 65 * Run JSON parser. It parses a JSON data string into and array of tokens, each describing 69 jsmntok_t *tokens, unsigned int num_tokens);
|
/freebsd-9.3-release/lib/libc/stdlib/ |
H A D | getsubopt.c | 48 getsubopt(optionp, tokens, valuep) 50 char * const *tokens; 93 for (cnt = 0; *tokens; ++tokens, ++cnt) 94 if (!strcmp(suboptarg, *tokens))
|
/freebsd-9.3-release/usr.sbin/asf/ |
H A D | asf_prog.c | 53 int tokens; local 65 tokens = tokenize(buf, token, MAXTOKEN); 66 if (tokens < 4)
|
/freebsd-9.3-release/contrib/gcclibs/libcpp/include/ |
H A D | cpp-id-data.h | 46 /* 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-9.3-release/contrib/openbsm/libbsm/ |
H A D | bsm_audit.c | 92 * 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-9.3-release/contrib/texinfo/makeinfo/ |
H A D | defun.c | 37 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-9.3-release/contrib/ipfilter/perl/ |
H A D | ipfmeta.pl | 19 my @tokens; 26 push (@tokens, split); 32 while (@tokens) { 33 my $token = shift(@tokens);
|
/freebsd-9.3-release/contrib/openbsm/bin/auditfilterd/ |
H A D | auditfilterd.c | 134 * 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-9.3-release/contrib/openbsm/sys/bsm/ |
H A D | audit_internal.h | 53 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-9.3-release/sys/bsm/ |
H A D | audit_internal.h | 54 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-9.3-release/bin/sh/ |
H A D | arith_yylex.c | 50 #error Arithmetic tokens are out of order.
|
/freebsd-9.3-release/contrib/ntp/ntpdc/ |
H A D | ntpdc.c | 167 #define MAXTOKENS (1+1+MAXARGS+MOREARGS+2) /* maximum number of usable tokens */ 1138 char *tokens[1+MAXARGS+MOREARGS+2]; local 1154 tokenize(cmdline, tokens, &ntok); 1161 i = findcmd(tokens[0], builtins, opcmds, &xcmd); 1164 tokens[0]); 1168 tokens[0]); 1176 pcmd.keyword = tokens[0]; 1187 if ((xcmd->arg[i] & OPT) && (*tokens[i+ti] == '>')) 1189 rval = getarg(tokens[i+ti], (int)xcmd->arg[i], &pcmd.argval[i]); 1204 rval = getarg(tokens[ 1255 tokenize( const char *line, char **tokens, int *ntok ) argument [all...] |
/freebsd-9.3-release/sbin/gvinum/ |
H A D | gvinum.c | 95 int line, tokens; local 124 tokens = gv_tokenize(buffer, token, GV_MAXARGS); 125 if (tokens) 126 parseline(tokens, token); 181 int sd_in_plex, status, subdisks, tokens, undeffd, volumes; local 262 tokens = gv_tokenize(buf, token, GV_MAXARGS); 263 if (tokens <= 0) { 270 v = gv_new_volume(tokens, token); 295 p = gv_new_plex(tokens, token); 331 s = gv_new_sd(tokens, toke [all...] |
/freebsd-9.3-release/gnu/usr.bin/grep/ |
H A D | dfa.c | 476 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 D | dfa.h | 67 /* 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-9.3-release/contrib/ntp/sntp/libevent/ |
H A D | event_rpcgen.py | 1321 tokens = entry.split(' ') 1322 while tokens: 1323 token = tokens[0] 1324 tokens = tokens[1:] 1416 tokens = data.split(' ') 1418 # First three tokens are: 'struct' 'name' '{' 1419 newstruct = factory.Struct(tokens[1]) 1421 inside = ' '.join(tokens[3:-1]) 1423 tokens [all...] |
/freebsd-9.3-release/usr.sbin/i2c/ |
H A D | i2c.c | 125 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-9.3-release/contrib/gcclibs/libcpp/ |
H A D | macro.c | 38 unsigned int count; /* # of tokens in argument. */ 39 unsigned int expanded_count; /* # of tokens in expanded argument. */ 364 /* Loop, reading in the argument's tokens. */ 435 /* Try to paste two tokens. On success, return nonzero. In any 598 /* Collect the tokens making up each argument. We don't yet know 611 /* Require space for 2 new tokens (including a CPP_EOF). */ 708 intervening padding tokens. If we find the parenthesis, collect 796 _cpp_push_token_context (pfile, node, macro->exp.tokens, macro->count); 819 tokens in the final expansion as we go. The ordering of the if 823 limit = macro->exp.tokens [all...] |
/freebsd-9.3-release/gnu/usr.bin/rcs/lib/ |
H A D | rcsbase.h | 321 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 D | rcsmap.c | 36 enum tokens const ctab[] = {
|
H A D | rcssyn.c | 158 static char const *getkeyval P((char const*,enum tokens,int)); 482 enum tokens token;
|
/freebsd-9.3-release/sbin/ipfw/ |
H A D | ipfw2.h | 74 enum tokens { enum 170 /* dummynet tokens */
|
/freebsd-9.3-release/contrib/ntp/ntpq/ |
H A D | ntpq.c | 325 #define MAXTOKENS (1+MAXARGS+2) /* maximum number of usable tokens */ 1542 char *tokens[1+MAXARGS+2]; local 1551 tokenize(cmdline, tokens, &ntok); 1558 i = findcmd(tokens[0], builtins, opcmds, &xcmd); 1561 tokens[0]); 1565 tokens[0]); 1571 fprintf(stderr, "***Extra arg `%s' ignored\n", tokens[i]); 1578 pcmd.keyword = tokens[0]; 1588 if ((xcmd->arg[i] & OPT) && (*tokens[i+1] == '>')) 1590 if (!getarg(tokens[ 1644 tokenize( const char *line, char **tokens, int *ntok ) argument [all...] |