Compare commits

..

48 commits

Author SHA1 Message Date
Artturin 14d20e3101 flake: Fix bluespec bsc binary
Nixpkgs pr incoming
2025-04-18 18:57:54 +03:00
Artturin 71c938c912 flake.lock: Update
Flake lock file updates:

• Updated input 'nixpkgs':
    'github:NixOS/nixpkgs/d6973081434f88088e5321f83ebafe9a1167c367?narHash=sha256-cuNapx/uQeCgeuhUhdck3JKbgpsml259sjUQnWM7zW8%3D' (2025-01-02)
  → 'github:NixOS/nixpkgs/2bfc080955153be0be56724be6fa5477b4eefabb?narHash=sha256-y7Hg5lwWhEOgflEHRfzSH96BOt26LaYfrYWzZ%2BVoVdg%3D' (2025-04-03)
2025-04-18 18:57:54 +03:00
Artturin c02e7b0de6 flake: Install the same file that fpga-starter-project-uart installed 2025-04-18 18:57:54 +03:00
Artturin 7471c0188a Make make fpga work
`ERROR: IO 'ftdi_txd_1' is unconstrained in LPF (override this error with --lpf-allow-unconstrained)`
2025-04-18 18:57:54 +03:00
Artturin 1622e3ab6b Remove all trailing spaces
`git grep -I --name-only -z -e '' | xargs -0 sed -i 's/[ \t]\+\(\r\?\)$/\1/'`

Remember to setup your editor so that these are automatically removed :)
2025-04-18 18:57:53 +03:00
Artturin 0dd4b60b70 Add initial flake 2025-04-18 18:57:02 +03:00
Yehowshua Immanuel d552934b95 Fixed grant bug
Just becasue we have a grant id doesn't mean that anything has actually
been granted...
2025-04-17 22:47:24 -04:00
Yehowshua Immanuel a58c908763 refactored server functions as well 2025-04-16 22:47:50 -04:00
Yehowshua Immanuel 2fee6a3bd8 refactored client rules 2025-04-16 22:34:52 -04:00
Yehowshua Immanuel 1557cf9cc9 working towards re-factoring into functions 2025-04-16 22:10:49 -04:00
Yehowshua 7d470fbed0 Merge pull request 'implement_Bus_alt1' (#16) from implement_Bus_alt1 into main
Reviewed-on: #16
2025-04-16 22:00:14 +00:00
Yehowshua Immanuel ece1f86574 in theory bus is now complete 2025-04-16 17:58:29 -04:00
Yehowshua Immanuel c28425f10c first attempt at server rule, also implemented consumeRequest of the server part of the Bus interface 2025-04-16 16:55:45 -04:00
Yehowshua Immanuel a58c836981 worked on client arbiter but need to consider if starving is possible when multiple client arbiters grant access to the same server 2025-04-15 18:21:42 -04:00
Yehowshua Immanuel f3acae0c1c potential scaffolding for new approach 2025-04-15 14:15:49 -04:00
Yehowshua Immanuel 180eeeefbe we may not need dispatch by client 2025-04-15 13:50:50 -04:00
Yehowshua Immanuel cd3d728083 some prep work to towards having a server accept a request 2025-04-14 14:33:13 -04:00
Yehowshua Immanuel 373d170c3f notable progress WRT client requests invoking arbiter request 2025-04-13 22:40:59 -04:00
Yehowshua Immanuel 98f2f5cdfd having trouble with type constraints around clientIdx 2025-04-11 20:35:26 -04:00
Yehowshua Immanuel 813f543b42 request server from client rule in client issue 2025-04-11 14:26:40 -04:00
Yehowshua Immanuel 628319709e stopping point 2025-04-11 12:36:43 -04:00
Yehowshua Immanuel 45191a2abd WIP : client request should handle unmapped case 2025-04-11 07:54:47 -04:00
Yehowshua Immanuel cffbadd1cc incomplete but need to come to stopping point 2025-04-10 21:42:15 -04:00
Yehowshua Immanuel 5efef8b19c quieter builds, more type uniformity, full compiles
- made builds less verbose on Mac by removing `-cpp`
 - made type constructors for most instances of `(UInt (TLog n))`
 - addressed cases where types built upon `(UInt (TLog n))` may have
   a max value of `n`, which necessitates changing the type to
   ` (UInt (TLog (TAdd 1 n)))`
 - compiler wouldn't fully evaluate types unless mkBus was
   instantiated
2025-04-10 20:46:53 -04:00
Yehowshua Immanuel 548a2f26bd don't commit bkp files 2025-04-10 11:01:41 -04:00
Yehowshua Immanuel 71fbb7d2e5 add bus diagram and further work on Bus 2025-04-10 10:59:52 -04:00
Yehowshua Immanuel c9356eecfd client methods presumably finished 2025-04-10 01:27:33 -04:00
Yehowshua Immanuel 979adf3660 preliminary work on client methods and some type repair 2025-04-10 00:36:29 -04:00
Yehowshua Immanuel ca02c88be3 stubbed out mkBus for now - awaits full implementation 2025-04-09 22:31:26 -04:00
Yehowshua Immanuel 076d3aed43 shoudl probably rethink approach... 2025-04-09 20:58:13 -04:00
Yehowshua Immanuel b4c7537a85 things still typecheck 2025-04-09 01:08:42 -04:00
Yehowshua Immanuel 989c4e9616 Bus types typecheck!!! 2025-04-08 23:36:54 -04:00
Yehowshua Immanuel fe2fa21fcc skeletons of Bus module slowly forming 2025-04-08 23:04:30 -04:00
Yehowshua b326ac894e Add LICENSE 2025-04-08 23:36:08 +00:00
Yehowshua Immanuel da761f6e4e Type system progress on bus design 2025-04-08 13:05:34 -04:00
Yehowshua 2d5cf48c54 Merge pull request 'Tag Engine Now Finished it seems' (#10) from tag_engine_version_3 into main
Reviewed-on: #10
2025-04-08 01:32:39 +00:00
Yehowshua Immanuel e415d981f9 add some comments 2025-04-04 15:31:46 -04:00
Yehowshua Immanuel 020bc5b646 notable refactor with grok 2025-04-04 15:27:25 -04:00
Yehowshua Immanuel ca59e6eaec handled tag engine edge case 2025-04-04 15:09:56 -04:00
Yehowshua Immanuel 271148e538 better names in TagEngine 2025-04-03 09:15:53 -04:00
Yehowshua Immanuel d1e3358197 now using wire instead of FIFO 2025-04-02 03:03:39 -04:00
Yehowshua Immanuel e055b1bbdf reduced latency 2025-04-02 02:59:49 -04:00
Yehowshua Immanuel d436209f54 seemingly reasonable stopping point 2025-04-02 02:09:41 -04:00
Yehowshua Immanuel 6247ae3b70 clean unused experiments 2025-03-25 08:48:43 -04:00
Yehowshua Immanuel e89254ebef eliminate warnings 2025-03-25 08:03:04 -04:00
Yehowshua Immanuel ed8e0b8337 tag engine now allows from simultaneous retire and request - but had to use unsafe 2025-03-25 01:15:49 -04:00
Yehowshua Immanuel 5588fafebd refactor into standalone TagEngineTester 2025-03-24 23:23:39 -04:00
Yehowshua Immanuel 6e3b3e9178 Preliminary cleaning before repairing TagEngine
* clean up state machine in Top
 * `requestTag` method now emits Maybe type
 * put more thought into comments around asynchronous bus
2025-03-24 22:46:42 -04:00
15 changed files with 1286 additions and 229 deletions

1
.gitignore vendored
View file

@ -1,4 +1,5 @@
*.vcd *.vcd
*.bkp
*.so *.so
# bluespec files # bluespec files

198
LICENSE Normal file
View file

@ -0,0 +1,198 @@
Preamble
The GNU General Public License is a free, copyleft license for software and other kinds of works.
The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too.
When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights.
Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions.
Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and modification follow.
TERMS AND CONDITIONS
0. Definitions.
“This License” refers to version 3 of the GNU General Public License.
“Copyright” also means copyright-like laws that apply to other kinds of works, such as semiconductor masks.
“The Program” refers to any copyrightable work licensed under this License. Each licensee is addressed as “you”. “Licensees” and “recipients” may be individuals or organizations.
To “modify” a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a “modified version” of the earlier work or a work “based on” the earlier work.
A “covered work” means either the unmodified Program or a work based on the Program.
To “propagate” a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well.
To “convey” a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays “Appropriate Legal Notices” to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion.
1. Source Code.
The “source code” for a work means the preferred form of the work for making modifications to it. “Object code” means any non-source form of a work.
A “Standard Interface” means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language.
The “System Libraries” of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A “Major Component”, in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it.
The “Corresponding Source” for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work.
The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source.
The Corresponding Source for a work in source code form is that same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures.
When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified it, and giving a relevant date.
b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to “keep intact all notices”.
c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so.
A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an “aggregate” if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways:
a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b.
d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d.
A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work.
A “User Product” is either (1) a “consumer product”, which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, “normally used” refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product.
“Installation Information” for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made.
If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM).
The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying.
7. Additional Terms.
“Additional permissions” are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or authors of the material; or
e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors.
All other non-permissive additional terms are considered “further restrictions” within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11).
However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice.
Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License.
An “entity transaction” is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it.
11. Patents.
A “contributor” is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's “contributor version”.
A contributor's “essential patent claims” are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, “control” includes the right to grant patent sublicenses in a manner consistent with the requirements of this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version.
In the following three paragraphs, a “patent license” is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To “grant” such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party.
If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. “Knowingly relying” means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it.
A patent license is “discriminatory” if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of the GNU General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns.
Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU General Public License “or any later version” applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation.
If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program.
Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM “AS IS” WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS

