2008-06-30 11:50:36 -07:00
|
|
|
|
// Copyright 2009 The Go Authors. All rights reserved.
|
|
|
|
|
|
// Use of this source code is governed by a BSD-style
|
|
|
|
|
|
// license that can be found in the LICENSE file.
|
|
|
|
|
|
|
|
|
|
|
|
#include "runtime.h"
|
|
|
|
|
|
|
2009-04-09 18:16:21 -07:00
|
|
|
|
String emptystring;
|
2008-06-30 11:50:36 -07:00
|
|
|
|
|
|
|
|
|
|
int32
|
2008-11-23 17:08:55 -08:00
|
|
|
|
findnull(byte *s)
|
2008-06-30 11:50:36 -07:00
|
|
|
|
{
|
|
|
|
|
|
int32 l;
|
|
|
|
|
|
|
2009-02-02 18:59:20 -08:00
|
|
|
|
if(s == nil)
|
|
|
|
|
|
return 0;
|
2008-06-30 11:50:36 -07:00
|
|
|
|
for(l=0; s[l]!=0; l++)
|
|
|
|
|
|
;
|
|
|
|
|
|
return l;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2009-01-29 17:38:58 -08:00
|
|
|
|
int32 maxstring;
|
|
|
|
|
|
|
2009-04-09 18:16:21 -07:00
|
|
|
|
String
|
2009-01-29 17:38:58 -08:00
|
|
|
|
gostringsize(int32 l)
|
|
|
|
|
|
{
|
2009-04-09 18:16:21 -07:00
|
|
|
|
String s;
|
2009-01-29 17:38:58 -08:00
|
|
|
|
|
2009-04-09 18:16:21 -07:00
|
|
|
|
if(l == 0)
|
|
|
|
|
|
return emptystring;
|
|
|
|
|
|
s.str = mal(l);
|
|
|
|
|
|
s.len = l;
|
2009-01-29 17:38:58 -08:00
|
|
|
|
if(l > maxstring)
|
|
|
|
|
|
maxstring = l;
|
|
|
|
|
|
return s;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2009-04-09 18:16:21 -07:00
|
|
|
|
String
|
2008-11-23 17:08:55 -08:00
|
|
|
|
gostring(byte *str)
|
|
|
|
|
|
{
|
|
|
|
|
|
int32 l;
|
2009-04-09 18:16:21 -07:00
|
|
|
|
String s;
|
2008-11-23 17:08:55 -08:00
|
|
|
|
|
|
|
|
|
|
l = findnull(str);
|
2009-01-29 17:38:58 -08:00
|
|
|
|
s = gostringsize(l);
|
2009-04-09 18:16:21 -07:00
|
|
|
|
mcpy(s.str, str, l);
|
2008-11-23 17:08:55 -08:00
|
|
|
|
return s;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2008-06-30 11:50:36 -07:00
|
|
|
|
void
|
2009-04-09 18:16:21 -07:00
|
|
|
|
sys·catstring(String s1, String s2, String s3)
|
2008-06-30 11:50:36 -07:00
|
|
|
|
{
|
2009-04-09 18:16:21 -07:00
|
|
|
|
if(s1.len == 0) {
|
2008-06-30 11:50:36 -07:00
|
|
|
|
s3 = s2;
|
|
|
|
|
|
goto out;
|
|
|
|
|
|
}
|
2009-04-09 18:16:21 -07:00
|
|
|
|
if(s2.len == 0) {
|
2008-06-30 11:50:36 -07:00
|
|
|
|
s3 = s1;
|
|
|
|
|
|
goto out;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2009-04-09 18:16:21 -07:00
|
|
|
|
s3 = gostringsize(s1.len + s2.len);
|
|
|
|
|
|
mcpy(s3.str, s1.str, s1.len);
|
|
|
|
|
|
mcpy(s3.str+s1.len, s2.str, s2.len);
|
2008-06-30 11:50:36 -07:00
|
|
|
|
|
|
|
|
|
|
out:
|
|
|
|
|
|
FLUSH(&s3);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
|
prbounds(int8* s, int32 a, int32 b, int32 c)
|
|
|
|
|
|
{
|
|
|
|
|
|
prints(s);
|
|
|
|
|
|
prints(" ");
|
|
|
|
|
|
sys·printint(a);
|
|
|
|
|
|
prints("<");
|
|
|
|
|
|
sys·printint(b);
|
|
|
|
|
|
prints(">");
|
|
|
|
|
|
sys·printint(c);
|
|
|
|
|
|
prints("\n");
|
2008-09-18 15:56:46 -07:00
|
|
|
|
throw("string bounds");
|
2008-06-30 11:50:36 -07:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
uint32
|
2009-04-09 18:16:21 -07:00
|
|
|
|
cmpstring(String s1, String s2)
|
2008-06-30 11:50:36 -07:00
|
|
|
|
{
|
|
|
|
|
|
uint32 i, l;
|
|
|
|
|
|
byte c1, c2;
|
|
|
|
|
|
|
2009-04-09 18:16:21 -07:00
|
|
|
|
l = s1.len;
|
|
|
|
|
|
if(s2.len < l)
|
|
|
|
|
|
l = s2.len;
|
2008-06-30 11:50:36 -07:00
|
|
|
|
for(i=0; i<l; i++) {
|
2009-04-09 18:16:21 -07:00
|
|
|
|
c1 = s1.str[i];
|
|
|
|
|
|
c2 = s2.str[i];
|
2008-06-30 11:50:36 -07:00
|
|
|
|
if(c1 < c2)
|
|
|
|
|
|
return -1;
|
|
|
|
|
|
if(c1 > c2)
|
|
|
|
|
|
return +1;
|
|
|
|
|
|
}
|
2009-04-09 18:16:21 -07:00
|
|
|
|
if(s1.len < s2.len)
|
2008-06-30 11:50:36 -07:00
|
|
|
|
return -1;
|
2009-04-09 18:16:21 -07:00
|
|
|
|
if(s1.len > s2.len)
|
2008-06-30 11:50:36 -07:00
|
|
|
|
return +1;
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
2009-04-09 18:16:21 -07:00
|
|
|
|
sys·cmpstring(String s1, String s2, int32 v)
|
2008-06-30 11:50:36 -07:00
|
|
|
|
{
|
|
|
|
|
|
v = cmpstring(s1, s2);
|
|
|
|
|
|
FLUSH(&v);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int32
|
|
|
|
|
|
strcmp(byte *s1, byte *s2)
|
|
|
|
|
|
{
|
|
|
|
|
|
uint32 i;
|
|
|
|
|
|
byte c1, c2;
|
|
|
|
|
|
|
|
|
|
|
|
for(i=0;; i++) {
|
|
|
|
|
|
c1 = s1[i];
|
|
|
|
|
|
c2 = s2[i];
|
|
|
|
|
|
if(c1 < c2)
|
|
|
|
|
|
return -1;
|
|
|
|
|
|
if(c1 > c2)
|
|
|
|
|
|
return +1;
|
|
|
|
|
|
if(c1 == 0)
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
2009-04-09 18:16:21 -07:00
|
|
|
|
sys·slicestring(String si, int32 lindex, int32 hindex, String so)
|
2008-06-30 11:50:36 -07:00
|
|
|
|
{
|
|
|
|
|
|
int32 l;
|
|
|
|
|
|
|
2009-04-09 18:16:21 -07:00
|
|
|
|
if(lindex < 0 || lindex > si.len ||
|
|
|
|
|
|
hindex < lindex || hindex > si.len) {
|
2008-06-30 11:50:36 -07:00
|
|
|
|
sys·printpc(&si);
|
|
|
|
|
|
prints(" ");
|
2009-04-09 18:16:21 -07:00
|
|
|
|
prbounds("slice", lindex, si.len, hindex);
|
2008-06-30 11:50:36 -07:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
l = hindex-lindex;
|
2009-04-09 18:16:21 -07:00
|
|
|
|
so.str = si.str + lindex;
|
|
|
|
|
|
so.len = l;
|
|
|
|
|
|
|
|
|
|
|
|
// alternate to create a new string
|
|
|
|
|
|
// so = gostringsize(l);
|
|
|
|
|
|
// mcpy(so.str, si.str+lindex, l);
|
|
|
|
|
|
|
2008-06-30 11:50:36 -07:00
|
|
|
|
FLUSH(&so);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
2009-04-09 18:16:21 -07:00
|
|
|
|
sys·indexstring(String s, int32 i, byte b)
|
2008-06-30 11:50:36 -07:00
|
|
|
|
{
|
2009-04-09 18:16:21 -07:00
|
|
|
|
if(i < 0 || i >= s.len) {
|
2008-06-30 11:50:36 -07:00
|
|
|
|
sys·printpc(&s);
|
|
|
|
|
|
prints(" ");
|
2009-04-09 18:16:21 -07:00
|
|
|
|
prbounds("index", 0, i, s.len);
|
2008-06-30 11:50:36 -07:00
|
|
|
|
}
|
|
|
|
|
|
|
2009-04-09 18:16:21 -07:00
|
|
|
|
b = s.str[i];
|
2008-06-30 11:50:36 -07:00
|
|
|
|
FLUSH(&b);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
2009-04-09 18:16:21 -07:00
|
|
|
|
sys·intstring(int64 v, String s)
|
2008-06-30 11:50:36 -07:00
|
|
|
|
{
|
2009-01-29 17:38:58 -08:00
|
|
|
|
s = gostringsize(8);
|
2009-04-09 18:16:21 -07:00
|
|
|
|
s.len = runetochar(s.str, v);
|
2008-06-30 11:50:36 -07:00
|
|
|
|
FLUSH(&s);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
2009-04-09 18:16:21 -07:00
|
|
|
|
sys·byteastring(byte *a, int32 l, String s)
|
2008-06-30 11:50:36 -07:00
|
|
|
|
{
|
2009-01-29 17:38:58 -08:00
|
|
|
|
s = gostringsize(l);
|
2009-04-09 18:16:21 -07:00
|
|
|
|
mcpy(s.str, a, l);
|
2008-06-30 11:50:36 -07:00
|
|
|
|
FLUSH(&s);
|
|
|
|
|
|
}
|
2008-09-22 20:12:15 -07:00
|
|
|
|
|
|
|
|
|
|
void
|
2009-04-09 18:16:21 -07:00
|
|
|
|
sys·arraystring(Array b, String s)
|
2008-09-22 20:12:15 -07:00
|
|
|
|
{
|
2009-01-29 17:38:58 -08:00
|
|
|
|
s = gostringsize(b.nel);
|
2009-04-09 18:16:21 -07:00
|
|
|
|
mcpy(s.str, b.array, s.len);
|
2008-09-22 20:12:15 -07:00
|
|
|
|
FLUSH(&s);
|
|
|
|
|
|
}
|
2009-04-10 19:49:31 -07:00
|
|
|
|
|
|
|
|
|
|
static int32 chartorune(int32 *rune, byte *str);
|
|
|
|
|
|
enum
|
|
|
|
|
|
{
|
|
|
|
|
|
Runeself = 0x80,
|
|
|
|
|
|
Runeerror = 0xfff8, // fffd in plan9
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
// func stringiter(string, int) (retk int);
|
|
|
|
|
|
void
|
|
|
|
|
|
sys·stringiter(String s, int32 k, int32 retk)
|
|
|
|
|
|
{
|
|
|
|
|
|
int32 l, n;
|
|
|
|
|
|
|
|
|
|
|
|
if(k >= s.len) {
|
|
|
|
|
|
// retk=0 is end of iteration
|
|
|
|
|
|
retk = 0;
|
|
|
|
|
|
goto out;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
l = s.str[k];
|
|
|
|
|
|
n = 1;
|
|
|
|
|
|
|
|
|
|
|
|
if(l >= Runeself) {
|
|
|
|
|
|
// multi-char rune
|
|
|
|
|
|
n = chartorune(&l, s.str+k);
|
|
|
|
|
|
if(k+n > s.len) {
|
|
|
|
|
|
// special case of multi-char rune
|
|
|
|
|
|
// that ran off end of string
|
|
|
|
|
|
l = Runeerror;
|
|
|
|
|
|
n = 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
retk = k+n;
|
|
|
|
|
|
|
|
|
|
|
|
out:
|
|
|
|
|
|
FLUSH(&retk);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// func stringiter2(string, int) (retk int, retv any);
|
|
|
|
|
|
void
|
|
|
|
|
|
sys·stringiter2(String s, int32 k, int32 retk, int32 retv)
|
|
|
|
|
|
{
|
|
|
|
|
|
int32 l, n;
|
|
|
|
|
|
|
|
|
|
|
|
if(k >= s.len) {
|
|
|
|
|
|
// retk=0 is end of iteration
|
|
|
|
|
|
retk = 0;
|
|
|
|
|
|
retv = 0;
|
|
|
|
|
|
goto out;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
l = s.str[k];
|
|
|
|
|
|
n = 1;
|
|
|
|
|
|
|
|
|
|
|
|
if(l >= Runeself) {
|
|
|
|
|
|
// multi-char rune
|
|
|
|
|
|
n = chartorune(&l, s.str+k);
|
|
|
|
|
|
if(k+n > s.len) {
|
|
|
|
|
|
// special case of multi-char rune
|
|
|
|
|
|
// that ran off end of string
|
|
|
|
|
|
l = Runeerror;
|
|
|
|
|
|
n = 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
retk = k+n;
|
|
|
|
|
|
retv = l;
|
|
|
|
|
|
|
|
|
|
|
|
out:
|
|
|
|
|
|
FLUSH(&retk);
|
|
|
|
|
|
FLUSH(&retv);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//
|
|
|
|
|
|
// copied from plan9 library
|
|
|
|
|
|
//
|
|
|
|
|
|
|
|
|
|
|
|
enum
|
|
|
|
|
|
{
|
|
|
|
|
|
Bit1 = 7,
|
|
|
|
|
|
Bitx = 6,
|
|
|
|
|
|
Bit2 = 5,
|
|
|
|
|
|
Bit3 = 4,
|
|
|
|
|
|
Bit4 = 3,
|
|
|
|
|
|
|
|
|
|
|
|
T1 = ((1<<(Bit1+1))-1) ^ 0xFF, /* 0000 0000 */
|
|
|
|
|
|
Tx = ((1<<(Bitx+1))-1) ^ 0xFF, /* 1000 0000 */
|
|
|
|
|
|
T2 = ((1<<(Bit2+1))-1) ^ 0xFF, /* 1100 0000 */
|
|
|
|
|
|
T3 = ((1<<(Bit3+1))-1) ^ 0xFF, /* 1110 0000 */
|
|
|
|
|
|
T4 = ((1<<(Bit4+1))-1) ^ 0xFF, /* 1111 0000 */
|
|
|
|
|
|
|
|
|
|
|
|
Rune1 = (1<<(Bit1+0*Bitx))-1, /* 0000 0000 0111 1111 */
|
|
|
|
|
|
Rune2 = (1<<(Bit2+1*Bitx))-1, /* 0000 0111 1111 1111 */
|
|
|
|
|
|
Rune3 = (1<<(Bit3+2*Bitx))-1, /* 1111 1111 1111 1111 */
|
|
|
|
|
|
|
|
|
|
|
|
Maskx = (1<<Bitx)-1, /* 0011 1111 */
|
|
|
|
|
|
Testx = Maskx ^ 0xFF, /* 1100 0000 */
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
static int32
|
|
|
|
|
|
chartorune(int32 *rune, byte *str)
|
|
|
|
|
|
{
|
|
|
|
|
|
int32 c, c1, c2;
|
|
|
|
|
|
int32 l;
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
|
* one character sequence
|
|
|
|
|
|
* 00000-0007F => T1
|
|
|
|
|
|
*/
|
|
|
|
|
|
c = str[0];
|
|
|
|
|
|
if(c < Tx) {
|
|
|
|
|
|
*rune = c;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
|
* two character sequence
|
|
|
|
|
|
* 0080-07FF => T2 Tx
|
|
|
|
|
|
*/
|
|
|
|
|
|
c1 = str[1] ^ Tx;
|
|
|
|
|
|
if(c1 & Testx)
|
|
|
|
|
|
goto bad;
|
|
|
|
|
|
if(c < T3) {
|
|
|
|
|
|
if(c < T2)
|
|
|
|
|
|
goto bad;
|
|
|
|
|
|
l = ((c << Bitx) | c1) & Rune2;
|
|
|
|
|
|
if(l <= Rune1)
|
|
|
|
|
|
goto bad;
|
|
|
|
|
|
*rune = l;
|
|
|
|
|
|
return 2;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
|
* three character sequence
|
|
|
|
|
|
* 0800-FFFF => T3 Tx Tx
|
|
|
|
|
|
*/
|
|
|
|
|
|
c2 = str[2] ^ Tx;
|
|
|
|
|
|
if(c2 & Testx)
|
|
|
|
|
|
goto bad;
|
|
|
|
|
|
if(c < T4) {
|
|
|
|
|
|
l = ((((c << Bitx) | c1) << Bitx) | c2) & Rune3;
|
|
|
|
|
|
if(l <= Rune2)
|
|
|
|
|
|
goto bad;
|
|
|
|
|
|
*rune = l;
|
|
|
|
|
|
return 3;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
|
* bad decoding
|
|
|
|
|
|
*/
|
|
|
|
|
|
bad:
|
|
|
|
|
|
*rune = Runeerror;
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|