Lines Matching defs:node
63 static void dca_rmlist2(dca_listnode_t *node, kmutex_t *);
1251 dca_enlist2(dca_listnode_t *q, dca_listnode_t *node, kmutex_t *lock)
1253 if (!q || !node)
1257 node->dl_next2 = q;
1258 node->dl_prev2 = q->dl_prev2;
1259 node->dl_next2->dl_prev2 = node;
1260 node->dl_prev2->dl_next2 = node;
1265 dca_rmlist2(dca_listnode_t *node, kmutex_t *lock)
1267 if (!node)
1271 node->dl_next2->dl_prev2 = node->dl_prev2;
1272 node->dl_prev2->dl_next2 = node->dl_next2;
1273 node->dl_next2 = NULL;
1274 node->dl_prev2 = NULL;
1281 dca_listnode_t *node;
1284 if ((node = q->dl_next2) == q) {
1289 node->dl_next2->dl_prev2 = node->dl_prev2;
1290 node->dl_prev2->dl_next2 = node->dl_next2;
1291 node->dl_next2 = NULL;
1292 node->dl_prev2 = NULL;
1295 return (node);
1308 dca_enqueue(dca_listnode_t *q, dca_listnode_t *node)
1314 node->dl_next = q;
1315 node->dl_prev = q->dl_prev;
1316 node->dl_next->dl_prev = node;
1317 node->dl_prev->dl_next = node;
1321 dca_rmqueue(dca_listnode_t *node)
1323 node->dl_next->dl_prev = node->dl_prev;
1324 node->dl_prev->dl_next = node->dl_next;
1325 node->dl_next = NULL;
1326 node->dl_prev = NULL;
1332 dca_listnode_t *node;
1337 if ((node = q->dl_next) == q) {
1341 dca_rmqueue(node);
1342 return (node);
1349 dca_listnode_t *node;
1354 if ((node = q->dl_prev) == q) {
1358 dca_rmqueue(node);
1359 return (node);
1365 dca_listnode_t *node;
1367 if ((node = q->dl_next) == q) {
1370 return (node);
4718 dca_listnode_t *node;
4724 while ((node = dca_delist2(&dca->dca_ctx_list,
4726 ctx.cc_provider_private = node;