memb              388 drivers/isdn/mISDN/dsp_cmx.c 	int		memb = 0, i, ii, i1, i2;
memb              657 drivers/isdn/mISDN/dsp_cmx.c 		memb++;
memb              661 drivers/isdn/mISDN/dsp_cmx.c 	if (memb < 1)
memb              665 drivers/isdn/mISDN/dsp_cmx.c 	if (memb == 1) {
memb              685 drivers/isdn/mISDN/dsp_cmx.c 	if (memb == 2) {
memb               63 fs/dlm/dir.c   	struct dlm_member *memb;
memb               78 fs/dlm/dir.c   	list_for_each_entry(memb, &ls->ls_nodes, list) {
memb               79 fs/dlm/dir.c   		if (memb->nodeid == dlm_our_nodeid())
memb               91 fs/dlm/dir.c   			error = dlm_rcom_names(ls, memb->nodeid,
memb              133 fs/dlm/dir.c   				error = dlm_master_lookup(ls, memb->nodeid,
memb              149 fs/dlm/dir.c   				    nodeid != memb->nodeid) {
memb              153 fs/dlm/dir.c   						  result, nodeid, memb->nodeid,
memb              164 fs/dlm/dir.c   				    nodeid == memb->nodeid) {
memb             5432 fs/dlm/lock.c  	struct dlm_member *memb;
memb             5440 fs/dlm/lock.c  	list_for_each_entry(memb, &ls->ls_nodes_gone, list) {
memb             5442 fs/dlm/lock.c  		nodeid_gone = memb->nodeid;
memb               28 fs/dlm/member.c 		   struct dlm_member *memb)
memb               35 fs/dlm/member.c 	memb->slot = le16_to_cpu(rf->rf_our_slot);
memb               36 fs/dlm/member.c 	memb->generation = le32_to_cpu(rf->rf_generation);
memb               98 fs/dlm/member.c 	struct dlm_member *memb;
memb              129 fs/dlm/member.c 	list_for_each_entry(memb, &ls->ls_nodes, list) {
memb              131 fs/dlm/member.c 			if (ro->ro_nodeid != memb->nodeid)
memb              133 fs/dlm/member.c 			memb->slot = ro->ro_slot;
memb              134 fs/dlm/member.c 			memb->slot_prev = memb->slot;
memb              138 fs/dlm/member.c 		if (memb->nodeid == our_nodeid) {
memb              139 fs/dlm/member.c 			if (ls->ls_slot && ls->ls_slot != memb->slot) {
memb              142 fs/dlm/member.c 					  memb->slot);
memb              147 fs/dlm/member.c 				ls->ls_slot = memb->slot;
memb              150 fs/dlm/member.c 		if (!memb->slot) {
memb              152 fs/dlm/member.c 				   memb->nodeid);
memb              167 fs/dlm/member.c 	struct dlm_member *memb;
memb              178 fs/dlm/member.c 	list_for_each_entry(memb, &ls->ls_nodes, list) {
memb              179 fs/dlm/member.c 		if (memb->nodeid == our_nodeid) {
memb              180 fs/dlm/member.c 			memb->slot = ls->ls_slot;
memb              181 fs/dlm/member.c 			memb->generation = ls->ls_generation;
memb              186 fs/dlm/member.c 	list_for_each_entry(memb, &ls->ls_nodes, list) {
memb              187 fs/dlm/member.c 		if (memb->generation > gen)
memb              188 fs/dlm/member.c 			gen = memb->generation;
memb              192 fs/dlm/member.c 		if (memb->slot == -1)
memb              197 fs/dlm/member.c 		if (!memb->slot)
memb              204 fs/dlm/member.c 		if (!max || max < memb->slot)
memb              205 fs/dlm/member.c 			max = memb->slot;
memb              209 fs/dlm/member.c 		if (memb->slot_prev && memb->slot && memb->slot_prev != memb->slot) {
memb              211 fs/dlm/member.c 				  memb->nodeid, memb->slot_prev, memb->slot);
memb              214 fs/dlm/member.c 		memb->slot_prev = memb->slot;
memb              226 fs/dlm/member.c 	list_for_each_entry(memb, &ls->ls_nodes, list) {
memb              227 fs/dlm/member.c 		if (!memb->slot)
memb              230 fs/dlm/member.c 		if (memb->slot > array_size) {
memb              231 fs/dlm/member.c 			log_error(ls, "invalid slot number %d", memb->slot);
memb              236 fs/dlm/member.c 		array[memb->slot - 1].nodeid = memb->nodeid;
memb              237 fs/dlm/member.c 		array[memb->slot - 1].slot = memb->slot;
memb              243 fs/dlm/member.c 	list_for_each_entry(memb, &ls->ls_nodes, list) {
memb              244 fs/dlm/member.c 		if (memb->slot)
memb              251 fs/dlm/member.c 			memb->slot = i + 1;
memb              252 fs/dlm/member.c 			memb->slot_prev = memb->slot;
memb              253 fs/dlm/member.c 			array[i].nodeid = memb->nodeid;
memb              254 fs/dlm/member.c 			array[i].slot = memb->slot;
memb              257 fs/dlm/member.c 			if (!ls->ls_slot && memb->nodeid == our_nodeid)
memb              258 fs/dlm/member.c 				ls->ls_slot = memb->slot;
memb              262 fs/dlm/member.c 		if (!memb->slot) {
memb              292 fs/dlm/member.c 	struct dlm_member *memb = NULL;
memb              298 fs/dlm/member.c 		memb = list_entry(tmp, struct dlm_member, list);
memb              299 fs/dlm/member.c 		if (new->nodeid < memb->nodeid)
memb              303 fs/dlm/member.c 	if (!memb)
memb              316 fs/dlm/member.c 	struct dlm_member *memb;
memb              319 fs/dlm/member.c 	memb = kzalloc(sizeof(*memb), GFP_NOFS);
memb              320 fs/dlm/member.c 	if (!memb)
memb              325 fs/dlm/member.c 		kfree(memb);
memb              329 fs/dlm/member.c 	memb->nodeid = node->nodeid;
memb              330 fs/dlm/member.c 	memb->weight = node->weight;
memb              331 fs/dlm/member.c 	memb->comm_seq = node->comm_seq;
memb              332 fs/dlm/member.c 	add_ordered_member(ls, memb);
memb              339 fs/dlm/member.c 	struct dlm_member *memb;
memb              341 fs/dlm/member.c 	list_for_each_entry(memb, head, list) {
memb              342 fs/dlm/member.c 		if (memb->nodeid == nodeid)
memb              343 fs/dlm/member.c 			return memb;
memb              364 fs/dlm/member.c 	struct dlm_member *memb;
memb              367 fs/dlm/member.c 		memb = list_entry(head->next, struct dlm_member, list);
memb              368 fs/dlm/member.c 		list_del(&memb->list);
memb              369 fs/dlm/member.c 		kfree(memb);
memb              386 fs/dlm/member.c 	struct dlm_member *memb;
memb              392 fs/dlm/member.c 	list_for_each_entry(memb, &ls->ls_nodes, list) {
memb              393 fs/dlm/member.c 		if (memb->weight)
memb              394 fs/dlm/member.c 			total += memb->weight;
memb              409 fs/dlm/member.c 	list_for_each_entry(memb, &ls->ls_nodes, list) {
memb              410 fs/dlm/member.c 		if (!all_zero && !memb->weight)
memb              416 fs/dlm/member.c 			w = memb->weight;
memb              421 fs/dlm/member.c 			array[x++] = memb->nodeid;
memb              431 fs/dlm/member.c 	struct dlm_member *memb;
memb              434 fs/dlm/member.c 	list_for_each_entry(memb, &ls->ls_nodes, list) {
memb              438 fs/dlm/member.c 		error = dlm_rcom_status(ls, memb->nodeid, 0);
memb              455 fs/dlm/member.c static void dlm_lsop_recover_slot(struct dlm_ls *ls, struct dlm_member *memb)
memb              470 fs/dlm/member.c 	error = dlm_comm_seq(memb->nodeid, &seq);
memb              472 fs/dlm/member.c 	if (!error && seq == memb->comm_seq)
memb              475 fs/dlm/member.c 	slot.nodeid = memb->nodeid;
memb              476 fs/dlm/member.c 	slot.slot = memb->slot;
memb              483 fs/dlm/member.c 	struct dlm_member *memb;
memb              496 fs/dlm/member.c 	list_for_each_entry(memb, &ls->ls_nodes, list) {
memb              501 fs/dlm/member.c 		slots[i].nodeid = memb->nodeid;
memb              502 fs/dlm/member.c 		slots[i].slot = memb->slot;
memb              526 fs/dlm/member.c 	struct dlm_member *memb, *safe;
memb              533 fs/dlm/member.c 	list_for_each_entry(memb, &ls->ls_nodes_gone, list) {
memb              534 fs/dlm/member.c 		log_rinfo(ls, "prev removed member %d", memb->nodeid);
memb              540 fs/dlm/member.c 	list_for_each_entry_safe(memb, safe, &ls->ls_nodes, list) {
memb              541 fs/dlm/member.c 		node = find_config_node(rv, memb->nodeid);
memb              546 fs/dlm/member.c 			log_rinfo(ls, "remove member %d", memb->nodeid);
memb              550 fs/dlm/member.c 				  memb->nodeid, memb->comm_seq, node->comm_seq);
memb              554 fs/dlm/member.c 		list_move(&memb->list, &ls->ls_nodes_gone);
memb              556 fs/dlm/member.c 		dlm_lsop_recover_slot(ls, memb);
memb              569 fs/dlm/member.c 	list_for_each_entry(memb, &ls->ls_nodes, list) {
memb              570 fs/dlm/member.c 		if (low == -1 || memb->nodeid < low)
memb              571 fs/dlm/member.c 			low = memb->nodeid;
memb               23 fs/dlm/member.h 		   struct dlm_member *memb);
memb               99 fs/dlm/recover.c 	struct dlm_member *memb;
memb              102 fs/dlm/recover.c 	list_for_each_entry(memb, &ls->ls_nodes, list) {
memb              110 fs/dlm/recover.c 			error = dlm_rcom_status(ls, memb->nodeid, 0);
memb              115 fs/dlm/recover.c 				dlm_slot_save(ls, rc, memb);
memb              171 fs/dlm/recover.c 	struct dlm_member *memb;
memb              177 fs/dlm/recover.c 	list_for_each_entry(memb, &ls->ls_nodes, list) {
memb              178 fs/dlm/recover.c 		memb->slot = -1;
memb              179 fs/dlm/recover.c 		memb->generation = 0;
memb              998 net/wireless/nl80211.c #define PUT_TXQVAL_U32(attr, memb) do {					  \
memb             1000 net/wireless/nl80211.c 	    nla_put_u32(msg, NL80211_TXQ_STATS_ ## attr, txqstats->memb)) \
memb             5087 net/wireless/nl80211.c #define PUT_SINFO(attr, memb, type) do {				\
memb             5091 net/wireless/nl80211.c 			     sinfo->memb))				\
memb             5094 net/wireless/nl80211.c #define PUT_SINFO_U64(attr, memb) do {					\
memb             5097 net/wireless/nl80211.c 			      sinfo->memb, NL80211_STA_INFO_PAD))	\
memb             5235 net/wireless/nl80211.c #define PUT_TIDVAL_U64(attr, memb) do {					\
memb             5238 net/wireless/nl80211.c 			      tidstats->memb, NL80211_TID_STATS_PAD))	\