View file

@ -51,7 +51,6 @@ BSC_COMP_FLAGS += \
-aggressive-conditions \ -aggressive-conditions \
-no-warn-action-shadowing \ -no-warn-action-shadowing \
-check-assert \ -check-assert \
-cpp \
-show-schedule \ -show-schedule \
+RTS -K128M -RTS -show-range-conflict \ +RTS -K128M -RTS -show-range-conflict \
$(BSC_COMP_FLAG1) $(BSC_COMP_FLAG2) $(BSC_COMP_FLAG3) $(BSC_COMP_FLAG1) $(BSC_COMP_FLAG2) $(BSC_COMP_FLAG3)
@ -61,7 +60,7 @@ $(BDPI_OBJ): $(BDPI_SRC)
BSC_LINK_FLAGS += -keep-fires BSC_LINK_FLAGS += -keep-fires
BSC_PATHS = -p bs/:bsv/:+ BSC_PATHS = -p bs/Bus/:bs/:bs/Tests/:bsv/:+
.PHONY: help .PHONY: help
help: help:

View file

@ -1,7 +0,0 @@
package Bus(a) where
import Types
import BusTypes
a :: UInt 5
a = 3

203
bs/Bus/Bus.bs Normal file
View file

@ -0,0 +1,203 @@
package Bus(mkBus, Bus(..)) where
import Types
import BusTypes
import Client
import Server
import TagEngine
import Vector
import Util
import Arbiter
import FIFO
import FIFOF
import SpecialFIFOs
import Printf
-- Creates a Bus Module that supports multiple clients and servers
-- submitting requests and simultaneously returning responses.
-- Responses can be consumed by clients out of order(useful when some
-- servers respond before others) as all client submitted requests are
-- tagged with tags that are unique for the duration of the transaction
-- - and well-behaved servers should keep that tag when responding.
-- Explicitly inform the compiler that log2 n <= log2(n + 1)
mkBus :: (Add n (TLog numServers) (TLog (TAdd numServers 1)))
=> (Addr -> Maybe (MkServerIdx numServers))
-> Module (Bus inFlightTransactions numClients numServers)
mkBus serverMap = do
-- Tag engines for each client to manage transaction tags
tagEngineByClientVec :: Vector numClients (TagEngine inFlightTransactions)
tagEngineByClientVec <- replicateM mkTagEngine
-- There are `numClients` clients, each of which needs its own client
-- response arbiter as there are `numServer` servers that may wish to
-- submit a response to a given client. Furthermore the rule that routes
-- client requests to servers makes for another potential submitter to
-- the client response arbiter as it may determine that a request is
-- unmappable and simply bypass submitting the request to a server,
-- instead opting to form a `BusError UnMapped` response to be submitted
-- directly to a client response arbiter. Thus the client response arbiter
-- must arbit between a total of `numServers + 1` requestors.
responseArbiterByClient :: Vector numClients (Arbiter.Arbiter_IFC (TAdd numServers 1))
responseArbiterByClient <- replicateM (mkArbiter False)
-- There are `numServer` servers, each of which needs its own arbiter as
-- there are up to `numClient` clients that may wish to submit a response
-- to a given server.
requestArbiterByServer :: Vector numServers (Arbiter.Arbiter_IFC numClients)
requestArbiterByServer <- replicateM (mkArbiter False)
-- Queues to hold requests from clients
clientRequestQueues :: Vector numClients (FIFOF (TaggedBusRequest inFlightTransactions))
clientRequestQueues <- replicateM (mkSizedBypassFIFOF (valueOf inFlightTransactions))
-- Queues to hold responses to clients
clientResponseQueues :: Vector numClients (FIFOF (TaggedBusResponse inFlightTransactions))
clientResponseQueues <- replicateM (mkSizedBypassFIFOF (valueOf inFlightTransactions))
-- The following two vectors of single depth FIFOs make it easier to push/pull data
-- to/from internal server methods as they provide back-pressure in both directions,
-- and behave as a wire when queue is empty.
-- If looking at the example bus.drawio diagram, the following two vectors effectively
-- correspond to the two arrows going from the blue box to the servers.
consumeRequestQueues :: Vector numServers (
FIFOF (
MkClientTagType numClients,
TaggedBusRequest inFlightTransactions
)
)
consumeRequestQueues <- replicateM mkBypassFIFOF
submitResponseQueues :: Vector numServers (
FIFOF (
MkClientTagType numClients,
TaggedBusResponse inFlightTransactions
)
)
submitResponseQueues <- replicateM mkBypassFIFOF
let clientRules :: Vector numClients (Rules)
clientRules = genWith |> \clientIdx ->
let selectedClientReqQueue :: FIFOF (TaggedBusRequest inFlightTransactions)
selectedClientReqQueue = select clientRequestQueues clientIdx
selectedClientRespQueue :: FIFOF (TaggedBusResponse inFlightTransactions)
selectedClientRespQueue = select clientResponseQueues clientIdx
selectedClientRespArbiter :: Arbiter.Arbiter_IFC (TAdd numServers 1)
selectedClientRespArbiter = select responseArbiterByClient clientIdx
clientRouterRule :: Rules
clientRouterRule = clientRouteRequest
clientIdx
selectedClientReqQueue
requestArbiterByServer
responseArbiterByClient
serverMap
clientArbiterRule :: Rules
clientArbiterRule = clientArbitSubmission
clientIdx
selectedClientReqQueue
selectedClientRespQueue
selectedClientRespArbiter
submitResponseQueues
in
clientRouterRule <+> clientArbiterRule
let serverRules :: Vector numServers (Rules)
serverRules = genWith |> \serverIdx ->
let selectedServerArbiter :: Arbiter.Arbiter_IFC numClients
selectedServerArbiter = select requestArbiterByServer serverIdx
selectedConsumeReqQueue :: FIFOF (MkClientTagType numClients, TaggedBusRequest inFlightTransactions)
selectedConsumeReqQueue = select consumeRequestQueues serverIdx
selectedSubmitRespQueue :: FIFOF (MkClientTagType numClients, TaggedBusResponse inFlightTransactions)
selectedSubmitRespQueue = select submitResponseQueues serverIdx
serverRouterRule :: Rules
serverRouterRule = serverRouteResponse
serverIdx
selectedSubmitRespQueue
responseArbiterByClient
serverArbiterRule :: Rules
serverArbiterRule = serverArbitRequests
serverIdx
selectedServerArbiter
selectedConsumeReqQueue
clientRequestQueues
in
serverRouterRule <+> serverArbiterRule
addRules |> foldr (<+>) (rules {}) clientRules
addRules |> foldr (<+>) (rules {}) serverRules
-- Client interface vector
let clients :: Vector numClients (BusClient inFlightTransactions)
clients = genWith |> \clientIdx ->
let
selectedClientRequestQueue :: FIFOF (TaggedBusRequest inFlightTransactions)
selectedClientRequestQueue = (select clientRequestQueues clientIdx)
selectedClientResponseQueue :: FIFOF (TaggedBusResponse inFlightTransactions)
selectedClientResponseQueue = (select clientResponseQueues clientIdx)
selectedTagEngine :: TagEngine inFlightTransactions
selectedTagEngine = (select tagEngineByClientVec clientIdx)
in
interface BusClient
submitRequest :: BusRequest
-> ActionValue (MkTagType inFlightTransactions)
submitRequest busRequest = do
tag <- selectedTagEngine.requestTag
let taggedReuqest = TaggedBusRequest {tag = tag; busRequest = busRequest}
selectedClientRequestQueue.enq taggedReuqest
return tag
consumeResponse :: ActionValue (TaggedBusResponse inFlightTransactions)
consumeResponse = do
let
busResponse :: (TaggedBusResponse inFlightTransactions)
busResponse = selectedClientResponseQueue.first
selectedTagEngine.retireTag busResponse.tag
selectedClientResponseQueue.deq
return busResponse
-- Server interface vector
let servers :: Vector numServers (BusServer inFlightTransactions numClients)
servers = genWith |> \serverIdx ->
let
selectedConsumeRequestQueue :: FIFOF (
MkClientTagType numClients,
TaggedBusRequest inFlightTransactions
)
selectedConsumeRequestQueue = (select consumeRequestQueues serverIdx)
in
interface BusServer
consumeRequest :: ActionValue (
MkClientTagType numClients,
TaggedBusRequest inFlightTransactions
)
consumeRequest = do
selectedConsumeRequestQueue.deq
return selectedConsumeRequestQueue.first
submitResponse :: ( MkClientTagType numClients,
TaggedBusResponse inFlightTransactions
) -> Action
submitResponse (clientTag, taggedBusResponse) = do
let
selectedSubmitResponseQueue :: FIFOF (
MkClientTagType numClients,
TaggedBusResponse inFlightTransactions
)
selectedSubmitResponseQueue = (select submitResponseQueues serverIdx)
selectedSubmitResponseQueue.enq (clientTag, taggedBusResponse)
return |>
interface Bus
clients = clients
servers = servers

