Home
last modified time | relevance | path

Searched full:search (Results 1 – 25 of 2640) sorted by relevance

12345678910>>...106

/openbmc/openbmc/poky/bitbake/lib/toaster/toastergui/templates/
H A Ddetail_search_header.html2 Show a detail table Search field and Rows per page.
4 objects, our boilerplated paginated with search fields set.
6 search_what, fills in "Search ___"
7 Only show the search form if we have more than 10 results,
8 or if return from a previous search.
14 /* Clear the current search selection and reload the results */
15 $(".search-clear").click(function(){
16 $("#search").val("");
22 {% if objects.paginator.count > 10 or request.GET.search %}
33 …d="search" class="form-control" type="text" placeholder="Search {{search_what}}" name="search" val…
[all …]
H A Dtoastertable-simple.html34 …ew-search-input-{{table_name}}" name="search" type="text" placeholder="Search {{title|lower}}" val…
35 …<span class="remove-search-btn-{{table_name}} glyphicon glyphicon-remove-circle" tabindex="-1"></s…
38 <button class="btn btn-default search-submit-{{table_name}}">Search</button>
39 … <button class="btn btn-link remove-search-btn-{{table_name}}">Show all {{title|lower}}</button>
50 …d="search-input-{{table_name}}" name="search" type="text" placeholder="Search {{title|lower}}" val…
51 …<span href="#" style="display:none" class="remove-search-btn-{{table_name}} glyphicon glyphicon-re…
54 <button class="btn btn-default" id="search-submit-{{table_name}}" >Search</button>
H A Dtoastertable.html37 …new-search-input-{{table_name}}" name="search" type="text" placeholder="Search {{title|lower}}" va…
38 …<span class="remove-search-btn-{{table_name}} glyphicon glyphicon-remove-circle" tabindex="-1"></a>
41 <button class="btn btn-default search-submit-{{table_name}}">
42 Search
44 <button class="btn btn-link show-all-{{table_name}} remove-search-btn-{{table_name}}">
67 …search-input-{{table_name}}" class="form-control" name="search" type="text" placeholder="Search {{…
68 …<span class="remove-search-btn-{{table_name}} glyphicon glyphicon-remove-circle" tabindex="-1" sty…
71 <button class="btn btn-default" id="search-submit-{{table_name}}" >Search</button>
H A Dconfigvars.html14 …{% if request.GET.filter and objects.paginator.count > 0 or request.GET.search and objects.paginat…
16 …{%elif request.GET.filter and objects.paginator.count == 0 or request.GET.search and objects.pagin…
39 …<input class="form-control" id="search" name="search" type="text" value="{% if request.GET.search …
40 {% if request.GET.search %}
41 <a href="javascript:$('#search').val('');searchform.submit()" tabindex="-1">
42 <span class="remove-search-btn-variables glyphicon glyphicon-remove-circle"></span>
47 <button class="btn btn-default" type="submit" value="Search">Search</button>
48 …<button class="btn btn-link" onclick="javascript:$('#search').val('');searchform.submit()">Show al…
/openbmc/linux/include/linux/
H A Dtextsearch.h19 * struct ts_state - search state
30 * struct ts_ops - search module operations
31 * @name: name of search algorithm
32 * @init: initialization function to prepare a search
34 * @destroy: destroy algorithm specific parts of a search configuration
53 * struct ts_config - search configuration
56 * @get_next_block: callback to fetch the next block to search in
57 * @finish: callback to finalize a search
68 * @conf: search configuration
69 * @state: search state
[all …]
H A Dfind.h46 * @addr: The address to base the search on
74 * @addr1: The first address to base the search on
75 * @addr2: The second address to base the search on
105 * @addr1: The first address to base the search on
106 * @addr2: The second address to base the search on
135 * @addr1: The first address to base the search on
136 * @addr2: The second address to base the search on
165 * @addr: The address to base the search on
193 * @addr: The address to start the search at
194 * @size: The maximum number of bits to search
[all …]
/openbmc/webui-vue/src/components/Global/
H A DSearch.vue2 <div class="search-global">
4 :label="$t('global.form.search')"
11 <icon-search class="search-icon" />
17 class="search-input"
19 :aria-label="$t('global.form.search')"
40 import IconSearch from '@carbon/icons-vue/es/search/16';
46 name: 'Search',
52 return i18n.global.t('global.form.search');
64 this.$emit('change-search', this.filter);
68 this.$emit('clear-search');
[all …]
/openbmc/openbmc/poky/scripts/lib/devtool/
H A Dsearch.py1 # Development tool - search command plugin
8 """Devtool search plugin"""
19 def search(args, config, basepath, workspace): function
20 """Entry point for the devtool 'search' subcommand"""
48 if keyword_rc.search(fn):
58 if keyword_rc.search(pkg):
70 if keyword_rc.search(value):
84 if keyword_rc.search(recipe.pn):
88 if keyword_rc.search(prov):
93 if keyword_rc.search(rprov):
[all …]
/openbmc/linux/drivers/acpi/acpica/
H A Dnssearch.c4 * Module Name: nssearch - Namespace search
30 * PARAMETERS: target_name - Ascii ACPI name to search for
31 * parent_node - Starting node where search will begin
37 * DESCRIPTION: Search a single level of the namespace. Performs a
38 * simple search of the specified level, and does not add
39 * entries or search parents.
46 * could be easily modified to support any improved search
47 * algorithm. However, the linear search was chosen for simplicity
53 * the linear search seems to be sufficient, as there would seem to be
54 * little value in improving the search.
[all …]
/openbmc/linux/drivers/net/wireless/broadcom/brcm80211/brcmfmac/
H A Dflowring.c45 struct brcmf_flowring_tdls_entry *search; in brcmf_flowring_is_tdls_mac() local
47 search = flow->tdls_entry; in brcmf_flowring_is_tdls_mac()
49 while (search) { in brcmf_flowring_is_tdls_mac()
50 if (memcmp(search->mac, mac, ETH_ALEN) == 0) in brcmf_flowring_is_tdls_mac()
52 search = search->next; in brcmf_flowring_is_tdls_mac()
388 struct brcmf_flowring_tdls_entry *search; in brcmf_flowring_detach() local
397 search = flow->tdls_entry; in brcmf_flowring_detach()
398 while (search) { in brcmf_flowring_detach()
399 remove = search; in brcmf_flowring_detach()
400 search = search->next; in brcmf_flowring_detach()
[all …]
/openbmc/phosphor-webui/app/common/directives/
H A Dlog-search-control.js9 'template': require('./log-search-control.html'),
15 var search =
17 if (event.keyCode === 13 && search.length >= 2) {
19 $scope.addSearchItem(search);
21 if (search.length == 0) {
33 var search =
35 if (search.length >= 2) {
37 $scope.addSearchItem(search);
39 if (search.length == 0) {
/openbmc/openbmc/poky/meta/lib/oeqa/manual/
H A Dtoaster-unmanaged-mode.json93 "action": "Input a string in search component and click search.",
94 …ed_results": "Show returned search results. When no search query has been entered, we have placeho…
97 "action": "See returned search results.",
98 …lts": "If your search query returns no results, the section heading changes to \"No builds found\"…
101 … "action": "Click \"Clear search\" icon (icon-remove-sign). Observe all builds are showed. ",
102 "expected_results": "Click it to clear the search and display all builds."
139 …rs are overridden by search. Run a search query and you can see previous filter results are overri…
177 …ve the title of the table is \"Tasks\", in bold \n \n * Observe the search/filter bar above t…
189 …Search \n \n * Observe that the search text box background text is \"Search tasks\". \n \n …
321 …search \nSearching should have no impact on the applied sorting. Any results returned should be so…
[all …]
/openbmc/webui-vue/tests/unit/Global/
H A DSearch.spec.js2 import Search from '@/components/Global/Search';
4 describe('Search.vue', () => {
5 const wrapper = mount(Search, {
13 it('should emit change-search on triggering onChangeInput', () => {
15 expect(wrapper.emitted('change-search')).toHaveLength(1);
17 it('should emit clear-search on triggering onClearSearch', async () => {
20 expect(wrapper.emitted('clear-search')).toHaveLength(1);
/openbmc/linux/net/netfilter/
H A Dnf_conntrack_amanda.c62 } search[] __read_mostly = { variable
119 search[SEARCH_CONNECT].ts); in amanda_help()
122 start += dataoff + search[SEARCH_CONNECT].len; in amanda_help()
125 search[SEARCH_NEWLINE].ts); in amanda_help()
131 off = skb_find_text(skb, start, stop, search[i].ts); in amanda_help()
134 off += start + search[i].len; in amanda_help()
207 for (i = 0; i < ARRAY_SIZE(search); i++) in nf_conntrack_amanda_fini()
208 textsearch_destroy(search[i].ts); in nf_conntrack_amanda_fini()
217 for (i = 0; i < ARRAY_SIZE(search); i++) { in nf_conntrack_amanda_init()
218 search[i].ts = textsearch_prepare(ts_algo, search[i].string, in nf_conntrack_amanda_init()
[all …]
/openbmc/linux/fs/ntfs/
H A Dattrib.h21 * ntfs_attr_search_ctx - used in attribute search functions
22 * @mrec: buffer containing mft record to search
23 * @attr: attribute record in @mrec where to begin/continue search
24 * @is_first: if true ntfs_attr_lookup() begins search with @attr, else after
27 * attribute search functions. Initialize @mrec to point to the mft record to
28 * search, and @attr to point to the first attribute within @mrec (not necessary
32 * If @is_first is 'true', the search begins with @attr. If @is_first is 'false',
33 * the search begins after @attr. This is so that, after the first call to one
34 * of the search attribute functions, we can call the function again, without
35 * any modification of the search context, to automagically get the next
/openbmc/linux/lib/
H A Dtextsearch.c3 * lib/textsearch.c Generic text search interface
16 * both linear and non-linear data. Individual search algorithms are
38 * (1) User configures a search by calling textsearch_prepare() specifying
39 * the search parameters such as the pattern and algorithm name.
40 * (2) Core requests the algorithm to allocate and initialize a search
42 * (3) User starts the search(es) by calling textsearch_find() or
45 * (4) Core eventually resets the search offset and forwards the find()
57 * Before a search can be performed, a configuration must be created
66 * The actual search is performed by either calling
219 * textsearch_find_continuous - search a pattern in continuous/linear data
[all …]
/openbmc/webui-vue/tests/unit/Global/__snapshots__/
H A DSearch.spec.js.snap3 exports[`Search.vue should render correctly 1`] = `
5 class="search-global"
17 global.form.search
30 class="search-icon"
46 aria-label="global.form.search"
47 class="search-input form-control"
49 placeholder="global.form.search"
/openbmc/linux/drivers/pci/
H A Dsearch.c134 * @domain: number of PCI domain to search
159 * @from: Previous PCI bus found, or %NULL for new search.
161 * Iterates through the list of known PCI buses. A new search is
255 * @from: Previous PCI device found in search, or %NULL for new search.
260 * A new search is initiated by passing %NULL as the @from argument. Otherwise
265 * This is an internal function for use by the other search functions in
291 * @from: Previous PCI device found in search, or %NULL for new search.
296 * incremented. Otherwise, %NULL is returned. A new search is initiated by
320 * @from: Previous PCI device found in search, or %NULL for new search.
325 * Otherwise, %NULL is returned. A new search is initiated by passing %NULL
[all …]
/openbmc/linux/drivers/md/bcache/
H A Dbset.h47 * We implement code here for creating and maintaining auxiliary search trees
54 * to search entire btree nodes and iterate over them in sorted order.
58 * point (if you pass it a search key) or the start of the btree node.
60 * AUXILIARY SEARCH TREES:
62 * Since keys are variable length, we can't use a binary search on a bset - we
73 * set; they index one key every BSET_CACHELINE bytes, and then a linear search
77 * into, we construct a binary search tree in an array - traversing a binary
78 * search tree in an array gives excellent locality of reference and is very
88 * Nodes in the auxiliary search tree must contain both a key to compare against
93 * search tree corresponds to precisely BSET_CACHELINE bytes in the set. We have
[all …]
H A Drequest.c463 struct search { struct
489 struct search *s = container_of(cl, struct search, cl); in bch_cache_read_endio() argument
515 struct search *s = container_of(op, struct search, op); in cache_lookup_fn()
580 struct search *s = container_of(cl, struct search, iop.cl); in cache_lookup()
626 struct search *s = container_of(cl, struct search, cl); in request_endio()
642 struct search *s = container_of(cl, struct search, cl); in backing_request_endio()
669 static void bio_complete(struct search *s) in bio_complete()
682 static void do_bio_hook(struct search *s, in do_bio_hook()
703 struct search *s = container_of(cl, struct search, cl); in search_free()
712 mempool_free(s, &s->iop.c->search); in search_free()
[all …]
/openbmc/openbmc/meta-openembedded/meta-oe/recipes-graphics/fontforge/fontforge/
H A D0001-Fix-Translations-containing-invalid-directives-hs.patch38 - _("The %1$s in the search dialog contains a reference to %2$.20hs which does not exist in t…
39 + _("The %1$s in the search dialog contains a reference to %2$.20s which does not exist in th…
40 i==0?_("Search Pattern"):_("Replace Pattern"),
51 -"The %1$s in the search dialog contains a reference to %2$.20hs which does "
52 +"The %1$s in the search dialog contains a reference to %2$.20s which does "
69 -"The %1$s in the search dialog contains a reference to %2$.20hs which does "
70 +"The %1$s in the search dialog contains a reference to %2$.20s which does "
87 -"The %1$s in the search dialog contains a reference to %2$.20hs which does "
88 +"The %1$s in the search dialog contains a reference to %2$.20s which does "
92 -"The %1$s in the search dialogue contains a reference to %2$.20hs which does "
[all …]
/openbmc/linux/tools/include/linux/
H A Dfind.h25 * @addr: The address to base the search on
53 * @addr1: The first address to base the search on
54 * @addr2: The second address to base the search on
83 * @addr: The address to base the search on
111 * @addr: The address to start the search at
112 * @size: The maximum number of bits to search
133 * @addr1: The first address to base the search on
134 * @addr2: The second address to base the search on
158 * @addr: The address to start the search at
159 * @size: The maximum number of bits to search
/openbmc/u-boot/include/
H A Dsearch.h73 * Search for entry matching __item.key in internal hash table. If
82 * Search for an entry matching "__match". Otherwise, Same semantics
88 /* Search and delete entry matching "__key" in internal hash table. */
113 #define H_MATCH_KEY (1 << 4) /* search/grep key = variable names */
114 #define H_MATCH_DATA (1 << 5) /* search/grep data = variable values */
115 #define H_MATCH_BOTH (H_MATCH_KEY | H_MATCH_DATA) /* search/grep both */
116 #define H_MATCH_IDENT (1 << 6) /* search for indentical strings */
117 #define H_MATCH_SUBSTR (1 << 7) /* search for substring matches */
118 #define H_MATCH_REGEX (1 << 8) /* search for regular expression matches */
/openbmc/docs/architecture/
H A Dobject-mapper.md27 - param: interfaces - an optional list of interfaces to constrain the search to
67 - param: subtree - the root of the tree. Using "/" will search the whole tree
68 - param: depth - the maximum depth of the tree past the root to search. Use 0 to
69 search all
70 - param: interfaces - an optional list of interfaces to constrain the search to
130 - param: subtree - the root of the tree. Using "/" will search the whole tree
131 - param: depth - the maximum depth of the tree past the root to search. Use 0 to
132 search all
133 - param: interfaces - an optional list of interfaces to constrain the search to
206 - param: subtreeInterfaces - a list of interfaces to constrain the search to
[all …]
/openbmc/linux/tools/perf/util/
H A Ddwarf-aux.h70 DIE_FIND_CB_END = 0, /* End of Search */
71 DIE_FIND_CB_CHILD = 1, /* Search only children */
72 DIE_FIND_CB_SIBLING = 2, /* Search only siblings */
73 DIE_FIND_CB_CONTINUE = 3, /* Search children and siblings */
76 /* Search child DIEs */
81 /* Search a non-inlined function including given address */
85 /* Search a non-inlined function with tail call at given address */
89 /* Search the top inlined function including given address */
93 /* Search the deepest inlined function including given address */

12345678910>>...106