msg.h 20.3 KB
Newer Older
P
Per Liden 已提交
1 2
/*
 * net/tipc/msg.h: Include file for TIPC message header routines
3
 *
4
 * Copyright (c) 2000-2007, 2014-2015 Ericsson AB
5
 * Copyright (c) 2005-2008, 2010-2011, Wind River Systems
P
Per Liden 已提交
6 7
 * All rights reserved.
 *
P
Per Liden 已提交
8
 * Redistribution and use in source and binary forms, with or without
P
Per Liden 已提交
9 10
 * modification, are permitted provided that the following conditions are met:
 *
P
Per Liden 已提交
11 12 13 14 15 16 17 18
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the names of the copyright holders nor the names of its
 *    contributors may be used to endorse or promote products derived from
 *    this software without specific prior written permission.
P
Per Liden 已提交
19
 *
P
Per Liden 已提交
20 21 22 23 24 25 26 27 28 29 30 31 32 33
 * Alternatively, this software may be distributed under the terms of the
 * GNU General Public License ("GPL") version 2 as published by the Free
 * Software Foundation.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
P
Per Liden 已提交
34 35 36 37 38 39
 * POSSIBILITY OF SUCH DAMAGE.
 */

#ifndef _TIPC_MSG_H
#define _TIPC_MSG_H

40
#include <linux/tipc.h>
41
#include "core.h"
P
Per Liden 已提交
42

43 44 45 46 47
/*
 * Constants and routines used to read and write TIPC payload message headers
 *
 * Note: Some items are also used with TIPC internal message headers
 */
P
Per Liden 已提交
48
#define TIPC_VERSION              2
49
struct plist;
50

51
/*
52 53 54 55 56 57
 * Payload message users are defined in TIPC's public API:
 * - TIPC_LOW_IMPORTANCE
 * - TIPC_MEDIUM_IMPORTANCE
 * - TIPC_HIGH_IMPORTANCE
 * - TIPC_CRITICAL_IMPORTANCE
 */
58 59
#define TIPC_SYSTEM_IMPORTANCE	4

60 61 62

/*
 * Payload message types
63 64 65 66 67 68
 */
#define TIPC_CONN_MSG		0
#define TIPC_MCAST_MSG		1
#define TIPC_NAMED_MSG		2
#define TIPC_DIRECT_MSG		3

69 70 71 72 73 74 75
/*
 * Internal message users
 */
#define  BCAST_PROTOCOL       5
#define  MSG_BUNDLER          6
#define  LINK_PROTOCOL        7
#define  CONN_MANAGER         8
76
#define  TUNNEL_PROTOCOL      10
77 78 79 80 81
#define  NAME_DISTRIBUTOR     11
#define  MSG_FRAGMENTER       12
#define  LINK_CONFIG          13
#define  SOCK_WAKEUP          14       /* pseudo user */

82 83 84
/*
 * Message header sizes
 */
85 86 87 88
#define SHORT_H_SIZE              24	/* In-cluster basic payload message */
#define BASIC_H_SIZE              32	/* Basic payload message */
#define NAMED_H_SIZE              40	/* Named payload message */
#define MCAST_H_SIZE              44	/* Multicast payload message */
89 90 91 92
#define INT_H_SIZE                40	/* Internal messages */
#define MIN_H_SIZE                24	/* Smallest legal TIPC header size */
#define MAX_H_SIZE                60	/* Largest possible TIPC header size */

P
Per Liden 已提交
93 94
#define MAX_MSG_SIZE (MAX_H_SIZE + TIPC_MAX_USER_MSG_SIZE)

95
#define TIPC_MEDIA_INFO_OFFSET	5
96

Y
Ying Xue 已提交
97 98 99 100 101 102 103 104 105
/**
 * TIPC message buffer code
 *
 * TIPC message buffer headroom reserves space for the worst-case
 * link-level device header (in case the message is sent off-node).
 *
 * Note: Headroom should be a multiple of 4 to ensure the TIPC header fields
 *       are word aligned for quicker access
 */
E
Erik Hugne 已提交
106
#define BUF_HEADROOM (LL_MAX_HEADER + 48)
Y
Ying Xue 已提交
107 108 109 110

