| /external/libopus/src/ |
| repacketizer_demo.c | 67 int merge = 1, split=0; local
76 if (strcmp(argv[i], "-merge")==0)
78 merge = atoi(argv[i+1]);
79 if(merge<1)
81 fprintf(stderr, "-merge parameter must be at least 1.\n");
84 if(merge>48)
86 fprintf(stderr, "-merge parameter must be less than 48.\n");
117 int nb_packets=merge;
|
| /external/owasp/sanitizer/tools/findbugs/lib/ |
| asm-analysis-3.3.jar | |
| /external/fio/lib/ |
| flist_sort.c | 10 * to chaining of merge() calls: null-terminated, no reserved or
13 static struct flist_head *merge(void *priv, function
36 * Combine final list merge with restoration of standard doubly-linked
37 * list structure. This approach duplicates code from merge(), but
88 * This function implements "merge sort", which has O(nlog(n))
120 cur = merge(priv, cmp, part[lev], cur);
137 list = merge(priv, cmp, part[lev], list);
|
| /dalvik/dx/src/com/android/dx/cf/code/ |
| OneLocalsArray.java | 190 public LocalsArray merge(LocalsArray other) { method in class:OneLocalsArray
192 return merge((OneLocalsArray)other);
194 // LocalsArraySet knows how to merge me.
195 return other.merge(this);
201 * instance. A more-refined version of {@link #merge(LocalsArray) merge}
204 * @param other locals array with which to merge
205 * @return this instance if merge was a no-op, or a new instance if
206 * the merge resulted in a change.
208 public OneLocalsArray merge(OneLocalsArray other) method in class:OneLocalsArray
[all...] |
| LocalsArraySet.java | 253 * @param other {@code non-null;} to merge
254 * @return {@code non-null;} this instance if merge was a no-op, or
262 newPrimary = primary.merge(other.getPrimary());
282 resultla = la1.merge(la2);
304 * @param other {@code non-null;} to merge
305 * @return {@code non-null;} this instance if merge was a no-op, or
313 newPrimary = primary.merge(other.getPrimary());
323 resultla = la.merge(other);
344 public LocalsArraySet merge(LocalsArray other) { method in class:LocalsArraySet
389 newPrimary = primary.merge(other.getPrimary())
[all...] |
| LocalsArray.java | 155 * @return {@code non-null;} the merge result, a new instance or this
157 public abstract LocalsArray merge(LocalsArray other); method in class:LocalsArray
166 * @return {@code non-null;} the merge result, a new instance or this
|
| /external/chromium_org/third_party/WebKit/Source/core/inspector/ |
| InspectorHistory.h | 56 virtual void merge(PassRefPtrWillBeRawPtr<Action>);
|
| InspectorHistory.cpp | 84 void InspectorHistory::Action::merge(PassRefPtrWillBeRawPtr<Action>) function in class:blink::InspectorHistory::Action
96 m_history[m_afterLastActionIndex - 1]->merge(action);
|
| /external/mockito/cglib-and-asm/src/org/mockito/asm/tree/analysis/ |
| Interpreter.java | 166 * Merges two values. The merge operation must return a value that
177 Value merge(Value v, Value w);
method in interface:Interpreter
|
| /external/mockito/cglib-and-asm/src/org/mockito/cglib/util/ |
| SorterTemplate.java | 96 merge(lo, mid, hi, mid - lo, hi - mid); method
99 private void merge(int lo, int pivot, int hi, int len1, int len2) { method in class:SorterTemplate
124 merge(lo, first_cut, new_mid, len11, len22); method
125 merge(new_mid, second_cut, hi, len1 - len11, len2 - len22); method
|
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| Analyzer.java | 194 // Merge the state before the jsr into the next instruction
197 merge(queue, frame, lookAhead(iter, pos)); method
200 merge(queue, frame, target); method
203 merge(queue, frame, lookAhead(iter, pos)); method
206 // Merge all exceptions that are reachable from this instruction.
276 private void merge(IntQueue queue, Frame frame, int target) { method in class:Analyzer
284 changed = old.merge(frame);
301 merge(queue, newFrame, exception.handler); method
328 newType = oldType.merge(newType);
350 merge(queue, frame, pos + iter.s32bitAt(index)) method
357 merge(queue, frame, target); method
404 merge(queue, frame, pos + iter.s32bitAt(index)); method
412 merge(queue, frame, target); method
[all...] |
| Frame.java | 175 * @param frame the frame to merge the stack from
186 Type merged = prev.merge(frame.stack[i]);
205 * @param frame the frame to merge with
206 * @return true if any changes to this frame where made by this merge
208 public boolean merge(Frame frame) { method in class:Frame
215 Type merged = prev.merge(frame.locals[i]);
|
| /external/emma/core/java12/com/vladium/emma/rt/ |
| RTExitHook.java | 105 RTExitHook (final Class RT, final ICoverageData cdata, final File outFile, final boolean merge)
111 m_merge = merge;
|
| /external/chromium_org/v8/src/compiler/ |
| change-lowering.cc | 113 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); local
116 true_value, false_value, merge);
153 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); local
155 smi, merge);
179 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); local
182 change, number, merge);
203 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false) local
231 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); local
[all...] |
| /external/iproute2/tc/ |
| m_xt_old.c | 96 struct option *merge; local
104 merge = malloc(sizeof (struct option) * (num_new + num_old + 1));
105 memcpy(merge, oldopts, num_old * sizeof (struct option));
107 merge[num_old + i] = newopts[i];
108 merge[num_old + i].val += *option_offset;
110 memset(merge + num_old + num_new, 0, sizeof (struct option));
112 return merge;
|
| /build/tools/releasetools/ |
| rangelib.py | 131 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
149 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
168 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
188 for p, d in heapq.merge(zip(self.data, itertools.cycle((+1, -1))),
229 for p, d in heapq.merge(zip(self.data, itertools.cycle((-5, +5))),
|
| /dalvik/dx/junit-tests/com/android/dx/util/ |
| ListIntSetTest.java | 118 setA.merge(setB);
145 setA.merge(setB);
172 setA.merge(setB);
|
| /external/chromium_org/v8/tools/ |
| v8-info.sh | 123 git cherry -v svn/trunk svn/$1 | while read merge; do
124 h=$(echo $merge | cut -d" " -f2)
126 merges=$(echo $merge | grep -o "r[0-9]\+")
|
| /external/emma/ant/ant14/com/vladium/emma/instr/ |
| FilterCfg.java | 45 final String [] specs = Strings.merge (new String [] {value}, COMMA_DELIMITERS, true);
73 final String [] specs = Strings.merge (new String [] {value}, COMMA_DELIMITERS, true);
95 final String [] specs = Strings.merge (new String [] {value}, COMMA_DELIMITERS, true);
|
| /dalvik/dx/etc/ |
| dexmerger | 89 exec java $javaOpts -cp "$jarpath" com.android.dx.merge.DexMerger "$@"
|
| /external/chromium_org/third_party/skia/src/pdf/ |
| SkPDFFont.h | 30 void merge(const SkPDFGlyphSet& usage);
60 void merge(const SkPDFGlyphSetMap& usage);
|
| /external/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
| Android.mk | 27 test_name := containers/sequences/forwardlist/forwardlist.ops/merge
28 test_src := merge.pass.cpp
|
| /external/libcxx/test/containers/sequences/list/list.ops/ |
| Android.mk | 27 test_name := containers/sequences/list/list.ops/merge
28 test_src := merge.pass.cpp
|
| /dalvik/dx/src/com/android/dx/merge/ |
| SortableType.java | 17 package com.android.dx.merge;
|
| /dalvik/dx/src/com/android/dx/ssa/back/ |
| InterferenceGraph.java | 85 set.merge(interference.get(reg));
|
