/[dtapublic]/projs/trunk/shared_source/c_datd/bstrfunc.c
ViewVC logotype

Annotation of /projs/trunk/shared_source/c_datd/bstrfunc.c

Parent Directory Parent Directory | Revision Log Revision Log


Revision 25 - (hide annotations) (download)
Sat Oct 8 06:43:03 2016 UTC (7 years, 9 months ago) by dashley
Original Path: sf_code/esrgpcpj/shared/c_datd/bstrfunc.c
File MIME type: text/plain
File size: 68817 byte(s)
Initial commit.
1 dashley 25 // $Header: /cvsroot/esrg/sfesrg/esrgpcpj/shared/c_datd/bstrfunc.c,v 1.6 2001/07/29 07:18:22 dtashley Exp $
2    
3     //--------------------------------------------------------------------------------
4     //Copyright 2001 David T. Ashley
5     //-------------------------------------------------------------------------------------------------
6     //This source code and any program in which it is compiled/used is provided under the GNU GENERAL
7     //PUBLIC LICENSE, Version 3, full license text below.
8     //-------------------------------------------------------------------------------------------------
9     // GNU GENERAL PUBLIC LICENSE
10     // Version 3, 29 June 2007
11     //
12     // Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
13     // Everyone is permitted to copy and distribute verbatim copies
14     // of this license document, but changing it is not allowed.
15     //
16     // Preamble
17     //
18     // The GNU General Public License is a free, copyleft license for
19     //software and other kinds of works.
20     //
21     // The licenses for most software and other practical works are designed
22     //to take away your freedom to share and change the works. By contrast,
23     //the GNU General Public License is intended to guarantee your freedom to
24     //share and change all versions of a program--to make sure it remains free
25     //software for all its users. We, the Free Software Foundation, use the
26     //GNU General Public License for most of our software; it applies also to
27     //any other work released this way by its authors. You can apply it to
28     //your programs, too.
29     //
30     // When we speak of free software, we are referring to freedom, not
31     //price. Our General Public Licenses are designed to make sure that you
32     //have the freedom to distribute copies of free software (and charge for
33     //them if you wish), that you receive source code or can get it if you
34     //want it, that you can change the software or use pieces of it in new
35     //free programs, and that you know you can do these things.
36     //
37     // To protect your rights, we need to prevent others from denying you
38     //these rights or asking you to surrender the rights. Therefore, you have
39     //certain responsibilities if you distribute copies of the software, or if
40     //you modify it: responsibilities to respect the freedom of others.
41     //
42     // For example, if you distribute copies of such a program, whether
43     //gratis or for a fee, you must pass on to the recipients the same
44     //freedoms that you received. You must make sure that they, too, receive
45     //or can get the source code. And you must show them these terms so they
46     //know their rights.
47     //
48     // Developers that use the GNU GPL protect your rights with two steps:
49     //(1) assert copyright on the software, and (2) offer you this License
50     //giving you legal permission to copy, distribute and/or modify it.
51     //
52     // For the developers' and authors' protection, the GPL clearly explains
53     //that there is no warranty for this free software. For both users' and
54     //authors' sake, the GPL requires that modified versions be marked as
55     //changed, so that their problems will not be attributed erroneously to
56     //authors of previous versions.
57     //
58     // Some devices are designed to deny users access to install or run
59     //modified versions of the software inside them, although the manufacturer
60     //can do so. This is fundamentally incompatible with the aim of
61     //protecting users' freedom to change the software. The systematic
62     //pattern of such abuse occurs in the area of products for individuals to
63     //use, which is precisely where it is most unacceptable. Therefore, we
64     //have designed this version of the GPL to prohibit the practice for those
65     //products. If such problems arise substantially in other domains, we
66     //stand ready to extend this provision to those domains in future versions
67     //of the GPL, as needed to protect the freedom of users.
68     //
69     // Finally, every program is threatened constantly by software patents.
70     //States should not allow patents to restrict development and use of
71     //software on general-purpose computers, but in those that do, we wish to
72     //avoid the special danger that patents applied to a free program could
73     //make it effectively proprietary. To prevent this, the GPL assures that
74     //patents cannot be used to render the program non-free.
75     //
76     // The precise terms and conditions for copying, distribution and
77     //modification follow.
78     //
79     // TERMS AND CONDITIONS
80     //
81     // 0. Definitions.
82     //
83     // "This License" refers to version 3 of the GNU General Public License.
84     //
85     // "Copyright" also means copyright-like laws that apply to other kinds of
86     //works, such as semiconductor masks.
87     //
88     // "The Program" refers to any copyrightable work licensed under this
89     //License. Each licensee is addressed as "you". "Licensees" and
90     //"recipients" may be individuals or organizations.
91     //
92     // To "modify" a work means to copy from or adapt all or part of the work
93     //in a fashion requiring copyright permission, other than the making of an
94     //exact copy. The resulting work is called a "modified version" of the
95     //earlier work or a work "based on" the earlier work.
96     //
97     // A "covered work" means either the unmodified Program or a work based
98     //on the Program.
99     //
100     // To "propagate" a work means to do anything with it that, without
101     //permission, would make you directly or secondarily liable for
102     //infringement under applicable copyright law, except executing it on a
103     //computer or modifying a private copy. Propagation includes copying,
104     //distribution (with or without modification), making available to the
105     //public, and in some countries other activities as well.
106     //
107     // To "convey" a work means any kind of propagation that enables other
108     //parties to make or receive copies. Mere interaction with a user through
109     //a computer network, with no transfer of a copy, is not conveying.
110     //
111     // An interactive user interface displays "Appropriate Legal Notices"
112     //to the extent that it includes a convenient and prominently visible
113     //feature that (1) displays an appropriate copyright notice, and (2)
114     //tells the user that there is no warranty for the work (except to the
115     //extent that warranties are provided), that licensees may convey the
116     //work under this License, and how to view a copy of this License. If
117     //the interface presents a list of user commands or options, such as a
118     //menu, a prominent item in the list meets this criterion.
119     //
120     // 1. Source Code.
121     //
122     // The "source code" for a work means the preferred form of the work
123     //for making modifications to it. "Object code" means any non-source
124     //form of a work.
125     //
126     // A "Standard Interface" means an interface that either is an official
127     //standard defined by a recognized standards body, or, in the case of
128     //interfaces specified for a particular programming language, one that
129     //is widely used among developers working in that language.
130     //
131     // The "System Libraries" of an executable work include anything, other
132     //than the work as a whole, that (a) is included in the normal form of
133     //packaging a Major Component, but which is not part of that Major
134     //Component, and (b) serves only to enable use of the work with that
135     //Major Component, or to implement a Standard Interface for which an
136     //implementation is available to the public in source code form. A
137     //"Major Component", in this context, means a major essential component
138     //(kernel, window system, and so on) of the specific operating system
139     //(if any) on which the executable work runs, or a compiler used to
140     //produce the work, or an object code interpreter used to run it.
141     //
142     // The "Corresponding Source" for a work in object code form means all
143     //the source code needed to generate, install, and (for an executable
144     //work) run the object code and to modify the work, including scripts to
145     //control those activities. However, it does not include the work's
146     //System Libraries, or general-purpose tools or generally available free
147     //programs which are used unmodified in performing those activities but
148     //which are not part of the work. For example, Corresponding Source
149     //includes interface definition files associated with source files for
150     //the work, and the source code for shared libraries and dynamically
151     //linked subprograms that the work is specifically designed to require,
152     //such as by intimate data communication or control flow between those
153     //subprograms and other parts of the work.
154     //
155     // The Corresponding Source need not include anything that users
156     //can regenerate automatically from other parts of the Corresponding
157     //Source.
158     //
159     // The Corresponding Source for a work in source code form is that
160     //same work.
161     //
162     // 2. Basic Permissions.
163     //
164     // All rights granted under this License are granted for the term of
165     //copyright on the Program, and are irrevocable provided the stated
166     //conditions are met. This License explicitly affirms your unlimited
167     //permission to run the unmodified Program. The output from running a
168     //covered work is covered by this License only if the output, given its
169     //content, constitutes a covered work. This License acknowledges your
170     //rights of fair use or other equivalent, as provided by copyright law.
171     //
172     // You may make, run and propagate covered works that you do not
173     //convey, without conditions so long as your license otherwise remains
174     //in force. You may convey covered works to others for the sole purpose
175     //of having them make modifications exclusively for you, or provide you
176     //with facilities for running those works, provided that you comply with
177     //the terms of this License in conveying all material for which you do
178     //not control copyright. Those thus making or running the covered works
179     //for you must do so exclusively on your behalf, under your direction
180     //and control, on terms that prohibit them from making any copies of
181     //your copyrighted material outside their relationship with you.
182     //
183     // Conveying under any other circumstances is permitted solely under
184     //the conditions stated below. Sublicensing is not allowed; section 10
185     //makes it unnecessary.
186     //
187     // 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
188     //
189     // No covered work shall be deemed part of an effective technological
190     //measure under any applicable law fulfilling obligations under article
191     //11 of the WIPO copyright treaty adopted on 20 December 1996, or
192     //similar laws prohibiting or restricting circumvention of such
193     //measures.
194     //
195     // When you convey a covered work, you waive any legal power to forbid
196     //circumvention of technological measures to the extent such circumvention
197     //is effected by exercising rights under this License with respect to
198     //the covered work, and you disclaim any intention to limit operation or
199     //modification of the work as a means of enforcing, against the work's
200     //users, your or third parties' legal rights to forbid circumvention of
201     //technological measures.
202     //
203     // 4. Conveying Verbatim Copies.
204     //
205     // You may convey verbatim copies of the Program's source code as you
206     //receive it, in any medium, provided that you conspicuously and
207     //appropriately publish on each copy an appropriate copyright notice;
208     //keep intact all notices stating that this License and any
209     //non-permissive terms added in accord with section 7 apply to the code;
210     //keep intact all notices of the absence of any warranty; and give all
211     //recipients a copy of this License along with the Program.
212     //
213     // You may charge any price or no price for each copy that you convey,
214     //and you may offer support or warranty protection for a fee.
215     //
216     // 5. Conveying Modified Source Versions.
217     //
218     // You may convey a work based on the Program, or the modifications to
219     //produce it from the Program, in the form of source code under the
220     //terms of section 4, provided that you also meet all of these conditions:
221     //
222     // a) The work must carry prominent notices stating that you modified
223     // it, and giving a relevant date.
224     //
225     // b) The work must carry prominent notices stating that it is
226     // released under this License and any conditions added under section
227     // 7. This requirement modifies the requirement in section 4 to
228     // "keep intact all notices".
229     //
230     // c) You must license the entire work, as a whole, under this
231     // License to anyone who comes into possession of a copy. This
232     // License will therefore apply, along with any applicable section 7
233     // additional terms, to the whole of the work, and all its parts,
234     // regardless of how they are packaged. This License gives no
235     // permission to license the work in any other way, but it does not
236     // invalidate such permission if you have separately received it.
237     //
238     // d) If the work has interactive user interfaces, each must display
239     // Appropriate Legal Notices; however, if the Program has interactive
240     // interfaces that do not display Appropriate Legal Notices, your
241     // work need not make them do so.
242     //
243     // A compilation of a covered work with other separate and independent
244     //works, which are not by their nature extensions of the covered work,
245     //and which are not combined with it such as to form a larger program,
246     //in or on a volume of a storage or distribution medium, is called an
247     //"aggregate" if the compilation and its resulting copyright are not
248     //used to limit the access or legal rights of the compilation's users
249     //beyond what the individual works permit. Inclusion of a covered work
250     //in an aggregate does not cause this License to apply to the other
251     //parts of the aggregate.
252     //
253     // 6. Conveying Non-Source Forms.
254     //
255     // You may convey a covered work in object code form under the terms
256     //of sections 4 and 5, provided that you also convey the
257     //machine-readable Corresponding Source under the terms of this License,
258     //in one of these ways:
259     //
260     // a) Convey the object code in, or embodied in, a physical product
261     // (including a physical distribution medium), accompanied by the
262     // Corresponding Source fixed on a durable physical medium
263     // customarily used for software interchange.
264     //
265     // b) Convey the object code in, or embodied in, a physical product
266     // (including a physical distribution medium), accompanied by a
267     // written offer, valid for at least three years and valid for as
268     // long as you offer spare parts or customer support for that product
269     // model, to give anyone who possesses the object code either (1) a
270     // copy of the Corresponding Source for all the software in the
271     // product that is covered by this License, on a durable physical
272     // medium customarily used for software interchange, for a price no
273     // more than your reasonable cost of physically performing this
274     // conveying of source, or (2) access to copy the
275     // Corresponding Source from a network server at no charge.
276     //
277     // c) Convey individual copies of the object code with a copy of the
278     // written offer to provide the Corresponding Source. This
279     // alternative is allowed only occasionally and noncommercially, and
280     // only if you received the object code with such an offer, in accord
281     // with subsection 6b.
282     //
283     // d) Convey the object code by offering access from a designated
284     // place (gratis or for a charge), and offer equivalent access to the
285     // Corresponding Source in the same way through the same place at no
286     // further charge. You need not require recipients to copy the
287     // Corresponding Source along with the object code. If the place to
288     // copy the object code is a network server, the Corresponding Source
289     // may be on a different server (operated by you or a third party)
290     // that supports equivalent copying facilities, provided you maintain
291     // clear directions next to the object code saying where to find the
292     // Corresponding Source. Regardless of what server hosts the
293     // Corresponding Source, you remain obligated to ensure that it is
294     // available for as long as needed to satisfy these requirements.
295     //
296     // e) Convey the object code using peer-to-peer transmission, provided
297     // you inform other peers where the object code and Corresponding
298     // Source of the work are being offered to the general public at no
299     // charge under subsection 6d.
300     //
301     // A separable portion of the object code, whose source code is excluded
302     //from the Corresponding Source as a System Library, need not be
303     //included in conveying the object code work.
304     //
305     // A "User Product" is either (1) a "consumer product", which means any
306     //tangible personal property which is normally used for personal, family,
307     //or household purposes, or (2) anything designed or sold for incorporation
308     //into a dwelling. In determining whether a product is a consumer product,
309     //doubtful cases shall be resolved in favor of coverage. For a particular
310     //product received by a particular user, "normally used" refers to a
311     //typical or common use of that class of product, regardless of the status
312     //of the particular user or of the way in which the particular user
313     //actually uses, or expects or is expected to use, the product. A product
314     //is a consumer product regardless of whether the product has substantial
315     //commercial, industrial or non-consumer uses, unless such uses represent
316     //the only significant mode of use of the product.
317     //
318     // "Installation Information" for a User Product means any methods,
319     //procedures, authorization keys, or other information required to install
320     //and execute modified versions of a covered work in that User Product from
321     //a modified version of its Corresponding Source. The information must
322     //suffice to ensure that the continued functioning of the modified object
323     //code is in no case prevented or interfered with solely because
324     //modification has been made.
325     //
326     // If you convey an object code work under this section in, or with, or
327     //specifically for use in, a User Product, and the conveying occurs as
328     //part of a transaction in which the right of possession and use of the
329     //User Product is transferred to the recipient in perpetuity or for a
330     //fixed term (regardless of how the transaction is characterized), the
331     //Corresponding Source conveyed under this section must be accompanied
332     //by the Installation Information. But this requirement does not apply
333     //if neither you nor any third party retains the ability to install
334     //modified object code on the User Product (for example, the work has
335     //been installed in ROM).
336     //
337     // The requirement to provide Installation Information does not include a
338     //requirement to continue to provide support service, warranty, or updates
339     //for a work that has been modified or installed by the recipient, or for
340     //the User Product in which it has been modified or installed. Access to a
341     //network may be denied when the modification itself materially and
342     //adversely affects the operation of the network or violates the rules and
343     //protocols for communication across the network.
344     //
345     // Corresponding Source conveyed, and Installation Information provided,
346     //in accord with this section must be in a format that is publicly
347     //documented (and with an implementation available to the public in
348     //source code form), and must require no special password or key for
349     //unpacking, reading or copying.
350     //
351     // 7. Additional Terms.
352     //
353     // "Additional permissions" are terms that supplement the terms of this
354     //License by making exceptions from one or more of its conditions.
355     //Additional permissions that are applicable to the entire Program shall
356     //be treated as though they were included in this License, to the extent
357     //that they are valid under applicable law. If additional permissions
358     //apply only to part of the Program, that part may be used separately
359     //under those permissions, but the entire Program remains governed by
360     //this License without regard to the additional permissions.
361     //
362     // When you convey a copy of a covered work, you may at your option
363     //remove any additional permissions from that copy, or from any part of
364     //it. (Additional permissions may be written to require their own
365     //removal in certain cases when you modify the work.) You may place
366     //additional permissions on material, added by you to a covered work,
367     //for which you have or can give appropriate copyright permission.
368     //
369     // Notwithstanding any other provision of this License, for material you
370     //add to a covered work, you may (if authorized by the copyright holders of
371     //that material) supplement the terms of this License with terms:
372     //
373     // a) Disclaiming warranty or limiting liability differently from the
374     // terms of sections 15 and 16 of this License; or
375     //
376     // b) Requiring preservation of specified reasonable legal notices or
377     // author attributions in that material or in the Appropriate Legal
378     // Notices displayed by works containing it; or
379     //
380     // c) Prohibiting misrepresentation of the origin of that material, or
381     // requiring that modified versions of such material be marked in
382     // reasonable ways as different from the original version; or
383     //
384     // d) Limiting the use for publicity purposes of names of licensors or
385     // authors of the material; or
386     //
387     // e) Declining to grant rights under trademark law for use of some
388     // trade names, trademarks, or service marks; or
389     //
390     // f) Requiring indemnification of licensors and authors of that
391     // material by anyone who conveys the material (or modified versions of
392     // it) with contractual assumptions of liability to the recipient, for
393     // any liability that these contractual assumptions directly impose on
394     // those licensors and authors.
395     //
396     // All other non-permissive additional terms are considered "further
397     //restrictions" within the meaning of section 10. If the Program as you
398     //received it, or any part of it, contains a notice stating that it is
399     //governed by this License along with a term that is a further
400     //restriction, you may remove that term. If a license document contains
401     //a further restriction but permits relicensing or conveying under this
402     //License, you may add to a covered work material governed by the terms
403     //of that license document, provided that the further restriction does
404     //not survive such relicensing or conveying.
405     //
406     // If you add terms to a covered work in accord with this section, you
407     //must place, in the relevant source files, a statement of the
408     //additional terms that apply to those files, or a notice indicating
409     //where to find the applicable terms.
410     //
411     // Additional terms, permissive or non-permissive, may be stated in the
412     //form of a separately written license, or stated as exceptions;
413     //the above requirements apply either way.
414     //
415     // 8. Termination.
416     //
417     // You may not propagate or modify a covered work except as expressly
418     //provided under this License. Any attempt otherwise to propagate or
419     //modify it is void, and will automatically terminate your rights under
420     //this License (including any patent licenses granted under the third
421     //paragraph of section 11).
422     //
423     // However, if you cease all violation of this License, then your
424     //license from a particular copyright holder is reinstated (a)
425     //provisionally, unless and until the copyright holder explicitly and
426     //finally terminates your license, and (b) permanently, if the copyright
427     //holder fails to notify you of the violation by some reasonable means
428     //prior to 60 days after the cessation.
429     //
430     // Moreover, your license from a particular copyright holder is
431     //reinstated permanently if the copyright holder notifies you of the
432     //violation by some reasonable means, this is the first time you have
433     //received notice of violation of this License (for any work) from that
434     //copyright holder, and you cure the violation prior to 30 days after
435     //your receipt of the notice.
436     //
437     // Termination of your rights under this section does not terminate the
438     //licenses of parties who have received copies or rights from you under
439     //this License. If your rights have been terminated and not permanently
440     //reinstated, you do not qualify to receive new licenses for the same
441     //material under section 10.
442     //
443     // 9. Acceptance Not Required for Having Copies.
444     //
445     // You are not required to accept this License in order to receive or
446     //run a copy of the Program. Ancillary propagation of a covered work
447     //occurring solely as a consequence of using peer-to-peer transmission
448     //to receive a copy likewise does not require acceptance. However,
449     //nothing other than this License grants you permission to propagate or
450     //modify any covered work. These actions infringe copyright if you do
451     //not accept this License. Therefore, by modifying or propagating a
452     //covered work, you indicate your acceptance of this License to do so.
453     //
454     // 10. Automatic Licensing of Downstream Recipients.
455     //
456     // Each time you convey a covered work, the recipient automatically
457     //receives a license from the original licensors, to run, modify and
458     //propagate that work, subject to this License. You are not responsible
459     //for enforcing compliance by third parties with this License.
460     //
461     // An "entity transaction" is a transaction transferring control of an
462     //organization, or substantially all assets of one, or subdividing an
463     //organization, or merging organizations. If propagation of a covered
464     //work results from an entity transaction, each party to that
465     //transaction who receives a copy of the work also receives whatever
466     //licenses to the work the party's predecessor in interest had or could
467     //give under the previous paragraph, plus a right to possession of the
468     //Corresponding Source of the work from the predecessor in interest, if
469     //the predecessor has it or can get it with reasonable efforts.
470     //
471     // You may not impose any further restrictions on the exercise of the
472     //rights granted or affirmed under this License. For example, you may
473     //not impose a license fee, royalty, or other charge for exercise of
474     //rights granted under this License, and you may not initiate litigation
475     //(including a cross-claim or counterclaim in a lawsuit) alleging that
476     //any patent claim is infringed by making, using, selling, offering for
477     //sale, or importing the Program or any portion of it.
478     //
479     // 11. Patents.
480     //
481     // A "contributor" is a copyright holder who authorizes use under this
482     //License of the Program or a work on which the Program is based. The
483     //work thus licensed is called the contributor's "contributor version".
484     //
485     // A contributor's "essential patent claims" are all patent claims
486     //owned or controlled by the contributor, whether already acquired or
487     //hereafter acquired, that would be infringed by some manner, permitted
488     //by this License, of making, using, or selling its contributor version,
489     //but do not include claims that would be infringed only as a
490     //consequence of further modification of the contributor version. For
491     //purposes of this definition, "control" includes the right to grant
492     //patent sublicenses in a manner consistent with the requirements of
493     //this License.
494     //
495     // Each contributor grants you a non-exclusive, worldwide, royalty-free
496     //patent license under the contributor's essential patent claims, to
497     //make, use, sell, offer for sale, import and otherwise run, modify and
498     //propagate the contents of its contributor version.
499     //
500     // In the following three paragraphs, a "patent license" is any express
501     //agreement or commitment, however denominated, not to enforce a patent
502     //(such as an express permission to practice a patent or covenant not to
503     //sue for patent infringement). To "grant" such a patent license to a
504     //party means to make such an agreement or commitment not to enforce a
505     //patent against the party.
506     //
507     // If you convey a covered work, knowingly relying on a patent license,
508     //and the Corresponding Source of the work is not available for anyone
509     //to copy, free of charge and under the terms of this License, through a
510     //publicly available network server or other readily accessible means,
511     //then you must either (1) cause the Corresponding Source to be so
512     //available, or (2) arrange to deprive yourself of the benefit of the
513     //patent license for this particular work, or (3) arrange, in a manner
514     //consistent with the requirements of this License, to extend the patent
515     //license to downstream recipients. "Knowingly relying" means you have
516     //actual knowledge that, but for the patent license, your conveying the
517     //covered work in a country, or your recipient's use of the covered work
518     //in a country, would infringe one or more identifiable patents in that
519     //country that you have reason to believe are valid.
520     //
521     // If, pursuant to or in connection with a single transaction or
522     //arrangement, you convey, or propagate by procuring conveyance of, a
523     //covered work, and grant a patent license to some of the parties
524     //receiving the covered work authorizing them to use, propagate, modify
525     //or convey a specific copy of the covered work, then the patent license
526     //you grant is automatically extended to all recipients of the covered
527     //work and works based on it.
528     //
529     // A patent license is "discriminatory" if it does not include within
530     //the scope of its coverage, prohibits the exercise of, or is
531     //conditioned on the non-exercise of one or more of the rights that are
532     //specifically granted under this License. You may not convey a covered
533     //work if you are a party to an arrangement with a third party that is
534     //in the business of distributing software, under which you make payment
535     //to the third party based on the extent of your activity of conveying
536     //the work, and under which the third party grants, to any of the
537     //parties who would receive the covered work from you, a discriminatory
538     //patent license (a) in connection with copies of the covered work
539     //conveyed by you (or copies made from those copies), or (b) primarily
540     //for and in connection with specific products or compilations that
541     //contain the covered work, unless you entered into that arrangement,
542     //or that patent license was granted, prior to 28 March 2007.
543     //
544     // Nothing in this License shall be construed as excluding or limiting
545     //any implied license or other defenses to infringement that may
546     //otherwise be available to you under applicable patent law.
547     //
548     // 12. No Surrender of Others' Freedom.
549     //
550     // If conditions are imposed on you (whether by court order, agreement or
551     //otherwise) that contradict the conditions of this License, they do not
552     //excuse you from the conditions of this License. If you cannot convey a
553     //covered work so as to satisfy simultaneously your obligations under this
554     //License and any other pertinent obligations, then as a consequence you may
555     //not convey it at all. For example, if you agree to terms that obligate you
556     //to collect a royalty for further conveying from those to whom you convey
557     //the Program, the only way you could satisfy both those terms and this
558     //License would be to refrain entirely from conveying the Program.
559     //
560     // 13. Use with the GNU Affero General Public License.
561     //
562     // Notwithstanding any other provision of this License, you have
563     //permission to link or combine any covered work with a work licensed
564     //under version 3 of the GNU Affero General Public License into a single
565     //combined work, and to convey the resulting work. The terms of this
566     //License will continue to apply to the part which is the covered work,
567     //but the special requirements of the GNU Affero General Public License,
568     //section 13, concerning interaction through a network will apply to the
569     //combination as such.
570     //
571     // 14. Revised Versions of this License.
572     //
573     // The Free Software Foundation may publish revised and/or new versions of
574     //the GNU General Public License from time to time. Such new versions will
575     //be similar in spirit to the present version, but may differ in detail to
576     //address new problems or concerns.
577     //
578     // Each version is given a distinguishing version number. If the
579     //Program specifies that a certain numbered version of the GNU General
580     //Public License "or any later version" applies to it, you have the
581     //option of following the terms and conditions either of that numbered
582     //version or of any later version published by the Free Software
583     //Foundation. If the Program does not specify a version number of the
584     //GNU General Public License, you may choose any version ever published
585     //by the Free Software Foundation.
586     //
587     // If the Program specifies that a proxy can decide which future
588     //versions of the GNU General Public License can be used, that proxy's
589     //public statement of acceptance of a version permanently authorizes you
590     //to choose that version for the Program.
591     //
592     // Later license versions may give you additional or different
593     //permissions. However, no additional obligations are imposed on any
594     //author or copyright holder as a result of your choosing to follow a
595     //later version.
596     //
597     // 15. Disclaimer of Warranty.
598     //
599     // THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
600     //APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
601     //HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
602     //OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
603     //THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
604     //PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
605     //IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
606     //ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
607     //
608     // 16. Limitation of Liability.
609     //
610     // IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
611     //WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
612     //THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
613     //GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
614     //USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
615     //DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
616     //PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
617     //EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
618     //SUCH DAMAGES.
619     //
620     // 17. Interpretation of Sections 15 and 16.
621     //
622     // If the disclaimer of warranty and limitation of liability provided
623     //above cannot be given local legal effect according to their terms,
624     //reviewing courts shall apply local law that most closely approximates
625     //an absolute waiver of all civil liability in connection with the
626     //Program, unless a warranty or assumption of liability accompanies a
627     //copy of the Program in return for a fee.
628     //
629     // END OF TERMS AND CONDITIONS
630     //
631     // How to Apply These Terms to Your New Programs
632     //
633     // If you develop a new program, and you want it to be of the greatest
634     //possible use to the public, the best way to achieve this is to make it
635     //free software which everyone can redistribute and change under these terms.
636     //
637     // To do so, attach the following notices to the program. It is safest
638     //to attach them to the start of each source file to most effectively
639     //state the exclusion of warranty; and each file should have at least
640     //the "copyright" line and a pointer to where the full notice is found.
641     //
642     // <one line to give the program's name and a brief idea of what it does.>
643     // Copyright (C) <year> <name of author>
644     //
645     // This program is free software: you can redistribute it and/or modify
646     // it under the terms of the GNU General Public License as published by
647     // the Free Software Foundation, either version 3 of the License, or
648     // (at your option) any later version.
649     //
650     // This program is distributed in the hope that it will be useful,
651     // but WITHOUT ANY WARRANTY; without even the implied warranty of
652     // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
653     // GNU General Public License for more details.
654     //
655     // You should have received a copy of the GNU General Public License
656     // along with this program. If not, see <http://www.gnu.org/licenses/>.
657     //
658     //Also add information on how to contact you by electronic and paper mail.
659     //
660     // If the program does terminal interaction, make it output a short
661     //notice like this when it starts in an interactive mode:
662     //
663     // <program> Copyright (C) <year> <name of author>
664     // This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
665     // This is free software, and you are welcome to redistribute it
666     // under certain conditions; type `show c' for details.
667     //
668     //The hypothetical commands `show w' and `show c' should show the appropriate
669     //parts of the General Public License. Of course, your program's commands
670     //might be different; for a GUI interface, you would use an "about box".
671     //
672     // You should also get your employer (if you work as a programmer) or school,
673     //if any, to sign a "copyright disclaimer" for the program, if necessary.
674     //For more information on this, and how to apply and follow the GNU GPL, see
675     //<http://www.gnu.org/licenses/>.
676     //
677     // The GNU General Public License does not permit incorporating your program
678     //into proprietary programs. If your program is a subroutine library, you
679     //may consider it more useful to permit linking proprietary applications with
680     //the library. If this is what you want to do, use the GNU Lesser General
681     //Public License instead of this License. But first, please read
682     //<http://www.gnu.org/philosophy/why-not-lgpl.html>.
683     //-------------------------------------------------------------------------------------------------
684     //--------------------------------------------------------------------------------
685     #define MODULE_BSTRFUNC
686    
687     #include <assert.h>
688     #include <malloc.h>
689     #include <process.h>
690     #include <stddef.h>
691     #include <string.h>
692    
693    
694     #if defined(APP_TYPE_SIMPLE_DOS_CONSOLE)
695     #include "ccmalloc.h"
696     #elif defined(APP_TYPE_IJUSCRIPTER_IJUCONSOLE)
697     #include "tclalloc.h"
698     #else
699     /* Do nothing. */
700     #endif
701    
702     #include "bstrfunc.h"
703     #include "ccmalloc.h"
704     #include "charfunc.h"
705    
706    
707     /******************************************************************/
708     /*** CUSTOM ALLOCATION FUNCTIONS *******************************/
709     /******************************************************************/
710     //We need wrappers because this software module will be used in
711     //more than one kind of software. This could also be done with
712     //macros, but I like function wrappers better because there
713     //is less ambiguity and more ability to collect information if
714     //something goes wrong.
715     //
716     //07/24/01: Visual inspection only. Function deemed too
717     //simple for unit testing.
718     void *BSTRFUNC_malloc( size_t size )
719     {
720     #if defined(APP_TYPE_SIMPLE_DOS_CONSOLE)
721     return(CCMALLOC_malloc(size));
722     #elif defined(APP_TYPE_IJUSCRIPTER_IJUCONSOLE)
723     return(TclpAlloc(size));
724     #else
725     return(malloc(size));
726     #endif
727     }
728    
729    
730     //07/24/01: Visual inspection only. Function deemed too
731     //simple for unit testing.
732     void *BSTRFUNC_calloc( size_t num, size_t size )
733     {
734     #if defined(APP_TYPE_SIMPLE_DOS_CONSOLE)
735     return(CCMALLOC_calloc(num, size));
736     #elif defined(APP_TYPE_IJUSCRIPTER_IJUCONSOLE)
737     return(TclpCalloc(num, size));
738     #else
739     return(calloc(num, size));
740     #endif
741     }
742    
743    
744     //07/24/01: Visual inspection only. Function deemed too
745     //simple for unit testing.
746     void *BSTRFUNC_realloc( void *memblock, size_t size )
747     {
748     #if defined(APP_TYPE_SIMPLE_DOS_CONSOLE)
749     return(CCMALLOC_realloc(memblock, size));
750     #elif defined(APP_TYPE_IJUSCRIPTER_IJUCONSOLE)
751     return(TclpRealloc(memblock, size));
752     #else
753     return(realloc(memblock, size));
754     #endif
755     }
756    
757    
758     //07/24/01: Visual inspection only. Function deemed too
759     //simple for unit testing.
760     void BSTRFUNC_free( void *memblock )
761     {
762     #if defined(APP_TYPE_SIMPLE_DOS_CONSOLE)
763     CCMALLOC_free(memblock);
764     #elif defined(APP_TYPE_IJUSCRIPTER_IJUCONSOLE)
765     TclpFree(memblock);
766     #else
767     free(memblock);
768     #endif
769     }
770    
771    
772     //07/18/01: Visual inspection and unit tests passed.
773     int BSTRFUNC_is_uint_wo_commas(const char *arg)
774     {
775     assert(arg != NULL);
776    
777     if (!*arg)
778     return(0);
779    
780     if (arg[0] == '0')
781     {
782     if (arg[1])
783     {
784     return(0);
785     }
786     else
787     {
788     return(1);
789     }
790     }
791     else
792     {
793     while (*arg)
794     {
795     if ((*arg < '0') || (*arg > '9'))
796     return(0);
797     arg++;
798     }
799    
800     return(1);
801     }
802     }
803    
804    
805     //07/28/01: Visual inspection only.
806     int BSTRFUNC_is_sint_wo_commas(const char *arg)
807     {
808     //This function will use its unsigned counterpart.
809     //
810     //Eyeball the input parameter.
811     assert(arg != NULL);
812    
813     if (!*arg) //Empty string ain't an integer.
814     return(0);
815    
816     if (*arg == '-')
817     {
818     if (arg[1] == '0')
819     return(0);
820     else
821     return(BSTRFUNC_is_uint_wo_commas(arg+1));
822     }
823     else
824     {
825     return(BSTRFUNC_is_uint_wo_commas(arg));
826     }
827     }
828    
829    
830     //07/18/01: Visual inspection and unit tests passed.
831     int BSTRFUNC_is_uint_w_commas(const char *arg)
832     {
833     int state;
834    
835     //Input pointer cannot be NULL.
836     assert(arg != NULL);
837    
838     //Can't be empty string.
839     if (!*arg)
840     return(0);
841    
842     //If the first digit is 0, that must be the only digit.
843     if (arg[0] == '0')
844     {
845     if (arg[1])
846     {
847     return(0);
848     }
849     else
850     {
851     return(1);
852     }
853     }
854    
855     //The remainder of this function is an efficient state
856     //machine recognizer. The state machine involved is
857     //pretty simple and was drawn and discarded on a sheet
858     //of paper. It doesn't need to be filed because it is
859     //so basic.
860     if ((*arg < '0') || (*arg > '9'))
861     return(0);
862    
863     state = 0;
864     arg++;
865    
866     while(1)
867     {
868     switch (state)
869     {
870     case 0 : if (!*arg)
871     {
872     return(1);
873     }
874     else if (*arg == ',')
875     {
876     state = 3;
877     }
878     else if ((*arg >= '0') && (*arg <= '9'))
879     {
880     state = 1;
881     }
882     else
883     {
884     return(0);
885     }
886     break;
887     case 1 : if (!*arg)
888     {
889     return(1);
890     }
891     else if (*arg == ',')
892     {
893     state = 3;
894     }
895     else if ((*arg >= '0') && (*arg <= '9'))
896     {
897     state = 2;
898     }
899     else
900     {
901     return(0);
902     }
903     break;
904     case 2 : if (!*arg)
905     {
906     return(1);
907     }
908     else if (*arg == ',')
909     {
910     state = 3;
911     }
912     else if ((*arg >= '0') && (*arg <= '9'))
913     {
914     return(0);
915     }
916     else
917     {
918     return(0);
919     }
920     break;
921     case 3 : if (!*arg)
922     {
923     return(0);
924     }
925     else if (*arg == ',')
926     {
927     return(0);
928     }
929     else if ((*arg >= '0') && (*arg <= '9'))
930     {
931     state = 4;
932     }
933     else
934     {
935     return(0);
936     }
937     break;
938     case 4 : if (!*arg)
939     {
940     return(0);
941     }
942     else if (*arg == ',')
943     {
944     return(0);
945     }
946     else if ((*arg >= '0') && (*arg <= '9'))
947     {
948     state = 5;
949     }
950     else
951     {
952     return(0);
953     }
954     break;
955     case 5 : if (!*arg)
956     {
957     return(0);
958     }
959     else if (*arg == ',')
960     {
961     return(0);
962     }
963     else if ((*arg >= '0') && (*arg <= '9'))
964     {
965     state = 6;
966     }
967     else
968     {
969     return(0);
970     }
971     break;
972     case 6 : if (!*arg)
973     {
974     return(1);
975     }
976     else if (*arg == ',')
977     {
978     state = 3;
979     }
980     else if ((*arg >= '0') && (*arg <= '9'))
981     {
982     return(0);
983     }
984     else
985     {
986     return(0);
987     }
988     break;
989     default:
990     abort();
991     break;
992     }
993    
994     arg++;
995     }
996    
997     //We should never get here.
998     }
999    
1000    
1001     //07/28/01: Visual inspection only.
1002     int BSTRFUNC_is_sint_w_commas(const char *arg)
1003     {
1004     //This function will use its unsigned counterpart.
1005     //
1006     //Eyeball the input parameter.
1007     assert(arg != NULL);
1008    
1009     if (!*arg) //Empty string ain't an integer.
1010     return(0);
1011    
1012     if (*arg == '-')
1013     {
1014     if (arg[1] == '0')
1015     return(0);
1016     else
1017     return(BSTRFUNC_is_uint_w_commas(arg+1));
1018     }
1019     else
1020     {
1021     return(BSTRFUNC_is_uint_w_commas(arg));
1022     }
1023     }
1024    
1025    
1026     //07/18/01: Visual verification only due to simplicity.
1027     void BSTRFUNC_str_reverse(char *s)
1028     {
1029     int l, begin, end;
1030     char temp;
1031    
1032     assert(s != NULL);
1033    
1034     l = strlen(s);
1035    
1036     begin = 0;
1037     end = l-1;
1038    
1039     while ((end-begin) >=1)
1040     {
1041     temp = s[begin];
1042     s[begin] = s[end];
1043     s[end] = temp;
1044     begin++;
1045     end--;
1046     }
1047     }
1048    
1049    
1050     void BSTRFUNC_parse_gen_sci_not_num(const char *s,
1051     int *failure,
1052     char *mant_sign,
1053     size_t *mant_bdp,
1054     size_t *mant_bdp_len,
1055     size_t *mant_adp,
1056     size_t *mant_adp_len,
1057     char *exp_sign,
1058     size_t *exp,
1059     size_t *exp_len)
1060     {
1061     //For the parameters that can be NULL, these are the
1062     //local copies we keep. We will assign these back to
1063     //the caller's area when appropriate before we leave.
1064     char i_mant_sign, i_exp_sign;
1065     size_t i_mant_bdp, i_mant_bdp_len, i_mant_adp, i_mant_adp_len,
1066     i_exp, i_exp_len;
1067     size_t i;
1068     int state;
1069     const char *arg;
1070    
1071     //Check out the parameters that can't be NULL.
1072     assert(s != NULL);
1073     assert(failure != NULL);
1074    
1075     //Initialize all variables to defaults.
1076     *failure = 0 ;
1077     i_mant_sign = 'N';
1078     i_exp_sign = 'N';
1079     i_mant_bdp = 0 ;
1080     i_mant_bdp_len = 0 ;
1081     i_mant_adp = 0 ;
1082     i_mant_adp_len = 0 ;
1083     i_exp = 0 ;
1084     i_exp_len = 0 ;
1085     i = 0 ;
1086     state = 0 ;
1087    
1088     //Process the string. This is a big 10-state state
1089     //machine. Because of the complexity, I've included
1090     //some state definitions as well in the comments.
1091     arg = s;
1092    
1093     while(1)
1094     {
1095     switch (state)
1096     {
1097     //Initial state from which we start processing.
1098     case 0 : if (!*arg)
1099     {
1100     //The string is empty. This is not OK.
1101     //Error out.
1102     *failure = 1;
1103     goto term_seq;
1104     }
1105     else if (*arg == '-')
1106     {
1107     //Leading - on the number. Fine.
1108     i_mant_sign = '-';
1109     state = 1;
1110     }
1111     else if (*arg == '+')
1112     {
1113     //Leading + on the number. Fine.
1114     i_mant_sign = '+';
1115     state = 2;
1116     }
1117     else if (*arg == '.')
1118     {
1119     //Leading . on the number. Fine.
1120     state = 5;
1121     }
1122     else if (*arg == '0')
1123     {
1124     i_mant_bdp = arg - s;
1125     state = 4;
1126     }
1127     else if ((*arg >= '1') && (*arg <= '9'))
1128     {
1129     i_mant_bdp = arg - s;
1130     state = 3;
1131     }
1132     else
1133     {
1134     //Unidentifiable crap. This is not OK.
1135     //Error out.
1136     *failure = 1;
1137     goto term_seq;
1138     }
1139     break;
1140     //The leading character of the string was '-'. We
1141     //are processing a negative number.
1142     case 1 : if (!*arg)
1143     {
1144     //The string is empty. This is not OK because
1145     //it means the string was "-".
1146     //Error out.
1147     *failure = 1;
1148     goto term_seq;
1149     }
1150     else if (*arg == '.')
1151     {
1152     //We have a - followed by a decimal point.
1153     //This is impolite form, but will accept
1154     //it as a number.
1155     state = 5;
1156     }
1157     else if (*arg == '0')
1158     {
1159     //We have a '-' followed by a '0'.
1160     //Seems reasonable.
1161     i_mant_bdp = arg - s;
1162     state = 4;
1163     }
1164     else if ((*arg >= '1') && (*arg <= '9'))
1165     {
1166     //We have a '-' followed by a non-zero
1167     //digit. Seems reasonable.
1168     i_mant_bdp = arg - s;
1169     state = 3;
1170     }
1171     else
1172     {
1173     //Unidentifiable crap. This is not OK.
1174     //Error out.
1175     *failure = 1;
1176     goto term_seq;
1177     }
1178     break;
1179     //The leading character of the string was '+'. We
1180     //are processing an explicitly declared positive number.
1181     case 2 : if (!*arg)
1182     {
1183     //The string is empty. This is not OK because
1184     //it means the string was "+".
1185     //Error out.
1186     *failure = 1;
1187     goto term_seq;
1188     }
1189     else if (*arg == '.')
1190     {
1191     //We have a + followed by a decimal point.
1192     //This is impolite form, but will accept
1193     //it as a number.
1194     state = 5;
1195     }
1196     else if (*arg == '0')
1197     {
1198     //We have a '-' followed by a '0'.
1199     //Seems reasonable.
1200     i_mant_bdp = arg - s;
1201     state = 4;
1202     }
1203     else if ((*arg >= '1') && (*arg <= '9'))
1204     {
1205     //We have a '+' followed by a non-zero
1206     //digit. Seems reasonable.
1207     i_mant_bdp = arg - s;
1208     state = 3;
1209     }
1210     else
1211     {
1212     //Unidentifiable crap. This is not OK.
1213     //Error out.
1214     *failure = 1;
1215     goto term_seq;
1216     }
1217     break;
1218     //We've encountered a non-zero digit either first as part
1219     //of the string or later after + or -. We are processing
1220     //a mantissa that does not begin with "0".
1221     case 3 : if (!*arg)
1222     {
1223     //We've reached the end of the string. This is
1224     //fine because we have a simple integer of the
1225     //form NNNN, +NNNN, or -NNNN. No problem with that.
1226     i_mant_bdp_len = (arg - s) - i_mant_bdp;
1227     *failure = 0;
1228     goto term_seq;
1229     }
1230     else if (*arg == '.')
1231     {
1232     //Number followed by decimal point. This
1233     //means the mantissa is terminating. No issue.
1234     i_mant_bdp_len = (arg - s) - i_mant_bdp;
1235     state = 5;
1236     }
1237     else if ((*arg >= '0') && (*arg <= '9'))
1238     {
1239     //Yet more digits. Seems reasonable.
1240     //The assignment isn't necessary, but it
1241     //is aesthetic.
1242     state = 3;
1243     }
1244     else if ((*arg == 'e') || (*arg == 'E'))
1245     {
1246     //Beginning of an exponent. This again
1247     //means the mantissa is terminating. No issue.
1248     i_mant_bdp_len = (arg - s) - i_mant_bdp;
1249     state = 6;
1250     }
1251     else
1252     {
1253     //Unidentifiable crap. This is not OK.
1254     //Error out.
1255     *failure = 1;
1256     goto term_seq;
1257     }
1258     break;
1259     //We're processing a mantissa that begins with zero. There
1260     //is only one zero allowed before the decimal point.
1261     case 4 : if (!*arg)
1262     {
1263     //We've reached the end of the string. This is
1264     //fine because it means we have zero. I'm going
1265     //to be unusually permissive and allow -0 and +0,
1266     //which isn't traditional.
1267     i_mant_bdp_len = (arg - s) - i_mant_bdp;
1268     *failure = 0;
1269     goto term_seq;
1270     }
1271     else if (*arg == '.')
1272     {
1273     //Zero followed by decimal point. This
1274     //means the mantissa is terminating. No issue.
1275     i_mant_bdp_len = (arg - s) - i_mant_bdp;
1276     state = 5;
1277     }
1278     else if ((*arg == 'e') || (*arg == 'E'))
1279     {
1280     //Beginning of an exponent. This again
1281     //means the mantissa is terminating. No issue.
1282     i_mant_bdp_len = (arg - s) - i_mant_bdp;
1283     state = 6;
1284     }
1285     else
1286     {
1287     //Unidentifiable crap. This is not OK.
1288     //Error out.
1289     *failure = 1;
1290     goto term_seq;
1291     }
1292     break;
1293     //A decimal point has been found in the string.
1294     //This marks the end of the mantissa, for sure.
1295     case 5 : if (!*arg)
1296     {
1297     //We've reached the end of the string. There are
1298     //two possibilities here. Either there have been no
1299     //digits before the decimal points, which is a no-no,
1300     //or there have been digits, which is fine.
1301     if (i_mant_bdp_len)
1302     {
1303     *failure = 0;
1304     goto term_seq;
1305     }
1306     else
1307     {
1308     *failure = 1;
1309     goto term_seq;
1310     }
1311     }
1312     else if ((*arg >= '0') && (*arg <= '9'))
1313     {
1314     //Digits after the decimal point. Need to
1315     //begin the portion after the decimal point.
1316     i_mant_adp = arg - s;
1317     state = 10;
1318     }
1319     else if ((*arg == 'e') || (*arg == 'E'))
1320     {
1321     //Beginning of an exponent. This means
1322     //that have no digits after the decimal point.
1323     //This is OK.
1324     state = 6;
1325     }
1326     else
1327     {
1328     //Unidentifiable crap. This is not OK.
1329     //Error out.
1330     *failure = 1;
1331     goto term_seq;
1332     }
1333     break;
1334     //The exponent has begin.
1335     case 6: if (!*arg)
1336     {
1337     //The string is empty. This is not OK
1338     //because it would mean an E with nothing
1339     //following it. This is a no-no.
1340     //Error out.
1341     *failure = 1;
1342     goto term_seq;
1343     }
1344     else if (*arg == '-')
1345     {
1346     //Leading - on the exponent. Fine.
1347     i_exp_sign = '-';
1348     state = 8;
1349     }
1350     else if (*arg == '+')
1351     {
1352     //Leading + on the exponent. Fine.
1353     i_exp_sign = '+';
1354     state = 7;
1355     }
1356     else if ((*arg >= '0') && (*arg <= '9'))
1357     {
1358     //Beginning the digits of the exponent. Fine.
1359     i_exp = arg - s;
1360     state = 9;
1361     }
1362     else
1363     {
1364     //Unidentifiable crap. This is not OK.
1365     //Error out.
1366     *failure = 1;
1367     goto term_seq;
1368     }
1369     break;
1370    
1371     //Had a + sign before the exponent. Now expecting digits.
1372     case 7: if (!*arg)
1373     {
1374     //The string is empty. This is not OK
1375     //because it would mean an E+ with nothing
1376     //following it. This is a no-no.
1377     //Error out.
1378     *failure = 1;
1379     goto term_seq;
1380     }
1381     else if ((*arg >= '0') && (*arg <= '9'))
1382     {
1383     //Beginning the digits of the exponent. Fine.
1384     i_exp = arg - s;
1385     state = 9;
1386     }
1387     else
1388     {
1389     //Unidentifiable crap. This is not OK.
1390     //Error out.
1391     *failure = 1;
1392     goto term_seq;
1393     }
1394     break;
1395     //Had a - sign before the exponent. Now expecting digits.
1396     case 8: if (!*arg)
1397     {
1398     //The string is empty. This is not OK
1399     //because it would mean an E- with nothing
1400     //following it. This is a no-no.
1401     //Error out.
1402     *failure = 1;
1403     goto term_seq;
1404     }
1405     else if ((*arg >= '0') && (*arg <= '9'))
1406     {
1407     //Beginning the digits of the exponent. Fine.
1408     i_exp = arg - s;
1409     state = 9;
1410     }
1411     else
1412     {
1413     //Unidentifiable crap. This is not OK.
1414     //Error out.
1415     *failure = 1;
1416     goto term_seq;
1417     }
1418     break;
1419     //Had one digit of exponent. Am processing remaining ones.
1420     case 9 : if (!*arg)
1421     {
1422     //We've reached the end of the string. This is
1423     //fine because we have an exponent of the
1424     //form NNNN, +NNNN, or -NNNN. No problem with that.
1425     i_exp_len = (arg - s) - i_exp;
1426     *failure = 0;
1427     goto term_seq;
1428     }
1429     else if ((*arg >= '0') && (*arg <= '9'))
1430     {
1431     //Yet more digits. Seems reasonable.
1432     //The assignment isn't necessary, but it
1433     //is aesthetic.
1434     state = 9;
1435     }
1436     else
1437     {
1438     //Unidentifiable crap. This is not OK.
1439     //Error out.
1440     *failure = 1;
1441     goto term_seq;
1442     }
1443     break;
1444     //Processing digits after decimal point. This state is out
1445     //of sequence because added it after on diagram.
1446     case 10: if (!*arg)
1447     {
1448     //We've reached the end of the string. This is
1449     //fine.
1450     i_mant_adp_len = (arg - s) - i_mant_adp;
1451     *failure = 0;
1452     goto term_seq;
1453     }
1454     else if ((*arg >= '0') && (*arg <= '9'))
1455     {
1456     //Yet more digits. Seems reasonable.
1457     //The assignment isn't necessary, but it
1458     //is aesthetic.
1459     state = 10;
1460     }
1461     else if ((*arg == 'e') || (*arg == 'E'))
1462     {
1463     //Beginning of an exponent. This terminates
1464     //the digits after the decimal point.
1465     i_mant_adp_len = (arg - s) - i_mant_adp;
1466     state = 6;
1467     }
1468     else
1469     {
1470     //Unidentifiable crap. This is not OK.
1471     //Error out.
1472     *failure = 1;
1473     goto term_seq;
1474     }
1475     break;
1476     default:
1477     abort();
1478     break;
1479     }
1480    
1481     arg++;
1482     }
1483    
1484    
1485     //This is the setup for returning to the caller. We can
1486     //only fill in those data pointer for the caller that are
1487     //not NULL.
1488     term_seq:
1489     if (mant_sign)
1490     *mant_sign = i_mant_sign;
1491     if (mant_bdp)
1492     *mant_bdp = i_mant_bdp;
1493     if (mant_bdp_len)
1494     *mant_bdp_len = i_mant_bdp_len;
1495     if (mant_adp)
1496     *mant_adp = i_mant_adp;
1497     if (mant_adp_len)
1498     *mant_adp_len = i_mant_adp_len;
1499     if (exp_sign)
1500     *exp_sign = i_exp_sign;
1501     if (exp)
1502     *exp = i_exp;
1503     if (exp_len)
1504     *exp_len = i_exp_len;
1505     }
1506    
1507    
1508     //07/18/01: Has passed visual verification plus unit tests.
1509     void BSTRFUNC_commanate(char *s)
1510     {
1511     int l;
1512     int ncommas;
1513     char *putpt, *getpt;
1514     int ndigits;
1515    
1516     //Adds commas to a numeric string. The space
1517     //must exist in the area passed.
1518     assert(s);
1519    
1520     //If the leading character on the string is a
1521     //'-', bump the pointer. Then everything
1522     //else applies as for an unsigned.
1523     if (*s == '-')
1524     s++;
1525    
1526     //Be sure the string currently meets the syntax for
1527     //a signed integer. If not, don't even touch it.
1528     if (!BSTRFUNC_is_uint_wo_commas(s))
1529     return;
1530    
1531     //Get the length of the current string.
1532     l = strlen(s);
1533    
1534     //Let's agree, just in case something slipped through
1535     //the cracks, that zero length strings are not of
1536     //interest to us.
1537     if (l==0)
1538     return;
1539    
1540     //The number of commas to add is precisely
1541     //(N-1) div 3.
1542     if (l==0)
1543     ncommas = 0;
1544     else
1545     ncommas = (l-1)/3;
1546    
1547     //Walk through the string, adding commas.
1548     getpt = s + l - 1;
1549     putpt = s + l + ncommas;
1550    
1551     *putpt = 0; //Write the zero terminator.
1552     putpt--;
1553    
1554     ndigits = 0;
1555    
1556     while ((putpt > s) && (getpt > s))
1557     {
1558     *putpt = *getpt;
1559     putpt--;
1560     getpt--;
1561     ndigits++;
1562     if (((ndigits % 3) == 0) && (putpt != s))
1563     {
1564     *putpt = ',';
1565     putpt--;
1566     }
1567     assert((putpt >= s) && (getpt>=s));
1568     }
1569     }
1570    
1571    
1572     //07/28/01: Visual inspection only.
1573     void BSTRFUNC_decommanate(char *s)
1574     {
1575     char *src, *dst;
1576    
1577     assert(s != NULL);
1578    
1579     src = dst = s;
1580    
1581     while(1)
1582     {
1583     if (!*src)
1584     {
1585     *dst = 0;
1586     break;
1587     }
1588     else if (*src == ',')
1589     {
1590     src++;
1591     }
1592     else
1593     {
1594     *dst = *src;
1595     src++;
1596     dst++;
1597     }
1598     }
1599     }
1600    
1601    
1602     void BSTRFUNC_parse_str_to_uint32(const char *s,
1603     unsigned int *rv,
1604     int *error)
1605     {
1606     unsigned _int64 temp;
1607     int digval;
1608    
1609     //Eyeball the input arguments.
1610     assert(s != NULL);
1611     assert(error != NULL);
1612    
1613     //Start off believing there is no error.
1614     *error = 0;
1615    
1616     //The string has to parse out as an unsigned integer or an
1617     //unsigned integer with commas, or we won't touch it.
1618     if (!BSTRFUNC_is_uint_wo_commas(s) && !BSTRFUNC_is_uint_w_commas(s))
1619     {
1620     *error = 1;
1621     return;
1622     }
1623    
1624     //OK, we know we have an unsigned integer, either without commas,
1625     //or with properly placed commas. Our only worry now is that it
1626     //is of a size that will fit in 32 bits. The way we can deal with
1627     //this is to format it into 64 bits and watch for overflow.
1628     temp = 0;
1629    
1630     while (*s)
1631     {
1632     digval = CHARFUNC_digit_to_val(*s);
1633     if (digval >= 0)
1634     {
1635     temp *= 10;
1636     temp += digval;
1637     if ((temp >> 32) & 0xFFFFFFFF)
1638     {
1639     //We've had an overflow.
1640     *error = 1;
1641     return;
1642     }
1643     }
1644     s++;
1645     }
1646    
1647     *rv = (unsigned int)temp;
1648     }
1649    
1650    
1651     const char *BSTRFUNC_cvcinfo(void)
1652     {
1653     return("$Header: /cvsroot/esrg/sfesrg/esrgpcpj/shared/c_datd/bstrfunc.c,v 1.6 2001/07/29 07:18:22 dtashley Exp $");
1654     }
1655    
1656    
1657     const char *BSTRFUNC_hvcinfo(void)
1658     {
1659     return(BSTRFUNC_H_VERSION);
1660     }
1661    
1662    
1663     //**************************************************************************
1664     // $Log: bstrfunc.c,v $
1665     // Revision 1.6 2001/07/29 07:18:22 dtashley
1666     // Completion of ARBINT INTFAC extension.
1667     //
1668     // Revision 1.5 2001/07/25 23:40:02 dtashley
1669     // Completion of INTFAC program, many changes to handling of large
1670     // integers.
1671     //
1672     // Revision 1.4 2001/07/23 06:12:49 dtashley
1673     // Completion of INTFAC command-line utility.
1674     //
1675     // Revision 1.3 2001/07/19 20:06:03 dtashley
1676     // Division finished. String formatting functions underway. Safety check-in.
1677     //
1678     // Revision 1.2 2001/07/13 21:02:20 dtashley
1679     // Version control reporting changes.
1680     //
1681     // Revision 1.1 2001/07/13 19:05:23 dtashley
1682     // Files added.
1683     //
1684     //**************************************************************************
1685     // End of BSTRFUNC.C.

dashley@gmail.com
ViewVC Help
Powered by ViewVC 1.1.25