litmus-rt.git - The LITMUS^RT kernel.

diff options

Diffstat (limited to 'include/linux/sunrpc/xprt.h')

-rw-r--r--

1 files changed, 2 insertions, 0 deletions

         void            (*connect)(struct rpc_task *task);
         int             (*send_request)(struct rpc_task *task);
         void            (*set_retrans_timeout)(struct rpc_task *task);
+        void            (*timer)(struct rpc_task *task);
         void            (*close)(struct rpc_xprt *xprt);
         void            (*destroy)(struct rpc_xprt *xprt);
 };
 void                    xprt_wake_pending_tasks(struct rpc_xprt *xprt, int status);
 void                    xprt_wait_for_buffer_space(struct rpc_task *task);
 void                    xprt_write_space(struct rpc_xprt *xprt);
+void                    xprt_adjust_cwnd(struct rpc_task *task, int result);
 struct rpc_rqst *       xprt_lookup_rqst(struct rpc_xprt *xprt, u32 xid);
 void                    xprt_complete_rqst(struct rpc_xprt *xprt, struct rpc_rqst *req, int copied);
 void                    xprt_disconnect(struct rpc_xprt *xprt);

362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512

548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 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 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 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 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801

/* * lib/btree.c - Simple In-memory B+Tree * * As should be obvious for Linux kernel code, license is GPLv2 * * Copyright (c) 2007-2008 Joern Engel <joern@logfs.org> * Bits and pieces stolen from Peter Zijlstra's code, which is * Copyright 2007, Red Hat Inc. Peter Zijlstra * GPLv2 * * see http://programming.kicks-ass.net/kernel-patches/vma_lookup/btree.patch * * A relatively simple B+Tree implementation. I have written it as a learning * exercise to understand how B+Trees work. Turned out to be useful as well. * * B+Trees can be used similar to Linux radix trees (which don't have anything * in common with textbook radix trees, beware). Prerequisite for them working * well is that access to a random tree node is much faster than a large number * of operations within each node. * * Disks have fulfilled the prerequisite for a long time. More recently DRAM * has gained similar properties, as memory access times, when measured in cpu * cycles, have increased. Cacheline sizes have increased as well, which also * helps B+Trees. * * Compared to radix trees, B+Trees are more efficient when dealing with a * sparsely populated address space. Between 25% and 50% of the memory is * occupied with valid pointers. When densely populated, radix trees contain * ~98% pointers - hard to beat. Very sparse radix trees contain only ~2% * pointers. * * This particular implementation stores pointers identified by a long value. * Storing NULL pointers is illegal, lookup will return NULL when no entry * was found. * * A tricks was used that is not commonly found in textbooks. The lowest * values are to the right, not to the left. All used slots within a node * are on the left, all unused slots contain NUL values. Most operations * simply loop once over all slots and terminate on the first NUL. */ #include <linux/btree.h> #include <linux/cache.h> #include <linux/kernel.h> #include <linux/slab.h> #include <linux/module.h> #define MAX(a, b) ((a) > (b) ? (a) : (b)) #define NODESIZE MAX(L1_CACHE_BYTES, 128) struct btree_geo { int keylen; int no_pairs; int no_longs; }; struct btree_geo btree_geo32 = { .keylen = 1, .no_pairs = NODESIZE / sizeof(long) / 2, .no_longs = NODESIZE / sizeof(long) / 2, }; EXPORT_SYMBOL_GPL(btree_geo32); #define LONG_PER_U64 (64 / BITS_PER_LONG) struct btree_geo btree_geo64 = { .keylen = LONG_PER_U64, .no_pairs = NODESIZE / sizeof(long) / (1 + LONG_PER_U64), .no_longs = LONG_PER_U64 * (NODESIZE / sizeof(long) / (1 + LONG_PER_U64)), }; EXPORT_SYMBOL_GPL(btree_geo64); struct btree_geo btree_geo128 = { .keylen = 2 * LONG_PER_U64, .no_pairs = NODESIZE / sizeof(long) / (1 + 2 * LONG_PER_U64), .no_longs = 2 * LONG_PER_U64 * (NODESIZE / sizeof(long) / (1 + 2 * LONG_PER_U64)), }; EXPORT_SYMBOL_GPL(btree_geo128); static struct kmem_cache *btree_cachep; void *btree_alloc(gfp_t gfp_mask, void *pool_data) { return kmem_cache_alloc(btree_cachep, gfp_mask); } EXPORT_SYMBOL_GPL(btree_alloc); void btree_free(void *element, void *pool_data) { kmem_cache_free(btree_cachep, element); } EXPORT_SYMBOL_GPL(btree_free); static unsigned long *btree_node_alloc(struct btree_head *head, gfp_t gfp) { unsigned long *node; node = mempool_alloc(head->mempool, gfp); if (likely(node)) memset(node, 0, NODESIZE); return node; } static int longcmp(const unsigned long *l1, const unsigned long *l2, size_t n) { size_t i; for (i = 0; i < n; i++) { if (l1[i] < l2[i]) return -1; if (l1[i] > l2[i]) return 1; } return 0; } static unsigned long *longcpy(unsigned long *dest, const unsigned long *src, size_t n) { size_t i; for (i = 0; i < n; i++) dest[i] = src[i]; return dest; } static unsigned long *longset(unsigned long *s, unsigned long c, size_t n) { size_t i; for (i = 0; i < n; i++) s[i] = c; return s; } static void dec_key(struct btree_geo *geo, unsigned long *key) { unsigned long val; int i; for (i = geo->keylen - 1; i >= 0; i--) { val = key[i]; key[i] = val - 1; if (val) break; } } static unsigned long *bkey(struct btree_geo *geo, unsigned long *node, int n) { return &node[n * geo->keylen]; } static void *bval(struct btree_geo *geo, unsigned long *node, int n) { return (void *)node[geo->no_longs + n]; } static void setkey(struct btree_geo *geo, unsigned long *node, int n, unsigned long *key) { longcpy(bkey(geo, node, n), key, geo->keylen); } static void setval(struct btree_geo *geo, unsigned long *node, int n, void *val) { node[geo->no_longs + n] = (unsigned long) val; } static void clearpair(struct btree_geo *geo, unsigned long *node, int n) {


context:
space:
mode: