net/tipc/name_table.c

53  * @lower: service range lower bound
63 	u32 lower;
100 	((sr)->lower <= (end) && (sr)->upper >= (start))
142 			 * subtree. If not, it has lower > end, then nodes on
158 		if (sr->lower <= end &&
188 			 * subtree. If not, it has lower > end, then any next
208 		if (sr->lower <= end) {
287 	service_range_foreach_match(sr, sc, ua->sr.lower, ua->sr.upper) {
289 		if (sr->lower == ua->sr.lower && sr->upper == ua->sr.upper)
301 	u32 lower = p->sr.lower;
308 		if (lower == sr->lower && upper == sr->upper)
312 		if (lower <= sr->lower)
320 	sr->lower = lower;
353 				 p->sr.type, p->sr.lower, p->sr.upper,
372 			p->sr.type, p->sr.lower, p->sr.upper);
427 	u32 filter, lower, upper;
430 	lower = sub->s.seq.lower;
440 	service_range_foreach_match(sr, service, lower, upper) {
542 		       ua->sr.type, ua->sr.lower, ua->sr.upper,
689 	service_range_foreach_match(sr, sc, ua->sr.lower, ua->sr.upper) {
718 	service_range_foreach_match(sr, sc, ua->sr.lower, ua->sr.upper) {
750 					      p->sr.lower);
836 		   sub->s.seq.lower, sub->s.seq.upper);
847 			type, sub->s.seq.lower, sub->s.seq.upper);
865 		   sub->s.seq.type, sub->s.seq.lower, sub->s.seq.upper);
997 		if (nla_put_u32(msg->skb, TIPC_NLA_PUBL_LOWER, sr->lower))
1038 		if (sr->lower < *last_lower)
1042 			*last_lower = sr->lower;