struct tipc_skb_cb {
	void *handle;
	struct sk_buff *tail;
111
	bool validated;
Y
Ying Xue 已提交
112 113 114 115 116 117 118
	bool wakeup_pending;
	u16 chain_sz;
	u16 chain_imp;
};

#define TIPC_SKB_CB(__skb) ((struct tipc_skb_cb *)&((__skb)->cb[0]))

119 120 121
struct tipc_msg {
	__be32 hdr[15];
};
122

Y
Ying Xue 已提交
123 124 125 126 127
static inline struct tipc_msg *buf_msg(struct sk_buff *skb)
{
	return (struct tipc_msg *)skb->data;
}

128 129 130 131
static inline u32 msg_word(struct tipc_msg *m, u32 pos)
{
	return ntohl(m->hdr[pos]);
}
P
Per Liden 已提交
132 133 134 135 136 137

static inline void msg_set_word(struct tipc_msg *m, u32 w, u32 val)
{
	m->hdr[w] = htonl(val);
}

138 139 140 141 142
static inline u32 msg_bits(struct tipc_msg *m, u32 w, u32 pos, u32 mask)
{
	return (msg_word(m, w) >> pos) & mask;
}

P
Per Liden 已提交
143 144 145
static inline void msg_set_bits(struct tipc_msg *m, u32 w,
				u32 pos, u32 mask, u32 val)
{
146
	val = (val & mask) << pos;
A
Al Viro 已提交
147 148 149
	mask = mask << pos;
	m->hdr[w] &= ~htonl(mask);
	m->hdr[w] |= htonl(val);
P
Per Liden 已提交
150 151
}

152 153 154 155 156 157 158 159
static inline void msg_swap_words(struct tipc_msg *msg, u32 a, u32 b)
{
	u32 temp = msg->hdr[a];

	msg->hdr[a] = msg->hdr[b];
	msg->hdr[b] = temp;
}

160
/*
P
Per Liden 已提交
161 162 163 164 165 166 167
 * Word 0
 */
static inline u32 msg_version(struct tipc_msg *m)
{
	return msg_bits(m, 0, 29, 7);
}

168
static inline void msg_set_version(struct tipc_msg *m)
P
Per Liden 已提交
169
{
170
	msg_set_bits(m, 0, 29, 7, TIPC_VERSION);
P
Per Liden 已提交
171 172 173 174 175 176 177 178 179
}

static inline u32 msg_user(struct tipc_msg *m)
{
	return msg_bits(m, 0, 25, 0xf);
}

static inline u32 msg_isdata(struct tipc_msg *m)
{
E
Eric Dumazet 已提交
180
	return msg_user(m) <= TIPC_CRITICAL_IMPORTANCE;
P
Per Liden 已提交
181 182
}

183
static inline void msg_set_user(struct tipc_msg *m, u32 n)
P
Per Liden 已提交
184 185 186 187
{
	msg_set_bits(m, 0, 25, 0xf, n);
}

188 189 190 191 192
static inline u32 msg_hdr_sz(struct tipc_msg *m)
{
	return msg_bits(m, 0, 21, 0xf) << 2;
}

193
static inline void msg_set_hdr_sz(struct tipc_msg *m, u32 n)
P
Per Liden 已提交
194 195 196 197
{
	msg_set_bits(m, 0, 21, 0xf, n>>2);
}

198 199 200 201 202 203 204 205 206 207
static inline u32 msg_size(struct tipc_msg *m)
{
	return msg_bits(m, 0, 0, 0x1ffff);
}

static inline u32 msg_data_sz(struct tipc_msg *m)
{
	return msg_size(m) - msg_hdr_sz(m);
}

208
static inline int msg_non_seq(struct tipc_msg *m)
P
Per Liden 已提交
209 210 211 212
{
	return msg_bits(m, 0, 20, 1);
}

213
static inline void msg_set_non_seq(struct tipc_msg *m, u32 n)
P
Per Liden 已提交
214
{
215
	msg_set_bits(m, 0, 20, 1, n);
P
Per Liden 已提交
216 217
}

