re-work original osmo-bts with support for sysmocom femtobts
This code re-works osmo-bts to add support for the upcoming sysmocom BTS. It also tries to add some level of abstraction between the generic part of a BTS (A-bis, RSL, OML, data structures, paging scheduling, BCCH/AGCH scheduling, etc.) and the actual hardware-specific bits. The hardware-specific bits are currently only implemented for the sysmocom femtobts, but should be (re-)added for osmocom-bb, as well as a virtual BTS for simulation purpose later. The sysmocom bts specific parts require hardware-specific header files which are (at least currently) not publicly distributed.
This commit is contained in:
parent
8e47fb89bf
commit
c6b4c87e5d
|
@ -0,0 +1,20 @@
|
|||
*.o
|
||||
*.a
|
||||
Makefile.in
|
||||
Makefile
|
||||
.deps
|
||||
|
||||
aclocal.m4
|
||||
autom4te.cache
|
||||
config.log
|
||||
config.status
|
||||
configure
|
||||
depcomp
|
||||
install-sh
|
||||
missing
|
||||
core
|
||||
core.*
|
||||
|
||||
src/osmo-bts-sysmo/l1fwd-proxy
|
||||
src/osmo-bts-sysmo/sysmobts
|
||||
src/osmo-bts-sysmo/sysmobts-remote
|
|
@ -0,0 +1,661 @@
|
|||
GNU AFFERO GENERAL PUBLIC LICENSE
|
||||
Version 3, 19 November 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The GNU Affero General Public License is a free, copyleft license for
|
||||
software and other kinds of works, specifically designed to ensure
|
||||
cooperation with the community in the case of network server software.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
our General Public Licenses are 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.
|
||||
|
||||
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.
|
||||
|
||||
Developers that use our General Public Licenses protect your rights
|
||||
with two steps: (1) assert copyright on the software, and (2) offer
|
||||
you this License which gives you legal permission to copy, distribute
|
||||
and/or modify the software.
|
||||
|
||||
A secondary benefit of defending all users' freedom is that
|
||||
improvements made in alternate versions of the program, if they
|
||||
receive widespread use, become available for other developers to
|
||||
incorporate. Many developers of free software are heartened and
|
||||
encouraged by the resulting cooperation. However, in the case of
|
||||
software used on network servers, this result may fail to come about.
|
||||
The GNU General Public License permits making a modified version and
|
||||
letting the public access it on a server without ever releasing its
|
||||
source code to the public.
|
||||
|
||||
The GNU Affero General Public License is designed specifically to
|
||||
ensure that, in such cases, the modified source code becomes available
|
||||
to the community. It requires the operator of a network server to
|
||||
provide the source code of the modified version running there to the
|
||||
users of that server. Therefore, public use of a modified version, on
|
||||
a publicly accessible server, gives the public access to the source
|
||||
code of the modified version.
|
||||
|
||||
An older license, called the Affero General Public License and
|
||||
published by Affero, was designed to accomplish similar goals. This is
|
||||
a different license, not a version of the Affero GPL, but Affero has
|
||||
released a new version of the Affero GPL which permits relicensing under
|
||||
this license.
|
||||
|
||||
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 Affero 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. Remote Network Interaction; Use with the GNU General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, if you modify the
|
||||
Program, your modified version must prominently offer all users
|
||||
interacting with it remotely through a computer network (if your version
|
||||
supports such interaction) an opportunity to receive the Corresponding
|
||||
Source of your version by providing access to the Corresponding Source
|
||||
from a network server at no charge, through some standard or customary
|
||||
means of facilitating copying of software. This Corresponding Source
|
||||
shall include the Corresponding Source for any work covered by version 3
|
||||
of the GNU General Public License that is incorporated pursuant to the
|
||||
following paragraph.
|
||||
|
||||
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 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 work with which it is combined will remain governed by version
|
||||
3 of the GNU General Public License.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU Affero 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 Affero 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 Affero 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 Affero 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
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
state the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the program's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU Affero General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU Affero General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Affero General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If your software can interact with users remotely through a computer
|
||||
network, you should also make sure that it provides a way for users to
|
||||
get its source. For example, if your program is a web application, its
|
||||
interface could display a "Source" link that leads users to an archive
|
||||
of the code. There are many ways you could offer source, and different
|
||||
solutions will be better for different programs; see section 13 for the
|
||||
specific requirements.
|
||||
|
||||
You should also get your employer (if you work as a programmer) or school,
|
||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||
For more information on this, and how to apply and follow the GNU AGPL, see
|
||||
<http://www.gnu.org/licenses/>.
|
|
@ -15,6 +15,7 @@ AC_PROG_RANLIB
|
|||
dnl checks for libraries
|
||||
PKG_CHECK_MODULES(LIBOSMOCORE, libosmocore)
|
||||
PKG_CHECK_MODULES(LIBOSMOVTY, libosmovty)
|
||||
PKG_CHECK_MODULES(LIBOSMOGSM, libosmogsm)
|
||||
|
||||
dnl checks for header files
|
||||
AC_HEADER_STDC
|
||||
|
@ -24,6 +25,7 @@ dnl Checks for typedefs, structures and compiler characteristics
|
|||
AC_OUTPUT(
|
||||
src/Makefile
|
||||
src/common/Makefile
|
||||
src/osmo-bts-sysmo/Makefile
|
||||
src/osmo-bts-bb/Makefile
|
||||
include/Makefile
|
||||
include/osmo-bts/Makefile
|
||||
|
|
|
@ -0,0 +1 @@
|
|||
../osmo-bts/gsm_data.h
|
|
@ -1 +1 @@
|
|||
noinst_HEADERS = bts.h abis.h rsl.h oml.h support.h rtp.h logging.h
|
||||
noinst_HEADERS = abis.h bts.h bts_model.h gsm_data.h logging.h oml.h paging.h rsl.h rtp.h signal.h vty.h
|
||||
|
|
|
@ -5,13 +5,15 @@
|
|||
#include <osmocom/core/timer.h>
|
||||
#include <osmocom/gsm/protocol/ipaccess.h>
|
||||
|
||||
#include <osmo-bts/gsm_data.h>
|
||||
|
||||
#define OML_RETRY_TIMER 5
|
||||
#define OML_PING_TIMER 20
|
||||
|
||||
struct ipabis_link {
|
||||
int state;
|
||||
struct osmocom_bts *bts; /* set, if OML link */
|
||||
struct osmobts_trx *trx; /* set, if RSL link */
|
||||
struct gsm_bts *bts; /* set, if OML link */
|
||||
struct gsm_bts_trx *trx; /* set, if RSL link */
|
||||
struct osmo_fd bfd;
|
||||
struct osmo_timer_list timer;
|
||||
struct msgb *rx_msg;
|
||||
|
@ -33,4 +35,8 @@ void abis_push_ipa(struct msgb *msg, uint8_t proto);
|
|||
int abis_open(struct ipabis_link *link, uint32_t ip);
|
||||
void abis_close(struct ipabis_link *link);
|
||||
|
||||
|
||||
int abis_oml_sendmsg(struct msgb *msg);
|
||||
int abis_rsl_sendmsg(struct msgb *msg);
|
||||
|
||||
#endif /* _ABIS_H */
|
||||
|
|
|
@ -1,132 +1,29 @@
|
|||
#ifndef _BTS_H
|
||||
#define _BTS_H
|
||||
|
||||
#define BTS_SI_NUM 23 /* MUAR match the entries in BTS_SI_LIST */
|
||||
#include <osmo-bts/gsm_data.h>
|
||||
|
||||
#define BTS_SI_LIST { \
|
||||
RSL_SYSTEM_INFO_8, \
|
||||
RSL_SYSTEM_INFO_1, \
|
||||
RSL_SYSTEM_INFO_2, \
|
||||
RSL_SYSTEM_INFO_3, \
|
||||
RSL_SYSTEM_INFO_4, \
|
||||
RSL_SYSTEM_INFO_5, \
|
||||
RSL_SYSTEM_INFO_6, \
|
||||
RSL_SYSTEM_INFO_7, \
|
||||
RSL_SYSTEM_INFO_16, \
|
||||
RSL_SYSTEM_INFO_17, \
|
||||
RSL_SYSTEM_INFO_2bis, \
|
||||
RSL_SYSTEM_INFO_2ter, \
|
||||
RSL_SYSTEM_INFO_5bis, \
|
||||
RSL_SYSTEM_INFO_5ter, \
|
||||
RSL_SYSTEM_INFO_10, \
|
||||
REL_EXT_MEAS_ORDER, \
|
||||
RSL_MEAS_INFO, \
|
||||
RSL_SYSTEM_INFO_13, \
|
||||
RSL_SYSTEM_INFO_2quater, \
|
||||
RSL_SYSTEM_INFO_9, \
|
||||
RSL_SYSTEM_INFO_18, \
|
||||
RSL_SYSTEM_INFO_19, \
|
||||
RSL_SYSTEM_INFO_20, \
|
||||
}
|
||||
extern void *tall_bts_ctx;
|
||||
|
||||
#define BTS_SI_NAME char *bts_si_name[] = { \
|
||||
"RSL_SYSTEM_INFO_8", \
|
||||
"RSL_SYSTEM_INFO_1", \
|
||||
"RSL_SYSTEM_INFO_2", \
|
||||
"RSL_SYSTEM_INFO_3", \
|
||||
"RSL_SYSTEM_INFO_4", \
|
||||
"RSL_SYSTEM_INFO_5", \
|
||||
"RSL_SYSTEM_INFO_6", \
|
||||
"RSL_SYSTEM_INFO_7", \
|
||||
"RSL_SYSTEM_INFO_16", \
|
||||
"RSL_SYSTEM_INFO_17", \
|
||||
"RSL_SYSTEM_INFO_2bis", \
|
||||
"RSL_SYSTEM_INFO_2ter", \
|
||||
"RSL_SYSTEM_INFO_5bis", \
|
||||
"RSL_SYSTEM_INFO_5ter", \
|
||||
"RSL_SYSTEM_INFO_10", \
|
||||
"REL_EXT_MEAS_ORDER", \
|
||||
"RSL_MEAS_INFO", \
|
||||
"RSL_SYSTEM_INFO_13", \
|
||||
"RSL_SYSTEM_INFO_2quater", \
|
||||
"RSL_SYSTEM_INFO_9", \
|
||||
"RSL_SYSTEM_INFO_18", \
|
||||
"RSL_SYSTEM_INFO_19", \
|
||||
"RSL_SYSTEM_INFO_20", \
|
||||
}
|
||||
int bts_init(struct gsm_bts *bts);
|
||||
|
||||
#define BTS_SI_USE 1
|
||||
#define BTS_SI_NEW 2
|
||||
|
||||
/* store sysinfos of a BTS */
|
||||
struct osmobts_sysinfo {
|
||||
uint8_t flags[BTS_SI_NUM];
|
||||
uint8_t si[BTS_SI_NUM][23];
|
||||
struct osmo_timer_list timer;
|
||||
};
|
||||
|
||||
struct osmobts_slot;
|
||||
|
||||
/* one physical radio */
|
||||
struct osmobts_ms {
|
||||
struct llist_head entry;
|
||||
struct osmobts_trx *trx;
|
||||
};
|
||||
|
||||
/* one logical channel instance */
|
||||
struct osmobts_lchan {
|
||||
struct osmobts_slot *slot;
|
||||
uint8_t lchan_nr;
|
||||
uint8_t chan_nr; /* CBITS+TN */
|
||||
struct lapdm_channel lapdm_channel;
|
||||
struct osmobts_rtp rtp;
|
||||
};
|
||||
|
||||
/* one timeslot instance */
|
||||
struct osmobts_slot {
|
||||
struct osmobts_trx *trx;
|
||||
uint8_t slot_nr;
|
||||
uint8_t acch_type; /* TS 08.58 9.3.1 (bits 8..4) */
|
||||
uint8_t has_bcch;
|
||||
uint8_t chan_comb;
|
||||
struct osmobts_lchan *lchan[8];
|
||||
struct osmobts_ms *tx_ms, *rx_ms;
|
||||
};
|
||||
|
||||
/* one TRX instance */
|
||||
struct osmobts_trx {
|
||||
struct osmocom_bts *bts;
|
||||
uint8_t trx_nr;
|
||||
struct osmobts_slot slot[8];
|
||||
struct llist_head ms_list;
|
||||
struct ipabis_link link;
|
||||
struct osmobts_sysinfo si;
|
||||
uint8_t rf_red;
|
||||
uint16_t arfcn_list[128];
|
||||
int arfcn_num;
|
||||
};
|
||||
|
||||
/* the BTS instance */
|
||||
struct osmocom_bts {
|
||||
char *id;
|
||||
uint8_t num_trx;
|
||||
struct osmobts_trx *trx[8];
|
||||
struct ipabis_link link;
|
||||
uint8_t max_ta;
|
||||
uint16_t bcch_arfcn;
|
||||
uint8_t bcc, ncc;
|
||||
uint16_t start_time;
|
||||
};
|
||||
|
||||
struct osmocom_bts *create_bts(uint8_t num_trx, char *id);
|
||||
int create_ms(struct osmobts_trx *trx, int maskc, uint8_t *maskv_tx,
|
||||
struct gsm_bts *create_bts(uint8_t num_trx, char *id);
|
||||
int create_ms(struct gsm_bts_trx *trx, int maskc, uint8_t *maskv_tx,
|
||||
uint8_t *maskv_rx);
|
||||
void destroy_bts(struct osmocom_bts *bts);
|
||||
int work_bts(struct osmocom_bts *bts);
|
||||
int bts_link_estab(struct osmocom_bts *bts);
|
||||
int trx_link_estab(struct osmobts_trx *trx);
|
||||
void destroy_bts(struct gsm_bts *bts);
|
||||
int work_bts(struct gsm_bts *bts);
|
||||
int bts_link_estab(struct gsm_bts *bts);
|
||||
int trx_link_estab(struct gsm_bts_trx *trx);
|
||||
void bts_new_si(void *arg);
|
||||
void bts_setup_slot(struct osmobts_slot *slot, uint8_t comb);
|
||||
void bts_setup_slot(struct gsm_bts_trx_ts *slot, uint8_t comb);
|
||||
|
||||
int lchan_init_lapdm(struct gsm_lchan *lchan);
|
||||
|
||||
int bts_agch_enqueue(struct gsm_bts *bts, struct msgb *msg);
|
||||
struct msgb *bts_agch_dequeue(struct gsm_bts *bts);
|
||||
|
||||
uint8_t *bts_sysinfo_get(struct gsm_bts *bts, struct gsm_time *g_time);
|
||||
uint8_t *lchan_sacch_get(struct gsm_lchan *lchan, struct gsm_time *g_time);
|
||||
|
||||
#endif /* _BTS_H */
|
||||
|
||||
|
|
|
@ -0,0 +1,33 @@
|
|||
#ifndef BTS_MODEL_H
|
||||
#define BTS_MODEL_H
|
||||
|
||||
#include <stdint.h>
|
||||
|
||||
#include <osmocom/gsm/tlv.h>
|
||||
#include <osmocom/gsm/gsm_utils.h>
|
||||
|
||||
#include <osmo-bts/gsm_data.h>
|
||||
|
||||
/* BTS model specific functions needed by the common code */
|
||||
|
||||
int bts_model_init(struct gsm_bts *bts);
|
||||
|
||||
struct gsm_time *bts_model_get_time(struct gsm_bts *bts);
|
||||
|
||||
int bts_model_check_oml(struct gsm_bts *bts, uint8_t msg_type,
|
||||
struct tlv_parsed *old_attr, struct tlv_parsed *new_attr,
|
||||
void *obj);
|
||||
|
||||
int bts_model_apply_oml(struct gsm_bts *bts, struct msgb *msg,
|
||||
struct tlv_parsed *new_attr, void *obj);
|
||||
|
||||
int bts_model_opstart(struct gsm_bts *bts, struct gsm_abis_mo *mo,
|
||||
void *obj);
|
||||
|
||||
int bts_model_chg_adm_state(struct gsm_bts *bts, struct gsm_abis_mo *mo,
|
||||
void *obj, uint8_t adm_state);
|
||||
|
||||
int bts_model_rsl_chan_act(struct gsm_lchan *lchan, struct tlv_parsed *tp);
|
||||
int bts_model_rsl_chan_rel(struct gsm_lchan *lchan);
|
||||
|
||||
#endif
|
|
@ -0,0 +1,57 @@
|
|||
#ifndef _GSM_DATA_H
|
||||
#define _GSM_DATA_H
|
||||
|
||||
#include <osmocom/core/timer.h>
|
||||
#include <osmocom/core/linuxlist.h>
|
||||
#include <osmocom/gsm/lapdm.h>
|
||||
|
||||
#include <osmo-bts/paging.h>
|
||||
|
||||
struct gsm_network {
|
||||
|
||||
};
|
||||
|
||||
/* data structure for BTS related data specific to the BTS role */
|
||||
struct gsm_bts_role_bts {
|
||||
struct {
|
||||
/* Interference Boundaries for OML */
|
||||
int16_t boundary[6];
|
||||
uint8_t intave;
|
||||
} interference;
|
||||
unsigned int t200_ms[7];
|
||||
unsigned int t3105_ms;
|
||||
struct {
|
||||
uint8_t overload_period;
|
||||
struct {
|
||||
/* Input parameters from OML */
|
||||
uint8_t load_ind_thresh; /* percent */
|
||||
uint8_t load_ind_period; /* seconds */
|
||||
/* Internal data */
|
||||
struct osmo_timer_list timer;
|
||||
unsigned int pch_total;
|
||||
unsigned int pch_used;
|
||||
} ccch;
|
||||
struct {
|
||||
/* Input parameters from OML */
|
||||
int16_t busy_thresh; /* in dBm */
|
||||
uint16_t averaging_slots;
|
||||
} rach;
|
||||
} load;
|
||||
uint8_t ny1;
|
||||
uint8_t max_ta;
|
||||
struct llist_head agch_queue;
|
||||
struct paging_state *paging_state;
|
||||
};
|
||||
|
||||
#define bts_role_bts(x) ((struct gsm_bts_role_bts *)(x)->role)
|
||||
|
||||
#include "../../openbsc/openbsc/include/openbsc/gsm_data_shared.h"
|
||||
|
||||
struct femtol1_hdl;
|
||||
|
||||
static inline struct femtol1_hdl *trx_femtol1_hdl(struct gsm_bts_trx *trx)
|
||||
{
|
||||
return trx->role_bts.l1h;
|
||||
}
|
||||
|
||||
#endif /* _GSM_DATA_H */
|
|
@ -9,19 +9,17 @@ enum {
|
|||
DOML,
|
||||
DRLL,
|
||||
DRR,
|
||||
DMM,
|
||||
DCC,
|
||||
DSMS,
|
||||
DMEAS,
|
||||
DPAG,
|
||||
DLAPDM,
|
||||
DL1C,
|
||||
DSAP,
|
||||
DL1P,
|
||||
DABIS,
|
||||
DRTP,
|
||||
DSUM,
|
||||
};
|
||||
|
||||
extern const struct log_info log_info;
|
||||
extern const struct log_info bts_log_info;
|
||||
|
||||
int bts_log_init(const char *category_mask);
|
||||
|
||||
#endif /* _LOGGING_H */
|
||||
|
|
|
@ -1,9 +1,21 @@
|
|||
#ifndef _OML_H
|
||||
#define _OML_H
|
||||
|
||||
int down_oml(struct osmocom_bts *bts, struct msgb *msg);
|
||||
int oml_tx_sw_act_rep(struct ipabis_link *link, uint8_t obj_class, uint8_t bts_nr, uint8_t trx_nr, uint8_t ts_nr);
|
||||
int oml_tx_state_changed(struct ipabis_link *link, uint8_t op_state, uint8_t avail_status, uint8_t obj_class, uint8_t bts_nr, uint8_t trx_nr, uint8_t ts_nr);
|
||||
int oml_init(void);
|
||||
int down_oml(struct gsm_bts *bts, struct msgb *msg);
|
||||
|
||||
struct msgb *oml_msgb_alloc(void);
|
||||
int oml_send_msg(struct msgb *msg, int is_mauf);
|
||||
int oml_mo_send_msg(struct gsm_abis_mo *mo, struct msgb *msg, uint8_t msg_type);
|
||||
int oml_mo_opstart_ack(struct gsm_abis_mo *mo);
|
||||
int oml_mo_opstart_nack(struct gsm_abis_mo *mo, uint8_t nack_cause);
|
||||
int oml_mo_state_chg(struct gsm_abis_mo *mo, int op_state, int avail_state);
|
||||
|
||||
int oml_mo_tx_sw_act_rep(struct gsm_abis_mo *mo);
|
||||
|
||||
int oml_fom_ack_nack(struct msgb *old_msg, uint8_t cause);
|
||||
|
||||
int oml_mo_fom_ack_nack(struct gsm_abis_mo *mo, uint8_t orig_msg_type,
|
||||
uint8_t cause);
|
||||
|
||||
#endif // _OML_H */
|
||||
|
||||
|
|
|
@ -0,0 +1,24 @@
|
|||
#ifndef OSMO_BTS_PAGING_H
|
||||
#define OSMO_BTS_PAGING_H
|
||||
|
||||
#include <stdint.h>
|
||||
#include <osmocom/gsm/gsm_utils.h>
|
||||
#include <osmocom/gsm/protocol/gsm_04_08.h>
|
||||
|
||||
struct paging_state;
|
||||
|
||||
/* initialize paging code */
|
||||
struct paging_state *paging_init(void *ctx, unsigned int num_paging_max,
|
||||
unsigned int paging_lifetime);
|
||||
|
||||
/* update with new SYSTEM INFORMATION parameters */
|
||||
int paging_si_update(struct paging_state *ps, struct gsm48_control_channel_descr *chan_desc);
|
||||
|
||||
/* Add an identity to the paging queue */
|
||||
int paging_add_identity(struct paging_state *ps, uint8_t paging_group,
|
||||
const uint8_t *identity_lv, uint8_t chan_needed);
|
||||
|
||||
/* generate paging message for given gsm time */
|
||||
int paging_gen_msg(struct paging_state *ps, uint8_t *out_buf, struct gsm_time *gt);
|
||||
|
||||
#endif
|
|
@ -1,12 +1,21 @@
|
|||
#ifndef _RSL_H
|
||||
#define _RSL_H
|
||||
|
||||
int down_rsl(struct osmobts_trx *trx, struct msgb *msg);
|
||||
int rsl_tx_rf_res(struct osmobts_trx *trx);
|
||||
int rsl_tx_chan_rqd(struct osmobts_trx *trx);
|
||||
int rsl_tx_est_ind(struct osmobts_lchan *lchan, uint8_t link_id, uint8_t *data, int len);
|
||||
int rsl_tx_rll(struct msgb *msg, struct osmol2_entity *l2_entity);
|
||||
int rsl_tx_ipac_dlcx_ind(struct osmobts_lchan *lchan, uint8_t cause);
|
||||
int down_rsl(struct gsm_bts_trx *trx, struct msgb *msg);
|
||||
int rsl_tx_rf_res(struct gsm_bts_trx *trx);
|
||||
int rsl_tx_chan_rqd(struct gsm_bts_trx *trx, struct gsm_time *gtime,
|
||||
uint8_t ra, uint8_t acc_delay);
|
||||
int rsl_tx_est_ind(struct gsm_lchan *lchan, uint8_t link_id, uint8_t *data, int len);
|
||||
|
||||
int rsl_tx_chan_act_ack(struct gsm_lchan *lchan, struct gsm_time *gtime);
|
||||
int rsl_tx_rf_rel_ack(struct gsm_lchan *lchan);
|
||||
|
||||
/* call-back for LAPDm code, called when it wants to send msgs UP */
|
||||
int lapdm_rll_tx_cb(struct msgb *msg, struct lapdm_entity *le, void *ctx);
|
||||
|
||||
int rsl_tx_ipac_dlcx_ind(struct gsm_lchan *lchan, uint8_t cause);
|
||||
|
||||
struct gsm_lchan *rsl_lchan_lookup(struct gsm_bts_trx *trx, uint8_t chan_nr);
|
||||
|
||||
#endif // _RSL_H */
|
||||
|
||||
|
|
|
@ -0,0 +1,14 @@
|
|||
#ifndef OSMO_BTS_SIGNAL_H
|
||||
#define OSMO_BTS_SIGNAL_H
|
||||
|
||||
#include <osmocom/core/signal.h>
|
||||
|
||||
enum sig_subsys {
|
||||
SS_GLOBAL,
|
||||
};
|
||||
|
||||
enum signals_global {
|
||||
S_NEW_SYSINFO,
|
||||
};
|
||||
|
||||
#endif
|
|
@ -1,30 +0,0 @@
|
|||
#ifndef _BTS_SUPPORT_H
|
||||
#define _BTS_SUPPORT_H
|
||||
|
||||
struct bts_support {
|
||||
/* crypto supprot */
|
||||
uint8_t a5_1;
|
||||
uint8_t a5_2;
|
||||
uint8_t a5_3;
|
||||
uint8_t a5_4;
|
||||
uint8_t a5_5;
|
||||
uint8_t a5_6;
|
||||
uint8_t a5_7;
|
||||
/* radio support */
|
||||
uint8_t freq_map[128];
|
||||
/* codecs */
|
||||
uint8_t chan_comb[256];
|
||||
uint8_t full_v1;
|
||||
uint8_t full_v2;
|
||||
uint8_t full_v3;
|
||||
uint8_t half_v1;
|
||||
uint8_t half_v3;
|
||||
};
|
||||
|
||||
extern struct bts_support bts_support;
|
||||
void bts_support_init(void);
|
||||
char *bts_support_comb_name(uint8_t chan_comb);
|
||||
|
||||
#endif /* _SUPPORT_H */
|
||||
|
||||
|
|
@ -0,0 +1,22 @@
|
|||
#ifndef OSMOBTS_VTY_H
|
||||
#define OSMOBTS_VTY_H
|
||||
|
||||
#include <osmocom/vty/vty.h>
|
||||
#include <osmocom/vty/command.h>
|
||||
|
||||
enum bts_vty_node {
|
||||
BTS_NODE = _LAST_OSMOVTY_NODE + 1,
|
||||
TRX_NODE,
|
||||
TS_NODE,
|
||||
LCHAN_NODE,
|
||||
};
|
||||
|
||||
extern struct cmd_element ournode_exit_cmd;
|
||||
extern struct cmd_element ournode_end_cmd;
|
||||
|
||||
enum node_type bts_vty_go_parent(struct vty *vty);
|
||||
int bts_vty_is_config_node(struct vty *vty, int node);
|
||||
|
||||
extern struct vty_app_info bts_vty_info;
|
||||
|
||||
#endif
|
|
@ -1 +1 @@
|
|||
SUBDIRS = common osmo-bts-bb
|
||||
SUBDIRS = common osmo-bts-sysmo #osmo-bts-bb
|
||||
|
|
|
@ -3,5 +3,5 @@ AM_CFLAGS = -Wall $(LIBOSMOCORE_CFLAGS)
|
|||
LDADD = $(LIBOSMOCORE_LIBS)
|
||||
|
||||
noinst_LIBRARIES = libbts.a
|
||||
libbts_a_SOURCES = support.c bts.c abis.c rsl.c oml.c rtp.c
|
||||
# ../common/l1l2_interface.c ../common/lapdm.c ../common/logging.c
|
||||
libbts_a_SOURCES = gsm_data_shared.c sysinfo.c logging.c abis.c oml.c bts.c rsl.c vty.c paging.c
|
||||
#support.c rtp.c
|
||||
|
|
|
@ -1,10 +1,14 @@
|
|||
/* Minimalistic Abis/IP interface routines, soon to be replaced by
|
||||
* libosmo-abis (Pablo) */
|
||||
|
||||
/* (C) 2011 by Andreas Eversberg <jolly@eversberg.eu>
|
||||
* (C) 2011 by Harald Welte <laforge@gnumonks.org>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||
* the Free Software Foundation; either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
|
@ -12,9 +16,8 @@
|
|||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along
|
||||
* with this program; if not, write to the Free Software Foundation, Inc.,
|
||||
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
|
@ -27,16 +30,20 @@
|
|||
#include <errno.h>
|
||||
#include <string.h>
|
||||
|
||||
#include <osmocore/select.h>
|
||||
#include <osmocore/timer.h>
|
||||
#include <osmocore/msgb.h>
|
||||
#include <osmocom/bb/common/logging.h>
|
||||
#include <osmocom/bb/common/osmocom_data.h>
|
||||
#include <osmocom/bb/bts/abis.h>
|
||||
#include <osmocom/core/select.h>
|
||||
#include <osmocom/core/timer.h>
|
||||
#include <osmocom/core/msgb.h>
|
||||
#include <osmocom/gsm/protocol/ipaccess.h>
|
||||
|
||||
#include <osmo-bts/logging.h>
|
||||
#include <osmo-bts/gsm_data.h>
|
||||
#include <osmo-bts/abis.h>
|
||||
#include <osmo-bts/bts.h>
|
||||
#include <osmo-bts/rsl.h>
|
||||
#include <osmo-bts/oml.h>
|
||||
#if 0
|
||||
#include <osmocom/bb/bts/rtp.h>
|
||||
#include <osmocom/bb/bts/bts.h>
|
||||
#include <osmocom/bb/bts/rsl.h>
|
||||
#include <osmocom/bb/bts/oml.h>
|
||||
#endif
|
||||
|
||||
extern char *software_version;
|
||||
extern uint8_t abis_mac[6];
|
||||
|
@ -61,6 +68,23 @@ int abis_tx(struct ipabis_link *link, struct msgb *msg)
|
|||
return 0;
|
||||
}
|
||||
|
||||
int abis_oml_sendmsg(struct msgb *msg)
|
||||
{
|
||||
struct gsm_bts *bts = msg->trx->bts;
|
||||
|
||||
abis_push_ipa(msg, 0xff);
|
||||
|
||||
return abis_tx((struct ipabis_link *) bts->oml_link, msg);
|
||||
}
|
||||
|
||||
int abis_rsl_sendmsg(struct msgb *msg)
|
||||
{
|
||||
struct gsm_bts_trx *trx = msg->trx;
|
||||
|
||||
abis_push_ipa(msg, 0);
|
||||
|
||||
return abis_tx((struct ipabis_link *) trx->rsl_link, msg);
|
||||
}
|
||||
|
||||
struct msgb *abis_msgb_alloc(int headroom)
|
||||
{
|
||||
|
@ -98,7 +122,7 @@ static int abis_tx_ipa_pingpong(struct ipabis_link *link, uint8_t pingpong)
|
|||
if (!nmsg)
|
||||
return -ENOMEM;
|
||||
*msgb_put(nmsg, 1) = pingpong;
|
||||
abis_push_ipa(nmsg, IPA_PROTO_IPACCESS);
|
||||
abis_push_ipa(nmsg, IPAC_PROTO_IPACCESS);
|
||||
|
||||
return abis_tx(link, nmsg);
|
||||
}
|
||||
|
@ -106,16 +130,20 @@ static int abis_tx_ipa_pingpong(struct ipabis_link *link, uint8_t pingpong)
|
|||
/* send ACK and ID RESP */
|
||||
static int abis_rx_ipa_id_get(struct ipabis_link *link, uint8_t *data, int len)
|
||||
{
|
||||
struct gsm_bts *bts = link->bts;
|
||||
struct msgb *nmsg, *nmsg2;
|
||||
char str[64];
|
||||
uint8_t *tag;
|
||||
|
||||
if (!link->bts)
|
||||
bts = link->trx->bts;
|
||||
|
||||
LOGP(DABIS, LOGL_INFO, "Reply to ID_GET\n");
|
||||
|
||||
nmsg = abis_msgb_alloc(0);
|
||||
if (!nmsg)
|
||||
return -ENOMEM;
|
||||
*msgb_put(nmsg, 1) = IPA_MSGT_ID_RESP;
|
||||
*msgb_put(nmsg, 1) = IPAC_MSGT_ID_RESP;
|
||||
while (len) {
|
||||
if (len < 2) {
|
||||
LOGP(DABIS, LOGL_NOTICE,
|
||||
|
@ -124,32 +152,33 @@ static int abis_rx_ipa_id_get(struct ipabis_link *link, uint8_t *data, int len)
|
|||
return -EIO;
|
||||
}
|
||||
switch (data[1]) {
|
||||
case IPA_IDTAG_UNIT:
|
||||
sprintf(str, "%s/%d", (link->trx) ? link->trx->bts->id
|
||||
: link->bts->id,
|
||||
(link->trx) ? link->trx->trx_nr : 0);
|
||||
case IPAC_IDTAG_UNIT:
|
||||
sprintf(str, "%u/%u/%u",
|
||||
bts->ip_access.site_id,
|
||||
bts->ip_access.bts_id,
|
||||
(link->trx) ? link->trx->nr : 0);
|
||||
break;
|
||||
case IPA_IDTAG_MACADDR:
|
||||
case IPAC_IDTAG_MACADDR:
|
||||
sprintf(str, "%02x:%02x:%02x:%02x:%02x:%02x",
|
||||
abis_mac[0], abis_mac[1], abis_mac[2],
|
||||
abis_mac[3], abis_mac[4], abis_mac[5]);
|
||||
break;
|
||||
case IPA_IDTAG_LOCATION1:
|
||||
case IPAC_IDTAG_LOCATION1:
|
||||
strcpy(str, "osmoBTS");
|
||||
break;
|
||||
case IPA_IDTAG_LOCATION2:
|
||||
case IPAC_IDTAG_LOCATION2:
|
||||
strcpy(str, "osmoBTS");
|
||||
break;
|
||||
case IPA_IDTAG_EQUIPVERS:
|
||||
case IPA_IDTAG_SWVERSION:
|
||||
case IPAC_IDTAG_EQUIPVERS:
|
||||
case IPAC_IDTAG_SWVERSION:
|
||||
strcpy(str, software_version);
|
||||
break;
|
||||
case IPA_IDTAG_UNITNAME:
|
||||
case IPAC_IDTAG_UNITNAME:
|
||||
sprintf(str, "osmoBTS-%02x-%02x-%02x-%02x-%02x-%02x",
|
||||
abis_mac[0], abis_mac[1], abis_mac[2],
|
||||
abis_mac[3], abis_mac[4], abis_mac[5]);
|
||||
break;
|
||||
case IPA_IDTAG_SERNR:
|
||||
case IPAC_IDTAG_SERNR:
|
||||
strcpy(str, "");
|
||||
break;
|
||||
default:
|
||||
|
@ -167,15 +196,15 @@ static int abis_rx_ipa_id_get(struct ipabis_link *link, uint8_t *data, int len)
|
|||
data += 2;
|
||||
len -= 2;
|
||||
}
|
||||
abis_push_ipa(nmsg, IPA_PROTO_IPACCESS);
|
||||
abis_push_ipa(nmsg, IPAC_PROTO_IPACCESS);
|
||||
|
||||
nmsg2 = abis_msgb_alloc(0);
|
||||
if (!nmsg2) {
|
||||
msgb_free(nmsg);
|
||||
return -ENOMEM;
|
||||
}
|
||||
*msgb_put(nmsg2, 1) = IPA_MSGT_ID_ACK;
|
||||
abis_push_ipa(nmsg2, IPA_PROTO_IPACCESS);
|
||||
*msgb_put(nmsg2, 1) = IPAC_MSGT_ID_ACK;
|
||||
abis_push_ipa(nmsg2, IPAC_PROTO_IPACCESS);
|
||||
|
||||
link->id_resp = 1;
|
||||
|
||||
|
@ -196,21 +225,23 @@ static int abis_rx_ipaccess(struct ipabis_link *link, struct msgb *msg)
|
|||
}
|
||||
|
||||
switch (*data) {
|
||||
case IPA_MSGT_PONG:
|
||||
case IPAC_MSGT_PONG:
|
||||
#if 0
|
||||
#warning HACK
|
||||
rsl_tx_chan_rqd(link->bts->trx[0]);
|
||||
LOGP(DABIS, LOGL_INFO, "PONG\n");
|
||||
#endif
|
||||
LOGP(DABIS, LOGL_DEBUG, "PONG\n");
|
||||
link->pong = 1;
|
||||
break;
|
||||
case IPA_MSGT_PING:
|
||||
LOGP(DABIS, LOGL_INFO, "reply to ping request\n");
|
||||
ret = abis_tx_ipa_pingpong(link, IPA_MSGT_PONG);
|
||||
case IPAC_MSGT_PING:
|
||||
LOGP(DABIS, LOGL_DEBUG, "reply to ping request\n");
|
||||
ret = abis_tx_ipa_pingpong(link, IPAC_MSGT_PONG);
|
||||
break;
|
||||
case IPA_MSGT_ID_GET:
|
||||
case IPAC_MSGT_ID_GET:
|
||||
ret = abis_rx_ipa_id_get(link, data + 1, len - 1);
|
||||
break;
|
||||
case IPA_MSGT_ID_ACK:
|
||||
LOGP(DABIS, LOGL_INFO, "ID ACK\n");
|
||||
case IPAC_MSGT_ID_ACK:
|
||||
LOGP(DABIS, LOGL_DEBUG, "ID ACK\n");
|
||||
if (link->id_resp && link->bts)
|
||||
ret = bts_link_estab(link->bts);
|
||||
if (link->id_resp && link->trx)
|
||||
|
@ -240,7 +271,7 @@ static int abis_rx(struct ipabis_link *link, struct msgb *msg)
|
|||
int ret = 0;
|
||||
|
||||
switch (hh->proto) {
|
||||
case IPA_PROTO_RSL:
|
||||
case IPAC_PROTO_RSL:
|
||||
if (!link->trx) {
|
||||
LOGP(DABIS, LOGL_NOTICE,
|
||||
"Received RSL message not on RSL link\n");
|
||||
|
@ -248,16 +279,17 @@ static int abis_rx(struct ipabis_link *link, struct msgb *msg)
|
|||
ret = EIO;
|
||||
break;
|
||||
}
|
||||
msg->trx = link->trx;
|
||||
ret = down_rsl(link->trx, msg);
|
||||
break;
|
||||
case IPA_PROTO_IPACCESS:
|
||||
case IPAC_PROTO_IPACCESS:
|
||||
ret = abis_rx_ipaccess(link, msg);
|
||||
break;
|
||||
case IPA_PROTO_SCCP:
|
||||
case IPAC_PROTO_SCCP:
|
||||
LOGP(DABIS, LOGL_INFO, "Received SCCP message\n");
|
||||
msgb_free(msg);
|
||||
break;
|
||||
case IPA_PROTO_OML:
|
||||
case IPAC_PROTO_OML:
|
||||
if (!link->bts) {
|
||||
LOGP(DABIS, LOGL_NOTICE,
|
||||
"Received OML message not on OML link\n");
|
||||
|
@ -265,6 +297,7 @@ static int abis_rx(struct ipabis_link *link, struct msgb *msg)
|
|||
ret = EIO;
|
||||
break;
|
||||
}
|
||||
msg->trx = link->bts->c0;
|
||||
ret = down_oml(link->bts, msg);
|
||||
break;
|
||||
default:
|
||||
|
@ -302,8 +335,8 @@ static void abis_timeout(void *arg)
|
|||
}
|
||||
link->ping = 1;
|
||||
link->pong = 0;
|
||||
LOGP(DABIS, LOGL_INFO, "PING\n");
|
||||
abis_tx_ipa_pingpong(link, IPA_MSGT_PING);
|
||||
LOGP(DABIS, LOGL_DEBUG, "PING\n");
|
||||
abis_tx_ipa_pingpong(link, IPAC_MSGT_PING);
|
||||
osmo_timer_schedule(&link->timer, OML_PING_TIMER, 0);
|
||||
break;
|
||||
}
|
||||
|
@ -348,7 +381,7 @@ static int abis_sock_cb(struct osmo_fd *bfd, unsigned int what)
|
|||
return 0;
|
||||
msg->l2h = msg->data + sizeof(*hh);
|
||||
if (ntohs(hh->len) > msgb_tailroom(msg)) {
|
||||
LOGP(DABIS, LOGL_NOTICE, "Received packet from "
|
||||
LOGP(DABIS, LOGL_DEBUG, "Received packet from "
|
||||
"Abis socket too large.\n");
|
||||
goto close;
|
||||
}
|
||||
|
@ -363,13 +396,13 @@ static int abis_sock_cb(struct osmo_fd *bfd, unsigned int what)
|
|||
if (ntohs(hh->len) + sizeof(*hh) > msg->len)
|
||||
return 0;
|
||||
link->rx_msg = NULL;
|
||||
LOGP(DABIS, LOGL_INFO, "Received messages from Abis socket.\n");
|
||||
LOGP(DABIS, LOGL_DEBUG, "Received messages from Abis socket.\n");
|
||||
ret = abis_rx(link, msg);
|
||||
}
|
||||
if ((what & BSC_FD_WRITE)) {
|
||||
msg = msgb_dequeue(&link->tx_queue);
|
||||
if (msg) {
|
||||
LOGP(DABIS, LOGL_INFO, "Sending messages to Abis socket.\n");
|
||||
LOGP(DABIS, LOGL_DEBUG, "Sending messages to Abis socket.\n");
|
||||
ret = send(link->bfd.fd, msg->data, msg->len, 0);
|
||||
if (ret < 0)
|
||||
goto close;
|
||||
|
@ -377,7 +410,7 @@ static int abis_sock_cb(struct osmo_fd *bfd, unsigned int what)
|
|||
link->bfd.when &= ~BSC_FD_WRITE;
|
||||
}
|
||||
if ((what & BSC_FD_EXCEPT)) {
|
||||
LOGP(DABIS, LOGL_INFO, "Abis socket received exception\n");
|
||||
LOGP(DABIS, LOGL_NOTICE, "Abis socket received exception\n");
|
||||
goto close;
|
||||
}
|
||||
|
||||
|
@ -388,11 +421,11 @@ close:
|
|||
|
||||
/* RSL link will just close and BSC is notified */
|
||||
if (link->trx) {
|
||||
LOGP(DABIS, LOGL_INFO, "Connection to BSC failed\n");
|
||||
LOGP(DABIS, LOGL_NOTICE, "Connection to BSC failed\n");
|
||||
return trx_link_estab(link->trx);
|
||||
}
|
||||
|
||||
LOGP(DABIS, LOGL_INFO, "Connection to BSC failed, retrying in %d "
|
||||
LOGP(DABIS, LOGL_NOTICE, "Connection to BSC failed, retrying in %d "
|
||||
"seconds.\n", OML_RETRY_TIMER);
|
||||
osmo_timer_schedule(&link->timer, OML_RETRY_TIMER, 0);
|
||||
link->state = LINK_STATE_RETRYING;
|
||||
|
@ -407,6 +440,8 @@ int abis_open(struct ipabis_link *link, uint32_t ip)
|
|||
int sock;
|
||||
int ret;
|
||||
|
||||
oml_init();
|
||||
|
||||
if (link->bfd.fd > 0)
|
||||
return -EBUSY;
|
||||
|
||||
|
@ -455,18 +490,11 @@ int abis_open(struct ipabis_link *link, uint32_t ip)
|
|||
void abis_close(struct ipabis_link *link)
|
||||
{
|
||||
struct msgb *msg;
|
||||
int i;
|
||||
|
||||
if (link->bfd.fd <= 0)
|
||||
return;
|
||||
|
||||
LOGP(DABIS, LOGL_INFO, "Abis socket closed.\n");
|
||||
|
||||
#warning if any link fails, shutdown all links
|
||||
if (link->trx) {
|
||||
for (i = 0; i < 8; i++)
|
||||
bts_setup_slot(&link->trx->slot[i], 0xff);
|
||||
}
|
||||
LOGP(DABIS, LOGL_NOTICE, "Abis socket closed.\n");
|
||||
|
||||
if (link->rx_msg) {
|
||||
msgb_free(link->rx_msg);
|
||||
|
|
155
src/common/bts.c
155
src/common/bts.c
|
@ -1,10 +1,13 @@
|
|||
/* BTS support code common to all supported BTS models */
|
||||
|
||||
/* (C) 2011 by Andreas Eversberg <jolly@eversberg.eu>
|
||||
* (C) 2011 by Harald Welte <laforge@gnumonks.org>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||
* the Free Software Foundation; either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
|
@ -12,9 +15,8 @@
|
|||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along
|
||||
* with this program; if not, write to the Free Software Foundation, Inc.,
|
||||
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
|
@ -29,23 +31,30 @@
|
|||
#include <osmocom/core/msgb.h>
|
||||
#include <osmocom/core/talloc.h>
|
||||
#include <osmocom/gsm/protocol/gsm_12_21.h>
|
||||
#include <osmocom/gsm/lapdm.h>
|
||||
|
||||
#include <osmo-bts/logging.h>
|
||||
//#include <osmocom/bb/common/osmocom_data.h>
|
||||
//#include <osmocom/bb/common/l1l2_interface.h>
|
||||
#include <osmo-bts/abis.h>
|
||||
#include <osmo-bts/rtp.h>
|
||||
#include <osmo-bts/bts.h>
|
||||
#include <osmo-bts/rsl.h>
|
||||
#include <osmo-bts/oml.h>
|
||||
|
||||
extern void *l23_ctx;
|
||||
|
||||
extern uint8_t cr_loc2rem_cmd;
|
||||
extern uint8_t cr_loc2rem_resp;
|
||||
extern uint8_t cr_rem2loc_cmd;
|
||||
extern uint8_t cr_rem2loc_resp;
|
||||
void *tall_bts_ctx;
|
||||
|
||||
BTS_SI_NAME;
|
||||
int bts_init(struct gsm_bts *bts)
|
||||
{
|
||||
struct gsm_bts_role_bts *btsb;
|
||||
|
||||
bts->role = btsb = talloc_zero(bts, struct gsm_bts_role_bts);
|
||||
|
||||
INIT_LLIST_HEAD(&btsb->agch_queue);
|
||||
|
||||
/* FIXME: make those parameters configurable */
|
||||
btsb->paging_state = paging_init(btsb, 200, 0);
|
||||
|
||||
return bts_model_init(bts);
|
||||
}
|
||||
|
||||
#if 0
|
||||
struct osmobts_lchan *lchan_by_channelnr(struct osmobts_trx *trx,
|
||||
|
@ -88,7 +97,6 @@ struct osmobts_lchan *lchan_by_channelnr(struct osmobts_trx *trx,
|
|||
return NULL;
|
||||
|
||||
}
|
||||
#endif
|
||||
|
||||
struct osmocom_bts *create_bts(uint8_t num_trx, char *id)
|
||||
{
|
||||
|
@ -267,45 +275,33 @@ void destroy_bts(struct osmocom_bts *bts)
|
|||
abis_close(&bts->link);
|
||||
talloc_free(bts);
|
||||
}
|
||||
#endif
|
||||
|
||||
/* main link is established, send status report */
|
||||
int bts_link_estab(struct osmocom_bts *bts)
|
||||
int bts_link_estab(struct gsm_bts *bts)
|
||||
{
|
||||
int i, j;
|
||||
uint8_t radio_state;
|
||||
|
||||
LOGP(DSUM, LOGL_INFO, "Main link established, sending Status'.\n");
|
||||
|
||||
/* site-manager status */
|
||||
oml_tx_state_changed(&bts->link, NM_OPSTATE_ENABLED, NM_AVSTATE_OK,
|
||||
NM_OC_SITE_MANAGER, 0xff, 0xff, 0xff);
|
||||
/* bts status */
|
||||
oml_tx_state_changed(&bts->link, NM_OPSTATE_ENABLED, NM_AVSTATE_OK,
|
||||
NM_OC_BTS, 0, 0xff, 0xff);
|
||||
/* trx */
|
||||
oml_mo_state_chg(&bts->site_mgr.mo, NM_OPSTATE_ENABLED, NM_AVSTATE_OK);
|
||||
oml_mo_state_chg(&bts->mo, NM_OPSTATE_ENABLED, NM_AVSTATE_DEPENDENCY);
|
||||
|
||||
for (i = 0; i < bts->num_trx; i++) {
|
||||
radio_state = (bts->trx[i]->link.state == LINK_STATE_CONNECT) ? NM_OPSTATE_ENABLED : NM_OPSTATE_DISABLED;
|
||||
oml_tx_state_changed(&bts->link, radio_state,
|
||||
NM_AVSTATE_OK, NM_OC_RADIO_CARRIER, 0,
|
||||
bts->trx[i]->trx_nr, 0xff);
|
||||
oml_tx_sw_act_rep(&bts->link, NM_OC_RADIO_CARRIER, 0, bts->trx[i]->trx_nr, 0xff);
|
||||
oml_tx_state_changed(&bts->link, NM_OPSTATE_ENABLED,
|
||||
NM_AVSTATE_OK, NM_OC_BASEB_TRANSC, 0,
|
||||
bts->trx[i]->trx_nr, 0xff);
|
||||
oml_tx_sw_act_rep(&bts->link, NM_OC_BASEB_TRANSC, 0, bts->trx[i]->trx_nr, 0xff);
|
||||
/* channel */
|
||||
for (j = 0; j < 8; j++) {
|
||||
if (bts->trx[i]->slot[j].tx_ms)
|
||||
oml_tx_state_changed(&bts->link,
|
||||
NM_OPSTATE_DISABLED, NM_AVSTATE_DEPENDENCY,
|
||||
NM_OC_CHANNEL, 0, bts->trx[i]->trx_nr,
|
||||
bts->trx[i]->slot[j].slot_nr);
|
||||
else
|
||||
oml_tx_state_changed(&bts->link,
|
||||
NM_OPSTATE_DISABLED,
|
||||
NM_AVSTATE_NOT_INSTALLED,
|
||||
NM_OC_CHANNEL, 0, bts->trx[i]->trx_nr,
|
||||
bts->trx[i]->slot[j].slot_nr);
|
||||
struct gsm_bts_trx *trx = gsm_bts_trx_num(bts, i);
|
||||
struct ipabis_link *link = (struct ipabis_link *) trx->rsl_link;
|
||||
|
||||
radio_state = (link && link->state == LINK_STATE_CONNECT) ? NM_OPSTATE_ENABLED : NM_OPSTATE_DISABLED;
|
||||
oml_mo_state_chg(&trx->mo, radio_state, NM_AVSTATE_OK);
|
||||
oml_mo_tx_sw_act_rep(&trx->mo);
|
||||
oml_mo_state_chg(&trx->bb_transc.mo, NM_OPSTATE_ENABLED, NM_AVSTATE_OK);
|
||||
oml_mo_tx_sw_act_rep(&trx->bb_transc.mo);
|
||||
|
||||
for (j = 0; j < ARRAY_SIZE(trx->ts); j++) {
|
||||
struct gsm_bts_trx_ts *ts = &trx->ts[j];
|
||||
|
||||
oml_mo_state_chg(&ts->mo, NM_OPSTATE_DISABLED, NM_AVSTATE_DEPENDENCY);
|
||||
}
|
||||
}
|
||||
|
||||
|
@ -313,15 +309,17 @@ int bts_link_estab(struct osmocom_bts *bts)
|
|||
}
|
||||
|
||||
/* RSL link is established, send status report */
|
||||
int trx_link_estab(struct osmobts_trx *trx)
|
||||
int trx_link_estab(struct gsm_bts_trx *trx)
|
||||
{
|
||||
uint8_t radio_state = (trx->link.state == LINK_STATE_CONNECT) ? NM_OPSTATE_ENABLED : NM_OPSTATE_DISABLED;
|
||||
struct ipabis_link *link = (struct ipabis_link *) trx->rsl_link;
|
||||
uint8_t radio_state = (link->state == LINK_STATE_CONNECT) ? NM_OPSTATE_ENABLED : NM_OPSTATE_DISABLED;
|
||||
|
||||
LOGP(DSUM, LOGL_INFO, "RSL link (TRX %02x) state changed to %s, sending Status'.\n", trx->trx_nr, (trx->link.state == LINK_STATE_CONNECT) ? "up" : "down");
|
||||
LOGP(DSUM, LOGL_INFO, "RSL link (TRX %02x) state changed to %s, sending Status'.\n",
|
||||
trx->nr, (link->state == LINK_STATE_CONNECT) ? "up" : "down");
|
||||
|
||||
oml_tx_state_changed(&trx->bts->link, radio_state, NM_AVSTATE_OK, NM_OC_RADIO_CARRIER, 0, trx->trx_nr, 0xff);
|
||||
oml_mo_state_chg(&trx->mo, radio_state, NM_AVSTATE_OK);
|
||||
|
||||
if (trx->link.state == LINK_STATE_CONNECT)
|
||||
if (link->state == LINK_STATE_CONNECT)
|
||||
rsl_tx_rf_res(trx);
|
||||
|
||||
return 0;
|
||||
|
@ -332,6 +330,7 @@ void bts_new_si(void *arg)
|
|||
struct osmobts_trx *trx = arg;
|
||||
int i;
|
||||
|
||||
#if 0
|
||||
if (osmo_timer_pending(&trx->si.timer))
|
||||
return;
|
||||
|
||||
|
@ -354,25 +353,41 @@ void bts_new_si(void *arg)
|
|||
trx->si.timer.cb = bts_new_si;
|
||||
trx->si.timer.data = trx;
|
||||
osmo_timer_schedule(&trx->si.timer, 0, 200000);
|
||||
}
|
||||
|
||||
/* handle bts instance (including MS instances) */
|
||||
int work_bts(struct osmocom_bts *bts)
|
||||
{
|
||||
int work = 0, w;
|
||||
|
||||
do {
|
||||
w = 0;
|
||||
// w |= xxx_dequeue(ms);
|
||||
if (w)
|
||||
work = 1;
|
||||
} while (w);
|
||||
return work;
|
||||
}
|
||||
#if 0
|
||||
int create_chan(struct osmocom_bts *slot, uint8_t type)
|
||||
{
|
||||
welcher type?:
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
||||
int lchan_init_lapdm(struct gsm_lchan *lchan)
|
||||
{
|
||||
struct lapdm_channel *lc = &lchan->lapdm_ch;
|
||||
|
||||
lapdm_channel_init(lc, LAPDM_MODE_BTS);
|
||||
lapdm_channel_set_flags(lc, LAPDM_ENT_F_POLLING_ONLY);
|
||||
lapdm_channel_set_l1(lc, NULL, lchan);
|
||||
lapdm_channel_set_l3(lc, lapdm_rll_tx_cb, lchan);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int bts_agch_enqueue(struct gsm_bts *bts, struct msgb *msg)
|
||||
{
|
||||
struct gsm_bts_role_bts *btsb = bts_role_bts(bts);;
|
||||
|
||||
/* FIXME: implement max queue length */
|
||||
llist_add_tail(&msg->list, &btsb->agch_queue);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
struct msgb *bts_agch_dequeue(struct gsm_bts *bts)
|
||||
{
|
||||
struct gsm_bts_role_bts *btsb = bts_role_bts(bts);;
|
||||
struct msgb *msg;
|
||||
|
||||
if (llist_empty(&btsb->agch_queue))
|
||||
return NULL;
|
||||
|
||||
msg = llist_entry(btsb->agch_queue.next, struct msgb, list);
|
||||
llist_del(&msg->list);
|
||||
|
||||
return msg;
|
||||
}
|
||||
|
|
|
@ -0,0 +1 @@
|
|||
#include "../../../openbsc/openbsc/src/libcommon/gsm_data_shared.c"
|
|
@ -0,0 +1,69 @@
|
|||
/* Support for generating RSL Load Indication */
|
||||
|
||||
/* (C) 2011 by Harald Welte <laforge@gnumonks.org>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||
* the Free Software Foundation; either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
#include <rsl.h>
|
||||
|
||||
#include <osmocom/core/timer.h>
|
||||
|
||||
static void reset_load_counters(void)
|
||||
{
|
||||
/* re-set the counters */
|
||||
btsb->load.ccch.pch_used = btsb->load.ccch.pch_total = 0;
|
||||
}
|
||||
|
||||
static void load_timer_cb(void *data)
|
||||
{
|
||||
struct gsm_bts *bts = data;
|
||||
struct gsm_bts_role_bts *btsb = FIXME;
|
||||
unsigned int pch_percent;
|
||||
|
||||
/* compute percentages */
|
||||
pch_percent = (btsb->load.ccch.pch_used * 100) / btsb->load.ccch.pch_total;
|
||||
|
||||
if (pch_percent >= btsb->load.ccch.load_ind_thresh) {
|
||||
/* send RSL load indication message to BSC */
|
||||
uint16_t paging_buffer_space = FIXME;
|
||||
rsl_tx_ccch_load_ind_pch(bts, paging_buffer_space);
|
||||
}
|
||||
|
||||
reset_load_counters();
|
||||
|
||||
/* re-schedule the timer */
|
||||
osmo_timer_schedule(&btsb->load.ccch.timer,
|
||||
btsb->load.ccch.load_ind_period, 0);
|
||||
}
|
||||
|
||||
static void load_timer_start(struct gsm_bts *bts)
|
||||
{
|
||||
struct gsm_bts_role_bts *btsb = FIXME;
|
||||
|
||||
btsb->load.ccch.timer.data = bts;
|
||||
reset_load_counters();
|
||||
osmo_timer_schedule(&btsb->load.ccch.timer,
|
||||
btsb->load.ccch.load_ind_period, 0);
|
||||
|
||||
return 0
|
||||
}
|
||||
|
||||
static void load_timer_stop(struct gsm_bts *bts)
|
||||
{
|
||||
osmo_timer_del(&btsb->load.ccch.timer);
|
||||
}
|
|
@ -0,0 +1,122 @@
|
|||
/* libosmocore logging support */
|
||||
|
||||
/* (C) 2011 by Andreas Eversberg <jolly@eversberg.eu>
|
||||
* (C) 2011 by Harald Welte <laforge@gnumonks.org>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||
* the Free Software Foundation; either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
|
||||
#include <errno.h>
|
||||
|
||||
#include <osmocom/core/logging.h>
|
||||
#include <osmocom/core/application.h>
|
||||
#include <osmocom/core/utils.h>
|
||||
|
||||
#include <osmo-bts/bts.h>
|
||||
#include <osmo-bts/logging.h>
|
||||
|
||||
static const struct log_info_cat bts_log_info_cat[] = {
|
||||
[DRSL] = {
|
||||
.name = "DRSL",
|
||||
.description = "A-bis Radio Siganlling Link (RSL)",
|
||||
.color = "\033[1;35m",
|
||||
.enabled = 1, .loglevel = LOGL_NOTICE,
|
||||
},
|
||||
[DOML] = {
|
||||
.name = "DOML",
|
||||
.description = "A-bis Network Management / O&M (NM/OML)",
|
||||
.color = "\033[1;36m",
|
||||
.enabled = 1, .loglevel = LOGL_INFO,
|
||||
},
|
||||
[DRLL] = {
|
||||
.name = "DRLL",
|
||||
.description = "A-bis Radio Link Layer (RLL)",
|
||||
.color = "\033[1;31m",
|
||||
.enabled = 1, .loglevel = LOGL_NOTICE,
|
||||
},
|
||||
[DRR] = {
|
||||
.name = "DRR",
|
||||
.description = "Layer3 Radio Resource (RR)",
|
||||
.color = "\033[1;34m",
|
||||
.enabled = 1, .loglevel = LOGL_NOTICE,
|
||||
},
|
||||
[DMEAS] = {
|
||||
.name = "DMEAS",
|
||||
.description = "Radio Measurement Processing",
|
||||
.enabled = 0, .loglevel = LOGL_NOTICE,
|
||||
},
|
||||
[DPAG] = {
|
||||
.name = "DPAG",
|
||||
.description = "Paging Subsystem",
|
||||
.color = "\033[1;38m",
|
||||
.enabled = 1, .loglevel = LOGL_INFO,
|
||||
},
|
||||
[DL1C] = {
|
||||
.name = "DL1C",
|
||||
.description = "Layer 1",
|
||||
.loglevel = LOGL_DEBUG,
|
||||
.enabled = 1,
|
||||
},
|
||||
[DL1P] = {
|
||||
.name = "DL1P",
|
||||
.description = "Layer 1 Primitives",
|
||||
.loglevel = LOGL_DEBUG,
|
||||
.enabled = 0,
|
||||
},
|
||||
[DABIS] = {
|
||||
.name = "DABIS",
|
||||
.description = "A-bis Intput Subsystem",
|
||||
.enabled = 1, .loglevel = LOGL_NOTICE,
|
||||
},
|
||||
#if 0
|
||||
[DNS] = {
|
||||
.name = "DNS",
|
||||
.description = "GPRS Network Service (NS)",
|
||||
.enabled = 1, .loglevel = LOGL_INFO,
|
||||
},
|
||||
[DBSSGP] = {
|
||||
.name = "DBSSGP",
|
||||
.description = "GPRS BSS Gateway Protocol (BSSGP)",
|
||||
.enabled = 1, .loglevel = LOGL_DEBUG,
|
||||
},
|
||||
[DLLC] = {
|
||||
.name = "DLLC",
|
||||
.description = "GPRS Logical Link Control Protocol (LLC)",
|
||||
.enabled = 1, .loglevel = LOGL_DEBUG,
|
||||
},
|
||||
#endif
|
||||
};
|
||||
|
||||
const struct log_info bts_log_info = {
|
||||
.cat = bts_log_info_cat,
|
||||
.num_cat = ARRAY_SIZE(bts_log_info_cat),
|
||||
};
|
||||
|
||||
#define DEFAULT_MASK "DL1C:DOML:DRSL:DPAG"
|
||||
|
||||
int bts_log_init(const char *category_mask)
|
||||
{
|
||||
if (!category_mask)
|
||||
category_mask = DEFAULT_MASK;
|
||||
|
||||
osmo_init_logging(&bts_log_info);
|
||||
|
||||
log_parse_category_mask(osmo_stderr_target, category_mask);
|
||||
|
||||
return 0;
|
||||
}
|
910
src/common/oml.c
910
src/common/oml.c
File diff suppressed because it is too large
Load Diff
|
@ -0,0 +1,440 @@
|
|||
/* Paging message encoding + queue management */
|
||||
|
||||
/* (C) 2011 by Harald Welte <laforge@gnumonks.org>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||
* the Free Software Foundation; either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
/* TODO:
|
||||
* eMLPP priprity
|
||||
* add P1/P2/P3 rest octets
|
||||
*/
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <stdint.h>
|
||||
#include <errno.h>
|
||||
#include <string.h>
|
||||
#include <time.h>
|
||||
|
||||
#include <osmocom/core/talloc.h>
|
||||
#include <osmocom/core/linuxlist.h>
|
||||
|
||||
#include <osmocom/gsm/protocol/gsm_04_08.h>
|
||||
#include <osmocom/gsm/gsm0502.h>
|
||||
|
||||
#include <osmo-bts/bts.h>
|
||||
#include <osmo-bts/rsl.h>
|
||||
#include <osmo-bts/logging.h>
|
||||
#include <osmo-bts/paging.h>
|
||||
#include <osmo-bts/signal.h>
|
||||
|
||||
#define MAX_PAGING_BLOCKS_CCCH 9
|
||||
#define MAX_BS_PA_MFRMS 9
|
||||
|
||||
struct paging_record {
|
||||
struct llist_head list;
|
||||
time_t expiration_time;
|
||||
uint8_t chan_needed;
|
||||
uint8_t identity_lv[9];
|
||||
};
|
||||
|
||||
struct paging_state {
|
||||
/* parameters taken / interpreted from BCCH/CCCH configuration */
|
||||
struct gsm48_control_channel_descr chan_desc;
|
||||
|
||||
/* configured otherwise */
|
||||
unsigned int paging_lifetime; /* in seconds */
|
||||
unsigned int num_paging_max;
|
||||
|
||||
/* total number of currently active paging records in queue */
|
||||
unsigned int num_paging;
|
||||
struct llist_head paging_queue[MAX_PAGING_BLOCKS_CCCH*MAX_BS_PA_MFRMS];
|
||||
};
|
||||
|
||||
static int tmsi_mi_to_uint(uint32_t *out, const uint8_t *tmsi_lv)
|
||||
{
|
||||
if (tmsi_lv[0] < 5)
|
||||
return -EINVAL;
|
||||
if ((tmsi_lv[1] & 7) != GSM_MI_TYPE_TMSI)
|
||||
return -EINVAL;
|
||||
|
||||
*out = *((uint32_t *)(tmsi_lv+2));
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* paging block numbers in a simple non-combined CCCH */
|
||||
static const uint8_t block_by_tdma51[51] = {
|
||||
255, 255, /* FCCH, SCH */
|
||||
255, 255, 255, 255, /* BCCH */
|
||||
0, 0, 0, 0, /* B0(6..9) */
|
||||
255, 255, /* FCCH, SCH */
|
||||
1, 1, 1, 1, /* B1(12..15) */
|
||||
2, 2, 2, 2, /* B2(16..19) */
|
||||
255, 255, /* FCCH, SCH */
|
||||
3, 3, 3, 3, /* B3(22..25) */
|
||||
4, 4, 4, 4, /* B3(26..29) */
|
||||
255, 255, /* FCCH, SCH */
|
||||
5, 5, 5, 5, /* B3(32..35) */
|
||||
6, 6, 6, 6, /* B3(36..39) */
|
||||
255, 255, /* FCCH, SCH */
|
||||
7, 7, 7, 7, /* B3(42..45) */
|
||||
8, 8, 8, 8, /* B3(46..49) */
|
||||
255, /* empty */
|
||||
};
|
||||
|
||||
/* get the paging block number _within_ current 51 multiframe */
|
||||
static int get_pag_idx_n(struct paging_state *ps, struct gsm_time *gt)
|
||||
{
|
||||
int blk_n = block_by_tdma51[gt->t3];
|
||||
int blk_idx;
|
||||
|
||||
if (blk_n == 255)
|
||||
return -EINVAL;
|
||||
|
||||
blk_idx = blk_n - ps->chan_desc.bs_ag_blks_res;
|
||||
if (blk_idx < 0)
|
||||
return -EINVAL;
|
||||
|
||||
return blk_idx;
|
||||
}
|
||||
|
||||
/* get paging block index over multiple 51 multiframes */
|
||||
static int get_pag_subch_nr(struct paging_state *ps, struct gsm_time *gt)
|
||||
{
|
||||
int pag_idx = get_pag_idx_n(ps, gt);
|
||||
unsigned int n_pag_blks_51 = gsm0502_get_n_pag_blocks(&ps->chan_desc);
|
||||
unsigned int mfrm_part;
|
||||
|
||||
if (pag_idx < 0)
|
||||
return pag_idx;
|
||||
|
||||
mfrm_part = ((gt->fn / 51) % (ps->chan_desc.bs_pa_mfrms+2)) * n_pag_blks_51;
|
||||
|
||||
return pag_idx + mfrm_part;
|
||||
}
|
||||
|
||||
|
||||
/* Add an identity to the paging queue */
|
||||
int paging_add_identity(struct paging_state *ps, uint8_t paging_group,
|
||||
const uint8_t *identity_lv, uint8_t chan_needed)
|
||||
{
|
||||
struct llist_head *group_q = &ps->paging_queue[paging_group];
|
||||
struct paging_record *pr;
|
||||
|
||||
if (ps->num_paging >= ps->num_paging_max) {
|
||||
LOGP(DPAG, LOGL_NOTICE, "Dropping paging, queue full (%u)\n",
|
||||
ps->num_paging);
|
||||
return -ENOSPC;
|
||||
}
|
||||
|
||||
/* Check if we already have this identity */
|
||||
llist_for_each_entry(pr, group_q, list) {
|
||||
if (identity_lv[0] == pr->identity_lv[0] &&
|
||||
!memcmp(identity_lv+1, pr->identity_lv+1, identity_lv[0])) {
|
||||
LOGP(DPAG, LOGL_INFO, "Ignoring duplicate paging\n");
|
||||
pr->expiration_time = time(NULL) + ps->paging_lifetime;
|
||||
return -EEXIST;
|
||||
}
|
||||
}
|
||||
|
||||
pr = talloc_zero(ps, struct paging_record);
|
||||
if (!pr)
|
||||
return -ENOMEM;
|
||||
|
||||
if (*identity_lv + 1 > sizeof(pr->identity_lv)) {
|
||||
talloc_free(pr);
|
||||
return -E2BIG;
|
||||
}
|
||||
|
||||
LOGP(DPAG, LOGL_INFO, "Add paging to queue (group=%u, queue_len=%u)\n",
|
||||
paging_group, ps->num_paging+1);
|
||||
|
||||
pr->expiration_time = time(NULL) + ps->paging_lifetime;
|
||||
pr->chan_needed = chan_needed;
|
||||
memcpy(&pr->identity_lv, identity_lv, identity_lv[0]+1);
|
||||
|
||||
/* enqueue the new identity to the HEAD of the queue,
|
||||
* to ensure it will be paged quickly at least once. */
|
||||
llist_add(&pr->list, group_q);
|
||||
ps->num_paging++;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int fill_paging_type_1(uint8_t *out_buf, const uint8_t *identity1_lv,
|
||||
uint8_t chan1, const uint8_t *identity2_lv,
|
||||
uint8_t chan2)
|
||||
{
|
||||
struct gsm48_paging1 *pt1 = (struct gsm48_paging1 *) out_buf;
|
||||
uint8_t *cur;
|
||||
|
||||
memset(out_buf, 0, sizeof(*pt1));
|
||||
|
||||
pt1->proto_discr = GSM48_PDISC_RR;
|
||||
pt1->msg_type = GSM48_MT_RR_PAG_REQ_1;
|
||||
pt1->pag_mode = GSM48_PM_NORMAL;
|
||||
pt1->cneed1 = chan1 & 3;
|
||||
pt1->cneed2 = chan2 & 3;
|
||||
cur = lv_put(pt1->data, identity1_lv[0], identity1_lv+1);
|
||||
if (identity2_lv)
|
||||
cur = lv_put(cur, identity2_lv[0], identity2_lv+1);
|
||||
|
||||
pt1->l2_plen = cur - out_buf - 1;
|
||||
|
||||
return cur - out_buf;
|
||||
}
|
||||
|
||||
static int fill_paging_type_2(uint8_t *out_buf, const uint8_t *tmsi1_lv,
|
||||
uint8_t cneed1, const uint8_t *tmsi2_lv,
|
||||
uint8_t cneed2, const uint8_t *identity3_lv)
|
||||
{
|
||||
struct gsm48_paging2 *pt2 = (struct gsm48_paging2 *) out_buf;
|
||||
uint8_t *cur;
|
||||
|
||||
memset(out_buf, 0, sizeof(*pt2));
|
||||
|
||||
pt2->proto_discr = GSM48_PDISC_RR;
|
||||
pt2->msg_type = GSM48_MT_RR_PAG_REQ_2;
|
||||
pt2->pag_mode = GSM48_PM_NORMAL;
|
||||
pt2->cneed1 = cneed1;
|
||||
pt2->cneed2 = cneed2;
|
||||
tmsi_mi_to_uint(&pt2->tmsi1, tmsi1_lv);
|
||||
tmsi_mi_to_uint(&pt2->tmsi2, tmsi2_lv);
|
||||
cur = out_buf + sizeof(*pt2);
|
||||
|
||||
if (identity3_lv)
|
||||
cur = lv_put(pt2->data, identity3_lv[0], identity3_lv+1);
|
||||
|
||||
pt2->l2_plen = cur - out_buf -1;
|
||||
|
||||
return cur - out_buf;
|
||||
}
|
||||
|
||||
static int fill_paging_type_3(uint8_t *out_buf, const uint8_t *tmsi1_lv,
|
||||
uint8_t cneed1, const uint8_t *tmsi2_lv,
|
||||
uint8_t cneed2, const uint8_t *tmsi3_lv,
|
||||
const uint8_t *tmsi4_lv)
|
||||
{
|
||||
struct gsm48_paging3 *pt3 = (struct gsm48_paging3 *) out_buf;
|
||||
uint8_t *cur;
|
||||
|
||||
memset(out_buf, 0, sizeof(*pt3));
|
||||
|
||||
pt3->proto_discr = GSM48_PDISC_RR;
|
||||
pt3->msg_type = GSM48_MT_RR_PAG_REQ_3;
|
||||
pt3->pag_mode = GSM48_PM_NORMAL;
|
||||
pt3->cneed1 = cneed1;
|
||||
pt3->cneed2 = cneed2;
|
||||
tmsi_mi_to_uint(&pt3->tmsi1, tmsi1_lv);
|
||||
tmsi_mi_to_uint(&pt3->tmsi2, tmsi2_lv);
|
||||
tmsi_mi_to_uint(&pt3->tmsi3, tmsi3_lv);
|
||||
tmsi_mi_to_uint(&pt3->tmsi4, tmsi4_lv);
|
||||
|
||||
cur = out_buf + sizeof(*pt3);
|
||||
|
||||
return cur - out_buf;
|
||||
}
|
||||
|
||||
static const uint8_t empty_id_lv[] = { 0x01, 0x00 };
|
||||
|
||||
static struct paging_record *dequeue_pr(struct llist_head *group_q)
|
||||
{
|
||||
struct paging_record *pr;
|
||||
|
||||
pr = llist_entry(group_q->next, struct paging_record, list);
|
||||
llist_del(&pr->list);
|
||||
|
||||
return pr;
|
||||
}
|
||||
|
||||
static int pr_is_imsi(struct paging_record *pr)
|
||||
{
|
||||
if ((pr->identity_lv[1] & 7) == GSM_MI_TYPE_IMSI)
|
||||
return 1;
|
||||
else
|
||||
return 0;
|
||||
}
|
||||
|
||||
static void sort_pr_tmsi_imsi(struct paging_record *pr[], unsigned int n)
|
||||
{
|
||||
int i, j;
|
||||
struct paging_record *t;
|
||||
|
||||
if (n < 2)
|
||||
return;
|
||||
|
||||
/* simple bubble sort */
|
||||
for (i = n-2; i >= 0; i--) {
|
||||
for (j=0; j<=i ; j++) {
|
||||
if (pr_is_imsi(pr[j]) > pr_is_imsi(pr[j+1])) {
|
||||
t = pr[j];
|
||||
pr[j] = pr[j+1];
|
||||
pr[j+1] = t;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* generate paging message for given gsm time */
|
||||
int paging_gen_msg(struct paging_state *ps, uint8_t *out_buf, struct gsm_time *gt)
|
||||
{
|
||||
unsigned int group = get_pag_subch_nr(ps, gt);
|
||||
struct llist_head *group_q = &ps->paging_queue[group];
|
||||
int len;
|
||||
|
||||
/* There is nobody to be paged, send Type1 with two empty ID */
|
||||
if (llist_empty(group_q)) {
|
||||
//DEBUGP(DPAG, "Tx PAGING TYPE 1 (empty)\n");
|
||||
len = fill_paging_type_1(out_buf, empty_id_lv, 0,
|
||||
NULL, 0);
|
||||
} else {
|
||||
struct paging_record *pr[4];
|
||||
unsigned int num_pr = 0;
|
||||
time_t now = time(NULL);
|
||||
unsigned int i, num_imsi = 0;
|
||||
|
||||
/* get (if we have) up to four paging records */
|
||||
for (i = 0; i < ARRAY_SIZE(pr); i++) {
|
||||
if (llist_empty(group_q))
|
||||
break;
|
||||
pr[i] = dequeue_pr(group_q);
|
||||
num_pr++;
|
||||
|
||||
/* count how many IMSIs are among them */
|
||||
if (pr_is_imsi(pr[i]))
|
||||
num_imsi++;
|
||||
}
|
||||
|
||||
/* make sure the TMSIs are ahead of the IMSIs in the array */
|
||||
sort_pr_tmsi_imsi(pr, num_pr);
|
||||
|
||||
if (num_pr == 4 && num_imsi == 0) {
|
||||
/* No IMSI: easy case, can use TYPE 3 */
|
||||
DEBUGP(DPAG, "Tx PAGING TYPE 3 (4 TMSI)\n");
|
||||
len = fill_paging_type_3(out_buf, pr[0]->identity_lv,
|
||||
pr[0]->chan_needed,
|
||||
pr[1]->identity_lv,
|
||||
pr[1]->chan_needed,
|
||||
pr[2]->identity_lv,
|
||||
pr[3]->identity_lv);
|
||||
} else if (num_pr >= 3 && num_imsi <= 1) {
|
||||
/* 3 or 4, of which only up to 1 is IMSI */
|
||||
DEBUGP(DPAG, "Tx PAGING TYPE 2 (2 TMSI,1 xMSI)\n");
|
||||
len = fill_paging_type_2(out_buf,
|
||||
pr[0]->identity_lv,
|
||||
pr[0]->chan_needed,
|
||||
pr[1]->identity_lv,
|
||||
pr[1]->chan_needed,
|
||||
pr[2]->identity_lv);
|
||||
if (num_pr == 4) {
|
||||
/* re-add #4 for next time */
|
||||
llist_add(&pr[3]->list, group_q);
|
||||
pr[3] = NULL;
|
||||
}
|
||||
} else if (num_pr == 1) {
|
||||
DEBUGP(DPAG, "Tx PAGING TYPE 1 (1 xMSI,1 empty)\n");
|
||||
len = fill_paging_type_1(out_buf, pr[0]->identity_lv,
|
||||
pr[0]->chan_needed, NULL, 0);
|
||||
} else {
|
||||
/* 2 (any type) or
|
||||
* 3 or 4, of which only 2 will be sent */
|
||||
DEBUGP(DPAG, "Tx PAGING TYPE 1 (2 xMSI)\n");
|
||||
len = fill_paging_type_1(out_buf, pr[0]->identity_lv,
|
||||
pr[0]->chan_needed,
|
||||
pr[1]->identity_lv,
|
||||
pr[1]->chan_needed);
|
||||
if (num_pr >= 3) {
|
||||
/* re-add #4 for next time */
|
||||
llist_add(&pr[2]->list, group_q);
|
||||
pr[2] = NULL;
|
||||
}
|
||||
if (num_pr == 4) {
|
||||
/* re-add #4 for next time */
|
||||
llist_add(&pr[3]->list, group_q);
|
||||
pr[3] = NULL;
|
||||
}
|
||||
}
|
||||
|
||||
for (i = 0; i < num_pr; i++) {
|
||||
/* skip those that we might have re-added above */
|
||||
if (pr[i] == NULL)
|
||||
continue;
|
||||
/* check if we can expire the paging record,
|
||||
* or if we need to re-queue it */
|
||||
if (pr[i]->expiration_time >= now) {
|
||||
talloc_free(pr[i]);
|
||||
ps->num_paging--;
|
||||
LOGP(DPAG, LOGL_INFO, "Removed paging record, queue_len=%u\n",
|
||||
ps->num_paging);
|
||||
} else
|
||||
llist_add_tail(&pr[i]->list, group_q);
|
||||
}
|
||||
}
|
||||
memset(out_buf+len, 0x2B, GSM_MACBLOCK_LEN-len);
|
||||
return len;
|
||||
}
|
||||
|
||||
int paging_si_update(struct paging_state *ps, struct gsm48_control_channel_descr *chan_desc)
|
||||
{
|
||||
LOGP(DPAG, LOGL_INFO, "Paging SI update\n");
|
||||
|
||||
memcpy(&ps->chan_desc, chan_desc, sizeof(chan_desc));
|
||||
|
||||
/* FIXME: do we need to re-sort the old paging_records? */
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int paging_signal_cbfn(unsigned int subsys, unsigned int signal, void *hdlr_data,
|
||||
void *signal_data)
|
||||
{
|
||||
if (subsys == SS_GLOBAL && signal == S_NEW_SYSINFO) {
|
||||
struct gsm_bts *bts = signal_data;
|
||||
struct gsm_bts_role_bts *btsb = bts->role;
|
||||
struct paging_state *ps = btsb->paging_state;
|
||||
struct gsm48_system_information_type_3 *si3 = (void *) bts->si_buf[SYSINFO_TYPE_3];
|
||||
|
||||
paging_si_update(ps, &si3->control_channel_desc);
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int initialized = 0;
|
||||
|
||||
struct paging_state *paging_init(void *ctx, unsigned int num_paging_max,
|
||||
unsigned int paging_lifetime)
|
||||
{
|
||||
struct paging_state *ps;
|
||||
unsigned int i;
|
||||
|
||||
ps = talloc_zero(ctx, struct paging_state);
|
||||
if (!ps)
|
||||
return NULL;
|
||||
|
||||
ps->paging_lifetime = paging_lifetime;
|
||||
ps->num_paging_max = num_paging_max;
|
||||
|
||||
for (i = 0; i < ARRAY_SIZE(ps->paging_queue); i++)
|
||||
INIT_LLIST_HEAD(&ps->paging_queue[i]);
|
||||
|
||||
if (!initialized) {
|
||||
osmo_signal_register_handler(SS_GLOBAL, paging_signal_cbfn, NULL);
|
||||
initialized = 1;
|
||||
}
|
||||
return ps;
|
||||
}
|
792
src/common/rsl.c
792
src/common/rsl.c
File diff suppressed because it is too large
Load Diff
|
@ -1,11 +1,12 @@
|
|||
/*
|
||||
* (C) 2011 by Andreas Eversberg <jolly@eversberg.eu>
|
||||
/* RTP code for BTS side */
|
||||
|
||||
/* (C) 2011 by Andreas Eversberg <jolly@eversberg.eu>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||
* the Free Software Foundation; either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
|
@ -13,16 +14,11 @@
|
|||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along
|
||||
* with this program; if not, write to the Free Software Foundation, Inc.,
|
||||
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
/*
|
||||
* RTP peer
|
||||
*/
|
||||
|
||||
#include <errno.h>
|
||||
#include <sys/types.h>
|
||||
#include <arpa/inet.h>
|
||||
|
|
|
@ -3,8 +3,8 @@
|
|||
* All Rights Reserved
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||
* the Free Software Foundation; either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
|
@ -12,9 +12,8 @@
|
|||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along
|
||||
* with this program; if not, write to the Free Software Foundation, Inc.,
|
||||
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
|
|
|
@ -0,0 +1,66 @@
|
|||
/* (C) 2011 by Harald Welte <laforge@gnumonks.org>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||
* the Free Software Foundation; either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
#include <stdint.h>
|
||||
|
||||
#include <osmocom/gsm/gsm_utils.h>
|
||||
#include <osmocom/gsm/sysinfo.h>
|
||||
|
||||
#include <osmo-bts/gsm_data.h>
|
||||
|
||||
uint8_t *bts_sysinfo_get(struct gsm_bts *bts, struct gsm_time *g_time)
|
||||
{
|
||||
/* Apply the rules from 05.02 6.3.1.3 Mapping of BCCH Data */
|
||||
switch (g_time->tc) {
|
||||
case 0:
|
||||
return GSM_BTS_SI(bts, SYSINFO_TYPE_1);
|
||||
case 1:
|
||||
return GSM_BTS_SI(bts, SYSINFO_TYPE_2);
|
||||
case 2:
|
||||
return GSM_BTS_SI(bts, SYSINFO_TYPE_3);
|
||||
case 3:
|
||||
return GSM_BTS_SI(bts, SYSINFO_TYPE_4);
|
||||
case 4:
|
||||
/* 2ter, 2quater, 9, 13 */
|
||||
break;
|
||||
case 5:
|
||||
/* 2ter, 2quater */
|
||||
break;
|
||||
case 6:
|
||||
return GSM_BTS_SI(bts, SYSINFO_TYPE_3);
|
||||
case 7:
|
||||
return GSM_BTS_SI(bts, SYSINFO_TYPE_4);
|
||||
}
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
uint8_t *lchan_sacch_get(struct gsm_lchan *lchan, struct gsm_time *g_time)
|
||||
{
|
||||
uint32_t tmp;
|
||||
|
||||
for (tmp = lchan->si.last + 1; tmp != lchan->si.last; tmp = (tmp + 1) % 32) {
|
||||
if (lchan->si.valid & (1 << tmp)) {
|
||||
lchan->si.last = tmp;
|
||||
printf("returning SACCH SI type %u\n", tmp);
|
||||
return lchan->si.buf[tmp];
|
||||
}
|
||||
}
|
||||
return NULL;
|
||||
}
|
|
@ -0,0 +1,61 @@
|
|||
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
#include <osmocom/vty/vty.h>
|
||||
|
||||
#include <osmo-bts/vty.h>
|
||||
|
||||
enum node_type bts_vty_go_parent(struct vty *vty)
|
||||
{
|
||||
switch (vty->node) {
|
||||
default:
|
||||
vty->node = CONFIG_NODE;
|
||||
}
|
||||
return vty->node;
|
||||
}
|
||||
|
||||
int bts_vty_is_config_node(struct vty *vty, int node)
|
||||
{
|
||||
switch (node) {
|
||||
default:
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
|
||||
gDEFUN(ournode_exit, ournode_exit_cmd, "exit",
|
||||
"Exit current node, go down to provious node")
|
||||
{
|
||||
switch (vty->node) {
|
||||
default:
|
||||
break;
|
||||
}
|
||||
return CMD_SUCCESS;
|
||||
}
|
||||
|
||||
gDEFUN(ournode_end, ournode_end_cmd, "end",
|
||||
"End current mode and change to enable mode")
|
||||
{
|
||||
switch (vty->node) {
|
||||
default:
|
||||
vty_config_unlock(vty);
|
||||
vty->node = ENABLE_NODE;
|
||||
vty->index = NULL;
|
||||
vty->index_sub = NULL;
|
||||
break;
|
||||
}
|
||||
return CMD_SUCCESS;
|
||||
}
|
||||
|
||||
struct vty_app_info bts_vty_info = {
|
||||
.name = "OsmoBTS",
|
||||
.version = PACKAGE_VERSION,
|
||||
.go_parent_cb = bts_vty_go_parent,
|
||||
.is_config_node = bts_vty_is_config_node,
|
||||
};
|
||||
|
||||
const char *osmobts_copyright =
|
||||
"Copyright (C) 2010, 2011 by Harald Welte and Andreas Eversberg\r\n"
|
||||
"License AGPLv3+: GNU AGPL version 3 or later <http://gnu.org/licenses/agpl-3.0.html>\r\n"
|
||||
"This is free software: you are free to change and redistribute it.\r\n"
|
||||
"There is NO WARRANTY, to the extent permitted by law.\r\n";
|
|
@ -189,12 +189,12 @@ int l1ctl_tx_data_req(struct osmocom_ms *ms, struct msgb *msg,
|
|||
uint8_t chan_type, chan_ts, chan_ss;
|
||||
uint8_t gsmtap_chan_type;
|
||||
|
||||
if (msgb_l2len(msg) > 23) {
|
||||
if (msgb_l2len(msg) > GSM_MACBLOCK_LEN) {
|
||||
LOGP(DL1C, LOGL_ERROR, "L1 cannot handle message length "
|
||||
"> 23 (%u)\n", msgb_l2len(msg));
|
||||
msgb_free(msg);
|
||||
return -EINVAL;
|
||||
} else if (msgb_l2len(msg) < 23)
|
||||
} else if (msgb_l2len(msg) < GSM_MACBLOCK_LEN)
|
||||
LOGP(DL1C, LOGL_ERROR, "L1 message length < 23 (%u) "
|
||||
"doesn't seem right!\n", msgb_l2len(msg));
|
||||
|
||||
|
|
|
@ -0,0 +1,16 @@
|
|||
INCLUDES = $(all_includes) -I$(top_srcdir)/include
|
||||
AM_CFLAGS = -Wall $(LIBOSMOCORE_CFLAGS) $(LIBOSMOGSM_CFLAGS) $(LIBOSMOVTY_CFLAGS)
|
||||
LDADD = $(LIBOSMOCORE_LIBS) $(LIBOSMOGSM_LIBS) $(LIBOSMOVTY_LIBS)
|
||||
|
||||
bin_PROGRAMS = sysmobts sysmobts-remote l1fwd-proxy
|
||||
|
||||
COMMON_SOURCES = main.c femtobts.c l1_if.c oml.c bts_model.c
|
||||
|
||||
sysmobts_SOURCES = $(COMMON_SOURCES) l1_transp_hw.c
|
||||
sysmobts_LDADD = $(top_builddir)/src/common/libbts.a $(LDADD)
|
||||
|
||||
sysmobts_remote_SOURCES = $(COMMON_SOURCES) l1_transp_fwd.c
|
||||
sysmobts_remote_LDADD = $(top_builddir)/src/common/libbts.a $(LDADD)
|
||||
|
||||
l1fwd_proxy_SOURCES = l1_fwd_main.c l1_transp_hw.c
|
||||
l1fwd_proxy_LDADD = $(top_builddir)/src/common/libbts.a $(LDADD)
|
|
@ -0,0 +1,41 @@
|
|||
|
||||
/* (C) 2011 by Harald Welte <laforge@gnumonks.org>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||
* the Free Software Foundation; either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
#include <osmo-bts/gsm_data.h>
|
||||
#include <osmo-bts/rsl.h>
|
||||
#include <osmo-bts/oml.h>
|
||||
#include <osmo-bts/bts_model.h>
|
||||
|
||||
int bts_model_rsl_chan_act(struct gsm_lchan *lchan, struct tlv_parsed *tp)
|
||||
{
|
||||
uint8_t mode = *TLVP_VAL(tp, RSL_IE_CHAN_MODE);
|
||||
uint8_t type = *TLVP_VAL(tp, RSL_IE_ACT_TYPE);
|
||||
|
||||
lchan_activate(lchan);
|
||||
/* FIXME: only do this in case of success */
|
||||
|
||||
return rsl_tx_chan_act_ack(lchan, bts_model_get_time(lchan->ts->trx->bts));
|
||||
}
|
||||
|
||||
int bts_model_rsl_chan_rel(struct gsm_lchan *lchan)
|
||||
{
|
||||
lchan_deactivate(lchan);
|
||||
return rsl_tx_rf_rel_ack(lchan);
|
||||
}
|
|
@ -0,0 +1,186 @@
|
|||
/* sysmocom femtobts L1 API related definitions */
|
||||
|
||||
/* (C) 2011 by Harald Welte <laforge@gnumonks.org>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||
* the Free Software Foundation; either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
#include "femtobts.h"
|
||||
|
||||
const enum l1prim_type femtobts_l1prim_type[GsmL1_PrimId_NUM] = {
|
||||
[GsmL1_PrimId_MphInitReq] = L1P_T_REQ,
|
||||
[GsmL1_PrimId_MphCloseReq] = L1P_T_REQ,
|
||||
[GsmL1_PrimId_MphConnectReq] = L1P_T_REQ,
|
||||
[GsmL1_PrimId_MphDisconnectReq] = L1P_T_REQ,
|
||||
[GsmL1_PrimId_MphActivateReq] = L1P_T_REQ,
|
||||
[GsmL1_PrimId_MphDeactivateReq] = L1P_T_REQ,
|
||||
[GsmL1_PrimId_MphConfigReq] = L1P_T_REQ,
|
||||
[GsmL1_PrimId_MphMeasureReq] = L1P_T_REQ,
|
||||
[GsmL1_PrimId_MphInitCnf] = L1P_T_CONF,
|
||||
[GsmL1_PrimId_MphCloseCnf] = L1P_T_CONF,
|
||||
[GsmL1_PrimId_MphConnectCnf] = L1P_T_CONF,
|
||||
[GsmL1_PrimId_MphDisconnectCnf] = L1P_T_CONF,
|
||||
[GsmL1_PrimId_MphActivateCnf] = L1P_T_CONF,
|
||||
[GsmL1_PrimId_MphDeactivateCnf] = L1P_T_CONF,
|
||||
[GsmL1_PrimId_MphConfigCnf] = L1P_T_CONF,
|
||||
[GsmL1_PrimId_MphMeasureCnf] = L1P_T_CONF,
|
||||
[GsmL1_PrimId_MphTimeInd] = L1P_T_IND,
|
||||
[GsmL1_PrimId_MphSyncInd] = L1P_T_IND,
|
||||
[GsmL1_PrimId_PhEmptyFrameReq] = L1P_T_REQ,
|
||||
[GsmL1_PrimId_PhDataReq] = L1P_T_REQ,
|
||||
[GsmL1_PrimId_PhConnectInd] = L1P_T_IND,
|
||||
[GsmL1_PrimId_PhReadyToSendInd] = L1P_T_IND,
|
||||
[GsmL1_PrimId_PhDataInd] = L1P_T_IND,
|
||||
[GsmL1_PrimId_PhRaInd] = L1P_T_IND,
|
||||
};
|
||||
|
||||
const struct value_string femtobts_l1prim_names[GsmL1_PrimId_NUM+1] = {
|
||||
{ GsmL1_PrimId_MphInitReq, "MPH-INIT.req" },
|
||||
{ GsmL1_PrimId_MphCloseReq, "MPH-CLOSE.req" },
|
||||
{ GsmL1_PrimId_MphConnectReq, "MPH-CONNECT.req" },
|
||||
{ GsmL1_PrimId_MphDisconnectReq,"MPH-DISCONNECT.req" },
|
||||
{ GsmL1_PrimId_MphActivateReq, "MPH-ACTIVATE.req" },
|
||||
{ GsmL1_PrimId_MphDeactivateReq,"MPH-DEACTIVATE.req" },
|
||||
{ GsmL1_PrimId_MphConfigReq, "MPH-CONFIG.req" },
|
||||
{ GsmL1_PrimId_MphMeasureReq, "MPH-MEASURE.req" },
|
||||
{ GsmL1_PrimId_MphInitCnf, "MPH-INIT.conf" },
|
||||
{ GsmL1_PrimId_MphCloseCnf, "MPH-CLOSE.conf" },
|
||||
{ GsmL1_PrimId_MphConnectCnf, "MPH-CONNECT.conf" },
|
||||
{ GsmL1_PrimId_MphDisconnectCnf,"MPH-DISCONNECT.conf" },
|
||||
{ GsmL1_PrimId_MphActivateCnf, "MPH-ACTIVATE.conf" },
|
||||
{ GsmL1_PrimId_MphDeactivateCnf,"MPH-DEACTIVATE.conf" },
|
||||
{ GsmL1_PrimId_MphConfigCnf, "MPH-CONFIG.conf" },
|
||||
{ GsmL1_PrimId_MphMeasureCnf, "MPH-MEASURE.conf" },
|
||||
{ GsmL1_PrimId_MphTimeInd, "MPH-TIME.ind" },
|
||||
{ GsmL1_PrimId_MphSyncInd, "MPH-SYNC.ind" },
|
||||
{ GsmL1_PrimId_PhEmptyFrameReq, "PH-EMPTY_FRAME.req" },
|
||||
{ GsmL1_PrimId_PhDataReq, "PH-DATA.req" },
|
||||
{ GsmL1_PrimId_PhConnectInd, "PH-CONNECT.ind" },
|
||||
{ GsmL1_PrimId_PhReadyToSendInd,"PH-READY_TO_SEND.ind" },
|
||||
{ GsmL1_PrimId_PhDataInd, "PH-DATA.ind" },
|
||||
{ GsmL1_PrimId_PhRaInd, "PH-RA.ind" },
|
||||
{ 0, NULL }
|
||||
};
|
||||
|
||||
const GsmL1_PrimId_t femtobts_l1prim_req2conf[GsmL1_PrimId_NUM] = {
|
||||
[GsmL1_PrimId_MphInitReq] = GsmL1_PrimId_MphInitCnf,
|
||||
[GsmL1_PrimId_MphCloseReq] = GsmL1_PrimId_MphCloseCnf,
|
||||
[GsmL1_PrimId_MphConnectReq] = GsmL1_PrimId_MphConnectCnf,
|
||||
[GsmL1_PrimId_MphDisconnectReq] = GsmL1_PrimId_MphDisconnectCnf,
|
||||
[GsmL1_PrimId_MphActivateReq] = GsmL1_PrimId_MphActivateCnf,
|
||||
[GsmL1_PrimId_MphDeactivateReq] = GsmL1_PrimId_MphDeactivateCnf,
|
||||
[GsmL1_PrimId_MphConfigReq] = GsmL1_PrimId_MphConfigCnf,
|
||||
[GsmL1_PrimId_MphMeasureReq] = GsmL1_PrimId_MphMeasureCnf,
|
||||
};
|
||||
|
||||
const enum l1prim_type femtobts_sysprim_type[FemtoBts_PrimId_NUM] = {
|
||||
[FemtoBts_PrimId_SystemInfoReq] = L1P_T_REQ,
|
||||
[FemtoBts_PrimId_SystemInfoCnf] = L1P_T_CONF,
|
||||
[FemtoBts_PrimId_SystemFailureInd] = L1P_T_IND,
|
||||
[FemtoBts_PrimId_ActivateRfReq] = L1P_T_REQ,
|
||||
[FemtoBts_PrimId_ActivateRfCnf] = L1P_T_CONF,
|
||||
[FemtoBts_PrimId_DeactivateRfReq] = L1P_T_REQ,
|
||||
[FemtoBts_PrimId_DeactivateRfCnf] = L1P_T_CONF,
|
||||
[FemtoBts_PrimId_SetTraceFlagsReq] = L1P_T_REQ,
|
||||
[FemtoBts_PrimId_RfClockInfoReq] = L1P_T_REQ,
|
||||
[FemtoBts_PrimId_RfClockInfoCnf] = L1P_T_CONF,
|
||||
[FemtoBts_PrimId_RfClockSetupReq] = L1P_T_REQ,
|
||||
[FemtoBts_PrimId_RfClockSetupCnf] = L1P_T_CONF,
|
||||
[FemtoBts_PrimId_Layer1ResetReq] = L1P_T_REQ,
|
||||
[FemtoBts_PrimId_Layer1ResetCnf] = L1P_T_CONF,
|
||||
};
|
||||
|
||||
const struct value_string femtobts_sysprim_names[FemtoBts_PrimId_NUM+1] = {
|
||||
{ FemtoBts_PrimId_SystemInfoReq, "SYSTEM-INFO.req" },
|
||||
{ FemtoBts_PrimId_SystemInfoCnf, "SYSTEM-INFO.conf" },
|
||||
{ FemtoBts_PrimId_SystemFailureInd, "SYSTEM-FAILURE.ind" },
|
||||
{ FemtoBts_PrimId_ActivateRfReq, "ACTIVATE-RF.req" },
|
||||
{ FemtoBts_PrimId_ActivateRfCnf, "ACTIVATE-RF.conf" },
|
||||
{ FemtoBts_PrimId_DeactivateRfReq, "DEACTIVATE-RF.req" },
|
||||
{ FemtoBts_PrimId_DeactivateRfCnf, "DEACTIVATE-RF.conf" },
|
||||
{ FemtoBts_PrimId_SetTraceFlagsReq, "SET-TRACE-FLAGS.req" },
|
||||
{ FemtoBts_PrimId_RfClockInfoReq, "RF-CLOCK-INFO.req" },
|
||||
{ FemtoBts_PrimId_RfClockInfoCnf, "RF-CLOCK-INFO.conf" },
|
||||
{ FemtoBts_PrimId_RfClockSetupReq, "RF-CLOCK-SETUP.req" },
|
||||
{ FemtoBts_PrimId_RfClockSetupCnf, "RF-CLOCK-SETUP.conf" },
|
||||
{ FemtoBts_PrimId_Layer1ResetReq, "LAYER1-RESET.req" },
|
||||
{ FemtoBts_PrimId_Layer1ResetCnf, "LAYER1-RESET.conf" },
|
||||
{ 0, NULL }
|
||||
};
|
||||
|
||||
const FemtoBts_PrimId_t femtobts_sysprim_req2conf[FemtoBts_PrimId_NUM] = {
|
||||
[FemtoBts_PrimId_SystemInfoReq] = FemtoBts_PrimId_SystemInfoCnf,
|
||||
[FemtoBts_PrimId_ActivateRfReq] = FemtoBts_PrimId_ActivateRfCnf,
|
||||
[FemtoBts_PrimId_DeactivateRfReq] = FemtoBts_PrimId_DeactivateRfCnf,
|
||||
[FemtoBts_PrimId_RfClockInfoReq] = FemtoBts_PrimId_RfClockInfoCnf,
|
||||
[FemtoBts_PrimId_RfClockSetupReq] = FemtoBts_PrimId_RfClockSetupCnf,
|
||||
[FemtoBts_PrimId_Layer1ResetReq] = FemtoBts_PrimId_Layer1ResetCnf,
|
||||
};
|
||||
|
||||
const struct value_string femtobts_l1sapi_names[GsmL1_Sapi_NUM+1] = {
|
||||
{ GsmL1_Sapi_Fcch, "FCCH" },
|
||||
{ GsmL1_Sapi_Sch, "SCH" },
|
||||
{ GsmL1_Sapi_Sacch, "SACCH" },
|
||||
{ GsmL1_Sapi_Sdcch, "SDCCH" },
|
||||
{ GsmL1_Sapi_Bcch, "BCCH" },
|
||||
{ GsmL1_Sapi_Pch, "PCH" },
|
||||
{ GsmL1_Sapi_Agch, "AGCH" },
|
||||
{ GsmL1_Sapi_Cbch, "CBCH" },
|
||||
{ GsmL1_Sapi_Rach, "RACH" },
|
||||
{ GsmL1_Sapi_TchF, "TCH/F" },
|
||||
{ GsmL1_Sapi_FacchF, "FACCH/F" },
|
||||
{ GsmL1_Sapi_TchH, "TCH/H" },
|
||||
{ GsmL1_Sapi_FacchH, "FACCH/H" },
|
||||
{ GsmL1_Sapi_Nch, "NCH" },
|
||||
{ GsmL1_Sapi_Pdtch, "PDTCH" },
|
||||
{ GsmL1_Sapi_Pacch, "PACCH" },
|
||||
{ GsmL1_Sapi_Pbcch, "PBCCH" },
|
||||
{ GsmL1_Sapi_Pagch, "PAGCH" },
|
||||
{ GsmL1_Sapi_Ppch, "PPCH" },
|
||||
{ GsmL1_Sapi_Pnch, "PNCH" },
|
||||
{ GsmL1_Sapi_Ptcch, "PTCCH" },
|
||||
{ GsmL1_Sapi_Prach, "PRACH" },
|
||||
{ 0, NULL }
|
||||
};
|
||||
|
||||
const struct value_string femtobts_l1status_names[GSML1_STATUS_NUM+1] = {
|
||||
{ GsmL1_Status_Success, "Success" },
|
||||
{ GsmL1_Status_Generic, "Generic error" },
|
||||
{ GsmL1_Status_NoMemory, "Not enough memory" },
|
||||
{ GsmL1_Status_Timeout, "Timeout" },
|
||||
{ GsmL1_Status_InvalidParam, "Invalid parameter" },
|
||||
{ GsmL1_Status_Busy, "Resource busy" },
|
||||
{ GsmL1_Status_NoRessource, "No more resources" },
|
||||
{ GsmL1_Status_Uninitialized, "Trying to use uninitialized resource" },
|
||||
{ GsmL1_Status_NullInterface, "Trying to call a NULL interface" },
|
||||
{ GsmL1_Status_NullFctnPtr, "Trying to call a NULL function ptr" },
|
||||
{ GsmL1_Status_BadCrc, "Bad CRC" },
|
||||
{ GsmL1_Status_BadUsf, "Bad USF" },
|
||||
{ GsmL1_Status_InvalidCPS, "Invalid CPS field" },
|
||||
{ GsmL1_Status_UnexpectedBurst, "Unexpected burst" },
|
||||
{ GsmL1_Status_UnavailCodec, "AMR codec is unavailable" },
|
||||
{ GsmL1_Status_CriticalError, "Critical error" },
|
||||
{ GsmL1_Status_OverheatError, "Overheat error" },
|
||||
{ GsmL1_Status_DeviceError, "Device error" },
|
||||
{ GsmL1_Status_FacchError, "FACCH / TCH order error" },
|
||||
{ GsmL1_Status_AlreadyDeactivated, "Lchan already deactivated" },
|
||||
{ GsmL1_Status_TxBurstFifoOvrn, "FIFO overrun" },
|
||||
{ GsmL1_Status_TxBurstFifoUndr, "FIFO underrun" },
|
||||
{ GsmL1_Status_NotSynchronized, "Not synchronized" },
|
||||
{ GsmL1_Status_Unsupported, "Unsupported feature" },
|
||||
{ 0, NULL }
|
||||
};
|
|
@ -0,0 +1,28 @@
|
|||
#ifndef FEMTOBTS_H
|
||||
#define FEMTOBTS_H
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <osmocom/core/utils.h>
|
||||
|
||||
#include <sysmocom/femtobts/femtobts.h>
|
||||
#include <sysmocom/femtobts/gsml1const.h>
|
||||
|
||||
enum l1prim_type {
|
||||
L1P_T_REQ,
|
||||
L1P_T_CONF,
|
||||
L1P_T_IND,
|
||||
};
|
||||
|
||||
|
||||
const enum l1prim_type femtobts_l1prim_type[GsmL1_PrimId_NUM];
|
||||
const struct value_string femtobts_l1prim_names[GsmL1_PrimId_NUM+1];
|
||||
const GsmL1_PrimId_t femtobts_l1prim_req2conf[GsmL1_PrimId_NUM];
|
||||
|
||||
const enum l1prim_type femtobts_sysprim_type[FemtoBts_PrimId_NUM];
|
||||
const struct value_string femtobts_sysprim_names[FemtoBts_PrimId_NUM+1];
|
||||
const FemtoBts_PrimId_t femtobts_sysprim_req2conf[FemtoBts_PrimId_NUM];
|
||||
|
||||
const struct value_string femtobts_l1sapi_names[GsmL1_Sapi_NUM+1];
|
||||
const struct value_string femtobts_l1status_names[GSML1_STATUS_NUM+1];
|
||||
|
||||
#endif /* FEMTOBTS_H */
|
|
@ -0,0 +1,3 @@
|
|||
#define L1FWD_L1_PORT 9999
|
||||
#define L1FWD_SYS_PORT 9998
|
||||
|
|
@ -0,0 +1,205 @@
|
|||
/* Sysmocom femtobts L1 proxy */
|
||||
|
||||
/* (C) 2011 by Harald Welte <laforge@gnumonks.org>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||
* the Free Software Foundation; either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
#include <stdint.h>
|
||||
#include <unistd.h>
|
||||
#include <errno.h>
|
||||
#include <fcntl.h>
|
||||
|
||||
#include <sys/types.h>
|
||||
#include <sys/socket.h>
|
||||
#include <sys/stat.h>
|
||||
|
||||
#include <arpa/inet.h>
|
||||
#include <netinet/in.h>
|
||||
|
||||
#include <osmocom/core/talloc.h>
|
||||
#include <osmocom/core/utils.h>
|
||||
#include <osmocom/core/select.h>
|
||||
#include <osmocom/core/write_queue.h>
|
||||
#include <osmocom/core/logging.h>
|
||||
#include <osmocom/core/socket.h>
|
||||
#include <osmocom/gsm/gsm_utils.h>
|
||||
|
||||
#include <osmo-bts/logging.h>
|
||||
#include <osmo-bts/gsm_data.h>
|
||||
|
||||
#include <sysmocom/femtobts/femtobts.h>
|
||||
#include <sysmocom/femtobts/gsml1prim.h>
|
||||
#include <sysmocom/femtobts/gsml1const.h>
|
||||
#include <sysmocom/femtobts/gsml1types.h>
|
||||
|
||||
#include "femtobts.h"
|
||||
#include "l1_if.h"
|
||||
#include "l1_fwd.h"
|
||||
|
||||
static const uint16_t fwd_udp_ports[_NUM_MQ_WRITE] = {
|
||||
[MQ_SYS_READ] = L1FWD_SYS_PORT,
|
||||
[MQ_L1_READ] = L1FWD_L1_PORT,
|
||||
};
|
||||
|
||||
struct l1fwd_hdl {
|
||||
struct sockaddr_storage remote_sa;
|
||||
socklen_t remote_sa_len;
|
||||
|
||||
struct osmo_wqueue udp_wq[_NUM_MQ_WRITE];
|
||||
|
||||
struct femtol1_hdl *fl1h;
|
||||
};
|
||||
|
||||
|
||||
/* callback when there's a new L1 primitive coming in from the HW */
|
||||
int l1if_handle_l1prim(struct femtol1_hdl *fl1h, struct msgb *msg)
|
||||
{
|
||||
struct l1fwd_hdl *l1fh = fl1h->priv;
|
||||
|
||||
/* Enqueue message to UDP socket */
|
||||
return osmo_wqueue_enqueue(&l1fh->udp_wq[MQ_L1_WRITE], msg);
|
||||
}
|
||||
|
||||
/* callback when there's a new SYS primitive coming in from the HW */
|
||||
int l1if_handle_sysprim(struct femtol1_hdl *fl1h, struct msgb *msg)
|
||||
{
|
||||
struct l1fwd_hdl *l1fh = fl1h->priv;
|
||||
|
||||
/* Enqueue message to UDP socket */
|
||||
return osmo_wqueue_enqueue(&l1fh->udp_wq[MQ_SYS_WRITE], msg);
|
||||
}
|
||||
|
||||
|
||||
/* data has arrived on the udp socket */
|
||||
static int udp_read_cb(struct osmo_fd *ofd)
|
||||
{
|
||||
struct msgb *msg = msgb_alloc_headroom(2048, 128, "udp_rx");
|
||||
struct l1fwd_hdl *l1fh = ofd->data;
|
||||
struct femtol1_hdl *fl1h = l1fh->fl1h;
|
||||
int rc;
|
||||
|
||||
if (!msg)
|
||||
return -ENOMEM;
|
||||
|
||||
msg->l1h = msg->data;
|
||||
|
||||
l1fh->remote_sa_len = sizeof(l1fh->remote_sa);
|
||||
rc = recvfrom(ofd->fd, msg->l1h, msgb_tailroom(msg), 0,
|
||||
(struct sockaddr *) &l1fh->remote_sa, &l1fh->remote_sa_len);
|
||||
if (rc < 0) {
|
||||
perror("read from udp");
|
||||
msgb_free(msg);
|
||||
return rc;
|
||||
} else if (rc == 0) {
|
||||
perror("len=0 read from udp");
|
||||
msgb_free(msg);
|
||||
return rc;
|
||||
}
|
||||
msgb_put(msg, rc);
|
||||
|
||||
DEBUGP(DL1C, "UDP: Received %u bytes for %s queue\n", rc,
|
||||
ofd->priv_nr == MQ_SYS_WRITE ? "SYS" : "L1");
|
||||
|
||||
/* put the message into the right queue */
|
||||
if (ofd->priv_nr == MQ_SYS_WRITE)
|
||||
rc = osmo_wqueue_enqueue(&fl1h->write_q[MQ_SYS_WRITE], msg);
|
||||
else
|
||||
rc = osmo_wqueue_enqueue(&fl1h->write_q[MQ_L1_WRITE], msg);
|
||||
|
||||
return rc;
|
||||
}
|
||||
|
||||
/* callback when we can write to the UDP socket */
|
||||
static int udp_write_cb(struct osmo_fd *ofd, struct msgb *msg)
|
||||
{
|
||||
int rc;
|
||||
struct l1fwd_hdl *l1fh = ofd->data;
|
||||
|
||||
DEBUGP(DL1C, "UDP: Writing %u bytes for %s queue\n", msgb_l1len(msg),
|
||||
ofd->priv_nr == MQ_SYS_WRITE ? "SYS" : "L1");
|
||||
|
||||
rc = sendto(ofd->fd, msg->l1h, msgb_l1len(msg), 0,
|
||||
(const struct sockaddr *)&l1fh->remote_sa, l1fh->remote_sa_len);
|
||||
if (rc < 0) {
|
||||
LOGP(DL1C, LOGL_ERROR, "error writing to L1 msg_queue: %s\n",
|
||||
strerror(errno));
|
||||
return rc;
|
||||
} else if (rc < msgb_l1len(msg)) {
|
||||
LOGP(DL1C, LOGL_ERROR, "short write to L1 msg_queue: "
|
||||
"%u < %u\n", rc, msgb_l1len(msg));
|
||||
return -EIO;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int main(int argc, char **argv)
|
||||
{
|
||||
struct l1fwd_hdl *l1fh;
|
||||
struct femtol1_hdl *fl1h;
|
||||
int rc, i;
|
||||
|
||||
printf("sizeof(GsmL1_Prim_t) = %lu\n", sizeof(GsmL1_Prim_t));
|
||||
printf("sizeof(FemtoBts_Prim_t) = %lu\n", sizeof(FemtoBts_Prim_t));
|
||||
|
||||
bts_log_init(NULL);
|
||||
|
||||
/* allocate new femtol1_handle */
|
||||
fl1h = talloc_zero(NULL, struct femtol1_hdl);
|
||||
INIT_LLIST_HEAD(&fl1h->wlc_list);
|
||||
|
||||
/* open the actual hardware transport */
|
||||
rc = l1if_transport_open(fl1h);
|
||||
if (rc < 0)
|
||||
exit(1);
|
||||
|
||||
/* create our fwd handle */
|
||||
l1fh = talloc_zero(NULL, struct l1fwd_hdl);
|
||||
|
||||
l1fh->fl1h = fl1h;
|
||||
fl1h->priv = l1fh;
|
||||
|
||||
/* Open UDP */
|
||||
for (i = 0; i < 2; i++) {
|
||||
struct osmo_wqueue *wq = &l1fh->udp_wq[i];
|
||||
|
||||
osmo_wqueue_init(wq, 10);
|
||||
wq->write_cb = udp_write_cb;
|
||||
wq->read_cb = udp_read_cb;
|
||||
|
||||
wq->bfd.when |= BSC_FD_READ;
|
||||
wq->bfd.data = l1fh;
|
||||
wq->bfd.priv_nr = i;
|
||||
rc = osmo_sock_init_ofd(&wq->bfd, AF_UNSPEC, SOCK_DGRAM,
|
||||
IPPROTO_UDP, NULL, fwd_udp_ports[i],
|
||||
OSMO_SOCK_F_BIND);
|
||||
if (rc < 0) {
|
||||
perror("sock_init");
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
|
||||
while (1) {
|
||||
rc = osmo_select_main(0);
|
||||
if (rc < 0) {
|
||||
perror("select");
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
exit(0);
|
||||
}
|
|
@ -0,0 +1,622 @@
|
|||
/* Interface handler for Sysmocom L1 */
|
||||
|
||||
/* (C) 2011 by Harald Welte <laforge@gnumonks.org>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||
* the Free Software Foundation; either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
#include <stdint.h>
|
||||
#include <unistd.h>
|
||||
#include <errno.h>
|
||||
#include <fcntl.h>
|
||||
|
||||
#include <sys/types.h>
|
||||
#include <sys/stat.h>
|
||||
|
||||
#include <osmocom/core/talloc.h>
|
||||
#include <osmocom/core/utils.h>
|
||||
#include <osmocom/core/select.h>
|
||||
#include <osmocom/core/timer.h>
|
||||
#include <osmocom/core/write_queue.h>
|
||||
#include <osmocom/gsm/gsm_utils.h>
|
||||
#include <osmocom/gsm/lapdm.h>
|
||||
|
||||
#include <osmo-bts/logging.h>
|
||||
#include <osmo-bts/bts.h>
|
||||
#include <osmo-bts/gsm_data.h>
|
||||
#include <osmo-bts/paging.h>
|
||||
|
||||
#include <sysmocom/femtobts/femtobts.h>
|
||||
#include <sysmocom/femtobts/gsml1prim.h>
|
||||
#include <sysmocom/femtobts/gsml1const.h>
|
||||
#include <sysmocom/femtobts/gsml1types.h>
|
||||
|
||||
#include "femtobts.h"
|
||||
#include "l1_if.h"
|
||||
#include "l1_transp.h"
|
||||
|
||||
/* FIXME: make threshold configurable */
|
||||
#define MIN_QUAL_RACH -1.0f /* at least -1 dB C/I */
|
||||
#define MIN_QUAL_NORM -1.0f /* at least -1 dB C/I */
|
||||
|
||||
struct wait_l1_conf {
|
||||
struct llist_head list; /* internal linked list */
|
||||
struct osmo_timer_list timer; /* timer for L1 timeout */
|
||||
unsigned int conf_prim_id; /* primitive we expect in response */
|
||||
unsigned int is_sys_prim; /* is this a system (1) or L1 (0) primitive */
|
||||
l1if_compl_cb *cb;
|
||||
void *cb_data;
|
||||
};
|
||||
|
||||
static void release_wlc(struct wait_l1_conf *wlc)
|
||||
{
|
||||
osmo_timer_del(&wlc->timer);
|
||||
talloc_free(wlc);
|
||||
}
|
||||
|
||||
static void l1if_req_timeout(void *data)
|
||||
{
|
||||
struct wait_l1_conf *wlc = data;
|
||||
|
||||
if (wlc->is_sys_prim)
|
||||
LOGP(DL1C, LOGL_FATAL, "Timeout waiting for SYS primitive %s\n",
|
||||
get_value_string(femtobts_sysprim_names, wlc->conf_prim_id));
|
||||
else
|
||||
LOGP(DL1C, LOGL_FATAL, "Timeout waiting for L1 primitive %s\n",
|
||||
get_value_string(femtobts_l1prim_names, wlc->conf_prim_id));
|
||||
exit(23);
|
||||
}
|
||||
|
||||
/* send a request primitive to the L1 and schedule completion call-back */
|
||||
int l1if_req_compl(struct femtol1_hdl *fl1h, struct msgb *msg,
|
||||
int is_system_prim, l1if_compl_cb *cb, void *data)
|
||||
{
|
||||
struct wait_l1_conf *wlc;
|
||||
struct osmo_wqueue *wqueue;
|
||||
unsigned int timeout_secs;
|
||||
|
||||
/* allocate new wsc and store reference to mutex and conf_id */
|
||||
wlc = talloc_zero(fl1h, struct wait_l1_conf);
|
||||
wlc->cb = cb;
|
||||
wlc->cb_data = data;
|
||||
|
||||
/* Make sure we actually have received a REQUEST type primitive */
|
||||
if (is_system_prim == 0) {
|
||||
GsmL1_Prim_t *l1p = msgb_l1prim(msg);
|
||||
|
||||
LOGP(DL1C, LOGL_DEBUG, "Tx L1 prim %s\n",
|
||||
get_value_string(femtobts_l1prim_names, l1p->id));
|
||||
|
||||
if (femtobts_l1prim_type[l1p->id] != L1P_T_REQ) {
|
||||
LOGP(DL1C, LOGL_ERROR, "L1 Prim %s is not a Request!\n",
|
||||
get_value_string(femtobts_l1prim_names, l1p->id));
|
||||
talloc_free(wlc);
|
||||
return -EINVAL;
|
||||
}
|
||||
wlc->is_sys_prim = 0;
|
||||
wlc->conf_prim_id = femtobts_l1prim_req2conf[l1p->id];
|
||||
wqueue = &fl1h->write_q[MQ_L1_WRITE];
|
||||
timeout_secs = 10;
|
||||
} else {
|
||||
FemtoBts_Prim_t *sysp = msgb_sysprim(msg);
|
||||
|
||||
LOGP(DL1C, LOGL_DEBUG, "Tx SYS prim %s\n",
|
||||
get_value_string(femtobts_sysprim_names, sysp->id));
|
||||
|
||||
if (femtobts_sysprim_type[sysp->id] != L1P_T_REQ) {
|
||||
LOGP(DL1C, LOGL_ERROR, "SYS Prim %s is not a Request!\n",
|
||||
get_value_string(femtobts_sysprim_names, sysp->id));
|
||||
talloc_free(wlc);
|
||||
return -EINVAL;
|
||||
}
|
||||
wlc->is_sys_prim = 1;
|
||||
wlc->conf_prim_id = femtobts_sysprim_req2conf[sysp->id];
|
||||
wqueue = &fl1h->write_q[MQ_SYS_WRITE];
|
||||
timeout_secs = 30;
|
||||
}
|
||||
|
||||
/* enqueue the message in the queue and add wsc to list */
|
||||
osmo_wqueue_enqueue(wqueue, msg);
|
||||
llist_add(&wlc->list, &fl1h->wlc_list);
|
||||
|
||||
/* schedule a timer for 10 seconds. If DSP fails to respond, we terminate */
|
||||
wlc->timer.data = wlc;
|
||||
wlc->timer.cb = l1if_req_timeout;
|
||||
osmo_timer_schedule(&wlc->timer, timeout_secs, 0);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* allocate a msgb containing a GsmL1_Prim_t */
|
||||
struct msgb *l1p_msgb_alloc(void)
|
||||
{
|
||||
struct msgb *msg = msgb_alloc(sizeof(GsmL1_Prim_t), "l1_prim");
|
||||
|
||||
if (msg)
|
||||
msg->l1h = msgb_put(msg, sizeof(GsmL1_Prim_t));
|
||||
|
||||
return msg;
|
||||
}
|
||||
|
||||
/* allocate a msgb containing a FemtoBts_Prim_t */
|
||||
struct msgb *sysp_msgb_alloc(void)
|
||||
{
|
||||
struct msgb *msg = msgb_alloc(sizeof(FemtoBts_Prim_t), "sys_prim");
|
||||
|
||||
if (msg)
|
||||
msg->l1h = msgb_put(msg, sizeof(FemtoBts_Prim_t));
|
||||
|
||||
return msg;
|
||||
}
|
||||
|
||||
/* prepare a PH-DATA.req primitive in response to a PH-RTS.ind */
|
||||
static struct msgb *alloc_ph_data_req(GsmL1_PhReadyToSendInd_t *rts_ind)
|
||||
{
|
||||
struct msgb *msg = l1p_msgb_alloc();
|
||||
GsmL1_Prim_t *l1p = msgb_l1prim(msg);
|
||||
GsmL1_PhDataReq_t *data_req = &l1p->u.phDataReq;
|
||||
|
||||
l1p->id = GsmL1_PrimId_PhDataReq;
|
||||
|
||||
/* copy fields from PH-RSS.ind */
|
||||
data_req->hLayer1 = rts_ind->hLayer1;
|
||||
data_req->u8Tn = rts_ind->u8Tn;
|
||||
data_req->u32Fn = rts_ind->u32Fn;
|
||||
data_req->sapi = rts_ind->sapi;
|
||||
data_req->subCh = rts_ind->subCh;
|
||||
data_req->u8BlockNbr = rts_ind->u8BlockNbr;
|
||||
|
||||
return msg;
|
||||
}
|
||||
|
||||
/* obtain a ptr to the lapdm_channel for a given hLayer2 */
|
||||
static struct lapdm_channel *
|
||||
get_lapdm_chan_by_hl2(struct gsm_bts_trx *trx, uint32_t hLayer2)
|
||||
{
|
||||
struct gsm_lchan *lchan;
|
||||
|
||||
lchan = l1if_hLayer2_to_lchan(trx, hLayer2);
|
||||
if (!lchan)
|
||||
return NULL;
|
||||
|
||||
return &lchan->lapdm_ch;
|
||||
}
|
||||
|
||||
|
||||
static const uint8_t fill_frame[GSM_MACBLOCK_LEN] = {
|
||||
0x01, 0x2B, 0x2B, 0x2B, 0x2B, 0x2B, 0x2B, 0x2B, 0x2B, 0x2B,
|
||||
0x2B, 0x2B, 0x2B, 0x2B, 0x2B, 0x2B, 0x2B, 0x2B, 0x2B, 0x2B,
|
||||
0x2B, 0x2B, 0x2B
|
||||
};
|
||||
|
||||
static int handle_ph_readytosend_ind(struct femtol1_hdl *fl1,
|
||||
GsmL1_PhReadyToSendInd_t *rts_ind)
|
||||
{
|
||||
struct msgb *resp_msg = alloc_ph_data_req(rts_ind);
|
||||
struct gsm_bts_trx *trx = fl1->priv;
|
||||
struct gsm_bts *bts = trx->bts;
|
||||
struct gsm_bts_role_bts *btsb = bts->role;
|
||||
GsmL1_Prim_t *l1p = msgb_l1prim(resp_msg);
|
||||
GsmL1_PhDataReq_t *data_req = &l1p->u.phDataReq;
|
||||
GsmL1_MsgUnitParam_t *msu_param = &data_req->msgUnitParam;
|
||||
struct lapdm_channel *lc;
|
||||
struct lapdm_entity *le;
|
||||
struct gsm_lchan *lchan;
|
||||
struct gsm_time g_time;
|
||||
uint32_t t3p;
|
||||
uint8_t *si;
|
||||
struct osmo_phsap_prim pp;
|
||||
int rc;
|
||||
|
||||
gsm_fn2gsmtime(&g_time, rts_ind->u32Fn);
|
||||
|
||||
DEBUGP(DL1P, "Rx PH-RTS.ind %02u/%02u/%02u SAPI=%s\n",
|
||||
g_time.t1, g_time.t2, g_time.t3,
|
||||
get_value_string(femtobts_l1sapi_names, rts_ind->sapi));
|
||||
|
||||
/* copy over parameters from PH-RTS.ind into PH-DATA.req */
|
||||
data_req->hLayer1 = rts_ind->hLayer1;
|
||||
data_req->u8Tn = rts_ind->u8Tn;
|
||||
data_req->u32Fn = rts_ind->u32Fn;
|
||||
data_req->sapi = rts_ind->sapi;
|
||||
data_req->subCh = rts_ind->subCh;
|
||||
data_req->u8BlockNbr = rts_ind->u8BlockNbr;
|
||||
msu_param->u8Size = GSM_MACBLOCK_LEN;
|
||||
|
||||
switch (rts_ind->sapi) {
|
||||
case GsmL1_Sapi_Sch:
|
||||
/* compute T3prime */
|
||||
t3p = (g_time.t3 - 1) / 10;
|
||||
/* fill SCH burst with data */
|
||||
msu_param->u8Size = 4;
|
||||
msu_param->u8Buffer[0] = (bts->bsic << 2) | (g_time.t1 >> 9);
|
||||
msu_param->u8Buffer[1] = (g_time.t1 >> 1);
|
||||
msu_param->u8Buffer[2] = (g_time.t1 << 7) | (g_time.t2 << 2) | (t3p >> 1);
|
||||
msu_param->u8Buffer[3] = (t3p & 1);
|
||||
break;
|
||||
case GsmL1_Sapi_Bcch:
|
||||
/* get them from bts->si_buf[] */
|
||||
si = bts_sysinfo_get(bts, &g_time);
|
||||
if (si)
|
||||
memcpy(msu_param->u8Buffer, si, GSM_MACBLOCK_LEN);
|
||||
else
|
||||
memcpy(msu_param->u8Buffer, fill_frame, GSM_MACBLOCK_LEN);
|
||||
break;
|
||||
case GsmL1_Sapi_Sacch:
|
||||
/* resolve the L2 entity using rts_ind->hLayer2 */
|
||||
lchan = l1if_hLayer2_to_lchan(trx, rts_ind->hLayer2);
|
||||
le = &lchan->lapdm_ch.lapdm_acch;
|
||||
rc = lapdm_phsap_dequeue_prim(le, &pp);
|
||||
if (rc < 0) {
|
||||
/* No SACCH data from LAPDM pending, send SACCH filling */
|
||||
uint8_t *si = lchan_sacch_get(lchan, &g_time);
|
||||
if (si) {
|
||||
/* The +2 is empty space where the DSP inserts the L1 hdr */
|
||||
memcpy(msu_param->u8Buffer+2, si, GSM_MACBLOCK_LEN-2);
|
||||
} else
|
||||
memcpy(msu_param->u8Buffer, fill_frame, GSM_MACBLOCK_LEN);
|
||||
} else {
|
||||
/* The +2 is empty space where the DSP inserts the L1 hdr */
|
||||
memcpy(msu_param->u8Buffer+2, pp.oph.msg->data, GSM_MACBLOCK_LEN-2);
|
||||
msgb_free(pp.oph.msg);
|
||||
}
|
||||
DEBUGP(DL1C, "Sending SACCH payload bytes: %s\n",
|
||||
osmo_hexdump(msu_param->u8Buffer, GSM_MACBLOCK_LEN));
|
||||
break;
|
||||
case GsmL1_Sapi_Sdcch:
|
||||
/* resolve the L2 entity using rts_ind->hLayer2 */
|
||||
lc = get_lapdm_chan_by_hl2(trx, rts_ind->hLayer2);
|
||||
le = &lc->lapdm_dcch;
|
||||
rc = lapdm_phsap_dequeue_prim(le, &pp);
|
||||
if (rc < 0)
|
||||
memcpy(msu_param->u8Buffer, fill_frame, GSM_MACBLOCK_LEN);
|
||||
else {
|
||||
memcpy(msu_param->u8Buffer, pp.oph.msg->data, GSM_MACBLOCK_LEN);
|
||||
msgb_free(pp.oph.msg);
|
||||
}
|
||||
break;
|
||||
case GsmL1_Sapi_Agch:
|
||||
/* special queue of messages from IMM ASS CMD */
|
||||
{
|
||||
struct msgb *msg = bts_agch_dequeue(bts);
|
||||
if (!msg)
|
||||
memcpy(msu_param->u8Buffer, fill_frame, GSM_MACBLOCK_LEN);
|
||||
else {
|
||||
DEBUGP(DL1C, "Sending AGCH payload %u bytes: %s\n",
|
||||
msg->len, osmo_hexdump(msg->data, msg->len));
|
||||
memcpy(msu_param->u8Buffer, msg->data, msg->len);
|
||||
msgb_free(msg);
|
||||
}
|
||||
}
|
||||
break;
|
||||
case GsmL1_Sapi_Pch:
|
||||
rc = paging_gen_msg(btsb->paging_state, msu_param->u8Buffer, &g_time);
|
||||
/* FIXME: special paging logic */
|
||||
break;
|
||||
case GsmL1_Sapi_TchF:
|
||||
case GsmL1_Sapi_FacchF:
|
||||
/* we should never receive a request here */
|
||||
default:
|
||||
memcpy(msu_param->u8Buffer, fill_frame, GSM_MACBLOCK_LEN);
|
||||
break;
|
||||
}
|
||||
/* transmit */
|
||||
osmo_wqueue_enqueue(&fl1->write_q[MQ_L1_WRITE], resp_msg);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int handle_mph_time_ind(struct femtol1_hdl *fl1,
|
||||
GsmL1_MphTimeInd_t *time_ind)
|
||||
{
|
||||
/* Update our data structures with the current GSM time */
|
||||
gsm_fn2gsmtime(&fl1->gsm_time, time_ind->u32Fn);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* determine LAPDm entity inside LAPDm channel for given L1 sapi */
|
||||
static struct lapdm_entity *le_by_l1_sapi(struct lapdm_channel *lc, GsmL1_Sapi_t sapi)
|
||||
{
|
||||
switch (sapi) {
|
||||
case GsmL1_Sapi_Sacch:
|
||||
return &lc->lapdm_acch;
|
||||
default:
|
||||
return &lc->lapdm_dcch;
|
||||
}
|
||||
}
|
||||
|
||||
static uint8_t gen_link_id(GsmL1_Sapi_t l1_sapi, uint8_t lapdm_sapi)
|
||||
{
|
||||
uint8_t c_bits = 0;
|
||||
|
||||
if (l1_sapi == GsmL1_Sapi_Sacch)
|
||||
c_bits = 0x40;
|
||||
|
||||
return c_bits | (lapdm_sapi & 7);
|
||||
}
|
||||
|
||||
static void dump_meas_res(GsmL1_MeasParam_t *m)
|
||||
{
|
||||
DEBUGPC(DL1C, ", Meas: RSSI %-3.2f dBm, Qual %-3.2f dB, "
|
||||
"BER %-3.2f, Timing %d\n", m->fRssi, m->fLinkQuality,
|
||||
m->fBer, m->i16BurstTiming);
|
||||
}
|
||||
|
||||
static int handle_ph_data_ind(struct femtol1_hdl *fl1, GsmL1_PhDataInd_t *data_ind)
|
||||
{
|
||||
struct osmo_phsap_prim pp;
|
||||
struct gsm_lchan *lchan;
|
||||
struct lapdm_entity *le;
|
||||
struct msgb *msg;
|
||||
#warning Properly determine the SAPI here
|
||||
uint8_t lapdm_sapi = 0;
|
||||
|
||||
if (data_ind->measParam.fLinkQuality < MIN_QUAL_NORM)
|
||||
return 0;
|
||||
|
||||
DEBUGP(DL1C, "Rx PH-DATA.ind (hLayer2 = 0x%08x)", data_ind->hLayer2);
|
||||
dump_meas_res(&data_ind->measParam);
|
||||
|
||||
lchan = l1if_hLayer2_to_lchan(fl1->priv, data_ind->hLayer2);
|
||||
if (!lchan) {
|
||||
LOGP(DL1C, LOGL_ERROR, "unable to resolve lchan by hLayer2\n");
|
||||
return -ENODEV;
|
||||
}
|
||||
|
||||
le = le_by_l1_sapi(&lchan->lapdm_ch, data_ind->sapi);
|
||||
|
||||
msg = msgb_alloc_headroom(128, 64, "PH-DATA.ind");
|
||||
|
||||
osmo_prim_init(&pp.oph, SAP_GSM_PH, PRIM_PH_DATA,
|
||||
PRIM_OP_INDICATION, msg);
|
||||
|
||||
msg->l2h = msgb_put(msg, data_ind->msgUnitParam.u8Size);
|
||||
memcpy(msg->l2h, data_ind->msgUnitParam.u8Buffer,
|
||||
data_ind->msgUnitParam.u8Size);
|
||||
|
||||
/* FIXME: LAPDm shouldn't really need those... */
|
||||
pp.u.data.chan_nr = gsm_lchan2chan_nr(lchan);
|
||||
pp.u.data.link_id = gen_link_id(data_ind->sapi, lapdm_sapi);
|
||||
|
||||
return lapdm_phsap_up(&pp.oph, le);
|
||||
}
|
||||
|
||||
|
||||
static int handle_ph_ra_ind(struct femtol1_hdl *fl1, GsmL1_PhRaInd_t *ra_ind)
|
||||
{
|
||||
struct osmo_phsap_prim pp;
|
||||
struct lapdm_channel *lc;
|
||||
|
||||
if (ra_ind->measParam.fLinkQuality < MIN_QUAL_RACH)
|
||||
return 0;
|
||||
|
||||
DEBUGP(DL1C, "Rx PH-RA.ind");
|
||||
dump_meas_res(&ra_ind->measParam);
|
||||
|
||||
lc = get_lapdm_chan_by_hl2(fl1->priv, ra_ind->hLayer2);
|
||||
if (!lc) {
|
||||
LOGP(DL1C, LOGL_ERROR, "unable to resolve LAPD channel by hLayer2\n");
|
||||
return -ENODEV;
|
||||
}
|
||||
|
||||
osmo_prim_init(&pp.oph, SAP_GSM_PH, PRIM_PH_RACH,
|
||||
PRIM_OP_INDICATION, NULL);
|
||||
|
||||
pp.u.rach_ind.ra = ra_ind->msgUnitParam.u8Buffer[0];
|
||||
pp.u.rach_ind.fn = ra_ind->u32Fn;
|
||||
/* FIXME: check for under/overflow / sign */
|
||||
if (ra_ind->measParam.i16BurstTiming <= 0 ||
|
||||
ra_ind->measParam.i16BurstTiming > 63 * 4)
|
||||
pp.u.rach_ind.acc_delay = 0;
|
||||
else
|
||||
pp.u.rach_ind.acc_delay = ra_ind->measParam.i16BurstTiming >> 2;
|
||||
|
||||
return lapdm_phsap_up(&pp.oph, &lc->lapdm_dcch);
|
||||
}
|
||||
|
||||
/* handle any random indication from the L1 */
|
||||
static int l1if_handle_ind(struct femtol1_hdl *fl1, struct msgb *msg)
|
||||
{
|
||||
GsmL1_Prim_t *l1p = msgb_l1prim(msg);
|
||||
int rc = 0;
|
||||
|
||||
switch (l1p->id) {
|
||||
case GsmL1_PrimId_MphTimeInd:
|
||||
rc = handle_mph_time_ind(fl1, &l1p->u.mphTimeInd);
|
||||
break;
|
||||
case GsmL1_PrimId_MphSyncInd:
|
||||
break;
|
||||
case GsmL1_PrimId_PhConnectInd:
|
||||
break;
|
||||
case GsmL1_PrimId_PhReadyToSendInd:
|
||||
rc = handle_ph_readytosend_ind(fl1, &l1p->u.phReadyToSendInd);
|
||||
break;
|
||||
case GsmL1_PrimId_PhDataInd:
|
||||
rc = handle_ph_data_ind(fl1, &l1p->u.phDataInd);
|
||||
break;
|
||||
case GsmL1_PrimId_PhRaInd:
|
||||
rc = handle_ph_ra_ind(fl1, &l1p->u.phRaInd);
|
||||
break;
|
||||
default:
|
||||
break;
|
||||
}
|
||||
|
||||
msgb_free(msg);
|
||||
return rc;
|
||||
}
|
||||
|
||||
int l1if_handle_l1prim(struct femtol1_hdl *fl1h, struct msgb *msg)
|
||||
{
|
||||
GsmL1_Prim_t *l1p = msgb_l1prim(msg);
|
||||
struct wait_l1_conf *wlc;
|
||||
int rc;
|
||||
|
||||
switch (l1p->id) {
|
||||
case GsmL1_PrimId_MphTimeInd:
|
||||
/* silent, don't clog the log file */
|
||||
break;
|
||||
default:
|
||||
LOGP(DL1P, LOGL_DEBUG, "Rx L1 prim %s\n",
|
||||
get_value_string(femtobts_l1prim_names, l1p->id));
|
||||
}
|
||||
|
||||
/* check if this is a resposne to a sync-waiting request */
|
||||
llist_for_each_entry(wlc, &fl1h->wlc_list, list) {
|
||||
/* the limitation here is that we cannot have multiple callers
|
||||
* sending the same primitive */
|
||||
if (wlc->is_sys_prim == 0 && l1p->id == wlc->conf_prim_id) {
|
||||
llist_del(&wlc->list);
|
||||
rc = wlc->cb(msg, wlc->cb_data);
|
||||
release_wlc(wlc);
|
||||
return rc;
|
||||
}
|
||||
}
|
||||
|
||||
/* if we reach here, it is not a Conf for a pending Req */
|
||||
return l1if_handle_ind(fl1h, msg);
|
||||
}
|
||||
|
||||
int l1if_handle_sysprim(struct femtol1_hdl *fl1h, struct msgb *msg)
|
||||
{
|
||||
FemtoBts_Prim_t *sysp = msgb_sysprim(msg);
|
||||
struct wait_l1_conf *wlc;
|
||||
int rc;
|
||||
|
||||
LOGP(DL1P, LOGL_DEBUG, "Rx SYS prim %s\n",
|
||||
get_value_string(femtobts_sysprim_names, sysp->id));
|
||||
|
||||
/* check if this is a resposne to a sync-waiting request */
|
||||
llist_for_each_entry(wlc, &fl1h->wlc_list, list) {
|
||||
/* the limitation here is that we cannot have multiple callers
|
||||
* sending the same primitive */
|
||||
if (wlc->is_sys_prim && sysp->id == wlc->conf_prim_id) {
|
||||
llist_del(&wlc->list);
|
||||
rc = wlc->cb(msg, wlc->cb_data);
|
||||
release_wlc(wlc);
|
||||
return rc;
|
||||
}
|
||||
}
|
||||
/* if we reach here, it is not a Conf for a pending Req */
|
||||
return l1if_handle_ind(fl1h, msg);
|
||||
}
|
||||
|
||||
#if 0
|
||||
/* called by RSL if the BCCH SI has been modified */
|
||||
int sysinfo_has_changed(struct gsm_bts *bts, int si)
|
||||
{
|
||||
/* FIXME: Determine BS_AG_BLKS_RES and
|
||||
* * set cfgParams.u.agch.u8NbrOfAgch
|
||||
* * determine implications on paging
|
||||
*/
|
||||
/* FIXME: Check for Extended BCCH presence */
|
||||
/* FIXME: Check for CCCH_CONF */
|
||||
/* FIXME: Check for BS_PA_MFRMS: update paging */
|
||||
|
||||
return 0;
|
||||
}
|
||||
#endif
|
||||
|
||||
static int activate_rf_compl_cb(struct msgb *resp, void *data)
|
||||
{
|
||||
FemtoBts_Prim_t *sysp = msgb_sysprim(resp);
|
||||
GsmL1_Status_t status;
|
||||
int on = 0;
|
||||
|
||||
if (sysp->id == FemtoBts_PrimId_ActivateRfCnf)
|
||||
on = 1;
|
||||
|
||||
if (on)
|
||||
status = sysp->u.activateRfCnf.status;
|
||||
else
|
||||
status = sysp->u.deactivateRfCnf.status;
|
||||
|
||||
LOGP(DL1C, LOGL_INFO, "Rx RF-%sACT.conf (status=%s)\n", on ? "" : "DE",
|
||||
get_value_string(femtobts_l1status_names, status));
|
||||
|
||||
talloc_free(resp);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int l1if_activate_rf(struct femtol1_hdl *hdl, int on)
|
||||
{
|
||||
struct msgb *msg = sysp_msgb_alloc();
|
||||
FemtoBts_Prim_t *sysp = msgb_sysprim(msg);
|
||||
|
||||
if (on) {
|
||||
sysp->id = FemtoBts_PrimId_ActivateRfReq;
|
||||
sysp->u.activateRfReq.u12ClkVc = 0xFFFF;
|
||||
} else {
|
||||
sysp->id = FemtoBts_PrimId_DeactivateRfReq;
|
||||
}
|
||||
|
||||
return l1if_req_compl(hdl, msg, 1, activate_rf_compl_cb, hdl);
|
||||
}
|
||||
|
||||
static int reset_compl_cb(struct msgb *resp, void *data)
|
||||
{
|
||||
struct femtol1_hdl *fl1h = data;
|
||||
FemtoBts_Prim_t *sysp = msgb_sysprim(resp);
|
||||
GsmL1_Status_t status = sysp->u.layer1ResetCnf.status;
|
||||
|
||||
LOGP(DL1C, LOGL_NOTICE, "Rx L1-RESET.conf (status=%s)\n",
|
||||
get_value_string(femtobts_l1status_names, status));
|
||||
|
||||
talloc_free(resp);
|
||||
|
||||
/* If we're coming out of reset .. */
|
||||
if (status == GsmL1_Status_Success)
|
||||
l1if_activate_rf(fl1h, 1);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int l1if_reset(struct femtol1_hdl *hdl)
|
||||
{
|
||||
struct msgb *msg = sysp_msgb_alloc();
|
||||
FemtoBts_Prim_t *sysp = msgb_sysprim(msg);
|
||||
sysp->id = FemtoBts_PrimId_Layer1ResetReq;
|
||||
|
||||
return l1if_req_compl(hdl, msg, 1, reset_compl_cb, hdl);
|
||||
}
|
||||
|
||||
struct femtol1_hdl *l1if_open(void *priv)
|
||||
{
|
||||
struct femtol1_hdl *fl1h;
|
||||
int rc;
|
||||
|
||||
fl1h = talloc_zero(priv, struct femtol1_hdl);
|
||||
if (!fl1h)
|
||||
return NULL;
|
||||
INIT_LLIST_HEAD(&fl1h->wlc_list);
|
||||
|
||||
fl1h->priv = priv;
|
||||
|
||||
rc = l1if_transport_open(fl1h);
|
||||
if (rc < 0) {
|
||||
talloc_free(fl1h);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
return fl1h;
|
||||
}
|
||||
|
||||
int l1if_close(struct femtol1_hdl *fl1h)
|
||||
{
|
||||
return l1if_transport_close(fl1h);
|
||||
}
|
|
@ -0,0 +1,50 @@
|
|||
#ifndef _FEMTO_L1_H
|
||||
#define _FEMTO_L1_H
|
||||
|
||||
#include <osmocom/core/select.h>
|
||||
#include <osmocom/core/write_queue.h>
|
||||
#include <osmocom/gsm/gsm_utils.h>
|
||||
|
||||
enum {
|
||||
MQ_SYS_READ,
|
||||
MQ_L1_READ,
|
||||
_NUM_MQ_READ
|
||||
};
|
||||
|
||||
enum {
|
||||
MQ_SYS_WRITE,
|
||||
MQ_L1_WRITE,
|
||||
_NUM_MQ_WRITE
|
||||
};
|
||||
|
||||
struct femtol1_hdl {
|
||||
struct gsm_time gsm_time;
|
||||
uint32_t hLayer1; /* handle to the L1 instance in the DSP */
|
||||
struct llist_head wlc_list;
|
||||
|
||||
void *priv; /* user reference */
|
||||
|
||||
struct osmo_fd read_ofd[_NUM_MQ_READ]; /* osmo file descriptors */
|
||||
struct osmo_wqueue write_q[_NUM_MQ_WRITE];
|
||||
};
|
||||
|
||||
#define msgb_l1prim(msg) ((GsmL1_Prim_t *)(msg)->l1h)
|
||||
#define msgb_sysprim(msg) ((FemtoBts_Prim_t *)(msg)->l1h)
|
||||
|
||||
typedef int l1if_compl_cb(struct msgb *l1_msg, void *data);
|
||||
|
||||
/* send a request primitive to the L1 and schedule completion call-back */
|
||||
int l1if_req_compl(struct femtol1_hdl *fl1h, struct msgb *msg,
|
||||
int is_system_prim, l1if_compl_cb *cb, void *data);
|
||||
|
||||
struct femtol1_hdl *l1if_open(void *priv);
|
||||
int l1if_close(struct femtol1_hdl *hdl);
|
||||
int l1if_reset(struct femtol1_hdl *hdl);
|
||||
|
||||
struct msgb *l1p_msgb_alloc(void);
|
||||
struct msgb *sysp_msgb_alloc(void);
|
||||
|
||||
uint32_t l1if_lchan_to_hLayer2(struct gsm_lchan *lchan);
|
||||
struct gsm_lchan *l1if_hLayer2_to_lchan(struct gsm_bts_trx *trx, uint32_t hLayer2);
|
||||
|
||||
#endif /* _FEMTO_L1_H */
|
|
@ -0,0 +1,14 @@
|
|||
#ifndef _FEMTOL1_TRANSPH_
|
||||
#define _FEMTOL1_TRANSPH_
|
||||
|
||||
#include <osmocom/core/msgb.h>
|
||||
|
||||
/* functions a transport calls on arrival of primitive from BTS */
|
||||
int l1if_handle_l1prim(struct femtol1_hdl *fl1h, struct msgb *msg);
|
||||
int l1if_handle_sysprim(struct femtol1_hdl *fl1h, struct msgb *msg);
|
||||
|
||||
/* functions exported by a transport */
|
||||
int l1if_transport_open(struct femtol1_hdl *fl1h);
|
||||
int l1if_transport_close(struct femtol1_hdl *fl1h);
|
||||
|
||||
#endif /* _FEMTOL1_TRANSP_H */
|
|
@ -0,0 +1,143 @@
|
|||
/* Interface handler for Sysmocom L1 (forwarding) */
|
||||
|
||||
/* (C) 2011 by Harald Welte <laforge@gnumonks.org>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||
* the Free Software Foundation; either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
#include <stdint.h>
|
||||
#include <unistd.h>
|
||||
#include <errno.h>
|
||||
#include <fcntl.h>
|
||||
|
||||
#include <sys/types.h>
|
||||
#include <sys/stat.h>
|
||||
#include <sys/socket.h>
|
||||
|
||||
#include <netinet/in.h>
|
||||
#include <arpa/inet.h>
|
||||
|
||||
#include <osmocom/core/talloc.h>
|
||||
#include <osmocom/core/utils.h>
|
||||
#include <osmocom/core/select.h>
|
||||
#include <osmocom/core/write_queue.h>
|
||||
#include <osmocom/core/msgb.h>
|
||||
#include <osmocom/core/socket.h>
|
||||
#include <osmocom/gsm/gsm_utils.h>
|
||||
|
||||
#include <osmo-bts/logging.h>
|
||||
#include <osmo-bts/gsm_data.h>
|
||||
|
||||
#include <sysmocom/femtobts/femtobts.h>
|
||||
#include <sysmocom/femtobts/gsml1prim.h>
|
||||
#include <sysmocom/femtobts/gsml1const.h>
|
||||
#include <sysmocom/femtobts/gsml1types.h>
|
||||
|
||||
#include "femtobts.h"
|
||||
#include "l1_if.h"
|
||||
#include "l1_transp.h"
|
||||
#include "l1_fwd.h"
|
||||
|
||||
#define BTS_HOST "192.168.100.151"
|
||||
|
||||
static const uint16_t fwd_udp_ports[] = {
|
||||
[MQ_SYS_WRITE] = L1FWD_SYS_PORT,
|
||||
[MQ_L1_WRITE] = L1FWD_L1_PORT,
|
||||
};
|
||||
|
||||
static int fwd_read_cb(struct osmo_fd *ofd)
|
||||
{
|
||||
struct msgb *msg = msgb_alloc_headroom(2048, 127, "udp_rx");
|
||||
struct femtol1_hdl *fl1h = ofd->data;
|
||||
int rc;
|
||||
|
||||
if (!msg)
|
||||
return -ENOMEM;
|
||||
|
||||
msg->l1h = msg->data;
|
||||
rc = read(ofd->fd, msg->l1h, msgb_tailroom(msg));
|
||||
if (rc < 0) {
|
||||
LOGP(DL1C, LOGL_ERROR, "Short read from UDP\n");
|
||||
msgb_free(msg);
|
||||
return rc;
|
||||
} else if (rc == 0) {
|
||||
LOGP(DL1C, LOGL_ERROR, "Len=0 from UDP\n");
|
||||
msgb_free(msg);
|
||||
return rc;
|
||||
}
|
||||
msgb_put(msg, rc);
|
||||
|
||||
if (ofd->priv_nr == MQ_SYS_WRITE)
|
||||
rc = l1if_handle_sysprim(fl1h, msg);
|
||||
else
|
||||
rc = l1if_handle_l1prim(fl1h, msg);
|
||||
|
||||
return rc;
|
||||
}
|
||||
|
||||
static int prim_write_cb(struct osmo_fd *ofd, struct msgb *msg)
|
||||
{
|
||||
/* write to the fd */
|
||||
return write(ofd->fd, msg->head, msg->len);
|
||||
}
|
||||
|
||||
int l1if_transport_open(struct femtol1_hdl *fl1h)
|
||||
{
|
||||
int rc, i;
|
||||
|
||||
printf("sizeof(GsmL1_Prim_t) = %lu\n", sizeof(GsmL1_Prim_t));
|
||||
printf("sizeof(FemtoBts_Prim_t) = %lu\n", sizeof(FemtoBts_Prim_t));
|
||||
|
||||
for (i = 0; i < ARRAY_SIZE(fl1h->write_q); i++) {
|
||||
struct osmo_wqueue *wq = &fl1h->write_q[i];
|
||||
struct osmo_fd *ofd = &wq->bfd;
|
||||
|
||||
osmo_wqueue_init(wq, 10);
|
||||
wq->write_cb = prim_write_cb;
|
||||
wq->read_cb = fwd_read_cb;
|
||||
|
||||
ofd->data = fl1h;
|
||||
ofd->priv_nr = i;
|
||||
ofd->when |= BSC_FD_READ;
|
||||
|
||||
rc = osmo_sock_init_ofd(ofd, AF_UNSPEC, SOCK_DGRAM, IPPROTO_UDP,
|
||||
BTS_HOST, fwd_udp_ports[i],
|
||||
OSMO_SOCK_F_CONNECT);
|
||||
if (rc < 0) {
|
||||
talloc_free(fl1h);
|
||||
return rc;
|
||||
}
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int l1if_transport_close(struct femtol1_hdl *fl1h)
|
||||
{
|
||||
int i;
|
||||
|
||||
for (i = 0; i < ARRAY_SIZE(fl1h->write_q); i++) {
|
||||
struct osmo_wqueue *wq = &fl1h->write_q[i];
|
||||
struct osmo_fd *ofd = &wq->bfd;
|
||||
|
||||
osmo_wqueue_clear(wq);
|
||||
osmo_fd_unregister(ofd);
|
||||
close(ofd->fd);
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
|
@ -0,0 +1,192 @@
|
|||
/* Interface handler for Sysmocom L1 (real hardware) */
|
||||
|
||||
/* (C) 2011 by Harald Welte <laforge@gnumonks.org>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||
* the Free Software Foundation; either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
#include <stdint.h>
|
||||
#include <unistd.h>
|
||||
#include <errno.h>
|
||||
#include <fcntl.h>
|
||||
|
||||
#include <sys/types.h>
|
||||
#include <sys/stat.h>
|
||||
|
||||
#include <osmocom/core/talloc.h>
|
||||
#include <osmocom/core/utils.h>
|
||||
#include <osmocom/core/select.h>
|
||||
#include <osmocom/core/write_queue.h>
|
||||
#include <osmocom/gsm/gsm_utils.h>
|
||||
|
||||
#include <osmo-bts/logging.h>
|
||||
#include <osmo-bts/gsm_data.h>
|
||||
|
||||
#include <sysmocom/femtobts/femtobts.h>
|
||||
#include <sysmocom/femtobts/gsml1prim.h>
|
||||
#include <sysmocom/femtobts/gsml1const.h>
|
||||
#include <sysmocom/femtobts/gsml1types.h>
|
||||
|
||||
#include "femtobts.h"
|
||||
#include "l1_if.h"
|
||||
#include "l1_transp.h"
|
||||
|
||||
|
||||
#define DEV_SYS_DSP2ARM_NAME "/dev/msgq/femtobts_dsp2arm"
|
||||
#define DEV_SYS_ARM2DSP_NAME "/dev/msgq/femtobts_arm2dsp"
|
||||
#define DEV_L1_DSP2ARM_NAME "/dev/msgq/gsml1_dsp2arm"
|
||||
#define DEV_L1_ARM2DSP_NAME "/dev/msgq/gsml1_arm2dsp"
|
||||
|
||||
static const char *rd_devnames[] = {
|
||||
[MQ_SYS_READ] = DEV_SYS_DSP2ARM_NAME,
|
||||
[MQ_L1_READ] = DEV_L1_DSP2ARM_NAME,
|
||||
};
|
||||
|
||||
static const char *wr_devnames[] = {
|
||||
[MQ_SYS_WRITE] = DEV_SYS_ARM2DSP_NAME,
|
||||
[MQ_L1_WRITE] = DEV_L1_ARM2DSP_NAME,
|
||||
};
|
||||
|
||||
/* callback when there's something to read from the l1 msg_queue */
|
||||
static int l1if_fd_cb(struct osmo_fd *ofd, unsigned int what)
|
||||
{
|
||||
//struct msgb *msg = l1p_msgb_alloc();
|
||||
struct msgb *msg = msgb_alloc_headroom(2048, 128, "1l_fd");
|
||||
struct femtol1_hdl *fl1h = ofd->data;
|
||||
int rc;
|
||||
|
||||
msg->l1h = msg->data;
|
||||
rc = read(ofd->fd, msg->l1h, sizeof(GsmL1_Prim_t));
|
||||
if (rc < 0) {
|
||||
if (rc != -1)
|
||||
LOGP(DL1C, LOGL_ERROR, "error reading from L1 msg_queue: %s\n",
|
||||
strerror(errno));
|
||||
msgb_free(msg);
|
||||
return rc;
|
||||
}
|
||||
msgb_put(msg, rc);
|
||||
|
||||
if (ofd->priv_nr == MQ_L1_WRITE)
|
||||
return l1if_handle_l1prim(fl1h, msg);
|
||||
else
|
||||
return l1if_handle_sysprim(fl1h, msg);
|
||||
};
|
||||
|
||||
/* callback when we can write to one of the l1 msg_queue devices */
|
||||
static int l1fd_write_cb(struct osmo_fd *ofd, struct msgb *msg)
|
||||
{
|
||||
int rc;
|
||||
|
||||
rc = write(ofd->fd, msg->l1h, msgb_l1len(msg));
|
||||
if (rc < 0) {
|
||||
LOGP(DL1C, LOGL_ERROR, "error writing to L1 msg_queue: %s\n",
|
||||
strerror(errno));
|
||||
return rc;
|
||||
} else if (rc < msg->len) {
|
||||
LOGP(DL1C, LOGL_ERROR, "short write to L1 msg_queue: "
|
||||
"%u < %u\n", rc, msg->len);
|
||||
return -EIO;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int l1if_transport_open(struct femtol1_hdl *hdl)
|
||||
{
|
||||
int rc, i;
|
||||
|
||||
/* Step 1: Open all msg_queue file descriptors */
|
||||
for (i = 0; i < ARRAY_SIZE(hdl->read_ofd); i++) {
|
||||
struct osmo_fd *ofd = &hdl->read_ofd[i];
|
||||
|
||||
rc = open(rd_devnames[i], O_RDONLY);
|
||||
if (rc < 0) {
|
||||
LOGP(DL1C, LOGL_FATAL, "unable to open msg_queue: %s\n",
|
||||
strerror(errno));
|
||||
goto out_free;
|
||||
}
|
||||
ofd->fd = rc;
|
||||
ofd->priv_nr = i;
|
||||
ofd->data = hdl;
|
||||
ofd->cb = l1if_fd_cb;
|
||||
ofd->when = BSC_FD_READ;
|
||||
rc = osmo_fd_register(ofd);
|
||||
if (rc < 0) {
|
||||
close(ofd->fd);
|
||||
ofd->fd = -1;
|
||||
goto out_free;
|
||||
}
|
||||
}
|
||||
for (i = 0; i < ARRAY_SIZE(hdl->write_q); i++) {
|
||||
struct osmo_wqueue *wq = &hdl->write_q[i];
|
||||
struct osmo_fd *ofd = &hdl->write_q[i].bfd;
|
||||
|
||||
rc = open(wr_devnames[i], O_WRONLY);
|
||||
if (rc < 0) {
|
||||
LOGP(DL1C, LOGL_FATAL, "unable to open msg_queue: %s\n",
|
||||
strerror(errno));
|
||||
goto out_read;
|
||||
}
|
||||
|
||||
osmo_wqueue_init(wq, 10);
|
||||
wq->write_cb = l1fd_write_cb;
|
||||
|
||||
ofd->fd = rc;
|
||||
ofd->priv_nr = i;
|
||||
ofd->data = hdl;
|
||||
ofd->when = BSC_FD_WRITE;
|
||||
rc = osmo_fd_register(ofd);
|
||||
if (rc < 0) {
|
||||
close(ofd->fd);
|
||||
ofd->fd = -1;
|
||||
goto out_read;
|
||||
}
|
||||
|
||||
}
|
||||
return 0;
|
||||
|
||||
out_read:
|
||||
for (i = 0; i < ARRAY_SIZE(hdl->read_ofd); i++) {
|
||||
close(hdl->read_ofd[i].fd);
|
||||
osmo_fd_unregister(&hdl->read_ofd[i]);
|
||||
}
|
||||
out_free:
|
||||
talloc_free(hdl);
|
||||
return rc;
|
||||
}
|
||||
|
||||
int l1if_transport_close(struct femtol1_hdl *hdl)
|
||||
{
|
||||
int i;
|
||||
|
||||
for (i = 0; i < ARRAY_SIZE(hdl->read_ofd); i++) {
|
||||
struct osmo_fd *ofd = &hdl->read_ofd[i];
|
||||
|
||||
osmo_fd_unregister(ofd);
|
||||
close(ofd->fd);
|
||||
ofd->fd = -1;
|
||||
}
|
||||
|
||||
for (i = 0; i < ARRAY_SIZE(hdl->write_q); i++) {
|
||||
struct osmo_fd *ofd = &hdl->write_q[i].bfd;
|
||||
|
||||
osmo_fd_unregister(ofd);
|
||||
close(ofd->fd);
|
||||
ofd->fd = -1;
|
||||
}
|
||||
return 0;
|
||||
}
|
|
@ -0,0 +1,54 @@
|
|||
/* (C) 2011 by Harald Welte <laforge@gnumonks.org>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||
* the Free Software Foundation; either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
#include <stdint.h>
|
||||
|
||||
#include <osmocom/gsm/prim.h>
|
||||
|
||||
#include <osmocom/bb/common/l1ctl.h>
|
||||
#include <osmocom/bb/common/lapdm.h>
|
||||
|
||||
/* LAPDm wants to send a PH-* primitive to the physical layer (L1) */
|
||||
int sysmol1_ph_prim_cb(struct osmo_prim_hdr *oph, void *ctx)
|
||||
{
|
||||
struct osmocom_ms *ms = ctx;
|
||||
struct osmo_phsap_prim *pp = (struct osmo_phsap_prim *) oph;
|
||||
int rc = 0;
|
||||
|
||||
if (oph->sap != SAP_GSM_PH)
|
||||
return -ENODEV;
|
||||
|
||||
if (oph->operation != PRIM_OP_REQUEST)
|
||||
return -EINVAL;
|
||||
|
||||
switch (oph->primitive) {
|
||||
case PRIM_PH_RACH:
|
||||
/* A BTS never transmits RACH */
|
||||
case PRIM_PH_DATA:
|
||||
/* we use the LAPDm code in polling only, we should never
|
||||
* get a PH-DATA.req */
|
||||
default:
|
||||
LOGP(DLAPDM, LOGL_ERROR, "LAPDm sends unknown prim %u\n",
|
||||
oph->primitive);
|
||||
rc = -EINVAL;
|
||||
break;
|
||||
}
|
||||
|
||||
return rc;
|
||||
}
|
|
@ -0,0 +1,243 @@
|
|||
/* Main program for Sysmocom BTS */
|
||||
|
||||
/* (C) 2011 by Harald Welte <laforge@gnumonks.org>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||
* the Free Software Foundation; either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
#include <stdint.h>
|
||||
#include <unistd.h>
|
||||
#include <stdlib.h>
|
||||
#include <errno.h>
|
||||
#include <getopt.h>
|
||||
#include <sys/signal.h>
|
||||
|
||||
#include <netinet/in.h>
|
||||
#include <arpa/inet.h>
|
||||
|
||||
#include <osmocom/core/talloc.h>
|
||||
#include <osmocom/core/application.h>
|
||||
|
||||
#include <osmo-bts/gsm_data.h>
|
||||
#include <osmo-bts/logging.h>
|
||||
#include <osmo-bts/abis.h>
|
||||
#include <osmo-bts/bts.h>
|
||||
#include <osmo-bts/vty.h>
|
||||
|
||||
#include "l1_if.h"
|
||||
|
||||
/* FIXME: read from real hardware */
|
||||
const uint8_t abis_mac[6] = { 0,1,2,3,4,5 };
|
||||
/* FIXME: generate from git */
|
||||
const char *software_version = "0815";
|
||||
|
||||
static const char *bsc_host = NULL;
|
||||
static const char *config_file = "osmo-bts.cfg";
|
||||
extern const char *osmobts_copyright;
|
||||
static int daemonize = 0;
|
||||
|
||||
int bts_model_init(struct gsm_bts *bts)
|
||||
{
|
||||
struct femtol1_hdl *fl1h;
|
||||
|
||||
fl1h = l1if_open(bts->c0);
|
||||
if (!fl1h) {
|
||||
LOGP(DL1C, LOGL_FATAL, "Cannot open L1 Interface\n");
|
||||
return -EIO;
|
||||
}
|
||||
|
||||
bts->c0->role_bts.l1h = fl1h;
|
||||
|
||||
l1if_reset(fl1h);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
struct ipabis_link *link_init(struct gsm_bts *bts, const char *ip)
|
||||
{
|
||||
struct ipabis_link *link = talloc_zero(bts, struct ipabis_link);
|
||||
struct in_addr ia;
|
||||
int rc;
|
||||
|
||||
inet_aton(ip, &ia);
|
||||
|
||||
link->bts = bts;
|
||||
bts->oml_link = link;
|
||||
|
||||
rc = abis_open(link, ntohl(ia.s_addr));
|
||||
if (rc < 0)
|
||||
return NULL;
|
||||
|
||||
return link;
|
||||
}
|
||||
|
||||
static void print_help()
|
||||
{
|
||||
printf( "Some useful options:\n"
|
||||
" -h --help this text\n"
|
||||
" -d --debug MASK Enable debugging (e.g. -d DRSL:DOML:DLAPDM)\n"
|
||||
" -D --daemonize For the process into a background daemon\n"
|
||||
" -c --config-file Specify the filename of the config file\n"
|
||||
" -s --disable-color Don't use colors in stderr log output\n"
|
||||
" -T --timestamp Prefix every log line with a timestamp\n"
|
||||
" -V --version Print version information and exit\n"
|
||||
" -e --log-level Set a global log-level\n"
|
||||
" -B --bsc-host Specify host-name of the BSC\n"
|
||||
);
|
||||
}
|
||||
|
||||
/* FIXME: finally get some option parsing code into libosmocore */
|
||||
static void handle_options(int argc, char **argv)
|
||||
{
|
||||
while (1) {
|
||||
int option_idx = 0, c;
|
||||
static const struct option long_options[] = {
|
||||
/* FIXME: all those are generic Osmocom app options */
|
||||
{ "help", 0, 0, 'h' },
|
||||
{ "debug", 1, 0, 'd' },
|
||||
{ "daemonize", 0, 0, 'D' },
|
||||
{ "config-file", 1, 0, 'c' },
|
||||
{ "disable-color", 0, 0, 's' },
|
||||
{ "timestamp", 0, 0, 'T' },
|
||||
{ "version", 0, 0, 'V' },
|
||||
{ "log-level", 1, 0, 'e' },
|
||||
{ "bsc-host", 1, 0, 'B' },
|
||||
{ 0, 0, 0, 0 }
|
||||
};
|
||||
|
||||
c = getopt_long(argc, argv, "hd:Dc:sTVe:B:",
|
||||
long_options, &option_idx);
|
||||
if (c == -1)
|
||||
break;
|
||||
|
||||
switch (c) {
|
||||
case 'h':
|
||||
print_help();
|
||||
exit(0);
|
||||
break;
|
||||
case 's':
|
||||
log_set_use_color(osmo_stderr_target, 0);
|
||||
break;
|
||||
case 'd':
|
||||
log_parse_category_mask(osmo_stderr_target, optarg);
|
||||
break;
|
||||
case 'D':
|
||||
daemonize = 1;
|
||||
break;
|
||||
case 'c':
|
||||
config_file = strdup(optarg);
|
||||
break;
|
||||
case 'T':
|
||||
log_set_print_timestamp(osmo_stderr_target, 1);
|
||||
break;
|
||||
case 'V':
|
||||
print_version(1);
|
||||
exit(0);
|
||||
break;
|
||||
case 'e':
|
||||
log_set_log_level(osmo_stderr_target, atoi(optarg));
|
||||
break;
|
||||
case 'B':
|
||||
bsc_host = strdup(optarg);
|
||||
break;
|
||||
default:
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static void signal_handler(int signal)
|
||||
{
|
||||
fprintf(stderr, "signal %u received\n", signal);
|
||||
|
||||
switch (signal) {
|
||||
case SIGINT:
|
||||
//osmo_signal_dispatch(SS_GLOBAL, S_GLOBAL_SHUTDOWN, NULL);
|
||||
sleep(3);
|
||||
exit(0);
|
||||
break;
|
||||
case SIGABRT:
|
||||
case SIGUSR1:
|
||||
case SIGUSR2:
|
||||
talloc_report_full(tall_bts_ctx, stderr);
|
||||
break;
|
||||
default:
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
int main(int argc, char **argv)
|
||||
{
|
||||
struct gsm_bts *bts;
|
||||
struct ipabis_link *link;
|
||||
int rc;
|
||||
|
||||
tall_bts_ctx = talloc_named_const(NULL, 1, "OsmoBTS context");
|
||||
|
||||
bts_log_init(NULL);
|
||||
|
||||
bts = gsm_bts_alloc(tall_bts_ctx);
|
||||
|
||||
vty_init(&bts_vty_info);
|
||||
//bts_vty_init(&
|
||||
|
||||
/* FIXME: parse config file */
|
||||
|
||||
rc = telnet_init(tall_bts_ctx, NULL, 4241);
|
||||
if (rc < 0) {
|
||||
fprintf(stderr, "Error initializing telnet\n");
|
||||
exit(1);
|
||||
}
|
||||
|
||||
handle_options(argc, argv);
|
||||
|
||||
if (!bsc_host) {
|
||||
fprintf(stderr, "You need to specify the BSC hostname\n");
|
||||
exit(2);
|
||||
}
|
||||
|
||||
signal(SIGINT, &signal_handler);
|
||||
signal(SIGABRT, &signal_handler);
|
||||
signal(SIGUSR1, &signal_handler);
|
||||
signal(SIGUSR2, &signal_handler);
|
||||
osmo_init_ignore_signals();
|
||||
|
||||
if (bts_init(bts) < 0) {
|
||||
fprintf(stderr, "unable to to open bts\n");
|
||||
exit(1);
|
||||
}
|
||||
|
||||
link = link_init(bts, bsc_host);
|
||||
if (!link) {
|
||||
fprintf(stderr, "unable to connect to BSC\n");
|
||||
exit(1);
|
||||
}
|
||||
bts->oml_link = link;
|
||||
|
||||
if (daemonize) {
|
||||
rc = osmo_daemonize();
|
||||
if (rc < 0) {
|
||||
perror("Error during daemonize");
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
|
||||
while (1) {
|
||||
log_reset_context();
|
||||
osmo_select_main(0);
|
||||
}
|
||||
}
|
|
@ -0,0 +1,545 @@
|
|||
/* (C) 2011 by Harald Welte <laforge@gnumonks.org>
|
||||
*
|
||||
* All Rights Reserved
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU Affero General Public License as published by
|
||||
* the Free Software Foundation; either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*
|
||||
*/
|
||||
|
||||
#include <stdint.h>
|
||||
|
||||
#include <osmocom/core/talloc.h>
|
||||
#include <osmocom/core/utils.h>
|
||||
|
||||
#include <sysmocom/femtobts/gsml1prim.h>
|
||||
#include <sysmocom/femtobts/gsml1const.h>
|
||||
#include <sysmocom/femtobts/gsml1types.h>
|
||||
|
||||
#include <osmo-bts/gsm_data.h>
|
||||
#include <osmo-bts/logging.h>
|
||||
#include <osmo-bts/oml.h>
|
||||
|
||||
#include "l1_if.h"
|
||||
#include "femtobts.h"
|
||||
|
||||
static const enum GsmL1_LogChComb_t pchan_to_logChComb[_GSM_PCHAN_MAX] = {
|
||||
[GSM_PCHAN_NONE] = GsmL1_LogChComb_0,
|
||||
[GSM_PCHAN_CCCH] = GsmL1_LogChComb_IV,
|
||||
[GSM_PCHAN_CCCH_SDCCH4] = GsmL1_LogChComb_V,
|
||||
[GSM_PCHAN_TCH_F] = GsmL1_LogChComb_I,
|
||||
[GSM_PCHAN_TCH_H] = GsmL1_LogChComb_II,
|
||||
[GSM_PCHAN_SDCCH8_SACCH8C] = GsmL1_LogChComb_VII,
|
||||
[GSM_PCHAN_PDCH] = GsmL1_LogChComb_XIII,
|
||||
//[GSM_PCHAN_TCH_F_PDCH] = FIXME,
|
||||
[GSM_PCHAN_UNKNOWN] = GsmL1_LogChComb_0,
|
||||
};
|
||||
|
||||
static void *prim_init(GsmL1_Prim_t *prim, GsmL1_PrimId_t id, struct femtol1_hdl *gl1)
|
||||
{
|
||||
prim->id = id;
|
||||
|
||||
/* for some reason the hLayer1 field is not always at the same position
|
||||
* in the GsmL1_Prim_t, so we have to have this ugly case statement here... */
|
||||
switch (id) {
|
||||
case GsmL1_PrimId_MphInitReq:
|
||||
//prim->u.mphInitReq.hLayer1 = gl1->hLayer1;
|
||||
break;
|
||||
case GsmL1_PrimId_MphCloseReq:
|
||||
prim->u.mphCloseReq.hLayer1 = gl1->hLayer1;
|
||||
break;
|
||||
case GsmL1_PrimId_MphConnectReq:
|
||||
prim->u.mphConnectReq.hLayer1 = gl1->hLayer1;
|
||||
break;
|
||||
case GsmL1_PrimId_MphDisconnectReq:
|
||||
prim->u.mphDisconnectReq.hLayer1 = gl1->hLayer1;
|
||||
break;
|
||||
case GsmL1_PrimId_MphActivateReq:
|
||||
prim->u.mphActivateReq.hLayer1 = gl1->hLayer1;
|
||||
break;
|
||||
case GsmL1_PrimId_MphDeactivateReq:
|
||||
prim->u.mphDeactivateReq.hLayer1 = gl1->hLayer1;
|
||||
break;
|
||||
case GsmL1_PrimId_MphConfigReq:
|
||||
prim->u.mphConfigReq.hLayer1 = gl1->hLayer1;
|
||||
break;
|
||||
case GsmL1_PrimId_MphMeasureReq:
|
||||
prim->u.mphMeasureReq.hLayer1 = gl1->hLayer1;
|
||||
break;
|
||||
case GsmL1_PrimId_MphInitCnf:
|
||||
case GsmL1_PrimId_MphCloseCnf:
|
||||
case GsmL1_PrimId_MphConnectCnf:
|
||||
case GsmL1_PrimId_MphDisconnectCnf:
|
||||
case GsmL1_PrimId_MphActivateCnf:
|
||||
case GsmL1_PrimId_MphDeactivateCnf:
|
||||
case GsmL1_PrimId_MphConfigCnf:
|
||||
case GsmL1_PrimId_MphMeasureCnf:
|
||||
break;
|
||||
case GsmL1_PrimId_MphTimeInd:
|
||||
break;
|
||||
case GsmL1_PrimId_MphSyncInd:
|
||||
break;
|
||||
case GsmL1_PrimId_PhEmptyFrameReq:
|
||||
prim->u.phEmptyFrameReq.hLayer1 = gl1->hLayer1;
|
||||
break;
|
||||
case GsmL1_PrimId_PhDataReq:
|
||||
prim->u.phDataReq.hLayer1 = gl1->hLayer1;
|
||||
break;
|
||||
case GsmL1_PrimId_PhConnectInd:
|
||||
break;
|
||||
case GsmL1_PrimId_PhReadyToSendInd:
|
||||
break;
|
||||
case GsmL1_PrimId_PhDataInd:
|
||||
break;
|
||||
case GsmL1_PrimId_PhRaInd:
|
||||
break;
|
||||
default:
|
||||
LOGP(DL1C, LOGL_ERROR, "unknown L1 primitive %u\n", id);
|
||||
break;
|
||||
}
|
||||
return &prim->u;
|
||||
}
|
||||
|
||||
GsmL1_Status_t prim_status(GsmL1_Prim_t *prim)
|
||||
{
|
||||
/* for some reason the Status field is not always at the same position
|
||||
* in the GsmL1_Prim_t, so we have to have this ugly case statement here... */
|
||||
switch (prim->id) {
|
||||
case GsmL1_PrimId_MphInitCnf:
|
||||
return prim->u.mphInitCnf.status;
|
||||
case GsmL1_PrimId_MphCloseCnf:
|
||||
return prim->u.mphCloseCnf.status;
|
||||
case GsmL1_PrimId_MphConnectCnf:
|
||||
return prim->u.mphConnectCnf.status;
|
||||
case GsmL1_PrimId_MphDisconnectCnf:
|
||||
return prim->u.mphDisconnectCnf.status;
|
||||
case GsmL1_PrimId_MphActivateCnf:
|
||||
return prim->u.mphActivateCnf.status;
|
||||
case GsmL1_PrimId_MphDeactivateCnf:
|
||||
return prim->u.mphDeactivateCnf.status;
|
||||
case GsmL1_PrimId_MphConfigCnf:
|
||||
return prim->u.mphConfigCnf.status;
|
||||
case GsmL1_PrimId_MphMeasureCnf:
|
||||
return prim->u.mphMeasureCnf.status;
|
||||
default:
|
||||
break;
|
||||
}
|
||||
return GsmL1_Status_Success;
|
||||
}
|
||||
|
||||
#if 0
|
||||
static int compl_cb_send_oml_msg(struct msgb *l1_msg, void *data)
|
||||
{
|
||||
struct msgb *resp_msg = data;
|
||||
GsmL1_Prim_t *l1p = msgb_l1prim(l1_msg);
|
||||
|
||||
if (prim_status(l1p) != GsmL1_Status_Success) {
|
||||
LOGP(DL1C, LOGL_ERROR, "Rx %s, status: %s\n",
|
||||
get_value_string(femtobts_l1prim_names, l1p->id),
|
||||
get_value_string(femtobts_l1status_names, cc->status));
|
||||
return 0;
|
||||
}
|
||||
|
||||
msgb_free(l1_msg);
|
||||
|
||||
return abis_nm_sendmsg(msg);
|
||||
}
|
||||
#endif
|
||||
|
||||
int lchan_activate(struct gsm_lchan *lchan);
|
||||
|
||||
static int opstart_compl_cb(struct msgb *l1_msg, void *data)
|
||||
{
|
||||
struct gsm_abis_mo *mo = data;
|
||||
GsmL1_Prim_t *l1p = msgb_l1prim(l1_msg);
|
||||
GsmL1_Status_t status = prim_status(l1p);
|
||||
|
||||
if (status != GsmL1_Status_Success) {
|
||||
LOGP(DL1C, LOGL_ERROR, "Rx %s, status: %s\n",
|
||||
get_value_string(femtobts_l1prim_names, l1p->id),
|
||||
get_value_string(femtobts_l1status_names, status));
|
||||
return oml_mo_opstart_nack(mo, NM_NACK_CANT_PERFORM);
|
||||
}
|
||||
|
||||
msgb_free(l1_msg);
|
||||
|
||||
/* Set to Operational State: Enabled */
|
||||
oml_mo_state_chg(mo, NM_OPSTATE_ENABLED, NM_AVSTATE_OK);
|
||||
|
||||
/* ugly hack to auto-activate all SAPIs for the BCCH/CCCH on TS0 */
|
||||
if (mo->obj_class == NM_OC_CHANNEL && mo->obj_inst.trx_nr == 0 &&
|
||||
mo->obj_inst.ts_nr == 0) {
|
||||
DEBUGP(DL1C, "====> trying to activate lchans of BCCH\n");
|
||||
lchan_activate(&mo->bts->c0->ts[0].lchan[0]);
|
||||
}
|
||||
|
||||
/* Send OPSTART ack */
|
||||
return oml_mo_opstart_ack(mo);
|
||||
}
|
||||
|
||||
static int trx_init_compl_cb(struct msgb *l1_msg, void *data)
|
||||
{
|
||||
struct femtol1_hdl *fl1h = data;
|
||||
struct gsm_bts_trx *trx = fl1h->priv;
|
||||
|
||||
GsmL1_Prim_t *l1p = msgb_l1prim(l1_msg);
|
||||
GsmL1_MphInitCnf_t *ic = &l1p->u.mphInitCnf;
|
||||
|
||||
/* store layer1 handle */
|
||||
if (ic->status == GsmL1_Status_Success)
|
||||
fl1h->hLayer1 = ic->hLayer1;
|
||||
|
||||
return opstart_compl_cb(l1_msg, &trx->mo);
|
||||
}
|
||||
|
||||
/* initialize the layer1 */
|
||||
static int trx_init(struct gsm_bts_trx *trx)
|
||||
{
|
||||
struct msgb *msg = l1p_msgb_alloc();
|
||||
struct femtol1_hdl *fl1h = trx_femtol1_hdl(trx);
|
||||
GsmL1_MphInitReq_t *mi_req;
|
||||
GsmL1_DeviceParam_t *dev_par;
|
||||
|
||||
mi_req = prim_init(msgb_l1prim(msg), GsmL1_PrimId_MphInitReq, fl1h);
|
||||
dev_par = &mi_req->deviceParam;
|
||||
dev_par->devType = GsmL1_DevType_TxdRxu;
|
||||
dev_par->freqBand = GsmL1_FreqBand_1800;
|
||||
dev_par->u16Arfcn = trx->arfcn;
|
||||
dev_par->u16BcchArfcn = trx->bts->c0->arfcn;
|
||||
dev_par->u8NbTsc = trx->bts->bsic & 7;
|
||||
DEBUGP(DL1C, "Setting TSC=%d\n", dev_par->u8NbTsc);
|
||||
dev_par->fRxPowerLevel = -75.f;
|
||||
dev_par->fTxPowerLevel = trx->nominal_power - trx->max_power_red;
|
||||
|
||||
/* send MPH-INIT-REQ, wait for MPH-INIT-CNF */
|
||||
return l1if_req_compl(fl1h, msg, 0, trx_init_compl_cb, fl1h);
|
||||
}
|
||||
|
||||
static int ts_connect(struct gsm_bts_trx_ts *ts)
|
||||
{
|
||||
struct msgb *msg = l1p_msgb_alloc();
|
||||
struct femtol1_hdl *fl1h = trx_femtol1_hdl(ts->trx);
|
||||
GsmL1_MphConnectReq_t *cr;
|
||||
|
||||
cr = prim_init(msgb_l1prim(msg), GsmL1_PrimId_MphConnectReq, fl1h);
|
||||
cr->u8Tn = ts->nr;
|
||||
cr->logChComb = pchan_to_logChComb[ts->pchan];
|
||||
|
||||
return l1if_req_compl(fl1h, msg, 0, opstart_compl_cb, &ts->mo);
|
||||
}
|
||||
|
||||
GsmL1_SubCh_t lchan_to_GsmL1_SubCh_t(const struct gsm_lchan *lchan)
|
||||
{
|
||||
switch (lchan->ts->pchan) {
|
||||
case GSM_PCHAN_CCCH_SDCCH4:
|
||||
case GSM_PCHAN_TCH_H:
|
||||
case GSM_PCHAN_SDCCH8_SACCH8C:
|
||||
return lchan->nr;
|
||||
case GSM_PCHAN_NONE:
|
||||
case GSM_PCHAN_CCCH:
|
||||
case GSM_PCHAN_TCH_F:
|
||||
case GSM_PCHAN_PDCH:
|
||||
case GSM_PCHAN_UNKNOWN:
|
||||
default:
|
||||
return GsmL1_SubCh_NA;
|
||||
}
|
||||
|
||||
return GsmL1_SubCh_NA;
|
||||
}
|
||||
|
||||
struct sapi_dir {
|
||||
GsmL1_Sapi_t sapi;
|
||||
GsmL1_Dir_t dir;
|
||||
};
|
||||
|
||||
static const struct sapi_dir ccch_sapis[] = {
|
||||
{ GsmL1_Sapi_Fcch, GsmL1_Dir_TxDownlink },
|
||||
{ GsmL1_Sapi_Sch, GsmL1_Dir_TxDownlink },
|
||||
{ GsmL1_Sapi_Bcch, GsmL1_Dir_TxDownlink },
|
||||
{ GsmL1_Sapi_Agch, GsmL1_Dir_TxDownlink },
|
||||
{ GsmL1_Sapi_Pch, GsmL1_Dir_TxDownlink },
|
||||
{ GsmL1_Sapi_Rach, GsmL1_Dir_RxUplink },
|
||||
};
|
||||
|
||||
#define DIR_BOTH (GsmL1_Dir_TxDownlink|GsmL1_Dir_RxUplink)
|
||||
|
||||
static const struct sapi_dir tchf_sapis[] = {
|
||||
{ GsmL1_Sapi_TchF, DIR_BOTH },
|
||||
{ GsmL1_Sapi_FacchF, DIR_BOTH },
|
||||
{ GsmL1_Sapi_Sacch, DIR_BOTH },
|
||||
};
|
||||
|
||||
static const struct sapi_dir tchh_sapis[] = {
|
||||
{ GsmL1_Sapi_TchH, DIR_BOTH },
|
||||
{ GsmL1_Sapi_FacchH, DIR_BOTH },
|
||||
{ GsmL1_Sapi_Sacch, DIR_BOTH },
|
||||
};
|
||||
|
||||
static const struct sapi_dir sdcch_sapis[] = {
|
||||
{ GsmL1_Sapi_Sdcch, DIR_BOTH },
|
||||
{ GsmL1_Sapi_Sacch, DIR_BOTH },
|
||||
};
|
||||
|
||||
struct lchan_sapis {
|
||||
const struct sapi_dir *sapis;
|
||||
unsigned int num_sapis;
|
||||
};
|
||||
|
||||
static const struct lchan_sapis sapis_for_lchan[_GSM_LCHAN_MAX] = {
|
||||
[GSM_LCHAN_SDCCH] = {
|
||||
.sapis = sdcch_sapis,
|
||||
.num_sapis = ARRAY_SIZE(sdcch_sapis),
|
||||
},
|
||||
[GSM_LCHAN_TCH_F] = {
|
||||
.sapis = tchf_sapis,
|
||||
.num_sapis = ARRAY_SIZE(tchf_sapis),
|
||||
},
|
||||
[GSM_LCHAN_TCH_H] = {
|
||||
.sapis = tchh_sapis,
|
||||
.num_sapis = ARRAY_SIZE(tchh_sapis),
|
||||
},
|
||||
[GSM_LCHAN_CCCH] = {
|
||||
.sapis = ccch_sapis,
|
||||
.num_sapis = ARRAY_SIZE(ccch_sapis),
|
||||
},
|
||||
};
|
||||
|
||||
static int lchan_act_compl_cb(struct msgb *l1_msg, void *data)
|
||||
{
|
||||
struct gsm_lchan *lchan = data;
|
||||
GsmL1_Prim_t *l1p = msgb_l1prim(l1_msg);
|
||||
GsmL1_MphActivateCnf_t *ic = &l1p->u.mphActivateCnf;
|
||||
|
||||
LOGP(DL1C, LOGL_NOTICE, "%s MPH-ACTIVATE.conf\n", gsm_lchan_name(lchan));
|
||||
|
||||
if (ic->status == GsmL1_Status_Success) {
|
||||
DEBUGP(DL1C, "Successful activation of L1 SAPI %s on TS %u\n",
|
||||
get_value_string(femtobts_l1sapi_names, ic->sapi), ic->u8Tn);
|
||||
lchan->state = LCHAN_S_ACTIVE;
|
||||
} else {
|
||||
LOGP(DL1C, LOGL_ERROR, "Error activating L1 SAPI %s on TS %u: %s\n",
|
||||
get_value_string(femtobts_l1sapi_names, ic->sapi), ic->u8Tn,
|
||||
get_value_string(femtobts_l1status_names, ic->status));
|
||||
lchan->state = LCHAN_S_NONE;
|
||||
}
|
||||
|
||||
switch (ic->sapi) {
|
||||
case GsmL1_Sapi_Sdcch:
|
||||
case GsmL1_Sapi_TchF:
|
||||
/* FIXME: Send RSL CHAN ACT */
|
||||
break;
|
||||
default:
|
||||
break;
|
||||
}
|
||||
|
||||
msgb_free(l1_msg);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
uint32_t l1if_lchan_to_hLayer2(struct gsm_lchan *lchan)
|
||||
{
|
||||
return (lchan->nr << 8) | (lchan->ts->nr << 16) | (lchan->ts->trx->nr << 24);
|
||||
}
|
||||
|
||||
/* obtain a ptr to the lapdm_channel for a given hLayer2 */
|
||||
struct gsm_lchan *
|
||||
l1if_hLayer2_to_lchan(struct gsm_bts_trx *trx, uint32_t hLayer2)
|
||||
{
|
||||
uint8_t ts_nr = (hLayer2 >> 16) & 0xff;
|
||||
uint8_t lchan_nr = (hLayer2 >> 8)& 0xff;
|
||||
struct gsm_bts_trx_ts *ts;
|
||||
|
||||
/* FIXME: if we actually run on the BTS, the 32bit field is large
|
||||
* enough to simply put a pointer inside. */
|
||||
if (ts_nr >= ARRAY_SIZE(trx->ts))
|
||||
return NULL;
|
||||
|
||||
ts = &trx->ts[ts_nr];
|
||||
|
||||
if (lchan_nr >= ARRAY_SIZE(ts->lchan))
|
||||
return NULL;
|
||||
|
||||
return &ts->lchan[lchan_nr];
|
||||
}
|
||||
|
||||
|
||||
|
||||
int lchan_activate(struct gsm_lchan *lchan)
|
||||
{
|
||||
struct femtol1_hdl *fl1h = trx_femtol1_hdl(lchan->ts->trx);
|
||||
const struct lchan_sapis *s4l = &sapis_for_lchan[lchan->type];
|
||||
unsigned int i;
|
||||
|
||||
for (i = 0; i < s4l->num_sapis; i++) {
|
||||
struct msgb *msg = l1p_msgb_alloc();
|
||||
GsmL1_MphActivateReq_t *act_req;
|
||||
|
||||
act_req = prim_init(msgb_l1prim(msg), GsmL1_PrimId_MphActivateReq, fl1h);
|
||||
act_req->u8Tn = lchan->ts->nr;
|
||||
act_req->subCh = lchan_to_GsmL1_SubCh_t(lchan);
|
||||
act_req->dir = s4l->sapis[i].dir;
|
||||
act_req->sapi = s4l->sapis[i].sapi;
|
||||
act_req->hLayer2 = l1if_lchan_to_hLayer2(lchan);
|
||||
|
||||
switch (act_req->sapi) {
|
||||
case GsmL1_Sapi_Rach:
|
||||
act_req->logChPrm.rach.u8Bsic = lchan->ts->trx->bts->bsic;
|
||||
break;
|
||||
case GsmL1_Sapi_Agch:
|
||||
#warning Set BS_AG_BLKS_RES
|
||||
act_req->logChPrm.agch.u8NbrOfAgch = 1;
|
||||
break;
|
||||
case GsmL1_Sapi_Sacch:
|
||||
/* Only if we use manual MS power control */
|
||||
//act_req->logChPrm.sacch.u8MsPowerLevel = FIXME;
|
||||
break;
|
||||
case GsmL1_Sapi_TchH:
|
||||
case GsmL1_Sapi_TchF:
|
||||
#warning Set AMR parameters for TCH
|
||||
break;
|
||||
default:
|
||||
break;
|
||||
}
|
||||
|
||||
LOGP(DL1C, LOGL_NOTICE, "%s MPH-ACTIVATE.req (hL2=0x%08x)\n",
|
||||
gsm_lchan_name(lchan), act_req->hLayer2);
|
||||
|
||||
/* send the primitive for all GsmL1_Sapi_* that match the LCHAN */
|
||||
l1if_req_compl(fl1h, msg, 0, lchan_act_compl_cb, lchan);
|
||||
|
||||
}
|
||||
lchan->state = LCHAN_S_ACT_REQ;
|
||||
|
||||
lchan_init_lapdm(lchan);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int lchan_deact_compl_cb(struct msgb *l1_msg, void *data)
|
||||
{
|
||||
struct gsm_lchan *lchan = data;
|
||||
GsmL1_Prim_t *l1p = msgb_l1prim(l1_msg);
|
||||
GsmL1_MphDeactivateCnf_t *ic = &l1p->u.mphDeactivateCnf;
|
||||
|
||||
LOGP(DL1C, LOGL_NOTICE, "%s MPH-DEACTIVATE.conf\n", gsm_lchan_name(lchan));
|
||||
|
||||
if (ic->status == GsmL1_Status_Success) {
|
||||
DEBUGP(DL1C, "Successful deactivation of L1 SAPI %s on TS %u\n",
|
||||
get_value_string(femtobts_l1sapi_names, ic->sapi), ic->u8Tn);
|
||||
lchan->state = LCHAN_S_ACTIVE;
|
||||
} else {
|
||||
LOGP(DL1C, LOGL_ERROR, "Error deactivating L1 SAPI %s on TS %u: %s\n",
|
||||
get_value_string(femtobts_l1sapi_names, ic->sapi), ic->u8Tn,
|
||||
get_value_string(femtobts_l1status_names, ic->status));
|
||||
lchan->state = LCHAN_S_NONE;
|
||||
}
|
||||
|
||||
switch (ic->sapi) {
|
||||
case GsmL1_Sapi_Sdcch:
|
||||
case GsmL1_Sapi_TchF:
|
||||
/* FIXME: Send RSL CHAN REL ACK */
|
||||
break;
|
||||
default:
|
||||
break;
|
||||
}
|
||||
|
||||
msgb_free(l1_msg);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int lchan_deactivate(struct gsm_lchan *lchan)
|
||||
{
|
||||
struct femtol1_hdl *fl1h = trx_femtol1_hdl(lchan->ts->trx);
|
||||
const struct lchan_sapis *s4l = &sapis_for_lchan[lchan->type];
|
||||
unsigned int i;
|
||||
|
||||
for (i = 0; i < s4l->num_sapis; i++) {
|
||||
struct msgb *msg = l1p_msgb_alloc();
|
||||
GsmL1_MphDeactivateReq_t *deact_req;
|
||||
|
||||
deact_req = prim_init(msgb_l1prim(msg), GsmL1_PrimId_MphDeactivateReq, fl1h);
|
||||
deact_req->u8Tn = lchan->ts->nr;
|
||||
deact_req->subCh = lchan_to_GsmL1_SubCh_t(lchan);
|
||||
deact_req->dir = s4l->sapis[i].dir;
|
||||
deact_req->sapi = s4l->sapis[i].sapi;
|
||||
|
||||
LOGP(DL1C, LOGL_NOTICE, "%s MPH-DEACTIVATE.req\n",
|
||||
gsm_lchan_name(lchan));
|
||||
|
||||
/* send the primitive for all GsmL1_Sapi_* that match the LCHAN */
|
||||
l1if_req_compl(fl1h, msg, 0, lchan_deact_compl_cb, lchan);
|
||||
|
||||
}
|
||||
lchan->state = LCHAN_S_ACT_REQ;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
struct gsm_time *bts_model_get_time(struct gsm_bts *bts)
|
||||
{
|
||||
struct femtol1_hdl *fl1h = trx_femtol1_hdl(bts->c0);
|
||||
|
||||
return &fl1h->gsm_time;
|
||||
}
|
||||
|
||||
/* callback from OML */
|
||||
int bts_model_check_oml(struct gsm_bts *bts, uint8_t msg_type,
|
||||
struct tlv_parsed *old_attr, struct tlv_parsed *new_attr,
|
||||
void *obj)
|
||||
{
|
||||
/* FIXME: check if the attributes are valid */
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* callback from OML */
|
||||
int bts_model_apply_oml(struct gsm_bts *bts, struct msgb *msg,
|
||||
struct tlv_parsed *new_attr, void *obj)
|
||||
{
|
||||
/* FIXME: we actaully need to send a ACK or NACK for the OML message */
|
||||
return oml_fom_ack_nack(msg, 0);
|
||||
}
|
||||
|
||||
/* callback from OML */
|
||||
int bts_model_opstart(struct gsm_bts *bts, struct gsm_abis_mo *mo,
|
||||
void *obj)
|
||||
{
|
||||
int rc;
|
||||
|
||||
switch (mo->obj_class) {
|
||||
case NM_OC_RADIO_CARRIER:
|
||||
rc = trx_init(obj);
|
||||
break;
|
||||
case NM_OC_CHANNEL:
|
||||
rc = ts_connect(obj);
|
||||
break;
|
||||
case NM_OC_BTS:
|
||||
case NM_OC_SITE_MANAGER:
|
||||
case NM_OC_BASEB_TRANSC:
|
||||
mo->nm_state.operational = NM_OPSTATE_ENABLED;
|
||||
rc = oml_mo_opstart_ack(mo);
|
||||
default:
|
||||
rc = oml_mo_opstart_nack(mo, NM_NACK_OBJCLASS_NOTSUPP);
|
||||
}
|
||||
return rc;
|
||||
}
|
||||
|
||||
int bts_model_chg_adm_state(struct gsm_bts *bts, struct gsm_abis_mo *mo,
|
||||
void *obj, uint8_t adm_state)
|
||||
{
|
||||
/* blindly accept all state changes */
|
||||
mo->nm_state.administrative = adm_state;
|
||||
return oml_mo_fom_ack_nack(mo, NM_MT_CHG_ADM_STATE, 0);
|
||||
}
|
Loading…
Reference in New Issue