HomeSort by relevance Sort by last modified time
    Searched refs:nd (Results 26 - 50 of 130) sorted by null

12 3 4 5 6

  /external/openfst/src/include/fst/
shortest-distance.h 199 Weight &nd = (*distance_)[arc.nextstate]; local
202 if (!ApproxEqual(nd, Plus(nd, w), delta_)) {
203 nd = Plus(nd, w);
205 if (!nd.Member() || !nr.Member()) {
shortest-path.h 166 Weight &nd = (*distance)[arc.nextstate]; local
168 if (nd != Plus(nd, w)) {
169 nd = Plus(nd, w);
170 if (!nd.Member()) {
  /external/linux-tools-perf/util/
hist.c 744 struct rb_node *nd; local
846 for (nd = rb_first(&self->entries); nd; nd = rb_next(nd)) {
847 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
924 struct rb_node *nd; local
930 for (nd = rb_first(&self->entries); nd; nd = rb_next(nd))
947 struct rb_node *nd; local
    [all...]
header.c 199 struct rb_node *nd; local
205 for (nd = rb_first(&session->machines); nd; nd = rb_next(nd)) {
206 struct machine *pos = rb_entry(nd, struct machine, rb_node);
347 struct rb_node *nd; local
358 for (nd = rb_first(&session->machines); nd; nd = rb_next(nd))
374 struct rb_node *nd; local
    [all...]
  /external/qemu/hw/
qdev.h 24 NICInfo *nd; member in struct:DeviceState
54 void qdev_set_netdev(DeviceState *dev, NICInfo *nd);
pc.c 812 static void pc_init_ne2k_isa(NICInfo *nd, qemu_irq *pic)
818 isa_ne2000_init(ne2000_io[nb_ne2k], pic[ne2000_irq[nb_ne2k]], nd);
1157 NICInfo *nd = &nd_table[i]; local
1159 if (!pci_enabled || (nd->model && strcmp(nd->model, "ne2k_isa") == 0)
    [all...]
  /system/core/libpixelflinger/
fixed.cpp 180 int nd = gglClz(d) - gglClz(n); local
181 i += nd + 1;
182 if (nd > 0) d <<= nd; local
183 else n <<= -nd;
  /external/chromium/base/third_party/dmg_fp/
dtoa.cc 485 BCinfo { int dp0, dp1, dplen, dsign, e0, inexact, nd, nd0, rounding, scale, uflchk; }; member in struct:dmg_fp::BCinfo
662 (s, nd0, nd, y9, dplen) CONST char *s; int nd0, nd, dplen; ULong y9; member in namespace:dmg_fp
664 (CONST char *s, int nd0, int nd, ULong y9, int dplen)
671 x = (nd + 8) / 9;
692 for(; i < nd; i++)
2235 int b2, bbits, d2, dd, dig, dsign, i, j, nd, nd0, p2, p5, speccase; variable
2433 int esign, i, j, k, nd, nd0, nf, nz, nz0, sign; variable
    [all...]
  /external/sonivox/arm-hybrid-22k/lib_src/
ARM-E_mastergain_gnu.s 75 LDR r5, [pnInputBuffer], #4 @fetch 2nd output sample
92 STRH r5, [pnOutputBuffer], #NEXT_OUTPUT_PCM @save 2nd output sample
  /external/sonivox/arm-wt-22k/lib_src/
ARM-E_mastergain_gnu.s 75 LDR r5, [pnInputBuffer], #4 @fetch 2nd output sample
92 STRH r5, [pnOutputBuffer], #NEXT_OUTPUT_PCM @save 2nd output sample
  /external/srec/srec/include/
srec_context.h 219 #define FST_GetNodeInfo(cn,nd) (cn->FSMnode_info_list[nd])
  /external/webkit/Source/JavaScriptCore/wtf/
dtoa.cpp 233 static void s2b(BigInt& b, const char* s, int nd0, int nd, uint32_t y9)
248 for (; i < nd; i++)
752 e, e1, esign, i, j, k, nd, nd0, nf, nz, nz0, sign; local
793 for (nd = nf = 0; (c = *s) >= '0' && c <= '9'; nd++, s++)
794 if (nd < 9)
796 else if (nd < 16)
798 nd0 = nd;
801 if (!nd) {
818 if (nd++ < 9
    [all...]
  /external/kernel-headers/original/linux/
mount.h 90 extern int do_add_mount(struct vfsmount *newmnt, struct nameidata *nd,
  /external/openssl/crypto/bn/
bn_div.c 70 int i,nm,nd;
97 nd=BN_num_bits(d);
108 if (!BN_lshift(D,D,nm-nd)) goto end;
109 for (i=nm-nd; i>=0; i--)
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
shortest-path.h 123 Weight &nd = (*distance)[arc.nextstate]; local
125 if (nd != Plus(nd, w)) {
126 nd = Plus(nd, w);
  /bionic/libc/stdlib/
strtod.c 523 (s, nd0, nd, y9) CONST char *s; int nd0, nd; ULong y9;
525 (CONST char *s, int nd0, int nd, ULong y9)
532 x = (nd + 8) / 9;
558 for(; i < nd; i++)
1340 e, e1, esign, i, j, k, nd, nd0, nf, nz, nz0, sign; local
1421 for(nd = nf = 0; (c = *s) >= '0' && c <= '9'; nd++, s++)
1422 if (nd < 9)
1424 else if (nd < 16
    [all...]
  /external/llvm/include/llvm/CodeGen/PBQP/
HeuristicSolver.h 238 NodeData &nd = getSolverNodeData(xnItr); local
239 assert(nd.getSolverDegree() == 1 &&
242 Graph::EdgeItr eItr = *nd.solverEdgesBegin();
276 assert(nd.getSolverDegree() == 0 &&
290 NodeData &nd = getSolverNodeData(xnItr); local
293 SolverEdgeItr aeItr = nd.solverEdgesBegin();
  /ndk/sources/cxx-stl/llvm-libc++/src/
debug.cpp 482 for (__i_node* nd = __ibeg_[h]; nd != nullptr; nd = nd->__next_)
484 if (nd->__i_ == __i)
486 r = nd;
  /external/smack/src/org/jivesoftware/smackx/provider/
VCardProvider.java 284 Node nd = childNodes.item(i); local
285 String nodeValue = nd.getNodeValue();
289 appendText(result, nd);
  /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
RewriteRuleSubtreeStream.js 11 * children; e.g., ^(type ID)+ adds ID to type and then 2nd iteration
  /external/openssl/crypto/bn/asm/
sparcv9a-mont.pl 110 $na="%f8"; $nb="%f10"; $nc="%f12"; $nd="%f14";
220 ldda [%sp+$bias+$frame+0]%asi,$nd
230 fxtod $nd,$nd
241 fmuld $nlo,$nd,$nlod
253 fmuld $nhi,$nd,$nhid
311 fmuld $nlo,$nd,$nlod
336 fmuld $nhi,$nd,$nhid
399 fmuld $nlo,$nd,$nlod
422 fmuld $nhi,$nd,$nhi
    [all...]
  /external/grub/stage2/
gunzip.c 929 unsigned nd; /* number of distance codes */ local
943 nd = 1 + ((unsigned) b & 0x1f); /* number of distance codes */
948 if (nl > 286 || nd > 30)
973 n = nl + nd;
1048 if ((i = huft_build (ll + nl, nd, 0, cpdist, cpdext, &td, &bd)) != 0)
    [all...]
  /external/qemu/
net-android.c 2212 NICInfo *nd; local
    [all...]
net.c 2108 NICInfo *nd; local
    [all...]
  /external/ipsec-tools/src/racoon/
isakmp_inf.c 137 struct isakmp_gen *nd;
196 if (msg->l < sizeof(*isakmp) + ntohs(gen->len) + sizeof(*nd)) {
204 nd = (struct isakmp_gen *) ((caddr_t) gen + ntohs(gen->len));
206 /* nd length check */
207 if (ntohs(nd->len) > msg->l - (sizeof(struct isakmp) +
214 if (ntohs(nd->len) < sizeof(*nd)) {
220 payload = vmalloc(ntohs(nd->len));
227 memcpy(payload->v, (caddr_t) nd, ntohs(nd->len))
136 struct isakmp_gen *nd; local
    [all...]

Completed in 946 milliseconds

12 3 4 5 6