sunho

local pattern = "[Current date and time:*|*Location:(*)|*Character:*|*Emotion:(*)|*outfit:*|*Situation:*|*Inner*thoughts:*]"

local assets = {"Adventurers_Guild_Afternoon", "Adventurers_Guild_Morning", "Adventurers_Guild_Night", "Bedroom_Afternoon", "Bedroom_Morning", "Bedroom_Night", "Bookstore _Afternoon", "Bookstore_Morning", "Bookstore_Night", "Clothing_shop_Afternoon", "Clothing_shop_Morning", "Clothing_shop_Night", "Dungeon_Afternoon", "Dungeon_Morning", "Dungeon_Night", "Living_room_Afternoon", "Living_room_Morning", "Living_room_Night", "Magic_Classroom_Afternoon", "Magic_Classroom_Morning", "Magic_Classroom_Night", "Market_place_Afternoon", "Market_place_Morning", "Market_place_Night", "Mountain_Afternoon", "Mountain_Morning", "Mountain_Night", "Ocean_Afternoon", "Ocean_Morning", "Ocean_Night", "Park_Afternoon", "Park_Morning", "Park_Night", "Potion_Shop_Afternoon", "Potion_Shop_Morning", "Potion_Shop_Night", "Restaurant_Afternoon", "Restaurant_Morning", "Restaurant_Night", "Restroom_Afternoon", "Res

sunho

A = rand(9);
x = rand(9,1);

disp("My implementation:");
disp(mul_vec_by_mat(A,x));
disp("Matlab implementation:");
disp(A*x);

function Ax = mul_vec_by_mat(A, x)
    [m, n] = size(A);

sunho

GSOC report

Information

Project: Re-optimization using JITLink

Organization: LLVM compiler infrastructure

Contributor: Sunho Kim

sunho

GSOC 2022 final report

This report summarizes

Basic Info

• Name: Sunho Kim
• Email: [email protected]
• Github Username: sunho
• Organization: LLVM

sunho

diff --git a/llvm/include/llvm/ExecutionEngine/JITLink/aarch64.h b/llvm/include/llvm/ExecutionEngine/JITLink/aarch64.h
index 994ce783b058..391b9f198fe7 100644
--- a/llvm/include/llvm/ExecutionEngine/JITLink/aarch64.h
+++ b/llvm/include/llvm/ExecutionEngine/JITLink/aarch64.h
@@ -25,6 +25,13 @@ enum EdgeKind_aarch64 : Edge::Kind {
   /// Set a CALL immediate field to bits [27:2] of X = Target - Fixup + Addend
   R_AARCH64_CALL26 = Edge::FirstRelocation,
 
+  /// Set an ADRP immediate value to bits [32:12] of the X
+  R_AARCH64_ADR_PREL_PG_HI21,

sunho

#include <bits/stdc++.h>
using namespace std;
  
struct DSU {
  vector<int> e;
  int SCC;
  DSU(int n) : e(n, -1), SCC(n) {}
  bool sameSet(int a, int b) { return find(a) == find(b); }
  int size(int x) { return -e[find(x)]; }
  int find(int x) { return e[x] < 0 ? x : e[x] = find(e[x]); }

sunho

#include <bits/stdc++.h>
using namespace std;

vector<bool> vis;
vector<vector<int>> g;

void dfs(int u) {
  if (vis[u]) return;
  vis[u] = true;
  for(int v : g[u]) {

sunho

import sys
sys.setrecursionlimit(100000)

n,m = input().split()
n = int(n)
m = int(m)

g = [[] for _ in range(n)]

for _ in range(m):

sunho

#include <bits/stdc++.h>
using namespace std;

void solve() {
  int N,X;
  cin >> N >> X;
  vector<int> A(N), B(N);
  for(int i=0;i<N;i++) cin >> A[i], cin >> B[i];

  vector<bool> prev(X+1);

sunho

# receive input
N, X = input().split()
N = int(N)
X = int(X)
A = []
B = []
for i in range(N):
  a, b = input().split()
  A.append(int(a))
  B.append(int(b))