218
static inline int msg_dest_droppable(struct tipc_msg *m)
P
Per Liden 已提交
219 220 221 222
{
	return msg_bits(m, 0, 19, 1);
}

223
static inline void msg_set_dest_droppable(struct tipc_msg *m, u32 d)
P
Per Liden 已提交
224 225 226 227
{
	msg_set_bits(m, 0, 19, 1, d);
}

228
static inline int msg_src_droppable(struct tipc_msg *m)
P
Per Liden 已提交
229 230 231 232
{
	return msg_bits(m, 0, 18, 1);
}

233
static inline void msg_set_src_droppable(struct tipc_msg *m, u32 d)
P
Per Liden 已提交
234 235 236 237 238 239 240 241 242
{
	msg_set_bits(m, 0, 18, 1, d);
}

static inline void msg_set_size(struct tipc_msg *m, u32 sz)
{
	m->hdr[0] = htonl((msg_word(m, 0) & ~0x1ffff) | sz);
}

243 244 245 246 247 248 249 250 251
static inline unchar *msg_data(struct tipc_msg *m)
{
	return ((unchar *)m) + msg_hdr_sz(m);
}

static inline struct tipc_msg *msg_get_wrapped(struct tipc_msg *m)
{
	return (struct tipc_msg *)msg_data(m);
}
P
Per Liden 已提交
252

253
/*
P
Per Liden 已提交
254 255
 * Word 1
 */
256 257 258 259 260
static inline u32 msg_type(struct tipc_msg *m)
{
	return msg_bits(m, 1, 29, 0x7);
}

261
static inline void msg_set_type(struct tipc_msg *m, u32 n)
P
Per Liden 已提交
262 263 264 265
{
	msg_set_bits(m, 1, 29, 0x7, n);
}

266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285
static inline u32 msg_named(struct tipc_msg *m)
{
	return msg_type(m) == TIPC_NAMED_MSG;
}

static inline u32 msg_mcast(struct tipc_msg *m)
{
	return msg_type(m) == TIPC_MCAST_MSG;
}

static inline u32 msg_connected(struct tipc_msg *m)
{
	return msg_type(m) == TIPC_CONN_MSG;
}

static inline u32 msg_errcode(struct tipc_msg *m)
{
	return msg_bits(m, 1, 25, 0xf);
}

286
static inline void msg_set_errcode(struct tipc_msg *m, u32 err)
P
Per Liden 已提交
287 288 289 290
{
	msg_set_bits(m, 1, 25, 0xf, err);
}

291
static inline u32 msg_reroute_cnt(struct tipc_msg *m)
P
Per Liden 已提交
292 293 294 295
{
	return msg_bits(m, 1, 21, 0xf);
}

296
static inline void msg_incr_reroute_cnt(struct tipc_msg *m)
P
Per Liden 已提交
297 298 299 300
{
	msg_set_bits(m, 1, 21, 0xf, msg_reroute_cnt(m) + 1);
}

301
static inline void msg_reset_reroute_cnt(struct tipc_msg *m)
P
Per Liden 已提交
302 303 304 305 306 307 308 309 310
{
	msg_set_bits(m, 1, 21, 0xf, 0);
}

static inline u32 msg_lookup_scope(struct tipc_msg *m)
{
	return msg_bits(m, 1, 19, 0x3);
}

311
static inline void msg_set_lookup_scope(struct tipc_msg *m, u32 n)
P
Per Liden 已提交
312 313 314 315
{
	msg_set_bits(m, 1, 19, 0x3, n);
}

316
static inline u16 msg_bcast_ack(struct tipc_msg *m)
P
Per Liden 已提交
317 318 319 320
{
	return msg_bits(m, 1, 0, 0xffff);
}

321
static inline void msg_set_bcast_ack(struct tipc_msg *m, u16 n)
P
Per Liden 已提交
322 323 324 325 326
{
	msg_set_bits(m, 1, 0, 0xffff, n);
}


327
/*
P
Per Liden 已提交
328 329
 * Word 2
 */