115
bs/Bus/BusTypes.bs Normal file
View file

@ -0,0 +1,115 @@
package BusTypes(
Bus(..),
MkServerIdx,
MkClientTagType,
BusClient(..), BusServer(..),
BusRequest(..), BusResponse(..),
ReadRequest(..), ReadResponse(..), WriteRequest(..), WriteResponse(..),
BusVal(..), BusError(..), TransactionSize(..),
TaggedBusRequest(..), TaggedBusResponse(..)
) where
import Types
import Vector
import TagEngine
type MkClientTagType numClients = (UInt (TLog numClients))
type MkServerIdx numServers = (UInt (TLog numServers))
data BusError
= UnMapped
| UnAligned
deriving (Bits, Eq, FShow)
data TransactionSize
= SizeByte
| SizeHalfWord
| SizeFullWord
| SizeDoubleWord
| SizeQuadWord
deriving (Bits, Eq, FShow)
data BusVal
= BusByte Byte
| BusHalfWord HalfWord
| BusFullWord FullWord
| BusDoubleWord DoubleWord
| BusQuadWord QuadWord
deriving (Bits, Eq, FShow)
data ReadRequest = ReadRequest Addr TransactionSize
deriving (Bits, Eq, FShow)
data WriteRequest = WriteRequest Addr BusVal
deriving (Bits, Eq, FShow)
type ReadResponse = Either BusError BusVal
type WriteResponse = Either BusError ()
data BusRequest
= BusReadRequest ReadRequest
| BusWriteRequest WriteRequest
deriving (Bits, Eq, FShow)
data BusResponse
= BusReadResponse ReadResponse
| BusWriteResponse WriteResponse
deriving (Bits, Eq, FShow)
struct TaggedBusRequest inFlightTransactions =
{ tag :: (MkTagType inFlightTransactions);
busRequest :: BusRequest
}
deriving (Bits, Eq, FShow)
struct TaggedBusResponse inFlightTransactions =
{ tag :: (MkTagType inFlightTransactions);
busResponse :: BusResponse
}
deriving (Bits, Eq, FShow)
-- # BusClient.submitRequest
-- * The bus client calls the `submitRequest` method of the `BusClient` interface
-- with the `BusRequest` it wishes to submit and immediately recieves back
-- a transaction-duration-unqiue tag that it can later correlate with the
-- returned response should responses arrive out of order(OOO). OOO can
-- happen if a bus server is is able to process bus requests faster than
-- other bus servers for example.
-- # BusClient.consumeResponse
-- * The bus client is able to consume a response when a response is available.
-- Responses are tagged with the tag given to bus client when it called
-- `submitRequest`
interface (BusClient :: # -> *) inFlightTransactions =
submitRequest :: BusRequest
-> ActionValue (MkTagType inFlightTransactions)
consumeResponse :: ActionValue (TaggedBusResponse inFlightTransactions)
-- # BusServer.consumeRequest
-- * The bus server calls the `consumeRequest` method of the `BusServer` interface
-- to retrieve a pending bus request initiated by a client. It immediately
-- receives a tuple containing a transaction-duration-unique tag
-- (associated with the original request) and the `BusRequest` itself. This
-- tag is used to track the transaction and correlate it with the eventual
-- response.
-- # BusServer.submitResponse
-- * The bus server calls the `submitResponse` method to send a `BusResponse`
-- back to the originating client. The method takes a tuple containing:
-- - A client tag (of type `MkClientTagType numClients`) identifying the
-- client that submitted the request.
-- - The `BusResponse` containing the result of the request (either a read
-- or write response).
-- - The transaction tag (of type `transactionTagType`) that matches the tag
-- received from `consumeRequest`, ensuring the response is correctly
-- associated with the original request.
interface (BusServer :: # -> # -> *) inFlightTransactions numClients =
consumeRequest :: ActionValue (
MkClientTagType numClients,
TaggedBusRequest inFlightTransactions
)
submitResponse :: ( MkClientTagType numClients,
TaggedBusResponse inFlightTransactions
) -> Action
interface (Bus :: # -> # -> # -> *) inFlightTransactions numClients numServers =
clients :: Vector numClients (BusClient inFlightTransactions)
servers :: Vector numServers (BusServer inFlightTransactions numClients)

113
bs/Bus/Client.bs Normal file
View file

@ -0,0 +1,113 @@
package Client(
clientRouteRequest,
clientArbitSubmission
) where
import Types
import BusTypes
import TagEngine
import Vector
import Util
import Arbiter
import FIFO
import FIFOF
import SpecialFIFOs
import Printf
busRequestToAddr :: BusRequest -> Addr
busRequestToAddr req = case req of
BusReadRequest (ReadRequest addr _) -> addr
BusWriteRequest (WriteRequest addr _) -> addr
clientRouteRequest :: (Add n (TLog numServers) (TLog (TAdd numServers 1)))
=> Integer
-> FIFOF (TaggedBusRequest inFlightTransactions)
-> Vector numServers (Arbiter.Arbiter_IFC numClients)
-> Vector numClients (Arbiter.Arbiter_IFC (TAdd numServers 1))
-> (Addr -> Maybe (MkServerIdx numServers))
-> Rules
clientRouteRequest clientIdx clientReqQueue requestArbiterByServer responseArbiterByClient serverMap =
rules
(sprintf "client[%d] route request" clientIdx): when True ==> do
let clientRequest :: TaggedBusRequest inFlightTransactions
clientRequest = clientReqQueue.first
targetAddr :: Addr
targetAddr = busRequestToAddr |> clientRequest.busRequest
targetServerIdx :: Maybe (MkServerIdx numServers)
targetServerIdx = serverMap targetAddr
case targetServerIdx of
Just serverIdx -> do
let targetServerArbiter :: Arbiter.Arbiter_IFC numClients
targetServerArbiter = select requestArbiterByServer serverIdx
arbiterClientSlot :: Arbiter.ArbiterClient_IFC
arbiterClientSlot = select targetServerArbiter.clients clientIdx
arbiterClientSlot.request
-- We bypass sensing the request to the server instead option to form
-- a `BusError Unmapped` response which we request to send directly to
-- the appropiate client response queue.
Nothing -> do
let targetClientResponseArbiter :: Arbiter.Arbiter_IFC (TAdd numServers 1)
targetClientResponseArbiter = select responseArbiterByClient clientIdx
-- arbiters 0 to n-1 where `n:=numServer` are reserved
-- for servers to make requests to. Arbiter n is reserved for
-- when this rule needs to skip making a request to a server
-- and should instead forward the `BusError UnMapped` response
-- back to the client. Vector.last selects arbiter `n`
clientResponseArbiterSlot :: Arbiter.ArbiterClient_IFC
clientResponseArbiterSlot = Vector.last targetClientResponseArbiter.clients
responseUnMapped :: BusResponse
responseUnMapped = case clientRequest.busRequest of
BusReadRequest _ -> BusReadResponse (Left UnMapped)
BusWriteRequest _ -> BusWriteResponse (Left UnMapped)
response :: TaggedBusResponse inFlightTransactions
response = TaggedBusResponse { tag = clientRequest.tag; busResponse = responseUnMapped }
clientResponseArbiterSlot.request
clientArbitSubmission :: (Add n (TLog numServers) (TLog (TAdd numServers 1)))
=> Integer
-> FIFOF (TaggedBusRequest inFlightTransactions)
-> FIFOF (TaggedBusResponse inFlightTransactions)
-> Arbiter.Arbiter_IFC (TAdd numServers 1)
-> Vector numServers (FIFOF (MkClientTagType numClients, TaggedBusResponse inFlightTransactions))
-> Rules
clientArbitSubmission clientIdx clientReqQueue clientRespQueue clientRespArbiter submitRespQueues =
let grantedIdx :: UInt (TLog (TAdd numServers 1))
grantedIdx = unpack clientRespArbiter.grant_id
selectedServerInterface :: ArbiterClient_IFC
selectedServerInterface = select clientRespArbiter.clients grantedIdx
in
rules
(sprintf "client[%d] arbit submission" clientIdx): when selectedServerInterface.grant ==> do
let isClientRequest :: Bool
isClientRequest = grantedIdx == fromInteger (valueOf numServers)
if isClientRequest then do
let clientRequest :: TaggedBusRequest inFlightTransactions
clientRequest = clientReqQueue.first
responseUnMapped :: BusResponse
responseUnMapped = case clientRequest.busRequest of
BusReadRequest _ -> BusReadResponse (Left UnMapped)
BusWriteRequest _ -> BusWriteResponse (Left UnMapped)
response :: TaggedBusResponse inFlightTransactions
response = TaggedBusResponse { tag = clientRequest.tag; busResponse = responseUnMapped }
clientRespQueue.enq response
clientReqQueue.deq
else do
let grantedServerIdx :: MkServerIdx numServers
grantedServerIdx = truncate grantedIdx
selectedSubmitRespQueue :: FIFOF (MkClientTagType numClients, TaggedBusResponse inFlightTransactions)
selectedSubmitRespQueue = select submitRespQueues grantedServerIdx
response :: (MkClientTagType numClients, TaggedBusResponse inFlightTransactions)
response = selectedSubmitRespQueue.first
clientRespQueue.enq response.snd
selectedSubmitRespQueue.deq

57
bs/Bus/Server.bs Normal file
View file

@ -0,0 +1,57 @@
package Server(
serverArbitRequests,
serverRouteResponse
) where
import Types
import BusTypes
import TagEngine
import Vector
import Util
import Arbiter
import FIFO
import FIFOF
import SpecialFIFOs
import Printf
serverRouteResponse :: Integer
-> FIFOF (MkClientTagType numClients, TaggedBusResponse inFlightTransactions)
-> Vector numClients (Arbiter.Arbiter_IFC (TAdd numServers 1))
-> Rules
serverRouteResponse serverIdx submitRespQueue responseArbiterByClient =
rules
(sprintf "server[%d] route response" serverIdx): when True ==> do
let response :: (MkClientTagType numClients, TaggedBusResponse inFlightTransactions)
response = submitRespQueue.first
clientTag :: MkClientTagType numClients
clientTag = response.fst
targetClientRespArbiter :: Arbiter.Arbiter_IFC (TAdd numServers 1)
targetClientRespArbiter = select responseArbiterByClient clientTag
arbiterClientSlot :: Arbiter.ArbiterClient_IFC
arbiterClientSlot = select targetClientRespArbiter.clients serverIdx
arbiterClientSlot.request
serverArbitRequests :: Integer
-> Arbiter.Arbiter_IFC numClients
-> FIFOF (MkClientTagType numClients, TaggedBusRequest inFlightTransactions)
-> Vector numClients (FIFOF (TaggedBusRequest inFlightTransactions))
-> Rules
serverArbitRequests serverIdx serverArbiter consumeReqQueue clientReqQueues =
let grantedClientIdx :: MkClientTagType numClients
grantedClientIdx = unpack serverArbiter.grant_id
selectedClientInterface :: ArbiterClient_IFC
selectedClientInterface = select serverArbiter.clients grantedClientIdx
in
rules
(sprintf "server[%d] arbit requests" serverIdx): when selectedClientInterface.grant ==> do
let selectedClientReqQueue :: FIFOF (TaggedBusRequest inFlightTransactions)
selectedClientReqQueue = select clientReqQueues grantedClientIdx
clientRequest :: TaggedBusRequest inFlightTransactions
clientRequest = selectedClientReqQueue.first
consumeReqQueue.enq (grantedClientIdx, clientRequest)
selectedClientReqQueue.deq

View file

@ -1,68 +0,0 @@
package BusTypes(
BusVal(..),
BusError(..),
TransactionSize(..),
ReadRequest(..),
WriteRequest(..)
) where
import Types
data BusError
= UnMapped
| UnAligned
deriving (Bits, Eq, FShow)
data TransactionSize
= SizeByte
| SizeHalfWord
| SizeFullWord
| SizeDoubleWord
| SizeQuadWord
deriving (Bits, Eq, FShow)
data BusVal
= BusByte Byte
| BusHalfWord HalfWord
| BusFullWord FullWord
| BusDoubleWord DoubleWord
| BusQuadWord QuadWord
deriving (Bits, Eq, FShow)
data ReadRequest = ReadRequest Addr TransactionSize
deriving (Bits, Eq, FShow)
data WriteRequest = WriteRequest Addr BusVal
deriving (Bits, Eq, FShow)
type ReadResponse = Either BusError BusVal
type WriteResponse = Either BusError ()
data BusRequest
= BusReadRequest ReadRequest
| WriteReadRequest WriteRequest
deriving (Bits, Eq, FShow)
data BusResponse
= BusReadResponse ReadResponse
| BusWriteResponse WriteResponse
deriving (Bits, Eq, FShow)
interface BusMaster =
-- The Bus arbiter will call the Bus Master's request method
-- if and only if it's the Bus Master's turn to make a request, and the Bus Master
-- has a request to make.
-- It is up to the BusMaster to guard it's request method such that calling
-- it's request method is only valid when the BusMaster has a request to make.
-- This has implications about for the implementor of BusMaster, namely, that it
-- should hold its request until it's request method gets called.
request :: BusRequest
-- From the masters's perspective, the response should not be called until
-- the client is ready to accept the response. In other words, response
-- should be guarded by the client.
response :: BusResponse -> Action
type Token = UInt 5
a :: UInt 5
a = 3

View file

@ -1,4 +1,8 @@
package ClkDivider(mkClkDivider, ClkDivider(..)) where package ClkDivider(
mkClkDivider,
MkClkDivType,
ClkDivider(..)
) where
interface (ClkDivider :: # -> *) hi = interface (ClkDivider :: # -> *) hi =
{ {
@ -7,11 +11,13 @@ interface (ClkDivider :: # -> *) hi =
;isHalfCycle :: Bool ;isHalfCycle :: Bool
} }
type MkClkDivType maxCycles = (UInt (TLog (TAdd 1 maxCycles)))
mkClkDivider :: Handle -> Module (ClkDivider hi) mkClkDivider :: Handle -> Module (ClkDivider hi)
mkClkDivider fileHandle = do mkClkDivider fileHandle = do
counter <- mkReg(0 :: UInt (TLog hi)) counter <- mkReg(0 :: MkClkDivType hi)
let hi_value :: UInt (TLog hi) = (fromInteger $ valueOf hi) let hi_value :: (MkClkDivType hi) = (fromInteger $ valueOf hi)
let half_hi_value :: UInt (TLog hi) = (fromInteger $ valueOf (TDiv hi 2)) let half_hi_value :: (MkClkDivType hi) = (fromInteger $ valueOf (TDiv hi 2))
let val :: Real = (fromInteger $ valueOf hi) let val :: Real = (fromInteger $ valueOf hi)
let msg = "Clock Div Period : " + (realToString val) + "\n" let msg = "Clock Div Period : " + (realToString val) + "\n"

View file

@ -11,13 +11,13 @@ interface (Core :: # -> *) clkFreq = {
mkCore :: Module (Core clkFreq) mkCore :: Module (Core clkFreq)
mkCore = do mkCore = do
counter :: Reg (UInt (TLog clkFreq)) <- mkReg 0 counter :: Reg (MkClkDivType clkFreq) <- mkReg 0
tickSecond :: Wire Bool <- mkDWire False tickSecond :: Wire Bool <- mkDWire False
uartOut :: Wire (Bit 8) <- mkWire; uartOut :: Wire (Bit 8) <- mkWire;
ledOut :: Reg (Bit 8) <- mkReg 0 ledOut :: Reg (Bit 8) <- mkReg 0
let clkFreqInt :: Integer = valueOf clkFreq let clkFreqInt :: Integer = valueOf clkFreq
let clkFreqUInt :: UInt (TLog clkFreq) = fromInteger clkFreqInt let clkFreqUInt :: (MkClkDivType clkFreq) = fromInteger clkFreqInt
let val :: Real = fromInteger clkFreqInt let val :: Real = fromInteger clkFreqInt
messageM $ "mkCore clkFreq" + realToString val messageM $ "mkCore clkFreq" + realToString val

View file

@ -1,81 +1,113 @@
package TagEngine( package TagEngine(
MkTagType,
TagEngine(..), TagEngine(..),
Util.BasicResult(..), Util.BasicResult(..),
mkTagEngine) where mkTagEngine) where
import Vector import Vector
import Util import Util
import FIFO
import SpecialFIFOs
#define UIntLog2N(n) (UInt (TLog n)) type MkTagType numTags = (UInt (TLog (TAdd 1 numTags)))
interface (TagEngine :: # -> *) numTags = interface (TagEngine :: # -> *) numTags =
requestTag :: ActionValue UIntLog2N(numTags) requestTag :: ActionValue (MkTagType numTags)
retireTag :: UIntLog2N(numTags) -> ActionValue BasicResult retireTag :: (MkTagType numTags) -> Action
-- The tag engine returns a tag that is unique for the duration of -- The tag engine returns a tag that is unique for the duration of
-- the lifetime of the tag. Useful when you need to tag transactions -- the lifetime of the tag. Useful when you need to tag transactions
-- on a bus for example. -- on a bus for example.
-- This implementation is stack based. -- This implementation is FIFO based.
mkTagEngine :: Module (TagEngine numTags) mkTagEngine :: Module (TagEngine numTags)
mkTagEngine = mkTagEngine = do
do -- Constants
let reifiedNumTags = fromInteger |> valueOf numTags let maxTagCount = fromInteger (valueOf numTags)
freeStackVec :: Vector numTags (Reg UIntLog2N(numTags)) tagUsage :: Vector numTags (Reg Bool) <- replicateM (mkReg False) -- Tracks which tags are in use
freeStackVec <- mapM (\i -> mkReg |> fromInteger i) genVector
inUseVec :: Vector numTags (Reg Bool) -- Since Bluespec doesn't allow us to initialize FIFOs with values at
inUseVec <- replicateM |> mkReg False -- reset, we can pretend as if the buffer within our freeTagQueue is populated
-- with sequentially incrementing values(starting from 0) on reset
-- by having our tag engine effectively return the value of a decrementing
-- counter initialized to (maxTagCount - 1) for the first n tag requests made
-- to TagEngine where `n := maxTagCount`.
initialTagDistributor <- mkReg (Just (maxTagCount - 1)) -- Distributes initial tags
retireQueue <- mkBypassFIFO -- Queue for tags being retired
freeTagQueue <- mkSizedFIFO maxTagCount -- Queue of available tags
stackPtr :: (Reg (Maybe(UIntLog2N(numTags)))) -- Signals
stackPtr <- mkReg |> Just |> reifiedNumTags - 1 retireSignal <- mkRWire -- Signals a tag retirement
requestSignal <- mkRWire -- Signals a tag request
-- Debug
debugOnce <- mkReg True debugOnce <- mkReg True
addRules $ -- Rules
addRules |>
rules rules
"display": when (debugOnce == True) ==> "debug_initial_state": when debugOnce ==> do
do $display "tagUsage: " (fshow (readVReg tagUsage))
$display "freeStackVec : " (fshow |> readVReg freeStackVec)
$display "inUseVec : " (fshow |> readVReg inUseVec)
$display "stackPtr : " (fshow stackPtr)
debugOnce := False debugOnce := False
counter <- mkReg(0 :: UIntLog2N(numTags)) "retire_tag": when True ==> do
return $ let tag = retireQueue.first
$display "Retiring tag: " (fshow tag)
retireQueue.deq
freeTagQueue.enq tag
retireSignal.wset tag
-- Combined update rules (simplified below)
"update_usage": when True ==> do
let mRetireTag = retireSignal.wget
mRequestTag = requestSignal.wget
case (mRetireTag, mRequestTag) of
(Just retireTag, Just requestTag) -> do
let usage = readVReg tagUsage
usage' = update usage requestTag True
usage'' = update usage' retireTag False
writeVReg tagUsage usage''
$display $time " Updated usage (request + retire): " (fshow |> readVReg tagUsage)
(Just retireTag, Nothing) -> do
(select tagUsage retireTag) := False
$display $time " Updated usage (retire): " (fshow (readVReg tagUsage))
(Nothing, Just requestTag) -> do
(select tagUsage requestTag) := True
$display $time " Updated usage (request): " (fshow (readVReg tagUsage))
(Nothing, Nothing) -> action {}
-- Interface
return |>
interface TagEngine interface TagEngine
requestTag :: ActionValue (MkTagType numTags)
requestTag = do
case initialTagDistributor of
Just 0 -> do
initialTagDistributor := Nothing
requestSignal.wset 0
return 0
Just tag -> do
initialTagDistributor := Just (tag - 1)
requestSignal.wset tag
return tag
Nothing -> do
let tag = freeTagQueue.first
freeTagQueue.deq
requestSignal.wset tag
return tag
requestTag :: ActionValue UIntLog2N(numTags) -- `retireTag` isn't guarded on tag validity(this would break Bluespec's safety model)
requestTag = -- so it is advisable that the caller of `retireTag` only attempt to retire valid tags.
do -- Internally, the tagEngine will keep a correct and consistent state since TagEngine
stackPtr := -- validates tags before attempting to retire them.
if sampledStackPtr == 0 retireTag :: (MkTagType numTags) -> Action
then Nothing
else Just |> sampledStackPtr - 1
(select inUseVec sampledStackPtr) := True
return |> readReg (select freeStackVec sampledStackPtr)
when
Just sampledStackPtr <- stackPtr
-- retireTag isn't guarded so its up to external module to only attempt to
-- retire valid tags... At any rate, we can notify the requestor of failures
-- to retire tags - although the requestor can merely ignore this
-- notification.
retireTag :: UIntLog2N(numTags) -> ActionValue BasicResult
retireTag tag = retireTag tag =
do do
let let
tagValid = tag < reifiedNumTags tagValid = tag < maxTagCount
tagInUse = readReg (select inUseVec tag) tagInUse = readReg (select tagUsage tag)
nextStackPtrUint =
case stackPtr of
Nothing -> 0
Just n -> n + 1
if (tagValid && tagInUse) if (tagValid && tagInUse)
then do then do
(select inUseVec tag) := False retireQueue.enq tag
(select freeStackVec nextStackPtrUint) := tag
stackPtr := Just nextStackPtrUint
return Success
else do else do
return Failure action {}

View file

@ -0,0 +1,64 @@
package TagEngineTester(mkTagEngineTester) where
import TagEngine
import ActionSeq
mkTagEngineTester :: Module Empty
mkTagEngineTester = do
tagEngine :: TagEngine 5 <- mkTagEngine
runOnce :: Reg Bool <- mkReg False
s :: ActionSeq
s <-
let
requestTagAction :: Action
requestTagAction =
do
tag <- tagEngine.requestTag
$display $time " got tag : " (fshow tag)
retireTagAction :: UInt 3 -> Action
retireTagAction tag =
do
res <- tagEngine.retireTag tag
$display $time " retiring tag : " (fshow tag) " " (fshow res)
action {}
in
actionSeq $
do requestTagAction
|> do requestTagAction
|> do requestTagAction
|> do requestTagAction
|> do requestTagAction
|> do retireTagAction 2
-- |> do $display "BEGIN TRY SIMULTANEOUS RETIRE and REQUEST"
|> do
retireTagAction 4
requestTagAction
-- |> do $display "END TRY SIMULTANEOUS RETIRE and REQUEST"
-- |> do $display "BEGIN TRY SIMULTANEOUS RETIRE and REQUEST"
|> do
retireTagAction 4
requestTagAction
-- |> do $display "END TRY SIMULTANEOUS RETIRE and REQUEST"
|> do $finish
-- |> do retireTagAction 4
-- |> do retireTagAction 4
-- |> do retireTagAction 0
-- |> do requestTagAction
-- |> do requestTagAction
-- |> do retireTagAction 1
-- |> do requestTagAction
-- |> do $finish
addRules $
rules
-- "counter": when True ==>
-- do
-- count := count + 1
-- $display "count : " (fshow count)
"testIncrement": when (runOnce == False) ==>
do
s.start
runOnce := True

108
bs/Top.bs
View file

@ -10,6 +10,11 @@ import TagEngine
import List import List
import ActionSeq import ActionSeq
import Vector
import BusTypes
import TagEngineTester
type FCLK = 25000000 type FCLK = 25000000
type BAUD = 9600 type BAUD = 9600
@ -19,44 +24,6 @@ interface ITop = {
;ftdi_txd :: Bit 1 -> Action {-# always_ready , always_enabled #-} ;ftdi_txd :: Bit 1 -> Action {-# always_ready , always_enabled #-}
}; };
interface BusClient =
request :: Bit 1
response :: Bit 1 -> Action
mkBusClient :: Module BusClient
mkBusClient = module
reqReg :: Reg (Bit 1) <- mkReg 0
return $
interface BusClient
request = reqReg
response resp = do
reqReg := 0 -- Reset request after receiving response
interface Bus =
request :: Bit 1 -> Action
response :: Bit 1
mkBus :: Module Bus
mkBus = module
respReg :: Reg (Bit 1) <- mkReg 0
return $
interface Bus
request req = do
respReg := req -- Simple pass-through for this example
response = respReg
-- -- Function to connect Bus to BusClient
connectBusToClient :: Bus -> BusClient -> Rules
connectBusToClient bus client =
rules
"busConnection": when True ==> do
bus.request client.request
client.response bus.response
-- need to implement mkBus
-- need function that can connect Bus to BusClient
mkTop :: Module ITop mkTop :: Module ITop
mkTop = do mkTop = do
fileHandle :: Handle <- openFile "compile.log" WriteMode fileHandle :: Handle <- openFile "compile.log" WriteMode
@ -64,17 +31,9 @@ mkTop = do
serializer :: ISerializer FCLK BAUD <- mkSerialize fileHandle serializer :: ISerializer FCLK BAUD <- mkSerialize fileHandle
core :: Core FCLK <- mkCore core :: Core FCLK <- mkCore
bus :: Bus <- mkBus
busClient :: BusClient <- mkBusClient
let a :: List Integer = 1 :> 2 :> Nil
b = length a
persistLed :: Reg (Bit 8) <- mkReg 0 persistLed :: Reg (Bit 8) <- mkReg 0
messageM $ "Hallo!!" + (realToString 5) messageM $ "Hallo!!" + (realToString 5)
-- need to instantiate a Bus and BusClient
addRules $ connectBusToClient bus busClient
addRules $ addRules $
rules rules
-- need new rule that always connects Bus to BusClient -- need new rule that always connects Bus to BusClient
@ -100,58 +59,19 @@ mkTop = do
mkSim :: Module Empty mkSim :: Module Empty
mkSim = do mkSim = do
let cfg :: BRAM_Configure = defaultValue _ :: Empty <- mkTagEngineTester
initCFunctions :: Reg Bool <- mkReg False
tagEngine :: TagEngine 5 <- mkTagEngine core :: Core FCLK <- mkCore
count :: Reg (UInt 4) <- mkReg 0; let busMap _ = Just 0
initCFunctions :: Reg Bool <- mkReg False; bus :: (Bus 4 2 2) <- mkBus busMap
core :: Core FCLK <- mkCore;
s :: ActionSeq
s <- actionSeq
$ do
$display "got tag : " tagEngine.requestTag
|> do
$display "got tag : " tagEngine.requestTag
|> do
$display "got tag : " tagEngine.requestTag
|> do
res <- tagEngine.retireTag 3
$display "retiring tag : 3 " (fshow res)
action {}
|> do
$display "got tag : " tagEngine.requestTag
|> do
$display "got tag : " tagEngine.requestTag
|> do
res <- tagEngine.retireTag 4
$display "retiring tag : 4 " (fshow res)
action {}
|> do
res <- tagEngine.retireTag 4
$display "retiring tag : 4 " (fshow res)
action {}
|> do
res <- tagEngine.retireTag 0
$display "retiring tag : 0 " (fshow res)
action {}
|> do
$display "got tag : " tagEngine.requestTag
|> do
$display "got tag : " tagEngine.requestTag
|> do
res <- tagEngine.retireTag 1
$display "retiring tag : 1 " (fshow res)
action {}
|> do
$display "got tag : " tagEngine.requestTag
addRules $ addRules $
rules rules
"testIncrement": when (count < 10) ==> "test bus": when True ==>
do do
count := count + 1 let server = (Vector.select bus.servers 0)
s.start result <- server.consumeRequest
$display "Top.bs:74" (fshow result)
"initCFunctionsOnce": when not initCFunctions ==> "initCFunctionsOnce": when not initCFunctions ==>
do do
initTerminal initTerminal

424
diagrams/bus.drawio Normal file
View file

@ -0,0 +1,424 @@
<mxfile host="Electron" agent="Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) draw.io/24.1.0 Chrome/120.0.6099.109 Electron/28.1.0 Safari/537.36" modified="2025-04-18T01:25:45.614Z" etag="5eYXVj45-t033HnNz9vq" version="24.1.0" type="device">
<diagram name="simplified" id="y4uZzcGV7WDpy27g0Dv6">
<mxGraphModel dx="669" dy="748" grid="1" gridSize="10" guides="1" tooltips="1" connect="1" arrows="1" fold="1" page="1" pageScale="1" pageWidth="850" pageHeight="1100" math="0" shadow="0">
<root>
<mxCell id="0" />
<mxCell id="1" parent="0" />
<mxCell id="svE0qh3njN4fsUmnxisL-6" value="" style="rounded=1;whiteSpace=wrap;html=1;fillColor=#f8cecc;strokeColor=#b85450;labelBackgroundColor=default;fontSize=9;" parent="1" vertex="1">
<mxGeometry x="190" y="255" width="340" height="125" as="geometry" />
</mxCell>
<mxCell id="svE0qh3njN4fsUmnxisL-5" value="" style="rounded=1;whiteSpace=wrap;html=1;fillColor=#dae8fc;strokeColor=#6c8ebf;labelBackgroundColor=default;fontSize=9;" parent="1" vertex="1">
<mxGeometry x="65" y="470" width="360" height="125" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-235" value="Client 1" style="rounded=1;whiteSpace=wrap;html=1;labelBackgroundColor=default;" parent="1" vertex="1">
<mxGeometry x="80" y="80" width="200" height="40" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-236" value="submit&lt;div style=&quot;font-size: 9px;&quot;&gt;request&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="1" edge="1">
<mxGeometry x="-0.52" width="50" height="50" relative="1" as="geometry">
<mxPoint x="130" y="120" as="sourcePoint" />
<mxPoint x="130.00000000000006" y="380" as="targetPoint" />
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-237" value="&lt;div style=&quot;font-size: 9px;&quot;&gt;consume&lt;/div&gt;&lt;div style=&quot;font-size: 9px;&quot;&gt;response&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="1" edge="1">
<mxGeometry x="-0.0501" width="50" height="50" relative="1" as="geometry">
<mxPoint x="240" y="160" as="sourcePoint" />
<mxPoint x="239.68000000000006" y="120" as="targetPoint" />
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-238" value="" style="group;labelBackgroundColor=default;fontSize=9;" parent="1" vertex="1" connectable="0">
<mxGeometry x="100" y="380" width="40" height="80" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-239" value="" style="rounded=1;whiteSpace=wrap;html=1;labelBackgroundColor=default;fontSize=9;" parent="DDLsznhKMAXYVWb-8vYK-238" vertex="1">
<mxGeometry width="40" height="80" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-240" value="" style="endArrow=none;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="DDLsznhKMAXYVWb-8vYK-238" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="10" y="19.75" as="sourcePoint" />
<mxPoint x="30" y="19.75" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-241" value="" style="endArrow=none;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="DDLsznhKMAXYVWb-8vYK-238" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="10" y="39.5" as="sourcePoint" />
<mxPoint x="30" y="39.5" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-242" value="" style="endArrow=none;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="DDLsznhKMAXYVWb-8vYK-238" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="10" y="59.75" as="sourcePoint" />
<mxPoint x="30" y="59.75" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-243" value="" style="group;labelBackgroundColor=default;fontSize=9;" parent="1" vertex="1" connectable="0">
<mxGeometry x="220" y="160" width="40" height="80" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-244" value="" style="rounded=1;whiteSpace=wrap;html=1;labelBackgroundColor=default;fontSize=9;" parent="DDLsznhKMAXYVWb-8vYK-243" vertex="1">
<mxGeometry width="40" height="80" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-245" value="" style="endArrow=none;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="DDLsznhKMAXYVWb-8vYK-243" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="10" y="19.75" as="sourcePoint" />
<mxPoint x="30" y="19.75" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-246" value="" style="endArrow=none;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="DDLsznhKMAXYVWb-8vYK-243" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="10" y="39.5" as="sourcePoint" />
<mxPoint x="30" y="39.5" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-247" value="" style="endArrow=none;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="DDLsznhKMAXYVWb-8vYK-243" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="10" y="59.75" as="sourcePoint" />
<mxPoint x="30" y="59.75" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-270" value="Server 1" style="rounded=1;whiteSpace=wrap;html=1;labelBackgroundColor=default;fontSize=12;" parent="1" vertex="1">
<mxGeometry x="80" y="640" width="200" height="40" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-274" value="" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="1" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="239.90999999999994" y="270" as="sourcePoint" />
<mxPoint x="240" y="240" as="targetPoint" />
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-279" value="client1&lt;div&gt;arbiter&lt;/div&gt;" style="rounded=1;whiteSpace=wrap;html=1;labelBackgroundColor=default;fontSize=11;" parent="1" vertex="1">
<mxGeometry x="200" y="270" width="80" height="30" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-280" value="server1&lt;div&gt;router&lt;/div&gt;" style="rounded=1;whiteSpace=wrap;html=1;labelBackgroundColor=default;fontSize=11;" parent="1" vertex="1">
<mxGeometry x="200" y="340" width="80" height="30" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-281" value="request /&lt;div style=&quot;font-size: 9px;&quot;&gt;grant&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=#F8CECC;fontSize=9;startArrow=classic;startFill=1;" parent="1" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="214.89" y="340" as="sourcePoint" />
<mxPoint x="214.89" y="300" as="targetPoint" />
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-282" value="value" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=#F8CECC;fontSize=9;" parent="1" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="264.89" y="340" as="sourcePoint" />
<mxPoint x="264.89" y="300" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-283" value="" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="1" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="119.69000000000017" y="460" as="sourcePoint" />
<mxPoint x="119.68999999999994" y="480" as="targetPoint" />
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-284" value="client1&lt;div&gt;router&lt;/div&gt;" style="rounded=1;whiteSpace=wrap;html=1;labelBackgroundColor=default;fontSize=11;" parent="1" vertex="1">
<mxGeometry x="80" y="480" width="80" height="30" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-285" value="server1&lt;div&gt;arbiter&lt;/div&gt;" style="rounded=1;whiteSpace=wrap;html=1;labelBackgroundColor=default;fontSize=11;" parent="1" vertex="1">
<mxGeometry x="80" y="550" width="80" height="30" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-286" value="request /&lt;div style=&quot;font-size: 9px;&quot;&gt;grant&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=#DAE8FC;fontSize=9;startArrow=classic;startFill=1;" parent="1" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="94.88999999999999" y="510" as="sourcePoint" />
<mxPoint x="94.88999999999999" y="550" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-287" value="value" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=#DAE8FC;fontSize=9;" parent="1" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="144.89" y="510" as="sourcePoint" />
<mxPoint x="144.89" y="550" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-288" value="consume&lt;div style=&quot;font-size: 9px;&quot;&gt;request&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="1" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="119.67999999999995" y="580" as="sourcePoint" />
<mxPoint x="119.67999999999995" y="640" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-289" value="&lt;div style=&quot;font-size: 9px;&quot;&gt;&lt;br style=&quot;font-size: 9px;&quot;&gt;&lt;/div&gt;&lt;div style=&quot;font-size: 9px;&quot;&gt;submit&lt;/div&gt;&lt;div style=&quot;font-size: 9px;&quot;&gt;response&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="1" edge="1">
<mxGeometry x="0.7037" width="50" height="50" relative="1" as="geometry">
<mxPoint x="250" y="640" as="sourcePoint" />
<mxPoint x="250" y="370" as="targetPoint" />
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-290" value="Client 2" style="rounded=1;whiteSpace=wrap;html=1;labelBackgroundColor=default;" parent="1" vertex="1">
<mxGeometry x="320" y="80" width="200" height="40" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-291" value="submit&lt;div style=&quot;font-size: 9px;&quot;&gt;request&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="1" edge="1">
<mxGeometry x="-0.2" width="50" height="50" relative="1" as="geometry">
<mxPoint x="370" y="120" as="sourcePoint" />
<mxPoint x="370.00000000000006" y="380" as="targetPoint" />
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-292" value="&lt;div style=&quot;font-size: 9px;&quot;&gt;consume&lt;/div&gt;&lt;div style=&quot;font-size: 9px;&quot;&gt;response&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="1" edge="1">
<mxGeometry x="-0.0501" width="50" height="50" relative="1" as="geometry">
<mxPoint x="480" y="160" as="sourcePoint" />
<mxPoint x="479.68000000000006" y="120" as="targetPoint" />
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-293" value="" style="group;labelBackgroundColor=default;fontSize=9;" parent="1" vertex="1" connectable="0">
<mxGeometry x="340" y="380" width="40" height="80" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-294" value="" style="rounded=1;whiteSpace=wrap;html=1;labelBackgroundColor=default;fontSize=9;" parent="DDLsznhKMAXYVWb-8vYK-293" vertex="1">
<mxGeometry width="40" height="80" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-295" value="" style="endArrow=none;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="DDLsznhKMAXYVWb-8vYK-293" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="10" y="19.75" as="sourcePoint" />
<mxPoint x="30" y="19.75" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-296" value="" style="endArrow=none;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="DDLsznhKMAXYVWb-8vYK-293" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="10" y="39.5" as="sourcePoint" />
<mxPoint x="30" y="39.5" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-297" value="" style="endArrow=none;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="DDLsznhKMAXYVWb-8vYK-293" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="10" y="59.75" as="sourcePoint" />
<mxPoint x="30" y="59.75" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-298" value="" style="group;labelBackgroundColor=default;fontSize=9;" parent="1" vertex="1" connectable="0">
<mxGeometry x="460" y="160" width="40" height="80" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-299" value="" style="rounded=1;whiteSpace=wrap;html=1;labelBackgroundColor=default;fontSize=9;" parent="DDLsznhKMAXYVWb-8vYK-298" vertex="1">
<mxGeometry width="40" height="80" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-300" value="" style="endArrow=none;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="DDLsznhKMAXYVWb-8vYK-298" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="10" y="19.75" as="sourcePoint" />
<mxPoint x="30" y="19.75" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-301" value="" style="endArrow=none;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="DDLsznhKMAXYVWb-8vYK-298" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="10" y="39.5" as="sourcePoint" />
<mxPoint x="30" y="39.5" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-302" value="" style="endArrow=none;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="DDLsznhKMAXYVWb-8vYK-298" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="10" y="59.75" as="sourcePoint" />
<mxPoint x="30" y="59.75" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-303" value="Server 2" style="rounded=1;whiteSpace=wrap;html=1;labelBackgroundColor=default;fontSize=12;" parent="1" vertex="1">
<mxGeometry x="320" y="640" width="200" height="40" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-304" value="" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="1" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="479.90999999999997" y="270" as="sourcePoint" />
<mxPoint x="479.9100000000001" y="240" as="targetPoint" />
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-305" value="client2&lt;div&gt;arbiter&lt;/div&gt;" style="rounded=1;whiteSpace=wrap;html=1;labelBackgroundColor=default;fontSize=11;" parent="1" vertex="1">
<mxGeometry x="440" y="270" width="80" height="30" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-306" value="server2&lt;div&gt;router&lt;/div&gt;" style="rounded=1;whiteSpace=wrap;html=1;labelBackgroundColor=default;fontSize=11;" parent="1" vertex="1">
<mxGeometry x="440" y="340" width="80" height="30" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-307" value="request /&lt;div style=&quot;font-size: 9px;&quot;&gt;grant&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=#F8CECC;fontSize=9;startArrow=classic;startFill=1;" parent="1" edge="1">
<mxGeometry x="0.0549" y="-10" width="50" height="50" relative="1" as="geometry">
<mxPoint x="459.9999999999999" y="340" as="sourcePoint" />
<mxPoint x="459.9999999999999" y="300" as="targetPoint" />
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-308" value="value" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=#F8CECC;fontSize=9;" parent="1" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="504.8899999999999" y="340" as="sourcePoint" />
<mxPoint x="504.8899999999999" y="300" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-309" value="" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="1" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="359.69000000000005" y="460" as="sourcePoint" />
<mxPoint x="359.69000000000005" y="480" as="targetPoint" />
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-310" value="client2&lt;div&gt;router&lt;/div&gt;" style="rounded=1;whiteSpace=wrap;html=1;labelBackgroundColor=default;fontSize=11;" parent="1" vertex="1">
<mxGeometry x="320" y="480" width="80" height="30" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-311" value="server2&lt;div&gt;arbiter&lt;/div&gt;" style="rounded=1;whiteSpace=wrap;html=1;labelBackgroundColor=default;fontSize=11;" parent="1" vertex="1">
<mxGeometry x="320" y="550" width="80" height="30" as="geometry" />
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-312" value="request /&lt;div style=&quot;font-size: 9px;&quot;&gt;grant&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=#DAE8FC;fontSize=9;startArrow=classic;startFill=1;" parent="1" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="334.8899999999999" y="510" as="sourcePoint" />
<mxPoint x="334.8899999999999" y="550" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-313" value="value" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=#DAE8FC;fontSize=9;" parent="1" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="384.8899999999999" y="510" as="sourcePoint" />
<mxPoint x="384.8899999999999" y="550" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-314" value="consume&lt;div style=&quot;font-size: 9px;&quot;&gt;request&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="1" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="359.67999999999984" y="580" as="sourcePoint" />
<mxPoint x="359.67999999999984" y="640" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-315" value="&lt;div style=&quot;font-size: 9px;&quot;&gt;&lt;br style=&quot;font-size: 9px;&quot;&gt;&lt;/div&gt;&lt;div style=&quot;font-size: 9px;&quot;&gt;submit&lt;/div&gt;&lt;div style=&quot;font-size: 9px;&quot;&gt;response&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=default;labelBorderColor=none;textShadow=0;jumpStyle=gap;fontSize=9;" parent="1" edge="1">
<mxGeometry x="0.7037" width="50" height="50" relative="1" as="geometry">
<mxPoint x="479.67999999999984" y="640" as="sourcePoint" />
<mxPoint x="479.67999999999984" y="370" as="targetPoint" />
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-316" value="request /&lt;div style=&quot;font-size: 9px;&quot;&gt;&amp;nbsp;grant&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;jumpStyle=gap;labelBackgroundColor=#DAE8FC;fontSize=9;startArrow=classic;startFill=1;" parent="1" edge="1">
<mxGeometry x="-0.6481" width="50" height="50" relative="1" as="geometry">
<mxPoint x="160" y="500" as="sourcePoint" />
<mxPoint x="320" y="555.32" as="targetPoint" />
<Array as="points">
<mxPoint x="180" y="500" />
<mxPoint x="180" y="555" />
</Array>
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-317" value="value" style="endArrow=classic;html=1;rounded=0;jumpStyle=gap;labelBackgroundColor=#DAE8FC;fontSize=9;" parent="1" edge="1">
<mxGeometry x="0.7414" width="50" height="50" relative="1" as="geometry">
<mxPoint x="160" y="490" as="sourcePoint" />
<mxPoint x="320" y="562" as="targetPoint" />
<Array as="points">
<mxPoint x="260" y="490" />
<mxPoint x="260" y="562" />
</Array>
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-318" value="request /&lt;div style=&quot;font-size: 9px;&quot;&gt;grant&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;jumpStyle=gap;labelBackgroundColor=#DAE8FC;fontSize=9;startArrow=classic;startFill=1;" parent="1" edge="1">
<mxGeometry x="-0.7" y="-15" width="50" height="50" relative="1" as="geometry">
<mxPoint x="320" y="500" as="sourcePoint" />
<mxPoint x="160" y="560" as="targetPoint" />
<Array as="points">
<mxPoint x="220" y="500" />
<mxPoint x="220" y="560" />
</Array>
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="DDLsznhKMAXYVWb-8vYK-320" value="value" style="endArrow=classic;html=1;rounded=0;jumpStyle=gap;labelBackgroundColor=#DAE8FC;fontSize=9;" parent="1" edge="1">
<mxGeometry x="0.6444" width="50" height="50" relative="1" as="geometry">
<mxPoint x="320" y="505" as="sourcePoint" />
<mxPoint x="160" y="570" as="targetPoint" />
<Array as="points">
<mxPoint x="240" y="505" />
<mxPoint x="240" y="570" />
</Array>
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="x_lcP1lRQqL86m_3BT7G-6" value="value" style="endArrow=classic;html=1;rounded=0;jumpStyle=gap;labelBackgroundColor=#F8CECC;fontSize=9;" parent="1" edge="1">
<mxGeometry x="-0.8667" width="50" height="50" relative="1" as="geometry">
<mxPoint x="440" y="360" as="sourcePoint" />
<mxPoint x="280" y="280" as="targetPoint" />
<Array as="points">
<mxPoint x="380" y="360" />
<mxPoint x="380" y="280" />
</Array>
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="x_lcP1lRQqL86m_3BT7G-7" value="request /&lt;div style=&quot;font-size: 9px;&quot;&gt;grant&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;jumpStyle=gap;labelBackgroundColor=#F8CECC;fontSize=9;startArrow=classic;startFill=1;" parent="1" edge="1">
<mxGeometry x="-0.2727" y="10" width="50" height="50" relative="1" as="geometry">
<mxPoint x="280" y="350" as="sourcePoint" />
<mxPoint x="440" y="290" as="targetPoint" />
<Array as="points">
<mxPoint x="320" y="350" />
<mxPoint x="320" y="290" />
</Array>
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="x_lcP1lRQqL86m_3BT7G-8" value="value" style="endArrow=classic;html=1;rounded=0;jumpStyle=gap;labelBackgroundColor=#F8CECC;fontSize=9;" parent="1" edge="1">
<mxGeometry x="-0.7333" width="50" height="50" relative="1" as="geometry">
<mxPoint x="280" y="360" as="sourcePoint" />
<mxPoint x="440" y="295" as="targetPoint" />
<Array as="points">
<mxPoint x="350" y="360" />
<mxPoint x="350" y="295" />
</Array>
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="svE0qh3njN4fsUmnxisL-1" value="bypass&amp;nbsp;&lt;div style=&quot;font-size: 9px;&quot;&gt;response&lt;div style=&quot;font-size: 9px;&quot;&gt;value&lt;/div&gt;&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="1" edge="1">
<mxGeometry x="0.288" y="-5" width="50" height="50" relative="1" as="geometry">
<mxPoint x="150" y="480" as="sourcePoint" />
<mxPoint x="200" y="280" as="targetPoint" />
<Array as="points">
<mxPoint x="150" y="280" />
</Array>
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="svE0qh3njN4fsUmnxisL-2" value="bypass&lt;div style=&quot;font-size: 9px;&quot;&gt;response&lt;/div&gt;&lt;div style=&quot;font-size: 9px;&quot;&gt;value&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;jumpStyle=gap;labelBackgroundColor=default;fontSize=9;" parent="1" edge="1">
<mxGeometry x="0.6774" y="14" width="50" height="50" relative="1" as="geometry">
<mxPoint x="390" y="480" as="sourcePoint" />
<mxPoint x="450" y="270" as="targetPoint" />
<Array as="points">
<mxPoint x="390" y="250" />
<mxPoint x="450" y="250" />
</Array>
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="Bx_jwq7m4Ip0YGT7EWWs-1" value="request/&lt;div style=&quot;font-size: 9px;&quot;&gt;grant&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;jumpStyle=gap;labelBorderColor=none;labelBackgroundColor=default;fontSize=9;startArrow=classic;startFill=1;" parent="1" edge="1">
<mxGeometry x="-0.2" y="-10" width="50" height="50" relative="1" as="geometry">
<mxPoint x="400" y="490" as="sourcePoint" />
<mxPoint x="440" y="280" as="targetPoint" />
<Array as="points">
<mxPoint x="410" y="490" />
<mxPoint x="410" y="280" />
</Array>
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="Bx_jwq7m4Ip0YGT7EWWs-2" value="request/&lt;div style=&quot;font-size: 9px;&quot;&gt;grant&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;fontSize=9;startArrow=classic;startFill=1;" parent="1" edge="1">
<mxGeometry x="-0.3617" width="50" height="50" relative="1" as="geometry">
<mxPoint x="160" y="485" as="sourcePoint" />
<mxPoint x="200" y="290" as="targetPoint" />
<Array as="points">
<mxPoint x="180" y="485" />
<mxPoint x="180" y="290" />
</Array>
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="svE0qh3njN4fsUmnxisL-3" value="tag" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=default;fontSize=9;" parent="1" edge="1">
<mxGeometry width="50" height="50" relative="1" as="geometry">
<mxPoint x="90" y="480" as="sourcePoint" />
<mxPoint x="90" y="120" as="targetPoint" />
</mxGeometry>
</mxCell>
<mxCell id="UAsplQkTO5Z3O69I-9GS-1" value="tag" style="endArrow=classic;html=1;rounded=0;labelBackgroundColor=#FFFFFF;fontSize=9;jumpStyle=gap;" edge="1" parent="1">
<mxGeometry x="0.3889" width="50" height="50" relative="1" as="geometry">
<mxPoint x="330" y="480" as="sourcePoint" />
<mxPoint x="330" y="120" as="targetPoint" />
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
<mxCell id="x_lcP1lRQqL86m_3BT7G-5" value="&lt;font style=&quot;font-size: 9px;&quot;&gt;request /&amp;nbsp;&lt;/font&gt;&lt;div&gt;grant&lt;/div&gt;" style="endArrow=classic;html=1;rounded=0;jumpStyle=gap;labelBackgroundColor=#F8CECC;fontSize=9;startArrow=classic;startFill=1;" parent="1" edge="1">
<mxGeometry x="-0.6132" y="-10" width="50" height="50" relative="1" as="geometry">
<mxPoint x="440" y="345.32000000000005" as="sourcePoint" />
<mxPoint x="279" y="272" as="targetPoint" />
<Array as="points">
<mxPoint x="420" y="345.32000000000005" />
<mxPoint x="420" y="272" />
</Array>
<mxPoint as="offset" />
</mxGeometry>
</mxCell>
</root>
</mxGraphModel>
</diagram>
</mxfile>