Lines Matching refs:na
252 struct dlm_node_addr *na;
254 list_for_each_entry(na, &dlm_node_addrs, list) {
255 if (na->nodeid == nodeid)
256 return na;
292 struct dlm_node_addr *na;
298 na = find_node_addr(nodeid);
299 if (na && na->addr_count) {
300 memcpy(&sas, na->addr[na->curr_addr_index],
304 na->curr_addr_index++;
305 if (na->curr_addr_index == na->addr_count)
306 na->curr_addr_index = 0;
311 if (!na)
314 if (!na->addr_count)
338 struct dlm_node_addr *na;
343 list_for_each_entry(na, &dlm_node_addrs, list) {
344 if (!na->addr_count)
347 for (addr_i = 0; addr_i < na->addr_count; addr_i++) {
348 if (addr_compare(na->addr[addr_i], addr)) {
349 *nodeid = na->nodeid;
363 struct dlm_node_addr *new_node, *na;
378 na = find_node_addr(nodeid);
379 if (!na) {
388 if (na->addr_count >= DLM_MAX_ADDR_COUNT) {
395 na->addr[na->addr_count++] = new_addr;
1497 struct dlm_node_addr *na;
1508 na = find_node_addr(nodeid);
1509 if (na) {
1510 list_del(&na->list);
1511 while (na->addr_count--)
1512 kfree(na->addr[na->addr_count]);
1513 kfree(na);
1714 struct dlm_node_addr *na, *safe;
1717 list_for_each_entry_safe(na, safe, &dlm_node_addrs, list) {
1718 list_del(&na->list);
1719 while (na->addr_count--)
1720 kfree(na->addr[na->addr_count]);
1721 kfree(na);