array.go 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632
  1. package goja
  2. import (
  3. "math"
  4. "math/bits"
  5. "reflect"
  6. "strconv"
  7. )
  8. type arrayIterObject struct {
  9. baseObject
  10. obj *Object
  11. nextIdx int64
  12. kind iterationKind
  13. }
  14. func (ai *arrayIterObject) next() Value {
  15. if ai.obj == nil {
  16. return ai.val.runtime.createIterResultObject(_undefined, true)
  17. }
  18. l := toLength(ai.obj.self.getStr("length", nil))
  19. index := ai.nextIdx
  20. if index >= l {
  21. ai.obj = nil
  22. return ai.val.runtime.createIterResultObject(_undefined, true)
  23. }
  24. ai.nextIdx++
  25. idxVal := valueInt(index)
  26. if ai.kind == iterationKindKey {
  27. return ai.val.runtime.createIterResultObject(idxVal, false)
  28. }
  29. elementValue := ai.obj.self.getIdx(idxVal, nil)
  30. var result Value
  31. if ai.kind == iterationKindValue {
  32. result = elementValue
  33. } else {
  34. result = ai.val.runtime.newArrayValues([]Value{idxVal, elementValue})
  35. }
  36. return ai.val.runtime.createIterResultObject(result, false)
  37. }
  38. func (r *Runtime) createArrayIterator(iterObj *Object, kind iterationKind) Value {
  39. o := &Object{runtime: r}
  40. ai := &arrayIterObject{
  41. obj: iterObj,
  42. kind: kind,
  43. }
  44. ai.class = classArrayIterator
  45. ai.val = o
  46. ai.extensible = true
  47. o.self = ai
  48. ai.prototype = r.global.ArrayIteratorPrototype
  49. ai.init()
  50. return o
  51. }
  52. type arrayObject struct {
  53. baseObject
  54. values []Value
  55. length uint32
  56. objCount int
  57. propValueCount int
  58. lengthProp valueProperty
  59. }
  60. func (a *arrayObject) init() {
  61. a.baseObject.init()
  62. a.lengthProp.writable = true
  63. a._put("length", &a.lengthProp)
  64. }
  65. func (a *arrayObject) _setLengthInt(l int64, throw bool) bool {
  66. if l >= 0 && l <= math.MaxUint32 {
  67. l := uint32(l)
  68. ret := true
  69. if l <= a.length {
  70. if a.propValueCount > 0 {
  71. // Slow path
  72. for i := len(a.values) - 1; i >= int(l); i-- {
  73. if prop, ok := a.values[i].(*valueProperty); ok {
  74. if !prop.configurable {
  75. l = uint32(i) + 1
  76. ret = false
  77. break
  78. }
  79. a.propValueCount--
  80. }
  81. }
  82. }
  83. }
  84. if l <= uint32(len(a.values)) {
  85. if l >= 16 && l < uint32(cap(a.values))>>2 {
  86. ar := make([]Value, l)
  87. copy(ar, a.values)
  88. a.values = ar
  89. } else {
  90. ar := a.values[l:len(a.values)]
  91. for i := range ar {
  92. ar[i] = nil
  93. }
  94. a.values = a.values[:l]
  95. }
  96. }
  97. a.length = l
  98. if !ret {
  99. a.val.runtime.typeErrorResult(throw, "Cannot redefine property: length")
  100. }
  101. return ret
  102. }
  103. panic(a.val.runtime.newError(a.val.runtime.global.RangeError, "Invalid array length"))
  104. }
  105. func (a *arrayObject) setLengthInt(l int64, throw bool) bool {
  106. if l == int64(a.length) {
  107. return true
  108. }
  109. if !a.lengthProp.writable {
  110. a.val.runtime.typeErrorResult(throw, "length is not writable")
  111. return false
  112. }
  113. return a._setLengthInt(l, throw)
  114. }
  115. func (a *arrayObject) setLength(v Value, throw bool) bool {
  116. l, ok := toIntIgnoreNegZero(v)
  117. if ok && l == int64(a.length) {
  118. return true
  119. }
  120. if !a.lengthProp.writable {
  121. a.val.runtime.typeErrorResult(throw, "length is not writable")
  122. return false
  123. }
  124. if ok {
  125. return a._setLengthInt(l, throw)
  126. }
  127. panic(a.val.runtime.newError(a.val.runtime.global.RangeError, "Invalid array length"))
  128. }
  129. func (a *arrayObject) getIdx(idx valueInt, receiver Value) Value {
  130. prop := a.getOwnPropIdx(idx)
  131. if prop == nil {
  132. if a.prototype != nil {
  133. if receiver == nil {
  134. return a.prototype.self.getIdx(idx, a.val)
  135. }
  136. return a.prototype.self.getIdx(idx, receiver)
  137. }
  138. }
  139. if prop, ok := prop.(*valueProperty); ok {
  140. if receiver == nil {
  141. return prop.get(a.val)
  142. }
  143. return prop.get(receiver)
  144. }
  145. return prop
  146. }
  147. func (a *arrayObject) getOwnPropStr(name string) Value {
  148. if i := strToIdx(name); i != math.MaxUint32 {
  149. if i < uint32(len(a.values)) {
  150. return a.values[i]
  151. }
  152. }
  153. if name == "length" {
  154. return a.getLengthProp()
  155. }
  156. return a.baseObject.getOwnPropStr(name)
  157. }
  158. func (a *arrayObject) getOwnPropIdx(idx valueInt) Value {
  159. if i := toIdx(idx); i != math.MaxUint32 {
  160. if i < uint32(len(a.values)) {
  161. return a.values[i]
  162. }
  163. return nil
  164. }
  165. return a.baseObject.getOwnPropStr(idx.String())
  166. }
  167. func (a *arrayObject) sortLen() int64 {
  168. return int64(len(a.values))
  169. }
  170. func (a *arrayObject) sortGet(i int64) Value {
  171. v := a.values[i]
  172. if p, ok := v.(*valueProperty); ok {
  173. v = p.get(a.val)
  174. }
  175. return v
  176. }
  177. func (a *arrayObject) swap(i, j int64) {
  178. a.values[i], a.values[j] = a.values[j], a.values[i]
  179. }
  180. func (a *arrayObject) getStr(name string, receiver Value) Value {
  181. return a.getStrWithOwnProp(a.getOwnPropStr(name), name, receiver)
  182. }
  183. func (a *arrayObject) getLengthProp() Value {
  184. a.lengthProp.value = intToValue(int64(a.length))
  185. return &a.lengthProp
  186. }
  187. func (a *arrayObject) setOwnIdx(idx valueInt, val Value, throw bool) bool {
  188. if i := toIdx(idx); i != math.MaxUint32 {
  189. return a._setOwnIdx(i, val, throw)
  190. } else {
  191. return a.baseObject.setOwnStr(idx.String(), val, throw)
  192. }
  193. }
  194. func (a *arrayObject) _setOwnIdx(idx uint32, val Value, throw bool) bool {
  195. var prop Value
  196. if idx < uint32(len(a.values)) {
  197. prop = a.values[idx]
  198. }
  199. if prop == nil {
  200. if proto := a.prototype; proto != nil {
  201. // we know it's foreign because prototype loops are not allowed
  202. if res, ok := proto.self.setForeignIdx(valueInt(idx), val, a.val, throw); ok {
  203. return res
  204. }
  205. }
  206. // new property
  207. if !a.extensible {
  208. a.val.runtime.typeErrorResult(throw, "Cannot add property %d, object is not extensible", idx)
  209. return false
  210. } else {
  211. if idx >= a.length {
  212. if !a.setLengthInt(int64(idx)+1, throw) {
  213. return false
  214. }
  215. }
  216. if idx >= uint32(len(a.values)) {
  217. if !a.expand(idx) {
  218. a.val.self.(*sparseArrayObject).add(idx, val)
  219. return true
  220. }
  221. }
  222. a.objCount++
  223. }
  224. } else {
  225. if prop, ok := prop.(*valueProperty); ok {
  226. if !prop.isWritable() {
  227. a.val.runtime.typeErrorResult(throw)
  228. return false
  229. }
  230. prop.set(a.val, val)
  231. return true
  232. }
  233. }
  234. a.values[idx] = val
  235. return true
  236. }
  237. func (a *arrayObject) setOwnStr(name string, val Value, throw bool) bool {
  238. if idx := strToIdx(name); idx != math.MaxUint32 {
  239. return a._setOwnIdx(idx, val, throw)
  240. } else {
  241. if name == "length" {
  242. return a.setLength(val, throw)
  243. } else {
  244. return a.baseObject.setOwnStr(name, val, throw)
  245. }
  246. }
  247. }
  248. func (a *arrayObject) setForeignIdx(idx valueInt, val, receiver Value, throw bool) (bool, bool) {
  249. return a._setForeignIdx(idx, a.getOwnPropIdx(idx), val, receiver, throw)
  250. }
  251. func (a *arrayObject) setForeignStr(name string, val, receiver Value, throw bool) (bool, bool) {
  252. return a._setForeignStr(name, a.getOwnPropStr(name), val, receiver, throw)
  253. }
  254. type arrayPropIter struct {
  255. a *arrayObject
  256. idx int
  257. }
  258. func (i *arrayPropIter) next() (propIterItem, iterNextFunc) {
  259. for i.idx < len(i.a.values) {
  260. name := strconv.Itoa(i.idx)
  261. prop := i.a.values[i.idx]
  262. i.idx++
  263. if prop != nil {
  264. return propIterItem{name: name, value: prop}, i.next
  265. }
  266. }
  267. return i.a.baseObject.enumerateUnfiltered()()
  268. }
  269. func (a *arrayObject) enumerateUnfiltered() iterNextFunc {
  270. return (&arrayPropIter{
  271. a: a,
  272. }).next
  273. }
  274. func (a *arrayObject) ownKeys(all bool, accum []Value) []Value {
  275. for i, prop := range a.values {
  276. name := strconv.Itoa(i)
  277. if prop != nil {
  278. if !all {
  279. if prop, ok := prop.(*valueProperty); ok && !prop.enumerable {
  280. continue
  281. }
  282. }
  283. accum = append(accum, asciiString(name))
  284. }
  285. }
  286. return a.baseObject.ownKeys(all, accum)
  287. }
  288. func (a *arrayObject) hasOwnPropertyStr(name string) bool {
  289. if idx := strToIdx(name); idx != math.MaxUint32 {
  290. return idx < uint32(len(a.values)) && a.values[idx] != nil
  291. } else {
  292. return a.baseObject.hasOwnPropertyStr(name)
  293. }
  294. }
  295. func (a *arrayObject) hasOwnPropertyIdx(idx valueInt) bool {
  296. if idx := toIdx(idx); idx != math.MaxUint32 {
  297. return idx < uint32(len(a.values)) && a.values[idx] != nil
  298. }
  299. return a.baseObject.hasOwnPropertyStr(idx.String())
  300. }
  301. func (a *arrayObject) expand(idx uint32) bool {
  302. targetLen := idx + 1
  303. if targetLen > uint32(len(a.values)) {
  304. if targetLen < uint32(cap(a.values)) {
  305. a.values = a.values[:targetLen]
  306. } else {
  307. if idx > 4096 && (a.objCount == 0 || idx/uint32(a.objCount) > 10) {
  308. //log.Println("Switching standard->sparse")
  309. sa := &sparseArrayObject{
  310. baseObject: a.baseObject,
  311. length: uint32(a.length),
  312. propValueCount: a.propValueCount,
  313. }
  314. sa.setValues(a.values, a.objCount+1)
  315. sa.val.self = sa
  316. sa.init()
  317. sa.lengthProp.writable = a.lengthProp.writable
  318. return false
  319. } else {
  320. if bits.UintSize == 32 {
  321. if targetLen >= math.MaxInt32 {
  322. panic(a.val.runtime.NewTypeError("Array index overflows int"))
  323. }
  324. }
  325. tl := int(targetLen)
  326. // Use the same algorithm as in runtime.growSlice
  327. newcap := cap(a.values)
  328. doublecap := newcap + newcap
  329. if tl > doublecap {
  330. newcap = tl
  331. } else {
  332. if len(a.values) < 1024 {
  333. newcap = doublecap
  334. } else {
  335. for newcap < tl {
  336. newcap += newcap / 4
  337. }
  338. }
  339. }
  340. newValues := make([]Value, tl, newcap)
  341. copy(newValues, a.values)
  342. a.values = newValues
  343. }
  344. }
  345. }
  346. return true
  347. }
  348. func (r *Runtime) defineArrayLength(prop *valueProperty, descr PropertyDescriptor, setter func(Value, bool) bool, throw bool) bool {
  349. ret := true
  350. if descr.Configurable == FLAG_TRUE || descr.Enumerable == FLAG_TRUE || descr.Getter != nil || descr.Setter != nil {
  351. ret = false
  352. goto Reject
  353. }
  354. if newLen := descr.Value; newLen != nil {
  355. ret = setter(newLen, false)
  356. } else {
  357. ret = true
  358. }
  359. if descr.Writable != FLAG_NOT_SET {
  360. w := descr.Writable.Bool()
  361. if prop.writable {
  362. prop.writable = w
  363. } else {
  364. if w {
  365. ret = false
  366. goto Reject
  367. }
  368. }
  369. }
  370. Reject:
  371. if !ret {
  372. r.typeErrorResult(throw, "Cannot redefine property: length")
  373. }
  374. return ret
  375. }
  376. func (a *arrayObject) _defineIdxProperty(idx uint32, desc PropertyDescriptor, throw bool) bool {
  377. var existing Value
  378. if idx < uint32(len(a.values)) {
  379. existing = a.values[idx]
  380. }
  381. prop, ok := a.baseObject._defineOwnProperty(strconv.FormatUint(uint64(idx), 10), existing, desc, throw)
  382. if ok {
  383. if idx >= uint32(a.length) {
  384. if !a.setLengthInt(int64(idx)+1, throw) {
  385. return false
  386. }
  387. }
  388. if a.expand(idx) {
  389. a.values[idx] = prop
  390. a.objCount++
  391. if _, ok := prop.(*valueProperty); ok {
  392. a.propValueCount++
  393. }
  394. } else {
  395. a.val.self.(*sparseArrayObject).add(uint32(idx), prop)
  396. }
  397. }
  398. return ok
  399. }
  400. func (a *arrayObject) defineOwnPropertyStr(name string, descr PropertyDescriptor, throw bool) bool {
  401. if idx := strToIdx(name); idx != math.MaxUint32 {
  402. return a._defineIdxProperty(idx, descr, throw)
  403. }
  404. if name == "length" {
  405. return a.val.runtime.defineArrayLength(&a.lengthProp, descr, a.setLength, throw)
  406. }
  407. return a.baseObject.defineOwnPropertyStr(name, descr, throw)
  408. }
  409. func (a *arrayObject) defineOwnPropertyIdx(idx valueInt, descr PropertyDescriptor, throw bool) bool {
  410. if idx := toIdx(idx); idx != math.MaxUint32 {
  411. return a._defineIdxProperty(idx, descr, throw)
  412. }
  413. return a.baseObject.defineOwnPropertyStr(idx.String(), descr, throw)
  414. }
  415. func (a *arrayObject) _deleteIdxProp(idx uint32, throw bool) bool {
  416. if idx < uint32(len(a.values)) {
  417. if v := a.values[idx]; v != nil {
  418. if p, ok := v.(*valueProperty); ok {
  419. if !p.configurable {
  420. a.val.runtime.typeErrorResult(throw, "Cannot delete property '%d' of %s", idx, a.val.toString())
  421. return false
  422. }
  423. a.propValueCount--
  424. }
  425. a.values[idx] = nil
  426. a.objCount--
  427. }
  428. }
  429. return true
  430. }
  431. func (a *arrayObject) deleteStr(name string, throw bool) bool {
  432. if idx := strToIdx(name); idx != math.MaxUint32 {
  433. return a._deleteIdxProp(idx, throw)
  434. }
  435. return a.baseObject.deleteStr(name, throw)
  436. }
  437. func (a *arrayObject) deleteIdx(idx valueInt, throw bool) bool {
  438. if idx := toIdx(idx); idx != math.MaxUint32 {
  439. return a._deleteIdxProp(idx, throw)
  440. }
  441. return a.baseObject.deleteStr(idx.String(), throw)
  442. }
  443. func (a *arrayObject) export() interface{} {
  444. arr := make([]interface{}, a.length)
  445. for i, v := range a.values {
  446. if v != nil {
  447. arr[i] = v.Export()
  448. }
  449. }
  450. return arr
  451. }
  452. func (a *arrayObject) exportType() reflect.Type {
  453. return reflectTypeArray
  454. }
  455. func (a *arrayObject) setValuesFromSparse(items []sparseArrayItem, newMaxIdx int) {
  456. a.values = make([]Value, newMaxIdx+1)
  457. for _, item := range items {
  458. a.values[item.idx] = item.value
  459. }
  460. a.objCount = len(items)
  461. }
  462. func toIdx(v valueInt) uint32 {
  463. if v >= 0 && v < math.MaxUint32 {
  464. return uint32(v)
  465. }
  466. return math.MaxUint32
  467. }
  468. func strToIdx64(s string) int64 {
  469. if s == "" {
  470. return -1
  471. }
  472. l := len(s)
  473. if s[0] == '0' {
  474. if l == 1 {
  475. return 0
  476. }
  477. return -1
  478. }
  479. var n int64
  480. if l < 19 {
  481. // guaranteed not to overflow
  482. for i := 0; i < len(s); i++ {
  483. c := s[i]
  484. if c < '0' || c > '9' {
  485. return -1
  486. }
  487. n = n*10 + int64(c-'0')
  488. }
  489. return n
  490. }
  491. if l > 19 {
  492. // guaranteed to overflow
  493. return -1
  494. }
  495. c18 := s[18]
  496. if c18 < '0' || c18 > '9' {
  497. return -1
  498. }
  499. for i := 0; i < 18; i++ {
  500. c := s[i]
  501. if c < '0' || c > '9' {
  502. return -1
  503. }
  504. n = n*10 + int64(c-'0')
  505. }
  506. if n >= math.MaxInt64/10+1 {
  507. return -1
  508. }
  509. n *= 10
  510. n1 := n + int64(c18-'0')
  511. if n1 < n {
  512. return -1
  513. }
  514. return n1
  515. }
  516. func strToIdx(s string) uint32 {
  517. if s == "" {
  518. return math.MaxUint32
  519. }
  520. l := len(s)
  521. if s[0] == '0' {
  522. if l == 1 {
  523. return 0
  524. }
  525. return math.MaxUint32
  526. }
  527. var n uint32
  528. if l < 10 {
  529. // guaranteed not to overflow
  530. for i := 0; i < len(s); i++ {
  531. c := s[i]
  532. if c < '0' || c > '9' {
  533. return math.MaxUint32
  534. }
  535. n = n*10 + uint32(c-'0')
  536. }
  537. return n
  538. }
  539. if l > 10 {
  540. // guaranteed to overflow
  541. return math.MaxUint32
  542. }
  543. c9 := s[9]
  544. if c9 < '0' || c9 > '9' {
  545. return math.MaxUint32
  546. }
  547. for i := 0; i < 9; i++ {
  548. c := s[i]
  549. if c < '0' || c > '9' {
  550. return math.MaxUint32
  551. }
  552. n = n*10 + uint32(c-'0')
  553. }
  554. if n >= math.MaxUint32/10+1 {
  555. return math.MaxUint32
  556. }
  557. n *= 10
  558. n1 := n + uint32(c9-'0')
  559. if n1 < n {
  560. return math.MaxUint32
  561. }
  562. return n1
  563. }
  564. func strToGoIdx(s string) int {
  565. if bits.UintSize == 64 {
  566. return int(strToIdx64(s))
  567. }
  568. i := strToIdx(s)
  569. if i == math.MaxUint32 {
  570. return -1
  571. }
  572. if i >= math.MaxInt32 {
  573. return -1
  574. }
  575. return int(i)
  576. }