Recently I was working on a transformation in middle end to deal with shared variable expansion on an architecture that doesn't support globals in shared memory space. Use and User are two concepts all around the whole middle end. Initially I cannot tell them apart very clearly. After my work on the transformation, I got … Continue reading Use and User in LLVM
Author: shiltian
COMDAT in LLVM
I have been working on LLVM heterogenous IR module (see this video for more details) for several days. The first thing I need is to modify the class llvm::Module to make it accommodate multiple modules. Frankly speaking, it was my first time to hear COMDAT when I went through every member data in the class. … Continue reading COMDAT in LLVM
1342. Number of Steps to Reduce a Number to Zero
Question Given a string s and an integer array indices of the same length. The string s will be shuffled such that the character at the ith position moves to indices[i] in the shuffled string. Return the shuffled string. Example 1: Input: s = "codeleet", indices = [4,5,6,7,0,2,1,3] Output: "leetcode" Explanation: As shown, "codeleet" becomes … Continue reading 1342. Number of Steps to Reduce a Number to Zero
003. Longest Substring Without Repeating Characters
Question Given a string, find the length of the longest substring without repeating characters. Example 1: Input: “abcabcbb” Output: 3 Explanation: The answer is “abc”, with the length of 3. Example 2: Input: “bbbbb” Output: 1 Explanation: The answer is “b”, with the length of 1. Example 3: Input: “pwwkew” Output: 3 Explanation: The answer is “wke”, with the length of 3. Note that the answer … Continue reading 003. Longest Substring Without Repeating Characters
001. Two Sum
From now on, I’d like to solve all algorithm questions on Leetcode one by one to help me pass the job hunting interview in the future, no matter for internship or regular job. 🙂 I also pushed my solution on GitHub. Let’s get started from the first question: Two Sum. Question Given an array of integers, … Continue reading 001. Two Sum
OpenMP Learning Notes
In C/C++, OpenMP directives are specified by using the #pragmamechanism provided by the C and C++ standards.OpenMP directives for C/C++ are specified with #pragma directives. The syntax of an OpenMP directive is as follows:#pragma omp directive-name [clause[ [,] clause] ... ] new-line Each directive starts with #pragma omp. The remainder of the directive follows the conventions of the C and C++ … Continue reading OpenMP Learning Notes
Compiler Techniques/Terminologies
Tail call In computer science, a tail call is a subroutine call performed as the final action of a procedure. If a tail call might lead to the same subroutine being called again later in the call chain, the subroutine is said to be tail-recursive, which is a special case of recursion. Tail calls can be implemented … Continue reading Compiler Techniques/Terminologies