View queue.rs
/* Copyright (c) 2010-2011 Dmitry Vyukov. All rights reserved.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
View reception-sop.md

결혼식 접수 SOP

  • 목적: 결혼식 접수를 원활하게 진행하기 위해. 전례를 보아 미리 접수 방법을 숙지하지 않으면 밀려드는 인파를 감당하기 어려울 수도 있음.
  • 작성자: @jeehoonkang (windmorning@gmail.com)

모둠 구성

각 모둠은 한 가문의 손님을 담당한다.

  • 신랑 모둠: 노형균, 박태홍
View add_highlights.py
#!/usr/bin/env python3
import argparse
def interpret_lines(lines):
result = []
for line in lines:
for item in line.split(','):
values = item.split('-')
View gist:49b87436fdb62f1b2b9054a5854ab8bf
cpu1: starting
cpu0: starting
sb: size 1000 nblocks 941 ninodes 200 nlog 30 logstart 2 inodestart 32 bmap start 58
init: starting sh
$ ls
. 1 1 512
.. 1 1 512
README 2 2 2487
cat 2 3 14136
echo 2 4 13368
View xv6-public.diff
diff --git a/Makefile b/Makefile
index 93d525a..db07442 100644
--- a/Makefile
+++ b/Makefile
@@ -70,15 +70,16 @@ QEMU = $(shell if which qemu > /dev/null; \
echo "***" 1>&2; exit 1)
endif
-CC = $(TOOLPREFIX)gcc
+CC = $(TOOLPREFIX)clang
View table.tex
\begin{tabular}{|l||r||r|r|r||r|r|r|}
\hline
& \multicolumn{1}{c||}{\textbf{CompCert}} & \multicolumn{3}{c||}{\textbf{\sepcomp-LevelA}} & \multicolumn{3}{c|}{\textbf{\sepcomp-LevelB}} \\
\cline{3-8}
& \multicolumn{1}{c||}{\textbf{(LOC)}} & \multicolumn{1}{c|}{\textbf{Rm}} & \multicolumn{1}{c|}{\textbf{AddD}} & \multicolumn{1}{c||}{\textbf{AddN}} & \multicolumn{1}{c|}{\textbf{Rm}} & \multicolumn{1}{c|}{\textbf{AddD}} & \multicolumn{1}{c|}{\textbf{AddN}} \\
\hline
\textbf{Total} & 206702 & 318\phantom{0}(0.2\%) & 465 \phantom{0}(0.2\%) & 3392 \phantom{0}(1.6\%) & 372 \phantom{0}(0.2\%) & 1439 \phantom{0}(0.7\%) & 4845 \phantom{0}(2.3\%) \\
\hline
\hline
\textbf{Compiler \& Verification} & 88451 & 318\phantom{0}(0.4\%) & 465 \phantom{0}(0.5\%) & 1153 \phantom{0}(1.3\%) & 372 \phantom{0}(0.4\%) & 1439 \phantom{0}(1.6\%) & 1726 \phantom{0}(2.0\%) \\
View jmm05.md

I think JMM-05 (https://github.com/jeehoonkang/memory-model-explorer/blob/master/test/jmm-05.test) should be allowed, as contrary to the decision JMM people (and we) made. Here is a series of "standard" optimizations that lead JMM-05 into a program that can clearly output the designated outcome.

Series of Optimizations

  • By some global analysis, deduce that r2 should be 0 or 1. Thus transform thread 2 into:

    r2 = y;
    if (r2) {
      x = 1
    } else {
    
View Assignment03.v
(** **** SNU 4190.310, 2016 Spring *)
(** Assignment 03 *)
(** Due: 2016/04/03 23:59 *)
(* Important:
- Do NOT import other files.
- You are NOT allowed to use the [admit] tactic.
View unsafe.txt
./autoconf/configure.ac: AC_MSG_WARN([LLVM will be built thread-unsafe because atomic builtins are missing])
./bindings/go/llvm/bitreader.go: "unsafe"
./bindings/go/llvm/bitreader.go: defer C.free(unsafe.Pointer(cfilename))
./bindings/go/llvm/bitreader.go: C.free(unsafe.Pointer(errmsg))
./bindings/go/llvm/bitreader.go: C.free(unsafe.Pointer(errmsg))
./bindings/go/llvm/dibuilder.go: "unsafe"
./bindings/go/llvm/dibuilder.go: defer C.free(unsafe.Pointer(file))
./bindings/go/llvm/dibuilder.go: defer C.free(unsafe.Pointer(dir))
./bindings/go/llvm/dibuilder.go: defer C.free(unsafe.Pointer(producer))
./bindings/go/llvm/dibuilder.go: defer C.free(unsafe.Pointer(flags))
View 2.cpp
#include <cstdio>
using namespace std;
int main() {
setbuf(stdout, NULL);
int nCase;
scanf("%d", &nCase);