@@ -453,7 +453,7 @@ func (v Value) call(op string, in []Value) []Value {
453
453
var regArgs abi.RegArgs
454
454
455
455
// Compute frame type.
456
- frametype , framePool , abi := funcLayout (t , rcvrtype )
456
+ frametype , framePool , abid := funcLayout (t , rcvrtype )
457
457
458
458
// Allocate a chunk of memory for frame if needed.
459
459
var stackArgs unsafe.Pointer
@@ -470,7 +470,7 @@ func (v Value) call(op string, in []Value) []Value {
470
470
471
471
if debugReflectCall {
472
472
println ("reflect.call" , t .String ())
473
- abi .dump ()
473
+ abid .dump ()
474
474
}
475
475
476
476
// Copy inputs into args.
@@ -481,7 +481,7 @@ func (v Value) call(op string, in []Value) []Value {
481
481
// Guaranteed to only be one word in size,
482
482
// so it will only take up exactly 1 abiStep (either
483
483
// in a register or on the stack).
484
- switch st := abi .call .steps [0 ]; st .kind {
484
+ switch st := abid .call .steps [0 ]; st .kind {
485
485
case abiStepStack :
486
486
storeRcvr (rcvr , stackArgs )
487
487
case abiStepIntReg , abiStepPointer :
@@ -507,7 +507,7 @@ func (v Value) call(op string, in []Value) []Value {
507
507
// was possible to use space in the argument frame.
508
508
v = v .assignTo ("reflect.Value.Call" , targ , nil )
509
509
stepsLoop:
510
- for _ , st := range abi .call .stepsForValue (i + inStart ) {
510
+ for _ , st := range abid .call .stepsForValue (i + inStart ) {
511
511
switch st .kind {
512
512
case abiStepStack :
513
513
// Copy values to the "stack."
@@ -552,10 +552,10 @@ func (v Value) call(op string, in []Value) []Value {
552
552
// TODO(mknyszek): Remove this when we no longer have
553
553
// caller reserved spill space.
554
554
frameSize = align (frameSize , goarch .PtrSize )
555
- frameSize += abi .spill
555
+ frameSize += abid .spill
556
556
557
557
// Mark pointers in registers for the return path.
558
- regArgs .ReturnIsPtr = abi .outRegPtrs
558
+ regArgs .ReturnIsPtr = abid .outRegPtrs
559
559
560
560
if debugReflectCall {
561
561
regArgs .Dump ()
@@ -567,7 +567,7 @@ func (v Value) call(op string, in []Value) []Value {
567
567
}
568
568
569
569
// Call.
570
- call (frametype , fn , stackArgs , uint32 (frametype .size ), uint32 (abi .retOffset ), uint32 (frameSize ), & regArgs )
570
+ call (frametype , fn , stackArgs , uint32 (frametype .size ), uint32 (abid .retOffset ), uint32 (frameSize ), & regArgs )
571
571
572
572
// For testing; see TestCallMethodJump.
573
573
if callGC {
@@ -585,7 +585,7 @@ func (v Value) call(op string, in []Value) []Value {
585
585
// Zero the now unused input area of args,
586
586
// because the Values returned by this function contain pointers to the args object,
587
587
// and will thus keep the args object alive indefinitely.
588
- typedmemclrpartial (frametype , stackArgs , 0 , abi .retOffset )
588
+ typedmemclrpartial (frametype , stackArgs , 0 , abid .retOffset )
589
589
}
590
590
591
591
// Wrap Values around return values in args.
@@ -598,7 +598,7 @@ func (v Value) call(op string, in []Value) []Value {
598
598
ret [i ] = Zero (tv )
599
599
continue
600
600
}
601
- steps := abi .ret .stepsForValue (i )
601
+ steps := abid .ret .stepsForValue (i )
602
602
if st := steps [0 ]; st .kind == abiStepStack {
603
603
// This value is on the stack. If part of a value is stack
604
604
// allocated, the entire value is according to the ABI. So
@@ -690,7 +690,7 @@ func callReflect(ctxt *makeFuncImpl, frame unsafe.Pointer, retValid *bool, regs
690
690
ftyp := ctxt .ftyp
691
691
f := ctxt .fn
692
692
693
- _ , _ , abi := funcLayout (ftyp , nil )
693
+ _ , _ , abid := funcLayout (ftyp , nil )
694
694
695
695
// Copy arguments into Values.
696
696
ptr := frame
@@ -701,7 +701,7 @@ func callReflect(ctxt *makeFuncImpl, frame unsafe.Pointer, retValid *bool, regs
701
701
continue
702
702
}
703
703
v := Value {typ , nil , flag (typ .Kind ())}
704
- steps := abi .call .stepsForValue (i )
704
+ steps := abid .call .stepsForValue (i )
705
705
if st := steps [0 ]; st .kind == abiStepStack {
706
706
if ifaceIndir (typ ) {
707
707
// value cannot be inlined in interface data.
@@ -791,7 +791,7 @@ func callReflect(ctxt *makeFuncImpl, frame unsafe.Pointer, retValid *bool, regs
791
791
// target location used as scratch space. See issue 39541.
792
792
v = v .assignTo ("reflect.MakeFunc" , typ , nil )
793
793
stepsLoop:
794
- for _ , st := range abi .ret .stepsForValue (i ) {
794
+ for _ , st := range abid .ret .stepsForValue (i ) {
795
795
switch st .kind {
796
796
case abiStepStack :
797
797
// Copy values to the "stack."
0 commit comments