HomeSort by: relevance | last modified time | path
    Searched defs:kte_next (Results 1 - 3 of 3) sorted by relevancy

  /src/usr.bin/ktruss/
dump.c 220 struct ktr_entry *kte, *kte_next; local in function:flushpendq
223 for (kte = TAILQ_FIRST(&ktependq); kte != NULL; kte = kte_next) {
224 kte_next = TAILQ_NEXT(kte, kte_list);
235 struct ktr_entry *kte, *kte_next; local in function:getpendq
240 for (kte = TAILQ_FIRST(&ktependq); kte != NULL; kte = kte_next) {
241 kte_next = TAILQ_NEXT(kte, kte_list);
dump.c 220 struct ktr_entry *kte, *kte_next; local in function:flushpendq
223 for (kte = TAILQ_FIRST(&ktependq); kte != NULL; kte = kte_next) {
224 kte_next = TAILQ_NEXT(kte, kte_list);
235 struct ktr_entry *kte, *kte_next; local in function:getpendq
240 for (kte = TAILQ_FIRST(&ktependq); kte != NULL; kte = kte_next) {
241 kte_next = TAILQ_NEXT(kte, kte_list);
dump.c 220 struct ktr_entry *kte, *kte_next; local in function:flushpendq
223 for (kte = TAILQ_FIRST(&ktependq); kte != NULL; kte = kte_next) {
224 kte_next = TAILQ_NEXT(kte, kte_list);
235 struct ktr_entry *kte, *kte_next; local in function:getpendq
240 for (kte = TAILQ_FIRST(&ktependq); kte != NULL; kte = kte_next) {
241 kte_next = TAILQ_NEXT(kte, kte_list);

Completed in 148 milliseconds