Home
last modified time | relevance | path

Searched refs:At (Results 1 – 25 of 345) sorted by relevance

12345678910>>...14

/external/llvm/lib/Archive/
DArchiveReader.cpp27 static inline unsigned readInteger(const char*&At, const char*End) { in readInteger() argument
32 if (At == End) in readInteger()
34 Result |= (unsigned)((*At++) & 0x7F) << Shift; in readInteger()
36 } while (At[-1] & 0x80); in readInteger()
43 const char* At = (const char*) data; in parseSymbolTable() local
44 const char* End = At + size; in parseSymbolTable()
45 while (At < End) { in parseSymbolTable()
46 unsigned offset = readInteger(At, End); in parseSymbolTable()
47 if (At == End) { in parseSymbolTable()
52 unsigned length = readInteger(At, End); in parseSymbolTable()
[all …]
/external/ceres-solver/internal/ceres/
Dcxsparse.cc95 cs_di At; in CreateSparseMatrixTransposeView() local
96 At.m = A->num_cols(); in CreateSparseMatrixTransposeView()
97 At.n = A->num_rows(); in CreateSparseMatrixTransposeView()
98 At.nz = -1; in CreateSparseMatrixTransposeView()
99 At.nzmax = A->num_nonzeros(); in CreateSparseMatrixTransposeView()
100 At.p = A->mutable_rows(); in CreateSparseMatrixTransposeView()
101 At.i = A->mutable_cols(); in CreateSparseMatrixTransposeView()
102 At.x = A->mutable_values(); in CreateSparseMatrixTransposeView()
103 return At; in CreateSparseMatrixTransposeView()
Dsparse_normal_cholesky_solver.cc122 cs_di At = cxsparse_.CreateSparseMatrixTransposeView(A); in SolveImplUsingCXSparse() local
131 cs_di* A2 = cs_transpose(&At, 1); in SolveImplUsingCXSparse()
132 cs_di* AtA = cs_multiply(&At,A2); in SolveImplUsingCXSparse()
/external/valgrind/unittest/
Dlinear_solver.h109 inline double& At(int i, int j) { in At() function
116 inline const double& At(int i, int j) const { in At() function
129 ret[i] += v[j] * At(i,j); in MultiplyRight()
139 ret[j] += v_to_transpose[i] * At(i,j); in MultiplyLeft()
149 sprintf(temp, "%s%.1lf", j == 0 ? "" : ", ", At(i,j)); in ToString()
191 const double & m_n = perf_m.At(m,n);
205 current[zero_id] = stats_v[m] / perf_m.At(m, zero_id);
241 new_m.At(m,n) = perf_m.At(new_m_to_old[m], new_n_to_old[n]);
/external/elfutils/libelf-po/
Dinsert-header.sin3 # At each occurrence of a line starting with "msgid ", we execute the following
4 # commands. At the first occurrence, insert the file. At the following
/external/elfutils/po/
Dinsert-header.sin3 # At each occurrence of a line starting with "msgid ", we execute the following
4 # commands. At the first occurrence, insert the file. At the following
/external/bison/runtime-po/
Dinsert-header.sin3 # At each occurrence of a line starting with "msgid ", we execute the following
4 # commands. At the first occurrence, insert the file. At the following
/external/e2fsprogs/po/
Dinsert-header.sin3 # At each occurrence of a line starting with "msgid ", we execute the following
4 # commands. At the first occurrence, insert the file. At the following
/external/bison/po/
Dinsert-header.sin3 # At each occurrence of a line starting with "msgid ", we execute the following
4 # commands. At the first occurrence, insert the file. At the following
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
DANTLRCommonTreeAdaptor.h55 - (ANTLRCommonTree *)getChild:(ANTLRCommonTree *)t At:(NSInteger)i;
56 - (void) setChild:(ANTLRCommonTree *)t At:(NSInteger)i Child:(ANTLRCommonTree *)child;
DANTLRTreeAdaptor.h131 - (id) getChild:(id)aNode At:(NSInteger) i;
133 - (void) setChild:(id)aTree At:(NSInteger)index Child:(id)child;
DANTLRTreeVisitor.m91 ANTLRCommonTree *child = [adaptor getChild:t At:i];
93 ANTLRCommonTree *childAfterVisit = [adaptor getChild:t At:i];
95 [adaptor setChild:t At:i Child:visitResult];
DANTLRBaseTreeAdaptor.h128 - (id<ANTLRBaseTree>) getChild:(id<ANTLRBaseTree>)aTree At:(NSInteger)i;
130 - (void) setChild:(id<ANTLRBaseTree>)aTree At:(NSInteger)index Child:(id<ANTLRBaseTree>)aChild;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
DANTLRCommonTreeAdaptor.h52 - (id<ANTLRTree>)getChild:(id<ANTLRTree>)t At:(NSInteger)i;
53 - (void) setChild:(id<ANTLRTree>)t At:(NSInteger)i Child:(id<ANTLRTree>)child;
DANTLRBaseTreeAdaptor.h135 - (id<ANTLRTree>) getChild:(id<ANTLRTree>)aTree At:(NSInteger)i;
137 - (void) setChild:(id<ANTLRTree>)aTree At:(NSInteger)index Child:(id<ANTLRTree>)aChild;
DANTLRTreeAdaptor.h134 - (id<ANTLRTree>) getChild:(id<ANTLRTree>)aNode At:(NSInteger) i;
136 - (void) setChild:(id<ANTLRTree>)aTree At:(NSInteger)index Child:(id<ANTLRTree>)child;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
DANTLRCommonTreeAdaptor.h52 - (id<ANTLRTree>)getChild:(id<ANTLRTree>)t At:(NSInteger)i;
53 - (void) setChild:(id<ANTLRTree>)t At:(NSInteger)i Child:(id<ANTLRTree>)child;
DANTLRBaseTreeAdaptor.h135 - (id<ANTLRTree>) getChild:(id<ANTLRTree>)aTree At:(NSInteger)i;
137 - (void) setChild:(id<ANTLRTree>)aTree At:(NSInteger)index Child:(id<ANTLRTree>)aChild;
DANTLRTreeAdaptor.h134 - (id<ANTLRTree>) getChild:(id<ANTLRTree>)aNode At:(NSInteger) i;
136 - (void) setChild:(id<ANTLRTree>)aTree At:(NSInteger)index Child:(id<ANTLRTree>)child;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
DANTLRCommonTreeAdaptor.h52 - (id<ANTLRTree>)getChild:(id<ANTLRTree>)t At:(NSInteger)i;
53 - (void) setChild:(id<ANTLRTree>)t At:(NSInteger)i Child:(id<ANTLRTree>)child;
DANTLRBaseTreeAdaptor.h135 - (id<ANTLRTree>) getChild:(id<ANTLRTree>)aTree At:(NSInteger)i;
137 - (void) setChild:(id<ANTLRTree>)aTree At:(NSInteger)index Child:(id<ANTLRTree>)aChild;
DANTLRTreeAdaptor.h134 - (id<ANTLRTree>) getChild:(id<ANTLRTree>)aNode At:(NSInteger) i;
136 - (void) setChild:(id<ANTLRTree>)aTree At:(NSInteger)index Child:(id<ANTLRTree>)child;
/external/llvm/lib/Target/PowerPC/
DPPCJITInfo.cpp49 static void EmitBranchToAt(uint64_t At, uint64_t To, bool isCall, bool is64Bit){ in EmitBranchToAt() argument
50 intptr_t Offset = ((intptr_t)To - (intptr_t)At) >> 2; in EmitBranchToAt()
51 unsigned *AtI = (unsigned*)(intptr_t)At; in EmitBranchToAt()
/external/elfutils/
DTHANKS1 At least the following have submitted valuable patches:
/external/dropbear/libtomcrypt/notes/
Dtech0001.txt14 At the very least the system requires one timer and one source of un-timed interrupts. by "un-time…
17 First we shall begin by taking an overview of how the Yarrow PRNG works within libtomcrypt. At the…
29 At this point the PRNG is ready to accept fresh entropy which is added with

12345678910>>...14