330
static inline u16 msg_ack(struct tipc_msg *m)
P
Per Liden 已提交
331 332 333 334
{
	return msg_bits(m, 2, 16, 0xffff);
}

335
static inline void msg_set_ack(struct tipc_msg *m, u16 n)
P
Per Liden 已提交
336 337 338 339
{
	msg_set_bits(m, 2, 16, 0xffff, n);
}

340
static inline u16 msg_seqno(struct tipc_msg *m)
P
Per Liden 已提交
341 342 343 344
{
	return msg_bits(m, 2, 0, 0xffff);
}

345
static inline void msg_set_seqno(struct tipc_msg *m, u16 n)
P
Per Liden 已提交
346 347 348 349
{
	msg_set_bits(m, 2, 0, 0xffff, n);
}

350
/*
P
Per Liden 已提交
351 352
 * Words 3-10
 */
353 354
static inline u32 msg_importance(struct tipc_msg *m)
{
355 356 357 358 359
	int usr = msg_user(m);

	if (likely((usr <= TIPC_CRITICAL_IMPORTANCE) && !msg_errcode(m)))
		return usr;
	if ((usr == MSG_FRAGMENTER) || (usr == MSG_BUNDLER))
360 361 362 363 364 365
		return msg_bits(m, 5, 13, 0x7);
	return TIPC_SYSTEM_IMPORTANCE;
}

static inline void msg_set_importance(struct tipc_msg *m, u32 i)
{
366 367 368
	int usr = msg_user(m);

	if (likely((usr == MSG_FRAGMENTER) || (usr == MSG_BUNDLER)))
369
		msg_set_bits(m, 5, 13, 0x7, i);
370
	else if (i < TIPC_SYSTEM_IMPORTANCE)
371 372 373 374 375
		msg_set_user(m, i);
	else
		pr_warn("Trying to set illegal importance in message\n");
}

376 377 378 379 380
static inline u32 msg_prevnode(struct tipc_msg *m)
{
	return msg_word(m, 3);
}

381
static inline void msg_set_prevnode(struct tipc_msg *m, u32 a)
P
Per Liden 已提交
382 383 384 385
{
	msg_set_word(m, 3, a);
}

386 387
static inline u32 msg_origport(struct tipc_msg *m)
{
388 389
	if (msg_user(m) == MSG_FRAGMENTER)
		m = msg_get_wrapped(m);
390 391 392
	return msg_word(m, 4);
}

393
static inline void msg_set_origport(struct tipc_msg *m, u32 p)
P
Per Liden 已提交
394 395 396 397
{
	msg_set_word(m, 4, p);
}

398 399 400 401 402
static inline u32 msg_destport(struct tipc_msg *m)
{
	return msg_word(m, 5);
}

403
static inline void msg_set_destport(struct tipc_msg *m, u32 p)
P
Per Liden 已提交
404 405 406 407
{
	msg_set_word(m, 5, p);
}

408 409 410 411 412
static inline u32 msg_mc_netid(struct tipc_msg *m)
{
	return msg_word(m, 5);
}

413
static inline void msg_set_mc_netid(struct tipc_msg *m, u32 p)
P
Per Liden 已提交
414 415 416 417
{
	msg_set_word(m, 5, p);
}

418 419
static inline int msg_short(struct tipc_msg *m)
{
420
	return msg_hdr_sz(m) == SHORT_H_SIZE;
421 422 423 424 425 426 427 428 429
}

static inline u32 msg_orignode(struct tipc_msg *m)
{
	if (likely(msg_short(m)))
		return msg_prevnode(m);
	return msg_word(m, 6);
}

430
static inline void msg_set_orignode(struct tipc_msg *m, u32 a)
P
Per Liden 已提交
431 432 433 434
{
	msg_set_word(m, 6, a);
}

435 436 437 438 439
static inline u32 msg_destnode(struct tipc_msg *m)
{
	return msg_word(m, 7);
}

440
static inline void msg_set_destnode(struct tipc_msg *m, u32 a)
P
Per Liden 已提交
441 442 443 444
{
	msg_set_word(m, 7, a);
}

445 446 447 448 449
static inline u32 msg_nametype(struct tipc_msg *m)
{
	return msg_word(m, 8);
}

