1// Legal cases that should not produce errors: 2void literal_index() { int a[2]; a[0] = 0; a[1] = a[0]; } 3void const_var_index() { int a[2]; const int b = 0; a[b] = 0; } 4void loop_index() { int a[2]; for (int i = 0; i < 2; ++i) { a[i] = i; } } 5void loop_expr_binary() { int a[2]; for (int i = 0; i < 2; ++i) { a[1 - i] = i; } } 6void loop_expr_unary() { int a[2]; for (int i = 0; i > -2; --i) { a[-i] = i; } } 7void loop_swizzle() { int a[2]; for (int i = 0; i < 2; ++i) { a[i.x] = i; } } 8void loop_ternary() { int a[2]; for (int i = 0; i < 2; ++i) { a[i > 0 ? i : 0] = i; } } 9 10void loop_type_coerce() { float a[2]; for (float i = 0; i < 2; ++i) { a[int(i)] = i; } } 11 12void loop_nested() { 13 int a[3]; 14 for (int i = 0; i < 2; ++i) 15 for (int j = 0; j < 2; ++j) { 16 a[i + j] = j; 17 } 18} 19 20uniform int u; 21 22// Illegal cases that should produce errors: 23void uniform_index() { int a[2]; a[u] = 0; } 24void param_index(int p) { int a[2]; a[p] = 0; } 25 26// Legal in SkSL when optimization is enabled: 27void func_index() { int a[2]; a[int(abs(-1))] = 0; } 28 29/*%%* 30error: 23: index expression must be constant 31error: 24: index expression must be constant 32*%%*/ 33