array.go 12 KB

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