450
static inline void msg_set_nametype(struct tipc_msg *m, u32 n)
P
Per Liden 已提交
451 452 453 454
{
	msg_set_word(m, 8, n);
}

455 456 457 458 459 460 461 462 463 464
static inline u32 msg_nameinst(struct tipc_msg *m)
{
	return msg_word(m, 9);
}

static inline u32 msg_namelower(struct tipc_msg *m)
{
	return msg_nameinst(m);
}

465
static inline void msg_set_namelower(struct tipc_msg *m, u32 n)
P
Per Liden 已提交
466 467 468 469
{
	msg_set_word(m, 9, n);
}

470
static inline void msg_set_nameinst(struct tipc_msg *m, u32 n)
P
Per Liden 已提交
471 472 473 474
{
	msg_set_namelower(m, n);
}

475 476 477 478 479
static inline u32 msg_nameupper(struct tipc_msg *m)
{
	return msg_word(m, 10);
}

480
static inline void msg_set_nameupper(struct tipc_msg *m, u32 n)
P
Per Liden 已提交
481 482 483 484 485
{
	msg_set_word(m, 10, n);
}

/*
486 487
 * Constants and routines used to read and write TIPC internal message headers
 */
P
Per Liden 已提交
488

489
/*
490
 *  Connection management protocol message types
P
Per Liden 已提交
491 492 493 494 495
 */
#define CONN_PROBE        0
#define CONN_PROBE_REPLY  1
#define CONN_ACK          2

496
/*
497
 * Name distributor message types
P
Per Liden 已提交
498 499 500 501
 */
#define PUBLICATION       0
#define WITHDRAWAL        1

502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518
/*
 * Segmentation message types
 */
#define FIRST_FRAGMENT		0
#define FRAGMENT		1
#define LAST_FRAGMENT		2

/*
 * Link management protocol message types
 */
#define STATE_MSG		0
#define RESET_MSG		1
#define ACTIVATE_MSG		2

/*
 * Changeover tunnel message types
 */
519 520
#define SYNCH_MSG		0
#define FAILOVER_MSG		1
521 522 523 524 525 526 527

/*
 * Config protocol message types
 */
#define DSC_REQ_MSG		0
#define DSC_RESP_MSG		1

528
/*
P
Per Liden 已提交
529 530 531 532
 * Word 1
 */
static inline u32 msg_seq_gap(struct tipc_msg *m)
{
533
	return msg_bits(m, 1, 16, 0x1fff);
P
Per Liden 已提交
534 535 536 537
}

static inline void msg_set_seq_gap(struct tipc_msg *m, u32 n)
{
538
	msg_set_bits(m, 1, 16, 0x1fff, n);
P
Per Liden 已提交
539 540
}

541 542 543 544 545 546 547 548 549 550
static inline u32 msg_node_sig(struct tipc_msg *m)
{
	return msg_bits(m, 1, 0, 0xffff);
}

static inline void msg_set_node_sig(struct tipc_msg *m, u32 n)
{
	msg_set_bits(m, 1, 0, 0xffff, n);
}

551 552 553 554 555 556 557 558 559 560
static inline u32 msg_node_capabilities(struct tipc_msg *m)
{
	return msg_bits(m, 1, 15, 0x1fff);
}

static inline void msg_set_node_capabilities(struct tipc_msg *m, u32 n)
{
	msg_set_bits(m, 1, 15, 0x1fff, n);
}

561
/*
P
Per Liden 已提交
562 563 564 565 566 567 568
 * Word 2
 */
static inline u32 msg_dest_domain(struct tipc_msg *m)
{
	return msg_word(m, 2);
}

569
static inline void msg_set_dest_domain(struct tipc_msg *m, u32 n)
P
Per Liden 已提交
570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588
{
	msg_set_word(m, 2, n);
}

static inline u32 msg_bcgap_after(struct tipc_msg *m)
{
	return msg_bits(m, 2, 16, 0xffff);
}

static inline void msg_set_bcgap_after(struct tipc_msg *m, u32 n)
{
	msg_set_bits(m, 2, 16, 0xffff, n);
}

