+++ /dev/null
-// Copyright 2015 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.
-
-package main
-
-func bool2int(b bool) int {
- if b {
- return 1
- }
- return 0
-}
+++ /dev/null
-// Copyright 2015 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.
-
-package main
-
-func bool2int(b bool) int {
- if b {
- return 1
- }
- return 0
-}
case gc.CTINT, gc.CTRUNE:
return gc.Mpgetfix(n.Val.U.Xval), true
case gc.CTBOOL:
- return int64(bool2int(n.Val.U.Bval)), true
+ return int64(obj.Bool2int(n.Val.U.Bval)), true
}
return
}
+++ /dev/null
-// Copyright 2015 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.
-
-package main
-
-func bool2int(b bool) int {
- if b {
- return 1
- }
- return 0
-}
+++ /dev/null
-// Copyright 2015 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.
-
-package main
-
-func bool2int(b bool) int {
- if b {
- return 1
- }
- return 0
-}
case gc.CTINT, gc.CTRUNE:
return gc.Mpgetfix(n.Val.U.Xval), true
case gc.CTBOOL:
- return int64(bool2int(n.Val.U.Bval)), true
+ return int64(obj.Bool2int(n.Val.U.Bval)), true
}
return
}
+++ /dev/null
-// Copyright 2015 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.
-
-package main
-
-func bool2int(b bool) int {
- if b {
- return 1
- }
- return 0
-}
i = Mpgetfix(val.U.Xval)
case CTBOOL:
- i = int64(bool2int(val.U.Bval))
+ i = int64(obj.Bool2int(val.U.Bval))
case CTNIL:
i = 0
p.To.Val = nil
if as != obj.AJMP && likely != 0 && Thearch.Thechar != '9' && Thearch.Thechar != '7' {
p.From.Type = obj.TYPE_CONST
- p.From.Offset = int64(bool2int(likely > 0))
+ p.From.Offset = int64(obj.Bool2int(likely > 0))
}
return p
case CTBOOL:
a.Sym = nil
a.Type = obj.TYPE_CONST
- a.Offset = int64(bool2int(n.Val.U.Bval))
+ a.Offset = int64(obj.Bool2int(n.Val.U.Bval))
case CTNIL:
a.Sym = nil
}
if a.Used != b.Used {
- return bool2int(b.Used) - bool2int(a.Used)
+ return obj.Bool2int(b.Used) - obj.Bool2int(a.Used)
}
- ap := bool2int(haspointers(a.Type))
- bp := bool2int(haspointers(b.Type))
+ ap := obj.Bool2int(haspointers(a.Type))
+ bp := obj.Bool2int(haspointers(b.Type))
if ap != bp {
return bp - ap
}
- ap = bool2int(a.Needzero)
- bp = bool2int(b.Needzero)
+ ap = obj.Bool2int(a.Needzero)
+ bp = obj.Bool2int(b.Needzero)
if ap != bp {
return bp - ap
}
ret = true
}
- t.Haspointers = 1 + uint8(bool2int(ret))
+ t.Haspointers = 1 + uint8(obj.Bool2int(ret))
return ret
}
ot = dcommontype(s, ot, t)
xt = ot - 3*Widthptr
- ot = duint8(s, ot, uint8(bool2int(isddd)))
+ ot = duint8(s, ot, uint8(obj.Bool2int(isddd)))
// two slice headers: in and out.
ot = int(Rnd(int64(ot), int64(Widthptr)))
}
ot = duint16(s, ot, uint16(mapbucket(t).Width))
- ot = duint8(s, ot, uint8(bool2int(isreflexive(t.Down))))
+ ot = duint8(s, ot, uint8(obj.Bool2int(isreflexive(t.Down))))
case TPTR32, TPTR64:
if t.Type.Etype == TANY {
n.Type = nil
return
}
- et := bool2int(checkmake(t, "len", l) < 0)
- et |= bool2int(r != nil && checkmake(t, "cap", r) < 0)
+ et := obj.Bool2int(checkmake(t, "len", l) < 0)
+ et |= obj.Bool2int(r != nil && checkmake(t, "cap", r) < 0)
if et != 0 {
n.Type = nil
return
if Eqtype(a.Left.Type, n.Type) {
cmp.Right = a.Left
evconst(&cmp)
- b = uint32(bool2int(cmp.Val.U.Bval))
+ b = uint32(obj.Bool2int(cmp.Val.U.Bval))
}
} else if Eqtype(a.Type, n.Type) {
cmp.Right = a
evconst(&cmp)
- b = uint32(bool2int(cmp.Val.U.Bval))
+ b = uint32(obj.Bool2int(cmp.Val.U.Bval))
}
if b != 0 {
"strings"
)
-func bool2int(b bool) int {
- if b {
- return 1
- }
- return 0
-}
-
func (n *Node) Line() string {
return obj.Linklinefmt(Ctxt, int(n.Lineno), false, false)
}
if ctxt.Cursym.Cfunc != 0 {
p.To.Sym = obj.Linklookup(ctxt, "runtime.morestackc", 0)
} else {
- p.To.Sym = ctxt.Symmorestack[bool2int(noctxt)]
+ p.To.Sym = ctxt.Symmorestack[obj.Bool2int(noctxt)]
}
// BLS start
+++ /dev/null
-// Copyright 2015 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.
-
-package arm
-
-func bool2int(b bool) int {
- if b {
- return 1
- }
- return 0
-}
func ispcdisp(v int32) int {
/* pc-relative addressing will reach? */
- return bool2int(v >= -0xfffff && v <= 0xfffff && (v&3) == 0)
+ return obj.Bool2int(v >= -0xfffff && v <= 0xfffff && (v&3) == 0)
}
func isaddcon(v int64) int {
if (v & 0xFFF) == 0 {
v >>= 12
}
- return bool2int(v <= 0xFFF)
+ return obj.Bool2int(v <= 0xFFF)
}
func isbitcon(v uint64) int {
/* fancy bimm32 or bimm64? */
// TODO(aram):
return 0
- // return bool2int(findmask(v) != nil || (v>>32) == 0 && findmask(v|(v<<32)) != nil)
+ // return obj.Bool2int(findmask(v) != nil || (v>>32) == 0 && findmask(v|(v<<32)) != nil)
}
func autoclass(l int64) int {
case 24: /* mov/mvn Rs,Rd -> add $0,Rs,Rd or orr Rs,ZR,Rd */
rf := int(p.From.Reg)
rt := int(p.To.Reg)
- s := bool2int(rf == REGSP || rt == REGSP)
+ s := obj.Bool2int(rf == REGSP || rt == REGSP)
if p.As == AMVN || p.As == AMVNW {
if s != 0 {
ctxt.Diag("illegal SP reference\n%v", p)
}
if !(p.From3.Offset&obj.NOSPLIT != 0) {
- p = stacksplit(ctxt, p, ctxt.Autosize, bool2int(cursym.Text.From3.Offset&obj.NEEDCTXT == 0)) // emit split check
+ p = stacksplit(ctxt, p, ctxt.Autosize, obj.Bool2int(cursym.Text.From3.Offset&obj.NEEDCTXT == 0)) // emit split check
}
aoffset = ctxt.Autosize
+++ /dev/null
-// Copyright 2015 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.
-
-package arm64
-
-func bool2int(b bool) int {
- if b {
- return 1
- }
- return 0
-}
if ctxt.Cursym.Cfunc != 0 {
p.To.Sym = obj.Linklookup(ctxt, "runtime.morestackc", 0)
} else {
- p.To.Sym = ctxt.Symmorestack[bool2int(noctxt)]
+ p.To.Sym = ctxt.Symmorestack[obj.Bool2int(noctxt)]
}
// BR start
+++ /dev/null
-// Copyright 2015 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.
-
-package ppc64
-
-func bool2int(b bool) int {
- if b {
- return 1
- }
- return 0
-}
"VARDEF",
"VARKILL",
}
+
+func Bool2int(b bool) int {
+ if b {
+ return 1
+ }
+ return 0
+}
f3t := int(p.F3t) * Ymax
tt := int(p.Tt) * Ymax
- xo := bool2int(o.op[0] == 0x0f)
+ xo := obj.Bool2int(o.op[0] == 0x0f)
z := 0
var a *obj.Addr
var l int
if ctxt.Cursym.Cfunc != 0 {
p.To.Sym = obj.Linklookup(ctxt, "runtime.morestackc", 0)
} else {
- p.To.Sym = ctxt.Symmorestack[bool2int(noctxt)]
+ p.To.Sym = ctxt.Symmorestack[obj.Bool2int(noctxt)]
}
p = obj.Appendp(ctxt, p)
+++ /dev/null
-// Copyright 2015 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.
-
-package x86
-
-func bool2int(b bool) int {
- if b {
- return 1
- }
- return 0
-}