libdtrace/common/dt_parser.c

46  * are done as part of the end of dt_compile() or as part of destroying
200 	const char *p, *q, *r, *end, *obj;
202 	for (p = s, end = s + strlen(s); *p != '\0'; p = q) {
206 		if (p == end || (q = strpbrk(p + 1, delimiters)) == NULL)
211 			char *type = alloca((size_t)(end - s) + 1);
351 	ctf_encoding_t le, re;
372 	if (ctf_type_encoding(rfp, rbase, &re) == CTF_ERR) {
384 	rrank = re.cte_bits + ((re.cte_format & CTF_INT_SIGNED) == 0);
767 	 * kernel. When we're using it and its tagged as a userland reference --
1235  * index to the end, advancing using the increment, and searching until we
1747 	} /* end of switch */
1851 			 * If we're negating an unsigned integer, zero out any
2307 	 * If we're inlining an associative array, create a private identifier
2373 	 * the identifier to fully initialize it: if we're declaring an inline
2578 		    "end with a digit: %s\n", name);
2583 	 * dtrace(7D).  If so, set dn_provred to treat it as a re-declaration.
2597 	 * Note that if dnp->dn_provred is true, we may end up storing dups of
2603 		continue; /* skip to end of allocation list */
2679 	 * If we end up calling dtrace_lookup_by_name(), it will reset the
3181 	 * we convert "[" to "+" and glue on "*" at the end (see K&R[A7.3.1])
3986 	 * end up with a comma-separated list inside of a non-associative
4444 	 * If we're declaring a provider for the first time and it is unknown
4446 	 * If we're redeclaring a known provider, verify the interface matches.
4963 			(void) snprintf(s, n, " near end of input");
4965 			(void) snprintf(s, n, " near end of line");