2008-08-27 18:28:30 -06: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-12-04 22:44:05 -07:00
|
|
|
#include "type.h"
|
|
|
|
#include "malloc.h"
|
2008-08-27 18:28:30 -06:00
|
|
|
|
|
|
|
static int32 debug = 0;
|
|
|
|
|
2009-12-07 16:51:58 -07:00
|
|
|
// see also unsafe·NewArray
|
2010-05-01 14:15:42 -06:00
|
|
|
// makeslice(typ *Type, len, cap int64) (ary []any);
|
2008-08-27 18:28:30 -06:00
|
|
|
void
|
2010-05-01 14:15:42 -06:00
|
|
|
·makeslice(SliceType *t, int64 len, int64 cap, Slice ret)
|
2008-08-27 18:28:30 -06:00
|
|
|
{
|
2010-05-01 14:15:42 -06:00
|
|
|
uintptr size;
|
|
|
|
|
|
|
|
if(len < 0 || (int32)len != len)
|
|
|
|
panicstring("makeslice: len out of range");
|
|
|
|
if(cap < len || (int32)cap != cap || cap > ((uintptr)-1) / t->elem->size)
|
|
|
|
panicstring("makeslice: cap out of range");
|
2008-08-27 18:28:30 -06:00
|
|
|
|
2009-12-04 22:44:05 -07:00
|
|
|
size = cap*t->elem->size;
|
2008-08-27 18:28:30 -06:00
|
|
|
|
2010-05-01 14:15:42 -06:00
|
|
|
ret.len = len;
|
2008-12-18 21:06:28 -07:00
|
|
|
ret.cap = cap;
|
2009-12-04 22:44:05 -07:00
|
|
|
|
2009-12-07 16:51:58 -07:00
|
|
|
if((t->elem->kind&KindNoPointers))
|
2010-04-09 16:30:40 -06:00
|
|
|
ret.array = mallocgc(size, RefNoPointers, 1, 1);
|
2009-12-04 22:44:05 -07:00
|
|
|
else
|
|
|
|
ret.array = mal(size);
|
2008-08-27 18:28:30 -06:00
|
|
|
|
2008-12-17 13:13:19 -07:00
|
|
|
FLUSH(&ret);
|
2008-08-27 18:28:30 -06:00
|
|
|
|
|
|
|
if(debug) {
|
2010-05-01 14:15:42 -06:00
|
|
|
printf("makeslice(%S, %D, %D); ret=",
|
|
|
|
*t->string, len, cap);
|
2010-01-25 19:52:55 -07:00
|
|
|
·printslice(ret);
|
2008-08-27 18:28:30 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-08-03 01:26:02 -06:00
|
|
|
// sliceslice(old []any, lb uint64, hb uint64, width uint64) (ary []any);
|
2008-08-27 18:28:30 -06:00
|
|
|
void
|
2010-08-03 01:26:02 -06:00
|
|
|
·sliceslice(Slice old, uint64 lb, uint64 hb, uint64 width, Slice ret)
|
2008-08-27 18:28:30 -06:00
|
|
|
{
|
2008-12-18 21:06:28 -07:00
|
|
|
if(hb > old.cap || lb > hb) {
|
2008-08-27 18:28:30 -06:00
|
|
|
if(debug) {
|
2010-01-25 19:52:55 -07:00
|
|
|
prints("runtime.sliceslice: old=");
|
|
|
|
·printslice(old);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("; lb=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(lb);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("; hb=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(hb);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("; width=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(width);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("\n");
|
|
|
|
|
|
|
|
prints("oldarray: nel=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(old.len);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("; cap=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(old.cap);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("\n");
|
|
|
|
}
|
2010-04-01 23:31:27 -06:00
|
|
|
·panicslice();
|
2008-08-27 18:28:30 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
// new array is inside old array
|
2009-11-20 10:11:46 -07:00
|
|
|
ret.len = hb - lb;
|
2008-12-18 21:06:28 -07:00
|
|
|
ret.cap = old.cap - lb;
|
|
|
|
ret.array = old.array + lb*width;
|
2008-08-27 18:28:30 -06:00
|
|
|
|
2008-12-17 13:13:19 -07:00
|
|
|
FLUSH(&ret);
|
2008-08-27 18:28:30 -06:00
|
|
|
|
|
|
|
if(debug) {
|
2010-01-25 19:52:55 -07:00
|
|
|
prints("runtime.sliceslice: old=");
|
|
|
|
·printslice(old);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("; lb=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(lb);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("; hb=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(hb);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("; width=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(width);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("; ret=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printslice(ret);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-08-03 01:26:02 -06:00
|
|
|
// sliceslice1(old []any, lb uint64, width uint64) (ary []any);
|
2009-11-20 10:11:46 -07:00
|
|
|
void
|
2010-08-03 01:26:02 -06:00
|
|
|
·sliceslice1(Slice old, uint64 lb, uint64 width, Slice ret)
|
2009-11-20 10:11:46 -07:00
|
|
|
{
|
|
|
|
if(lb > old.len) {
|
|
|
|
if(debug) {
|
2010-01-25 19:52:55 -07:00
|
|
|
prints("runtime.sliceslice: old=");
|
|
|
|
·printslice(old);
|
2009-11-20 10:11:46 -07:00
|
|
|
prints("; lb=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(lb);
|
2009-11-20 10:11:46 -07:00
|
|
|
prints("; width=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(width);
|
2009-11-20 10:11:46 -07:00
|
|
|
prints("\n");
|
|
|
|
|
|
|
|
prints("oldarray: nel=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(old.len);
|
2009-11-20 10:11:46 -07:00
|
|
|
prints("; cap=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(old.cap);
|
2009-11-20 10:11:46 -07:00
|
|
|
prints("\n");
|
|
|
|
}
|
2010-04-01 23:31:27 -06:00
|
|
|
·panicslice();
|
2009-11-20 10:11:46 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
// new array is inside old array
|
|
|
|
ret.len = old.len - lb;
|
|
|
|
ret.cap = old.cap - lb;
|
|
|
|
ret.array = old.array + lb*width;
|
|
|
|
|
|
|
|
FLUSH(&ret);
|
|
|
|
|
|
|
|
if(debug) {
|
2010-01-25 19:52:55 -07:00
|
|
|
prints("runtime.sliceslice: old=");
|
|
|
|
·printslice(old);
|
2009-11-20 10:11:46 -07:00
|
|
|
prints("; lb=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(lb);
|
2009-11-20 10:11:46 -07:00
|
|
|
prints("; width=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(width);
|
2009-11-20 10:11:46 -07:00
|
|
|
prints("; ret=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printslice(ret);
|
2009-11-20 10:11:46 -07:00
|
|
|
prints("\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-08-03 01:26:02 -06:00
|
|
|
// slicearray(old *any, nel uint64, lb uint64, hb uint64, width uint64) (ary []any);
|
2008-08-27 18:28:30 -06:00
|
|
|
void
|
2010-08-03 01:26:02 -06:00
|
|
|
·slicearray(byte* old, uint64 nel, uint64 lb, uint64 hb, uint64 width, Slice ret)
|
2008-08-27 18:28:30 -06:00
|
|
|
{
|
2009-10-20 09:03:43 -06:00
|
|
|
if(nel > 0 && old == nil) {
|
|
|
|
// crash if old == nil.
|
|
|
|
// could give a better message
|
|
|
|
// but this is consistent with all the in-line checks
|
|
|
|
// that the compiler inserts for other uses.
|
|
|
|
*old = 0;
|
|
|
|
}
|
2008-08-27 18:28:30 -06:00
|
|
|
|
|
|
|
if(hb > nel || lb > hb) {
|
|
|
|
if(debug) {
|
2010-01-25 19:52:55 -07:00
|
|
|
prints("runtime.slicearray: old=");
|
|
|
|
·printpointer(old);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("; nel=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(nel);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("; lb=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(lb);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("; hb=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(hb);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("; width=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(width);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("\n");
|
|
|
|
}
|
2010-04-01 23:31:27 -06:00
|
|
|
·panicslice();
|
2008-08-27 18:28:30 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
// new array is inside old array
|
2009-08-25 16:54:25 -06:00
|
|
|
ret.len = hb-lb;
|
2008-12-18 21:06:28 -07:00
|
|
|
ret.cap = nel-lb;
|
|
|
|
ret.array = old + lb*width;
|
2008-08-27 18:28:30 -06:00
|
|
|
|
2008-12-17 13:13:19 -07:00
|
|
|
FLUSH(&ret);
|
2008-08-27 18:28:30 -06:00
|
|
|
|
|
|
|
if(debug) {
|
2010-01-25 19:52:55 -07:00
|
|
|
prints("runtime.slicearray: old=");
|
|
|
|
·printpointer(old);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("; nel=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(nel);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("; lb=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(lb);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("; hb=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(hb);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("; width=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(width);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("; ret=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printslice(ret);
|
2008-08-27 18:28:30 -06:00
|
|
|
prints("\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-11-17 21:41:44 -07:00
|
|
|
// slicecopy(to any, fr any, wid uint32) int
|
|
|
|
void
|
2010-01-25 19:52:55 -07:00
|
|
|
·slicecopy(Slice to, Slice fm, uintptr width, int32 ret)
|
2009-11-17 21:41:44 -07:00
|
|
|
{
|
2010-05-03 18:47:40 -06:00
|
|
|
if(fm.len == 0 || to.len == 0 || width == 0) {
|
2009-11-17 21:41:44 -07:00
|
|
|
ret = 0;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = fm.len;
|
2009-11-17 21:44:35 -07:00
|
|
|
if(to.len < ret)
|
2009-11-17 21:41:44 -07:00
|
|
|
ret = to.len;
|
|
|
|
|
2009-12-07 12:28:02 -07:00
|
|
|
if(ret == 1 && width == 1) { // common case worth about 2x to do here
|
|
|
|
*to.array = *fm.array; // known to be a byte pointer
|
|
|
|
} else {
|
|
|
|
memmove(to.array, fm.array, ret*width);
|
|
|
|
}
|
2009-11-17 21:41:44 -07:00
|
|
|
|
|
|
|
out:
|
|
|
|
FLUSH(&ret);
|
|
|
|
|
|
|
|
if(debug) {
|
|
|
|
prints("main·copy: to=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printslice(to);
|
2009-11-17 21:41:44 -07:00
|
|
|
prints("; fm=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printslice(fm);
|
2009-11-17 21:41:44 -07:00
|
|
|
prints("; width=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(width);
|
2009-11-17 21:41:44 -07:00
|
|
|
prints("; ret=");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(ret);
|
2009-11-17 21:41:44 -07:00
|
|
|
prints("\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-12-17 13:13:19 -07:00
|
|
|
void
|
2010-01-25 19:52:55 -07:00
|
|
|
·printslice(Slice a)
|
2008-12-17 13:13:19 -07:00
|
|
|
{
|
|
|
|
prints("[");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(a.len);
|
2008-12-18 21:06:28 -07:00
|
|
|
prints("/");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printint(a.cap);
|
2008-12-17 13:13:19 -07:00
|
|
|
prints("]");
|
2010-01-25 19:52:55 -07:00
|
|
|
·printpointer(a.array);
|
2008-12-17 13:13:19 -07:00
|
|
|
}
|