Lines Matching +defs:e1 +defs:t
414 sbuf_printf(&sb, "%s: can't re-use a leaf (", __func__);
506 /* don't loop forever */
620 struct sysctl_ctx_entry *e, *e1;
627 * XXX This algorithm is a hack. But I don't know any
642 e1 = TAILQ_PREV(e, sysctl_ctx_list, link);
644 e1 = TAILQ_LAST(clist, sysctl_ctx_list);
645 while (e1 != NULL) {
646 sysctl_register_oid(e1->entry);
647 e1 = TAILQ_PREV(e1, sysctl_ctx_list, link);
654 TAILQ_FOREACH_SAFE(e, clist, link, e1) {
699 * NOTE: this function doesn't free oidp! You have to remove it
806 printf("Warning: can't remove non-dynamic nodes (%s)!\n",
1094 * (be aware though, that the proper interface isn't as obvious as it
1238 * XXXRW/JA: Shouldn't return name data for nodes that we don't permit in
1423 * XXXRW/JA: Shouldn't return next data for nodes that we don't permit in
1511 * XXXRW/JA: Shouldn't return name2oid data for nodes that we don't permit in
1892 * If the sysctl isn't writable and isn't a preallocated tunable that
1896 * string. In ddb, don't worry about trying to make a malloced
2325 * You can't call a sysctl when it's a node, but has
2345 * If the process is in capability mode, then don't permit reading or
3073 int error, i, t, flags;
3076 t = db_read_token();
3077 if (t == tSLASH || t == tMINUS) {
3078 t = db_read_token();
3079 if (t != tIDENT) {
3087 db_unread_token(t);
3099 t = db_read_token();
3100 if (t != tIDENT) {
3110 t = db_read_token();
3111 if (t != tEOL) {