Searched defs:nd (Results 1 - 25 of 33) sorted by relevance

12

/external/fio/engines/
H A Dnull.c28 struct null_data *nd = (struct null_data *) td->io_ops_data; local
30 return nd->io_us[event];
37 struct null_data *nd = (struct null_data *) td->io_ops_data; local
41 ret = nd->events;
42 nd->events = 0;
50 struct null_data *nd = (struct null_data *) td->io_ops_data; local
52 if (!nd->events) {
54 io_u_mark_submit(td, nd->queued);
56 nd->events = nd
65 struct null_data *nd = (struct null_data *) td->io_ops_data; local
86 struct null_data *nd = (struct null_data *) td->io_ops_data; local
96 struct null_data *nd = (struct null_data *) malloc(sizeof(*nd)); local
[all...]
H A Dnet.c379 struct netio_data *nd = td->io_ops_data; local
381 return splice_io_u(io_u->file->fd, nd->pipes[1], io_u->xfer_buflen);
390 struct netio_data *nd = td->io_ops_data; local
392 return splice_io_u(nd->pipes[0], io_u->file->fd, len);
428 struct netio_data *nd = td->io_ops_data; local
430 return vmsplice_io_u(io_u, nd->pipes[0], len);
438 struct netio_data *nd = td->io_ops_data; local
440 return vmsplice_io_u(io_u, nd->pipes[1], io_u->xfer_buflen);
486 static void store_udp_seq(struct netio_data *nd, struct io_u *io_u) argument
496 us->seq = cpu_to_le64(nd
499 verify_udp_seq(struct thread_data *td, struct netio_data *nd, struct io_u *io_u) argument
529 struct netio_data *nd = td->io_ops_data; local
592 struct netio_data *nd = td->io_ops_data; local
650 struct netio_data *nd = td->io_ops_data; local
716 struct netio_data *nd = td->io_ops_data; local
831 struct netio_data *nd = td->io_ops_data; local
883 struct netio_data *nd = td->io_ops_data; local
918 struct netio_data *nd = td->io_ops_data; local
952 struct netio_data *nd = td->io_ops_data; local
1054 struct netio_data *nd = td->io_ops_data; local
1104 struct netio_data *nd = td->io_ops_data; local
1125 struct netio_data *nd = td->io_ops_data; local
1158 struct netio_data *nd = td->io_ops_data; local
1274 struct netio_data *nd = td->io_ops_data; local
1349 struct netio_data *nd = td->io_ops_data; local
1365 struct netio_data *nd; local
1393 struct netio_data *nd; local
[all...]
/external/clang/test/SemaCXX/
H A Dcopy-assignment.cpp64 D d, nd; local
91 nd = d;
92 nd += d;
93 nd += constD;
H A Dcxx0x-deleted-default-ctor.cpp69 no_default nd; // expected-note {{field 'nd' has a deleted default constructor}} member in struct:bad_field_default
77 no_dtor nd; // expected-note {{field 'nd' has a deleted destructor}} member in struct:bad_field_dtor
111 no_default nd; // expected-note {{because field 'nd' has a deleted default constructor}} member in struct:defaulted_delete
117 no_default nd; // expected-note {{because field 'nd' has a deleted default constructor}} member in struct:late_delete
/external/squashfs-tools/kernel/fs/squashfs/
H A Dnamei.c136 struct nameidata *nd)
135 squashfs_lookup(struct inode *dir, struct dentry *dentry, struct nameidata *nd) argument
/external/dtc/
H A Ddata.c41 struct data nd; local
47 nd = d;
54 nd.val = xrealloc(d.val, newsize);
56 return nd;
/external/freetype/src/gzip/
H A Dinftrees.c327 local int inflate_trees_dynamic( /* nl, nd, c, bl, bd, tl, td, hp, z) */ argument
329 uInt nd, /* number of distance codes */
363 r = huft_build(c + nl, nd, 0, cpdist, cpdext, td, bd, hp, &hn, v);
/external/iw/
H A Dwowlan.c186 struct nlattr *nd; local
189 nd = nla_nest_start(msg, NL80211_WOWLAN_TRIG_NET_DETECT);
190 if (!nd)
195 nla_nest_end(msg, nd);
387 *nd[NUM_NL80211_ATTR], *tb[NUM_NL80211_ATTR]; local
391 nla_parse(nd, NUM_NL80211_ATTR,
395 if (nd[NL80211_ATTR_SCHED_SCAN_INTERVAL])
397 nla_get_u32(nd[NL80211_ATTR_SCHED_SCAN_INTERVAL]));
399 if (nd[NL80211_ATTR_SCHED_SCAN_DELAY])
401 nla_get_u32(nd[NL80211_ATTR_SCHED_SCAN_DELA
[all...]
/external/ltp/testcases/kernel/fs/scsi/ltpfs/
H A DLtpfsCmds.c65 int path_lookup(const char *name, unsigned int flags, struct nameidata *nd);
66 //static int __emul_lookup_dentry(const char *name, struct nameidata *nd);
67 void path_release(struct nameidata *nd);
263 struct nameidata nd; local
269 error = path_lookup(path, LOOKUP_FOLLOW, &nd);
273 inode = nd.dentry->d_inode;
278 if (nd.mnt->mnt_flags & MNT_NODEV)
286 path_release(&nd);
/external/python/cpython2/Lib/idlelib/idle_test/
H A Dtest_calltips.py94 s = 'a\nb\nc\nd\n'
146 def nd(s): pass function in function:Get_signatureTest.test_no_docstring
147 TC.nd = nd
148 self.assertEqual(signature(nd), "(s)")
149 self.assertEqual(signature(TC.nd), "(s)")
150 self.assertEqual(signature(tc.nd), "()")
/external/syslinux/memdisk/
H A Dinflate.c702 unsigned nd; /* number of distance codes */ local
722 nd = 1 + ((unsigned)b & 0x1f); /* number of distance codes */
728 if (nl > 288 || nd > 32)
730 if (nl > 286 || nd > 30)
758 n = nl + nd;
823 if ((i = huft_build(ll + nl, nd, 0, cpdist, cpdext, &td, &bd)) != 0) {
/external/gemmlowp/test/
H A Dcorrectness_meta_gemm.cc214 void q_suite(int mi, int ni, int ki, int mx, int nx, int kx, int md, int nd, argument
219 for (int n = ni; n < nx; n += nd) {
228 void f_suite(int mi, int ni, int ki, int mx, int nx, int kx, int md, int nd, argument
233 for (int n = ni; n < nx; n += nd) {
242 void i32_suite(int mi, int ni, int ki, int mx, int nx, int kx, int md, int nd, argument
247 for (int n = ni; n < nx; n += nd) {
/external/ipsec-tools/src/racoon/
H A Disakmp_inf.c137 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
136 struct isakmp_gen *nd; local
[all...]
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/Heuristics/
H A DBriggs.h138 NodeData &nd = getHeuristicNodeData(nItr); local
140 nd.isHeuristic = true;
141 if (nd.isAllocable) {
142 nd.rnaItr = rnAllocableList.insert(rnAllocableList.end(), nItr);
144 nd.rnuItr = rnUnallocableList.insert(rnUnallocableList.end(), nItr);
261 NodeData &nd = getHeuristicNodeData(nItr); local
265 if (!nd.isHeuristic)
273 bool ndWasAllocable = nd.isAllocable;
279 nd.isHeuristic = false;
282 rnAllocableList.erase(nd
361 NodeData &nd = getHeuristicNodeData(nItr); local
388 NodeData &nd = getHeuristicNodeData(nItr); local
407 NodeData &nd = getHeuristicNodeData(nItr); local
413 NodeData &nd = getHeuristicNodeData(nItr); local
[all...]
/external/fsck_msdos/
H A Ddir.c280 struct dosDirEntry *d, *nd; local
287 for (d = rootDir; d; d = nd) {
288 if ((nd = d->child) != NULL) {
292 if (!(nd = d->next))
293 nd = d->parent;
/external/python/cpython2/Objects/
H A Dfuncobject.c491 Py_ssize_t nk, nd; local
496 nd = PyTuple_GET_SIZE(argdefs);
500 nd = 0;
527 k, nk, d, nd,
H A Dmemoryobject.c115 _strided_copy_nd(char *dest, char *src, int nd, Py_ssize_t *shape, argument
121 if (nd==0) {
124 else if (nd == 1) {
139 for (k=1; k<nd-1;k++) {
142 for (k=0; k<shape[nd-1]; k++) {
143 _strided_copy_nd(dest, src, nd-1, shape,
146 src += strides[nd-1];
157 for (k=1; k < nd; k++) {
161 _strided_copy_nd(dest, src, nd-1, shape+1,
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
H A DHeuristicSolver.h238 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();
/external/valgrind/coregrind/
H A Dm_wordfm.c139 static UWord size_avl_nonNull ( const AvlNode* nd )
141 return 1 + (nd->child[0] ? size_avl_nonNull(nd->child[0]) : 0)
142 + (nd->child[1] ? size_avl_nonNull(nd->child[1]) : 0);
502 AvlNode* avl_dopy ( const AvlNode* nd, argument
510 vg_assert(nd != NULL);
514 nyu->child[0] = nd->child[0];
515 nyu->child[1] = nd->child[1];
516 nyu->balance = nd
581 avl_free( AvlNode* nd, void(*kFin)(UWord), void(*vFin)(UWord), void(*dealloc)(void*) ) argument
927 AvlNode* nd; local
941 AvlNode* nd = bag->fm->root; local
[all...]
/external/dhcpcd-6.8.2/
H A Dif-bsd.c1453 struct in6_ndireq nd; local
1456 memset(&nd, 0, sizeof(nd));
1457 strlcpy(nd.ifname, ifp->name, sizeof(nd.ifname));
1458 if (ioctl(s, SIOCGIFINFO_IN6, &nd) == -1)
1461 return nd.ndi.flags & flag ? 1 : 0;
1463 oflags = nd.ndi.flags;
1465 nd.ndi.flags &= ~flag;
1467 nd
[all...]
H A Dipv6nd.c232 struct nd_opt_hdr *nd; local
245 nd = (struct nd_opt_hdr *)(state->rs + sizeof(*rs));
246 nd->nd_opt_type = ND_OPT_SOURCE_LINKADDR;
247 nd->nd_opt_len = (uint8_t)((ROUNDUP8(ifp->hwlen + 2)) >> 3);
248 memcpy(nd + 1, ifp->hwaddr, ifp->hwlen);
/external/ltp/testcases/kernel/mem/lib/
H A Dmem.c201 /* Using the 2nd,3rd node */
694 static void gather_node_cpus(char *cpus, long nd) argument
707 PATH_SYS_SYSTEM "/node/node%ld/cpu%d", nd, i);
783 void write_cpusets(long nd) argument
788 snprintf(buf, BUFSIZ, "%ld", nd);
791 gather_node_cpus(cpus, nd);
793 * If the 'nd' node doesn't contain any CPUs,
801 "using only CPU0", nd);
891 tst_brkm(TBROK | TERRNO, cleanup_fn, "2nd get_allowed_nodes");
/external/blktrace/btt/
H A Doutput.c165 unsigned long long nq, nd, blkmin, blkmax, total; member in struct:__anon617
216 merge_data.nd += dip->n_ds;
235 "TOTAL", merge_data.nq, merge_data.nd,
236 (float)merge_data.nq / (float)merge_data.nd,
238 merge_data.total / merge_data.nd,
/external/opencv/cv/src/
H A Dcvstereogc.cpp490 int mind = state->minDisparity, nd = state->numberOfDisparities, maxd = mind + nd; local
491 int k = MIN(MAX((nd + 2)/4, 3), nd);
/external/python/cpython2/Python/
H A Ddtoa.c290 int e0, nd, nd0, scale; member in struct:BCinfo
494 /* convert a string s containing nd decimal digits (possibly containing a
501 s2b(const char *s, int nd0, int nd, ULong y9) argument
507 x = (nd + 8) / 9;
515 if (nd <= 9)
525 for(; i < nd; i++) {
1378 given by the bd->nd digits of s0) * 10**e0
1380 bc->nd gives the total number of significant digits of s0. It will
1385 bc->nd.
1400 int b2, d2, dd, i, nd, nd local
1510 int esign, i, j, k, lz, nd, nd0, odd, sign; local
[all...]

Completed in 815 milliseconds

12