FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
DirectXShaderCompiler/lib/Support/IntEqClasses.cpp at main · microsoft/DirectXShaderCompiler · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
microsoft
/
DirectXShaderCompiler
Public
Notifications
You must be signed in to change notification settings
Fork
897
Star
3.6k
Code
Issues
653
Pull requests
141
Discussions
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Discussions
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
DirectXShaderCompiler
/
lib
/
Support
/
IntEqClasses.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
70 lines (63 loc) · 2.08 KB
Breadcrumbs
DirectXShaderCompiler
/
lib
/
Support
/
IntEqClasses.cpp
Copy path
File metadata and controls
70 lines (63 loc) · 2.08 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
//
===-- llvm/ADT/IntEqClasses.cpp - Equivalence Classes of Integers -------===//
//
//
The LLVM Compiler Infrastructure
//
//
This file is distributed under the University of Illinois Open Source
//
License. See LICENSE.TXT for details.
//
//
===----------------------------------------------------------------------===//
//
//
Equivalence classes for small integers. This is a mapping of the integers
//
0 .. N-1 into M equivalence classes numbered 0 .. M-1.
//
//
Initially each integer has its own equivalence class. Classes are joined by
//
passing a representative member of each class to join().
//
//
Once the classes are built, compress() will number them 0 .. M-1 and prevent
//
further changes.
//
//
===----------------------------------------------------------------------===//
#
include
"
llvm/ADT/IntEqClasses.h
"
using
namespace
llvm
;
void
IntEqClasses::grow
(
unsigned
N) {
assert
(NumClasses ==
0
&&
"
grow() called after compress().
"
);
EC
.
reserve
(N);
while
(
EC
.
size
() < N)
EC
.
push_back
(
EC
.
size
());
}
void
IntEqClasses::join
(
unsigned
a,
unsigned
b) {
assert
(NumClasses ==
0
&&
"
join() called after compress().
"
);
unsigned
eca =
EC
[a];
unsigned
ecb =
EC
[b];
//
Update pointers while searching for the leaders, compressing the paths
//
incrementally. The larger leader will eventually be updated, joining the
//
classes.
while
(eca != ecb)
if
(eca < ecb)
EC
[b] = eca, b = ecb, ecb =
EC
[b];
else
EC
[a] = ecb, a = eca, eca =
EC
[a];
}
unsigned
IntEqClasses::findLeader
(
unsigned
a)
const
{
assert
(NumClasses ==
0
&&
"
findLeader() called after compress().
"
);
while
(a !=
EC
[a])
a =
EC
[a];
return
a;
}
void
IntEqClasses::compress
() {
if
(NumClasses)
return
;
for
(
unsigned
i =
0
, e =
EC
.
size
(); i != e; ++i)
EC
[i] = (
EC
[i] == i) ? NumClasses++ :
EC
[
EC
[i]];
}
void
IntEqClasses::uncompress
() {
if
(!NumClasses)
return
;
SmallVector<
unsigned
,
8
> Leader;
for
(
unsigned
i =
0
, e =
EC
.
size
(); i != e; ++i)
if
(
EC
[i] < Leader.
size
())
EC
[i] = Leader[
EC
[i]];
else
Leader.
push_back
(
EC
[i] = i);
NumClasses =
0
;
}
Back
|
FazBrowse Home
|
New Git URL