OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:getCols
(Results
1 - 25
of
67
) sorted by null
1
2
3
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
56
UnsafeCols(new bool[M.
getCols
() - 1]()) {
57
unsigned* ColCounts = new unsigned[M.
getCols
() - 1]();
61
for (unsigned j = 1; j < M.
getCols
(); ++j) {
72
*std::max_element(ColCounts, ColCounts + M.
getCols
() - 1);
/prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/CodeGen/
RegAllocPBQP.h
56
UnsafeCols(new bool[M.
getCols
() - 1]()) {
57
unsigned* ColCounts = new unsigned[M.
getCols
() - 1]();
61
for (unsigned j = 1; j < M.
getCols
(); ++j) {
72
*std::max_element(ColCounts, ColCounts + M.
getCols
() - 1);
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/CodeGen/
RegAllocPBQP.h
56
UnsafeCols(new bool[M.
getCols
() - 1]()) {
57
unsigned* ColCounts = new unsigned[M.
getCols
() - 1]();
61
for (unsigned j = 1; j < M.
getCols
(); ++j) {
72
*std::max_element(ColCounts, ColCounts + M.
getCols
() - 1);
/prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/CodeGen/
RegAllocPBQP.h
56
UnsafeCols(new bool[M.
getCols
() - 1]()) {
57
unsigned* ColCounts = new unsigned[M.
getCols
() - 1]();
61
for (unsigned j = 1; j < M.
getCols
(); ++j) {
72
*std::max_element(ColCounts, ColCounts + M.
getCols
() - 1);
/prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/CodeGen/
RegAllocPBQP.h
56
UnsafeCols(new bool[M.
getCols
() - 1]()) {
57
unsigned* ColCounts = new unsigned[M.
getCols
() - 1]();
61
for (unsigned j = 1; j < M.
getCols
(); ++j) {
72
*std::max_element(ColCounts, ColCounts + M.
getCols
() - 1);
/prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/CodeGen/
RegAllocPBQP.h
56
UnsafeCols(new bool[M.
getCols
() - 1]()) {
57
unsigned* ColCounts = new unsigned[M.
getCols
() - 1]();
61
for (unsigned j = 1; j < M.
getCols
(); ++j) {
72
*std::max_element(ColCounts, ColCounts + M.
getCols
() - 1);
/prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/CodeGen/
RegAllocPBQP.h
56
UnsafeCols(new bool[M.
getCols
() - 1]()) {
57
unsigned* ColCounts = new unsigned[M.
getCols
() - 1]();
61
for (unsigned j = 1; j < M.
getCols
(); ++j) {
72
*std::max_element(ColCounts, ColCounts + M.
getCols
() - 1);
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
56
UnsafeCols(new bool[M.
getCols
() - 1]()) {
57
unsigned* ColCounts = new unsigned[M.
getCols
() - 1]();
61
for (unsigned j = 1; j < M.
getCols
(); ++j) {
72
*std::max_element(ColCounts, ColCounts + M.
getCols
() - 1);
/prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/CodeGen/
RegAllocPBQP.h
56
UnsafeCols(new bool[M.
getCols
() - 1]()) {
57
unsigned* ColCounts = new unsigned[M.
getCols
() - 1]();
61
for (unsigned j = 1; j < M.
getCols
(); ++j) {
72
*std::max_element(ColCounts, ColCounts + M.
getCols
() - 1);
/prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/CodeGen/
RegAllocPBQP.h
56
UnsafeCols(new bool[M.
getCols
() - 1]()) {
57
unsigned* ColCounts = new unsigned[M.
getCols
() - 1]();
61
for (unsigned j = 1; j < M.
getCols
(); ++j) {
72
*std::max_element(ColCounts, ColCounts + M.
getCols
() - 1);
/prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/CodeGen/
RegAllocPBQP.h
56
UnsafeCols(new bool[M.
getCols
() - 1]()) {
57
unsigned* ColCounts = new unsigned[M.
getCols
() - 1]();
61
for (unsigned j = 1; j < M.
getCols
(); ++j) {
72
*std::max_element(ColCounts, ColCounts + M.
getCols
() - 1);
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/
RegAllocPBQP.h
56
UnsafeCols(new bool[M.
getCols
() - 1]()) {
57
unsigned* ColCounts = new unsigned[M.
getCols
() - 1]();
61
for (unsigned j = 1; j < M.
getCols
(); ++j) {
72
*std::max_element(ColCounts, ColCounts + M.
getCols
() - 1);
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/
RegAllocPBQP.h
56
UnsafeCols(new bool[M.
getCols
() - 1]()) {
57
unsigned* ColCounts = new unsigned[M.
getCols
() - 1]();
61
for (unsigned j = 1; j < M.
getCols
(); ++j) {
72
*std::max_element(ColCounts, ColCounts + M.
getCols
() - 1);
/prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/
RegAllocPBQP.h
56
UnsafeCols(new bool[M.
getCols
() - 1]()) {
57
unsigned* ColCounts = new unsigned[M.
getCols
() - 1]();
61
for (unsigned j = 1; j < M.
getCols
(); ++j) {
72
*std::max_element(ColCounts, ColCounts + M.
getCols
() - 1);
/external/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
47
UnsafeCols(new bool[M.
getCols
() - 1]()) {
49
unsigned* ColCounts = new unsigned[M.
getCols
() - 1]();
53
for (unsigned j = 1; j < M.
getCols
(); ++j) {
64
*std::max_element(ColCounts, ColCounts + M.
getCols
() - 1);
/packages/apps/Terminal/src/com/android/terminal/
Terminal.java
154
public int
getCols
() {
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
Graph.h
132
(n2.getCosts().getLength() == ne.getCosts().
getCols
()) &&
179
getNodeCosts(n2Itr).getLength() == costs.
getCols
() &&
Math.h
149
unsigned
getCols
() const { return cols; }
HeuristicSolver.h
514
for (unsigned c = 0; c < edgeCosts.
getCols
(); ++c) {
529
for (unsigned c = 0; c < edgeCosts.
getCols
(); ++c) {
/packages/apps/Terminal/jni/
com_android_terminal_Terminal.cpp
129
dimen_t
getCols
() const;
534
dimen_t Terminal::
getCols
() const {
610
while ((size_t) pos.col < term->
getCols
()) {
659
return term->
getCols
();
/external/llvm/include/llvm/CodeGen/PBQP/
Graph.h
418
getNodeCosts(N2Id).getLength() == Costs.
getCols
() &&
444
getNodeCosts(N2Id).getLength() == Costs->
getCols
() &&
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
Graph.h
399
getNodeCosts(N2Id).getLength() == Costs.
getCols
() &&
425
getNodeCosts(N2Id).getLength() == Costs->
getCols
() &&
/prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/CodeGen/PBQP/
Graph.h
412
getNodeCosts(N2Id).getLength() == Costs.
getCols
() &&
438
getNodeCosts(N2Id).getLength() == Costs->
getCols
() &&
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/CodeGen/PBQP/
Graph.h
412
getNodeCosts(N2Id).getLength() == Costs.
getCols
() &&
438
getNodeCosts(N2Id).getLength() == Costs->
getCols
() &&
/prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/CodeGen/PBQP/
Graph.h
412
getNodeCosts(N2Id).getLength() == Costs.
getCols
() &&
438
getNodeCosts(N2Id).getLength() == Costs->
getCols
() &&
Completed in 409 milliseconds
1
2
3