Searched refs:klist_next (Results 1 - 8 of 8) sorted by relevance

/linux-master/lib/
H A Dlist-test.c1245 KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &a);
1246 KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &b);
1247 KUNIT_EXPECT_NULL(test, klist_next(&i));
1273 KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &b);
1274 KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &a);
1275 KUNIT_EXPECT_NULL(test, klist_next(&i));
1304 KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &b);
1305 KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &d);
1306 KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &a);
1307 KUNIT_EXPECT_PTR_EQ(test, klist_next(
[all...]
H A Dklist.c21 * and initialized before an iteration. klist_next() is used to acquire the
368 * klist_next - Ante up next node in list.
375 struct klist_node *klist_next(struct klist_iter *i) function
407 EXPORT_SYMBOL_GPL(klist_next); variable
/linux-master/include/linux/
H A Dklist.h65 extern struct klist_node *klist_next(struct klist_iter *i);
/linux-master/drivers/base/
H A Ddriver.c22 struct klist_node *n = klist_next(i);
H A Dattribute_container.c184 struct klist_node *n = klist_next(iter); \
H A Dbus.c324 struct klist_node *n = klist_next(i);
414 struct klist_node *n = klist_next(i);
1106 knode = klist_next(&iter->ki);
H A Dclass.c344 knode = klist_next(&iter->ki);
H A Dcore.c3970 struct klist_node *n = klist_next(i);

Completed in 289 milliseconds