encode.go 33 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252
  1. // Copyright (c) 2012-2015 Ugorji Nwoke. All rights reserved.
  2. // Use of this source code is governed by a MIT license found in the LICENSE file.
  3. package codec
  4. import (
  5. "bytes"
  6. "encoding"
  7. "errors"
  8. "fmt"
  9. "io"
  10. "reflect"
  11. "sort"
  12. "sync"
  13. )
  14. const (
  15. defEncByteBufSize = 1 << 6 // 4:16, 6:64, 8:256, 10:1024
  16. )
  17. // AsSymbolFlag defines what should be encoded as symbols.
  18. type AsSymbolFlag uint8
  19. const (
  20. // AsSymbolDefault is default.
  21. // Currently, this means only encode struct field names as symbols.
  22. // The default is subject to change.
  23. AsSymbolDefault AsSymbolFlag = iota
  24. // AsSymbolAll means encode anything which could be a symbol as a symbol.
  25. AsSymbolAll = 0xfe
  26. // AsSymbolNone means do not encode anything as a symbol.
  27. AsSymbolNone = 1 << iota
  28. // AsSymbolMapStringKeys means encode keys in map[string]XXX as symbols.
  29. AsSymbolMapStringKeysFlag
  30. // AsSymbolStructFieldName means encode struct field names as symbols.
  31. AsSymbolStructFieldNameFlag
  32. )
  33. // encWriter abstracts writing to a byte array or to an io.Writer.
  34. type encWriter interface {
  35. writeb([]byte)
  36. writestr(string)
  37. writen1(byte)
  38. writen2(byte, byte)
  39. atEndOfEncode()
  40. }
  41. // encDriver abstracts the actual codec (binc vs msgpack, etc)
  42. type encDriver interface {
  43. IsBuiltinType(rt uintptr) bool
  44. EncodeBuiltin(rt uintptr, v interface{})
  45. EncodeNil()
  46. EncodeInt(i int64)
  47. EncodeUint(i uint64)
  48. EncodeBool(b bool)
  49. EncodeFloat32(f float32)
  50. EncodeFloat64(f float64)
  51. // encodeExtPreamble(xtag byte, length int)
  52. EncodeRawExt(re *RawExt, e *Encoder)
  53. EncodeExt(v interface{}, xtag uint64, ext Ext, e *Encoder)
  54. EncodeArrayStart(length int)
  55. EncodeArrayEnd()
  56. EncodeArrayEntrySeparator()
  57. EncodeMapStart(length int)
  58. EncodeMapEnd()
  59. EncodeMapEntrySeparator()
  60. EncodeMapKVSeparator()
  61. EncodeString(c charEncoding, v string)
  62. EncodeSymbol(v string)
  63. EncodeStringBytes(c charEncoding, v []byte)
  64. //TODO
  65. //encBignum(f *big.Int)
  66. //encStringRunes(c charEncoding, v []rune)
  67. }
  68. type encNoSeparator struct{}
  69. func (_ encNoSeparator) EncodeMapEnd() {}
  70. func (_ encNoSeparator) EncodeArrayEnd() {}
  71. func (_ encNoSeparator) EncodeArrayEntrySeparator() {}
  72. func (_ encNoSeparator) EncodeMapEntrySeparator() {}
  73. func (_ encNoSeparator) EncodeMapKVSeparator() {}
  74. type encStructFieldBytesV struct {
  75. b []byte
  76. v reflect.Value
  77. }
  78. type encStructFieldBytesVslice []encStructFieldBytesV
  79. func (p encStructFieldBytesVslice) Len() int { return len(p) }
  80. func (p encStructFieldBytesVslice) Less(i, j int) bool { return bytes.Compare(p[i].b, p[j].b) == -1 }
  81. func (p encStructFieldBytesVslice) Swap(i, j int) { p[i], p[j] = p[j], p[i] }
  82. type ioEncWriterWriter interface {
  83. WriteByte(c byte) error
  84. WriteString(s string) (n int, err error)
  85. Write(p []byte) (n int, err error)
  86. }
  87. type ioEncStringWriter interface {
  88. WriteString(s string) (n int, err error)
  89. }
  90. type EncodeOptions struct {
  91. // Encode a struct as an array, and not as a map
  92. StructToArray bool
  93. // Canonical representation means that encoding a value will always result in the same
  94. // sequence of bytes.
  95. //
  96. // This only affects maps, as the iteration order for maps is random.
  97. // In this case, the map keys will first be encoded into []byte, and then sorted,
  98. // before writing the sorted keys and the corresponding map values to the stream.
  99. Canonical bool
  100. // AsSymbols defines what should be encoded as symbols.
  101. //
  102. // Encoding as symbols can reduce the encoded size significantly.
  103. //
  104. // However, during decoding, each string to be encoded as a symbol must
  105. // be checked to see if it has been seen before. Consequently, encoding time
  106. // will increase if using symbols, because string comparisons has a clear cost.
  107. //
  108. // Sample values:
  109. // AsSymbolNone
  110. // AsSymbolAll
  111. // AsSymbolMapStringKeys
  112. // AsSymbolMapStringKeysFlag | AsSymbolStructFieldNameFlag
  113. AsSymbols AsSymbolFlag
  114. }
  115. // ---------------------------------------------
  116. type simpleIoEncWriterWriter struct {
  117. w io.Writer
  118. bw io.ByteWriter
  119. sw ioEncStringWriter
  120. }
  121. func (o *simpleIoEncWriterWriter) WriteByte(c byte) (err error) {
  122. if o.bw != nil {
  123. return o.bw.WriteByte(c)
  124. }
  125. _, err = o.w.Write([]byte{c})
  126. return
  127. }
  128. func (o *simpleIoEncWriterWriter) WriteString(s string) (n int, err error) {
  129. if o.sw != nil {
  130. return o.sw.WriteString(s)
  131. }
  132. // return o.w.Write([]byte(s))
  133. return o.w.Write(bytesView(s))
  134. }
  135. func (o *simpleIoEncWriterWriter) Write(p []byte) (n int, err error) {
  136. return o.w.Write(p)
  137. }
  138. // ----------------------------------------
  139. // ioEncWriter implements encWriter and can write to an io.Writer implementation
  140. type ioEncWriter struct {
  141. w ioEncWriterWriter
  142. // x [8]byte // temp byte array re-used internally for efficiency
  143. }
  144. func (z *ioEncWriter) writeb(bs []byte) {
  145. if len(bs) == 0 {
  146. return
  147. }
  148. n, err := z.w.Write(bs)
  149. if err != nil {
  150. panic(err)
  151. }
  152. if n != len(bs) {
  153. panic(fmt.Errorf("incorrect num bytes written. Expecting: %v, Wrote: %v", len(bs), n))
  154. }
  155. }
  156. func (z *ioEncWriter) writestr(s string) {
  157. n, err := z.w.WriteString(s)
  158. if err != nil {
  159. panic(err)
  160. }
  161. if n != len(s) {
  162. panic(fmt.Errorf("incorrect num bytes written. Expecting: %v, Wrote: %v", len(s), n))
  163. }
  164. }
  165. func (z *ioEncWriter) writen1(b byte) {
  166. if err := z.w.WriteByte(b); err != nil {
  167. panic(err)
  168. }
  169. }
  170. func (z *ioEncWriter) writen2(b1 byte, b2 byte) {
  171. z.writen1(b1)
  172. z.writen1(b2)
  173. }
  174. func (z *ioEncWriter) atEndOfEncode() {}
  175. // ----------------------------------------
  176. // bytesEncWriter implements encWriter and can write to an byte slice.
  177. // It is used by Marshal function.
  178. type bytesEncWriter struct {
  179. b []byte
  180. c int // cursor
  181. out *[]byte // write out on atEndOfEncode
  182. }
  183. func (z *bytesEncWriter) writeb(s []byte) {
  184. if len(s) > 0 {
  185. c := z.grow(len(s))
  186. copy(z.b[c:], s)
  187. }
  188. }
  189. func (z *bytesEncWriter) writestr(s string) {
  190. if len(s) > 0 {
  191. c := z.grow(len(s))
  192. copy(z.b[c:], s)
  193. }
  194. }
  195. func (z *bytesEncWriter) writen1(b1 byte) {
  196. c := z.grow(1)
  197. z.b[c] = b1
  198. }
  199. func (z *bytesEncWriter) writen2(b1 byte, b2 byte) {
  200. c := z.grow(2)
  201. z.b[c] = b1
  202. z.b[c+1] = b2
  203. }
  204. func (z *bytesEncWriter) atEndOfEncode() {
  205. *(z.out) = z.b[:z.c]
  206. }
  207. func (z *bytesEncWriter) grow(n int) (oldcursor int) {
  208. oldcursor = z.c
  209. z.c = oldcursor + n
  210. if z.c > len(z.b) {
  211. if z.c > cap(z.b) {
  212. // Tried using appendslice logic: (if cap < 1024, *2, else *1.25).
  213. // However, it was too expensive, causing too many iterations of copy.
  214. // Using bytes.Buffer model was much better (2*cap + n)
  215. bs := make([]byte, 2*cap(z.b)+n)
  216. copy(bs, z.b[:oldcursor])
  217. z.b = bs
  218. } else {
  219. z.b = z.b[:cap(z.b)]
  220. }
  221. }
  222. return
  223. }
  224. // ---------------------------------------------
  225. type encFnInfoX struct {
  226. e *Encoder
  227. ti *typeInfo
  228. xfFn Ext
  229. xfTag uint64
  230. seq seqType
  231. }
  232. type encFnInfo struct {
  233. // use encFnInfo as a value receiver.
  234. // keep most of it less-used variables accessible via a pointer (*encFnInfoX).
  235. // As sweet spot for value-receiver is 3 words, keep everything except
  236. // encDriver (which everyone needs) directly accessible.
  237. // ensure encFnInfoX is set for everyone who needs it i.e.
  238. // rawExt, ext, builtin, (selfer|binary|text)Marshal, kSlice, kStruct, kMap, kInterface, fastpath
  239. ee encDriver
  240. *encFnInfoX
  241. }
  242. func (f encFnInfo) builtin(rv reflect.Value) {
  243. f.ee.EncodeBuiltin(f.ti.rtid, rv.Interface())
  244. }
  245. func (f encFnInfo) rawExt(rv reflect.Value) {
  246. // rev := rv.Interface().(RawExt)
  247. // f.ee.EncodeRawExt(&rev, f.e)
  248. var re *RawExt
  249. if rv.CanAddr() {
  250. re = rv.Addr().Interface().(*RawExt)
  251. } else {
  252. rev := rv.Interface().(RawExt)
  253. re = &rev
  254. }
  255. f.ee.EncodeRawExt(re, f.e)
  256. }
  257. func (f encFnInfo) ext(rv reflect.Value) {
  258. // if this is a struct and it was addressable, then pass the address directly (not the value)
  259. if rv.CanAddr() && rv.Kind() == reflect.Struct {
  260. rv = rv.Addr()
  261. }
  262. f.ee.EncodeExt(rv.Interface(), f.xfTag, f.xfFn, f.e)
  263. }
  264. func (f encFnInfo) getValueForMarshalInterface(rv reflect.Value, indir int8) (v interface{}, proceed bool) {
  265. if indir == 0 {
  266. v = rv.Interface()
  267. } else if indir == -1 {
  268. v = rv.Addr().Interface()
  269. } else {
  270. for j := int8(0); j < indir; j++ {
  271. if rv.IsNil() {
  272. f.ee.EncodeNil()
  273. return
  274. }
  275. rv = rv.Elem()
  276. }
  277. v = rv.Interface()
  278. }
  279. return v, true
  280. }
  281. func (f encFnInfo) selferMarshal(rv reflect.Value) {
  282. if v, proceed := f.getValueForMarshalInterface(rv, f.ti.csIndir); proceed {
  283. v.(Selfer).CodecEncodeSelf(f.e)
  284. }
  285. }
  286. func (f encFnInfo) binaryMarshal(rv reflect.Value) {
  287. if v, proceed := f.getValueForMarshalInterface(rv, f.ti.bmIndir); proceed {
  288. bs, fnerr := v.(encoding.BinaryMarshaler).MarshalBinary()
  289. f.e.marshal(bs, fnerr, false, c_RAW)
  290. }
  291. }
  292. func (f encFnInfo) textMarshal(rv reflect.Value) {
  293. if v, proceed := f.getValueForMarshalInterface(rv, f.ti.tmIndir); proceed {
  294. // debugf(">>>> encoding.TextMarshaler: %T", rv.Interface())
  295. bs, fnerr := v.(encoding.TextMarshaler).MarshalText()
  296. f.e.marshal(bs, fnerr, false, c_UTF8)
  297. }
  298. }
  299. func (f encFnInfo) jsonMarshal(rv reflect.Value) {
  300. if v, proceed := f.getValueForMarshalInterface(rv, f.ti.jmIndir); proceed {
  301. bs, fnerr := v.(jsonMarshaler).MarshalJSON()
  302. f.e.marshal(bs, fnerr, true, c_UTF8)
  303. }
  304. }
  305. func (f encFnInfo) kBool(rv reflect.Value) {
  306. f.ee.EncodeBool(rv.Bool())
  307. }
  308. func (f encFnInfo) kString(rv reflect.Value) {
  309. f.ee.EncodeString(c_UTF8, rv.String())
  310. }
  311. func (f encFnInfo) kFloat64(rv reflect.Value) {
  312. f.ee.EncodeFloat64(rv.Float())
  313. }
  314. func (f encFnInfo) kFloat32(rv reflect.Value) {
  315. f.ee.EncodeFloat32(float32(rv.Float()))
  316. }
  317. func (f encFnInfo) kInt(rv reflect.Value) {
  318. f.ee.EncodeInt(rv.Int())
  319. }
  320. func (f encFnInfo) kUint(rv reflect.Value) {
  321. f.ee.EncodeUint(rv.Uint())
  322. }
  323. func (f encFnInfo) kInvalid(rv reflect.Value) {
  324. f.ee.EncodeNil()
  325. }
  326. func (f encFnInfo) kErr(rv reflect.Value) {
  327. f.e.errorf("unsupported kind %s, for %#v", rv.Kind(), rv)
  328. }
  329. func (f encFnInfo) kSlice(rv reflect.Value) {
  330. ti := f.ti
  331. // array may be non-addressable, so we have to manage with care
  332. // (don't call rv.Bytes, rv.Slice, etc).
  333. // E.g. type struct S{B [2]byte};
  334. // Encode(S{}) will bomb on "panic: slice of unaddressable array".
  335. if f.seq != seqTypeArray {
  336. if rv.IsNil() {
  337. f.ee.EncodeNil()
  338. return
  339. }
  340. // If in this method, then there was no extension function defined.
  341. // So it's okay to treat as []byte.
  342. if ti.rtid == uint8SliceTypId {
  343. f.ee.EncodeStringBytes(c_RAW, rv.Bytes())
  344. return
  345. }
  346. }
  347. rtelem := ti.rt.Elem()
  348. l := rv.Len()
  349. if rtelem.Kind() == reflect.Uint8 {
  350. switch f.seq {
  351. case seqTypeArray:
  352. // if l == 0 { f.ee.encodeStringBytes(c_RAW, nil) } else
  353. if rv.CanAddr() {
  354. f.ee.EncodeStringBytes(c_RAW, rv.Slice(0, l).Bytes())
  355. } else {
  356. var bs []byte
  357. if l <= cap(f.e.b) {
  358. bs = f.e.b[:l]
  359. } else {
  360. bs = make([]byte, l)
  361. }
  362. reflect.Copy(reflect.ValueOf(bs), rv)
  363. // TODO: Test that reflect.Copy works instead of manual one-by-one
  364. // for i := 0; i < l; i++ {
  365. // bs[i] = byte(rv.Index(i).Uint())
  366. // }
  367. f.ee.EncodeStringBytes(c_RAW, bs)
  368. }
  369. case seqTypeSlice:
  370. f.ee.EncodeStringBytes(c_RAW, rv.Bytes())
  371. case seqTypeChan:
  372. bs := f.e.b[:0]
  373. // do not use range, so that the number of elements encoded
  374. // does not change, and encoding does not hang waiting on someone to close chan.
  375. // for b := range rv.Interface().(<-chan byte) {
  376. // bs = append(bs, b)
  377. // }
  378. ch := rv.Interface().(<-chan byte)
  379. for i := 0; i < l; i++ {
  380. bs = append(bs, <-ch)
  381. }
  382. f.ee.EncodeStringBytes(c_RAW, bs)
  383. }
  384. return
  385. }
  386. if ti.mbs {
  387. if l%2 == 1 {
  388. f.e.errorf("mapBySlice requires even slice length, but got %v", l)
  389. return
  390. }
  391. f.ee.EncodeMapStart(l / 2)
  392. } else {
  393. f.ee.EncodeArrayStart(l)
  394. }
  395. e := f.e
  396. sep := !e.be
  397. if l > 0 {
  398. for rtelem.Kind() == reflect.Ptr {
  399. rtelem = rtelem.Elem()
  400. }
  401. // if kind is reflect.Interface, do not pre-determine the
  402. // encoding type, because preEncodeValue may break it down to
  403. // a concrete type and kInterface will bomb.
  404. var fn encFn
  405. if rtelem.Kind() != reflect.Interface {
  406. rtelemid := reflect.ValueOf(rtelem).Pointer()
  407. fn = e.getEncFn(rtelemid, rtelem, true, true)
  408. }
  409. // TODO: Consider perf implication of encoding odd index values as symbols if type is string
  410. if sep {
  411. for j := 0; j < l; j++ {
  412. if j > 0 {
  413. if ti.mbs {
  414. if j%2 == 0 {
  415. f.ee.EncodeMapEntrySeparator()
  416. } else {
  417. f.ee.EncodeMapKVSeparator()
  418. }
  419. } else {
  420. f.ee.EncodeArrayEntrySeparator()
  421. }
  422. }
  423. if f.seq == seqTypeChan {
  424. if rv2, ok2 := rv.Recv(); ok2 {
  425. e.encodeValue(rv2, fn)
  426. }
  427. } else {
  428. e.encodeValue(rv.Index(j), fn)
  429. }
  430. }
  431. } else {
  432. for j := 0; j < l; j++ {
  433. if f.seq == seqTypeChan {
  434. if rv2, ok2 := rv.Recv(); ok2 {
  435. e.encodeValue(rv2, fn)
  436. }
  437. } else {
  438. e.encodeValue(rv.Index(j), fn)
  439. }
  440. }
  441. }
  442. }
  443. if sep {
  444. if ti.mbs {
  445. f.ee.EncodeMapEnd()
  446. } else {
  447. f.ee.EncodeArrayEnd()
  448. }
  449. }
  450. }
  451. func (f encFnInfo) kStruct(rv reflect.Value) {
  452. fti := f.ti
  453. e := f.e
  454. tisfi := fti.sfip
  455. toMap := !(fti.toArray || e.h.StructToArray)
  456. newlen := len(fti.sfi)
  457. // Use sync.Pool to reduce allocating slices unnecessarily.
  458. // The cost of the occasional locking is less than the cost of locking.
  459. var fkvs []encStructFieldKV
  460. var pool *sync.Pool
  461. var poolv interface{}
  462. idxpool := newlen / 8
  463. if encStructPoolLen != 4 {
  464. panic(errors.New("encStructPoolLen must be equal to 4")) // defensive, in case it is changed
  465. }
  466. if idxpool < encStructPoolLen {
  467. pool = &encStructPool[idxpool]
  468. poolv = pool.Get()
  469. switch vv := poolv.(type) {
  470. case *[8]encStructFieldKV:
  471. fkvs = vv[:newlen]
  472. case *[16]encStructFieldKV:
  473. fkvs = vv[:newlen]
  474. case *[32]encStructFieldKV:
  475. fkvs = vv[:newlen]
  476. case *[64]encStructFieldKV:
  477. fkvs = vv[:newlen]
  478. }
  479. }
  480. if fkvs == nil {
  481. fkvs = make([]encStructFieldKV, newlen)
  482. }
  483. // if toMap, use the sorted array. If toArray, use unsorted array (to match sequence in struct)
  484. if toMap {
  485. tisfi = fti.sfi
  486. }
  487. newlen = 0
  488. var kv encStructFieldKV
  489. for _, si := range tisfi {
  490. kv.v = si.field(rv, false)
  491. // if si.i != -1 {
  492. // rvals[newlen] = rv.Field(int(si.i))
  493. // } else {
  494. // rvals[newlen] = rv.FieldByIndex(si.is)
  495. // }
  496. if toMap {
  497. if si.omitEmpty && isEmptyValue(kv.v) {
  498. continue
  499. }
  500. kv.k = si.encName
  501. } else {
  502. // use the zero value.
  503. // if a reference or struct, set to nil (so you do not output too much)
  504. if si.omitEmpty && isEmptyValue(kv.v) {
  505. switch kv.v.Kind() {
  506. case reflect.Struct, reflect.Interface, reflect.Ptr, reflect.Array,
  507. reflect.Map, reflect.Slice:
  508. kv.v = reflect.Value{} //encode as nil
  509. }
  510. }
  511. }
  512. fkvs[newlen] = kv
  513. newlen++
  514. }
  515. // debugf(">>>> kStruct: newlen: %v", newlen)
  516. sep := !e.be
  517. ee := f.ee //don't dereference everytime
  518. if sep {
  519. if toMap {
  520. ee.EncodeMapStart(newlen)
  521. // asSymbols := e.h.AsSymbols&AsSymbolStructFieldNameFlag != 0
  522. asSymbols := e.h.AsSymbols == AsSymbolDefault || e.h.AsSymbols&AsSymbolStructFieldNameFlag != 0
  523. for j := 0; j < newlen; j++ {
  524. kv = fkvs[j]
  525. if j > 0 {
  526. ee.EncodeMapEntrySeparator()
  527. }
  528. if asSymbols {
  529. ee.EncodeSymbol(kv.k)
  530. } else {
  531. ee.EncodeString(c_UTF8, kv.k)
  532. }
  533. ee.EncodeMapKVSeparator()
  534. e.encodeValue(kv.v, encFn{})
  535. }
  536. ee.EncodeMapEnd()
  537. } else {
  538. ee.EncodeArrayStart(newlen)
  539. for j := 0; j < newlen; j++ {
  540. kv = fkvs[j]
  541. if j > 0 {
  542. ee.EncodeArrayEntrySeparator()
  543. }
  544. e.encodeValue(kv.v, encFn{})
  545. }
  546. ee.EncodeArrayEnd()
  547. }
  548. } else {
  549. if toMap {
  550. ee.EncodeMapStart(newlen)
  551. // asSymbols := e.h.AsSymbols&AsSymbolStructFieldNameFlag != 0
  552. asSymbols := e.h.AsSymbols == AsSymbolDefault || e.h.AsSymbols&AsSymbolStructFieldNameFlag != 0
  553. for j := 0; j < newlen; j++ {
  554. kv = fkvs[j]
  555. if asSymbols {
  556. ee.EncodeSymbol(kv.k)
  557. } else {
  558. ee.EncodeString(c_UTF8, kv.k)
  559. }
  560. e.encodeValue(kv.v, encFn{})
  561. }
  562. } else {
  563. ee.EncodeArrayStart(newlen)
  564. for j := 0; j < newlen; j++ {
  565. kv = fkvs[j]
  566. e.encodeValue(kv.v, encFn{})
  567. }
  568. }
  569. }
  570. // do not use defer. Instead, use explicit pool return at end of function.
  571. // defer has a cost we are trying to avoid.
  572. // If there is a panic and these slices are not returned, it is ok.
  573. if pool != nil {
  574. pool.Put(poolv)
  575. }
  576. }
  577. // func (f encFnInfo) kPtr(rv reflect.Value) {
  578. // debugf(">>>>>>> ??? encode kPtr called - shouldn't get called")
  579. // if rv.IsNil() {
  580. // f.ee.encodeNil()
  581. // return
  582. // }
  583. // f.e.encodeValue(rv.Elem())
  584. // }
  585. func (f encFnInfo) kInterface(rv reflect.Value) {
  586. if rv.IsNil() {
  587. f.ee.EncodeNil()
  588. return
  589. }
  590. f.e.encodeValue(rv.Elem(), encFn{})
  591. }
  592. func (f encFnInfo) kMap(rv reflect.Value) {
  593. if rv.IsNil() {
  594. f.ee.EncodeNil()
  595. return
  596. }
  597. l := rv.Len()
  598. f.ee.EncodeMapStart(l)
  599. e := f.e
  600. sep := !e.be
  601. if l == 0 {
  602. if sep {
  603. f.ee.EncodeMapEnd()
  604. }
  605. return
  606. }
  607. var asSymbols bool
  608. // determine the underlying key and val encFn's for the map.
  609. // This eliminates some work which is done for each loop iteration i.e.
  610. // rv.Type(), ref.ValueOf(rt).Pointer(), then check map/list for fn.
  611. //
  612. // However, if kind is reflect.Interface, do not pre-determine the
  613. // encoding type, because preEncodeValue may break it down to
  614. // a concrete type and kInterface will bomb.
  615. var keyFn, valFn encFn
  616. ti := f.ti
  617. rtkey := ti.rt.Key()
  618. rtval := ti.rt.Elem()
  619. rtkeyid := reflect.ValueOf(rtkey).Pointer()
  620. // keyTypeIsString := f.ti.rt.Key().Kind() == reflect.String
  621. var keyTypeIsString = rtkeyid == stringTypId
  622. if keyTypeIsString {
  623. asSymbols = e.h.AsSymbols&AsSymbolMapStringKeysFlag != 0
  624. } else {
  625. for rtkey.Kind() == reflect.Ptr {
  626. rtkey = rtkey.Elem()
  627. }
  628. if rtkey.Kind() != reflect.Interface {
  629. rtkeyid = reflect.ValueOf(rtkey).Pointer()
  630. keyFn = e.getEncFn(rtkeyid, rtkey, true, true)
  631. }
  632. }
  633. for rtval.Kind() == reflect.Ptr {
  634. rtval = rtval.Elem()
  635. }
  636. if rtval.Kind() != reflect.Interface {
  637. rtvalid := reflect.ValueOf(rtval).Pointer()
  638. valFn = e.getEncFn(rtvalid, rtval, true, true)
  639. }
  640. mks := rv.MapKeys()
  641. // for j, lmks := 0, len(mks); j < lmks; j++ {
  642. ee := f.ee //don't dereference everytime
  643. if e.h.Canonical {
  644. // first encode each key to a []byte first, then sort them, then record
  645. // println(">>>>>>>> CANONICAL <<<<<<<<")
  646. var mksv []byte = make([]byte, 0, len(mks)*16) // temporary byte slice for the encoding
  647. e2 := NewEncoderBytes(&mksv, e.hh)
  648. mksbv := make([]encStructFieldBytesV, len(mks))
  649. for i, k := range mks {
  650. l := len(mksv)
  651. e2.MustEncode(k)
  652. mksbv[i].v = k
  653. mksbv[i].b = mksv[l:]
  654. }
  655. sort.Sort(encStructFieldBytesVslice(mksbv))
  656. for j := range mksbv {
  657. if j > 0 {
  658. ee.EncodeMapEntrySeparator()
  659. }
  660. e.w.writeb(mksbv[j].b)
  661. ee.EncodeMapKVSeparator()
  662. e.encodeValue(rv.MapIndex(mksbv[j].v), valFn)
  663. }
  664. ee.EncodeMapEnd()
  665. } else if sep {
  666. for j := range mks {
  667. if j > 0 {
  668. ee.EncodeMapEntrySeparator()
  669. }
  670. if keyTypeIsString {
  671. if asSymbols {
  672. ee.EncodeSymbol(mks[j].String())
  673. } else {
  674. ee.EncodeString(c_UTF8, mks[j].String())
  675. }
  676. } else {
  677. e.encodeValue(mks[j], keyFn)
  678. }
  679. ee.EncodeMapKVSeparator()
  680. e.encodeValue(rv.MapIndex(mks[j]), valFn)
  681. }
  682. ee.EncodeMapEnd()
  683. } else {
  684. for j := range mks {
  685. if keyTypeIsString {
  686. if asSymbols {
  687. ee.EncodeSymbol(mks[j].String())
  688. } else {
  689. ee.EncodeString(c_UTF8, mks[j].String())
  690. }
  691. } else {
  692. e.encodeValue(mks[j], keyFn)
  693. }
  694. e.encodeValue(rv.MapIndex(mks[j]), valFn)
  695. }
  696. }
  697. }
  698. // --------------------------------------------------
  699. // encFn encapsulates the captured variables and the encode function.
  700. // This way, we only do some calculations one times, and pass to the
  701. // code block that should be called (encapsulated in a function)
  702. // instead of executing the checks every time.
  703. type encFn struct {
  704. i encFnInfo
  705. f func(encFnInfo, reflect.Value)
  706. }
  707. // --------------------------------------------------
  708. type rtidEncFn struct {
  709. rtid uintptr
  710. fn encFn
  711. }
  712. // An Encoder writes an object to an output stream in the codec format.
  713. type Encoder struct {
  714. // hopefully, reduce derefencing cost by laying the encWriter inside the Encoder
  715. e encDriver
  716. w encWriter
  717. s []rtidEncFn
  718. be bool // is binary encoding
  719. js bool // is json handle
  720. wi ioEncWriter
  721. wb bytesEncWriter
  722. h *BasicHandle
  723. hh Handle
  724. f map[uintptr]encFn
  725. b [scratchByteArrayLen]byte
  726. }
  727. // NewEncoder returns an Encoder for encoding into an io.Writer.
  728. //
  729. // For efficiency, Users are encouraged to pass in a memory buffered writer
  730. // (eg bufio.Writer, bytes.Buffer).
  731. func NewEncoder(w io.Writer, h Handle) *Encoder {
  732. e := &Encoder{hh: h, h: h.getBasicHandle(), be: h.isBinary()}
  733. ww, ok := w.(ioEncWriterWriter)
  734. if !ok {
  735. sww := simpleIoEncWriterWriter{w: w}
  736. sww.bw, _ = w.(io.ByteWriter)
  737. sww.sw, _ = w.(ioEncStringWriter)
  738. ww = &sww
  739. //ww = bufio.NewWriterSize(w, defEncByteBufSize)
  740. }
  741. e.wi.w = ww
  742. e.w = &e.wi
  743. _, e.js = h.(*JsonHandle)
  744. e.e = h.newEncDriver(e)
  745. return e
  746. }
  747. // NewEncoderBytes returns an encoder for encoding directly and efficiently
  748. // into a byte slice, using zero-copying to temporary slices.
  749. //
  750. // It will potentially replace the output byte slice pointed to.
  751. // After encoding, the out parameter contains the encoded contents.
  752. func NewEncoderBytes(out *[]byte, h Handle) *Encoder {
  753. e := &Encoder{hh: h, h: h.getBasicHandle(), be: h.isBinary()}
  754. in := *out
  755. if in == nil {
  756. in = make([]byte, defEncByteBufSize)
  757. }
  758. e.wb.b, e.wb.out = in, out
  759. e.w = &e.wb
  760. _, e.js = h.(*JsonHandle)
  761. e.e = h.newEncDriver(e)
  762. return e
  763. }
  764. // Encode writes an object into a stream.
  765. //
  766. // Encoding can be configured via the struct tag for the fields.
  767. // The "codec" key in struct field's tag value is the key name,
  768. // followed by an optional comma and options.
  769. // Note that the "json" key is used in the absence of the "codec" key.
  770. //
  771. // To set an option on all fields (e.g. omitempty on all fields), you
  772. // can create a field called _struct, and set flags on it.
  773. //
  774. // Struct values "usually" encode as maps. Each exported struct field is encoded unless:
  775. // - the field's tag is "-", OR
  776. // - the field is empty (empty or the zero value) and its tag specifies the "omitempty" option.
  777. //
  778. // When encoding as a map, the first string in the tag (before the comma)
  779. // is the map key string to use when encoding.
  780. //
  781. // However, struct values may encode as arrays. This happens when:
  782. // - StructToArray Encode option is set, OR
  783. // - the tag on the _struct field sets the "toarray" option
  784. //
  785. // Values with types that implement MapBySlice are encoded as stream maps.
  786. //
  787. // The empty values (for omitempty option) are false, 0, any nil pointer
  788. // or interface value, and any array, slice, map, or string of length zero.
  789. //
  790. // Anonymous fields are encoded inline except:
  791. // - the struct tag specifies a replacement name (first value)
  792. // - the field is of an interface type
  793. //
  794. // Examples:
  795. //
  796. // // NOTE: 'json:' can be used as struct tag key, in place 'codec:' below.
  797. // type MyStruct struct {
  798. // _struct bool `codec:",omitempty"` //set omitempty for every field
  799. // Field1 string `codec:"-"` //skip this field
  800. // Field2 int `codec:"myName"` //Use key "myName" in encode stream
  801. // Field3 int32 `codec:",omitempty"` //use key "Field3". Omit if empty.
  802. // Field4 bool `codec:"f4,omitempty"` //use key "f4". Omit if empty.
  803. // io.Reader //use key "Reader".
  804. // MyStruct `codec:"my1" //use key "my1".
  805. // MyStruct //inline it
  806. // ...
  807. // }
  808. //
  809. // type MyStruct struct {
  810. // _struct bool `codec:",omitempty,toarray"` //set omitempty for every field
  811. // //and encode struct as an array
  812. // }
  813. //
  814. // The mode of encoding is based on the type of the value. When a value is seen:
  815. // - If a Selfer, call its CodecEncodeSelf method
  816. // - If an extension is registered for it, call that extension function
  817. // - If it implements encoding.(Binary|Text|JSON)Marshaler, call its Marshal(Binary|Text|JSON) method
  818. // - Else encode it based on its reflect.Kind
  819. //
  820. // Note that struct field names and keys in map[string]XXX will be treated as symbols.
  821. // Some formats support symbols (e.g. binc) and will properly encode the string
  822. // only once in the stream, and use a tag to refer to it thereafter.
  823. func (e *Encoder) Encode(v interface{}) (err error) {
  824. defer panicToErr(&err)
  825. e.encode(v)
  826. e.w.atEndOfEncode()
  827. return
  828. }
  829. // MustEncode is like Encode, but panics if unable to Encode.
  830. // This provides insight to the code location that triggered the error.
  831. func (e *Encoder) MustEncode(v interface{}) {
  832. e.encode(v)
  833. e.w.atEndOfEncode()
  834. }
  835. // comment out these (Must)Write methods. They were only put there to support cbor.
  836. // However, users already have access to the streams, and can write directly.
  837. //
  838. // // Write allows users write to the Encoder stream directly.
  839. // func (e *Encoder) Write(bs []byte) (err error) {
  840. // defer panicToErr(&err)
  841. // e.w.writeb(bs)
  842. // return
  843. // }
  844. // // MustWrite is like write, but panics if unable to Write.
  845. // func (e *Encoder) MustWrite(bs []byte) {
  846. // e.w.writeb(bs)
  847. // }
  848. func (e *Encoder) encode(iv interface{}) {
  849. // if ics, ok := iv.(Selfer); ok {
  850. // ics.CodecEncodeSelf(e)
  851. // return
  852. // }
  853. switch v := iv.(type) {
  854. case nil:
  855. e.e.EncodeNil()
  856. case Selfer:
  857. v.CodecEncodeSelf(e)
  858. case reflect.Value:
  859. e.encodeValue(v, encFn{})
  860. case string:
  861. e.e.EncodeString(c_UTF8, v)
  862. case bool:
  863. e.e.EncodeBool(v)
  864. case int:
  865. e.e.EncodeInt(int64(v))
  866. case int8:
  867. e.e.EncodeInt(int64(v))
  868. case int16:
  869. e.e.EncodeInt(int64(v))
  870. case int32:
  871. e.e.EncodeInt(int64(v))
  872. case int64:
  873. e.e.EncodeInt(v)
  874. case uint:
  875. e.e.EncodeUint(uint64(v))
  876. case uint8:
  877. e.e.EncodeUint(uint64(v))
  878. case uint16:
  879. e.e.EncodeUint(uint64(v))
  880. case uint32:
  881. e.e.EncodeUint(uint64(v))
  882. case uint64:
  883. e.e.EncodeUint(v)
  884. case float32:
  885. e.e.EncodeFloat32(v)
  886. case float64:
  887. e.e.EncodeFloat64(v)
  888. case []uint8:
  889. e.e.EncodeStringBytes(c_RAW, v)
  890. case *string:
  891. e.e.EncodeString(c_UTF8, *v)
  892. case *bool:
  893. e.e.EncodeBool(*v)
  894. case *int:
  895. e.e.EncodeInt(int64(*v))
  896. case *int8:
  897. e.e.EncodeInt(int64(*v))
  898. case *int16:
  899. e.e.EncodeInt(int64(*v))
  900. case *int32:
  901. e.e.EncodeInt(int64(*v))
  902. case *int64:
  903. e.e.EncodeInt(*v)
  904. case *uint:
  905. e.e.EncodeUint(uint64(*v))
  906. case *uint8:
  907. e.e.EncodeUint(uint64(*v))
  908. case *uint16:
  909. e.e.EncodeUint(uint64(*v))
  910. case *uint32:
  911. e.e.EncodeUint(uint64(*v))
  912. case *uint64:
  913. e.e.EncodeUint(*v)
  914. case *float32:
  915. e.e.EncodeFloat32(*v)
  916. case *float64:
  917. e.e.EncodeFloat64(*v)
  918. case *[]uint8:
  919. e.e.EncodeStringBytes(c_RAW, *v)
  920. default:
  921. // canonical mode is not supported for fastpath of maps (but is fine for slices)
  922. if e.h.Canonical {
  923. if !fastpathEncodeTypeSwitchSlice(iv, e) {
  924. e.encodeI(iv, false, false)
  925. }
  926. } else if !fastpathEncodeTypeSwitch(iv, e) {
  927. e.encodeI(iv, false, false)
  928. }
  929. }
  930. }
  931. func (e *Encoder) encodeI(iv interface{}, checkFastpath, checkCodecSelfer bool) {
  932. if rv, proceed := e.preEncodeValue(reflect.ValueOf(iv)); proceed {
  933. rt := rv.Type()
  934. rtid := reflect.ValueOf(rt).Pointer()
  935. fn := e.getEncFn(rtid, rt, checkFastpath, checkCodecSelfer)
  936. fn.f(fn.i, rv)
  937. }
  938. }
  939. func (e *Encoder) preEncodeValue(rv reflect.Value) (rv2 reflect.Value, proceed bool) {
  940. LOOP:
  941. for {
  942. switch rv.Kind() {
  943. case reflect.Ptr, reflect.Interface:
  944. if rv.IsNil() {
  945. e.e.EncodeNil()
  946. return
  947. }
  948. rv = rv.Elem()
  949. continue LOOP
  950. case reflect.Slice, reflect.Map:
  951. if rv.IsNil() {
  952. e.e.EncodeNil()
  953. return
  954. }
  955. case reflect.Invalid, reflect.Func:
  956. e.e.EncodeNil()
  957. return
  958. }
  959. break
  960. }
  961. return rv, true
  962. }
  963. func (e *Encoder) encodeValue(rv reflect.Value, fn encFn) {
  964. // if a valid fn is passed, it MUST BE for the dereferenced type of rv
  965. if rv, proceed := e.preEncodeValue(rv); proceed {
  966. if fn.f == nil {
  967. rt := rv.Type()
  968. rtid := reflect.ValueOf(rt).Pointer()
  969. fn = e.getEncFn(rtid, rt, true, true)
  970. }
  971. fn.f(fn.i, rv)
  972. }
  973. }
  974. func (e *Encoder) getEncFn(rtid uintptr, rt reflect.Type, checkFastpath, checkCodecSelfer bool) (fn encFn) {
  975. // rtid := reflect.ValueOf(rt).Pointer()
  976. var ok bool
  977. if useMapForCodecCache {
  978. fn, ok = e.f[rtid]
  979. } else {
  980. for _, v := range e.s {
  981. if v.rtid == rtid {
  982. fn, ok = v.fn, true
  983. break
  984. }
  985. }
  986. }
  987. if ok {
  988. return
  989. }
  990. // fi.encFnInfoX = new(encFnInfoX)
  991. ti := getTypeInfo(rtid, rt)
  992. var fi encFnInfo
  993. fi.ee = e.e
  994. if checkCodecSelfer && ti.cs {
  995. fi.encFnInfoX = &encFnInfoX{e: e, ti: ti}
  996. fn.f = (encFnInfo).selferMarshal
  997. } else if rtid == rawExtTypId {
  998. fi.encFnInfoX = &encFnInfoX{e: e, ti: ti}
  999. fn.f = (encFnInfo).rawExt
  1000. } else if e.e.IsBuiltinType(rtid) {
  1001. fi.encFnInfoX = &encFnInfoX{e: e, ti: ti}
  1002. fn.f = (encFnInfo).builtin
  1003. } else if xfFn := e.h.getExt(rtid); xfFn != nil {
  1004. // fi.encFnInfoX = new(encFnInfoX)
  1005. fi.encFnInfoX = &encFnInfoX{e: e, ti: ti}
  1006. fi.xfTag, fi.xfFn = xfFn.tag, xfFn.ext
  1007. fn.f = (encFnInfo).ext
  1008. } else if supportMarshalInterfaces && e.be && ti.bm {
  1009. fi.encFnInfoX = &encFnInfoX{e: e, ti: ti}
  1010. fn.f = (encFnInfo).binaryMarshal
  1011. } else if supportMarshalInterfaces && !e.be && e.js && ti.jm {
  1012. //If JSON, we should check JSONMarshal before textMarshal
  1013. fi.encFnInfoX = &encFnInfoX{e: e, ti: ti}
  1014. fn.f = (encFnInfo).jsonMarshal
  1015. } else if supportMarshalInterfaces && !e.be && ti.tm {
  1016. fi.encFnInfoX = &encFnInfoX{e: e, ti: ti}
  1017. fn.f = (encFnInfo).textMarshal
  1018. } else {
  1019. rk := rt.Kind()
  1020. // if fastpathEnabled && checkFastpath && (rk == reflect.Map || rk == reflect.Slice) {
  1021. if fastpathEnabled && checkFastpath && (rk == reflect.Slice || (rk == reflect.Map && !e.h.Canonical)) {
  1022. if rt.PkgPath() == "" {
  1023. if idx := fastpathAV.index(rtid); idx != -1 {
  1024. fi.encFnInfoX = &encFnInfoX{e: e, ti: ti}
  1025. fn.f = fastpathAV[idx].encfn
  1026. }
  1027. } else {
  1028. ok = false
  1029. // use mapping for underlying type if there
  1030. var rtu reflect.Type
  1031. if rk == reflect.Map {
  1032. rtu = reflect.MapOf(rt.Key(), rt.Elem())
  1033. } else {
  1034. rtu = reflect.SliceOf(rt.Elem())
  1035. }
  1036. rtuid := reflect.ValueOf(rtu).Pointer()
  1037. if idx := fastpathAV.index(rtuid); idx != -1 {
  1038. xfnf := fastpathAV[idx].encfn
  1039. xrt := fastpathAV[idx].rt
  1040. fi.encFnInfoX = &encFnInfoX{e: e, ti: ti}
  1041. fn.f = func(xf encFnInfo, xrv reflect.Value) {
  1042. xfnf(xf, xrv.Convert(xrt))
  1043. }
  1044. }
  1045. }
  1046. }
  1047. if fn.f == nil {
  1048. switch rk {
  1049. case reflect.Bool:
  1050. fn.f = (encFnInfo).kBool
  1051. case reflect.String:
  1052. fn.f = (encFnInfo).kString
  1053. case reflect.Float64:
  1054. fn.f = (encFnInfo).kFloat64
  1055. case reflect.Float32:
  1056. fn.f = (encFnInfo).kFloat32
  1057. case reflect.Int, reflect.Int8, reflect.Int64, reflect.Int32, reflect.Int16:
  1058. fn.f = (encFnInfo).kInt
  1059. case reflect.Uint8, reflect.Uint64, reflect.Uint, reflect.Uint32, reflect.Uint16:
  1060. fn.f = (encFnInfo).kUint
  1061. case reflect.Invalid:
  1062. fn.f = (encFnInfo).kInvalid
  1063. case reflect.Chan:
  1064. fi.encFnInfoX = &encFnInfoX{e: e, ti: ti, seq: seqTypeChan}
  1065. fn.f = (encFnInfo).kSlice
  1066. case reflect.Slice:
  1067. fi.encFnInfoX = &encFnInfoX{e: e, ti: ti, seq: seqTypeSlice}
  1068. fn.f = (encFnInfo).kSlice
  1069. case reflect.Array:
  1070. fi.encFnInfoX = &encFnInfoX{e: e, ti: ti, seq: seqTypeArray}
  1071. fn.f = (encFnInfo).kSlice
  1072. case reflect.Struct:
  1073. fi.encFnInfoX = &encFnInfoX{e: e, ti: ti}
  1074. fn.f = (encFnInfo).kStruct
  1075. // case reflect.Ptr:
  1076. // fn.f = (encFnInfo).kPtr
  1077. case reflect.Interface:
  1078. fi.encFnInfoX = &encFnInfoX{e: e, ti: ti}
  1079. fn.f = (encFnInfo).kInterface
  1080. case reflect.Map:
  1081. fi.encFnInfoX = &encFnInfoX{e: e, ti: ti}
  1082. fn.f = (encFnInfo).kMap
  1083. default:
  1084. fn.f = (encFnInfo).kErr
  1085. }
  1086. }
  1087. }
  1088. fn.i = fi
  1089. if useMapForCodecCache {
  1090. if e.f == nil {
  1091. e.f = make(map[uintptr]encFn, 32)
  1092. }
  1093. e.f[rtid] = fn
  1094. } else {
  1095. if e.s == nil {
  1096. e.s = make([]rtidEncFn, 0, 32)
  1097. }
  1098. e.s = append(e.s, rtidEncFn{rtid, fn})
  1099. }
  1100. return
  1101. }
  1102. func (e *Encoder) marshal(bs []byte, fnerr error, asis bool, c charEncoding) {
  1103. if fnerr != nil {
  1104. panic(fnerr)
  1105. }
  1106. if bs == nil {
  1107. e.e.EncodeNil()
  1108. } else if asis {
  1109. e.w.writeb(bs)
  1110. } else {
  1111. e.e.EncodeStringBytes(c, bs)
  1112. }
  1113. }
  1114. func (e *Encoder) errorf(format string, params ...interface{}) {
  1115. err := fmt.Errorf(format, params...)
  1116. panic(err)
  1117. }
  1118. // ----------------------------------------
  1119. type encStructFieldKV struct {
  1120. k string
  1121. v reflect.Value
  1122. }
  1123. const encStructPoolLen = 4
  1124. // encStructPool is an array of sync.Pool.
  1125. // Each element of the array pools one of encStructPool(8|16|32|64).
  1126. // It allows the re-use of slices up to 64 in length.
  1127. // A performance cost of encoding structs was collecting
  1128. // which values were empty and should be omitted.
  1129. // We needed slices of reflect.Value and string to collect them.
  1130. // This shared pool reduces the amount of unnecessary creation we do.
  1131. // The cost is that of locking sometimes, but sync.Pool is efficient
  1132. // enough to reduce thread contention.
  1133. var encStructPool [encStructPoolLen]sync.Pool
  1134. func init() {
  1135. encStructPool[0].New = func() interface{} { return new([8]encStructFieldKV) }
  1136. encStructPool[1].New = func() interface{} { return new([16]encStructFieldKV) }
  1137. encStructPool[2].New = func() interface{} { return new([32]encStructFieldKV) }
  1138. encStructPool[3].New = func() interface{} { return new([64]encStructFieldKV) }
  1139. }
  1140. // ----------------------------------------
  1141. // func encErr(format string, params ...interface{}) {
  1142. // doPanic(msgTagEnc, format, params...)
  1143. // }