Searched refs:search (Results 101 - 113 of 113) sorted by relevance

12345

/linux-master/arch/x86/crypto/
H A Dsha512-avx2-asm.S46 # and search for that title.
H A Dsha256-avx2-asm.S45 # and search for that title.
/linux-master/drivers/media/dvb-frontends/
H A Dlgdt3306a.c2153 .search = lgdt3306a_search,
H A Dmb86a16.c1815 .search = mb86a16_search,
H A Dstv0900_core.c1890 .search = stv0900_search,
H A Dstv090x.c1278 /* Activate Viterbi decoder in legacy search,
1326 /* Cut 2: enable link during search */
1372 /* Cut 2: enable link during search */
1426 Set The carrier search up and low to auto mode */
2075 STV090x_SETFIELD_Px(reg, CFR_AUTOSCAN_FIELD, 0x00); /* stop carrier offset search */
2454 /*run the SW search 2 times maximum*/
3029 msleep(50); /* blind search: wait 50ms for SR stabilization */
4977 .search = stv090x_search,
/linux-master/fs/ocfs2/
H A Ddir.c700 * search has finished at this block.
745 * search the last part of the directory before giving up.
875 * search, we take the lower bits of the hash.
909 goto search;
938 search:
/linux-master/net/netfilter/
H A Dnf_tables_api.c1682 char search[NFT_CHAIN_MAXNAMELEN + 1]; local
1689 nla_strscpy(search, nla, sizeof(search));
1696 list = rhltable_lookup(&table->chains_ht, search, nft_chain_ht_params);
7533 char search[NFT_OBJ_MAXNAMELEN]; local
7537 nla_strscpy(search, nla, sizeof(search));
7538 k.name = search;
/linux-master/tools/power/pm-graph/
H A Dsleepgraph.py1076 num = re.search(r'[\d]+', data[1])
5775 # search for either an SM table or DMI table
6251 m = re.search(start, html)
6259 m = re.search(end, html[s:e])
6265 num = re.search(r'[-+]?\d*\.\d+|\d+', str)
/linux-master/net/core/
H A Dfilter.c7510 const u8 *op, *opend, *magic, *search = search_res; local
7521 search_kind = search[0];
7522 search_len = search[1];
7532 magic = &search[2];
7617 * thing to do for the 'search-for-duplication'
/linux-master/fs/btrfs/
H A Dtree-log.c1121 /* Same search but for extended refs */
3313 * transaction's ID, to avoid the search below in a future call in case
3342 * case 3) and return true. So we do a search in the log root for the inode
3371 * current transaction to avoid doing the search in future calls.
3899 search:
3959 goto search;
3989 * key offset. If that's the case, search for it and update the inode. This
4139 * If start slot isn't 0 then we don't need to re-search, we've
4720 * because it does a deletion search, which always acquires write locks
5168 * paths that search th
[all...]
H A Dextent-tree.c71 /* simple helper to search for an existing data extent at a given offset */
2344 * XXX: We should replace this with a proper search function in the
3239 "umm, got %d back from search, was looking for %llu, slot %d",
4158 * Return >0 means caller needs to re-search for free extent
4191 * any uncached bgs and we've already done a full search
4278 * big contiguous allocations, so instead of doing the expensive search
4280 * can go ahead and search for a more manageable chunk.
4486 search:
4634 goto search;
5085 * hold the lock on the original fs root and then search fo
[all...]
/linux-master/tools/perf/scripts/python/
H A Dexported-sql-viewer.py2485 if re.search(pattern, str(column_data)) is not None:

Completed in 348 milliseconds

12345