version 1.1, 1999/12/03 07:39:08 |
version 1.6, 2018/03/29 01:32:52 |
|
|
/* $OpenXM: OpenXM/src/asir99/engine/str.c,v 1.1.1.1 1999/11/10 08:12:26 noro Exp $ */ |
/* |
|
* Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED |
|
* All rights reserved. |
|
* |
|
* FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited, |
|
* non-exclusive and royalty-free license to use, copy, modify and |
|
* redistribute, solely for non-commercial and non-profit purposes, the |
|
* computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and |
|
* conditions of this Agreement. For the avoidance of doubt, you acquire |
|
* only a limited right to use the SOFTWARE hereunder, and FLL or any |
|
* third party developer retains all rights, including but not limited to |
|
* copyrights, in and to the SOFTWARE. |
|
* |
|
* (1) FLL does not grant you a license in any way for commercial |
|
* purposes. You may use the SOFTWARE only for non-commercial and |
|
* non-profit purposes only, such as academic, research and internal |
|
* business use. |
|
* (2) The SOFTWARE is protected by the Copyright Law of Japan and |
|
* international copyright treaties. If you make copies of the SOFTWARE, |
|
* with or without modification, as permitted hereunder, you shall affix |
|
* to all such copies of the SOFTWARE the above copyright notice. |
|
* (3) An explicit reference to this SOFTWARE and its copyright owner |
|
* shall be made on your publication or presentation in any form of the |
|
* results obtained by use of the SOFTWARE. |
|
* (4) In the event that you modify the SOFTWARE, you shall notify FLL by |
|
* e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification |
|
* for such modification or the source code of the modified part of the |
|
* SOFTWARE. |
|
* |
|
* THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL |
|
* MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND |
|
* EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS |
|
* FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES' |
|
* RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY |
|
* MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY. |
|
* UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT, |
|
* OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY |
|
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL |
|
* DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES |
|
* ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES |
|
* FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY |
|
* DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF |
|
* SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART |
|
* OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY |
|
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
|
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
|
* |
|
* $OpenXM: OpenXM_contrib2/asir2000/engine/str.c,v 1.5 2004/02/26 07:06:32 noro Exp $ |
|
*/ |
#include "ca.h" |
#include "ca.h" |
|
|
void addstr(vl,a,b,c) |
void addstr(vl,a,b,c) |
|
|
STRING a,b; |
STRING a,b; |
STRING *c; |
STRING *c; |
{ |
{ |
char *buf; |
char *buf; |
|
|
buf = (char *)MALLOC(strlen(BDY(a))+strlen(BDY(b))+1); |
buf = (char *)MALLOC_ATOMIC(strlen(BDY(a))+strlen(BDY(b))+1); |
sprintf(buf,"%s%s",BDY(a),BDY(b)); |
sprintf(buf,"%s%s",BDY(a),BDY(b)); |
MKSTR(*c,buf); |
MKSTR(*c,buf); |
} |
} |
|
|
int compstr(vl,a,b) |
int compstr(vl,a,b) |
VL vl; |
VL vl; |
STRING a,b; |
STRING a,b; |
{ |
{ |
return a ? (b?strcmp(BDY(a),BDY(b)):1) : (b?-1:0); |
return a ? (b?strcmp(BDY(a),BDY(b)):1) : (b?-1:0); |
|
} |
|
|
|
/* primitive functions for BYTEARRAY */ |
|
|
|
int compbytearray(vl,a,b) |
|
VL vl; |
|
BYTEARRAY a,b; |
|
{ |
|
int i; |
|
|
|
if ( !a ) |
|
if ( b ) |
|
return -1; |
|
else |
|
return 0; |
|
else if ( !b ) |
|
return 1; |
|
else if ( a->len > b->len ) |
|
return 1; |
|
else if ( a->len < b->len ) |
|
return -1; |
|
else { |
|
for ( i = 0; i < a->len; i++ ) |
|
if ( a->body[i] > b->body[i] ) |
|
return 1; |
|
else if ( a->body[i] < b->body[i] ) |
|
return -1; |
|
return 0; |
|
} |
} |
} |