static inline u32 msg_bcgap_to(struct tipc_msg *m)
{
	return msg_bits(m, 2, 0, 0xffff);
}

589
static inline void msg_set_bcgap_to(struct tipc_msg *m, u32 n)
P
Per Liden 已提交
590 591 592 593 594
{
	msg_set_bits(m, 2, 0, 0xffff, n);
}


595
/*
P
Per Liden 已提交
596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613
 * Word 4
 */
static inline u32 msg_last_bcast(struct tipc_msg *m)
{
	return msg_bits(m, 4, 16, 0xffff);
}

static inline void msg_set_last_bcast(struct tipc_msg *m, u32 n)
{
	msg_set_bits(m, 4, 16, 0xffff, n);
}

static inline void msg_set_fragm_no(struct tipc_msg *m, u32 n)
{
	msg_set_bits(m, 4, 16, 0xffff, n);
}


614
static inline u16 msg_next_sent(struct tipc_msg *m)
P
Per Liden 已提交
615 616 617 618
{
	return msg_bits(m, 4, 0, 0xffff);
}

619
static inline void msg_set_next_sent(struct tipc_msg *m, u16 n)
P
Per Liden 已提交
620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645
{
	msg_set_bits(m, 4, 0, 0xffff, n);
}

static inline void msg_set_long_msgno(struct tipc_msg *m, u32 n)
{
	msg_set_bits(m, 4, 0, 0xffff, n);
}

static inline u32 msg_bc_netid(struct tipc_msg *m)
{
	return msg_word(m, 4);
}

static inline void msg_set_bc_netid(struct tipc_msg *m, u32 id)
{
	msg_set_word(m, 4, id);
}

static inline u32 msg_link_selector(struct tipc_msg *m)
{
	return msg_bits(m, 4, 0, 1);
}

static inline void msg_set_link_selector(struct tipc_msg *m, u32 n)
{
646
	msg_set_bits(m, 4, 0, 1, n);
P
Per Liden 已提交
647 648
}

649
/*
P
Per Liden 已提交
650 651
 * Word 5
 */
652
static inline u16 msg_session(struct tipc_msg *m)
P
Per Liden 已提交
653 654 655 656
{
	return msg_bits(m, 5, 16, 0xffff);
}

657
static inline void msg_set_session(struct tipc_msg *m, u16 n)
P
Per Liden 已提交
658 659 660 661 662 663 664 665 666 667 668
{
	msg_set_bits(m, 5, 16, 0xffff, n);
}

static inline u32 msg_probe(struct tipc_msg *m)
{
	return msg_bits(m, 5, 0, 1);
}

static inline void msg_set_probe(struct tipc_msg *m, u32 val)
{
669
	msg_set_bits(m, 5, 0, 1, val);
P
Per Liden 已提交
670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706
}

static inline char msg_net_plane(struct tipc_msg *m)
{
	return msg_bits(m, 5, 1, 7) + 'A';
}

static inline void msg_set_net_plane(struct tipc_msg *m, char n)
{
	msg_set_bits(m, 5, 1, 7, (n - 'A'));
}

static inline u32 msg_linkprio(struct tipc_msg *m)
{
	return msg_bits(m, 5, 4, 0x1f);
}

static inline void msg_set_linkprio(struct tipc_msg *m, u32 n)
{
	msg_set_bits(m, 5, 4, 0x1f, n);
}

static inline u32 msg_bearer_id(struct tipc_msg *m)
{
	return msg_bits(m, 5, 9, 0x7);
}

static inline void msg_set_bearer_id(struct tipc_msg *m, u32 n)
{
	msg_set_bits(m, 5, 9, 0x7, n);
}

static inline u32 msg_redundant_link(struct tipc_msg *m)
{
	return msg_bits(m, 5, 12, 0x1);
}

707
static inline void msg_set_redundant_link(struct tipc_msg *m, u32 r)
P
Per Liden 已提交
708
{
709
	msg_set_bits(m, 5, 12, 0x1, r);
P
Per Liden 已提交
710 711
}

