helper_internal.go 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116
  1. // Copyright (c) 2012, 2013 Ugorji Nwoke. All rights reserved.
  2. // Use of this source code is governed by a BSD-style license found in the LICENSE file.
  3. package codec
  4. // All non-std package dependencies live in this file,
  5. // so porting to different environment is easy (just update functions).
  6. import (
  7. "errors"
  8. "fmt"
  9. "math"
  10. "reflect"
  11. )
  12. var (
  13. raisePanicAfterRecover = false
  14. debugging = true
  15. )
  16. func panicValToErr(panicVal interface{}, err *error) {
  17. switch xerr := panicVal.(type) {
  18. case error:
  19. *err = xerr
  20. case string:
  21. *err = errors.New(xerr)
  22. default:
  23. *err = fmt.Errorf("%v", panicVal)
  24. }
  25. if raisePanicAfterRecover {
  26. panic(panicVal)
  27. }
  28. return
  29. }
  30. func isEmptyValue(v reflect.Value) bool {
  31. switch v.Kind() {
  32. case reflect.Array, reflect.Map, reflect.Slice, reflect.String:
  33. return v.Len() == 0
  34. case reflect.Bool:
  35. return !v.Bool()
  36. case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:
  37. return v.Int() == 0
  38. case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:
  39. return v.Uint() == 0
  40. case reflect.Float32, reflect.Float64:
  41. return v.Float() == 0
  42. case reflect.Interface, reflect.Ptr:
  43. return v.IsNil()
  44. }
  45. return false
  46. }
  47. func debugf(format string, args ...interface{}) {
  48. if debugging {
  49. if len(format) == 0 || format[len(format)-1] != '\n' {
  50. format = format + "\n"
  51. }
  52. fmt.Printf(format, args...)
  53. }
  54. }
  55. func pruneSignExt(v []byte) (n int) {
  56. l := len(v)
  57. if l < 2 {
  58. return
  59. }
  60. if v[0] == 0 {
  61. n2 := n + 1
  62. for v[n] == 0 && n2 < l && (v[n2]&(1<<7) == 0) {
  63. n++
  64. n2++
  65. }
  66. return
  67. }
  68. if v[0] == 0xff {
  69. n2 := n + 1
  70. for v[n] == 0xff && n2 < l && (v[n2]&(1<<7) != 0) {
  71. n++
  72. n2++
  73. }
  74. return
  75. }
  76. return
  77. }
  78. func implementsIntf(typ, iTyp reflect.Type) (success bool, indir int8) {
  79. if typ == nil {
  80. return
  81. }
  82. rt := typ
  83. // The type might be a pointer and we need to keep
  84. // dereferencing to the base type until we find an implementation.
  85. for {
  86. if rt.Implements(iTyp) {
  87. return true, indir
  88. }
  89. if p := rt; p.Kind() == reflect.Ptr {
  90. indir++
  91. if indir >= math.MaxInt8 { // insane number of indirections
  92. return false, 0
  93. }
  94. rt = p.Elem()
  95. continue
  96. }
  97. break
  98. }
  99. // No luck yet, but if this is a base type (non-pointer), the pointer might satisfy.
  100. if typ.Kind() != reflect.Ptr {
  101. // Not a pointer, but does the pointer work?
  102. if reflect.PtrTo(typ).Implements(iTyp) {
  103. return true, -1
  104. }
  105. }
  106. return false, 0
  107. }