| /external/valgrind/main/helgrind/ |
| README_MSMProp2.txt | 38 segment contains a vector timestamp. The expression "HB(SS, currS)"
43 where happens_before(S,T) means that S's vector timestamp is ordered
44 before-or-equal to T's vector timestamp.
58 operation on vector clocks. Given the definition of HB,
68 update a single vector timestamp. The following two equivalences
73 adding a segment S join-ing S's vector timestamp
74 to the segment-set to the current vector timestamp
78 current vector timestamp )
92 where LS is a lockset (as before) and VTS is a vector timestamp.
155 vector-time that the next write / access may safely happen
[all...] |
| /frameworks/av/services/audiopolicy/ |
| AudioPolicyEffects.h | 27 #include <utils/Vector.h>
120 Vector <effect_param_t *> mParams;
132 Vector <EffectDesc *> mEffects;
141 // Enable or disable all effects in effect vector
147 Vector< sp<AudioEffect> >mEffects;
161 status_t loadEffects(cnode *root, Vector <EffectDesc *>& effects);
165 status_t loadInputEffectConfigurations(cnode *root, const Vector <EffectDesc *>& effects);
166 status_t loadStreamEffectConfigurations(cnode *root, const Vector <EffectDesc *>& effects);
167 EffectDescVector *loadEffectConfig(cnode *root, const Vector <EffectDesc *>& effects);
170 void loadEffectParameters(cnode *root, Vector <effect_param_t *>& params)
[all...] |
| /frameworks/base/tools/aapt/ |
| StringPool.h | 51 Vector<size_t> indices;
53 Vector<ResTable_config> configs;
78 Vector<entry_style_span> spans;
98 ssize_t add(const String16& value, const Vector<entry_style_span>& spans,
103 status_t addStyleSpans(size_t idx, const Vector<entry_style_span>& spans);
138 const Vector<size_t>* offsetsForString(const String16& val) const;
151 Vector<entry> mEntries;
158 Vector<size_t> mEntryArray;
161 Vector<entry_style> mEntryStyleArray;
171 Vector<size_t> mOriginalPosToNewPos
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/ |
| ctor_iterator.pass.cpp | 30 std::vector<double> iv = d.intervals();
34 std::vector<double> dn = d.densities();
44 std::vector<double> iv = d.intervals();
48 std::vector<double> dn = d.densities();
58 std::vector<double> iv = d.intervals();
62 std::vector<double> dn = d.densities();
72 std::vector<double> iv = d.intervals();
77 std::vector<double> dn = d.densities();
88 std::vector<double> iv = d.intervals();
94 std::vector<double> dn = d.densities()
[all...] |
| param_ctor_iterator.pass.cpp | 30 std::vector<double> iv = pa.intervals();
34 std::vector<double> dn = pa.densities();
45 std::vector<double> iv = pa.intervals();
49 std::vector<double> dn = pa.densities();
60 std::vector<double> iv = pa.intervals();
64 std::vector<double> dn = pa.densities();
75 std::vector<double> iv = pa.intervals();
80 std::vector<double> dn = pa.densities();
92 std::vector<double> iv = pa.intervals();
98 std::vector<double> dn = pa.densities()
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| equal_test.cpp | 1 #include <vector>
51 typedef vector <int> IntVec;
105 vector<Test> tv;
106 vector<Test>::iterator it;
107 pair<vector<Test>::iterator, vector<Test>::iterator> p;
141 vector <int> v1(10);
144 vector <int> v2(10);
153 vector <int> v1(10);
154 vector <int> v2(10)
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| equal_test.cpp | 1 #include <vector>
51 typedef vector <int> IntVec;
105 vector<Test> tv;
106 vector<Test>::iterator it;
107 pair<vector<Test>::iterator, vector<Test>::iterator> p;
141 vector <int> v1(10);
144 vector <int> v2(10);
153 vector <int> v1(10);
154 vector <int> v2(10)
[all...] |
| /art/compiler/sea_ir/debug/ |
| dot_gen.cc | 27 for (std::vector<Region*>::const_iterator cit = graph->GetRegions()->begin();
67 std::vector<InstructionNode*>* used_in = instruction->GetSSAConsumers();
68 for (std::vector<InstructionNode*>::const_iterator cit = used_in->begin();
77 std::vector<InstructionNode*> definition_edges = instruction->GetSSAProducers();
79 for (std::vector<InstructionNode*>::const_iterator
99 std::vector<InstructionNode*>* used_in = instruction->GetSSAConsumers();
100 for (std::vector<InstructionNode*>::const_iterator cit = used_in->begin();
127 std::vector<PhiInstructionNode*>* phi_instructions = region->GetPhiNodes();
128 for (std::vector<PhiInstructionNode*>::const_iterator cit = phi_instructions->begin();
132 std::vector<InstructionNode*>* instructions = region->GetInstructions()
[all...] |
| /external/chromium_org/media/formats/mp4/ |
| avc.cc | 8 #include <vector>
22 static bool ConvertAVCToAnnexBInPlaceForLengthSize4(std::vector<uint8>* buf) {
44 bool AVC::ConvertFrameToAnnexB(int length_size, std::vector<uint8>* buffer) {
50 std::vector<uint8> temp;
77 std::vector<uint8>* buffer,
78 std::vector<SubsampleEntry>* subsamples) {
89 std::vector<uint8>::iterator config_insert_point = buffer->begin();
90 std::vector<SubsampleEntry>::iterator subsamples_insert_point =
114 std::vector<uint8> param_sets;
115 std::vector<SubsampleEntry> config_subsamples
[all...] |
| /external/chromium_org/third_party/opus/src/silk/float/ |
| solve_LS_FLP.c | 37 * Matrix D (only the diagonal elements returned in a vector)such that
44 silk_float *Dinv /* I/O Pointer to vector holding the inverse diagonal elements of D */
54 const silk_float *b, /* I b Vector */
55 silk_float *x /* O x Vector */
65 const silk_float *b, /* I b Vector */
66 silk_float *x /* O x Vector */
76 const silk_float *b, /* I Pointer to b vector */
77 silk_float *x /* O Pointer to x solution vector */
115 const silk_float *b, /* I b Vector */
116 silk_float *x /* O x Vector */
[all...] |
| /external/chromium_org/ui/base/ime/ |
| remote_input_method_win.cc | 68 std::vector<int32> GetInputScopesAsInt(TextInputType text_input_type,
70 std::vector<int32> result;
71 // An empty vector represents |text_input_type| is TEXT_INPUT_TYPE_NONE.
75 const std::vector<InputScope>& input_scopes =
83 std::vector<gfx::Rect> GetCompositionCharacterBounds(
86 return std::vector<gfx::Rect>();
88 std::vector<gfx::Rect> bounds;
150 std::vector<int32> prev_input_scopes;
152 std::vector<gfx::Rect> prev_bounds;
213 std::vector<int32> prev_input_scopes
[all...] |
| /external/chromium_org/ui/gfx/ |
| font_list_impl.cc | 19 std::vector<std::string>* font_names,
26 std::vector<std::string> styles_size;
62 std::string BuildFontDescription(const std::vector<std::string>& font_names,
85 FontListImpl::FontListImpl(const std::vector<std::string>& font_names,
98 FontListImpl::FontListImpl(const std::vector<Font>& fonts)
124 // If there is a font vector, derive from that.
126 std::vector<Font> fonts = fonts_;
133 std::vector<std::string> font_names;
191 const std::vector<Font>& FontListImpl::GetFonts() const {
195 std::vector<std::string> font_names
[all...] |
| /external/libopus/silk/float/ |
| solve_LS_FLP.c | 37 * Matrix D (only the diagonal elements returned in a vector)such that
44 silk_float *Dinv /* I/O Pointer to vector holding the inverse diagonal elements of D */
54 const silk_float *b, /* I b Vector */
55 silk_float *x /* O x Vector */
65 const silk_float *b, /* I b Vector */
66 silk_float *x /* O x Vector */
76 const silk_float *b, /* I Pointer to b vector */
77 silk_float *x /* O Pointer to x solution vector */
115 const silk_float *b, /* I b Vector */
116 silk_float *x /* O x Vector */
[all...] |
| /external/libvorbis/doc/ |
| 06-floor0.tex | 60 3) [coefficients] is an empty, zero length vector
64 7) vector [temp_vector] = read vector from bitstream using codebook number [floor0_book_list] element [booknumber] in VQ context.
65 8) add the scalar value [last] to each scalar in vector [temp_vector]
66 9) [last] = the value of the last scalar in vector [temp_vector]
67 10) concatenate [temp_vector] onto the end of the [coefficients] vector
68 11) if (length of vector [coefficients] is less than [floor0_order], continue at step 6
89 \item The number of scalars read into the vector \varname{[coefficients]}
107 vector from packet decode as well as the [floor0_order],
110 vector size \varname{[n]} specified by the decode process, we compute
[all...] |
| /prebuilts/clang/linux-x86/host/3.4/bin/ |
| clang-tblgen | |
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| NodeSorter.java | 24 import java.util.Vector;
44 /** Vector of NodeSortKeys */
45 Vector m_keys; // vector of NodeSortKeys
65 * Given a vector of nodes, sort each node according to
67 * @param v an vector of Nodes.
68 * @param keys a vector of NodeSortKeys.
73 public void sort(DTMIterator v, Vector keys, XPathContext support)
86 // Create a vector of node compare elements
87 // based on the input vector of node
[all...] |
| /external/chromium_org/content/browser/indexed_db/ |
| indexed_db_callbacks.cc | 90 void IndexedDBCallbacks::OnSuccess(const std::vector<base::string16>& value) {
99 std::vector<base::string16> list;
221 const std::vector<IndexedDBBlobInfo>& blob_info,
222 std::vector<IndexedDBMsg_BlobOrFileInfo>* blob_or_file_info,
242 const std::vector<IndexedDBBlobInfo>& blob_info,
243 std::vector<IndexedDBMsg_BlobOrFileInfo>* blob_or_file_info) {
252 const std::vector<IndexedDBValue>& values) {
256 std::vector<IndexedDBValue>::const_iterator value_iter;
257 std::vector<std::vector<IndexedDBMsg_BlobOrFileInfo> >::iterator blob_iter
[all...] |
| /external/flac/libFLAC/ppc/as/ |
| lpc_asm.s | 88 vsro v18,v18,v0 ; v18: mask vector
98 vsel v0,v1,v0,v2 ; v0: reversal permutation vector
101 lvsl v17,0,r5 ; v17: coefficient alignment permutation vector
102 vperm v17,v17,v17,v0 ; v17: reversal coefficient alignment permutation vector
105 lvsl v16,0,r11 ; v16: history alignment permutation vector
221 vspltish v16,0 ; v16: zero vector
224 lvsr v17,r10,r8 ; v17: result shift vector
225 lvsl v18,r10,r3 ; v18: residual shift back vector
229 lvewx v19,r10,r9 ; v19: lp_quantization vector
232 vmulosh v20,v0,v8 ; v20: sum vector
[all...] |
| /external/flac/libFLAC/ppc/gas/ |
| lpc_asm.s | 90 vsro v18,v18,v0 # v18: mask vector
100 vsel v0,v1,v0,v2 # v0: reversal permutation vector
103 lvsl v17,0,r5 # v17: coefficient alignment permutation vector
104 vperm v17,v17,v17,v0 # v17: reversal coefficient alignment permutation vector
107 lvsl v16,0,r11 # v16: history alignment permutation vector
223 vspltish v16,0 # v16: zero vector
226 lvsr v17,r10,r8 # v17: result shift vector
227 lvsl v18,r10,r3 # v18: residual shift back vector
231 lvewx v19,r10,r9 # v19: lp_quantization vector
234 vmulosh v20,v0,v8 # v20: sum vector
[all...] |
| /external/icu/icu4c/source/common/ |
| uvector.h | 24 * <p>Ultralightweight C++ implementation of a <tt>void*</tt> vector
25 * that is (mostly) compatible with java.util.Vector.
30 * its purpose (porting code from java that uses java.util.Vector)
31 * well, and it could be easily made into a more robust vector class.
45 * check after each call on each vector when doing many operations on
53 * pointer is released by the vector, either when the vector itself is
64 * vector contains no element. That is, indexOf() will always return
110 * Compare this vector with another. They will be considered
122 // java.util.Vector AP
[all...] |
| /external/ceres-solver/examples/ |
| libmv_bundle_adjuster.cc | 58 // - Camera translation, 3-component vector of float values.
66 // - 3D position vector, 3-component vector of float values.
75 // - 2D marker position vector, (two float values).
94 #include <vector>
120 using std::vector;
133 // t is a translation vector representing its positions.
203 EuclideanCamera *CameraForImage(vector<EuclideanCamera> *all_cameras,
216 const vector<EuclideanCamera> &all_cameras,
229 int MaxImage(const vector<Marker> &all_markers)
[all...] |
| /external/ceres-solver/internal/ceres/ |
| problem_impl.cc | 40 #include <vector>
139 // sync with the position of the parameter in the program's parameter vector.
241 const vector<double*>& parameter_blocks) {
247 const vector<int32>& parameter_block_sizes =
256 vector<double*> sorted_parameter_blocks(parameter_blocks);
258 vector<double*>::const_iterator duplicate_items =
274 vector<ParameterBlock*> parameter_block_ptrs(parameter_blocks.size());
322 vector<double*> residual_parameters;
331 vector<double*> residual_parameters;
341 vector<double*> residual_parameters
[all...] |
| /external/chromium_org/ui/base/dragdrop/ |
| os_exchange_data_provider_aurax11.cc | 101 std::vector<Atom>* targets) const {
148 std::vector<unsigned char> data;
182 std::vector<FileInfo> data;
188 const std::vector<FileInfo>& filenames) {
189 std::vector<std::string> paths;
190 for (std::vector<FileInfo>::const_iterator it = filenames.begin();
210 std::vector<unsigned char> bytes;
226 std::vector< ::Atom> text_atoms = ui::GetTextAtomsFrom(&atom_cache_);
227 std::vector< ::Atom> requested_types;
244 std::vector< ::Atom> url_atoms = ui::GetURLAtomsFrom(&atom_cache_)
[all...] |
| /build/tools/atree/ |
| atree.cpp | 16 vector<string> g_listFiles;
17 vector<string> g_inputBases;
191 for (vector<string>::iterator it=g_listFiles.begin();
195 for (vector<string>::iterator it=g_inputBases.begin();
205 vector<FileRecord> files;
206 vector<FileRecord> more;
207 vector<string> excludes;
212 for (vector<string>::iterator it=g_listFiles.begin();
222 for (vector<FileRecord>::iterator it=files.begin();
228 for (vector<FileRecord>::iterator it=files.begin()
[all...] |
| files.cpp | 62 split_line(const char* p, vector<string>* out)
114 add_file(vector<FileRecord>* files, const FileOpType fileOp,
180 vector<FileRecord>* files,
181 vector<string>* excludes)
257 vector<string> words;
272 for (vector<string>::iterator it = words.begin(); it != words.end(); ++it) {
331 locate(FileRecord* rec, const vector<string>& search)
343 for (vector<string>::const_iterator it=search.begin();
394 const FileRecord& rec, vector<FileRecord>*more)
412 matches_excludes(const char* file, const vector<string>& excludes
[all...] |
