Home
last modified time | relevance | path

Searched refs:search (Results 1 – 164 of 164) sorted by relevance

/linux-4.1.27/arch/metag/tbx/
Dtbistring.c28 const TBISTR *search = start; in __TBIFindStr() local
45 if (!search) { in __TBIFindStr()
56 search = seg->pGAddr; in __TBIFindStr()
60 while (!search->Tag) in __TBIFindStr()
62 search = (const TBISTR *)((const char *)search + 8); in __TBIFindStr()
64 if (search->Tag == METAG_TBI_STRE) { in __TBIFindStr()
66 search = NULL; in __TBIFindStr()
70 if ((search->Len >= match_len) && in __TBIFindStr()
71 (!exact || (search->Len == match_len + 1)) && in __TBIFindStr()
72 (search->Tag != METAG_TBI_STRG)) { in __TBIFindStr()
[all …]
/linux-4.1.27/drivers/net/wireless/brcm80211/brcmfmac/
Dflowring.c53 struct brcmf_flowring_tdls_entry *search; in brcmf_flowring_is_tdls_mac() local
55 search = flow->tdls_entry; in brcmf_flowring_is_tdls_mac()
57 while (search) { in brcmf_flowring_is_tdls_mac()
58 if (memcmp(search->mac, mac, ETH_ALEN) == 0) in brcmf_flowring_is_tdls_mac()
60 search = search->next; in brcmf_flowring_is_tdls_mac()
380 struct brcmf_flowring_tdls_entry *search; in brcmf_flowring_detach() local
389 search = flow->tdls_entry; in brcmf_flowring_detach()
390 while (search) { in brcmf_flowring_detach()
391 remove = search; in brcmf_flowring_detach()
392 search = search->next; in brcmf_flowring_detach()
[all …]
/linux-4.1.27/net/netfilter/
Dnf_conntrack_amanda.c63 } search[] __read_mostly = { variable
116 search[SEARCH_CONNECT].ts); in amanda_help()
119 start += dataoff + search[SEARCH_CONNECT].len; in amanda_help()
122 search[SEARCH_NEWLINE].ts); in amanda_help()
128 off = skb_find_text(skb, start, stop, search[i].ts); in amanda_help()
131 off += start + search[i].len; in amanda_help()
202 for (i = 0; i < ARRAY_SIZE(search); i++) in nf_conntrack_amanda_fini()
203 textsearch_destroy(search[i].ts); in nf_conntrack_amanda_fini()
210 for (i = 0; i < ARRAY_SIZE(search); i++) { in nf_conntrack_amanda_init()
211 search[i].ts = textsearch_prepare(ts_algo, search[i].string, in nf_conntrack_amanda_init()
[all …]
Dnf_conntrack_ftp.c74 } search[IP_CT_DIR_MAX][2] = { variable
458 for (i = 0; i < ARRAY_SIZE(search[dir]); i++) { in help()
460 search[dir][i].pattern, in help()
461 search[dir][i].plen, in help()
462 search[dir][i].skip, in help()
463 search[dir][i].term, in help()
466 search[dir][i].getnum); in help()
475 search[dir][i].pattern); in help()
536 ret = nf_nat_ftp(skb, ctinfo, search[dir][i].ftptype, in help()
Dnf_conntrack_sip.c408 if (hdr->search) { in ct_sip_get_header()
409 dptr = ct_sip_header_search(dptr, limit, hdr->search, in ct_sip_get_header()
442 dptr = ct_sip_header_search(dptr, limit, hdr->search, hdr->slen); in ct_sip_next_header()
755 if (hdr->search) { in ct_sip_get_sdp_header()
756 dptr = ct_sdp_header_search(dptr, limit, hdr->search, in ct_sip_get_sdp_header()
/linux-4.1.27/Documentation/target/
Dtcm_mod_builder.py456 if process_fo == 0 and re.search('struct target_core_fabric_ops {', line):
464 if not re.search('\(\*', line):
472 if not re.search('\(\*', line):
537 if re.search('get_fabric_name', fo):
545 if re.search('get_fabric_proto_ident', fo):
574 if re.search('get_wwn', fo):
584 if re.search('get_tag', fo):
593 if re.search('get_default_depth', fo):
600 if re.search('get_pr_transport_id\)\(', fo):
639 if re.search('get_pr_transport_id_len\)\(', fo):
[all …]
/linux-4.1.27/drivers/md/bcache/
Drequest.c454 struct search { struct
478 struct search *s = container_of(cl, struct search, cl); in bch_cache_read_endio() argument
504 struct search *s = container_of(op, struct search, op); in cache_lookup_fn()
569 struct search *s = container_of(cl, struct search, iop.cl); in cache_lookup()
591 struct search *s = container_of(cl, struct search, cl); in request_endio()
601 static void bio_complete(struct search *s) in bio_complete()
613 static void do_bio_hook(struct search *s, struct bio *orig_bio) in do_bio_hook()
627 struct search *s = container_of(cl, struct search, cl); in search_free()
634 mempool_free(s, s->d->c->search); in search_free()
637 static inline struct search *search_alloc(struct bio *bio, in search_alloc()
[all …]
Dbset.c872 const struct bkey *search) in bset_search_write_set() argument
879 if (bkey_cmp(table_to_bkey(t, m), search) > 0) in bset_search_write_set()
892 const struct bkey *search) in bset_search_tree() argument
918 bfloat_mantissa(search, f))) >> 31); in bset_search_tree()
920 n = (bkey_cmp(tree_to_bkey(t, j), search) > 0) in bset_search_tree()
953 const struct bkey *search) in __bch_bset_search() argument
983 if (unlikely(bkey_cmp(search, &t->end) >= 0)) in __bch_bset_search()
986 if (unlikely(bkey_cmp(search, t->data->start) < 0)) in __bch_bset_search()
989 i = bset_search_tree(t, search); in __bch_bset_search()
994 i = bset_search_write_set(t, search); in __bch_bset_search()
[all …]
Dutil.h510 #define RB_SEARCH(root, search, member, cmp) \ argument
513 typeof(&(search)) this, ret = NULL; \
517 this = container_of(n, typeof(search), member); \
518 res = cmp(&(search), this); \
530 #define RB_GREATER(root, search, member, cmp) \ argument
533 typeof(&(search)) this, ret = NULL; \
537 this = container_of(n, typeof(search), member); \
538 res = cmp(&(search), this); \
Dbset.h333 const struct bkey *search) in bch_bset_search() argument
335 return search ? __bch_bset_search(b, t, search) : t->data->start; in bch_bset_search()
Dbcache.h218 struct search;
288 int (*cache_miss)(struct btree *, struct search *,
513 mempool_t *search; member
Dalloc.c534 const struct bkey *search, in pick_data_bucket() argument
541 if (!bkey_cmp(&ret->key, search)) in pick_data_bucket()
Dsuper.c1385 if (c->search) in cache_set_free()
1386 mempool_destroy(c->search); in cache_set_free()
1538 c->search = mempool_create_slab_pool(32, bch_search_cache); in bch_cache_set_alloc()
1539 if (!c->search) in bch_cache_set_alloc()
/linux-4.1.27/arch/alpha/kernel/
Dgct.c13 gct6_find_nodes(gct6_node *node, gct6_search_struct *search) in gct6_find_nodes() argument
25 for (wanted = search; in gct6_find_nodes()
40 status |= gct6_find_nodes(GCT_NODE_PTR(node->next), search); in gct6_find_nodes()
44 status |= gct6_find_nodes(GCT_NODE_PTR(node->child), search); in gct6_find_nodes()
/linux-4.1.27/scripts/coccinelle/free/
Dpci_free_consistent.cocci12 @search@
38 p1 << search.p1;
39 p2 << search.p2;
46 p1 << search.p1;
47 p2 << search.p2;
/linux-4.1.27/drivers/regulator/
Dof_regulator.c276 struct device_node *search, *child; in regulator_of_get_init_data() local
284 search = of_get_child_by_name(dev->of_node, in regulator_of_get_init_data()
287 search = dev->of_node; in regulator_of_get_init_data()
289 if (!search) { in regulator_of_get_init_data()
295 for_each_child_of_node(search, child) { in regulator_of_get_init_data()
326 of_node_put(search); in regulator_of_get_init_data()
/linux-4.1.27/drivers/w1/
DKconfig24 either due to automatic or requested search.
25 2. Userspace commands. Includes read/write and search/alarm search commands.
Dw1_io.c383 if (dev->bus_master->search) in w1_search_devices()
384 dev->bus_master->search(dev->bus_master->data, dev, in w1_search_devices()
Dw1.h174 void (*search)(void *, struct w1_master *, member
Dw1.c547 static W1_MASTER_ATTR_RW(search, S_IRUGO | S_IWUSR | S_IWGRP);
/linux-4.1.27/Documentation/w1/
Dw1.netlink9 is found either due to automatic or requested search.
29 device (search/alarm search)
47 W1_CMD_SEARCH - search command
48 W1_CMD_ALARM_SEARCH - alarm search command
96 W1 search and alarm search commands.
189 read/write/search commands for all master/slave devices found on the bus.
Dw1.generic83 w1_master_attempts - the number of times a search was attempted
85 - maximum number of slaves to search for at a time
100 generally only make sense when searching is disabled, as a search will
/linux-4.1.27/arch/alpha/lib/
Dstrchr.S21 zapnot a1, 1, a1 # e0 : zero extend the search character
23 sll a1, 8, t5 # e0 : replicate the search character
55 and t0, 0xf0, t2 # e0 : binary search for that set bit
Dev6-memchr.S42 # search til the end of the address space, we will overflow
57 addq $16, $5, $5 # E : Max search address
64 ldq_u $6, -1($5) # L : L U U L : eight or less bytes to search Latency=3
Dstrcat.S37 and $2, 0xf0, $3 # binary search for that set bit
Dmemchr.S45 # search til the end of the address space, we will overflow
67 ldq_u $6, -1($5) #-e1 : eight or less bytes to search
Dstrncat.S43 and $2, 0xf0, $3 # binary search for that set bit
Dstrrchr.S70 and t8, 0xf0, t2 # e0 : binary search for the high bit set
/linux-4.1.27/scripts/
Dheaderdep.pl75 sub search { subroutine
95 my $path = search($header);
Dcheckkconfigsymbols.py219 if not REGEX_FILTER_FEATURES.search(feature):
Dspelling.txt848 scarch||search
849 seach||search
/linux-4.1.27/lib/
Dinterval_tree_test.c18 search(unsigned long query, struct rb_root *root) in search() function
83 results += search(queries[j], &root); in interval_tree_test_init()
DKconfig363 it is being modified. It is also reasonably quick to search and
/linux-4.1.27/Documentation/security/
Dkeys-request-key.txt103 search notes that the session keyring has auth key V in its bottom level.
105 This will permit it to then search the keyrings of process A with the
152 A search of any particular keyring proceeds in the following fashion:
156 if this denies permission, it doesn't search further.
161 not, the search continues, and the error code is retained if of higher
201 EACCES/EPERM are only returned on a direct search of a specific keyring where
Dkeys.txt11 kernel service can search for relevant keys.
43 - A description (for matching a key in a search).
200 (*) There's a kernel interface by which services can register types and search
203 (*) There's a way for the a search done from the kernel to call back to
236 only recurse into nested keyrings that have search permission set.
481 To attach to a named keyring, the keyring must have search permission for
617 The process must have search permission on the top level keyring, or else
618 error EACCES will result. Only keyrings that the process has search
620 a process has search permission can be matched. If the specified keyring
623 If the search succeeds, the function will attempt to link the found key
[all …]
DSmack.txt448 search a directory requires execute access. Creating a file with write access
/linux-4.1.27/include/linux/netfilter/
Dnf_conntrack_sip.h64 const char *search; member
79 .search = (__search), \
/linux-4.1.27/Documentation/kbuild/
Dkconfig.txt7 search, and other general help text.
163 For search help, enter / followed TAB-TAB-TAB (to highlight
165 regular expressions (regexes) in the search string, so if you
172 is when the search matches the complete symbol name);
223 You can also enter a different search string without having
/linux-4.1.27/Documentation/RCU/
DlistRCU.txt15 based on the results of the search. The most celebrated example is
231 entry does not exist. For this to be helpful, the search function must
234 Quick Quiz: Why does the search function need to return holding the
302 in conjunction with a per-entry spinlock in order to allow the search
307 Why does the search function need to return holding the per-entry
310 If the search function drops the per-entry lock before returning,
Drcu.txt69 more information on where this name came from, search for
75 search for the string "Patent" in RTFP.txt to find them.
DRTFP.txt7 and search engines will usually find what you are looking for.
11 of nodes in a parallel binary search tree in order to simplify its
18 for a parallel binary search tree. This approach works well in systems
192 2011 marked the inclusion of Nick Piggin's fully lockless dentry search
374 Concurrent access to skip lists. Has both weak and strong search.
953 Applies RCU to a wildcard-search Patricia tree in order to permit
DwhatisRCU.txt736 1 int search(long key, int *result) 1 int search(long key, int *result)
/linux-4.1.27/Documentation/networking/
Digbvf.txt50 website. In the search field, enter your adapter name or type, or use the
51 networking link on the left to search for your adapter:
Dfib_trie.txt31 Note that the search algorithm will simply skip over these bits when
131 Inside each tnode, the search for longest matching prefix consists of searching
De100.txt45 website. In the search field, enter your adapter name or type, or use the
46 networking link on the left to search for your adapter:
Ddns_resolver.txt125 When dns_query() is invoked, it calls request_key() to search the local
De1000e.txt31 website. In the search field, enter your adapter name or type, or use the
32 networking link on the left to search for your adapter:
Dbatman-adv.txt30 batman advanced will scan your systems interfaces to search for
DPLIP.txt35 minutes' work, no need to search for a [supported] netcard. This might
De1000.txt25 website. In the search field, enter your adapter name or type, or use the
26 networking link on the left to search for your adapter:
Dspider_net.txt174 search the ring for the next full descr, and the driver will resume
Dfilter.txt833 can be determined in two steps: first step does depth-first-search to disallow
Dip-sysctl.txt398 will stop in respect to the width of search range in bytes. Default
Darcnet-hardware.txt369 able to use your text viewer's "search" function to find the entry you want.
/linux-4.1.27/Documentation/devicetree/bindings/mfd/
Dsyscon.txt7 reference to the syscon node (e.g. by phandle, node path, or search
/linux-4.1.27/Documentation/devicetree/bindings/powerpc/fsl/cpm_qe/qe/
Dfirmware.txt11 Device drivers can search this string to determine if the
/linux-4.1.27/drivers/firmware/google/
DKconfig27 This option enables the kernel to search for a firmware log in
/linux-4.1.27/drivers/pci/
DMakefile6 pci-driver.o search.o pci-sysfs.o rom.o setup-res.o \
/linux-4.1.27/Documentation/ABI/testing/
Dsysfs-fs-ext423 will search to find the best extent
30 will search to find the best extent
/linux-4.1.27/Documentation/w1/masters/
Dds249040 conditions. If a bus search is in progress and the ds2490 is
42 search finishes.
/linux-4.1.27/Documentation/firmware_class/
DREADME24 in the below search path of root filesystem:
25 User customized search path by module parameter 'path'[1]
/linux-4.1.27/Documentation/
Drbtree.txt9 Red-black trees are a type of self-balancing binary search tree, used for
52 users are expected to write their own tree search and insert functions
78 Writing a search function for your tree is fairly straightforward: start at the
109 The search for insertion differs from the previous search by finding the
Ddigsig.txt55 * @keyring: keyring to search key in
DBUG-HUNTING68 . Do a binary search over the kernels to figure out which one
238 with this look at mm/slab.c and search for POISON_INUSE. When using this an
DHOWTO176 of basic kernel development question (make sure to search the archives
375 places. Use a search engine to find these archives. For example:
377 It is highly recommended that you search the archives about the topic
Dsysfs-rules.txt34 application's behavior, but never try to search for sysfs. Never try
Dkernel-doc-nano-HOWTO.txt346 !D<filename> is used to name additional files to search for functions
Dparport-lowlevel.txt847 Find a device by class. The search starts from device number from+1.
879 Find a device by vendor and model. The search starts from device
Doops-tracing.txt130 programs to search for specific patterns in the kernel code segment, and
Dkernel-docs.txt712 * Name: "linux-kernel mailing list archives and search engines"
719 Keywords: linux-kernel, archives, search.
D00-INDEX19 - brute force method of doing binary search of patches to find bug.
Dbcache.txt387 Statistics about the auxiliary search trees
Dassoc_array.txt293 It is possible for other threads to iterate over or search the array under
Dkernel-parameters.txt1568 When an interrupt is not handled search all handlers
1573 When an interrupt is not handled search all handlers
/linux-4.1.27/Documentation/power/
Dopp.txt52 -> queries to search/retrieve information ->
135 to search the OPP list that OPP library internally manages. These search
157 NOTE: This is the only search function that operates on OPPs which are
241 retrieved using the search functions, the following functions can be used by SoC
Dbasic-pm-debugging.txt110 you can carry out a binary search according to the rules:
202 you may be able to search for failing drivers by following the procedure
/linux-4.1.27/security/integrity/
DKconfig27 Different keyrings improves search performance, but also allow
/linux-4.1.27/kernel/trace/
Dftrace.c3499 char *search = buff; in match_records() local
3504 type = filter_parse_regex(buff, len, &search, &not); in match_records()
3505 search_len = strlen(search); in match_records()
3514 if (ftrace_match_record(rec, mod, search, search_len, type)) { in match_records()
3705 char *search; in register_ftrace_function_probe() local
3708 type = filter_parse_regex(glob, strlen(glob), &search, &not); in register_ftrace_function_probe()
3709 len = strlen(search); in register_ftrace_function_probe()
3736 if (!ftrace_match_record(rec, NULL, search, len, type)) in register_ftrace_function_probe()
3817 char *search; in __unregister_ftrace_function_probe() local
3825 type = filter_parse_regex(glob, strlen(glob), &search, &not); in __unregister_ftrace_function_probe()
[all …]
Dtrace_events_filter.c320 enum regex_type filter_parse_regex(char *buff, int len, char **search, int *not) in filter_parse_regex() argument
332 *search = buff; in filter_parse_regex()
337 *search = buff + 1; in filter_parse_regex()
356 char *search; in filter_build_regex() local
361 type = filter_parse_regex(r->pattern, r->len, &search, &not); in filter_build_regex()
362 r->len = strlen(search); in filter_build_regex()
363 memmove(r->pattern, search, r->len+1); in filter_build_regex()
DKconfig180 The default measurement method is a maximum search, which is
204 The default measurement method is a maximum search, which is
Dtrace.h1055 filter_parse_regex(char *buff, int len, char **search, int *not);
/linux-4.1.27/Documentation/video4linux/cx88/
Dhauppauge-wintv-cx88-ir.txt44 This data sheet (google search) seems to have a lovely description of the
/linux-4.1.27/Documentation/video4linux/
Dhauppauge-wintv-cx88-ir.txt44 This data sheet (google search) seems to have a lovely description of the
/linux-4.1.27/Documentation/arm/
Dtcm.txt20 at http://infocenter.arm.com, search for "TCM Status Register"
25 There is further a TCM region register (search for "TCM Region
/linux-4.1.27/Documentation/isdn/
DREADME.hfc-pci35 supplied else the parameter is assumed 0 and a auto search for a free card is
/linux-4.1.27/Documentation/DocBook/
D.kernel-api.xml.cmd2 …vers/pci/pci.c drivers/pci/pci-driver.c drivers/pci/remove.c drivers/pci/search.c drivers/pci/msi.…
/linux-4.1.27/Documentation/sound/oss/
DSoundblaster30 reverse=1 Reverses the order of the search in the PnP table.
DIntroduction72 resort, inspect the code (search for module_param).
/linux-4.1.27/Documentation/ia64/
DIRQ-redir.txt50 search begins at the default CPU. Therefore most of the interrupts
/linux-4.1.27/drivers/scsi/aic7xxx/
DKconfig.aic79xx74 are defined in the drivers/scsi/aic7xxx/aic79xx.h - search for the
DKconfig.aic7xxx79 are defined in the drivers/scsi/aic7xxx/aic7xxx.h - search for the
Daic7xxx.seq1875 * SCB. With SCB paging, we must search for non-tagged
/linux-4.1.27/Documentation/filesystems/cifs/
DCHANGES82 Samba servers (worked to Windows). Fix rmdir so that pending search
254 so we can do search (ls etc.) to OS/2. Do not send NTCreateX
328 Fix readdir caching when unlink removes file in current search buffer,
329 and this is followed by a rewind search to just before the deleted entry.
353 search (readdir) output when resume filename was a long filename.
381 transact response for an SMB request and search entry split across two frames.
456 for readdir to netapp servers. Fix search rewind (seek into readdir to return
620 unitialized. Reset search to restart at correct file when kernel routine
808 Add resume key support to search (readdir) code to workaround
834 Fix search handle leak on rewind. Fix setuid and gid so that they are
[all …]
DTODO81 See http://bugzilla.samba.org - search on product "CifsVFS" for
/linux-4.1.27/Documentation/scsi/
Din2000.txt98 search for the 'nosync' keyword in the command-line
132 search for 'setup_strings' near the top of the in2000.c file and
Dosd.txt13 or search the web for "OSD SCSI"
/linux-4.1.27/fs/reiserfs/
DKconfig17 database and keyword search systems than block allocation based file
/linux-4.1.27/Documentation/vm/
Dzswap.txt47 with a red-black tree per swap type. The swap offset is the search key for the
Dnuma_memory_policy.txt174 allocation fails, the kernel will search other nodes, in order of
Dunevictable-lru.txt553 in the page's mapping's reverse map priority search tree. It also visits
/linux-4.1.27/drivers/media/dvb-core/
Ddvb_frontend.h313 enum dvbfe_search (*search)(struct dvb_frontend *fe); member
Ddvb_frontend.c798 if (fe->ops.search) { in dvb_frontend_thread()
799 fepriv->algo_status = fe->ops.search(fe); in dvb_frontend_thread()
/linux-4.1.27/scripts/kconfig/
Dqconf.h290 void search(void);
Dqconf.cc1197 connect(editField, SIGNAL(returnPressed()), SLOT(search())); in ConfigSearchWindow()
1201 connect(searchButton, SIGNAL(clicked()), SLOT(search())); in ConfigSearchWindow()
1251 void ConfigSearchWindow::search(void) in search() function in ConfigSearchWindow
/linux-4.1.27/Documentation/misc-devices/
Dspear-pcie-gadget.txt98 is initialized and start to search PCIe devices on its port.
/linux-4.1.27/fs/ocfs2/
Dextent_map.c241 search: in ocfs2_extent_map_insert_rec()
267 goto search; in ocfs2_extent_map_insert_rec()
Dxattr.c3816 struct ocfs2_xattr_bucket *search; in ocfs2_xattr_bucket_find() local
3820 search = ocfs2_xattr_bucket_new(inode); in ocfs2_xattr_bucket_find()
3821 if (!search) { in ocfs2_xattr_bucket_find()
3827 ret = ocfs2_read_xattr_bucket(search, p_blkno); in ocfs2_xattr_bucket_find()
3833 xh = bucket_xh(search); in ocfs2_xattr_bucket_find()
3836 ocfs2_xattr_bucket_relse(search); in ocfs2_xattr_bucket_find()
3840 ret = ocfs2_read_xattr_bucket(search, blkno); in ocfs2_xattr_bucket_find()
3846 xh = bucket_xh(search); in ocfs2_xattr_bucket_find()
3872 ret = ocfs2_find_xe_in_bucket(inode, search, in ocfs2_xattr_bucket_find()
3911 ocfs2_xattr_bucket_free(search); in ocfs2_xattr_bucket_find()
Dsuballoc.c1487 int search = -ENOSPC; in ocfs2_cluster_group_search() local
1539 search = 0; /* success */ in ocfs2_cluster_group_search()
1549 return search; in ocfs2_cluster_group_search()
Ddir.c938 goto search; in ocfs2_dx_dir_search()
967 search: in ocfs2_dx_dir_search()
/linux-4.1.27/Documentation/cgroups/
Dcpusets.txt539 idle CPUs, the scheduler might not search all CPUs in the domain
557 0 : no search.
558 1 : search siblings (hyperthreads in a core).
559 2 : search cores in a package.
560 3 : search cpus in a node [= system wide on non-NUMA system]
561 4 : search nodes in a chunk of node [on NUMA system]
562 5 : search system wide [on NUMA system]
/linux-4.1.27/fs/btrfs/
Dctree.c2241 u64 search; in reada_for_search() local
2259 search = btrfs_node_blockptr(node, slot); in reada_for_search()
2261 eb = btrfs_find_tree_block(root->fs_info, search); in reada_for_search()
2267 target = search; in reada_for_search()
2287 search = btrfs_node_blockptr(node, nr); in reada_for_search()
2288 if ((search <= target && target - search <= 65536) || in reada_for_search()
2289 (search > target && search - target <= 65536)) { in reada_for_search()
2291 readahead_tree_block(root, search); in reada_for_search()
Ddelayed-inode.c1073 goto search; in __btrfs_update_delayed_inode()
1099 search: in __btrfs_update_delayed_inode()
Dextent-tree.c6817 search: in find_free_extent()
7067 goto search; in find_free_extent()
7070 goto search; in find_free_extent()
7120 goto search; in find_free_extent()
/linux-4.1.27/Documentation/acpi/
Dscan_handlers.txt7 is scanned in search of device objects that generally represent various pieces
/linux-4.1.27/drivers/w1/masters/
Dds1wm.c450 .search = ds1wm_search,
Domap_hdq.c101 .search = omap_w1_search_bus,
Dds2490.c973 dev->master.search = &ds9490r_search; in ds_w1_init()
/linux-4.1.27/Documentation/crypto/
Dasymmetric-keys.txt63 keyctl search @s asymmetric id:5acc2142
74 keyctl search @s asymmetric tpm:5acc2142
/linux-4.1.27/Documentation/devicetree/bindings/powerpc/4xx/
Demac.txt67 a search is performed.
/linux-4.1.27/Documentation/filesystems/
Dsysv-fs.txt75 When it is exhausted, new free inodes are found using a linear search.
Dext4.txt478 allocator will search to find the best extent
481 allocator will search to find the best extent
Dhpfs.txt112 OS/2 uppercases the search pattern with its system code page (852) and file
Dcoda.txt606 and Venus will search the directory identified by cfs_lookup_in.VFid.
Dvfs.txt33 to search through the directory entry cache (also known as the dentry
/linux-4.1.27/arch/m68k/ifpsp060/
Dilsp.doc54 search and replace function.
Dfplsp.doc55 search and replace function.
Disp.doc59 search and replace function.
DTEST.DOC45 with a global search and replace function.
Dfpsp.doc51 search and replace function.
/linux-4.1.27/drivers/media/dvb-frontends/
Ddib9000.c1475 int ret = 10, search = state->channel_status.status == CHANNEL_STATUS_PARAMETERS_UNKNOWN; in dib9000_fw_tune() local
1486 if (search) in dib9000_fw_tune()
1495 if (search) in dib9000_fw_tune()
1504 if (search) in dib9000_fw_tune()
Dcxd2820r_core.c684 .search = cxd2820r_search,
Dhd29l2.c856 .search = hd29l2_search,
Dstb0899_drv.c1612 .search = stb0899_search,
Dlgdt3306a.c2138 .search = lgdt3306a_search,
Dmb86a16.c1837 .search = mb86a16_search,
Dstv0900_core.c1900 .search = stv0900_search,
Dstv090x.c4915 .search = stv090x_search,
/linux-4.1.27/tools/perf/util/
Dheader.c247 const char *search = cpuinfo_proc; in __write_cpudesc() local
251 if (!search) in __write_cpudesc()
259 ret = strncmp(buf, search, strlen(search)); in __write_cpudesc()
/linux-4.1.27/fs/befs/
DChangeLog37 * Sergey S. Kostyliov made befs_find_key() use a binary search to find
38 keys within btree nodes, rather than the linear search we were using
/linux-4.1.27/Documentation/fault-injection/
Dfault-injection.txt94 specifies the maximum stacktrace depth walked during search
/linux-4.1.27/tools/perf/Documentation/
Dperf-script-perl.txt115 search path and 'use'ing a few support modules (see module
Dperf-script-python.txt511 module search path and 'import'ing a few support modules (see module
/linux-4.1.27/drivers/hid/
Dhid-core.c1117 static int search(__s32 *array, __s32 value, unsigned n) in search() function
1244 && search(value, field->value[n], count)) in hid_input_field()
1249 && search(field->value, value[n], count)) in hid_input_field()
/linux-4.1.27/Documentation/x86/
Dexception-tables.txt47 (fixup). If this search is successful, the fault handler modifies the
/linux-4.1.27/arch/x86/crypto/
Dsha512-avx-asm.S46 # and search for that title.
Dsha512-ssse3-asm.S46 # and search for that title.
Dsha256-avx-asm.S44 # and search for that title.
Dsha256-ssse3-asm.S45 # and search for that title.
Dsha256-avx2-asm.S45 # and search for that title.
Dsha512-avx2-asm.S46 # and search for that title.
/linux-4.1.27/fs/f2fs/
Ddata.c926 goto search; in find_data_page()
932 search: in find_data_page()
/linux-4.1.27/net/ipv4/
DKconfig473 called additive increase and binary search increase. When the
476 scalability. Under small congestion windows, binary search
/linux-4.1.27/fs/jfs/
Djfs_xtree.c107 uint search; member
255 INCREMENT(xtStat.search); in xtSearch()
3885 xtStat.search, in jfs_xtstat_proc_show()
/linux-4.1.27/Documentation/development-process/
D3.Early-stage150 get_maintainer.pl will search for maintainers; please be careful about
D6.Followthrough83 place for this kind of information. Reviewers should not have to search
/linux-4.1.27/Documentation/usb/
Dgadget_serial.txt166 next screen select "Include this location in the search" and enter the
/linux-4.1.27/Documentation/PCI/
Dpci.txt204 pci_register_driver() interface to search for PCI devices.
209 A manual search may be performed using the following constructs:
/linux-4.1.27/fs/gfs2/
Drgrp.c164 static const u64 search[] = { in gfs2_bit_search() local
170 tmp = le64_to_cpu(*ptr) ^ search[state]; in gfs2_bit_search()
/linux-4.1.27/mm/
Dslub.c894 static int on_freelist(struct kmem_cache *s, struct page *page, void *search) in on_freelist() argument
903 if (fp == search) in on_freelist()
940 return search == NULL; in on_freelist()
/linux-4.1.27/Documentation/filesystems/caching/
Dfscache.txt108 desires, though it must be aware that the index search function is
Dnetfs-api.txt113 (3) The depth of the index tree should be judged with care as the search
/linux-4.1.27/Documentation/s390/
DDebugging390.txt1300 and be able to use them on a web search engine to find more useful information.
/linux-4.1.27/drivers/staging/speakup/
Dspkguide.txt676 If you run a google search for Fonix, you'll find their web site.
/linux-4.1.27/arch/x86/
DKconfig1124 <https://downloadcenter.intel.com> and search for