array.go 12 KB

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