712 713
static inline char *msg_media_addr(struct tipc_msg *m)
{
714
	return (char *)&m->hdr[TIPC_MEDIA_INFO_OFFSET];
715
}
P
Per Liden 已提交
716

717
/*
P
Per Liden 已提交
718 719
 * Word 9
 */
720
static inline u16 msg_msgcnt(struct tipc_msg *m)
P
Per Liden 已提交
721 722 723 724
{
	return msg_bits(m, 9, 16, 0xffff);
}

725
static inline void msg_set_msgcnt(struct tipc_msg *m, u16 n)
P
Per Liden 已提交
726 727 728 729 730 731 732 733 734 735 736 737 738 739
{
	msg_set_bits(m, 9, 16, 0xffff, n);
}

static inline u32 msg_bcast_tag(struct tipc_msg *m)
{
	return msg_bits(m, 9, 16, 0xffff);
}

static inline void msg_set_bcast_tag(struct tipc_msg *m, u32 n)
{
	msg_set_bits(m, 9, 16, 0xffff, n);
}

740
static inline u32 msg_max_pkt(struct tipc_msg *m)
P
Per Liden 已提交
741
{
E
Eric Dumazet 已提交
742
	return msg_bits(m, 9, 16, 0xffff) * 4;
P
Per Liden 已提交
743 744
}

745
static inline void msg_set_max_pkt(struct tipc_msg *m, u32 n)
P
Per Liden 已提交
746 747 748 749 750 751 752 753 754 755 756 757 758 759
{
	msg_set_bits(m, 9, 16, 0xffff, (n / 4));
}

static inline u32 msg_link_tolerance(struct tipc_msg *m)
{
	return msg_bits(m, 9, 0, 0xffff);
}

static inline void msg_set_link_tolerance(struct tipc_msg *m, u32 n)
{
	msg_set_bits(m, 9, 0, 0xffff, n);
}

760
static inline bool msg_peer_link_is_up(struct tipc_msg *m)
761
{
762
	if (likely(msg_user(m) != LINK_PROTOCOL))
763
		return true;
764 765 766
	if (msg_type(m) == STATE_MSG)
		return true;
	return false;
767 768
}

769
static inline bool msg_peer_node_is_up(struct tipc_msg *m)
770
{
771 772
	if (msg_peer_link_is_up(m))
		return true;
773 774 775
	return msg_redundant_link(m);
}

Y
Ying Xue 已提交
776
struct sk_buff *tipc_buf_acquire(u32 size);
777
bool tipc_msg_validate(struct sk_buff *skb);
778
bool tipc_msg_reverse(u32 own_addr, struct sk_buff **skb, int err);
779
void tipc_msg_init(u32 own_addr, struct tipc_msg *m, u32 user, u32 type,
780
		   u32 hsize, u32 destnode);
781 782 783
struct sk_buff *tipc_msg_create(uint user, uint type, uint hdr_sz,
				uint data_sz, u32 dnode, u32 onode,
				u32 dport, u32 oport, int errcode);
784
int tipc_buf_append(struct sk_buff **headbuf, struct sk_buff **buf);
785 786 787
bool tipc_msg_bundle(struct sk_buff *skb, struct tipc_msg *msg, u32 mtu);
bool tipc_msg_make_bundle(struct sk_buff **skb, struct tipc_msg *msg,
			  u32 mtu, u32 dnode);
788
bool tipc_msg_extract(struct sk_buff *skb, struct sk_buff **iskb, int *pos);
789
int tipc_msg_build(struct tipc_msg *mhdr, struct msghdr *m,
790
		   int offset, int dsz, int mtu, struct sk_buff_head *list);
791
bool tipc_msg_lookup_dest(struct net *net, struct sk_buff *skb, int *err);
792
struct sk_buff *tipc_msg_reassemble(struct sk_buff_head *list);
793

794 795 796 797 798
static inline u16 buf_seqno(struct sk_buff *skb)
{
	return msg_seqno(buf_msg(skb));
}

799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815
/* tipc_skb_peek(): peek and reserve first buffer in list
 * @list: list to be peeked in
 * Returns pointer to first buffer in list, if any
 */
