| /external/srec/tools/grxmlcompile/ |
| sub_supp.cpp | 206 int rix, rix_low, rix_high, direction; local
211 rix= (rix_high + rix_low) >> 1;
212 direction= element - arc[forwardList[rix]]->GetFromId();
214 rix_high= rix;
216 rix_low= rix;
218 assert (arc[forwardList[rix]]->GetFromId() == element);
219 while (rix > 0 && arc[forwardList[rix-1]]->GetFromId() == element)
220 rix--;
221 assert (arc[forwardList[rix]]->GetFromId() == element)
311 int rix, rix_low, rix_high, direction; local
423 int rix, lastRix; local
[all...] |
| sub_grph.cpp | 473 int rix; local
476 rix= FindFromIndex (currId);
477 if (rix < 0)
479 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == currId) {
480 if (arc[forwardList[rix]]->GetInput() == procLabel) {
481 PullUpBegins (arc[forwardList[rix]]->GetToId(), baseId,
484 else if (arc[forwardList[rix]]->GetInput() != DISCARD_LABEL)
485 InheritArc (arc[forwardList[rix]], baseId);
486 rix++
494 int rix, nextId; local
545 int rix; local
566 int rix, nextId; local
708 int count, rix, lastInput; local
781 int rix; local
805 int rix, nextId; local
[all...] |
| sub_min.cpp | 49 int rix; local
52 rix= FindFromIndex (currId);
53 if (rix < 0)
55 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) {
56 arc[forwardList[rix]]->Print();
57 rix++;
159 int rix, rixBegin, nextId; local
163 rixBegin= rix= FindFromIndex (currId);
164 if (rix < 0
489 int rix; local
514 int rix; local
[all...] |
| sub_phon.cpp | 112 int ii, rix, currId, leftC; local
119 rix= FindToIndex (currId);
120 if (rix >= 0) {
121 leftC= arc[backwardList[rix]]->GetCentre();
135 int ii, rix, currId, rightC; local
142 rix= FindFromIndex (currId);
143 if (rix >= 0) {
144 rightC= arc[forwardList[rix]]->GetCentre();
337 int rix; local
339 rix= FindToIndex (currId)
358 int ii, currId, rix; local
440 int ii, rix, newId, intId, count; local
[all...] |
| sub_base.cpp | 177 int rix, nextId, nextInp; local
183 rix= FindToIndex (startId);
184 if (rix < 0)
186 while (rix < numArc && arc[backwardList[rix]]->GetToId() == startId) {
187 nextId= arc[backwardList[rix]]->GetFromId();
188 nextInp= arc[backwardList[rix]]->GetInput();
191 rix++;
198 int rix, nextId, nextInp; local
204 rix= FindFromIndex (startId)
[all...] |
| /dalvik/vm/compiler/template/mips/ |
| header.S | 190 #define GET_VREG(rd, rix) LOAD_eas2(rd,rFP,rix)
192 #define GET_VREG_F(rd, rix) EAS2(AT, rFP, rix); \
195 #define SET_VREG(rd, rix) STORE_eas2(rd, rFP, rix)
197 #define SET_VREG_GOTO(rd, rix, dst) .set noreorder; \
200 sll t8, rix, 2; \
206 #define SET_VREG_F(rd, rix) EAS2(AT, rFP, rix); \
[all...] |
| /dalvik/vm/mterp/mips/ |
| header.S | 120 #define GET_VREG(rd, rix) LOAD_eas2(rd, rFP, rix)
122 #define GET_VREG_F(rd, rix) EAS2(AT, rFP, rix); \
125 #define SET_VREG(rd, rix) STORE_eas2(rd, rFP, rix)
127 #define SET_VREG_GOTO(rd, rix, dst) .set noreorder; \
130 sll t8, rix, 2; \
136 #define SET_VREG_F(rd, rix) EAS2(AT, rFP, rix); \
[all...] |
| /dalvik/vm/compiler/template/out/ |
| CompilerTemplateAsm-mips.S | 197 #define GET_VREG(rd, rix) LOAD_eas2(rd,rFP,rix)
199 #define GET_VREG_F(rd, rix) EAS2(AT, rFP, rix); \
202 #define SET_VREG(rd, rix) STORE_eas2(rd, rFP, rix)
204 #define SET_VREG_GOTO(rd, rix, dst) .set noreorder; \
207 sll t8, rix, 2; \
213 #define SET_VREG_F(rd, rix) EAS2(AT, rFP, rix); \
[all...] |
| /dalvik/vm/mterp/out/ |
| InterpAsm-mips.S | 127 #define GET_VREG(rd, rix) LOAD_eas2(rd, rFP, rix)
129 #define GET_VREG_F(rd, rix) EAS2(AT, rFP, rix); \
132 #define SET_VREG(rd, rix) STORE_eas2(rd, rFP, rix)
134 #define SET_VREG_GOTO(rd, rix, dst) .set noreorder; \
137 sll t8, rix, 2; \
143 #define SET_VREG_F(rd, rix) EAS2(AT, rFP, rix); \
[all...] |
