-
Notifications
You must be signed in to change notification settings - Fork 0
/
constant_set.go
57 lines (51 loc) · 1.4 KB
/
constant_set.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
// Copyright (C) 2017 Google Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package service
import (
"fmt"
"reflect"
"strings"
)
// Sprint prints val, attempting to using the constant sets values.
func (e *ConstantSet) Sprint(val interface{}) string {
v := reflect.ValueOf(val)
var i uint64
switch v.Kind() {
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:
i = uint64(v.Int())
case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64:
i = v.Uint()
default:
return fmt.Sprint(val)
}
if e.IsBitfield {
bits := []string{}
for _, c := range e.Constants {
if i&c.Value != 0 {
bits = append(bits, c.Name)
i &^= c.Value
}
}
if i != 0 {
bits = append(bits, fmt.Sprintf("0x%x", i))
}
return strings.Join(bits, " | ")
}
for _, c := range e.Constants {
if i == c.Value {
return c.Name
}
}
return fmt.Sprint(val)
}