static inline struct sk_buff *tipc_skb_peek(struct sk_buff_head *list,
					    spinlock_t *lock)
{
	struct sk_buff *skb;

	spin_lock_bh(lock);
	skb = skb_peek(list);
	if (skb)
		skb_get(skb);
	spin_unlock_bh(lock);
	return skb;
}

816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864
/* tipc_skb_peek_port(): find a destination port, ignoring all destinations
 *                       up to and including 'filter'.
 * Note: ignoring previously tried destinations minimizes the risk of
 *       contention on the socket lock
 * @list: list to be peeked in
 * @filter: last destination to be ignored from search
 * Returns a destination port number, of applicable.
 */
static inline u32 tipc_skb_peek_port(struct sk_buff_head *list, u32 filter)
{
	struct sk_buff *skb;
	u32 dport = 0;
	bool ignore = true;

	spin_lock_bh(&list->lock);
	skb_queue_walk(list, skb) {
		dport = msg_destport(buf_msg(skb));
		if (!filter || skb_queue_is_last(list, skb))
			break;
		if (dport == filter)
			ignore = false;
		else if (!ignore)
			break;
	}
	spin_unlock_bh(&list->lock);
	return dport;
}

/* tipc_skb_dequeue(): unlink first buffer with dest 'dport' from list
 * @list: list to be unlinked from
 * @dport: selection criteria for buffer to unlink
 */
static inline struct sk_buff *tipc_skb_dequeue(struct sk_buff_head *list,
					       u32 dport)
{
	struct sk_buff *_skb, *tmp, *skb = NULL;

	spin_lock_bh(&list->lock);
	skb_queue_walk_safe(list, _skb, tmp) {
		if (msg_destport(buf_msg(_skb)) == dport) {
			__skb_unlink(_skb, list);
			skb = _skb;
			break;
		}
	}
	spin_unlock_bh(&list->lock);
	return skb;
}

865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896
/* tipc_skb_queue_sorted(); sort pkt into list according to sequence number
 * @list: list to be appended to
 * @skb: buffer to add
 * Returns true if queue should treated further, otherwise false
 */
static inline bool __tipc_skb_queue_sorted(struct sk_buff_head *list,
					   struct sk_buff *skb)
{
	struct sk_buff *_skb, *tmp;
	struct tipc_msg *hdr = buf_msg(skb);
	u16 seqno = msg_seqno(hdr);

	if (skb_queue_empty(list) || (msg_user(hdr) == LINK_PROTOCOL)) {
		__skb_queue_head(list, skb);
		return true;
	}
	if (likely(less(seqno, buf_seqno(skb_peek(list))))) {
		__skb_queue_head(list, skb);
		return true;
	}
	if (!more(seqno, buf_seqno(skb_peek_tail(list)))) {
		skb_queue_walk_safe(list, _skb, tmp) {
			if (likely(less(seqno, buf_seqno(_skb)))) {
				__skb_queue_before(list, _skb, skb);
				return true;
			}
		}
	}
	__skb_queue_tail(list, skb);
	return false;
}

897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925
/* tipc_skb_queue_splice_tail - append an skb list to lock protected list
 * @list: the new list to append. Not lock protected
 * @head: target list. Lock protected.
 */
static inline void tipc_skb_queue_splice_tail(struct sk_buff_head *list,
					      struct sk_buff_head *head)
{
	spin_lock_bh(&head->lock);
	skb_queue_splice_tail(list, head);
	spin_unlock_bh(&head->lock);
}

/* tipc_skb_queue_splice_tail_init - merge two lock protected skb lists
 * @list: the new list to add. Lock protected. Will be reinitialized
 * @head: target list. Lock protected.
 */
static inline void tipc_skb_queue_splice_tail_init(struct sk_buff_head *list,
						   struct sk_buff_head *head)
{
	struct sk_buff_head tmp;

	__skb_queue_head_init(&tmp);

	spin_lock_bh(&list->lock);
	skb_queue_splice_tail_init(list, &tmp);
	spin_unlock_bh(&list->lock);
	tipc_skb_queue_splice_tail(&tmp, head);
}

P
Per Liden 已提交
926
#endif