├── LICENSE ├── README.md ├── _screenshots └── ss-by-op.png ├── main.go ├── nfs ├── event.go ├── nfs.go ├── nfs3.go ├── nfs4.go ├── nfs_status.go ├── rpc.go ├── stream.go ├── xdr.go └── xdr_test.go ├── sniffer └── sniffer.go └── utils ├── aggr.go ├── hexdump.go └── term.go /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | {project} Copyright (C) {year} {fullname} 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | NFS-top 2 | ======= 3 | 4 | Top like utility to show nfs traffic utilization 5 | 6 | 7 | ![alt screenshot](_screenshots/ss-by-op.png) 8 | 9 | HowTo build 10 | ----------- 11 | 12 | Pull the dependencies 13 | ``` 14 | $ go get -u github.com/gizak/termui 15 | $ go get -u github.com/tsg/gopacket 16 | $ go get -u github.com/patrickmn/go-cache 17 | $ go get -u github.com/kofemann/linux_ftrace 18 | ``` 19 | 20 | And build: 21 | ``` 22 | $ go build 23 | ``` 24 | 25 | Done! 26 | 27 | 28 | How to contribute 29 | ================= 30 | 31 | 32 | **nfstop** uses the linux kernel model of using git not only a source 33 | repository, but also as a way to track contributions and copyrights. 34 | 35 | Each submitted patch must have a "Signed-off-by" line. Patches without 36 | this line will not be accepted. 37 | 38 | The sign-off is a simple line at the end of the explanation for the 39 | patch, which certifies that you wrote it or otherwise have the right to 40 | pass it on as an open-source patch. The rules are pretty simple: if you 41 | can certify the below: 42 | ``` 43 | 44 | Developer's Certificate of Origin 1.1 45 | 46 | By making a contribution to this project, I certify that: 47 | 48 | (a) The contribution was created in whole or in part by me and I 49 | have the right to submit it under the open source license 50 | indicated in the file; or 51 | 52 | (b) The contribution is based upon previous work that, to the best 53 | of my knowledge, is covered under an appropriate open source 54 | license and I have the right under that license to submit that 55 | work with modifications, whether created in whole or in part 56 | by me, under the same open source license (unless I am 57 | permitted to submit under a different license), as indicated 58 | in the file; or 59 | 60 | (c) The contribution was provided directly to me by some other 61 | person who certified (a), (b) or (c) and I have not modified 62 | it. 63 | 64 | (d) I understand and agree that this project and the contribution 65 | are public and that a record of the contribution (including all 66 | personal information I submit with it, including my sign-off) is 67 | maintained indefinitely and may be redistributed consistent with 68 | this project or the open source license(s) involved. 69 | 70 | ``` 71 | then you just add a line saying (with **git commit -s**) 72 | 73 | Signed-off-by: Random J Developer 74 | 75 | using your real name (sorry, no pseudonyms or anonymous contributions.) 76 | -------------------------------------------------------------------------------- /_screenshots/ss-by-op.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kofemann/nfstop/76c996e7a6fdd6c3cbebe2ad21a455cfeee08077/_screenshots/ss-by-op.png -------------------------------------------------------------------------------- /main.go: -------------------------------------------------------------------------------- 1 | package main 2 | 3 | import ( 4 | "container/list" 5 | "flag" 6 | "fmt" 7 | "os" 8 | "runtime" 9 | "strconv" 10 | "time" 11 | 12 | ui "github.com/gizak/termui" 13 | "github.com/kofemann/nfstop/nfs" 14 | "github.com/kofemann/nfstop/sniffer" 15 | "github.com/kofemann/nfstop/utils" 16 | "github.com/tsg/gopacket/layers" 17 | "github.com/tsg/gopacket/pcap" 18 | ) 19 | 20 | const ( 21 | // ANY_DEVICE peseudo interface to listen all interfaces 22 | ANY_DEVICE = "any" 23 | 24 | // NFS_FILTER default packet fiter to capture nfs traffic 25 | NFS_FILTER = "port 2049" 26 | 27 | // SNAPLEN packet snapshot length 28 | SNAPLEN = 65535 29 | 30 | REFRESH_TIME = 2 31 | ) 32 | 33 | var streams = make(map[string]*nfs.RpcStream) 34 | 35 | var iface = flag.String("i", ANY_DEVICE, "name of `interface` to listen") 36 | var filter = flag.String("f", NFS_FILTER, "capture `filter` in libpcap filter syntax") 37 | var listInterfaces = flag.Bool("D", false, "print list of interfaces and exit") 38 | var snaplen = flag.Int("s", SNAPLEN, "packet `snaplen` - snapshot length") 39 | var trackPid = flag.Bool("P", false, "Try to match requests to local PIDs") 40 | 41 | func main() { 42 | 43 | flag.Parse() 44 | 45 | if *listInterfaces { 46 | ifaces, err := pcap.FindAllDevs() 47 | if err != nil { 48 | fmt.Fprintf(os.Stderr, "Failed to get list of interfaces: %v\n", err) 49 | os.Exit(1) 50 | } 51 | 52 | for i, dev := range ifaces { 53 | fmt.Printf("%d. %s\n", i+1, dev.Name) 54 | } 55 | os.Exit(0) 56 | } 57 | 58 | sniffer := &sniffer.Sniffer{ 59 | Interface: *iface, 60 | Filter: *filter, 61 | Snaplen: *snaplen, 62 | } 63 | 64 | packets, err := sniffer.Start() 65 | if err != nil { 66 | fmt.Fprintf(os.Stderr, "Failed to initialize sniffer: %v\n", err) 67 | os.Exit(1) 68 | } 69 | 70 | refreshValue := REFRESH_TIME 71 | if len(flag.Args()) > 0 { 72 | 73 | refreshValue, err = strconv.Atoi(flag.Arg(0)) 74 | if err != nil { 75 | fmt.Fprintf(os.Stderr, "Invalid time value: %v\n", err) 76 | os.Exit(1) 77 | } 78 | } 79 | 80 | refreshTime := time.Second * time.Duration(refreshValue) 81 | ticker := time.Tick(refreshTime) 82 | 83 | collector := list.New() 84 | 85 | quit := make(chan int) 86 | 87 | // request selection 88 | 89 | ByClient := func(r *nfs.NfsRequest) string { 90 | return r.GetClient() 91 | } 92 | 93 | ByServer := func(r *nfs.NfsRequest) string { 94 | return r.GetServer() 95 | } 96 | 97 | ByOpCode := func(r *nfs.NfsRequest) string { 98 | return r.GetOpCode() 99 | } 100 | 101 | ByUser := func(r *nfs.NfsRequest) string { 102 | return r.GetCred() 103 | } 104 | 105 | aggrName := "Client Endpoint" 106 | selection := ByClient 107 | 108 | // UI 109 | err = ui.Init() 110 | if err != nil { 111 | panic(err) 112 | } 113 | defer ui.Close() 114 | 115 | title := ui.NewPar("q: Quit, c/s: by clients/servers, o: by nfs ops, u: by user") 116 | title.BorderFg = ui.ColorDefault 117 | title.TextFgColor = ui.ColorDefault 118 | title.Height = 3 119 | 120 | status := ui.NewPar(fmt.Sprintf("Aggregate every %v by: %s", refreshTime, aggrName)) 121 | status.BorderFg = ui.ColorDefault 122 | status.TextFgColor = ui.ColorDefault 123 | status.Height = 3 124 | 125 | lSize := ui.TermHeight() - (status.Height + title.Height) 126 | 127 | labelList := ui.NewList() 128 | labelList.Border = false 129 | labelList.Height = lSize 130 | labelList.ItemFgColor = ui.ColorDefault 131 | 132 | histogramList := ui.NewList() 133 | histogramList.Border = false 134 | histogramList.Height = lSize 135 | histogramList.ItemFgColor = ui.ColorDefault 136 | 137 | valuesList := ui.NewList() 138 | valuesList.Border = false 139 | valuesList.Height = lSize 140 | valuesList.ItemFgColor = ui.ColorDefault 141 | 142 | ui.Body.Rows = make([]*ui.Row, 0) 143 | ui.Body.AddRows( 144 | ui.NewRow( 145 | ui.NewCol(12, 0, title), 146 | ), 147 | 148 | ui.NewRow( 149 | ui.NewCol(4, 0, labelList), 150 | ui.NewCol(6, 0, histogramList), 151 | ui.NewCol(2, 0, valuesList), 152 | ), 153 | ui.NewRow( 154 | ui.NewCol(12, 0, status), 155 | ), 156 | ) 157 | 158 | if *trackPid && runtime.GOOS == "linux" { 159 | nfs.EnablePidTracing() 160 | } 161 | defer nfs.DisablePidTracing() 162 | 163 | go func() { 164 | 165 | for { 166 | select { 167 | case <-quit: 168 | return 169 | case <-ticker: 170 | // time to refresh screen 171 | l := collector 172 | collector = list.New() 173 | 174 | term := utils.Aggr(l, selection) 175 | sum := term.Sum() 176 | 177 | labels := make([]string, l.Len()) 178 | histograms := make([]string, l.Len()) 179 | values := make([]string, l.Len()) 180 | size := (ui.TermWidth() / 12) * 6 181 | 182 | status.Text = fmt.Sprintf("Aggregate every %v by: %s", refreshTime, aggrName) 183 | 184 | for i, e := range term.Elements { 185 | labels[i] = fmt.Sprintf("%s", e.Key) 186 | histograms[i] = utils.FillHisto(sum, e.Value, size) 187 | values[i] = fmt.Sprintf("%8d", e.Value) 188 | } 189 | 190 | labelList.Items = labels 191 | histogramList.Items = histograms 192 | valuesList.Items = values 193 | ui.Body.Align() 194 | ui.Render(ui.Body) 195 | 196 | case packet := <-packets: 197 | // A nil packet indicates the end of a pcap file. 198 | if packet == nil { 199 | os.Exit(0) 200 | } 201 | 202 | if packet.NetworkLayer() == nil || packet.TransportLayer() == nil || 203 | packet.TransportLayer().LayerType() != layers.LayerTypeTCP { 204 | 205 | continue 206 | } 207 | 208 | // direction independed unique connection identifier 209 | tcp := packet.TransportLayer().(*layers.TCP) 210 | connectionKey := fmt.Sprintf("%d:%d", 211 | packet.NetworkLayer().NetworkFlow().FastHash(), 212 | tcp.TransportFlow().FastHash(), 213 | ) 214 | 215 | rpcStream, ok := streams[connectionKey] 216 | if !ok { 217 | rpcStream = nfs.NewRpcStream(tcp) 218 | streams[connectionKey] = rpcStream 219 | } 220 | 221 | collector.PushBackList(rpcStream.PacketArrieved(packet)) 222 | } 223 | } 224 | }() 225 | 226 | ui.Handle("/sys/kbd/s", func(ui.Event) { 227 | selection = ByServer 228 | aggrName = "Server Endpoint" 229 | }) 230 | 231 | ui.Handle("/sys/kbd/o", func(ui.Event) { 232 | selection = ByOpCode 233 | aggrName = "NFS operation" 234 | }) 235 | 236 | ui.Handle("/sys/kbd/c", func(ui.Event) { 237 | selection = ByClient 238 | aggrName = "Client Endpoint" 239 | }) 240 | 241 | ui.Handle("/sys/kbd/u", func(ui.Event) { 242 | selection = ByUser 243 | aggrName = "User Credential" 244 | }) 245 | 246 | ui.Handle("/sys/kbd/q", func(ui.Event) { 247 | ui.StopLoop() 248 | quit <- 1 249 | }) 250 | 251 | ui.Handle("/sys/wnd/resize", func(e ui.Event) { 252 | lSize = ui.TermHeight() - (status.Height + title.Height) 253 | labelList.Height = lSize 254 | histogramList.Height = lSize 255 | valuesList.Height = lSize 256 | 257 | ui.Body.Width = ui.TermWidth() 258 | ui.Body.Align() 259 | ui.Clear() 260 | ui.Render(ui.Body) 261 | }) 262 | 263 | ui.Body.Align() 264 | ui.Render(ui.Body) 265 | 266 | ui.Loop() 267 | } 268 | -------------------------------------------------------------------------------- /nfs/event.go: -------------------------------------------------------------------------------- 1 | package nfs 2 | 3 | import ( 4 | "fmt" 5 | "time" 6 | ) 7 | 8 | type StreamEvent struct { 9 | Timestamp time.Time 10 | Src string 11 | Dst string 12 | SrcPort string 13 | DstPort string 14 | Stream *RpcStream 15 | } 16 | 17 | func (e *StreamEvent) String() string { 18 | return fmt.Sprintf("%v %s:%s -> %s:%s", 19 | e.Timestamp, 20 | e.Src, 21 | e.SrcPort, 22 | e.Dst, 23 | e.DstPort, 24 | ) 25 | } 26 | -------------------------------------------------------------------------------- /nfs/nfs.go: -------------------------------------------------------------------------------- 1 | package nfs 2 | 3 | import ( 4 | "fmt" 5 | "time" 6 | ) 7 | 8 | type NfsRequest struct { 9 | vers uint32 10 | minor uint32 11 | proc uint32 12 | tag string 13 | opcode string 14 | auth string 15 | rtime time.Time 16 | ctime time.Time 17 | client string 18 | server string 19 | pid int 20 | xid string 21 | } 22 | 23 | func (nfs *NfsRequest) GetOpCode() string { 24 | return nfs.opcode 25 | } 26 | 27 | func (nfs *NfsRequest) GetVersion() string { 28 | return fmt.Sprintf("%d.%d", nfs.vers, nfs.minor) 29 | } 30 | 31 | func (nfs *NfsRequest) GetResponseTime() time.Duration { 32 | return nfs.rtime.Sub(nfs.ctime) 33 | } 34 | 35 | func (nfs *NfsRequest) GetClient() string { 36 | return nfs.client 37 | } 38 | 39 | func (nfs *NfsRequest) GetServer() string { 40 | return nfs.server 41 | } 42 | 43 | func (nfs *NfsRequest) GetCred() string { 44 | if nfs.pid != -1 { 45 | return fmt.Sprintf("%s (%d)", nfs.auth, nfs.pid) 46 | } 47 | return nfs.auth 48 | } 49 | 50 | func (nfs *NfsRequest) getRequestInfo(xdr *xdr) { 51 | 52 | switch nfs.vers { 53 | case 3: 54 | nfs.opcode = nfs.getV3Opcode(int(nfs.proc)) 55 | case 4: 56 | switch nfs.proc { 57 | case 0: 58 | nfs.opcode = "NULL" 59 | case 1: 60 | nfs.tag = string(xdr.getDynamicOpaque()) 61 | nfs.minor = xdr.getUInt() 62 | nfs.opcode = nfs.findV4MainOpcode(xdr) 63 | } 64 | } 65 | } 66 | 67 | func (nfs *NfsRequest) getNFSReplyStatus(xdr *xdr) string { 68 | switch nfs.proc { 69 | case 0: 70 | return nfsStatus[0] 71 | default: 72 | stat := int(xdr.getUInt()) 73 | return nfsStatus[stat] 74 | } 75 | } 76 | 77 | func (nfs *NfsRequest) String() string { 78 | return fmt.Sprintf("%s -> %s %s %s v%d.%d op: %s, srt: %v", 79 | nfs.client, nfs.server, nfs.xid, 80 | nfs.auth, 81 | nfs.vers, nfs.minor, nfs.opcode, 82 | nfs.rtime.Sub(nfs.ctime), 83 | ) 84 | } 85 | -------------------------------------------------------------------------------- /nfs/nfs3.go: -------------------------------------------------------------------------------- 1 | package nfs 2 | 3 | var nfsOpnum3 = [...]string{ 4 | "NULL", 5 | "GETATTR", 6 | "SETATTR", 7 | "LOOKUP", 8 | "ACCESS", 9 | "READLINK", 10 | "READ", 11 | "WRITE", 12 | "CREATE", 13 | "MKDIR", 14 | "SYM_LINK", 15 | "MKNODE", 16 | "REMOVE", 17 | "RMDIR", 18 | "RENAME", 19 | "LINK", 20 | "READDIR", 21 | "READDIRPLUS", 22 | "FSSTAT", 23 | "FSINFO", 24 | "PATHINFO", 25 | "COMMIT", 26 | } 27 | 28 | func (nfs *NfsRequest) getV3Opcode(proc int) string { 29 | if proc < len(nfsOpnum3) { 30 | return nfsOpnum3[proc] 31 | } 32 | return "ILLEGAL" 33 | } 34 | -------------------------------------------------------------------------------- /nfs/nfs4.go: -------------------------------------------------------------------------------- 1 | package nfs 2 | 3 | import "fmt" 4 | 5 | const ( 6 | opAccess = 3 7 | opClose = 4 8 | opCommit = 5 9 | opCreate = 6 10 | opDelegpurge = 7 11 | opDelegreturn = 8 12 | opGetattr = 9 13 | opGetfh = 10 14 | opLink = 11 15 | opLock = 12 16 | opLockt = 13 17 | opLocku = 14 18 | opLookup = 15 19 | opLookupp = 16 20 | opNverify = 17 21 | opOpen = 18 22 | opOpenattr = 19 23 | opOpenConfirm = 20 24 | opOpenDowngrade = 21 25 | opPutfh = 22 26 | opPutpubfh = 23 27 | opPutrootfh = 24 28 | opRead = 25 29 | opReaddir = 26 30 | opReadlink = 27 31 | opRemove = 28 32 | opRename = 29 33 | opRenew = 30 34 | opRestorefh = 31 35 | opSavefh = 32 36 | opSecinfo = 33 37 | opSetattr = 34 38 | opSetclientid = 35 39 | opSetclientidConfirm = 36 40 | opVerify = 37 41 | opWrite = 38 42 | opReleaseLockowner = 39 43 | opBackchannelCtl = 40 44 | opBindConnToSession = 41 45 | opExchangeID = 42 46 | opCreateSession = 43 47 | opDestroySession = 44 48 | opFreeStateid = 45 49 | opGetDirDelegation = 46 50 | opGetdeviceinfo = 47 51 | opGetdevicelist = 48 52 | opLayoutcommit = 49 53 | opLayoutget = 50 54 | opLayoutreturn = 51 55 | opSecinfoNoName = 52 56 | opSequence = 53 57 | opSetSsv = 54 58 | opTestStateid = 55 59 | opWantDelegation = 56 60 | opDestroyClientid = 57 61 | opReclaimComplete = 58 62 | opIllegal = 10044 63 | ) 64 | 65 | var nfsOpnum4 = map[int]string{ 66 | 3: "ACCESS", 67 | 4: "CLOSE", 68 | 5: "COMMIT", 69 | 6: "CREATE", 70 | 7: "DELEGPURGE", 71 | 8: "DELEGRETURN", 72 | 9: "GETATTR", 73 | 10: "GETFH", 74 | 11: "LINK", 75 | 12: "LOCK", 76 | 13: "LOCKT", 77 | 14: "LOCKU", 78 | 15: "LOOKUP", 79 | 16: "LOOKUPP", 80 | 17: "NVERIFY", 81 | 18: "OPEN", 82 | 19: "OPENATTR", 83 | 20: "OPEN_CONFIRM", 84 | 21: "OPEN_DOWNGRADE", 85 | 22: "PUTFH", 86 | 23: "PUTPUBFH", 87 | 24: "PUTROOTFH", 88 | 25: "READ", 89 | 26: "READDIR", 90 | 27: "READLINK", 91 | 28: "REMOVE", 92 | 29: "RENAME", 93 | 30: "RENEW", 94 | 31: "RESTOREFH", 95 | 32: "SAVEFH", 96 | 33: "SECINFO", 97 | 34: "SETATTR", 98 | 35: "SETCLIENTID", 99 | 36: "SETCLIENTID_CONFIRM", 100 | 37: "VERIFY", 101 | 38: "WRITE", 102 | 39: "RELEASE_LOCKOWNER", 103 | 40: "BACKCHANNEL_CTL", 104 | 41: "BIND_CONN_TO_SESSION", 105 | 42: "EXCHANGE_ID", 106 | 43: "CREATE_SESSION", 107 | 44: "DESTROY_SESSION", 108 | 45: "FREE_STATEID", 109 | 46: "GET_DIR_DELEGATION", 110 | 47: "GETDEVICEINFO", 111 | 48: "GETDEVICELIST", 112 | 49: "LAYOUTCOMMIT", 113 | 50: "LAYOUTGET", 114 | 51: "LAYOUTRETURN", 115 | 52: "SECINFO_NO_NAME", 116 | 53: "SEQUENCE", 117 | 54: "SET_SSV", 118 | 55: "TEST_STATEID", 119 | 56: "WANT_DELEGATION", 120 | 57: "DESTROY_CLIENTID", 121 | 58: "RECLAIM_COMPLETE", 122 | 10044: "ILLEGAL", 123 | } 124 | 125 | func (nfs *NfsRequest) eatData(op int, xdr *xdr) { 126 | 127 | switch op { 128 | case opGetattr: 129 | xdr.getUIntVector() 130 | case opGetfh: 131 | // nothing to eat 132 | case opLookup: 133 | xdr.getDynamicOpaque() 134 | case opLookupp: 135 | // nothing to eat 136 | case opNverify: 137 | xdr.getUIntVector() 138 | xdr.getDynamicOpaque() 139 | case opPutfh: 140 | xdr.getDynamicOpaque() 141 | case opPutpubfh: 142 | // nothing to eat 143 | case opPutrootfh: 144 | // nothing to eat 145 | case opReadlink: 146 | // nothing to eat 147 | case opRenew: 148 | xdr.getUHyper() 149 | case opRestorefh: 150 | // nothing to eat 151 | case opSavefh: 152 | // nothing to eat 153 | case opSecinfo: 154 | xdr.getDynamicOpaque() 155 | case opVerify: 156 | xdr.getUIntVector() 157 | xdr.getDynamicOpaque() 158 | case opSequence: 159 | xdr.getOpaque(16) 160 | xdr.getUInt() 161 | xdr.getUInt() 162 | xdr.getUInt() 163 | xdr.getUInt() 164 | 165 | } 166 | } 167 | 168 | // findV4MainOpcode finds the main operation in a compound call. If no main operation can be found, the last operation 169 | // in compound call is returned. 170 | // 171 | // Compound requests group multiple nfs operations into a single request. Nevertheless, all compound requests are 172 | // triggered by end-user activity, like 'ls', 'open', 'stat' and IO calls. Depending on which operations are combined 173 | // the main operation can be different. For example, in compound: 174 | // 175 | // PUTFH + READDIR + GETATTR 176 | // 177 | // READDIR is the main operation. while in 178 | // 179 | // PUTFH + GETATTR 180 | // 181 | // GETATTR is the main operation. 182 | func (nfs *NfsRequest) findV4MainOpcode(xdr *xdr) string { 183 | 184 | // did we find a main operation opcode? 185 | found := false 186 | 187 | // default op code 188 | currentOpname := "ILLEGAL" 189 | 190 | opcount := int(xdr.getUInt()) 191 | for i := 0; !found && i < opcount; i++ { 192 | op := int(xdr.getUInt()) 193 | opname, ok := nfsOpnum4[op] 194 | 195 | if !ok { 196 | return fmt.Sprintf("ILLEGAL (%d)", op) 197 | } 198 | currentOpname = opname 199 | 200 | switch op { 201 | // First class ops 202 | // 203 | // The first class ops usually the main operation in the compound. 204 | // NFS spec allowes to build compound opertion where multiple 205 | // first class ops are used, like OPEN->LOCK->WRITE->LOCKU->CLOSE, 206 | // but such construnction are not used in the practice. 207 | case 208 | opAccess, 209 | opBackchannelCtl, 210 | opBindConnToSession, 211 | opClose, 212 | opCommit, 213 | opCreate, 214 | opCreateSession, 215 | opDelegpurge, 216 | opDelegreturn, 217 | opDestroyClientid, 218 | opDestroySession, 219 | opExchangeID, 220 | opFreeStateid, 221 | opGetdeviceinfo, 222 | opGetdevicelist, 223 | opGetDirDelegation, 224 | opLayoutcommit, 225 | opLayoutget, 226 | opLayoutreturn, 227 | opLink, 228 | opLock, 229 | opLockt, 230 | opLocku, 231 | opOpen, 232 | opOpenattr, 233 | opOpenConfirm, 234 | opOpenDowngrade, 235 | opRead, 236 | opReaddir, 237 | opReadlink, 238 | opReclaimComplete, 239 | opReleaseLockowner, 240 | opRemove, 241 | opRename, 242 | opSecinfoNoName, 243 | opSetattr, 244 | opSetclientid, 245 | opSetclientidConfirm, 246 | opSetSsv, 247 | opTestStateid, 248 | opWantDelegation, 249 | opWrite: 250 | 251 | found = true 252 | default: 253 | nfs.eatData(op, xdr) 254 | } 255 | } 256 | return currentOpname 257 | } 258 | -------------------------------------------------------------------------------- /nfs/nfs_status.go: -------------------------------------------------------------------------------- 1 | package nfs 2 | 3 | var nfsStatus = map[int]string{ 4 | 0: "NFS_OK", 5 | 1: "NFSERR_PERM", 6 | 2: "NFSERR_NOENT", 7 | 5: "NFSERR_IO", 8 | 6: "NFSERR_NXIO", 9 | 13: "NFSERR_ACCESS", 10 | 17: "NFSERR_EXIST", 11 | 18: "NFSERR_XDEV", 12 | 19: "NFSERR_NODEV", 13 | 20: "NFSERR_NOTDIR", 14 | 21: "NFSERR_ISDIR", 15 | 22: "NFSERR_INVAL", 16 | 27: "NFSERR_FBIG", 17 | 28: "NFSERR_NOSPC", 18 | 30: "NFSERR_ROFS", 19 | 31: "NFSERR_MLINK", 20 | 63: "NFSERR_NAMETOOLONG", 21 | 66: "NFSERR_NOTEMPTY", 22 | 69: "NFSERR_DQUOT", 23 | 70: "NFSERR_STALE", 24 | 71: "NFSERR_REMOTE", 25 | 99: "NFSERR_WFLUSH", 26 | 10001: "NFSERR_BADHANDLE", 27 | 10002: "NFSERR_NOT_SYNC", 28 | 10003: "NFSERR_BAD_COOKIE", 29 | 10004: "NFSERR_NOTSUPP", 30 | 10005: "NFSERR_TOOSMALL", 31 | 10006: "NFSERR_SERVERFAULT", 32 | 10007: "NFSERR_BADTYPE", 33 | 10008: "NFSERR_DELAY", 34 | 10009: "NFSERR_SAME", 35 | 10010: "NFSERR_DENIED", 36 | 10011: "NFSERR_EXPIRED", 37 | 10012: "NFSERR_LOCKED", 38 | 10013: "NFSERR_GRACE", 39 | 10014: "NFSERR_FHEXPIRED", 40 | 10015: "NFSERR_SHARE_DENIED", 41 | 10016: "NFSERR_WRONGSEC", 42 | 10017: "NFSERR_CLID_INUSE", 43 | 10018: "NFSERR_RESOURCE", 44 | 10019: "NFSERR_MOVED", 45 | 10020: "NFSERR_NOFILEHANDLE", 46 | 10021: "NFSERR_MINOR_VERS_MISMATCH", 47 | 10022: "NFSERR_STALE_CLIENTID", 48 | 10023: "NFSERR_STALE_STATEID", 49 | 10024: "NFSERR_OLD_STATEID", 50 | 10025: "NFSERR_BAD_STATEID", 51 | 10026: "NFSERR_BAD_SEQID", 52 | 10027: "NFSERR_NOT_SAME", 53 | 10028: "NFSERR_LOCK_RANGE", 54 | 10029: "NFSERR_SYMLINK", 55 | 10030: "NFSERR_RESTOREFH", 56 | 10031: "NFSERR_LEASE_MOVED", 57 | 10032: "NFSERR_ATTRNOTSUPP", 58 | 10033: "NFSERR_NO_GRACE", 59 | 10034: "NFSERR_RECLAIM_BAD", 60 | 10035: "NFSERR_RECLAIM_CONFLICT", 61 | 10036: "NFSERR_BADXDR", 62 | 10037: "NFSERR_LOCKS_HELD", 63 | 10038: "NFSERR_OPENMODE", 64 | 10039: "NFSERR_BADOWNER", 65 | 10040: "NFSERR_BADCHAR", 66 | 10041: "NFSERR_BADNAME", 67 | 10042: "NFSERR_BAD_RANGE", 68 | 10043: "NFSERR_LOCK_NOTSUPP", 69 | 10044: "NFSERR_OP_ILLEGAL", 70 | 10045: "NFSERR_DEADLOCK", 71 | 10046: "NFSERR_FILE_OPEN", 72 | 10047: "NFSERR_ADMIN_REVOKED", 73 | 10048: "NFSERR_CB_PATH_DOWN", 74 | 10049: "NFSERR_BADIOMODE", 75 | 10050: "NFSERR_BADLAYOUT", 76 | 10051: "NFSERR_BAD_SESSION_DIGEST", 77 | 10052: "NFSERR_BADSESSION", 78 | 10053: "NFSERR_BADSLOT", 79 | 10054: "NFSERR_COMPLETE_ALREADY", 80 | 10055: "NFSERR_CONN_NOT_BOUND_TO_SESSION", 81 | 10056: "NFSERR_DELEG_ALREADY_WANTED", 82 | 10057: "NFSERR_BACK_CHAN_BUSY", 83 | 10058: "NFSERR_LAYOUTTRYLATER", 84 | 10059: "NFSERR_LAYOUTUNAVAILABLE", 85 | 10060: "NFSERR_NOMATCHING_LAYOUT", 86 | 10061: "NFSERR_RECALLCONFLICT", 87 | 10062: "NFSERR_UNKNOWN_LAYOUTTYPE", 88 | 10063: "NFSERR_SEQ_MISORDERED", 89 | 10064: "NFSERR_SEQUENCE_POS", 90 | 10065: "NFSERR_REQ_TOO_BIG", 91 | 10066: "NFSERR_REP_TOO_BIG", 92 | 10067: "NFSERR_REP_TOO_BIG_TO_CACHE", 93 | 10068: "NFSERR_RETRY_UNCACHED_REP", 94 | 10069: "NFSERR_UNSAFE_COMPOUND", 95 | 10070: "NFSERR_TOO_MANY_OPS", 96 | 10071: "NFSERR_OP_NOT_IN_SESSION", 97 | 10072: "NFSERR_HASH_ALG_UNSUPP", 98 | 10073: "NFSERR_CONN_BINDING_NOT_ENFORCED", 99 | 10074: "NFSERR_CLIENTID_BUSY", 100 | 10075: "NFSERR_PNFS_IO_HOLE", 101 | 10076: "NFSERR_SEQ_FALSE_RETRY", 102 | 10077: "NFSERR_BAD_HIGH_SLOT", 103 | 10078: "NFSERR_DEADSESSION", 104 | 10079: "NFSERR_ENCR_ALG_UNSUPP", 105 | 10080: "NFSERR_PNFS_NO_LAYOUT", 106 | 10081: "NFSERR_NOT_ONLY_OP", 107 | 10082: "NFSERR_WRONG_CRED", 108 | 10083: "NFSERR_WRONG_TYPE", 109 | 10084: "NFSERR_DIRDELEG_UNAVAIL", 110 | 10085: "NFSERR_REJECT_DELEG", 111 | 10086: "NFSERR_RETURNCONFLICT", 112 | } 113 | -------------------------------------------------------------------------------- /nfs/rpc.go: -------------------------------------------------------------------------------- 1 | package nfs 2 | 3 | import ( 4 | "fmt" 5 | ) 6 | 7 | const ( 8 | rpcLastFrag = 0x80000000 9 | rpcSizeMask = 0x7fffffff 10 | ) 11 | 12 | const ( 13 | rpcCall = 0 14 | rpcReply = 1 15 | ) 16 | 17 | const nfsProgramNumber = 100003 18 | 19 | func handleCall(xid string, xdr *xdr, event *StreamEvent) { 20 | 21 | // eat rpc version number 22 | xdr.getUInt() 23 | 24 | rpcProg := xdr.getUInt() 25 | if rpcProg != nfsProgramNumber { 26 | // not a NFS request 27 | return 28 | } 29 | 30 | nfsVers := xdr.getUInt() 31 | nfsProc := xdr.getUInt() 32 | 33 | authFlavor := xdr.getUInt() 34 | authOpaque := xdr.getDynamicOpaque() 35 | var auth string 36 | switch authFlavor { 37 | case 0: 38 | auth = "none" 39 | case 1: 40 | //auth = "unix" 41 | credXdr := makeXDR(authOpaque) 42 | // stamp 43 | credXdr.getUInt() 44 | // machine 45 | credXdr.getString() 46 | // uid 47 | uid := credXdr.getUInt() 48 | // gid 49 | credXdr.getUInt() 50 | // gids 51 | credXdr.getUIntVector() 52 | auth = fmt.Sprintf("%d", uid) 53 | case 6: 54 | auth = "rpcsec_gss" 55 | default: 56 | auth = fmt.Sprintf("unknown (%d)", authFlavor) 57 | } 58 | 59 | // eat auth verifier 60 | xdr.getUInt() 61 | xdr.getDynamicOpaque() 62 | 63 | r := &NfsRequest{ 64 | vers: nfsVers, 65 | proc: nfsProc, 66 | auth: auth, 67 | ctime: event.Timestamp, 68 | client: event.Src + ":" + event.SrcPort, 69 | server: event.Dst + ":" + event.DstPort, 70 | pid: -1, 71 | xid: xid, 72 | } 73 | 74 | r.getRequestInfo(xdr) 75 | 76 | event.Stream.PendingRequests.SetDefault(xid, r) 77 | } 78 | 79 | func handleReply(xid string, xdr *xdr, event *StreamEvent) *NfsRequest { 80 | 81 | var r *NfsRequest 82 | if x, ok := event.Stream.PendingRequests.Get(xid); ok { 83 | event.Stream.PendingRequests.Delete(xid) 84 | r = x.(*NfsRequest) 85 | r.rtime = event.Timestamp 86 | 87 | return r 88 | } 89 | return nil 90 | } 91 | 92 | func procesRpcMessage(xdr *xdr, event *StreamEvent) *NfsRequest { 93 | 94 | xid := fmt.Sprintf("%.8x", xdr.getUInt()) 95 | msgType := xdr.getUInt() 96 | switch msgType { 97 | case rpcCall: 98 | handleCall(xid, xdr, event) 99 | return nil 100 | case rpcReply: 101 | return handleReply(xid, xdr, event) 102 | default: 103 | // bad xdr 104 | return nil 105 | } 106 | } 107 | -------------------------------------------------------------------------------- /nfs/stream.go: -------------------------------------------------------------------------------- 1 | package nfs 2 | 3 | import ( 4 | "container/list" 5 | "encoding/binary" 6 | "strings" 7 | "time" 8 | 9 | ftrace "github.com/kofemann/linux_ftrace" 10 | "github.com/patrickmn/go-cache" 11 | "github.com/tsg/gopacket" 12 | "github.com/tsg/gopacket/layers" 13 | ) 14 | 15 | type Stream struct { 16 | Data []byte 17 | } 18 | 19 | type RpcStream struct { 20 | SrcPort, DstPort layers.TCPPort 21 | Dir int 22 | Data [](*Stream) 23 | PendingRequests *cache.Cache 24 | } 25 | 26 | func NewRpcStream(tcp *layers.TCP) *RpcStream { 27 | 28 | in := Stream{Data: make([]byte, 0)} 29 | out := Stream{Data: make([]byte, 0)} 30 | c := cache.New(time.Minute*2, time.Minute*5) 31 | d := [](*Stream){&in, &out} 32 | return &RpcStream{Dir: 0, 33 | SrcPort: tcp.SrcPort, 34 | DstPort: tcp.DstPort, 35 | Data: d, 36 | PendingRequests: c, 37 | } 38 | } 39 | 40 | func (rs *RpcStream) PacketArrieved(packet gopacket.Packet) *list.List { 41 | 42 | l := list.New() 43 | tcp := packet.TransportLayer().(*layers.TCP) 44 | data := tcp.Payload 45 | 46 | if len(data) == 0 { 47 | return l 48 | } 49 | 50 | dir := 0 51 | if rs.SrcPort != tcp.SrcPort { 52 | dir = 1 53 | } 54 | 55 | s := rs.Data[dir] 56 | s.Data = append(s.Data, data...) 57 | 58 | event := &StreamEvent{ 59 | Timestamp: packet.Metadata().CaptureInfo.Timestamp, 60 | Src: packet.NetworkLayer().NetworkFlow().Src().String(), 61 | Dst: packet.NetworkLayer().NetworkFlow().Dst().String(), 62 | SrcPort: tcp.TransportFlow().Src().String(), 63 | DstPort: tcp.TransportFlow().Dst().String(), 64 | Stream: rs, 65 | } 66 | 67 | for len(s.Data) > 0 { 68 | 69 | if len(s.Data) < 4 { 70 | break 71 | } 72 | 73 | marker := uint32(binary.BigEndian.Uint32(s.Data[0:4])) 74 | 75 | islast := (marker & rpcLastFrag) != 0 76 | if !islast { 77 | // FIXME: we need to assemple all fragments 78 | break 79 | } 80 | 81 | size := int(marker & rpcSizeMask) 82 | if size > len(s.Data)-4 { 83 | // not all data arraived 84 | break 85 | } 86 | 87 | data := s.Data[4 : 4+size] 88 | xdr := newXDR(data) 89 | 90 | r := procesRpcMessage(xdr, event) 91 | if r != nil { 92 | pid, ok := xidCache.Get(r.xid) 93 | if ok { 94 | xidCache.Delete(r.xid) 95 | r.pid = pid.(int) 96 | } 97 | l.PushBack(r) 98 | } 99 | 100 | s.Data = s.Data[4+size:] 101 | } 102 | 103 | return l 104 | } 105 | 106 | var xidCache = cache.New(time.Minute*1, time.Minute*1) 107 | 108 | var enablePidTracing = false 109 | var pidSource chan ftrace.Trace 110 | var eventTrace *ftrace.EventTrace 111 | 112 | func EnablePidTracing() { 113 | 114 | enablePidTracing = true 115 | eventTrace = ftrace.NewEventTrace("sunrpc/xprt_transmit") 116 | eventTrace.Enable() 117 | 118 | pidSource = eventTrace.EventSource() 119 | go func() { 120 | for { 121 | select { 122 | case trace, ok := <-pidSource: 123 | if !ok { 124 | return 125 | } 126 | xid := strings.Split(trace.Event, " ")[1][6:] 127 | l := len(xid) 128 | if l < 8 { 129 | xid = strings.Repeat("0", 8-l) + xid 130 | } 131 | xidCache.SetDefault(xid, trace.Pid) 132 | } 133 | } 134 | }() 135 | } 136 | 137 | func DisablePidTracing() { 138 | if enablePidTracing { 139 | eventTrace.Disable() 140 | } 141 | } 142 | -------------------------------------------------------------------------------- /nfs/xdr.go: -------------------------------------------------------------------------------- 1 | package nfs 2 | 3 | import ( 4 | "encoding/binary" 5 | ) 6 | 7 | // XDR maps the External Data Representation 8 | type xdr struct { 9 | data []byte 10 | offset uint32 11 | } 12 | 13 | func newXDR(data []byte) *xdr { 14 | x := makeXDR(data) 15 | return &x 16 | } 17 | 18 | func makeXDR(data []byte) xdr { 19 | return xdr{data: data, offset: 0} 20 | } 21 | 22 | func (r *xdr) size() int { 23 | return len(r.data) 24 | } 25 | 26 | func (r *xdr) getInt() int32 { 27 | i := int32(binary.BigEndian.Uint32(r.data[r.offset : r.offset+4])) 28 | r.offset += 4 29 | return int32(i) 30 | } 31 | 32 | func (r *xdr) getUInt() uint32 { 33 | i := uint32(binary.BigEndian.Uint32(r.data[r.offset : r.offset+4])) 34 | r.offset += 4 35 | return i 36 | } 37 | 38 | func (r *xdr) getHyper() int64 { 39 | i := int64(binary.BigEndian.Uint64(r.data[r.offset : r.offset+8])) 40 | r.offset += 8 41 | return i 42 | } 43 | 44 | func (r *xdr) getUHyper() uint64 { 45 | i := uint64(binary.BigEndian.Uint64(r.data[r.offset : r.offset+8])) 46 | r.offset += 8 47 | return i 48 | } 49 | 50 | func (r *xdr) getString() string { 51 | return string(r.getDynamicOpaque()) 52 | } 53 | 54 | func (r *xdr) getOpaque(length uint32) []byte { 55 | padding := (4 - (length & 3)) & 3 56 | b := r.data[r.offset : r.offset+length] 57 | r.offset += length + padding 58 | return b 59 | } 60 | 61 | func (r *xdr) getDynamicOpaque() []byte { 62 | l := r.getUInt() 63 | return r.getOpaque(l) 64 | } 65 | 66 | func (r *xdr) getUIntVector() []uint32 { 67 | l := r.getUInt() 68 | v := make([]uint32, int(l)) 69 | for i := 0; i < len(v); i++ { 70 | v[i] = r.getUInt() 71 | } 72 | return v 73 | } 74 | -------------------------------------------------------------------------------- /nfs/xdr_test.go: -------------------------------------------------------------------------------- 1 | package nfs 2 | 3 | import ( 4 | "testing" 5 | 6 | "github.com/stretchr/testify/assert" 7 | ) 8 | 9 | var testMsg = []byte{ 10 | 0x80, 0x00, 0x00, 0xe0, 11 | 0xb5, 0x49, 0x21, 0xab, 12 | 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 13 | 0x00, 0x00, 0x00, 0x04, 14 | 15 | 0x00, 0x00, 0x00, 0x0b, 16 | 0x74, 0x65, 0x73, 0x74, 0x20, 0x73, 0x74, 0x72, 0x69, 0x6e, 0x67, 0x00, 17 | } 18 | 19 | func TestXdrDecoding(t *testing.T) { 20 | xdr := makeXDR(testMsg) 21 | 22 | assert.Equal(t, uint32(0x800000e0), uint32(xdr.getUInt())) 23 | assert.Equal(t, uint32(0xb54921ab), uint32(xdr.getUInt())) 24 | assert.Equal(t, uint64(2), uint64(xdr.getUHyper())) 25 | assert.Equal(t, uint32(4), uint32(xdr.getUInt())) 26 | assert.Equal(t, "test string", xdr.getString()) 27 | assert.Equal(t, len(testMsg), xdr.size()) 28 | } 29 | -------------------------------------------------------------------------------- /sniffer/sniffer.go: -------------------------------------------------------------------------------- 1 | package sniffer 2 | 3 | import ( 4 | "time" 5 | 6 | "github.com/tsg/gopacket" 7 | "github.com/tsg/gopacket/pcap" 8 | ) 9 | 10 | // Sniffer packet sniffer configuration 11 | type Sniffer struct { 12 | 13 | // iface to listen 14 | Interface string 15 | 16 | // capture filter 17 | Filter string 18 | 19 | // packet snapshot length 20 | Snaplen int 21 | } 22 | 23 | // Start start packet sniffer 24 | func (sniffer *Sniffer) Start() (chan gopacket.Packet, error) { 25 | 26 | handle, err := pcap.OpenLive( 27 | sniffer.Interface, 28 | int32(sniffer.Snaplen), 29 | true, 30 | 500*time.Millisecond) 31 | if err != nil { 32 | return nil, err 33 | } 34 | err = handle.SetBPFFilter(sniffer.Filter) 35 | if err != nil { 36 | return nil, err 37 | } 38 | 39 | packetSource := gopacket.NewPacketSource(handle, handle.LinkType()) 40 | return packetSource.Packets(), nil 41 | } 42 | -------------------------------------------------------------------------------- /utils/aggr.go: -------------------------------------------------------------------------------- 1 | package utils 2 | 3 | import ( 4 | "container/list" 5 | "github.com/kofemann/nfstop/nfs" 6 | "math" 7 | "sort" 8 | "strings" 9 | ) 10 | 11 | func Aggr(l *list.List, f func(r *nfs.NfsRequest) string) *Term { 12 | 13 | m := make(map[string]int) 14 | 15 | for e := l.Front(); e != nil; e = e.Next() { 16 | r := e.Value.(*nfs.NfsRequest) 17 | m[f(r)]++ 18 | } 19 | 20 | term := &Term{} 21 | for k, v := range m { 22 | e := TermElement{Key: k, Value: v} 23 | term.Elements = append(term.Elements, e) 24 | } 25 | 26 | sort.Sort(sort.Reverse(term)) 27 | return term 28 | } 29 | 30 | func FillHisto(max int, value int, size int) string { 31 | 32 | hsize := math.Floor(float64(size*value) / float64(max)) 33 | 34 | return strings.Repeat("#", int(hsize)) 35 | } 36 | -------------------------------------------------------------------------------- /utils/hexdump.go: -------------------------------------------------------------------------------- 1 | package utils 2 | 3 | import "fmt" 4 | 5 | const ( 6 | ByteSplit = " " 7 | DummyOut = " " 8 | ChunkLen = 16 9 | ) 10 | 11 | func isPrintable(c byte) bool { 12 | // as defined in https://en.wikipedia.org/wiki/ASCII#Printable_characters 13 | if 0x20 < c && c < 0x7e { 14 | return true 15 | } 16 | return false 17 | } 18 | func min(a int, b int) int { 19 | if a < b { 20 | return a 21 | } 22 | return b 23 | } 24 | 25 | // DumpAsHex dump bytes as hex strings 26 | func DumpAsHex(data []byte) { 27 | for i := 0; i < len(data); i += ChunkLen { 28 | dumpHexLine(data[i:min(i+ChunkLen, len(data))], i*ChunkLen, '.') 29 | } 30 | } 31 | 32 | func dumpHexLine(d []byte, offset int, r byte) { 33 | 34 | fmt.Printf("%.5x%s ", offset, ByteSplit) 35 | 36 | var i int 37 | for i, c := range d { 38 | // put a space between first and last 8 bytes 39 | if i%8 == 0 { 40 | fmt.Print(ByteSplit) 41 | } 42 | fmt.Printf("%02x ", c) 43 | } 44 | 45 | // put a missing split space if we got less than 8 bytes 46 | if i < 8 { 47 | fmt.Print(ByteSplit) 48 | } 49 | 50 | // fill missing bytes with spaces 51 | for n := len(d); n < ChunkLen; n++ { 52 | fmt.Print(DummyOut) 53 | } 54 | 55 | // a space between bytes and ASCII content 56 | fmt.Print(ByteSplit) 57 | 58 | // ASCII outpout 59 | for _, c := range d { 60 | if isPrintable(c) { 61 | fmt.Printf("%c", c) 62 | } else { 63 | fmt.Printf("%c", r) 64 | } 65 | } 66 | fmt.Println() 67 | } 68 | -------------------------------------------------------------------------------- /utils/term.go: -------------------------------------------------------------------------------- 1 | package utils 2 | 3 | type TermElement struct { 4 | Key string 5 | Value int 6 | } 7 | 8 | type Term struct { 9 | Elements []TermElement 10 | } 11 | 12 | func (t *Term) Len() int { 13 | return len(t.Elements) 14 | } 15 | func (t *Term) Swap(i, j int) { 16 | t.Elements[i], t.Elements[j] = t.Elements[j], t.Elements[i] 17 | } 18 | func (t *Term) Less(i, j int) bool { 19 | return t.Elements[i].Value < t.Elements[j].Value 20 | } 21 | 22 | func (t *Term) Sum() int { 23 | var sum int 24 | for i := 0; i < len(t.Elements); i++ { 25 | sum += t.Elements[i].Value 26 | } 27 | return sum 28 | } 29 | --------------------------------------------------------------------------------