text
stringlengths 1
22.8M
|
|---|
```java
Using bounded type parameters in generic methods
Metadata: setting a file's owner
Detect or prevent integer overflow
Supply `toString()` in all classes
Using an interface as a parameter
```
|
was a German crime series produced by TV60Filmproduktion (Sven Burgemeister) for ZDF. The show was set in the town of Lübeck. Swiss actress Charlotte Schwab played the main role as Commissioner for Criminal Investigation Marion Ahrens, who initially works alongside Lizzy Krüger (Ann-Kathrin Kramer), and later Clara Hertz (Lisa Martinek). From 2002 until 2012, a total of 24 episodes were broadcast at irregular intervals.
In August 2012, it was announced that in September 2012, the last episode of the series would be televised. The broadcaster justified this decision by stating that the separate parties wanted to go in different directions.
In 2016, a new series of crime films called Solo für Weiss, in which Anna Maria Mühe plays the role of LKA target investigator Nora Weiss, appeared on German television.
Characters
Marion Ahrens
Head of Criminal Investigation Commissioner Marion Ahrens is deeply connected to her hometown of Lübeck. Ahrens is the superior to Lizzy Krüger and Clara Hertz.
Lizzy Krüger
Detective Commissioner Lizzy Krüger moves from Hamburg to Lübeck at the beginning of the show. When she begins working in Lübeck, she is met with little love from her superior Ahrens. Her new colleague Benno Polenz (Mišel Matičević), who had been out for Krüger's position, also treats her coldly. After eleven common cases, and garnering more affection from her coworkers, Krüger leaves to take care of her family-owned breeding stallion.
Clara Hertz
Police Commissioner Clara Hertz replaces Lizzy Krüger from the twelfth case onward. She first meets her superior Ahrens in a minor car collision. Over the course of the series, she has an affair with bank director Robert Lilienthal (Roman Knižka).
Awards
The fifth episode, "The Lover", was awarded the VFF TV Movie Award in 2003 (since 2009: Bernd Burgemeister TV Award).
See also
List of German television series
References
External links
2002 German television series debuts
2012 German television series endings
German-language television shows
German crime television series
2000s German police procedural television series
2010s German police procedural television series
ZDF original programming
|
The 2005 Russian football season, saw CSKA Moscow competed in the Russian Premier League, Russian Cup, two editions of the UEFA Cup and the UEFA Super Cup.
CSKA won the Russian Premier League, Russian Cup and the 2004-05 UEFA Cup, earn them a historic treble. As a result of winning the UEFA Cup they faced Liverpool in the 2005 UEFA Super Cup, which they lost 3–1.
Squad
Out on loan
Transfers
Winter
In:
Out:
Summer
In:
Out:
Competitions
Russian Premier League
Results by round
Results
League table
Russian Cup
2004–05
2005–06
Round 16 took place during the 2006 season.
UEFA Cup
2004–05
Knock-out stage
Final
2005–06
First round
Group stage
UEFA Super Cup
Statistics
Appearances and goals
|-
|colspan="14"|Players that left CSKA Moscow on loan during the season:
|-
|colspan="14"|Players who appeared for CSKA Moscow no longer at the club:
|}
Goal Scorers
Disciplinary Record
References
Results
PFC CSKA Moscow seasons
CSKA Moscow
2004-05 Pfc Cska Moscow Season
Russian football championship-winning seasons
|
Wang Hao-yu (; born 29 October 1988) is a Taiwanese politician.
In the 2014 Taiwanese local elections, he ran for a seat on the Taoyuan City Council in District 7, which includes Zhongli District, as a candidate for the Green Party. Out of 22 candidates, he was one of 10 elected, garnering 9.06% of the votes, the 2nd most amongst all candidates. In 2018 he ran in the same district as a candidate, still under the Green Party, and was one of 11 elected out of 21, coming in 3rd with 8.68% of the vote.
He left the Green Party on January 11, 2020 and joined the Democratic Progressive Party on February 6, 2020.
Wang was the subject of controversy over a Facebook post in the wake of the suicide of Hsu Kun-yuan, the Kaohsiung City Council speaker and ally of Han Kuo-yu, following Han's successful recall. About 200 Han supporters protested outside Wang's district office to call for his recall.
Wang was successfully recalled on January 16, 2021 with 92.23% in favor, 7.7% against, and a 28% turnout. Thus, the number of votes in favor of his recall was 25.82% of eligible voters, exceeding the required 25%. The successful recall was the first for a city councillor in a special municipality. According to ROC law, Wang would be banned from running for the same post over the next four years.
References
External links
Wang Hao-yu's Facebook account
1988 births
Living people
Democratic Progressive Party (Taiwan) politicians
Taoyuan City Councilors
Politicians of the Republic of China on Taiwan from Hsinchu
|
```python
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
title property
"""
from rebulk import Rebulk, Rule, AppendMatch, RemoveMatch, AppendTags
from rebulk.formatters import formatters
from .film import FilmTitleRule
from .language import (
SubtitlePrefixLanguageRule,
SubtitleSuffixLanguageRule,
SubtitleExtensionRule,
NON_SPECIFIC_LANGUAGES
)
from ..common import seps, title_seps
from ..common.comparators import marker_sorted
from ..common.expected import build_expected_function
from ..common.formatters import cleanup, reorder_title
from ..common.pattern import is_disabled
from ..common.validators import seps_surround
def title(config): # pylint:disable=unused-argument
"""
Builder for rebulk object.
:param config: rule configuration
:type config: dict
:return: Created Rebulk object
:rtype: Rebulk
"""
rebulk = Rebulk(disabled=lambda context: is_disabled(context, 'title'))
rebulk.rules(TitleFromPosition, PreferTitleWithYear)
expected_title = build_expected_function('expected_title')
rebulk.functional(expected_title, name='title', tags=['expected', 'title'],
validator=seps_surround,
formatter=formatters(cleanup, reorder_title),
conflict_solver=lambda match, other: other,
disabled=lambda context: not context.get('expected_title'))
return rebulk
class TitleBaseRule(Rule):
"""
Add title match in existing matches
"""
# pylint:disable=no-self-use,unused-argument
consequence = [AppendMatch, RemoveMatch]
def __init__(self, match_name, match_tags=None, alternative_match_name=None):
super().__init__()
self.match_name = match_name
self.match_tags = match_tags
self.alternative_match_name = alternative_match_name
def hole_filter(self, hole, matches):
"""
Filter holes for titles.
:param hole:
:type hole:
:param matches:
:type matches:
:return:
:rtype:
"""
return True
def filepart_filter(self, filepart, matches):
"""
Filter filepart for titles.
:param filepart:
:type filepart:
:param matches:
:type matches:
:return:
:rtype:
"""
return True
def holes_process(self, holes, matches):
"""
process holes
:param holes:
:type holes:
:param matches:
:type matches:
:return:
:rtype:
"""
cropped_holes = []
group_markers = matches.markers.named('group')
for group_marker in group_markers:
path_marker = matches.markers.at_match(group_marker, predicate=lambda m: m.name == 'path', index=0)
if path_marker and path_marker.span == group_marker.span:
group_markers.remove(group_marker)
for hole in holes:
cropped_holes.extend(hole.crop(group_markers))
return cropped_holes
@staticmethod
def is_ignored(match):
"""
Ignore matches when scanning for title (hole).
Full word language and countries won't be ignored if they are uppercase.
"""
return not (len(match) > 3 and match.raw.isupper()) and match.name in ('language', 'country', 'episode_details')
def should_keep(self, match, to_keep, matches, filepart, hole, starting):
"""
Check if this match should be accepted when ending or starting a hole.
:param match:
:type match:
:param to_keep:
:type to_keep: list[Match]
:param matches:
:type matches: Matches
:param hole: the filepart match
:type hole: Match
:param hole: the hole match
:type hole: Match
:param starting: true if match is starting the hole
:type starting: bool
:return:
:rtype:
"""
if match.name in ('language', 'country'):
# Keep language if exactly matching the hole.
if len(hole.value) == len(match.raw):
return True
# Keep language if other languages exists in the filepart.
outside_matches = filepart.crop(hole)
other_languages = []
for outside in outside_matches:
other_languages.extend(matches.range(outside.start, outside.end,
lambda c_match: c_match.name == match.name and
c_match not in to_keep and
c_match.value not in NON_SPECIFIC_LANGUAGES))
if not other_languages and (not starting or len(match.raw) <= 3):
return True
return False
def should_remove(self, match, matches, filepart, hole, context):
"""
Check if this match should be removed after beeing ignored.
:param match:
:param matches:
:param filepart:
:param hole:
:return:
"""
if context.get('type') == 'episode' and match.name == 'episode_details':
return match.start >= hole.start and match.end <= hole.end
return True
def check_titles_in_filepart(self, filepart, matches, context): # pylint:disable=inconsistent-return-statements
"""
Find title in filepart (ignoring language)
"""
# pylint:disable=too-many-locals,too-many-branches,too-many-statements
start, end = filepart.span
holes = matches.holes(start, end + 1, formatter=formatters(cleanup, reorder_title),
ignore=self.is_ignored,
predicate=lambda m: m.value)
holes = self.holes_process(holes, matches)
for hole in holes:
if not hole or (self.hole_filter and not self.hole_filter(hole, matches)):
continue
to_remove = []
to_keep = []
ignored_matches = matches.range(hole.start, hole.end, self.is_ignored)
if ignored_matches:
for ignored_match in reversed(ignored_matches):
# pylint:disable=undefined-loop-variable, cell-var-from-loop
trailing = matches.chain_before(hole.end, seps, predicate=lambda m: m == ignored_match)
if trailing:
should_keep = self.should_keep(ignored_match, to_keep, matches, filepart, hole, False)
if should_keep:
# pylint:disable=unpacking-non-sequence
try:
append, crop = should_keep
except TypeError:
append, crop = should_keep, should_keep
if append:
to_keep.append(ignored_match)
if crop:
hole.end = ignored_match.start
for ignored_match in ignored_matches:
if ignored_match not in to_keep:
starting = matches.chain_after(hole.start, seps,
predicate=lambda m, im=ignored_match: m == im)
if starting:
should_keep = self.should_keep(ignored_match, to_keep, matches, filepart, hole, True)
if should_keep:
# pylint:disable=unpacking-non-sequence
try:
append, crop = should_keep
except TypeError:
append, crop = should_keep, should_keep
if append:
to_keep.append(ignored_match)
if crop:
hole.start = ignored_match.end
for match in ignored_matches:
if self.should_remove(match, matches, filepart, hole, context):
to_remove.append(match)
for keep_match in to_keep:
if keep_match in to_remove:
to_remove.remove(keep_match)
if hole and hole.value:
hole.name = self.match_name
hole.tags = self.match_tags
if self.alternative_match_name:
# Split and keep values that can be a title
titles = hole.split(title_seps, lambda m: m.value)
for title_match in list(titles[1:]):
previous_title = titles[titles.index(title_match) - 1]
separator = matches.input_string[previous_title.end:title_match.start]
if len(separator) == 1 and separator == '-' \
and previous_title.raw[-1] not in seps \
and title_match.raw[0] not in seps:
titles[titles.index(title_match) - 1].end = title_match.end
titles.remove(title_match)
else:
title_match.name = self.alternative_match_name
else:
titles = [hole]
return titles, to_remove
def when(self, matches, context):
ret = []
to_remove = []
if matches.named(self.match_name, lambda match: 'expected' in match.tags):
return False
fileparts = [filepart for filepart in list(marker_sorted(matches.markers.named('path'), matches))
if not self.filepart_filter or self.filepart_filter(filepart, matches)]
# Priorize fileparts containing the year
years_fileparts = []
for filepart in fileparts:
year_match = matches.range(filepart.start, filepart.end, lambda match: match.name == 'year', 0)
if year_match:
years_fileparts.append(filepart)
for filepart in fileparts:
try:
years_fileparts.remove(filepart)
except ValueError:
pass
titles = self.check_titles_in_filepart(filepart, matches, context)
if titles:
titles, to_remove_c = titles
ret.extend(titles)
to_remove.extend(to_remove_c)
break
# Add title match in all fileparts containing the year.
for filepart in years_fileparts:
titles = self.check_titles_in_filepart(filepart, matches, context)
if titles:
# pylint:disable=unbalanced-tuple-unpacking
titles, to_remove_c = titles
ret.extend(titles)
to_remove.extend(to_remove_c)
if ret or to_remove:
return ret, to_remove
return False
class TitleFromPosition(TitleBaseRule):
"""
Add title match in existing matches
"""
dependency = [FilmTitleRule, SubtitlePrefixLanguageRule, SubtitleSuffixLanguageRule, SubtitleExtensionRule]
properties = {'title': [None], 'alternative_title': [None]}
def __init__(self):
super().__init__('title', ['title'], 'alternative_title')
def enabled(self, context):
return not is_disabled(context, 'alternative_title')
class PreferTitleWithYear(Rule):
"""
Prefer title where filepart contains year.
"""
dependency = TitleFromPosition
consequence = [RemoveMatch, AppendTags(['equivalent-ignore'])]
properties = {'title': [None]}
def when(self, matches, context):
with_year_in_group = []
with_year = []
titles = matches.named('title')
for title_match in titles:
filepart = matches.markers.at_match(title_match, lambda marker: marker.name == 'path', 0)
if filepart:
year_match = matches.range(filepart.start, filepart.end, lambda match: match.name == 'year', 0)
if year_match:
group = matches.markers.at_match(year_match, lambda m: m.name == 'group')
if group:
with_year_in_group.append(title_match)
else:
with_year.append(title_match)
to_tag = []
if with_year_in_group:
title_values = {title_match.value for title_match in with_year_in_group}
to_tag.extend(with_year_in_group)
elif with_year:
title_values = {title_match.value for title_match in with_year}
to_tag.extend(with_year)
else:
title_values = {title_match.value for title_match in titles}
to_remove = []
for title_match in titles:
if title_match.value not in title_values:
to_remove.append(title_match)
if to_remove or to_tag:
return to_remove, to_tag
return False
```
|
```xml
import { expect, type Page, type TestInfo } from '@playwright/test';
import WpAdminPage from '../../../../../pages/wp-admin-page';
import Breakpoints from '../../../../../assets/breakpoints';
import EditorPage from '../../../../../pages/editor-page';
export default class ReverseColumns {
readonly page: Page;
readonly testInfo: TestInfo;
readonly wpAdmin: WpAdminPage;
readonly editor: EditorPage;
constructor( page: Page, testInfo: TestInfo, apiRequests ) {
this.page = page;
this.testInfo = testInfo;
this.wpAdmin = new WpAdminPage( this.page, this.testInfo, apiRequests );
this.editor = new EditorPage( this.page, this.testInfo );
}
getFirstColumn() {
return this.editor.getPreviewFrame().locator( '[data-element_type="column"][data-col="50"]:nth-child(1)' ).first();
}
async reverseColumnsForBreakpoint( breakpoint: string ) {
await this.editor.openPanelTab( 'advanced' );
await this.editor.openSection( '_section_responsive' );
await this.editor.setSwitcherControlValue( `reverse_order_${ breakpoint }`, true );
}
async init() {
await this.wpAdmin.openNewPage();
await this.editor.closeNavigatorIfOpen();
await this.editor.getPreviewFrame().locator( '.elementor-add-section-inner' ).click( { button: 'right' } );
await this.editor.getPreviewFrame().click( '.elementor-add-section-button', { delay: 500, clickCount: 2 } );
await this.editor.getPreviewFrame().click( '.elementor-select-preset-list li:nth-child(2)' );
}
async initAdditionalBreakpoints() {
const editor = await this.wpAdmin.openNewPage();
await this.editor.getPreviewFrame().locator( '.elementor-add-section-inner' ).click( { button: 'right' } );
const pageUrl = new URL( this.page.url() );
const searchParams = pageUrl.searchParams;
const breakpoints = new Breakpoints( this.page );
await breakpoints.addAllBreakpoints( editor, searchParams.get( 'post' ) );
}
async resetAdditionalBreakpoints() {
const editor = await this.wpAdmin.openNewPage();
const breakpoints = new Breakpoints( this.page );
await breakpoints.resetBreakpoints( editor );
}
async testReverseColumnsOneActivated( testDevice, isExperimentBreakpoints = false ) {
await this.init();
await this.editor.changeResponsiveView( testDevice );
const firstColumn = this.getFirstColumn();
await expect( firstColumn ).toHaveCSS( 'order', '0' );
await this.reverseColumnsForBreakpoint( testDevice );
await expect( firstColumn ).toHaveCSS( 'order', '10' );
const breakpoints = isExperimentBreakpoints ? Breakpoints.getAll() : Breakpoints.getBasic(),
filteredBreakpoints = breakpoints.filter( ( value ) => testDevice !== value );
for ( const breakpoint of filteredBreakpoints ) {
await this.editor.changeResponsiveView( breakpoint );
await expect( firstColumn ).toHaveCSS( 'order', '0' );
}
}
async testReverseColumnsAllActivated( isExperimentBreakpoints = false ) {
await this.init();
const breakpoints = isExperimentBreakpoints ? Breakpoints.getAll() : Breakpoints.getBasic();
for ( const breakpoint of breakpoints ) {
if ( 'widescreen' === breakpoint ) {
continue;
}
await this.editor.changeResponsiveView( breakpoint );
const firstColumn = this.getFirstColumn();
if ( 'desktop' === breakpoint ) {
await expect( firstColumn ).toHaveCSS( 'order', '0' );
continue;
}
await this.reverseColumnsForBreakpoint( breakpoint );
await expect( firstColumn ).toHaveCSS( 'order', '10' );
}
}
}
```
|
Persian astronomy or Iranian astronomy refers to the astronomy in ancient Persian history.
Pre-Islamic history
Ancient Persians celebrated the vernal equinox, summer solstice, autumnal equinox, and winter solstice through a variety of different festivals and traditions.
Vernal equinox
Nowruz is the day of the vernal equinox and the moment the Sun crosses the celestial equator has been calculated for years. Nowruz was an important day during the Achaemenid period and continued in importance through the Sasanian dynasty.
Summer solstice
Tirgan is an ancient Iranian festival celebrating the summer solstice.
Autumnal equinox
Mehregan is an ancient Zoroastrian and Persian festival celebrating the autumnal equinox since at least the 4th century BC.
Winter solstice
Yaldā Night is an ancient Iranian festival celebrating the winter solstice of the Northern Hemisphere.
Star systems
Some old Persian names in astronomy have barely survived; the names of the four Royal stars that were used by the Persians for almanacs are Aldeberan, Regulus, Antares and Fomalhaut, and are thought by scientists to equate to the modern-day star systems of Alcyone, Regulus, Albireo, and Bungula (Alpha Centauri) for almanacs.
Planets
Tablet inscriptions set forth observations of Jupiter from the 43rd year of the reign of Artaxerxes II to the thirteenth year of Alexander the Great. The positions of the planets throughout the year were determined using astrological charts.
After Muslim conquests
After the Muslim conquest of Persia, much of Persian astronomy and astrology became intertwined with the astronomy in the medieval Islamic world, paving way for the Islamic Golden Age. Scientists translated studies in Sanskrit, Middle Persian, and Greek into Arabic, where the Indian Sanskrit and Persian Pahlavi (Middle Persian) sources taught medieval astronomers methods for calculating the position of heavenly bodies, and for creating tables recording the movement of the sun, the moon, and the five known planets.
The first major Muslim work of astronomy was Zij al-Sindhind by Persian mathematician al-Khwarizmi in 830. The work contains tables for the movements of the Sun, the moon and the five planets known at the time, and is significant as it introduced Ptolemaic concepts into Islamic sciences. This work also marks the turning point in Islamic astronomy. Hitherto, Muslim astronomers had adopted a primarily research approach to the field, translating works of others and learning already discovered knowledge. Al-Khwarizmi's work marked the beginning of nontraditional methods of study and calculations.
References
Astronomy in Iran
Persian culture
Iranian culture
|
```go
//
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing, software
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
package policy
import (
"context"
"fmt"
"time"
"github.com/goharbor/harbor/src/lib/q"
"github.com/goharbor/harbor/src/pkg/notification/policy/dao"
"github.com/goharbor/harbor/src/pkg/notification/policy/model"
)
var (
// Mgr is a global variable for the default notification policies
Mgr = NewManager()
)
// Manager manages the notification policies
type Manager interface {
// Create new policy
Create(ctx context.Context, policy *model.Policy) (int64, error)
// List the policies, returns the policy list and error
List(ctx context.Context, query *q.Query) ([]*model.Policy, error)
// Count the policies, returns the policy count and error
Count(ctx context.Context, query *q.Query) (int64, error)
// Get policy with specified ID
Get(ctx context.Context, id int64) (*model.Policy, error)
// Update the specified policy
Update(ctx context.Context, policy *model.Policy) error
// Delete the specified policy
Delete(ctx context.Context, policyID int64) error
// GetRelatedPolices get event type related policies in project
GetRelatedPolices(ctx context.Context, projectID int64, eventType string) ([]*model.Policy, error)
}
var _ Manager = &manager{}
type manager struct {
dao dao.DAO
}
// NewManager ...
func NewManager() Manager {
return &manager{
dao: dao.New(),
}
}
// Create notification policy
func (m *manager) Create(ctx context.Context, policy *model.Policy) (int64, error) {
t := time.Now()
policy.CreationTime = t
policy.UpdateTime = t
err := policy.ConvertToDBModel()
if err != nil {
return 0, err
}
return m.dao.Create(ctx, policy)
}
// List the notification policies, returns the policy list and error
func (m *manager) List(ctx context.Context, query *q.Query) ([]*model.Policy, error) {
policies := []*model.Policy{}
persisPolicies, err := m.dao.List(ctx, query)
if err != nil {
return nil, err
}
for _, policy := range persisPolicies {
err := policy.ConvertFromDBModel()
if err != nil {
return nil, err
}
policies = append(policies, policy)
}
return policies, nil
}
// Count the notification policies, returns the count and error
func (m *manager) Count(ctx context.Context, query *q.Query) (int64, error) {
return m.dao.Count(ctx, query)
}
// Get notification policy with specified ID
func (m *manager) Get(ctx context.Context, id int64) (*model.Policy, error) {
policy, err := m.dao.Get(ctx, id)
if err != nil {
return nil, err
}
if policy == nil {
return nil, nil
}
if err := policy.ConvertFromDBModel(); err != nil {
return nil, err
}
return policy, err
}
// Update the specified notification policy
func (m *manager) Update(ctx context.Context, policy *model.Policy) error {
policy.UpdateTime = time.Now()
err := policy.ConvertToDBModel()
if err != nil {
return err
}
return m.dao.Update(ctx, policy)
}
// Delete the specified notification policy
func (m *manager) Delete(ctx context.Context, policyID int64) error {
return m.dao.Delete(ctx, policyID)
}
// GetRelatedPolices get policies including event type in project
func (m *manager) GetRelatedPolices(ctx context.Context, projectID int64, eventType string) ([]*model.Policy, error) {
policies, err := m.List(ctx, q.New(q.KeyWords{"project_id": projectID}))
if err != nil {
return nil, fmt.Errorf("failed to get notification policies with projectID %d: %v", projectID, err)
}
var result []*model.Policy
for _, ply := range policies {
if !ply.Enabled {
continue
}
for _, t := range ply.EventTypes {
if t != eventType {
continue
}
result = append(result, ply)
}
}
return result, nil
}
```
|
Armed Forces Act (with its variations) is a stock short title used for legislation in India, Malaysia and the United Kingdom relating to armed forces. The bill for an act with this short title will usually have been known as an Armed Forces Bill during its passage through Parliament.
Armed Forces Acts may be a generic name either for legislation bearing that short title or for all legislation which relates to armed forces.
In the United Kingdom, an Armed Forces Act must be passed every five years to enable the maintenance of a standing army, which would otherwise be illegal under the Bill of Rights 1689.
List
India
Armed Forces (Special Powers) Acts
Malaysia
Armed Forces Act 1972
United Kingdom
Armed Forces (Housing Loans) Act 1949 (12, 13 & 14 Geo. 6. c. 77)
Armed Forces (Housing Loans) Act 1958 (7 & 8 Eliz. 2. c. 1)
Armed Forces (Housing Loans) Act 1965 (c. 9)
Armed Forces Act 1966 (c. 45)
Armed Forces Act 1971 (c. 33)
Armed Forces Act 1976 (c. 52)
Armed Forces Act 1981 (c. 55)
Armed Forces Act 1986 (c. 21)
Armed Forces Act 1991 (c. 62)
Armed Forces Act 1996 (c. 46)
Armed Forces Discipline Act 2000 (c. 4)
Armed Forces Act 2001 (c. 19)
Armed Forces (Pensions and Compensation) Act 2004 (c. 32)
Armed Forces Act 2006 (c. 52)
Armed Forces Act 2011 (c. 18)
Armed Forces Act 2016 (c. 21)
Armed Forces Act 2021 (c. 35)
See also
Defence Act
References
Lists of legislation by short title
|
```yaml
name: 2022 Steering Committee Election
organization: Kubernetes
start_datetime: 2022-09-06 00:00:01
end_datetime: 2022-09-30 11:59:59
no_winners: 3
allow_no_opinion: True
delete_after: True
show_candidate_fields:
- employer
- slack
election_officers:
- dims
- kaslin
- coderanger
eligibility: Kubernetes Org members with 50 or more contributions in the last year can vote. See [the election guide](path_to_url
exception_description: Not all contributions are measured by DevStats. If you have contributions that are not so measured, then please request an exception to allow you to vote via the Elekto application.
exception_due: 2022-09-17 11:59:59
```
|
Muhammad Farid Badrul Hisham is a Grand Prix motorcycle racer from Malaysia.
Career statistics
2015- 18th, Asia Road Race SS600
Championship #83 Kawasaki ZX-6R
2014- 20th, Asia Road Race SS600 Championship #83 Kawasaki ZX-6R
2013- 30th, Asia Road Race SS600 Championship #93 Yamaha YZF-R6
2012- 13th, Asia Road Race SS600 Championship #93 Yamaha YZF-R6
2011- 44th, British National Superstock 600 Championship #93 Kawasaki ZX-6R
By season
Races by year
(key)
References
External links
Profile on motogp.com
Living people
1993 births
Malaysian motorcycle racers
125cc World Championship riders
|
```objective-c
/*
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contributing project authors may
* be found in the AUTHORS file in the root of the source tree.
*/
#ifndef MODULES_AUDIO_CODING_CODECS_PCM16B_AUDIO_ENCODER_PCM16B_H_
#define MODULES_AUDIO_CODING_CODECS_PCM16B_AUDIO_ENCODER_PCM16B_H_
#include "modules/audio_coding/codecs/g711/audio_encoder_pcm.h"
#include "rtc_base/constructor_magic.h"
namespace webrtc {
class AudioEncoderPcm16B final : public AudioEncoderPcm {
public:
struct Config : public AudioEncoderPcm::Config {
public:
Config() : AudioEncoderPcm::Config(107), sample_rate_hz(8000) {}
bool IsOk() const;
int sample_rate_hz;
};
explicit AudioEncoderPcm16B(const Config& config)
: AudioEncoderPcm(config, config.sample_rate_hz) {}
protected:
size_t EncodeCall(const int16_t* audio,
size_t input_len,
uint8_t* encoded) override;
size_t BytesPerSample() const override;
AudioEncoder::CodecType GetCodecType() const override;
private:
RTC_DISALLOW_COPY_AND_ASSIGN(AudioEncoderPcm16B);
};
} // namespace webrtc
#endif // MODULES_AUDIO_CODING_CODECS_PCM16B_AUDIO_ENCODER_PCM16B_H_
```
|
```php
<?php declare(strict_types=1);
namespace Tests\Utils\Validators;
use Nuwave\Lighthouse\Validation\Validator;
final class EmailCustomAttributeValidator extends Validator
{
/** @return array{email: array<string>} */
public function rules(): array
{
return [
'email' => ['email'],
];
}
/** @return array{email: string} */
public function attributes(): array
{
return ['email' => 'email address'];
}
}
```
|
```java
package org.mitre.synthea.helpers;
import java.time.LocalDateTime;
import java.time.ZoneOffset;
import org.mitre.synthea.world.agents.Person;
/**
* A place for helpers related to telemedicine.
*/
public class Telemedicine {
/**
* Odds of an encounter being virtual, a.k.a. telemedicine are taken from the McKinsey report:
* path_to_url
* <p>
* The report claims that since April 2020, telemedicine accounted for 13 - 17% of visits. 15%
* was used here for simplicity. It also claims that the current levels of telemedicine are 38
* times the prepandemic baseline. That would make the prepandemic baseline 0.4%
* </p>
*/
public static final double CURRENT_CHANCE = 0.15;
public static final double PREPANDEMIC_CHANCE = 0.004;
public static final long TELEMEDICINE_START_DATE = LocalDateTime.of(2016, 1, 1, 12, 0)
.toInstant(ZoneOffset.UTC).toEpochMilli();
public static final long TELEMEDICINE_UPTAKE_DATE = LocalDateTime.of(2020, 4, 1, 12, 0)
.toInstant(ZoneOffset.UTC).toEpochMilli();
/**
* Determines whether an encounter should be telemedicine, with different chances before and
* after the start of the COVID-19 pandemic.
* @param person source of randomness
* @param time current time in the simulation
* @return true if the encounter should be virtual
*/
public static boolean shouldEncounterBeVirtual(Person person, long time) {
if (time < TELEMEDICINE_START_DATE) {
return false;
}
if (time < TELEMEDICINE_UPTAKE_DATE) {
return person.rand() <= PREPANDEMIC_CHANCE;
} else {
return person.rand() <= CURRENT_CHANCE;
}
}
}
```
|
Nicholas Bond-Owen (born 13 November 1968) (sometimes billed as Nick or Nicholas Owen) is a child actor of the 1970s and 1980s best known for playing Tristram Fourmile in all five series of the popular comedy George and Mildred and in the film of the same name.
Biography
Born in Ashford, Surrey in 1968 as Nicholas Owen, to parents Diane and Sid Owen, he got into acting by accident after his older brother signed with a child model agency. As there were already several Nicholas Owens registered as actors with Equity, he needed to pick a new name. As a fan of James Bond he chose 'Bond' and so became Bond-Owen. He went to school at Abbotsford County Secondary school in Ashford (Surrey) from 1980 to 1984 and then on to Spelthorne College until 1986, where he studied photography.
His first film role was as Kevin in Confessions from a Holiday Camp (1977). Other film appearances included Little Boy in Rhubarb Rhubarb (1980), Tristram Fourmile in George and Mildred (1980), and Freddie in Lassiter (1984) with Tom Selleck.
His television roles included Tristram Fourmile in George and Mildred (1976–1979), Park Ranger with Richard Gibson (1979), Alan Shaw in Airline (1982), Peterkin in The Coral Island (1983), Charley Bates in Oliver Twist (1985), Graham in an episode of Dramarama (1986), First Boy in David Copperfield (1986), and Derek, a troubled teenager in an episode of the schools' series Starting Out (1986). In 2001 he was interviewed for the documentary The Unforgettable Yootha Joyce during which he reminisced about working with the actress Yootha Joyce.
Bond-Owen also appeared in television adverts for McDonald's, Barclays, Halifax Building Society, Cadbury's Flake and British Gas.
In 1987, aged 19, he left acting and for nearly 17 years worked for Penguin Books in all departments from courier to distributions manager. For 10 months he worked in the same capacity for Pearson Books and in 2014 was the distribution director for the free newspaper City A.M..
Personal life
Bond-Owen lives with his wife Heidi. He has two sons.
Filmography
Television roles
References
External links
Bond-Owen on the British Film Institute website
1968 births
English male television actors
English male film actors
Living people
British book publishers (people)
British newspaper people
English male child actors
Male actors from Surrey
People from Ashford, Surrey
|
The Mukri tribe is a Kurdish tribe residing in West Azerbaijan Province, Iran. Mukri princes made up the elite-ruling class of the emirate of Mukriyan, while the Dehbruki tribe made up the majority of the rural petty-ruling class.
History
The Mukri are notable for having produced many distinguished figures, such as Aziz Khan Mukri, who served as commander-in-chief of the army from 1853 to 1857.
Abbas I of Persia married a Mukri noblewoman and daughter of the Mukri governor of Maragheh in 1610 CE after defeating the Mukri in the Siege of Dimdim and executing her brother and his men; despite her relatively young age while in Mukriyan, she was known to be popular among the Mukri.
Mukri women traditionally mixed with men and did not veil, it was also standard for Mukris to greet guests with cheek kisses even between opposite genders. However, despite their free association with men, women had to, historically, abide to the Mukri patriarchal code to "retain their honor” such as not engaging in adultery, which includes subtle romance such as courtship and romantic relationships with the absence of fornication which was otherwise tolerated by the surrounding semi-nomadic Kurdish Bolbas tribes like the Mangur, who’s tribeswomen enjoyed greater freedoms compared to urban women of the Mukri.
See also
Mukriyan
References
Sources
Kurdish tribes
Kurdish tribes of Iran
West Azerbaijan Province
|
```css
/* PrismJS 1.23.0
path_to_url#themes=prism-tomorrow&languagesyour_sha512_hashapplescript+aqlyour_sha512_hashbnfyour_sha512_hashcsp+crystal+css-extras+cypher+d+dart+dax+dhall+diff+django+dns-zone-file+docker+ebnf+editorconfig+eiffel+ejs+elixir+elm+etlua+erb+erlang+excel-formula+fsharp+factor+firestore-security-rules+flow+fortran+ftlyour_sha512_hashhaxe+hcl+hlsl+http+hpkp+hstsyour_sha512_hashjq+jsdoc+js-extras+json+json5+jsonp+jsstacktrace+js-templatesyour_sha512_hash+makefile+markdown+markup-templating+matlab+mel+mizar+mongodb+monkey+moonscript+n1ql+n4js+nand2tetris-hdl+naniscript+your_sha512_hash+pcaxis+peoplecode+perl+php+phpdoc+php-extras+plsqlyour_sha512_hash+your_sha512_hash+ruby+rust+sas+sass+scss+scala+scheme+shell-session+smali+smalltalk+smarty+solidity+solution-file+soy+sparql+splunk-spl+sqf+sql+stan+iecst+stylus+swift+t4-templating+t4-cs+t4-your_sha512_hashvelocity+verilog+vhdl+vim+visual-basic+warpscript+wasm+wiki+xeora+xml-doc+xojo+xquery+yaml+yang+zig&plugins=line-numbers+toolbar+copy-to-clipboard+filter-highlight-all */
/**
* prism.js tomorrow night eighties for JavaScript, CoffeeScript, CSS and HTML
* Based on path_to_url
* @author Rose Pritchard
*/
code[class*="language-"],
pre[class*="language-"] {
color: #ccc;
background: none;
font-family: "YaHei Consolas Hybrid", JetBrains Mono NL, Consolas, Monaco, 'Andale Mono', 'Ubuntu Mono', monospace;
font-size: 1em;
text-align: left;
white-space: pre;
word-spacing: normal;
word-break: normal;
word-wrap: normal;
line-height: 1.5;
border-radius: .3em;
-moz-tab-size: 4;
-o-tab-size: 4;
tab-size: 4;
-webkit-hyphens: none;
-moz-hyphens: none;
-ms-hyphens: none;
hyphens: none;
}
/* Code blocks */
pre[class*="language-"] {
padding: .4em;
margin: .5em 0;
overflow: auto;
}
:not(pre) > code[class*="language-"],
pre[class*="language-"] {
background: #2d2d2d;
}
/* Inline code */
:not(pre) > code[class*="language-"] {
padding: .1em;
border-radius: .3em;
white-space: normal;
}
.token.comment,
.token.block-comment,
.token.prolog,
.token.doctype,
.token.cdata {
color: #999;
}
.token.punctuation {
color: #ccc;
}
.token.tag,
.token.attr-name,
.token.namespace,
.token.deleted {
color: #e2777a;
}
.token.function-name {
color: #6196cc;
}
.token.boolean,
.token.number,
.token.function {
color: #f08d49;
}
.token.property,
.token.class-name,
.token.constant,
.token.symbol {
color: #f8c555;
}
.token.selector,
.token.important,
.token.atrule,
.token.keyword,
.token.builtin {
color: #cc99cd;
}
.token.string,
.token.char,
.token.attr-value,
.token.regex,
.token.variable {
color: #7ec699;
}
.token.operator,
.token.entity,
.token.url {
color: #67cdcc;
}
.token.important,
.token.bold {
font-weight: bold;
}
.token.italic {
font-style: italic;
}
.token.entity {
cursor: help;
}
.token.inserted {
color: green;
}
pre[class*="language-"].line-numbers {
position: relative;
padding-left: 3.8em;
counter-reset: linenumber;
}
pre[class*="language-"].line-numbers > code {
position: relative;
white-space: inherit;
}
.line-numbers .line-numbers-rows {
position: absolute;
pointer-events: none;
top: 0;
font-size: 100%;
left: -3.8em;
width: 3em; /* works for line-numbers below 1000 lines */
letter-spacing: -1px;
border-right: 1px solid #999;
-webkit-user-select: none;
-moz-user-select: none;
-ms-user-select: none;
user-select: none;
}
.line-numbers-rows > span {
display: block;
counter-increment: linenumber;
}
.line-numbers-rows > span:before {
content: counter(linenumber);
color: #999;
display: block;
padding-right: 0.8em;
text-align: right;
}
div.code-toolbar {
position: relative;
}
div.code-toolbar > .toolbar {
position: absolute;
top: .3em;
right: .2em;
transition: opacity 0.3s ease-in-out;
opacity: 0;
}
div.code-toolbar:hover > .toolbar {
opacity: 1;
}
/* Separate line b/c rules are thrown out if selector is invalid.
IE11 and old Edge versions don't support :focus-within. */
div.code-toolbar:focus-within > .toolbar {
opacity: 1;
}
div.code-toolbar > .toolbar .toolbar-item {
display: inline-block;
}
div.code-toolbar > .toolbar a {
cursor: pointer;
}
div.code-toolbar > .toolbar button {
background: none;
border: 0;
color: inherit;
font: inherit;
line-height: normal;
overflow: visible;
padding: 0;
-webkit-user-select: none; /* for button */
-moz-user-select: none;
-ms-user-select: none;
}
div.code-toolbar > .toolbar a,
div.code-toolbar > .toolbar button,
div.code-toolbar > .toolbar span {
color: #bbb;
font-size: .8em;
padding: 0 .5em;
background: #f5f2f0;
background: rgba(224, 224, 224, 0.2);
box-shadow: 0 2px 0 0 rgba(66, 185, 131, .1);;
border-radius: .5em;
}
div.code-toolbar > .toolbar a:hover,
div.code-toolbar > .toolbar a:focus,
div.code-toolbar > .toolbar button:hover,
div.code-toolbar > .toolbar button:focus,
div.code-toolbar > .toolbar span:hover,
div.code-toolbar > .toolbar span:focus {
color: #ffffff;
text-decoration: none;
}
```
|
```python
from routersploit.core.exploit import *
from routersploit.modules.creds.generic.telnet_default import Exploit as TelnetDefault
class Exploit(TelnetDefault):
__info__ = {
"name": "Thomson Router Default Telnet Creds",
"description": "Module performs dictionary attack against Thomson Router Telnet service. "
"If valid credentials are found, they are displayed to the user.",
"authors": (
"Marcin Bury <marcin[at]threat9.com>", # routersploit module
),
"devices": (
"Thomson Router",
),
}
target = OptIP("", "Target IPv4, IPv6 address or file with ip:port (file://)")
port = OptPort(23, "Target Telnet port")
threads = OptInteger(1, "Number of threads")
defaults = OptWordlist("admin:admin,admin:password", "User:Pass or file with default credentials (file://)")
```
|
Christophe de Ponfilly (1951–2006) was a French journalist, film director, cinematographer, and screenwriter. He was married to Florence Dauchez .
Awards
Prix Albert-Londres 1985 (for Les Combattants de l'Insolence)
Special jury prize, festival du scoop et du journalisme d’Angers (for Monsieur le Rabin - 1999)
Special jury prize, 14th global television festival, Japan. (for Massoud, l'afghan - 2000)
Planet Prize, Special jury prize, et Prize from the youth Jury, F.I.G.R.A.(for Massoud, l'afghan - 1998)
Best documentary, Festival dei Popoli (Florence) (Massoud, l'afghan - 1998)
Grand Prize, festival Montagne et Aventure d'Autrans (Massoud l'afghan - 2001)
C.F.A. prize, "best documentary of the year" (Les Plumes font leur CirQue)
Planète Câble prize, and special jury prize, F.I.G.R.A. (Naître, des histoires banales mais belles - 1994)
UNESCO prize, International film and art festival, 1994 (Do ré mi fa sol la si do, les Kummer)
Prix spécial du jury à La Nuit des Yeux d’Or de Reuil Malmaison 1994 (Kaboul au bout du monde)
UNESCO prize, Festival of African programs, Nairobi 1994 (Télé-Radio-Magie)
Best documentary, 1992 at Rencontres Européennes de Télévision de Reims (W Street - 1992)
Unda prize, Monte-Carlo International Festival (A cœur, à corps, à cris - 1992)
Grand prize, du Festival international de journalisme d'Angers 1990 (Poussières de Guerre)
Aigle d'or du Festival international d'histoire de Rueil-Malmaison 1990 (Poussières de Guerre)
Mention au Festival Europa 1991 (Autofolies)
Prix du meilleur film humanitaire 1987, festival du grand reportage de La Ciotat (Les damnés de l'URSS et Soldats perdus)
Prix international ONDAS 1983 (Une vallée contre un empire)
See also
Albert Films
Frédéric Laffont
Interscoop, The Interscoop Press Agency est. 1982
External links
1951 births
2006 suicides
French documentary filmmakers
French film directors
French film producers
French male screenwriters
20th-century French screenwriters
Writers from Paris
French war correspondents
20th-century French male writers
French male non-fiction writers
Suicides by firearm in France
2006 deaths
|
```java
package com.iota.iri.network.neighbor.impl;
import com.iota.iri.network.neighbor.NeighborMetrics;
import java.util.concurrent.atomic.AtomicLong;
/**
* Implements {@link NeighborMetrics} using {@link AtomicLong}s.
*/
public class NeighborMetricsImpl implements NeighborMetrics {
private AtomicLong allTxsCount = new AtomicLong();
private AtomicLong invalidTxsCount = new AtomicLong();
private AtomicLong staleTxsCount = new AtomicLong();
private AtomicLong randomTxsCount = new AtomicLong();
private AtomicLong sentTxsCount = new AtomicLong();
private AtomicLong newTxsCount = new AtomicLong();
private AtomicLong droppedSendPacketsCount = new AtomicLong();
@Override
public long getAllTransactionsCount() {
return allTxsCount.get();
}
@Override
public long incrAllTransactionsCount() {
return allTxsCount.incrementAndGet();
}
@Override
public long getInvalidTransactionsCount() {
return invalidTxsCount.get();
}
@Override
public long incrInvalidTransactionsCount() {
return invalidTxsCount.incrementAndGet();
}
@Override
public long getStaleTransactionsCount() {
return staleTxsCount.get();
}
@Override
public long incrStaleTransactionsCount() {
return staleTxsCount.incrementAndGet();
}
@Override
public long getNewTransactionsCount() {
return newTxsCount.get();
}
@Override
public long incrNewTransactionsCount() {
return newTxsCount.incrementAndGet();
}
@Override
public long getRandomTransactionRequestsCount() {
return randomTxsCount.get();
}
@Override
public long incrRandomTransactionRequestsCount() {
return randomTxsCount.incrementAndGet();
}
@Override
public long getSentTransactionsCount() {
return sentTxsCount.get();
}
@Override
public long incrSentTransactionsCount() {
return sentTxsCount.incrementAndGet();
}
@Override
public long getDroppedSendPacketsCount() {
return droppedSendPacketsCount.get();
}
@Override
public long incrDroppedSendPacketsCount() {
return droppedSendPacketsCount.incrementAndGet();
}
}
```
|
```xml
<!--
~ contributor license agreements. See the NOTICE file distributed with
~ this work for additional information regarding copyright ownership.
~
~ path_to_url
~
~ Unless required by applicable law or agreed to in writing, software
~ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-->
<dataset>
<metadata>
<column name="umid"/>
<column name="srvid"/>
<column name="srvname"/>
<column name="umuser"/>
<column name="usename"/>
<column name="umoptions"/>
</metadata>
</dataset>
```
|
```python
#!/pxrpythonsubst
#
#
# path_to_url
from __future__ import print_function
import argparse
from pxr import Sdf, Usd
# Parse options.
parser = argparse.ArgumentParser()
parser.add_argument('layer',
help = 'A path to a scene description layer.')
parser.add_argument('--session', dest='session', default='',
help = 'The asset path to the session layer.')
args = parser.parse_args()
rootLayerPath = args.layer
rootLayer = Sdf.Layer.FindOrOpen(rootLayerPath)
sessionLayer = None
if args.session:
sessionLayerPath = args.session
sessionLayer = Sdf.Layer.FindOrOpen(sessionLayerPath)
usd = Usd.Stage.Open(rootLayer, sessionLayer)
print(usd.ExportToString(addSourceFileComment=False))
```
|
```xml
import * as React from 'react';
import createSvgIcon from '../utils/createSvgIcon';
const FileImageIcon = createSvgIcon({
svg: ({ classes }) => (
<svg xmlns="path_to_url" viewBox="0 0 2048 2048" className={classes.svg} focusable="false">
<path d="M256 1920h1536v128H128V0h1115l549 549v91h-640V128H256v1792zM1280 512h293l-293-293v293zm768 256v1024H640V768h1408zM768 896v421l320-319 416 416 160-160 256 256V896H768zm987 768h139l-230-230-69 70 160 160zm-987 0h805l-485-486-320 321v165zm960-512q-26 0-45-19t-19-45q0-26 19-45t45-19q26 0 45 19t19 45q0 26-19 45t-45 19z" />
</svg>
),
displayName: 'FileImageIcon',
});
export default FileImageIcon;
```
|
Siraj ul Haq (Pashto: سراج الحق ; born 5 September 1962) is a Pakistani politician who was elected as the chief of Jamaat-e-Islami, a religious political party in Pakistan which seeks to establish an Islamic legal system. He also served as the senior minister of Khyber Pakhtunkhwa, in the Pervez Khattak administration.
Early years
Siraj ul Haq was born in Meerzo village of Shabqadar Tehsil in Charsadda District. However, he paternally belongs to Samarbagh in Lower Dir District. His father was a graduate of Darul Uloom Deoband and the superintendent (مہتمم) of a Madrassa. He received his early education in local regional schools and studied political science in the University of Peshawar and MA (Education) from University of Punjab in (1990). At university, he studied the books of Maulana Syed Abul Aala Maududi and Maulana Naeem Siddiqui. He joined Islami Jamiat-e-Talaba and was the chief of Islami Jamiat-e-Talaba from 1988 to 1991. He has been elected twice as MPA from PK-95 constituency.
Political career
He was elected to Khyber Pakhtunkhwa Assembly in the 2002 election from the platform of Muttahida Majlis-e-Amal and was made finance minister in the provincial cabinet under the leadership of Akram Khan Durrani. However, he allegedly resigned in protest against the deadly US drone strike on a madrassa in Bajaur Agency which resulted in the deaths of 86 children. Though the then Ameer Jamat e Islami, Qazi Hussain Ahmad, claimed that it was the party decision to vacate one of the two offices i.e. Ministry and Ameer Jamat e Islami Khyber Pakhtunkhwa, then N.W.F.P. His party boycotted the 2008 election. In 2013, he contested on Jamaat-e-Islami's ticket and was elected to the assembly.
He remained the Deputy Ameer of Jamaat-e-Islami until 30 March 2014 when he was elected as the Ameer of Jamaat-e-Islami Pakistan. In accordance with party rules whereby intra-party elections are held every five years, he was re-elected as Ameer (chief) of Jamaat-e-Islami in March 2019, until March 2024. He remains immensely popular in his constituency and is known for his modesty among friends and foes alike.
He resigned from the Ministry of Finance in June 2014 right after the budget because, according to party rules, one person cannot hold two offices at the same time. At that time, he was Ameer of Jamaat-e-Islami and Senior Minister in KPK Assembly.
He gained immense popularity when Imran Khan and Muhammad Tahir-ul-Qadri announced the Long March against Prime Minister Muhammad Mian Nawaz Sharif. He acted as a neutral figure. He convinced the government and Imran Khan to negotiate and due to his efforts the government became stable. He said that the Jamaat-e-Islami would not let democracy be derailed and, political differences aside, democracy would be saved. For his efforts, he received an award from the government of Pakistan on 14 August 2014 from President Mamnoon Hussain.
In 2015, he fought and won the election for senate. He is considered to be a senior member of the Parliament of Pakistan.
During the 2018 general elections, he lost the national assembly seat NA-7 Lower Dir II to his rival candidate, Muhammad Bashir Khan of PTI, by a margin of 16,144 votes and was the runner up.
References
External links
1962 births
Living people
People from Lower Dir District
Pashtun politicians
Jamaat-e-Islami Pakistan politicians
University of Peshawar alumni
University of the Punjab alumni
Pakistani senators (14th Parliament)
Emirs of Jamaat-e-Islami Pakistan
|
```go
package indexheader
import (
"context"
"io"
"github.com/pkg/errors"
"github.com/prometheus/prometheus/tsdb/index"
)
// NotFoundRangeErr is an error returned by PostingsOffset when there is no posting for given name and value pairs.
var NotFoundRangeErr = errors.New("range not found")
// Reader is an interface allowing to read essential, minimal number of index fields from the small portion of index file called header.
type Reader interface {
io.Closer
// IndexVersion returns version of index.
IndexVersion() (int, error)
// PostingsOffsets returns start and end offsets for postings for given name and values.
// Input values need to be sorted.
// If the requested label name doesn't exist, then no posting and error will be returned.
// If the requested label name exists, but some values don't exist, the corresponding index range
// will be set to -1 for both start and end.
PostingsOffsets(name string, value ...string) ([]index.Range, error)
// PostingsOffset returns start and end offsets of postings for given name and value.
// The end offset might be bigger than the actual posting ending, but not larger than the whole index file.
// NotFoundRangeErr is returned when no index can be found for given name and value.
PostingsOffset(name string, value string) (index.Range, error)
// LookupSymbol returns string based on given reference.
// Error is return if the symbol can't be found.
LookupSymbol(ctx context.Context, o uint32) (string, error)
// LabelValues returns all label values for given label name or error.
// If no values are found for label name, or label name does not exists,
// then empty string is returned and no error.
LabelValues(name string) ([]string, error)
// LabelNames returns all label names in sorted order.
LabelNames() ([]string, error)
}
```
|
```java
package com.yahoo.search.query.profile.types.test;
import com.yahoo.component.ComponentId;
import com.yahoo.container.jdisc.HttpRequest;
import com.yahoo.jdisc.http.HttpRequest.Method;
import com.yahoo.search.Query;
import com.yahoo.search.query.profile.QueryProfile;
import com.yahoo.search.query.profile.QueryProfileRegistry;
import com.yahoo.search.query.profile.compiled.CompiledQueryProfileRegistry;
import com.yahoo.search.query.profile.types.FieldDescription;
import com.yahoo.search.query.profile.types.FieldType;
import com.yahoo.search.query.profile.types.QueryProfileType;
import com.yahoo.search.query.profile.types.QueryProfileTypeRegistry;
import com.yahoo.search.test.QueryTestCase;
import org.junit.jupiter.api.Test;
import static org.junit.jupiter.api.Assertions.assertEquals;
/**
* @author bratseth
*/
public class MandatoryTestCase {
private static class Fixture1 {
final QueryProfileRegistry registry = new QueryProfileRegistry();
final QueryProfileTypeRegistry typeRegistry = new QueryProfileTypeRegistry();
final QueryProfileType type = new QueryProfileType(new ComponentId("testtype"));
final QueryProfileType user = new QueryProfileType(new ComponentId("user"));
public Fixture1() {
typeRegistry.register(type);
typeRegistry.register(user);
addTypeFields(type, typeRegistry);
addUserFields(user, typeRegistry);
}
private static void addTypeFields(QueryProfileType type, QueryProfileTypeRegistry registry) {
type.addField(new FieldDescription("myString", FieldType.fromString("string", registry), true));
type.addField(new FieldDescription("myInteger", FieldType.fromString("integer", registry)));
type.addField(new FieldDescription("myLong", FieldType.fromString("long", registry)));
type.addField(new FieldDescription("myFloat", FieldType.fromString("float", registry)));
type.addField(new FieldDescription("myDouble", FieldType.fromString("double", registry)));
type.addField(new FieldDescription("myQueryProfile", FieldType.fromString("query-profile", registry)));
type.addField(new FieldDescription("myUserQueryProfile", FieldType.fromString("query-profile:user", registry), true));
}
private static void addUserFields(QueryProfileType user, QueryProfileTypeRegistry registry) {
user.addField(new FieldDescription("myUserString", FieldType.fromString("string", registry), true));
user.addField(new FieldDescription("myUserInteger", FieldType.fromString("integer", registry), true));
}
}
@Test
void testMandatoryFullySpecifiedQueryProfile() {
Fixture1 fixture = new Fixture1();
QueryProfile test = new QueryProfile("test");
test.setType(fixture.type);
test.set("myString", "aString", fixture.registry);
fixture.registry.register(test);
QueryProfile myUser = new QueryProfile("user");
myUser.setType(fixture.user);
myUser.set("myUserInteger", 1, fixture.registry);
myUser.set("myUserString", 1, fixture.registry);
test.set("myUserQueryProfile", myUser, fixture.registry);
fixture.registry.register(myUser);
CompiledQueryProfileRegistry cRegistry = fixture.registry.compile();
// Fully specified request
assertError(null, new Query(QueryTestCase.httpEncode("?queryProfile=test"), cRegistry.getComponent("test")));
}
@Test
void testMandatoryRequestPropertiesNeeded() {
Fixture1 fixture = new Fixture1();
QueryProfile test = new QueryProfile("test");
test.setType(fixture.type);
fixture.registry.register(test);
QueryProfile myUser = new QueryProfile("user");
myUser.setType(fixture.user);
myUser.set("myUserInteger", 1, fixture.registry);
test.set("myUserQueryProfile", myUser, fixture.registry);
fixture.registry.register(myUser);
CompiledQueryProfileRegistry cRegistry = fixture.registry.compile();
// Underspecified request 1
assertError("Incomplete query: Parameter 'myString' is mandatory in query profile 'test' of type 'testtype' but is not set",
new Query(HttpRequest.createTestRequest("", Method.GET), cRegistry.getComponent("test")));
// Underspecified request 2
assertError("Incomplete query: Parameter 'myUserQueryProfile.myUserString' is mandatory in query profile 'test' of type 'testtype' but is not set",
new Query(HttpRequest.createTestRequest("?myString=aString", Method.GET), cRegistry.getComponent("test")));
// Fully specified request
assertError(null, new Query(HttpRequest.createTestRequest("?myString=aString&myUserQueryProfile.myUserString=userString", Method.GET), cRegistry.getComponent("test")));
}
/** Same as above except the whole thing is nested in maps */
@Test
void testMandatoryNestedInMaps() {
Fixture1 fixture = new Fixture1();
QueryProfile topMap = new QueryProfile("topMap");
fixture.registry.register(topMap);
QueryProfile subMap = new QueryProfile("topSubMap");
topMap.set("subMap", subMap, fixture.registry);
fixture.registry.register(subMap);
QueryProfile test = new QueryProfile("test");
test.setType(fixture.type);
subMap.set("test", test, fixture.registry);
fixture.registry.register(test);
QueryProfile myUser = new QueryProfile("user");
myUser.setType(fixture.user);
myUser.set("myUserInteger", 1, fixture.registry);
test.set("myUserQueryProfile", myUser, fixture.registry);
fixture.registry.register(myUser);
CompiledQueryProfileRegistry cRegistry = fixture.registry.compile();
// Underspecified request 1
assertError("Incomplete query: Parameter 'subMap.test.myString' is mandatory in query profile 'topMap' but is not set",
new Query(HttpRequest.createTestRequest("", Method.GET), cRegistry.getComponent("topMap")));
// Underspecified request 2
assertError("Incomplete query: Parameter 'subMap.test.myUserQueryProfile.myUserString' is mandatory in query profile 'topMap' but is not set",
new Query(HttpRequest.createTestRequest("?subMap.test.myString=aString", Method.GET), cRegistry.getComponent("topMap")));
// Fully specified request
assertError(null, new Query(HttpRequest.createTestRequest("?subMap.test.myString=aString&subMap.test.myUserQueryProfile.myUserString=userString", Method.GET), cRegistry.getComponent("topMap")));
}
/** Here, no user query profile is referenced in the query profile, but one is chosen in the request */
@Test
void testMandatoryUserProfileSetInRequest() {
Fixture1 fixture = new Fixture1();
QueryProfile test = new QueryProfile("test");
test.setType(fixture.type);
QueryProfile myUser = new QueryProfile("user");
myUser.setType(fixture.user);
myUser.set("myUserInteger", 1, null);
QueryProfileRegistry registry = new QueryProfileRegistry();
registry.register(test);
registry.register(myUser);
CompiledQueryProfileRegistry cRegistry = registry.compile();
// Underspecified request 1
assertError("Incomplete query: Parameter 'myUserQueryProfile' is mandatory in query profile 'test' of type 'testtype' but is not set",
new Query(HttpRequest.createTestRequest("?myString=aString", Method.GET), cRegistry.getComponent("test")));
// Underspecified request 1
assertError("Incomplete query: Parameter 'myUserQueryProfile.myUserString' is mandatory in query profile 'test' of type 'testtype' but is not set",
new Query(HttpRequest.createTestRequest("?myString=aString&myUserQueryProfile=user", Method.GET), cRegistry.getComponent("test")));
// Fully specified request
assertError(null, new Query(HttpRequest.createTestRequest("?myString=aString&myUserQueryProfile=user&myUserQueryProfile.myUserString=userString", Method.GET), cRegistry.getComponent("test")));
}
/** Here, a partially specified query profile is added to a non-mandatory field, making the request underspecified */
@Test
void testNonMandatoryUnderspecifiedUserProfileSetInRequest() {
Fixture1 fixture = new Fixture1();
QueryProfile test = new QueryProfile("test");
test.setType(fixture.type);
fixture.registry.register(test);
QueryProfile myUser = new QueryProfile("user");
myUser.setType(fixture.user);
myUser.set("myUserInteger", 1, fixture.registry);
myUser.set("myUserString", "userValue", fixture.registry);
test.set("myUserQueryProfile", myUser, fixture.registry);
fixture.registry.register(myUser);
QueryProfile otherUser = new QueryProfile("otherUser");
otherUser.setType(fixture.user);
otherUser.set("myUserInteger", 2, fixture.registry);
fixture.registry.register(otherUser);
CompiledQueryProfileRegistry cRegistry = fixture.registry.compile();
// Fully specified request
assertError(null, new Query(HttpRequest.createTestRequest("?myString=aString", Method.GET), cRegistry.getComponent("test")));
// Underspecified because an underspecified profile is added
assertError("Incomplete query: Parameter 'myQueryProfile.myUserString' is mandatory in query profile 'test' of type 'testtype' but is not set",
new Query(HttpRequest.createTestRequest("?myString=aString&myQueryProfile=otherUser", Method.GET), cRegistry.getComponent("test")));
// Back to fully specified
assertError(null, new Query(HttpRequest.createTestRequest("?myString=aString&myQueryProfile=otherUser&myQueryProfile.myUserString=userString", Method.GET), cRegistry.getComponent("test")));
}
private static class Fixture2 {
final QueryProfileRegistry registry = new QueryProfileRegistry();
final QueryProfileTypeRegistry typeRegistry = new QueryProfileTypeRegistry();
final QueryProfileType rootType = new QueryProfileType(new ComponentId("root"));
final QueryProfileType mandatoryType = new QueryProfileType(new ComponentId("mandatory-type"));
public Fixture2() {
typeRegistry.register(rootType);
typeRegistry.register(mandatoryType);
mandatoryType.inherited().add(rootType);
mandatoryType.addField(new FieldDescription("foobar", FieldType.fromString("string", typeRegistry), true));
}
}
@Test
void testMandatoryInParentType() {
Fixture2 fixture = new Fixture2();
QueryProfile defaultProfile = new QueryProfile("default");
defaultProfile.setType(fixture.rootType);
QueryProfile mandatoryProfile = new QueryProfile("mandatory");
mandatoryProfile.setType(fixture.mandatoryType);
fixture.registry.register(defaultProfile);
fixture.registry.register(mandatoryProfile);
CompiledQueryProfileRegistry cRegistry = fixture.registry.compile();
assertError("Incomplete query: Parameter 'foobar' is mandatory in query profile 'mandatory' of type 'mandatory-type' but is not set",
new Query(QueryTestCase.httpEncode("?queryProfile=mandatory"), cRegistry.getComponent("mandatory")));
}
@Test
void testMandatoryInParentTypeWithInheritance() {
Fixture2 fixture = new Fixture2();
QueryProfile defaultProfile = new QueryProfile("default");
defaultProfile.setType(fixture.rootType);
QueryProfile mandatoryProfile = new QueryProfile("mandatory");
mandatoryProfile.addInherited(defaultProfile); // The single difference from the test above
mandatoryProfile.setType(fixture.mandatoryType);
fixture.registry.register(defaultProfile);
fixture.registry.register(mandatoryProfile);
CompiledQueryProfileRegistry cRegistry = fixture.registry.compile();
assertError("Incomplete query: Parameter 'foobar' is mandatory in query profile 'mandatory' of type 'mandatory-type' but is not set",
new Query(QueryTestCase.httpEncode("?queryProfile=mandatory"), cRegistry.getComponent("mandatory")));
}
private void assertError(String message,Query query) {
assertEquals(message, query.validate());
}
}
```
|
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*
*/
package com.haulmont.cuba.core.mp_test;
public class MpTestObj
{
}
```
|
Lt. Col Walter Martin Fitzherbert Turner (4 April 1881 – 1 February 1948) was an English cricketer. He played for Essex between 1899 and 1911, and the Europeans. A 'strong driver and cutter' his cricketing career covered 27 seasons when on leave from military service.
Life
Walter Martin Fitzherbert Turner was born on 4 April 1881 at Meerut, Uttar Pradesh, India, the son of Major J.T. Turner who himself played cricket for Hong Kong and lost his life returning to Hong Kong from a match in Shanghai on board the SS Bokhara. Walter Turner was the brother of another first-class cricketer, Arthur Turner, and educated at Bedford Modern School between 1891 and 1893, and thereafter at Wellington College where he was in the first XI in 1897.
Walter Turner began his first-class career for Essex in 1899 shortly before his commission in the Royal Artillery on 6 January 1900. Thereafter he played as a batsman for Essex when on leave from his military duties abroad. Turner’s best performance was in the 1906 season when he scored 924 runs at 33.00. On returning to England after the first world war, he played in the 1919 season where he scored 371 runs at 51.57 and achieved a career match best with 172 runs against Middlesex.
In terms of his military career, he was promoted Major on 11 June 1915 and Lieutenant-Colonel on 1 January 1917. He retired from the army on 23 December 1925.
References
External links
1881 births
1948 deaths
English cricketers
Essex cricketers
Sportspeople from Meerut
Europeans cricketers
British Army cricketers
People educated at Bedford Modern School
People educated at Wellington College, Berkshire
British Army personnel of World War I
Royal Artillery officers
Military personnel of British India
|
Dennis Chun (born March 18, 1952) is an American actor. He is the son of Hawaii Five-O star Kam Fong Chun, and portrayed Sgt. Duke Lukela in the reboot of the series, in which his father was known for playing Chin Ho Kelly from the original show.
Filmography
1972: The Brady Bunch: Young Workman
1974: Inferno in Paradise: Kimo
1974–1975: Hawaii Five-O: Officer Wade/Assistant/Attendant
1988: Magnum, P.I.: William Chun
1989–1990: Jake and the Fatman: Detective/Johnny Witt
1991: Goodbye Paradise: John Young
2010–2020: Hawaii Five-0: Sgt. Duke Lukela
2019–2022: Magnum P.I.: Sgt. Duke Lukela
References
External links
1952 births
Living people
20th-century American male actors
21st-century American male actors
American male television actors
Male actors from Hawaii
|
Peskett is a surname. Notable people with the surname include:
Leonard Peskett (1861–1924), British naval designer and architect
William Peskett (born 1952), Northern Irish poet
|
This is a list of aircraft used by the United States Air Force and its predecessor organizations for combat aerial reconnaissance and aerial mapping.
The first aircraft acquired by the Aeronautical Division, U.S. Signal Corps were not fighters or bombers, they were reconnaissance aircraft. From the first days of World War I, the airplane demonstrated its ability to be the "eyes of the army." Technology has improved greatly over the almost century since the first reconnaissance aircraft used during World War I. Today reconnaissance aircraft incorporate stealth technology; the newest models are piloted remotely. The mission of reconnaissance pilots remains the same, however.
The United States became a leader in development of aircraft specifically designed for the reconnaissance role; examples include the Lockheed SR-71, Lockheed U-2, Republic XF-12, and Hughes XF-11 (the latter two did not enter production). Most other nations that have developed reconnaissance aircraft generally used modified versions of standard bomber, fighter, and other types. The United States has, of course also operated reconnaissance variants of aircraft initially designed for other purposes, as the list below demonstrates.
World War I aircraft
Initially flown with a pilot and an observer, the observer would often sketch the scene of the ground below. Soon, some English observers thought it would be easier and more accurate to use their cameras to photograph the enemy lines. Unfortunately, both sides knew that if they were receiving valuable information from their pilots, the other side must be doing the same, and aircraft became armed to shoot down the other's. After the war, England estimated that its flyers took one-half million photographs during the four years of the war, and Germany calculated that if you laid all its aerial photographs side by side, they would cover an area six times the size of Germany.
The United States did not produce any aircraft of its own design for use in combat during World War I; however, several British and French designs were used by Air Service Aero Squadrons for reconnaissance missions.
Airco DH.4
British two-seat biplane day-bomber, used by the Air Service; DH-4-BP Experimental photographic reconnaissance version. Produced under licence in the United States and used by the Army Air Service until 1932.
AR-2 (Avion de Reconnaissance)
Breguet 14
Salmson 2A2
French biplane reconnaissance aircraft.
Royal Aircraft Factory F.E.2
SPAD S.XIII
World War II and later aircraft
Attack aircraft
A-20 Havoc
The F-3A was a conversion of 46 A-20J and K models for night-time photographic reconnaissance (F-3 were a few conversions of the original A-20). It was used in all major Theaters of Operations. The first Allied aircraft to land at Itazuke Airfield, Japan after the August 1945 surrender was an F-3A.
A-29 Hudson
A-29B converted for photographic survey work.
Bomber aircraft
B-17 Flying Fortress
The F-9 was the photographic reconnaissance variant.
F-9A was assigned to some B-17Fs that were converted to photographic configuration in a manner similar to that of the F-9 but differing in some camera details. Both the F-9s and F-9As were re-designated F-9B after further camera changes.
F-9C was assigned to ten B-17Gs converted for photographic reconnaissance in a manner similar to the F-9, F-9A, and F-9B conversions of the B-17F. Redesignated FB-17 after 1948.
B-18 Bolo
Obsolete as a bomber, B-18Bs and B-18Cs were used for anti-submarine warfare reconnaissance after the Attack on Pearl Harbor until their withdrawal from service in 1943. Replaced by the B-24 Liberator which had a substantially longer range and a much heavier payload.
B-24 Liberator
The F-7 was the photographic reconnaissance variant.
XF-7 was the designation of B-24D 41-11653 by removing all the bombing equipment and installing eleven reconnaissance cameras in the nose, bomb bay, and aft fuselage.
F-7 was the designation of four additional B-24Ds were converted to reconnaissance configuration.
F-7A were B-24Js that had a camera located in the nose, and cameras installed in the aft bomb bay. Full defensive armament suite of the bomber was retained.
F-7B were B-24Ms which carried all five cameras in the aft bomb bay. Most F-7Bs were conversions of late-model B-24Ms, although a few B-24Js and Ls became F-7Bs as well.
B-25 Mitchell
The F-10 was the photographic reconnaissance variant of 45 B-25Ds. Used primarily for mapping over remote areas which had been poorly mapped. Mostly flown over areas of the Pacific, Northern Canada, Amazon basin of Brazil and over the Himalayas.
B-26 Invader
RB-26B, RB-26C based on variants developed in the postwar era. Used for night photography and carried flash flares for illumination.
RB-26L was assigned to two RB-26Cs that were modified in 1962 for night photography missions in South Vietnam. Assigned to Bien Hoa Air Base in March 1963, and were for a while the only aircraft in South Vietnam with any real night reconnaissance capability.
B-29 Superfortress
The F-13 was the photographic reconnaissance version of the B-29 initially deployed to the Pacific theater in 1944–45. An F-13 conducted the first flight by an Allied aircraft over Tokyo since the Doolittle Raid of April 1942.
F-13A was the B-29A model. Carried three K-17B, two K-22 and one K-18 cameras with provisions for others. Redesignated as RB-29/RB-29A in 1948. Later reconnaissance versions were primarily postwar developments to perform SAC's global reconnaissance mission. Six B-29A/F-13As had Wright R-3350-CA-2 fuel injected engines installed and were eventually designated as RB-29Js. Other versions included weather reconnaissance WB-29s which could monitor radiation levels after nuclear weapons tests.
B-36 Peacemaker
Reconnaissance versions of the B-36 were used by SAC throughout the 1950s.
RB-36D carried up to 23 cameras, primarily K-17C, K-22A, K-38, and K-40 cameras. Included a small darkroom where a photo technician could develop the film. The second bomb bay contained up to 80 T86 photo flash bombs, while the third bay could carry an extra 3000 gallon droppable fuel tank. The fourth bomb bay carried ferret ECM equipment. Had a 50-hour flight endurance capability.
RB-36Es were B-36As refitted as reconnaissance aircraft. Also equipped with the four J-47 jet engines and advanced electronics.
B-45 Tornado
RB-45C was the reconnaissance version of the B-45, the first United States jet bomber. A total of 12 cameras. Flew combat missions over Korea, but found to be vulnerable to the MiG-15 and withdrawn. Also flew penetration missions over Eastern Europe but withdrawn in the mid-1950s.
B-47 Stratojet
Reconnaissance versions of the B-47 were SAC's first very long range jet strategic reconnaissance aircraft.
RB-47B Daylight only reconnaissance version.
YRB-47B was a conversion of the B-47B specifically intended for the training of RB-47E crews.
RB-47E Strategic reconnaissance version. As compared with the standard B-47E, the nose of the RB-47E was 34 inches longer so that it could house a special air-conditioned compartment for cameras and other sensitive equipment. Eleven cameras could be carried, along with ten photoflash bombs and supplementary photoflash cartridges for night photography.
WB-47E Weather reconnaissance version which could perform atmospheric sampling and monitoring. Served in the 1960s as replacement for WB-50Ds.
RB-47H / ERB-47H Built for the electronic intelligence (ELINT) mission, extensively refitted with monitoring equipment and additional (3 on RB-47H, only 2 on ERB-47H) Electronic Warfare Officers called "Crows" accommodated in a pressurized bomb bay compartment. ERB-47H had a small but distinctive antenna fairing under the rounded nose, otherwise external appearance difficult to distinguish from RB-47H.
Boeing B-50
The Boeing B-50 Superfortress was a postwar improvement of the B-29 with R-4360 Wasp Major engines (also used in the B-36). It became a versatile strategic reconnaissance platform developed and employed in multiple versions for SAC's global mission.
RB-50B 28 converted from B-50B for photographic reconnaissance and photographic mapping, all later to be reclassified/designated as RB-50E and RB-50F, respectively (see below). Camera suites of the reconnaissance and mapping aircraft were interchangeable; rear fuselage capsule carried nine cameras in four stations, weather instruments, and extra crew. Could be fitted with two drop tanks under outer wings.
RB-50D Three B-50Ds modified by Goodyear Aircraft, Akron, Ohio for collection of specialized imagery in support of ATRAN (Automatic Terrain Recognition and Navigation) system for the TM-61B Matador missile (ATRAN would eventually be deployed in MGM-13 Mace).
RB-50E Redesignation of 14 photographic reconnaissance RB-50Bs in April 1951. Some equipped with palletized (for easy removal) SHORAN to eliminate interference with defensive armament system; others later assigned to photographic mapping projects. RB-50Es had limited SIGINT and weather data collection capabilities to suit mission requirements. Subsequent RB-50E ACRP (5 aircraft, all armament retained) and RB-50E-II (same 5 aircraft, all armament except tail guns removed) were remanufactures fitted to COMINT capabilities for monitoring frequency bands of Soviet bloc fighter aircraft and ground stations.
RB-50F Redesignation of 14 photographic mapping/survey RB-50Bs in April 1951. Fitted with SHORAN / HIRAN (HIgh precision SHORAN) designed to conduct mapping, charting, and geodetic surveys in conjunction with MATS and Air Photographic and Charting Service (APCS); weather reconnaissance gear retained and limited ELINT collection missions were able to be flown. Camera suite as RB-50E.
RB-50G 15 RB-50Bs converted at Boeing Wichita for signals intelligence (SIGINT) collection. Fitted with SHORAN navigation radar, forward pressure bulkhead relocated into shortened forward bomb bay to allow 5 electronic operator stations and 16-man crew. Subsequent RB-50G ACRP (5 aircraft, all armament retained) and RB-50G-II (4 aircraft, all armament except tail guns removed) were remanufactures of RB-50Gs from the same original batch and fitted to COMINT capabilities.
WB-50D 73 surplus B-50Ds converted as weather reconnaissance aircraft to replace worn out WB-29s. Fitted with extra gaseous oxygen storage tanks in the bomb bay, Doppler radar, atmospheric samplers (e.g. wing pylons to carry F-50 sampling pod) and other specialist equipment. Externally identified by additional radome in the forward lower gun turret position and air sampler scoop on upper aft fuselage. Some carried out highly classified atmospheric sampling missions from 1953–1955 for detection of Soviet atomic weapons testing and radiation level monitoring; also served as hurricane hunters. JWB-50D was a redesignation of aircraft Ser No 48-104 in its assignment to the Wright Air Development Center for equipment testing.
B-52 Stratofortress
RB-52B was the designation of the B-52B when carrying a two-man pressurized capsule installed in the bomb bay which could perform electronic countermeasures or photographic reconnaissance work. The reconfiguring of the aircraft was a fairly straightforward process and the capsule could usually be installed in about four hours.
B-57 Canberra
RB-57A Tactical Air Command/USAFE reconnaissance version of the B-57A bomber (1953-58). Tactical failure, replaced by RF-101C Voodoos.
RB-57A-1 In 1955, a program was begun to convert ten RB-57As to a high-altitude "RB-57A-1" reconnaissance under a project first known as Lightweight and later renamed Heartthrob. The black-painted aircraft being used for reconnaissance missions against the East Bloc in the late 1950s. One was rumored to have been shot down in 1956 while observing the Hungarian uprising. Two were operated by the Republic of China (Taiwan) Air Force, and one of these was known to have been shot down, on 18 February 1958, by Chinese fighters. Details still undisclosed.
RB-57A-2 Two RB-57As were modified with a bulbous nose containing AN/APS-60 mapping radar in 1957 under project SARTAC. Assigned to Germany, operational use still not disclosed.
RB-57D Initial high-altitude reconnaissance version of the B-57 Canberra. Capable of operation at altitudes of 65,000 feet with range of 2,000 nautical miles. Total of 20 aircraft eventually built.
RB-57E Patricia Lynn Project was a highly classified project during the Vietnam War where a small number of B-57Es were converted into high-altitude tactical reconnaissance aircraft used over Indochina.
RB-57F Substantially improved high-altitude reconnaissance version developed by General Dynamics in 1962. The USAF approached General Dynamics to investigate updating the RB-57 to produce a virtually new high-altitude reconnaissance aircraft. Designated RB-57F, the design was almost an entirely new aircraft with a three-spar wing structure of 122 feet span, powerful new Pratt & Whitney TF33-P-11 main engines and two detachable underwing J60-P-9s for boost thrust at high altitude. The aircraft carried high-altitude cameras which were able to take oblique shots at 45 degrees up to 60 nm range from the aircraft with a 30 inch resolution. ELINT/SIGINT equipment was carried in the nose. A total of 21 RB-57F aircraft were eventually re-manufactured from existing B-57A, B-57B and RB-57D airframes. Some RB-57Fs used in the Early Day program which involved high altitude air sampling for evidence of Soviet nuclear tests. All surviving examples redesignated WB-57F after 1968.
B-66 Destroyer
RB-66 was the designation for the reconnaissance version of the USAF's B-66 tactical bomber, itself derived from the Navy A-3 Skywarrior.
RB-66B carried flash bombs in its bomb bay for night photography missions and was equipped with a battery of reconnaissance cameras. Was primary night photographic reconnaissance weapon system of TAC, PACAF and USAFE.
RB-66C was a specialized electronic reconnaissance and electronic countermeasures aircraft designed for jamming of Soviet built radar. Used in Europe; saw extensive use during the Vietnam War.
Fighter aircraft
Supermarine Spitfire
Spitfire PR XI was the photographic reconnaissance variant of the Mk IX Fighter. Received by Eighth Air Force in late 1943. All Eighth Air Force Spitfires delivered were in the standard RAF "PRU Blue" with the aircraft serial number painted on the tail.
de Havilland Mosquito
Mosquito F-8-DH (Nose cameras), 40 Aircraft received by Eighth Air Force.
Mosquito PR Mk XVI (Bomb bay cameras) 80 Aircraft received by Eighth and Ninth Air Force. These were used for a variety of photographic and night reconnaissance missions
P-38 Lightning
Was the primary long-range USAAF photographic reconnaissance fighter aircraft prior to introduction of the P-51. Used extensively in all major theaters of operations. F-4 and early F-5 Lightning photo reconnaissance variants were factory converted by Lockheed at Burbank, California; all later F-5 conversions were made after delivery by Lockheed's Dallas Modification Center near Dallas, Texas.
F-4-1 was based on the P-38E, ninety-nine built with initial delivery March 1942. Four nose-mounted K-17 cameras. Most were used for training in the United States; nine of these aircraft deployed to the United Kingdom as part of the 5th Photographic Squadron in mid-1942.
F-4A-1 based on P-38F-1-LO, twenty built.
F-5A based almost entirely on production blocks of the P-38G, 181 built. Began with a single F-5A-2 converted from P-38E in January 1942; then (from P-38Gs) twenty F-5A-1s, twenty F-5A-3s, and 140 F-5A-10s. All F-5A derivatives had provision for five cameras (one more than F-4).
F-5B based on P-38J-5-LO, 200 built with camera installation similar to F-5A-10. A Sperry automatic pilot was standard on the first ninety F-5Bs; remaining 110 F-5B-1s completed Lockheed's at-factory conversions of photo reconnaissance P-38s (all subsequent F-5 variants were modified at Dallas). Four former F-5Bs later supplied to the United States Navy as FO-1.
F-5C-1 based on P-38J-5-LO, approximately 123 built. Similar to F-5B-1 but with improved camera installation.
F-5D (XF-5D-LO) One F-5A-10-LO Ser No 42-12975 was modified as an experimental two-seat reconnaissance aircraft under the designation XF-5D-LO. The camera operator was located in a glazed nose compartment with two forward-firing 0.50-in machine guns. Three K-17 cameras were installed, one underneath the nose and one in each tail boom.
F-5E-2 based on P-38J-15-LO, 100 built. Similar to the F-5C-1.
F-5E-3 based on P-38J-25-LO, 105 built. Similar to the F-5C-1.
F-5E-4 based on P-38L-1-LO, 500 built; K-17 or K-18 cameras fitted as standard with a trimetrogon installation as an alternative.
F-5F Single aircraft conversion from former (P-38J) F5B-1 Ser No 42-68220.
F-5F-3 based on P-38L-5-LO, unknown number (see below) built all fitted with F-5F camera installation.
F-5G-6 based on P-38L-5-LO, with new elongated nose section enabling a wider selection of cameras to be fitted, including directly forward-facing in tip of nose.
Lockheed Burbank converted 440 total F-4/F-5s before Dallas continued conversion work to complete at least 828 aircraft, but grand total of P-38J/L-based photo reconnaissance Lightnings probably ran to over 1,000. Dallas conversions include F-5C-1 (approximately 123), F-5E-2 (100), F-5E-3 (105), and an unknown number of F-5E-4s, F-5F-3s and F-5G-6s. Several F-5G-6s that survived post-war disposal had their camera nose sections further modified by civilian aerial survey operators.
'Droop Snoot' Radar Countermeasures American Air Museum (at Imperial War Museum Duxford) has information and a photograph of a 'Droop Snoot' bombardier-formation leader variant P-38J-15-LO aircraft from 7th Reconnaissance Group (7th PG), RAF Mount Farm that was detached to RAF Foulsham alongside No. 192 Squadron RAF (Bomber Support), which operated as a radar countermeasure unit. The AAM/IWM site posting states this aircraft was "field modified April–May 1944 to 'Droop Snoot' configuration and fitted out with equipment and aerials for ELINT work. Detached to 192 Sqn RAF for Elint missions. Reported to have been converted to radar search aircraft and operated by 36th Bomb Squadron (a radar countermeasures unit) not sure if before or after RAF service." These 'Droop Snoot' modified two-seat Lightnings operated between September 1944 and February 1945 attached to No. 192 Squadron RAF, and in November 1944 "much time was spent in searching for radio signals from V-2s, though these were later found to be uncontrolled (V-2s had on-board guidance systems)."
The P-38J shown in the photograph has had its plexiglas nose painted-faired over with the nose upper windows and access panels in otherwise typical 'Droop Snoot' configuration. No details are provided on internal equipment fit for this aircraft.
P-39 Airacobra
27 P-39Fs were converted into P-39F-2 variants for the ground-attack and reconnaissance role. Used for training, never engaged in combat.
P-51 Mustang
F-6A, F-6B, F-6C, F-6D, F-6K all based on models of the P-51 Mustang. All F-6 aircraft retained their armament; missions were flown fully armed. Most F-6s were fitted with one K-24 oblique camera mounted behind the pilot in the cockpit and one vertical camera along centerline of the lower fuselage. F-6s eventually became the dominant long-range reconnaissance aircraft in ETO. In 1948, surviving F-6s were redesignated as RF-51D/K
P-61 Black Widow
F-15A Reporter was a postwar photographic reconnaissance aircraft developed from the P-61 night fighter. Thirty-six produced; most sent to Japan. Extensive aerial photos were taken of beaches, villages, road networks, and cultural centers. Included in this job was the mapping of the Korean Peninsula, which proved invaluable when the Korean War broke out in 1950. A few also served in the Philippines and Celebes, where their mission included mapping of the route of the Bataan Death March for war crimes prosecutions. Last F-15A (officially redesignated RF-61C after 1947 although most unit personnel continued use of the original) retired just a few months before the outbreak of the Korean War.
F-80 Shooting Star
RF-80A was first jet reconnaissance aircraft of the USAAF. The second YP-80A prototype, 44-84988, was completed in 1944 as the XF-14; a reconnaissance version of the basic fighter. It had a redesigned nose that rotated forward for servicing and carried only vertical seeing cameras. It was unarmed. The RF-80A was designated as such in 1948 and carried three or four cameras capable of side, downward and forward observation. The RF-80A proved itself in combat during the Korean War and took part in numerous sorties over North Korea as well as sorties along the border with North Korea and China, near the Yalu River. RF-80As deployed to USAFE in 1953; operated until 1955, last returned to United States in 1956. Remained in second-line service until 1958.
RF-80C. Photographic reconnaissance version of F-80C.
F-84F Thunderstreak
RF-84F known as Thunderflash; replacement for RF-80 introduced in 1954. Most were replaced by McDonnell RF-101 Voodoo aircraft in the late 1950s. After that, they served with Air National Guard squadrons until well into the 1960s.
F-86 Sabre
A reconnaissance version of the F-86 was a limited production/modification of the Sabre
RF-86A used in Korean War. Were modifications of F-86As at the Tsuiki REMCO facility in Japan
RF-86F was post Korean War variant used by Far East Air Forces for clandestine and standard reconnaissance missions after the Korean War ended. Limited production and service as USAF opted for the Republic RF-84F Thunderflash as its next-generation tactical reconnaissance aircraft.
F-100 Super Sabre
RF-100A Highly classified reconnaissance version of the Super Sabre known as the "Slick Chick". 6 produced; a handful (3) were used by USAF primarily for penetration of Soviet-controlled airspace missions in Europe. Afterwards were sold to the Chinese Nationalist Air Force on Taiwan for penetration of mainland Communist China airspace. Carried four drop tanks rather than the usual two because the mission profile called for a lot of high-speed flight under afterburner and there was no provision for midair refuelling. Missions still undisclosed.
F-101 Voodoo
The versatile Voodoo was the fastest USAF tactical reconnaissance aircraft put into service.
RF-101A USAF's first supersonic photographic reconnaissance aircraft. Flew vital reconnaissance missions over Cuba during the Missile Crisis of October 1962, confirming and then monitoring the Soviet missile buildup on that island. Used extensively in Europe, replacing RF-84Fs.
RF-101C Differed from RF-101A in being able to accommodate a centerline nuclear weapon, so that it could carry out a secondary nuclear strike mission if ever called upon to do so. Also flew over Cuba during Cuban Missile Crisis (unarmed).
RF-101H Remanufactured F-101Cs to serve as unarmed reconnaissance aircraft with the Air National Guard.
RF-101G Remanufactured F-101As to serve as unarmed reconnaissance aircraft with the Air National Guard.
F-4 Phantom II
RF-4C (Model 98DF) Was primary USAF Tactical Reconnaissance aircraft from 1966-1992. The first operational unit to receive the RF-4C was the 16th TRS of the Tactical Air Command 363rd TRW at Shaw AFB, achieving initial combat-readiness in August 1965. Saw extensive use in USAFE; in PACAF during the Vietnam War flying day missions until 1972 over North and South Vietnam as well as Laos, usually flying alone and without fighter escort. The RF-4C posted an impressive record during the most intense years of the war.
Began Air National Guard service in 1971. Collapse of Soviet Union and Warsaw Pact in 1989 began retirement of active-duty RF-4Cs. Inactivation of the last USAFE and TAC RF-4C units was in the planning stages when Iraq invaded Kuwait in August 1990, and further inactivation plans were put on hold. RF-4Cs used during Operation Desert Shield/Desert Storm. When the first air strikes against Iraq took place on January 17, 1991 RF-4Cs were in action from the start. At first limited to daylight operations they flew over Kuwait almost every day in search of Republican Guard units; also flew over Baghdad looking for targets such as rocket fuel plants, chemical weapons plants, and command and communications centers. RF-4Cs were repeatedly diverted from other photographic missions to seek out Scud launchers hiding in western Iraq.
After Desert Storm RF-4Cs were retired rapidly. Nevada ANG finally turned in its last four RF-4Cs on September 27, 1995. This brought the era of RF-4C service with United States armed forces to an end after 30 years of operations.
Note: Both the F-15 Eagle and F-16 Falcon had prototype RF-15 and RF-16s built but were never put into production.
Observation aircraft
Many developed in the 1920s and 1930s; a few saw combat during World War II. After the establishment of the USAF, light observation aircraft became an Army mission. O-2 Skymaster and OV-10 Broncos were Forward Air Control (FAC) aircraft of the Vietnam War, retired in the late 1970s, replaced by the OA-10A version of the A-10 Thunderbolt II.
Loening OL (OA-1A/B/C, OA-2, OL-1/2/3/4/5/6/8/8A/9)
Curtiss Falcon(O-1, O-11, O-39, A-3, F8C, OC, O2C)
Cessna O-2 Skymaster
Douglas O-2
OV-10 Bronco
Consolidated O-17 Courier
Thomas-Morse O-19
Douglas O-31
Douglas O-38
Curtiss O-40 Raven
Douglas O-43
Martin O-45
Douglas O-46
North American O-47
O-49 Vigilant
Curtiss O-52 Owl
O-57 Grasshopper
O-62 Sentinel
Strategic reconnaissance aircraft
Martin/General Dynamics RB-57F Canberra
Developed from the Martin B-57 Canberra tactical bomber (which itself was a license-built version of the English Electric Canberra) for weather reconnaissance involving high-altitude atmospheric sampling and radiation detection in support of nuclear test monitoring, but four of the 21 modified aircraft performed solely as strategic reconnaissance platforms.
Lockheed U-2 (TR-1A)
Developed by Central Intelligence Agency; first flight occurred at the Groom Lake (Area 51), Nevada on 1 August 1955. CIA and USAF U-2s began operations in 1956. Has been in continual use for over 50 years as primary USAF strategic reconnaissance aircraft.
Lockheed SR-71 Blackbird
Initially developed as A-12 by Central Intelligence Agency; first flight took place at Groom Lake (Area 51), Nevada, on 25 April 1962. USAF developed SR-71 from CIA design; first flight took place on 22 December 1964. Operational use of SR-71 began in 1968. Retired in 1989 due to budget reductions. Three aircraft returned to service 1994; retired in 1998 due to budget reductions.
Transport aircraft
E-3 Sentry
Airborne warning and control system (AWACS) aircraft based on the Boeing 707 that provides all-weather surveillance, command, control and communications
E-8 Joint STARS
Battle management and command and control aircraft based on the Boeing 707 that tracks ground vehicles and some aircraft, collects imagery, and relays tactical pictures to ground and air theater commanders.
MC-12W Liberty
First flown in 2009. Aircraft is a medium-altitude manned special-mission turboprop tactical reconnaissance aircraft that supports coalition and joint ground forces. Provides real-time full-motion video and signals intelligence.
C-45 Expeditor
F-2 Photographic reconnaissance trainer built to carry two to four aerial cameras, also performed mapping missions over the United States; F-2A improved version. 69 aircraft produced. Postwar redesignated as RC-45A in 1948; retired 1953
EC-121 Warning Star
A military version of the Lockheed Constellation, the aircraft was designed to serve as an airborne early warning system to supplement the Distant Early Warning Line using two large radomes, a vertical dome above and a horizontal one below the fuselage.
Boeing RC-135
RC-135s are a family of reconnaissance aircraft which perform a broad range of signals intelligence-related missions. Based on the C-135 Stratolifter airframe, multiple types of RC-135s have been in service since 1961. Many variants have been subsequently modified or upgraded numerous times (mostly via the USAF's long-running Big Safari program) resulting in a large variety of designations, configurations, and program names.
Unmanned aerial vehicles
Ryan Model 147
Series of Remotely Piloted Vehicles (RPVs) in multiple variants developed with funding from National Reconnaissance Office and deployment support of Strategic Air Command beginning in 1962. Initial project code name was Fire Fly, later known as Lightning Bug. Operated extensively from 1964 to 1975 across Southeast Asia during the Vietnam War and also conducted operations over China and North Korea.
MQ-1B Predator
Hunter-killer UAV in use since 1995. Initially conceived in the early 1990s for reconnaissance and forward observation roles, the Predator carries cameras and other sensors but has been modified and upgraded to carry and fire two AGM-114 Hellfire missiles or other munitions.
RQ-4 Global Hawk
Unarmed very long range strategic reconnaissance UAV.
MQ-9 Reaper
Hunter-killer UAV designed for long-endurance, high-altitude surveillance. The MQ-9 carries a variety of weapons including the GBU-12 Paveway II laser-guided bomb, the AGM-114 Hellfire II air-to-ground missiles, the AIM-9 Sidewinder and recently, the GBU-38 JDAM (Joint Direct Attack Munition). Tests are underway to allow for the addition of the AIM-92 Stinger air-to-air missile.
RQ-11B Raven
Small hand-launched remote-controlled unmanned aerial vehicle.
YMQ-18A Hummingbird (Helicopter)
Under development by Boeing and DARPA.
RQ-170 Sentinel
Unarmed flying wing design stealth reconnaissance UAV.
Scan Eagle
Unarmed remote sensing UAV, providing real-time direct situational awareness and force protection information for Air Force security forces expeditionary teams.
Wasp III
Unarmed remote sensing UAV, providing real-time direct situational awareness and target information for Air Force Special Operations Command Battlefield Airmen.
See also
List of United States Army Air Forces reconnaissance units
List of United States Air Force reconnaissance squadrons
References
Green, William. Famous Bombers of the Second World War. 1959, Doubleday.
Green, William. War Planes of the Second World War — Fighters: Volume Four. 1964, Doubleday.
Swanborough, Gordon and Bowers, Peter M. United States Military Aircraft since 1909. 1989, Smithsonian Institution Press.
Lists of military aircraft
|
```javascript
/*
For licensing, see LICENSE.md or path_to_url
*/
CKEDITOR.lang['si']={"editor":" ","editorPanel":"Rich Text Editor panel","common":{"editorHelp":" ALT ","browseServer":" ","url":"URL","protocol":"","upload":"","uploadSubmit":" ","image":"","flash":"","form":"","checkbox":" ","radio":" ","textField":" ","textarea":" ","hiddenField":" ","button":"","select":" ","imageButton":" ","notSet":"< >","id":"","name":"","langDir":" ","langDirLtr":" ","langDirRtl":" ","langCode":" ","longDescr":" ","cssClass":" ","advisoryTitle":" ","cssStyle":"","ok":"","cancel":" ","close":"","preview":" ","resize":" ","generalTab":" .","advancedTab":"","validateNumberFailed":" ","confirmNewPage":" . ?","confirmCancel":" . ?","options":" ","target":"","targetNew":" ","targetTop":" ","targetSelf":" (_\\\\)","targetParent":" (_)","langDirLTR":" ","langDirRTL":" ","styles":"","cssClasses":" ","width":"","height":"","align":"","alignLeft":"","alignRight":"","alignCenter":"","alignJustify":"Justify","alignTop":"","alignMiddle":"","alignBottom":"","alignNone":"None","invalidValue":" ","invalidHeight":" ","invalidWidth":" ","invalidCssLength":" \"%1\" CSS (px, %, in, cm, mm, em, ex, pt, pc)","invalidHtmlLength":" \"%1\" HTML (px %).","invalidInlineStyle":" \" : \", .","cssLengthTooltip":" CSS (, %, ,, mm, em, ex, pt, pc)","unavailable":"%1<span =\" \">, </span>"},"about":{"copy":" ;$1 . .","dlgTitle":"CKEditor ","help":" $1 ","moreInfo":" :","title":"CKEditor ","userGuide":"CKEditor "},"basicstyles":{"bold":" ","italic":" ","strike":"Strikethrough","subscript":"Subscript","superscript":"Superscript","underline":" "},"blockquote":{"toolbar":" "},"clipboard":{"copy":" ","copyError":"Your browser security settings don't permit the editor to automatically execute copying operations. Please use the keyboard for that (Ctrl/Cmd+C).","cut":"","cutError":"Your browser security settings don't permit the editor to automatically execute cutting operations. Please use the keyboard for that (Ctrl/Cmd+X).","paste":"","pasteArea":" ","pasteMsg":"Please paste inside the following box using the keyboard (<strong>Ctrl/Cmd+V</strong>) and hit OK","securityMsg":"Because of your browser security settings, the editor is not able to access your clipboard data directly. You are required to paste it again in this window.","title":""},"contextmenu":{"options":" "},"button":{"selectedLabel":"%1 (Selected)"},"toolbar":{"toolbarCollapse":" .","toolbarExpand":" ","toolbarGroups":{"document":"","clipboard":" ","editing":"","forms":"","basicstyles":" ","paragraph":"","links":"","insert":" ","styles":"","colors":"","tools":""},"toolbars":" "},"elementspath":{"eleLabel":" ","eleTitle":"%1 "},"format":{"label":"","panelTitle":" ","tag_address":"","tag_div":"(DIV)","tag_h1":" 1","tag_h2":" 2","tag_h3":" 3","tag_h4":" 4","tag_h5":" 5","tag_h6":" 6","tag_p":"","tag_pre":""},"horizontalrule":{"toolbar":" "},"image":{"alt":" ","border":" ","btnUpload":" ","button2Img":" ?","hSpace":"HSpace","img2Button":" ?","infoTab":" ","linkTab":"","lockRatio":" ","menu":" ","resetSize":" ","title":" ","titleButton":" ","upload":"","urlMissing":" URL .","vSpace":"VSpace","validateBorder":" .","validateHSpace":"HSpace ","validateVSpace":"VSpace ."},"indent":{"indent":" ","outdent":" "},"fakeobjects":{"anchor":"","flash":"Flash Animation","hiddenfield":" ","iframe":"IFrame","unknown":"Unknown Object"},"link":{"acccessKey":" ","advanced":"","advisoryContentType":" ","advisoryTitle":" ","anchor":{"toolbar":"","menu":" ","title":" ","name":" ","errorName":" ","remove":" "},"anchorId":"By Element Id","anchorName":"By Anchor Name","charset":"Linked Resource Charset","cssClasses":" ","emailAddress":"E-Mail Address","emailBody":"Message Body","emailSubject":"Message Subject","id":"","info":"Link Info","langCode":" ","langDir":" ","langDirLTR":" ","langDirRTL":" ","menu":"Edit Link","name":"","noAnchors":"(No anchors available in the document)","noEmail":"Please type the e-mail address","noUrl":"Please type the link URL","other":"<other>","popupDependent":"Dependent (Netscape)","popupFeatures":"Popup Window Features","popupFullScreen":"Full Screen (IE)","popupLeft":"Left Position","popupLocationBar":"Location Bar","popupMenuBar":"Menu Bar","popupResizable":"Resizable","popupScrollBars":"Scroll Bars","popupStatusBar":"Status Bar","popupToolbar":"Toolbar","popupTop":"Top Position","rel":"Relationship","selectAnchor":"Select an Anchor","styles":"","tabIndex":"Tab Index","target":"","targetFrame":"<frame>","targetFrameName":"Target Frame Name","targetPopup":"<popup window>","targetPopupName":"Popup Window Name","title":"","toAnchor":"Link to anchor in the text","toEmail":"E-mail","toUrl":"URL","toolbar":"","type":"Link Type","unlink":"Unlink","upload":""},"list":{"bulletedlist":" / ","numberedlist":" / "},"magicline":{"title":" "},"maximize":{"maximize":" ","minimize":" "},"pastetext":{"button":" ","title":" "},"pastefromword":{"confirmCleanup":"The text you want to paste seems to be copied from Word. Do you want to clean it before pasting?","error":"It was not possible to clean up the pasted data due to an internal error","title":" ","toolbar":" "},"removeformat":{"toolbar":" "},"sourcearea":{"toolbar":""},"specialchar":{"options":" ","title":" ","toolbar":" "},"scayt":{"btn_about":"About SCAYT","btn_dictionaries":"Dictionaries","btn_disable":"Disable SCAYT","btn_enable":"Enable SCAYT","btn_langs":"Languages","btn_options":"Options","text_title":"Spell Check As You Type"},"stylescombo":{"label":"","panelTitle":"Formatting Styles","panelTitle1":"Block Styles","panelTitle2":"Inline Styles","panelTitle3":"Object Styles"},"table":{"border":" ","caption":"Caption","cell":{"menu":"","insertBefore":" ","insertAfter":" ","deleteCell":" ","merge":" ","mergeRight":" ","mergeDown":" ","splitHorizontal":" ","splitVertical":" ","title":" ","cellType":" ","rowSpan":" ","colSpan":" ","wordWrap":" ","hAlign":" ","vAlign":" ","alignBaseline":" ","bgColor":" ","borderColor":" ","data":"Data","header":"","yes":"","no":"","invalidWidth":" ","invalidHeight":" ","invalidRowSpan":"Rows span must be a whole number.","invalidColSpan":"Columns span must be a whole number.","chooseColor":""},"cellPad":"Cell padding","cellSpace":"Cell spacing","column":{"menu":"Column","insertBefore":"Insert Column Before","insertAfter":"Insert Column After","deleteColumn":"Delete Columns"},"columns":" ","deleteTable":" ","headers":"","headersBoth":"","headersColumn":" ","headersNone":" ","headersRow":" ","invalidBorder":"Border size must be a number.","invalidCellPadding":"Cell padding must be a positive number.","invalidCellSpacing":"Cell spacing must be a positive number.","invalidCols":"Number of columns must be a number greater than 0.","invalidHeight":"Table height must be a number.","invalidRows":"Number of rows must be a number greater than 0.","invalidWidth":"Table width must be a number.","menu":"Table Properties","row":{"menu":"Row","insertBefore":"Insert Row Before","insertAfter":"Insert Row After","deleteRow":"Delete Rows"},"rows":"Rows","summary":"Summary","title":"Table Properties","toolbar":"Table","widthPc":"percent","widthPx":"pixels","widthUnit":"width unit"},"undo":{"redo":" ","undo":" "},"wsc":{"btnIgnore":"Ignore","btnIgnoreAll":"Ignore All","btnReplace":"Replace","btnReplaceAll":"Replace All","btnUndo":"Undo","changeTo":"Change to","errorLoading":"Error loading application service host: %s.","ieSpellDownload":"Spell checker not installed. Do you want to download it now?","manyChanges":"Spell check complete: %1 words changed","noChanges":"Spell check complete: No words changed","noMispell":"Spell check complete: No misspellings found","noSuggestions":"- No suggestions -","notAvailable":"Sorry, but service is unavailable now.","notInDic":"Not in dictionary","oneChange":"Spell check complete: One word changed","progress":"Spell check in progress...","title":"Spell Checker","toolbar":"Check Spelling"},"pbckcode":{"title":"PBCKCODE","addCode":"Add code","editCode":"Edit code","editor":"Editor","settings":"Settings","mode":"Mode","tabSize":"Tab size","theme":"Theme","softTab":"Enable soft tabs","emmet":"Enable Emmet"},"forms":{"button":{"title":" ","text":"()","type":"","typeBtn":"","typeSbm":"","typeRst":" "},"checkboxAndRadio":{"checkboxTitle":" ","radioTitle":"Radio Button Properties","value":"Value","selected":"Selected","required":"Required"},"form":{"title":" ","menu":" /","action":" ","method":"","encoding":""},"hidden":{"title":" ","name":"","value":"Value"},"select":{"title":" ","selectInfo":" ","opAvail":" ","value":"Value","size":"","lines":"lines","chkMulti":"Allow multiple selections","required":"Required","opText":"Text","opValue":"Value","btnAdd":"Add","btnModify":"Modify","btnUp":"Up","btnDown":"Down","btnSetValue":"Set as selected value","btnDelete":" "},"textarea":{"title":"Textarea Properties","cols":" ","rows":"Rows"},"textfield":{"title":"Text Field Properties","name":"","value":"Value","charWidth":"Character Width","maxChars":"Maximum Characters","required":"Required","type":"","typeText":"Text","typePass":"Password","typeEmail":"Email","typeSearch":"Search","typeTel":"Telephone Number","typeUrl":"URL"}}};
```
|
Phycocharax rasbora is a small species of freshwater fish in the family Characidae and the only member in the genus Phycocharax. It is endemic to the Brazilian Amazon, where only known from the upper Braço Norte River (Serra do Cachimbo region), a blackwater tributary in the Teles Pires basin, itself a part of the Tapajós basin. A dam has been built on the Braço Norte River and while the species is uncommon downstream, it is very abundant in the reservoir above. Its species name refers to the similarity in color and pattern to Trigonostigma rasboras, an unrelated but well-known Asian fish. The mainly reddish males reach up to about in standard length, while the duller yellowish females reach up to about .
References
Pristellini
Freshwater fish genera
Monotypic fish genera
Fish described in 2017
|
```objective-c
//==- HexagonFrameLowering.h - Define frame lowering for Hexagon -*- C++ -*-==//
//
// See path_to_url for license information.
//
//===your_sha256_hash------===//
#ifndef LLVM_LIB_TARGET_HEXAGON_HEXAGONFRAMELOWERING_H
#define LLVM_LIB_TARGET_HEXAGON_HEXAGONFRAMELOWERING_H
#include "Hexagon.h"
#include "HexagonBlockRanges.h"
#include "MCTargetDesc/HexagonMCTargetDesc.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/CodeGen/MachineBasicBlock.h"
#include "llvm/CodeGen/MachineFrameInfo.h"
#include "llvm/CodeGen/TargetFrameLowering.h"
#include <vector>
namespace llvm {
class BitVector;
class HexagonInstrInfo;
class HexagonRegisterInfo;
class MachineFunction;
class MachineInstr;
class MachineRegisterInfo;
class TargetRegisterClass;
class HexagonFrameLowering : public TargetFrameLowering {
public:
// First register which could possibly hold a variable argument.
int FirstVarArgSavedReg;
explicit HexagonFrameLowering()
: TargetFrameLowering(StackGrowsDown, Align(8), 0, Align(1), true) {}
// All of the prolog/epilog functionality, including saving and restoring
// callee-saved registers is handled in emitPrologue. This is to have the
// logic for shrink-wrapping in one place.
void emitPrologue(MachineFunction &MF, MachineBasicBlock &MBB) const
override;
void emitEpilogue(MachineFunction &MF, MachineBasicBlock &MBB) const
override {}
bool enableCalleeSaveSkip(const MachineFunction &MF) const override;
bool spillCalleeSavedRegisters(MachineBasicBlock &MBB,
MachineBasicBlock::iterator MI,
ArrayRef<CalleeSavedInfo> CSI,
const TargetRegisterInfo *TRI) const override {
return true;
}
bool
restoreCalleeSavedRegisters(MachineBasicBlock &MBB,
MachineBasicBlock::iterator MI,
MutableArrayRef<CalleeSavedInfo> CSI,
const TargetRegisterInfo *TRI) const override {
return true;
}
bool hasReservedCallFrame(const MachineFunction &MF) const override {
// We always reserve call frame as a part of the initial stack allocation.
return true;
}
bool canSimplifyCallFramePseudos(const MachineFunction &MF) const override {
// Override this function to avoid calling hasFP before CSI is set
// (the default implementation calls hasFP).
return true;
}
MachineBasicBlock::iterator
eliminateCallFramePseudoInstr(MachineFunction &MF, MachineBasicBlock &MBB,
MachineBasicBlock::iterator I) const override;
void processFunctionBeforeFrameFinalized(MachineFunction &MF,
RegScavenger *RS = nullptr) const override;
void determineCalleeSaves(MachineFunction &MF, BitVector &SavedRegs,
RegScavenger *RS) const override;
bool targetHandlesStackFrameRounding() const override {
return true;
}
StackOffset getFrameIndexReference(const MachineFunction &MF, int FI,
Register &FrameReg) const override;
bool hasFP(const MachineFunction &MF) const override;
const SpillSlot *getCalleeSavedSpillSlots(unsigned &NumEntries)
const override {
static const SpillSlot Offsets[] = {
{ Hexagon::R17, -4 }, { Hexagon::R16, -8 }, { Hexagon::D8, -8 },
{ Hexagon::R19, -12 }, { Hexagon::R18, -16 }, { Hexagon::D9, -16 },
{ Hexagon::R21, -20 }, { Hexagon::R20, -24 }, { Hexagon::D10, -24 },
{ Hexagon::R23, -28 }, { Hexagon::R22, -32 }, { Hexagon::D11, -32 },
{ Hexagon::R25, -36 }, { Hexagon::R24, -40 }, { Hexagon::D12, -40 },
{ Hexagon::R27, -44 }, { Hexagon::R26, -48 }, { Hexagon::D13, -48 }
};
NumEntries = std::size(Offsets);
return Offsets;
}
bool assignCalleeSavedSpillSlots(MachineFunction &MF,
const TargetRegisterInfo *TRI, std::vector<CalleeSavedInfo> &CSI)
const override;
bool needsAligna(const MachineFunction &MF) const;
const MachineInstr *getAlignaInstr(const MachineFunction &MF) const;
void insertCFIInstructions(MachineFunction &MF) const;
private:
using CSIVect = std::vector<CalleeSavedInfo>;
void expandAlloca(MachineInstr *AI, const HexagonInstrInfo &TII,
Register SP, unsigned CF) const;
void insertPrologueInBlock(MachineBasicBlock &MBB, bool PrologueStubs) const;
void insertEpilogueInBlock(MachineBasicBlock &MBB) const;
void insertAllocframe(MachineBasicBlock &MBB,
MachineBasicBlock::iterator InsertPt, unsigned NumBytes) const;
bool insertCSRSpillsInBlock(MachineBasicBlock &MBB, const CSIVect &CSI,
const HexagonRegisterInfo &HRI, bool &PrologueStubs) const;
bool insertCSRRestoresInBlock(MachineBasicBlock &MBB, const CSIVect &CSI,
const HexagonRegisterInfo &HRI) const;
void updateEntryPaths(MachineFunction &MF, MachineBasicBlock &SaveB) const;
bool updateExitPaths(MachineBasicBlock &MBB, MachineBasicBlock &RestoreB,
BitVector &DoneT, BitVector &DoneF, BitVector &Path) const;
void insertCFIInstructionsAt(MachineBasicBlock &MBB,
MachineBasicBlock::iterator At) const;
bool expandCopy(MachineBasicBlock &B, MachineBasicBlock::iterator It,
MachineRegisterInfo &MRI, const HexagonInstrInfo &HII,
SmallVectorImpl<Register> &NewRegs) const;
bool expandStoreInt(MachineBasicBlock &B, MachineBasicBlock::iterator It,
MachineRegisterInfo &MRI, const HexagonInstrInfo &HII,
SmallVectorImpl<Register> &NewRegs) const;
bool expandLoadInt(MachineBasicBlock &B, MachineBasicBlock::iterator It,
MachineRegisterInfo &MRI, const HexagonInstrInfo &HII,
SmallVectorImpl<Register> &NewRegs) const;
bool expandStoreVecPred(MachineBasicBlock &B, MachineBasicBlock::iterator It,
MachineRegisterInfo &MRI, const HexagonInstrInfo &HII,
SmallVectorImpl<Register> &NewRegs) const;
bool expandLoadVecPred(MachineBasicBlock &B, MachineBasicBlock::iterator It,
MachineRegisterInfo &MRI, const HexagonInstrInfo &HII,
SmallVectorImpl<Register> &NewRegs) const;
bool expandStoreVec2(MachineBasicBlock &B, MachineBasicBlock::iterator It,
MachineRegisterInfo &MRI, const HexagonInstrInfo &HII,
SmallVectorImpl<Register> &NewRegs) const;
bool expandLoadVec2(MachineBasicBlock &B, MachineBasicBlock::iterator It,
MachineRegisterInfo &MRI, const HexagonInstrInfo &HII,
SmallVectorImpl<Register> &NewRegs) const;
bool expandStoreVec(MachineBasicBlock &B, MachineBasicBlock::iterator It,
MachineRegisterInfo &MRI, const HexagonInstrInfo &HII,
SmallVectorImpl<Register> &NewRegs) const;
bool expandLoadVec(MachineBasicBlock &B, MachineBasicBlock::iterator It,
MachineRegisterInfo &MRI, const HexagonInstrInfo &HII,
SmallVectorImpl<Register> &NewRegs) const;
bool expandSpillMacros(MachineFunction &MF,
SmallVectorImpl<Register> &NewRegs) const;
Register findPhysReg(MachineFunction &MF, HexagonBlockRanges::IndexRange &FIR,
HexagonBlockRanges::InstrIndexMap &IndexMap,
HexagonBlockRanges::RegToRangeMap &DeadMap,
const TargetRegisterClass *RC) const;
void optimizeSpillSlots(MachineFunction &MF,
SmallVectorImpl<Register> &VRegs) const;
void findShrunkPrologEpilog(MachineFunction &MF, MachineBasicBlock *&PrologB,
MachineBasicBlock *&EpilogB) const;
void addCalleeSaveRegistersAsImpOperand(MachineInstr *MI, const CSIVect &CSI,
bool IsDef, bool IsKill) const;
bool shouldInlineCSR(const MachineFunction &MF, const CSIVect &CSI) const;
bool useSpillFunction(const MachineFunction &MF, const CSIVect &CSI) const;
bool useRestoreFunction(const MachineFunction &MF, const CSIVect &CSI) const;
bool mayOverflowFrameOffset(MachineFunction &MF) const;
};
} // end namespace llvm
#endif // LLVM_LIB_TARGET_HEXAGON_HEXAGONFRAMELOWERING_H
```
|
The Shakespeare Stealer is a 1998 historical fiction novel by Gary Blackwood. Taking place in the Elizabethan-era England, it recounts the story of Widge, an orphan whose master sends him to steal Hamlet from The Lord Chamberlain's Men. It was an ALA Notable Children's Book in 1999. Blackwood published two sequels, Shakespeare's Scribe (2000) and Shakespeare's Spy (2003).
Plot summary
In the late Elizabethan era, a fourteen-year-old orphan known only by his nickname, Widge, has learned shorthand, a method of rapid writing by means of abbreviations and symbols, from his previous master, a preacher who wants Widge to steal other preachers' sermons. Bass, his new master, wants to use Widge's skill to transcribe William Shakespeare's Hamlet before Shakespeare prints it. Widge sets off to London with Falconer, a ruthless man whom Bass assigns to ensure Widge succeeds. Hamlets performance so enraptures Widge that he forgets part of his assignment, and when he returns for a second try, his notebook is stolen. Widge eventually settles into the acting troupe by posing as a hopeful player, and The Lord Chamberlain's Men accepts him. For the first time, Widge feels part of a real family. But it's hard for him knowing his duty is to not be a part of this family but to steal from them. Falconer continues to press Widge to steal the play, resulting in a constant cat and mouse chase between them. After Falconer, who turned out to be Bass in disguise, dies in a duel with The Lord Chamberlain's Men shareholder Robert Armin, Widge remains at The Globe to work toward his dream of being a player.
Characters
Widge: an orphan who does not know his real name and was born around 1587. He is 14 in the story. Widge's previous master, Dr. Bright, taught him charactery, a shorthand language, to steal other preachers' sermons. His current master, Simon Bass, wants to use Widge's shorthand to acquire Shakespeare's Hamlet, which has not been printed for the public.
Alexander "Sander" Cooke: Widge's closest friend when he starts his acting career at the Globe Theatre.
Julia "Julian" Cogan: Widge's second-closest friend. The other players discover at the end that she poses as a boy, dreaming of becoming an actor, to be allowed on stage. After she is exposed, she works at a French diner. By the end of the book, she sets sail for France.
William Shakespeare: The playwright of the Lord Chamberlain's Men and the ghost in Hamlet; Widge knocks down white paint over his shoulder.
Simon "Falconer" Bass: Widge's second master who wants him to steal Hamlet. Bass disguises himself as a messenger, Falconer. At the end, Richard Burbage (Mr. Armin) reveals Falconer is Bass, as the latter dies.
Nick: An arrogant member the Lord Chamberlain's Men with Widge, Sander, and Julian. He does not like playing lower parts (i.e. women's roles) and often comes in drunk and late. A university student nearly kills him, but Widge saves his life. He accidentally pierces Julia's chest which leads to the discovery of her secret.
Awards and nominations
1998 School Library Journal Best Book of the Year
1999 ALA Notable Children's Book
1999 ALA Best Book for Young Adults
Sequels
The novel's popularity led to two sequels, Shakespeare's Scribe (2000) and Shakespeare's Spy (2003). The three novels were published together as a trilogy in a single, 784-page volume in 2004.
References
1998 American novels
American young adult novels
American historical novels
Novels by Gary Blackwood
Novels about William Shakespeare
E. P. Dutton books
|
E. C. Glass High School is a public school in Lynchburg, Virginia. It was founded in 1871 as Lynchburg High School and was named for long-time Superintendent of Public Schools in Lynchburg, Edward Christian Glass.
Academics
E. C. Glass offers a range of Advanced Placement courses, including: AP Human Geography, AP World History, AP Research, AP American History, AP US & Comparative Government, AP Physics, AP Chemistry, AP Biology, AP Environmental Science, AP Computer Science, AP Calculus AB & BC, AP Statistics, AP Latin, AP German, AP Spanish, AP French, AP Language & Composition, AP English Literature, AP Art History, AP Music Theory, AP Macro and Micro Economics, AP European History, and AP Portfolio Art. E. C. Glass also offers a range of extra classes such as Drafting, Culinary Arts, and Personal Finance. These classes help students get a head start in the real world.
Some of the awards and recognition for E. C. Glass High School include:
US Department of Education Blue Ribbon School 1983, 1993
Redbook Magazine School Award 1996
Newsweek Magazine, 2007 Ranked in Top Public High Schools
Best Comprehensive High School in Virginia
Athletics
E. C. Glass has a rich athletic tradition. Its football team competed in the Virginia High School State Championship Play-offs in 1925, 1930, 1933, 1938, 1972, 1974, 1976, 1977, 1988, 1991, 1992, and 1995, and the semi-finals game in 1993, 1994 and 2022. The Hilltoppers won the State Championship in 1930, 1933, 1938, 1988 and finished as state runners-up in 1991 and 1992. .
Arts
Glass Theatre offers courses in acting and technical theater. Under Jim Ackley, a graduate of the Virginia Military Institute, the program won four state theatre championships. They have been selected five times to perform on the Main Stage at the Educational Theatre Association national convention and have been named the national high school theatre champions twice by the American High School Theatre Festival. Glass Theatre has also represented the United States at the Edinburgh (Scotland) International Arts Festival Fringe five times where they have always received critical acclaim and performed to sold-out audiences. In 1991, the US Congress named the EC Glass Senior Acting drama class students the winners of the “Young Writers and Inventor’s Award” for their play Going Toward the Light, written under Mr. Ackley’s supervision.
In 2012, Mr. Ackley retired after 32 years at Glass, the longest-tenured drama teacher in the school's history. Mr. E. Tom Harris served in the position for five years and was replaced in 2019 by EC Glass alumna and former Broadway and film actor, Allison Daugherty.
In 1926, E. C. Glass' literary magazine, Menagerie (formerly, The Critic), was the first to receive the Virginia High School League's Trophy Class award.
E. C. Glass also offers many classes in music. Glass's combined concert and chamber orchestra regularly travels to competitions and assessments around the region and consistently sends musicians to the All-Virginia Band and Orchestra event in Richmond.
Additionally, Glass has concert band, wind ensemble, percussion ensemble, and jazz band classes. The E. C. Glass Marching Band, called "The Pride of Old Dominion," performs at football games and competitions around the state. The school also boast an award winning Choral Department under the direction of Dr. Nancy Valk-Stalcup. Ensembles and classes within the Choral Department include the Chamber Singers, Concert Choir, Male Acapella Ensemble now the Acafellas, and the Acabellas.
Notable alumni
Beth Behrs – actress, star of the CBS comedy 2 Broke Girls
Connie Britton – actress, star of ABC's Nashville, NBC/Direct TV's Friday Night Lights
Cornell Brown – former American football All-American linebacker of the National Football League. National Defensive Player of the Year at Virginia Tech. Baltimore Ravens 1997–2004. Super Bowl Champion 2001.
Ruben Brown – former American football guard of the National Football League. Buffalo Bills, Chicago Bears 1995–2007. Nine-time Pro-Bowl Selection and four-time All-Pro Selection.
Brad Butler – American football player of the National Football League. Drafted in the 5th Round of the 2006 NFL Draft to the Buffalo Bills. Four-year starter at the University of Virginia.
Bill Chambers – record-setting collegiate basketball player for William & Mary
Bill Chipley – NFL player
Ken Clay, former MLB player (New York Yankees, Texas Rangers, Seattle Mariners)
Mickey Fitzgerald, former NFL player
Paul Fitzgerald - Broadway actor and film writer, director and actor.
Josh Hall, former MLB player (Cincinnati Reds)
David Lee - Award-winning co-creator of Cheers and Frasier, writer of multiple critically-acclaimed Broadway musicals and Hollywood films and long-running TV series. Currently, Managing Director of Endstation Theatre Company.
Andy Oldham, United States Circuit Judge of the United States Court of Appeals for the Fifth Circuit
Anthony R. Parnther American conductor
Mosby Perrow Jr. – Virginia state senator (1943–1964) and key figure in the state's abandonment of "Massive Resistance" to desegregation.
Faith Prince – Broadway actress
Sam Sloan – chess player, author and amateur lawyer.
Kara Stein - American attorney appointed by President Barack Obama in 2013 to serve on the powerful five-member U.S. Securities and Exchange Commission (SEC), a position she held until 2019. Prior to that, she held the position of Chief Legal Aide to Democratic Senator Jack Reed of Rhode Island from 1999 to 2013, during which time she helped write the Dodd–Frank Wall Street Reform and Consumer Protection Act.
Carl Anderson (singer) - (February 27, 1945 – February 23, 2004) American singer, film and theater actor known for his soulful voice, his hit songs and his moving portrayal of Judas Iscariot in the Broadway and film versions of the rock opera Jesus Christ Superstar by Andrew Lloyd Webber and Tim Rice. In 1986, Anderson and singer-actress Gloria Loring joined for their harmonious duet Friends and Lovers (Gloria Loring and Carl Anderson song), which immediately reached No. 2 on the Billboard Hot 100 chart.
Randall Wallace – American screenwriter, director, producer, and songwriter most notable for adapting Blind Harry's 15th century epic poem "The Actes and Deidis of the Illustre and Vallyeant Campioun Schir William Wallace" into his award-winning screenplay for the blockbuster film Braveheart
References
Public high schools in Virginia
Educational institutions established in 1871
Schools in Lynchburg, Virginia
1871 establishments in Virginia
|
On the afternoon of July 8, 2020, a violent and deadly drillbit tornado struck the area between the towns of Ashby and Dalton, Minnesota. The National Weather Service in Grand Forks, North Dakota rated the worst of the damage from the tornado EF4 on the Enhanced Fujita scale. The tornado was also used as the cover for the 2021 disaster film 13 Minutes.
Background
The Ashby–Dalton tornado occurred in an area covered by a severe thunderstorm watch issued by the National Weather Service Storm Prediction Center at 4:10p.m. the day of, which had mooted the risk of "a tornado or two" occurring. The supercell thunderstorm that spawned the tornado developed just before 5:00p.m., and was rotating strongly enough to garner a tornado warning by 5:08p.m. Weather spotters observing the storm passed on information to the local National Weather Service office as a funnel cloud developed and would become the Ashby–Dalton tornado.
Tornado summary
The tornado touched down at EF0 to EF1 intensity, approximately west of Ashby, in Grant County. The tornado initially moved southeast before turning northeast. After traveling , the tornado intensified to at least EF1 intensity as it entered Otter Tail County, where it turned due north before again turning to the northeast. The tornado briefly skipped over Interstate 94 before touching down on the other side at EF2 intensity. As the tornado crossed Highway 82, it quickly intensified to EF3 strength. Here, a machine shop was completely destroyed and swept off its foundation, killing one person. The victim, a 30-year-old man, had been taking videos of the tornado on Snapchat as it approached him and his colleague. His colleague sheltered by hanging on to the underside of a tractor in the machine shop, and survived. The National Weather Service rated the damage to the newly built machine shop EF3, with winds estimated to have been between .
The tornado reached its maximum width of as it crossed Highway 82. As the tornado continued northeast, it struck a two-story well-built house on a rural homestead along 120th Street, sweeping the structure completely off its foundation. The home was "decimated", and the resulting debris widely scattered. Two people sheltered in the basement and survived with injuries after the tornado hurled debris, including an entire vehicle, into the suddenly exposed space. Two other vehicles near the house were moved and northeast respectively. One lost its engine. Nearby trees were denuded, stubbed, snapped, and lofted long distances. The homestead was judged by the National Weather Service to be the tornado's point of maximum intensity, with estimated wind speeds of at least and a damage rating of EF4.
As it crossed County Road 117 the tornado produced significant damage to trees and crops, ranging from EF2 to EF3 in intensity. As the tornado began to dissipate, its movement became erratic, turning due north before turning due east and then again turning due north. While dissipating, the tornado likely maintained its strong-to-violent intensity, causing deep ground scouring. The tornado finally dissipated between 145th Street and County Road 12.
In total, the tornado killed one person, injured two others, and caused over $1.8 million (2020 USD) in damage along its path.
The tornado spawned from a low-precipitation thunderstorm with a high cloud base, making it remarkably visible. Multiple storm chasers captured photographs and footage of the photogenic tornado, which at times dwindled to just in width. A photograph of the Ashby–Dalton tornado was used in the cover for the 2021 disaster film 13 Minutes.
See also
List of F4 and EF4 tornadoes
List of F4 and EF4 tornadoes (2020–present)
References
F4 tornadoes
Tornadoes of 2020
Tornadoes in Minnesota
Grant County, Minnesota
Otter Tail County, Minnesota
|
Thomas Smales (born 19 December ) is an English former professional rugby league footballer who played in the 1950s and 1960s, and coached in the 1970s and 1980s. He played at club level for Wigan, Barrow and Featherstone Rovers as a , and coached at club level for Dewsbury (two spells), Featherstone Rovers, Bramley, Doncaster and Batley.
Background
Smales' birth was registered in Pontefract district, West Riding of Yorkshire, England.
He is the father of the rugby league footballer; Ian Smales.
Playing career
Smales made his début for Wigan in the 46–5 victory over Featherstone Rovers at Central Park, Wigan on Saturday 20 September 1958, he scored his first try (2-tries) for Wigan in the 23–16 victory over Rochdale Hornets at Athletic Ground, Rochdale on Saturday 4 October 1958, he scored his last try for Wigan in the 16–14 victory over Swinton at Station Road, Swinton on Saturday 23 April 1960, and he played his last match for Wigan in the 17–23 defeat by Hunslet at Central Park, Wigan on Saturday 10 September 1960, and made his début for Featherstone Rovers on Saturday 23 August 1952.
After a period spent playing for Barrow, Smales then played for Featherstone Rovers (Heritage № 456). He played , and scored 3-goals in Featherstone Rovers' 12–25 defeat by Hull Kingston Rovers in the 1966–67 Yorkshire County Cup Final during the 1966–67 season at Headingley Rugby Stadium, Leeds on Saturday 15 October 1966. Smales played , scored a try, two conversion's, and a penalty, in Featherstone Rovers' 17–12 victory over Barrow in the 1966–67 Challenge Cup Final during the 1966–67 season at Wembley Stadium, London on Saturday 13 May 1967, in front of a crowd of 76,290. He played in Featherstone Rovers' 9–12 defeat by Hull F.C. in the 1969–70 Yorkshire County Cup Final during the 1969–70 season at Headingley Rugby Stadium, Leeds on Saturday 20 September 1969.
Coaching career
During the 1972–73 Northern Rugby Football League season Smales was the coach in Dewsbury's 22–13 victory over Leeds in the Championship Final at Odsal Stadium, Bradford on Saturday 19 May 1973. Smales was the coach of Batley from June 1979 to October 1981.
References
External links
Statistics at wigan.rlfans.com
Wigan RL History – 1958–59 Season at wigan.rlfans.com
Wigan RL History – 1959–60 Season at wigan.rlfans.com
Wigan RL History – 1960–61 Season at wigan.rlfans.com
To date Batley and Dewsbury have met 199 times…
Wembley trip makes top double for faithful
Rogers receives late call-up
Rogers receives late call-up
Fax banking on Tommy's magic.
(archived by web.archive.org) Barrow RL class of '67 set to gather
(archived by web.archive.org) Reunion for class of '67
Playing at Smales pace sank champions
Pain of defeat serves Dewsbury well to prevent any repeat performance
Search for "Tommy Smales" at britishnewspaperarchive.co.uk
Search for "Tom Smales" at britishnewspaperarchive.co.uk
Search for "Thomas Smales" at britishnewspaperarchive.co.uk
1939 births
Living people
Barrow Raiders players
Batley Bulldogs coaches
Bramley R.L.F.C. coaches
Dewsbury Rams coaches
Doncaster R.L.F.C. coaches
English rugby league coaches
English rugby league players
Featherstone Rovers coaches
Featherstone Rovers players
Rugby league locks
Rugby league players from Pontefract
Wigan Warriors players
|
Keystone Companions: The Complete 1973 Fantasy Recordings is a four-CD album by Merl Saunders and Jerry Garcia. It was recorded live at the Keystone in Berkeley, California on July 10 and 11, 1973, and released by Fantasy Records on September 25, 2012.
From February 1971 to July 1975, Merl Saunders and Jerry Garcia played many live shows together when the Grateful Dead were not on tour. Their band's lineup for the July '73 shows at the Keystone was Saunders on keyboards, Garcia on guitar and vocals, John Kahn on bass, and Bill Vitt on drums.
Some songs from the July 10 and 11, 1973 Keystone concerts were released as the 1973 album Live at Keystone, and others were released in 1988 as Keystone Encores. Keystone Companions includes all of the songs from the two earlier albums (except for the track titled "Space"), along with seven previously unreleased tracks. All the songs were remastered for the new album, and are presented in the order that they were played in concert.
Keystone Companions is packaged as a box set, and includes a booklet with photos and liner notes, a poster, and a button, among other extras.
Critical reception
In Rolling Stone, Patrick Doyle wrote, "What's most remarkable about this four-disc set, which compiles two 1973 dates, is the range: They jam on Rodgers and Hart as well as Jimmy Cliff, and turn out the Funkadelic-like instrumental 'Keepers'; Garcia also croons an unexpectedly sweet version of 'Positively 4th Street' amid soaring, melodic guitar solos. There are no rules — just four luminaries testing their own boundaries."
On Allmusic, Thom Jurek said, "Taking it all in, it's fascinating to hear how complementary Garcia and Saunders were, and the degree to which they trusted one another in moving a set arrangement in another direction on the spot. Contrast the two versions of 'My Funny Valentine'. On the latter one, Saunders shifts tonalities from a straight, subdued reading toward a more modal and exploratory one. Garcia responds by extending the tune's entire harmonic reach. The rhythm section, too, is unshakable — check their astonishing interplay and shifting time signatures on the first version of 'Merl's Tune'.... The music, by any standard, is simply excellent."
In Blues Review, Bob Putignano wrote, "I’ve always felt the Saunders brought out and extracted a different side of Garcia, a side that was more jazz-oriented. Blues and rhythm and blues surfaced readily, and the deep grooves (especially from Saunders' B3) allowed Garcia alternate landscapes to explore. Additionally, within the Dead's universe there was far more pressure and egos to deal with. With Merl it seemed obvious that the musical state-of-affairs were more casual, yet no intensity is lost."
On Voice of America, Katherine Cole said, "The music on Keystone Companions four discs is exactly what you’d expect from a Jerry Garcia side project: a mix of rock, blues and jazz with some bluegrass and soul mixed in. And, as with any jam session, the songs sometimes wander and might even include all those styles of music within the same tune.... Keystone Companions is a fan’s dream come true — it contains two complete sets equaling almost four hours of live music. The tracks were remastered to crystal clarity..."
In Relix, Tony Sclafani wrote, "This new release configures the original recordings in the order in which the songs were performed and also offers vintage photos and liner notes by David Gans. The results are compelling. The spacious, remastered sound brings out the chemistry of the two main players as well as the interplay of the rhythm section, made up of bassist John Kahn and drummer Bill Vitt."
Track listingDisc 1"Hi-Heel Sneakers" (Robert Higgenbotham) – 8:12
"Keepers" (Merl Saunders, John Kahn) – 7:54
"The Harder They Come" (Jimmy Cliff) – 6:23
"It Takes a Lot to Laugh, It Takes a Train to Cry" (Bob Dylan) – 6:21
"It's Too Late (She's Gone)" (Chuck Willis) – 7:47
"My Funny Valentine" (Richard Rodgers, Lorenz Hart) – 18:14
"Mystery Train" (Sam Phillips, Junior Parker) – 11:37Disc 2"I Second That Emotion" (Smokey Robinson, Al Cleveland) – 10:59
"Someday Baby" (Sam Hopkins) – 10:15
"Merl's Tune" (Saunders, John White) – 13:34
"It Ain't No Use" (Jerry Williams, Gary Bonds, Don Hollinger) – 9:36
"Positively 4th Street" (Dylan) – 7:45
"How Sweet It Is (To Be Loved by You)" (Brian Holland, Lamont Dozier, Eddie Holland) – 8:09Disc 3"It Takes a Lot to Laugh, It Takes a Train to Cry" (Dylan) – 7:06
"Keepers" (Saunders, Kahn) – 6:34
"One Kind Favor" (Blind Lemon Jefferson) – 6:39
"That's All Right, Mama" (Arthur Crudup) – 4:11
"The Harder They Come" (Cliff) – 10:09
"My Funny Valentine" (Rodgers, Hart) – 18:05
"Money Honey" (Jesse Stone) – 8:21Disc 4'
"Someday Baby" (Hopkins) – 10:15
"Merl's Tune" (Saunders, White) – 12:21
"Like a Road Leading Home" (Don Nix, Dan Penn) – 11:02
"How Sweet It Is (To Be Loved by You)" (Holland, Dozier, Holland) – 10:20
Personnel
Musicians
Merl Saunders – keyboards
Jerry Garcia – guitar, vocals
John Kahn – bass
Bill Vitt – drums
David Grisman – mandolin on "Positively 4th Street"
Production
Produced by Merl Saunders, Jerry Garcia, John Kahn, Bill Vitt
Compilation producer: Chris Clough
Recording: Betty Cantor, Rex Jackson
Mixing: Seth Presant
Mastering: George Horn, Paul Blakemore
Cover design: Andrew Pham
Art direction: Abbey Anna
Artwork: Susan Brooks
Photography: Annie Leibovitz, Bob Minkin, Tony Lane
Liner notes: David Gans
References
Merl Saunders albums
Jerry Garcia albums
2012 live albums
Music of the San Francisco Bay Area
|
```java
package com.ctrip.xpipe.redis.checker.config.impl;
import com.ctrip.xpipe.api.codec.Codec;
import com.ctrip.xpipe.api.config.ConfigProvider;
import com.ctrip.xpipe.codec.JsonCodec;
import com.ctrip.xpipe.config.AbstractConfigBean;
import com.ctrip.xpipe.zk.ZkConfig;
import org.springframework.context.annotation.Configuration;
import java.util.Map;
import java.util.concurrent.atomic.AtomicReference;
@Configuration
public class DataCenterConfigBean extends AbstractConfigBean {
public static final String KEY_ZK_ADDRESS = "zk.address";
public static final String KEY_ZK_NAMESPACE = "zk.namespace";
public static final String KEY_METASERVERS = "metaservers";
public static final String KEY_CREDIS_SERVEICE_ADDRESS = "credis.service.address";
public static final String KEY_CREDIS_IDC_MAPPING_RULE = "credis.service.idc.mapping.rule";
public static final String KEY_CROSS_DC_LEADER_LEASE_NAME = "console.cross.dc.leader.lease.name";
public static final String KEY_CHECKER_ACK_TIMEOUT_MILLI = "checker.ack.timeout.milli";
public static final String KEY_FOUNDATION_GROUP_DC_MAP = "foundation.group.dc.map";
public static final String KEY_CONSOLE_DOMAINS = "console.domains";
public static final String KEY_BEACON_ORG_ROUTE = "beacon.org.routes";
private AtomicReference<String> zkConnection = new AtomicReference<>();
private AtomicReference<String> zkNameSpace = new AtomicReference<>();
public DataCenterConfigBean() {
super(ConfigProvider.DEFAULT.getOrCreateConfig(ConfigProvider.DATA_CENTER_CONFIG_NAME));
}
public String getZkConnectionString() {
return getProperty(KEY_ZK_ADDRESS, zkConnection.get() == null ? "127.0.0.1:2181" : zkConnection.get());
}
public String getZkNameSpace(){
return getProperty(KEY_ZK_NAMESPACE, zkNameSpace.get() == null ? ZkConfig.DEFAULT_ZK_NAMESPACE:zkNameSpace.get());
}
public Map<String,String> getMetaservers() {
String property = getProperty(KEY_METASERVERS, "{}");
return JsonCodec.INSTANCE.decode(property, Map.class);
}
public String getCredisServiceAddress() {
return getProperty(KEY_CREDIS_SERVEICE_ADDRESS, "localhost:8080");
}
public Map<String, String> getCredisIdcMappingRules() {
return Codec.DEFAULT.decode(getProperty(KEY_CREDIS_IDC_MAPPING_RULE, "{}"), Map.class);
}
public String getCrossDcLeaderLeaseName() {
return getProperty(KEY_CROSS_DC_LEADER_LEASE_NAME, "CROSS_DC_LEADER");
}
public int getCheckerAckTimeoutMilli() {
return getIntProperty(KEY_CHECKER_ACK_TIMEOUT_MILLI, 60000);
}
public Map<String, String> getGroupDcMap() {
String mappingRule = getProperty(KEY_FOUNDATION_GROUP_DC_MAP, "{}");
return JsonCodec.INSTANCE.decode(mappingRule, Map.class);
}
public Map<String, String> getConsoleDomains() {
String property = getProperty(KEY_CONSOLE_DOMAINS, "{}");
return JsonCodec.INSTANCE.decode(property, Map.class);
}
public String getBeaconOrgRoutes() {
return getProperty(KEY_BEACON_ORG_ROUTE, "[]");
}
}
```
|
Pentafluorophenyl (PFP) esters are chemical compounds with the generic formula RC(O)OC6F5. They are active esters derived from pentafluorophenol (HOC6F5).
PFP esters are useful for attaching fluorophores such as fluorescein or haptens to primary amines in biomolecules. They also are valuable in laboratory peptide synthesis. Pentafluorophenyl esters produce amide bonds as effectively as succinimidyl esters and various similar agents do, but PFP esters are particularly useful because they are less susceptible to spontaneous hydrolysis during conjugation reactions.
References
Esters
Pentafluorophenyl compounds
Phenol esters
Reagents for organic chemistry
|
The Royal Veterinary and Agricultural University (, abbr. KVL) was a veterinary and agricultural science university in Denmark. It was founded in 1856 and operated until 2007, when it became a part of the University of Copenhagen. It had its headquarters in Frederiksberg, Copenhagen.
History
The university was founded in 1856. Its main building was inaugurated in 1858. The Royal Veterinarian School moved from Sankt Annæ Gade into the main building after its inauguration.
On January 1, 2007, the Royal Veterinary and Agricultural University was merged into the University of Copenhagen and was renamed as the Faculty of Life Sciences. This was later split up, with the veterinary part merging into the Faculty of Health and Medical Sciences and the rest merging into the Faculty of Science.
Locations
Main campus
The original three-winged main building (with the pergola) on Bülowsvej 17 was built between 1856 and 1858 and was designed by Gottlieb Bindesbøll. He also designed two detached wings that were built on Grønnegårdsvej. In 1895, the main building was expanded with a fourth wing (designed by Johannes Emil Gnudtzmann) and a central courtyard.
As of January 2007, the area is part of the University of Copenhagen's Frederiksberg Campus.
Other
The Royal Veterinary and Agricultural University established the Hørsholm Arboretum in 1936 as an off-site expansion of the Forestry Botanical Garden in Charlottenlund.
List of notable people
Alumni
Werner Hosewinckel Christie (1877–1927)
Svend O. Heiberg (1900–1965)
Johannes Larsen Flatla (1906–1973)
Steen Willadsen (1943–)
Gábor Vajta (1952–)
Mette Gjerskov (1966–)
Faculty
Johan Lange (1818–1898)
Niels Fjord (1825–1891)
Emil Rostrup (1831–1907)
Bernhard Bang (1848–1932)
Peder Vilhelm Jensen-Klint (1853–1930)
Wilhelm Johannsen (1857–1927)
Ebba Lund (1923–1999)
August Mentz (1867–1944)
Carl Hansen Ostenfeld (1873–1931)
Niels Bjerrum (1879–1958)
Øjvind Winge (1886–1964)
Jakob Nielsen (1890–1959)
Jens Clausen (1891–1969)
Thorvald Sørensen (1902–1973)
References
External links
Buildings
Higher education in Copenhagen
Agricultural universities and colleges
Martin Borch buildings
Veterinary schools in Denmark
Gottlieb Bindesbøll buildings
|
```c
/*
*/
#include <drm/drm_blend.h>
#include "i915_drv.h"
#include "i915_fixed.h"
#include "i915_reg.h"
#include "i9xx_wm.h"
#include "intel_atomic.h"
#include "intel_atomic_plane.h"
#include "intel_bw.h"
#include "intel_crtc.h"
#include "intel_de.h"
#include "intel_display.h"
#include "intel_display_power.h"
#include "intel_display_types.h"
#include "intel_fb.h"
#include "intel_pcode.h"
#include "intel_wm.h"
#include "skl_watermark.h"
#include "skl_watermark_regs.h"
static void skl_sagv_disable(struct drm_i915_private *i915);
/* Stores plane specific WM parameters */
struct skl_wm_params {
bool x_tiled, y_tiled;
bool rc_surface;
bool is_planar;
u32 width;
u8 cpp;
u32 plane_pixel_rate;
u32 y_min_scanlines;
u32 plane_bytes_per_line;
uint_fixed_16_16_t plane_blocks_per_line;
uint_fixed_16_16_t y_tile_minimum;
u32 linetime_us;
u32 dbuf_block_size;
};
u8 intel_enabled_dbuf_slices_mask(struct drm_i915_private *i915)
{
u8 enabled_slices = 0;
enum dbuf_slice slice;
for_each_dbuf_slice(i915, slice) {
if (intel_de_read(i915, DBUF_CTL_S(slice)) & DBUF_POWER_STATE)
enabled_slices |= BIT(slice);
}
return enabled_slices;
}
/*
* FIXME: We still don't have the proper code detect if we need to apply the WA,
* so assume we'll always need it in order to avoid underruns.
*/
static bool skl_needs_memory_bw_wa(struct drm_i915_private *i915)
{
return DISPLAY_VER(i915) == 9;
}
static bool
intel_has_sagv(struct drm_i915_private *i915)
{
return HAS_SAGV(i915) &&
i915->display.sagv.status != I915_SAGV_NOT_CONTROLLED;
}
static u32
intel_sagv_block_time(struct drm_i915_private *i915)
{
if (DISPLAY_VER(i915) >= 14) {
u32 val;
val = intel_de_read(i915, MTL_LATENCY_SAGV);
return REG_FIELD_GET(MTL_LATENCY_QCLK_SAGV, val);
} else if (DISPLAY_VER(i915) >= 12) {
u32 val = 0;
int ret;
ret = snb_pcode_read(&i915->uncore,
GEN12_PCODE_READ_SAGV_BLOCK_TIME_US,
&val, NULL);
if (ret) {
drm_dbg_kms(&i915->drm, "Couldn't read SAGV block time!\n");
return 0;
}
return val;
} else if (DISPLAY_VER(i915) == 11) {
return 10;
} else if (HAS_SAGV(i915)) {
return 30;
} else {
return 0;
}
}
static void intel_sagv_init(struct drm_i915_private *i915)
{
if (!HAS_SAGV(i915))
i915->display.sagv.status = I915_SAGV_NOT_CONTROLLED;
/*
* Probe to see if we have working SAGV control.
* For icl+ this was already determined by intel_bw_init_hw().
*/
if (DISPLAY_VER(i915) < 11)
skl_sagv_disable(i915);
drm_WARN_ON(&i915->drm, i915->display.sagv.status == I915_SAGV_UNKNOWN);
i915->display.sagv.block_time_us = intel_sagv_block_time(i915);
drm_dbg_kms(&i915->drm, "SAGV supported: %s, original SAGV block time: %u us\n",
str_yes_no(intel_has_sagv(i915)), i915->display.sagv.block_time_us);
/* avoid overflow when adding with wm0 latency/etc. */
if (drm_WARN(&i915->drm, i915->display.sagv.block_time_us > U16_MAX,
"Excessive SAGV block time %u, ignoring\n",
i915->display.sagv.block_time_us))
i915->display.sagv.block_time_us = 0;
if (!intel_has_sagv(i915))
i915->display.sagv.block_time_us = 0;
}
/*
* SAGV dynamically adjusts the system agent voltage and clock frequencies
* depending on power and performance requirements. The display engine access
* to system memory is blocked during the adjustment time. Because of the
* blocking time, having this enabled can cause full system hangs and/or pipe
* underruns if we don't meet all of the following requirements:
*
* - <= 1 pipe enabled
* - All planes can enable watermarks for latencies >= SAGV engine block time
* - We're not using an interlaced display configuration
*/
static void skl_sagv_enable(struct drm_i915_private *i915)
{
int ret;
if (!intel_has_sagv(i915))
return;
if (i915->display.sagv.status == I915_SAGV_ENABLED)
return;
drm_dbg_kms(&i915->drm, "Enabling SAGV\n");
ret = snb_pcode_write(&i915->uncore, GEN9_PCODE_SAGV_CONTROL,
GEN9_SAGV_ENABLE);
/* We don't need to wait for SAGV when enabling */
/*
* Some skl systems, pre-release machines in particular,
* don't actually have SAGV.
*/
if (IS_SKYLAKE(i915) && ret == -ENXIO) {
drm_dbg(&i915->drm, "No SAGV found on system, ignoring\n");
i915->display.sagv.status = I915_SAGV_NOT_CONTROLLED;
return;
} else if (ret < 0) {
drm_err(&i915->drm, "Failed to enable SAGV\n");
return;
}
i915->display.sagv.status = I915_SAGV_ENABLED;
}
static void skl_sagv_disable(struct drm_i915_private *i915)
{
int ret;
if (!intel_has_sagv(i915))
return;
if (i915->display.sagv.status == I915_SAGV_DISABLED)
return;
drm_dbg_kms(&i915->drm, "Disabling SAGV\n");
/* bspec says to keep retrying for at least 1 ms */
ret = skl_pcode_request(&i915->uncore, GEN9_PCODE_SAGV_CONTROL,
GEN9_SAGV_DISABLE,
GEN9_SAGV_IS_DISABLED, GEN9_SAGV_IS_DISABLED,
1);
/*
* Some skl systems, pre-release machines in particular,
* don't actually have SAGV.
*/
if (IS_SKYLAKE(i915) && ret == -ENXIO) {
drm_dbg(&i915->drm, "No SAGV found on system, ignoring\n");
i915->display.sagv.status = I915_SAGV_NOT_CONTROLLED;
return;
} else if (ret < 0) {
drm_err(&i915->drm, "Failed to disable SAGV (%d)\n", ret);
return;
}
i915->display.sagv.status = I915_SAGV_DISABLED;
}
static void skl_sagv_pre_plane_update(struct intel_atomic_state *state)
{
struct drm_i915_private *i915 = to_i915(state->base.dev);
const struct intel_bw_state *new_bw_state =
intel_atomic_get_new_bw_state(state);
if (!new_bw_state)
return;
if (!intel_can_enable_sagv(i915, new_bw_state))
skl_sagv_disable(i915);
}
static void skl_sagv_post_plane_update(struct intel_atomic_state *state)
{
struct drm_i915_private *i915 = to_i915(state->base.dev);
const struct intel_bw_state *new_bw_state =
intel_atomic_get_new_bw_state(state);
if (!new_bw_state)
return;
if (intel_can_enable_sagv(i915, new_bw_state))
skl_sagv_enable(i915);
}
static void icl_sagv_pre_plane_update(struct intel_atomic_state *state)
{
struct drm_i915_private *i915 = to_i915(state->base.dev);
const struct intel_bw_state *old_bw_state =
intel_atomic_get_old_bw_state(state);
const struct intel_bw_state *new_bw_state =
intel_atomic_get_new_bw_state(state);
u16 old_mask, new_mask;
if (!new_bw_state)
return;
old_mask = old_bw_state->qgv_points_mask;
new_mask = old_bw_state->qgv_points_mask | new_bw_state->qgv_points_mask;
if (old_mask == new_mask)
return;
WARN_ON(!new_bw_state->base.changed);
drm_dbg_kms(&i915->drm, "Restricting QGV points: 0x%x -> 0x%x\n",
old_mask, new_mask);
/*
* Restrict required qgv points before updating the configuration.
* According to BSpec we can't mask and unmask qgv points at the same
* time. Also masking should be done before updating the configuration
* and unmasking afterwards.
*/
icl_pcode_restrict_qgv_points(i915, new_mask);
}
static void icl_sagv_post_plane_update(struct intel_atomic_state *state)
{
struct drm_i915_private *i915 = to_i915(state->base.dev);
const struct intel_bw_state *old_bw_state =
intel_atomic_get_old_bw_state(state);
const struct intel_bw_state *new_bw_state =
intel_atomic_get_new_bw_state(state);
u16 old_mask, new_mask;
if (!new_bw_state)
return;
old_mask = old_bw_state->qgv_points_mask | new_bw_state->qgv_points_mask;
new_mask = new_bw_state->qgv_points_mask;
if (old_mask == new_mask)
return;
WARN_ON(!new_bw_state->base.changed);
drm_dbg_kms(&i915->drm, "Relaxing QGV points: 0x%x -> 0x%x\n",
old_mask, new_mask);
/*
* Allow required qgv points after updating the configuration.
* According to BSpec we can't mask and unmask qgv points at the same
* time. Also masking should be done before updating the configuration
* and unmasking afterwards.
*/
icl_pcode_restrict_qgv_points(i915, new_mask);
}
void intel_sagv_pre_plane_update(struct intel_atomic_state *state)
{
struct drm_i915_private *i915 = to_i915(state->base.dev);
/*
* Just return if we can't control SAGV or don't have it.
* This is different from situation when we have SAGV but just can't
* afford it due to DBuf limitation - in case if SAGV is completely
* disabled in a BIOS, we are not even allowed to send a PCode request,
* as it will throw an error. So have to check it here.
*/
if (!intel_has_sagv(i915))
return;
if (DISPLAY_VER(i915) >= 11)
icl_sagv_pre_plane_update(state);
else
skl_sagv_pre_plane_update(state);
}
void intel_sagv_post_plane_update(struct intel_atomic_state *state)
{
struct drm_i915_private *i915 = to_i915(state->base.dev);
/*
* Just return if we can't control SAGV or don't have it.
* This is different from situation when we have SAGV but just can't
* afford it due to DBuf limitation - in case if SAGV is completely
* disabled in a BIOS, we are not even allowed to send a PCode request,
* as it will throw an error. So have to check it here.
*/
if (!intel_has_sagv(i915))
return;
if (DISPLAY_VER(i915) >= 11)
icl_sagv_post_plane_update(state);
else
skl_sagv_post_plane_update(state);
}
static bool skl_crtc_can_enable_sagv(const struct intel_crtc_state *crtc_state)
{
struct intel_crtc *crtc = to_intel_crtc(crtc_state->uapi.crtc);
struct drm_i915_private *i915 = to_i915(crtc->base.dev);
enum plane_id plane_id;
int max_level = INT_MAX;
if (!intel_has_sagv(i915))
return false;
if (!crtc_state->hw.active)
return true;
if (crtc_state->hw.pipe_mode.flags & DRM_MODE_FLAG_INTERLACE)
return false;
for_each_plane_id_on_crtc(crtc, plane_id) {
const struct skl_plane_wm *wm =
&crtc_state->wm.skl.optimal.planes[plane_id];
int level;
/* Skip this plane if it's not enabled */
if (!wm->wm[0].enable)
continue;
/* Find the highest enabled wm level for this plane */
for (level = i915->display.wm.num_levels - 1;
!wm->wm[level].enable; --level)
{ }
/* Highest common enabled wm level for all planes */
max_level = min(level, max_level);
}
/* No enabled planes? */
if (max_level == INT_MAX)
return true;
for_each_plane_id_on_crtc(crtc, plane_id) {
const struct skl_plane_wm *wm =
&crtc_state->wm.skl.optimal.planes[plane_id];
/*
* All enabled planes must have enabled a common wm level that
* can tolerate memory latencies higher than sagv_block_time_us
*/
if (wm->wm[0].enable && !wm->wm[max_level].can_sagv)
return false;
}
return true;
}
static bool tgl_crtc_can_enable_sagv(const struct intel_crtc_state *crtc_state)
{
struct intel_crtc *crtc = to_intel_crtc(crtc_state->uapi.crtc);
enum plane_id plane_id;
if (!crtc_state->hw.active)
return true;
for_each_plane_id_on_crtc(crtc, plane_id) {
const struct skl_plane_wm *wm =
&crtc_state->wm.skl.optimal.planes[plane_id];
if (wm->wm[0].enable && !wm->sagv.wm0.enable)
return false;
}
return true;
}
static bool intel_crtc_can_enable_sagv(const struct intel_crtc_state *crtc_state)
{
struct intel_crtc *crtc = to_intel_crtc(crtc_state->uapi.crtc);
struct drm_i915_private *i915 = to_i915(crtc->base.dev);
if (!i915->params.enable_sagv)
return false;
if (DISPLAY_VER(i915) >= 12)
return tgl_crtc_can_enable_sagv(crtc_state);
else
return skl_crtc_can_enable_sagv(crtc_state);
}
bool intel_can_enable_sagv(struct drm_i915_private *i915,
const struct intel_bw_state *bw_state)
{
if (DISPLAY_VER(i915) < 11 &&
bw_state->active_pipes && !is_power_of_2(bw_state->active_pipes))
return false;
return bw_state->pipe_sagv_reject == 0;
}
static int intel_compute_sagv_mask(struct intel_atomic_state *state)
{
struct drm_i915_private *i915 = to_i915(state->base.dev);
int ret;
struct intel_crtc *crtc;
struct intel_crtc_state *new_crtc_state;
struct intel_bw_state *new_bw_state = NULL;
const struct intel_bw_state *old_bw_state = NULL;
int i;
for_each_new_intel_crtc_in_state(state, crtc,
new_crtc_state, i) {
new_bw_state = intel_atomic_get_bw_state(state);
if (IS_ERR(new_bw_state))
return PTR_ERR(new_bw_state);
old_bw_state = intel_atomic_get_old_bw_state(state);
if (intel_crtc_can_enable_sagv(new_crtc_state))
new_bw_state->pipe_sagv_reject &= ~BIT(crtc->pipe);
else
new_bw_state->pipe_sagv_reject |= BIT(crtc->pipe);
}
if (!new_bw_state)
return 0;
new_bw_state->active_pipes =
intel_calc_active_pipes(state, old_bw_state->active_pipes);
if (new_bw_state->active_pipes != old_bw_state->active_pipes) {
ret = intel_atomic_lock_global_state(&new_bw_state->base);
if (ret)
return ret;
}
if (intel_can_enable_sagv(i915, new_bw_state) !=
intel_can_enable_sagv(i915, old_bw_state)) {
ret = intel_atomic_serialize_global_state(&new_bw_state->base);
if (ret)
return ret;
} else if (new_bw_state->pipe_sagv_reject != old_bw_state->pipe_sagv_reject) {
ret = intel_atomic_lock_global_state(&new_bw_state->base);
if (ret)
return ret;
}
for_each_new_intel_crtc_in_state(state, crtc,
new_crtc_state, i) {
struct skl_pipe_wm *pipe_wm = &new_crtc_state->wm.skl.optimal;
/*
* We store use_sagv_wm in the crtc state rather than relying on
* that bw state since we have no convenient way to get at the
* latter from the plane commit hooks (especially in the legacy
* cursor case)
*/
pipe_wm->use_sagv_wm = !HAS_HW_SAGV_WM(i915) &&
DISPLAY_VER(i915) >= 12 &&
intel_can_enable_sagv(i915, new_bw_state);
}
return 0;
}
static u16 skl_ddb_entry_init(struct skl_ddb_entry *entry,
u16 start, u16 end)
{
entry->start = start;
entry->end = end;
return end;
}
static int intel_dbuf_slice_size(struct drm_i915_private *i915)
{
return DISPLAY_INFO(i915)->dbuf.size /
hweight8(DISPLAY_INFO(i915)->dbuf.slice_mask);
}
static void
skl_ddb_entry_for_slices(struct drm_i915_private *i915, u8 slice_mask,
struct skl_ddb_entry *ddb)
{
int slice_size = intel_dbuf_slice_size(i915);
if (!slice_mask) {
ddb->start = 0;
ddb->end = 0;
return;
}
ddb->start = (ffs(slice_mask) - 1) * slice_size;
ddb->end = fls(slice_mask) * slice_size;
WARN_ON(ddb->start >= ddb->end);
WARN_ON(ddb->end > DISPLAY_INFO(i915)->dbuf.size);
}
static unsigned int mbus_ddb_offset(struct drm_i915_private *i915, u8 slice_mask)
{
struct skl_ddb_entry ddb;
if (slice_mask & (BIT(DBUF_S1) | BIT(DBUF_S2)))
slice_mask = BIT(DBUF_S1);
else if (slice_mask & (BIT(DBUF_S3) | BIT(DBUF_S4)))
slice_mask = BIT(DBUF_S3);
skl_ddb_entry_for_slices(i915, slice_mask, &ddb);
return ddb.start;
}
u32 skl_ddb_dbuf_slice_mask(struct drm_i915_private *i915,
const struct skl_ddb_entry *entry)
{
int slice_size = intel_dbuf_slice_size(i915);
enum dbuf_slice start_slice, end_slice;
u8 slice_mask = 0;
if (!skl_ddb_entry_size(entry))
return 0;
start_slice = entry->start / slice_size;
end_slice = (entry->end - 1) / slice_size;
/*
* Per plane DDB entry can in a really worst case be on multiple slices
* but single entry is anyway contigious.
*/
while (start_slice <= end_slice) {
slice_mask |= BIT(start_slice);
start_slice++;
}
return slice_mask;
}
static unsigned int intel_crtc_ddb_weight(const struct intel_crtc_state *crtc_state)
{
const struct drm_display_mode *pipe_mode = &crtc_state->hw.pipe_mode;
int hdisplay, vdisplay;
if (!crtc_state->hw.active)
return 0;
/*
* Watermark/ddb requirement highly depends upon width of the
* framebuffer, So instead of allocating DDB equally among pipes
* distribute DDB based on resolution/width of the display.
*/
drm_mode_get_hv_timing(pipe_mode, &hdisplay, &vdisplay);
return hdisplay;
}
static void intel_crtc_dbuf_weights(const struct intel_dbuf_state *dbuf_state,
enum pipe for_pipe,
unsigned int *weight_start,
unsigned int *weight_end,
unsigned int *weight_total)
{
struct drm_i915_private *i915 =
to_i915(dbuf_state->base.state->base.dev);
enum pipe pipe;
*weight_start = 0;
*weight_end = 0;
*weight_total = 0;
for_each_pipe(i915, pipe) {
int weight = dbuf_state->weight[pipe];
/*
* Do not account pipes using other slice sets
* luckily as of current BSpec slice sets do not partially
* intersect(pipes share either same one slice or same slice set
* i.e no partial intersection), so it is enough to check for
* equality for now.
*/
if (dbuf_state->slices[pipe] != dbuf_state->slices[for_pipe])
continue;
*weight_total += weight;
if (pipe < for_pipe) {
*weight_start += weight;
*weight_end += weight;
} else if (pipe == for_pipe) {
*weight_end += weight;
}
}
}
static int
skl_crtc_allocate_ddb(struct intel_atomic_state *state, struct intel_crtc *crtc)
{
struct drm_i915_private *i915 = to_i915(crtc->base.dev);
unsigned int weight_total, weight_start, weight_end;
const struct intel_dbuf_state *old_dbuf_state =
intel_atomic_get_old_dbuf_state(state);
struct intel_dbuf_state *new_dbuf_state =
intel_atomic_get_new_dbuf_state(state);
struct intel_crtc_state *crtc_state;
struct skl_ddb_entry ddb_slices;
enum pipe pipe = crtc->pipe;
unsigned int mbus_offset = 0;
u32 ddb_range_size;
u32 dbuf_slice_mask;
u32 start, end;
int ret;
if (new_dbuf_state->weight[pipe] == 0) {
skl_ddb_entry_init(&new_dbuf_state->ddb[pipe], 0, 0);
goto out;
}
dbuf_slice_mask = new_dbuf_state->slices[pipe];
skl_ddb_entry_for_slices(i915, dbuf_slice_mask, &ddb_slices);
mbus_offset = mbus_ddb_offset(i915, dbuf_slice_mask);
ddb_range_size = skl_ddb_entry_size(&ddb_slices);
intel_crtc_dbuf_weights(new_dbuf_state, pipe,
&weight_start, &weight_end, &weight_total);
start = ddb_range_size * weight_start / weight_total;
end = ddb_range_size * weight_end / weight_total;
skl_ddb_entry_init(&new_dbuf_state->ddb[pipe],
ddb_slices.start - mbus_offset + start,
ddb_slices.start - mbus_offset + end);
out:
if (old_dbuf_state->slices[pipe] == new_dbuf_state->slices[pipe] &&
skl_ddb_entry_equal(&old_dbuf_state->ddb[pipe],
&new_dbuf_state->ddb[pipe]))
return 0;
ret = intel_atomic_lock_global_state(&new_dbuf_state->base);
if (ret)
return ret;
crtc_state = intel_atomic_get_crtc_state(&state->base, crtc);
if (IS_ERR(crtc_state))
return PTR_ERR(crtc_state);
/*
* Used for checking overlaps, so we need absolute
* offsets instead of MBUS relative offsets.
*/
crtc_state->wm.skl.ddb.start = mbus_offset + new_dbuf_state->ddb[pipe].start;
crtc_state->wm.skl.ddb.end = mbus_offset + new_dbuf_state->ddb[pipe].end;
drm_dbg_kms(&i915->drm,
"[CRTC:%d:%s] dbuf slices 0x%x -> 0x%x, ddb (%d - %d) -> (%d - %d), active pipes 0x%x -> 0x%x\n",
crtc->base.base.id, crtc->base.name,
old_dbuf_state->slices[pipe], new_dbuf_state->slices[pipe],
old_dbuf_state->ddb[pipe].start, old_dbuf_state->ddb[pipe].end,
new_dbuf_state->ddb[pipe].start, new_dbuf_state->ddb[pipe].end,
old_dbuf_state->active_pipes, new_dbuf_state->active_pipes);
return 0;
}
static int skl_compute_wm_params(const struct intel_crtc_state *crtc_state,
int width, const struct drm_format_info *format,
u64 modifier, unsigned int rotation,
u32 plane_pixel_rate, struct skl_wm_params *wp,
int color_plane);
static void skl_compute_plane_wm(const struct intel_crtc_state *crtc_state,
struct intel_plane *plane,
int level,
unsigned int latency,
const struct skl_wm_params *wp,
const struct skl_wm_level *result_prev,
struct skl_wm_level *result /* out */);
static unsigned int skl_wm_latency(struct drm_i915_private *i915, int level,
const struct skl_wm_params *wp)
{
unsigned int latency = i915->display.wm.skl_latency[level];
if (latency == 0)
return 0;
/*
* WaIncreaseLatencyIPCEnabled: kbl,cfl
* Display WA #1141: kbl,cfl
*/
if ((IS_KABYLAKE(i915) || IS_COFFEELAKE(i915) || IS_COMETLAKE(i915)) &&
skl_watermark_ipc_enabled(i915))
latency += 4;
if (skl_needs_memory_bw_wa(i915) && wp && wp->x_tiled)
latency += 15;
return latency;
}
static unsigned int
skl_cursor_allocation(const struct intel_crtc_state *crtc_state,
int num_active)
{
struct intel_plane *plane = to_intel_plane(crtc_state->uapi.crtc->cursor);
struct drm_i915_private *i915 = to_i915(crtc_state->uapi.crtc->dev);
struct skl_wm_level wm = {};
int ret, min_ddb_alloc = 0;
struct skl_wm_params wp;
int level;
ret = skl_compute_wm_params(crtc_state, 256,
drm_format_info(DRM_FORMAT_ARGB8888),
DRM_FORMAT_MOD_LINEAR,
DRM_MODE_ROTATE_0,
crtc_state->pixel_rate, &wp, 0);
drm_WARN_ON(&i915->drm, ret);
for (level = 0; level < i915->display.wm.num_levels; level++) {
unsigned int latency = skl_wm_latency(i915, level, &wp);
skl_compute_plane_wm(crtc_state, plane, level, latency, &wp, &wm, &wm);
if (wm.min_ddb_alloc == U16_MAX)
break;
min_ddb_alloc = wm.min_ddb_alloc;
}
return max(num_active == 1 ? 32 : 8, min_ddb_alloc);
}
static void skl_ddb_entry_init_from_hw(struct skl_ddb_entry *entry, u32 reg)
{
skl_ddb_entry_init(entry,
REG_FIELD_GET(PLANE_BUF_START_MASK, reg),
REG_FIELD_GET(PLANE_BUF_END_MASK, reg));
if (entry->end)
entry->end++;
}
static void
skl_ddb_get_hw_plane_state(struct drm_i915_private *i915,
const enum pipe pipe,
const enum plane_id plane_id,
struct skl_ddb_entry *ddb,
struct skl_ddb_entry *ddb_y)
{
u32 val;
/* Cursor doesn't support NV12/planar, so no extra calculation needed */
if (plane_id == PLANE_CURSOR) {
val = intel_de_read(i915, CUR_BUF_CFG(pipe));
skl_ddb_entry_init_from_hw(ddb, val);
return;
}
val = intel_de_read(i915, PLANE_BUF_CFG(pipe, plane_id));
skl_ddb_entry_init_from_hw(ddb, val);
if (DISPLAY_VER(i915) >= 11)
return;
val = intel_de_read(i915, PLANE_NV12_BUF_CFG(pipe, plane_id));
skl_ddb_entry_init_from_hw(ddb_y, val);
}
static void skl_pipe_ddb_get_hw_state(struct intel_crtc *crtc,
struct skl_ddb_entry *ddb,
struct skl_ddb_entry *ddb_y)
{
struct drm_i915_private *i915 = to_i915(crtc->base.dev);
enum intel_display_power_domain power_domain;
enum pipe pipe = crtc->pipe;
intel_wakeref_t wakeref;
enum plane_id plane_id;
power_domain = POWER_DOMAIN_PIPE(pipe);
wakeref = intel_display_power_get_if_enabled(i915, power_domain);
if (!wakeref)
return;
for_each_plane_id_on_crtc(crtc, plane_id)
skl_ddb_get_hw_plane_state(i915, pipe,
plane_id,
&ddb[plane_id],
&ddb_y[plane_id]);
intel_display_power_put(i915, power_domain, wakeref);
}
struct dbuf_slice_conf_entry {
u8 active_pipes;
u8 dbuf_mask[I915_MAX_PIPES];
bool join_mbus;
};
/*
* Table taken from Bspec 12716
* Pipes do have some preferred DBuf slice affinity,
* plus there are some hardcoded requirements on how
* those should be distributed for multipipe scenarios.
* For more DBuf slices algorithm can get even more messy
* and less readable, so decided to use a table almost
* as is from BSpec itself - that way it is at least easier
* to compare, change and check.
*/
static const struct dbuf_slice_conf_entry icl_allowed_dbufs[] =
/* Autogenerated with igt/tools/intel_dbuf_map tool: */
{
{
.active_pipes = BIT(PIPE_A),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1),
},
},
{
.active_pipes = BIT(PIPE_B),
.dbuf_mask = {
[PIPE_B] = BIT(DBUF_S1),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_B),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1),
[PIPE_B] = BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_C),
.dbuf_mask = {
[PIPE_C] = BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_C),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1),
[PIPE_C] = BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_B) | BIT(PIPE_C),
.dbuf_mask = {
[PIPE_B] = BIT(DBUF_S1),
[PIPE_C] = BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_B) | BIT(PIPE_C),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1),
[PIPE_B] = BIT(DBUF_S1),
[PIPE_C] = BIT(DBUF_S2),
},
},
{}
};
/*
* Table taken from Bspec 49255
* Pipes do have some preferred DBuf slice affinity,
* plus there are some hardcoded requirements on how
* those should be distributed for multipipe scenarios.
* For more DBuf slices algorithm can get even more messy
* and less readable, so decided to use a table almost
* as is from BSpec itself - that way it is at least easier
* to compare, change and check.
*/
static const struct dbuf_slice_conf_entry tgl_allowed_dbufs[] =
/* Autogenerated with igt/tools/intel_dbuf_map tool: */
{
{
.active_pipes = BIT(PIPE_A),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1) | BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_B),
.dbuf_mask = {
[PIPE_B] = BIT(DBUF_S1) | BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_B),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S2),
[PIPE_B] = BIT(DBUF_S1),
},
},
{
.active_pipes = BIT(PIPE_C),
.dbuf_mask = {
[PIPE_C] = BIT(DBUF_S2) | BIT(DBUF_S1),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_C),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1),
[PIPE_C] = BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_B) | BIT(PIPE_C),
.dbuf_mask = {
[PIPE_B] = BIT(DBUF_S1),
[PIPE_C] = BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_B) | BIT(PIPE_C),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1),
[PIPE_B] = BIT(DBUF_S1),
[PIPE_C] = BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_D),
.dbuf_mask = {
[PIPE_D] = BIT(DBUF_S2) | BIT(DBUF_S1),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1),
[PIPE_D] = BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_B) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_B] = BIT(DBUF_S1),
[PIPE_D] = BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_B) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1),
[PIPE_B] = BIT(DBUF_S1),
[PIPE_D] = BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_C) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_C] = BIT(DBUF_S1),
[PIPE_D] = BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_C) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1),
[PIPE_C] = BIT(DBUF_S2),
[PIPE_D] = BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_B) | BIT(PIPE_C) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_B] = BIT(DBUF_S1),
[PIPE_C] = BIT(DBUF_S2),
[PIPE_D] = BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_B) | BIT(PIPE_C) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1),
[PIPE_B] = BIT(DBUF_S1),
[PIPE_C] = BIT(DBUF_S2),
[PIPE_D] = BIT(DBUF_S2),
},
},
{}
};
static const struct dbuf_slice_conf_entry dg2_allowed_dbufs[] = {
{
.active_pipes = BIT(PIPE_A),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1) | BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_B),
.dbuf_mask = {
[PIPE_B] = BIT(DBUF_S1) | BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_B),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1),
[PIPE_B] = BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_C),
.dbuf_mask = {
[PIPE_C] = BIT(DBUF_S3) | BIT(DBUF_S4),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_C),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1) | BIT(DBUF_S2),
[PIPE_C] = BIT(DBUF_S3) | BIT(DBUF_S4),
},
},
{
.active_pipes = BIT(PIPE_B) | BIT(PIPE_C),
.dbuf_mask = {
[PIPE_B] = BIT(DBUF_S1) | BIT(DBUF_S2),
[PIPE_C] = BIT(DBUF_S3) | BIT(DBUF_S4),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_B) | BIT(PIPE_C),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1),
[PIPE_B] = BIT(DBUF_S2),
[PIPE_C] = BIT(DBUF_S3) | BIT(DBUF_S4),
},
},
{
.active_pipes = BIT(PIPE_D),
.dbuf_mask = {
[PIPE_D] = BIT(DBUF_S3) | BIT(DBUF_S4),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1) | BIT(DBUF_S2),
[PIPE_D] = BIT(DBUF_S3) | BIT(DBUF_S4),
},
},
{
.active_pipes = BIT(PIPE_B) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_B] = BIT(DBUF_S1) | BIT(DBUF_S2),
[PIPE_D] = BIT(DBUF_S3) | BIT(DBUF_S4),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_B) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1),
[PIPE_B] = BIT(DBUF_S2),
[PIPE_D] = BIT(DBUF_S3) | BIT(DBUF_S4),
},
},
{
.active_pipes = BIT(PIPE_C) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_C] = BIT(DBUF_S3),
[PIPE_D] = BIT(DBUF_S4),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_C) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1) | BIT(DBUF_S2),
[PIPE_C] = BIT(DBUF_S3),
[PIPE_D] = BIT(DBUF_S4),
},
},
{
.active_pipes = BIT(PIPE_B) | BIT(PIPE_C) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_B] = BIT(DBUF_S1) | BIT(DBUF_S2),
[PIPE_C] = BIT(DBUF_S3),
[PIPE_D] = BIT(DBUF_S4),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_B) | BIT(PIPE_C) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1),
[PIPE_B] = BIT(DBUF_S2),
[PIPE_C] = BIT(DBUF_S3),
[PIPE_D] = BIT(DBUF_S4),
},
},
{}
};
static const struct dbuf_slice_conf_entry adlp_allowed_dbufs[] = {
/*
* Keep the join_mbus cases first so check_mbus_joined()
* will prefer them over the !join_mbus cases.
*/
{
.active_pipes = BIT(PIPE_A),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1) | BIT(DBUF_S2) | BIT(DBUF_S3) | BIT(DBUF_S4),
},
.join_mbus = true,
},
{
.active_pipes = BIT(PIPE_B),
.dbuf_mask = {
[PIPE_B] = BIT(DBUF_S1) | BIT(DBUF_S2) | BIT(DBUF_S3) | BIT(DBUF_S4),
},
.join_mbus = true,
},
{
.active_pipes = BIT(PIPE_A),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1) | BIT(DBUF_S2),
},
.join_mbus = false,
},
{
.active_pipes = BIT(PIPE_B),
.dbuf_mask = {
[PIPE_B] = BIT(DBUF_S3) | BIT(DBUF_S4),
},
.join_mbus = false,
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_B),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1) | BIT(DBUF_S2),
[PIPE_B] = BIT(DBUF_S3) | BIT(DBUF_S4),
},
},
{
.active_pipes = BIT(PIPE_C),
.dbuf_mask = {
[PIPE_C] = BIT(DBUF_S3) | BIT(DBUF_S4),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_C),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1) | BIT(DBUF_S2),
[PIPE_C] = BIT(DBUF_S3) | BIT(DBUF_S4),
},
},
{
.active_pipes = BIT(PIPE_B) | BIT(PIPE_C),
.dbuf_mask = {
[PIPE_B] = BIT(DBUF_S3) | BIT(DBUF_S4),
[PIPE_C] = BIT(DBUF_S3) | BIT(DBUF_S4),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_B) | BIT(PIPE_C),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1) | BIT(DBUF_S2),
[PIPE_B] = BIT(DBUF_S3) | BIT(DBUF_S4),
[PIPE_C] = BIT(DBUF_S3) | BIT(DBUF_S4),
},
},
{
.active_pipes = BIT(PIPE_D),
.dbuf_mask = {
[PIPE_D] = BIT(DBUF_S1) | BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1) | BIT(DBUF_S2),
[PIPE_D] = BIT(DBUF_S1) | BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_B) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_B] = BIT(DBUF_S3) | BIT(DBUF_S4),
[PIPE_D] = BIT(DBUF_S1) | BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_B) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1) | BIT(DBUF_S2),
[PIPE_B] = BIT(DBUF_S3) | BIT(DBUF_S4),
[PIPE_D] = BIT(DBUF_S1) | BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_C) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_C] = BIT(DBUF_S3) | BIT(DBUF_S4),
[PIPE_D] = BIT(DBUF_S1) | BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_C) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1) | BIT(DBUF_S2),
[PIPE_C] = BIT(DBUF_S3) | BIT(DBUF_S4),
[PIPE_D] = BIT(DBUF_S1) | BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_B) | BIT(PIPE_C) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_B] = BIT(DBUF_S3) | BIT(DBUF_S4),
[PIPE_C] = BIT(DBUF_S3) | BIT(DBUF_S4),
[PIPE_D] = BIT(DBUF_S1) | BIT(DBUF_S2),
},
},
{
.active_pipes = BIT(PIPE_A) | BIT(PIPE_B) | BIT(PIPE_C) | BIT(PIPE_D),
.dbuf_mask = {
[PIPE_A] = BIT(DBUF_S1) | BIT(DBUF_S2),
[PIPE_B] = BIT(DBUF_S3) | BIT(DBUF_S4),
[PIPE_C] = BIT(DBUF_S3) | BIT(DBUF_S4),
[PIPE_D] = BIT(DBUF_S1) | BIT(DBUF_S2),
},
},
{}
};
static bool check_mbus_joined(u8 active_pipes,
const struct dbuf_slice_conf_entry *dbuf_slices)
{
int i;
for (i = 0; dbuf_slices[i].active_pipes != 0; i++) {
if (dbuf_slices[i].active_pipes == active_pipes)
return dbuf_slices[i].join_mbus;
}
return false;
}
static bool adlp_check_mbus_joined(u8 active_pipes)
{
return check_mbus_joined(active_pipes, adlp_allowed_dbufs);
}
static u8 compute_dbuf_slices(enum pipe pipe, u8 active_pipes, bool join_mbus,
const struct dbuf_slice_conf_entry *dbuf_slices)
{
int i;
for (i = 0; dbuf_slices[i].active_pipes != 0; i++) {
if (dbuf_slices[i].active_pipes == active_pipes &&
dbuf_slices[i].join_mbus == join_mbus)
return dbuf_slices[i].dbuf_mask[pipe];
}
return 0;
}
/*
* This function finds an entry with same enabled pipe configuration and
* returns correspondent DBuf slice mask as stated in BSpec for particular
* platform.
*/
static u8 icl_compute_dbuf_slices(enum pipe pipe, u8 active_pipes, bool join_mbus)
{
/*
* FIXME: For ICL this is still a bit unclear as prev BSpec revision
* required calculating "pipe ratio" in order to determine
* if one or two slices can be used for single pipe configurations
* as additional constraint to the existing table.
* However based on recent info, it should be not "pipe ratio"
* but rather ratio between pixel_rate and cdclk with additional
* constants, so for now we are using only table until this is
* clarified. Also this is the reason why crtc_state param is
* still here - we will need it once those additional constraints
* pop up.
*/
return compute_dbuf_slices(pipe, active_pipes, join_mbus,
icl_allowed_dbufs);
}
static u8 tgl_compute_dbuf_slices(enum pipe pipe, u8 active_pipes, bool join_mbus)
{
return compute_dbuf_slices(pipe, active_pipes, join_mbus,
tgl_allowed_dbufs);
}
static u8 adlp_compute_dbuf_slices(enum pipe pipe, u8 active_pipes, bool join_mbus)
{
return compute_dbuf_slices(pipe, active_pipes, join_mbus,
adlp_allowed_dbufs);
}
static u8 dg2_compute_dbuf_slices(enum pipe pipe, u8 active_pipes, bool join_mbus)
{
return compute_dbuf_slices(pipe, active_pipes, join_mbus,
dg2_allowed_dbufs);
}
static u8 skl_compute_dbuf_slices(struct intel_crtc *crtc, u8 active_pipes, bool join_mbus)
{
struct drm_i915_private *i915 = to_i915(crtc->base.dev);
enum pipe pipe = crtc->pipe;
if (IS_DG2(i915))
return dg2_compute_dbuf_slices(pipe, active_pipes, join_mbus);
else if (DISPLAY_VER(i915) >= 13)
return adlp_compute_dbuf_slices(pipe, active_pipes, join_mbus);
else if (DISPLAY_VER(i915) == 12)
return tgl_compute_dbuf_slices(pipe, active_pipes, join_mbus);
else if (DISPLAY_VER(i915) == 11)
return icl_compute_dbuf_slices(pipe, active_pipes, join_mbus);
/*
* For anything else just return one slice yet.
* Should be extended for other platforms.
*/
return active_pipes & BIT(pipe) ? BIT(DBUF_S1) : 0;
}
static bool
use_minimal_wm0_only(const struct intel_crtc_state *crtc_state,
struct intel_plane *plane)
{
struct drm_i915_private *i915 = to_i915(plane->base.dev);
return DISPLAY_VER(i915) >= 13 &&
crtc_state->uapi.async_flip &&
plane->async_flip;
}
static u64
skl_total_relative_data_rate(const struct intel_crtc_state *crtc_state)
{
struct intel_crtc *crtc = to_intel_crtc(crtc_state->uapi.crtc);
struct drm_i915_private *i915 = to_i915(crtc->base.dev);
enum plane_id plane_id;
u64 data_rate = 0;
for_each_plane_id_on_crtc(crtc, plane_id) {
if (plane_id == PLANE_CURSOR)
continue;
data_rate += crtc_state->rel_data_rate[plane_id];
if (DISPLAY_VER(i915) < 11)
data_rate += crtc_state->rel_data_rate_y[plane_id];
}
return data_rate;
}
static const struct skl_wm_level *
skl_plane_wm_level(const struct skl_pipe_wm *pipe_wm,
enum plane_id plane_id,
int level)
{
const struct skl_plane_wm *wm = &pipe_wm->planes[plane_id];
if (level == 0 && pipe_wm->use_sagv_wm)
return &wm->sagv.wm0;
return &wm->wm[level];
}
static const struct skl_wm_level *
skl_plane_trans_wm(const struct skl_pipe_wm *pipe_wm,
enum plane_id plane_id)
{
const struct skl_plane_wm *wm = &pipe_wm->planes[plane_id];
if (pipe_wm->use_sagv_wm)
return &wm->sagv.trans_wm;
return &wm->trans_wm;
}
/*
* We only disable the watermarks for each plane if
* they exceed the ddb allocation of said plane. This
* is done so that we don't end up touching cursor
* watermarks needlessly when some other plane reduces
* our max possible watermark level.
*
* Bspec has this to say about the PLANE_WM enable bit:
* "All the watermarks at this level for all enabled
* planes must be enabled before the level will be used."
* So this is actually safe to do.
*/
static void
skl_check_wm_level(struct skl_wm_level *wm, const struct skl_ddb_entry *ddb)
{
if (wm->min_ddb_alloc > skl_ddb_entry_size(ddb))
memset(wm, 0, sizeof(*wm));
}
static void
skl_check_nv12_wm_level(struct skl_wm_level *wm, struct skl_wm_level *uv_wm,
const struct skl_ddb_entry *ddb_y, const struct skl_ddb_entry *ddb)
{
if (wm->min_ddb_alloc > skl_ddb_entry_size(ddb_y) ||
uv_wm->min_ddb_alloc > skl_ddb_entry_size(ddb)) {
memset(wm, 0, sizeof(*wm));
memset(uv_wm, 0, sizeof(*uv_wm));
}
}
static bool skl_need_wm_copy_wa(struct drm_i915_private *i915, int level,
const struct skl_plane_wm *wm)
{
/*
* Wa_1408961008:icl, ehl
* Wa_14012656716:tgl, adl
* Wa_14017887344:icl
* Wa_14017868169:adl, tgl
* Due to some power saving optimizations, different subsystems
* like PSR, might still use even disabled wm level registers,
* for "reference", so lets keep at least the values sane.
* Considering amount of WA requiring us to do similar things, was
* decided to simply do it for all of the platforms, as those wm
* levels are disabled, this isn't going to do harm anyway.
*/
return level > 0 && !wm->wm[level].enable;
}
struct skl_plane_ddb_iter {
u64 data_rate;
u16 start, size;
};
static void
skl_allocate_plane_ddb(struct skl_plane_ddb_iter *iter,
struct skl_ddb_entry *ddb,
const struct skl_wm_level *wm,
u64 data_rate)
{
u16 size, extra = 0;
if (data_rate) {
extra = min_t(u16, iter->size,
DIV64_U64_ROUND_UP(iter->size * data_rate,
iter->data_rate));
iter->size -= extra;
iter->data_rate -= data_rate;
}
/*
* Keep ddb entry of all disabled planes explicitly zeroed
* to avoid skl_ddb_add_affected_planes() adding them to
* the state when other planes change their allocations.
*/
size = wm->min_ddb_alloc + extra;
if (size)
iter->start = skl_ddb_entry_init(ddb, iter->start,
iter->start + size);
}
static int
skl_crtc_allocate_plane_ddb(struct intel_atomic_state *state,
struct intel_crtc *crtc)
{
struct drm_i915_private *i915 = to_i915(crtc->base.dev);
struct intel_crtc_state *crtc_state =
intel_atomic_get_new_crtc_state(state, crtc);
const struct intel_dbuf_state *dbuf_state =
intel_atomic_get_new_dbuf_state(state);
const struct skl_ddb_entry *alloc = &dbuf_state->ddb[crtc->pipe];
int num_active = hweight8(dbuf_state->active_pipes);
struct skl_plane_ddb_iter iter;
enum plane_id plane_id;
u16 cursor_size;
u32 blocks;
int level;
/* Clear the partitioning for disabled planes. */
memset(crtc_state->wm.skl.plane_ddb, 0, sizeof(crtc_state->wm.skl.plane_ddb));
memset(crtc_state->wm.skl.plane_ddb_y, 0, sizeof(crtc_state->wm.skl.plane_ddb_y));
if (!crtc_state->hw.active)
return 0;
iter.start = alloc->start;
iter.size = skl_ddb_entry_size(alloc);
if (iter.size == 0)
return 0;
/* Allocate fixed number of blocks for cursor. */
cursor_size = skl_cursor_allocation(crtc_state, num_active);
iter.size -= cursor_size;
skl_ddb_entry_init(&crtc_state->wm.skl.plane_ddb[PLANE_CURSOR],
alloc->end - cursor_size, alloc->end);
iter.data_rate = skl_total_relative_data_rate(crtc_state);
/*
* Find the highest watermark level for which we can satisfy the block
* requirement of active planes.
*/
for (level = i915->display.wm.num_levels - 1; level >= 0; level--) {
blocks = 0;
for_each_plane_id_on_crtc(crtc, plane_id) {
const struct skl_plane_wm *wm =
&crtc_state->wm.skl.optimal.planes[plane_id];
if (plane_id == PLANE_CURSOR) {
const struct skl_ddb_entry *ddb =
&crtc_state->wm.skl.plane_ddb[plane_id];
if (wm->wm[level].min_ddb_alloc > skl_ddb_entry_size(ddb)) {
drm_WARN_ON(&i915->drm,
wm->wm[level].min_ddb_alloc != U16_MAX);
blocks = U32_MAX;
break;
}
continue;
}
blocks += wm->wm[level].min_ddb_alloc;
blocks += wm->uv_wm[level].min_ddb_alloc;
}
if (blocks <= iter.size) {
iter.size -= blocks;
break;
}
}
if (level < 0) {
drm_dbg_kms(&i915->drm,
"Requested display configuration exceeds system DDB limitations");
drm_dbg_kms(&i915->drm, "minimum required %d/%d\n",
blocks, iter.size);
return -EINVAL;
}
/* avoid the WARN later when we don't allocate any extra DDB */
if (iter.data_rate == 0)
iter.size = 0;
/*
* Grant each plane the blocks it requires at the highest achievable
* watermark level, plus an extra share of the leftover blocks
* proportional to its relative data rate.
*/
for_each_plane_id_on_crtc(crtc, plane_id) {
struct skl_ddb_entry *ddb =
&crtc_state->wm.skl.plane_ddb[plane_id];
struct skl_ddb_entry *ddb_y =
&crtc_state->wm.skl.plane_ddb_y[plane_id];
const struct skl_plane_wm *wm =
&crtc_state->wm.skl.optimal.planes[plane_id];
if (plane_id == PLANE_CURSOR)
continue;
if (DISPLAY_VER(i915) < 11 &&
crtc_state->nv12_planes & BIT(plane_id)) {
skl_allocate_plane_ddb(&iter, ddb_y, &wm->wm[level],
crtc_state->rel_data_rate_y[plane_id]);
skl_allocate_plane_ddb(&iter, ddb, &wm->uv_wm[level],
crtc_state->rel_data_rate[plane_id]);
} else {
skl_allocate_plane_ddb(&iter, ddb, &wm->wm[level],
crtc_state->rel_data_rate[plane_id]);
}
}
drm_WARN_ON(&i915->drm, iter.size != 0 || iter.data_rate != 0);
/*
* When we calculated watermark values we didn't know how high
* of a level we'd actually be able to hit, so we just marked
* all levels as "enabled." Go back now and disable the ones
* that aren't actually possible.
*/
for (level++; level < i915->display.wm.num_levels; level++) {
for_each_plane_id_on_crtc(crtc, plane_id) {
const struct skl_ddb_entry *ddb =
&crtc_state->wm.skl.plane_ddb[plane_id];
const struct skl_ddb_entry *ddb_y =
&crtc_state->wm.skl.plane_ddb_y[plane_id];
struct skl_plane_wm *wm =
&crtc_state->wm.skl.optimal.planes[plane_id];
if (DISPLAY_VER(i915) < 11 &&
crtc_state->nv12_planes & BIT(plane_id))
skl_check_nv12_wm_level(&wm->wm[level],
&wm->uv_wm[level],
ddb_y, ddb);
else
skl_check_wm_level(&wm->wm[level], ddb);
if (skl_need_wm_copy_wa(i915, level, wm)) {
wm->wm[level].blocks = wm->wm[level - 1].blocks;
wm->wm[level].lines = wm->wm[level - 1].lines;
wm->wm[level].ignore_lines = wm->wm[level - 1].ignore_lines;
}
}
}
/*
* Go back and disable the transition and SAGV watermarks
* if it turns out we don't have enough DDB blocks for them.
*/
for_each_plane_id_on_crtc(crtc, plane_id) {
const struct skl_ddb_entry *ddb =
&crtc_state->wm.skl.plane_ddb[plane_id];
const struct skl_ddb_entry *ddb_y =
&crtc_state->wm.skl.plane_ddb_y[plane_id];
struct skl_plane_wm *wm =
&crtc_state->wm.skl.optimal.planes[plane_id];
if (DISPLAY_VER(i915) < 11 &&
crtc_state->nv12_planes & BIT(plane_id)) {
skl_check_wm_level(&wm->trans_wm, ddb_y);
} else {
WARN_ON(skl_ddb_entry_size(ddb_y));
skl_check_wm_level(&wm->trans_wm, ddb);
}
skl_check_wm_level(&wm->sagv.wm0, ddb);
skl_check_wm_level(&wm->sagv.trans_wm, ddb);
}
return 0;
}
/*
* The max latency should be 257 (max the punit can code is 255 and we add 2us
* for the read latency) and cpp should always be <= 8, so that
* should allow pixel_rate up to ~2 GHz which seems sufficient since max
* 2xcdclk is 1350 MHz and the pixel rate should never exceed that.
*/
static uint_fixed_16_16_t
skl_wm_method1(const struct drm_i915_private *i915, u32 pixel_rate,
u8 cpp, u32 latency, u32 dbuf_block_size)
{
u32 wm_intermediate_val;
uint_fixed_16_16_t ret;
if (latency == 0)
return FP_16_16_MAX;
wm_intermediate_val = latency * pixel_rate * cpp;
ret = div_fixed16(wm_intermediate_val, 1000 * dbuf_block_size);
if (DISPLAY_VER(i915) >= 10)
ret = add_fixed16_u32(ret, 1);
return ret;
}
static uint_fixed_16_16_t
skl_wm_method2(u32 pixel_rate, u32 pipe_htotal, u32 latency,
uint_fixed_16_16_t plane_blocks_per_line)
{
u32 wm_intermediate_val;
uint_fixed_16_16_t ret;
if (latency == 0)
return FP_16_16_MAX;
wm_intermediate_val = latency * pixel_rate;
wm_intermediate_val = DIV_ROUND_UP(wm_intermediate_val,
pipe_htotal * 1000);
ret = mul_u32_fixed16(wm_intermediate_val, plane_blocks_per_line);
return ret;
}
static uint_fixed_16_16_t
intel_get_linetime_us(const struct intel_crtc_state *crtc_state)
{
struct drm_i915_private *i915 = to_i915(crtc_state->uapi.crtc->dev);
u32 pixel_rate;
u32 crtc_htotal;
uint_fixed_16_16_t linetime_us;
if (!crtc_state->hw.active)
return u32_to_fixed16(0);
pixel_rate = crtc_state->pixel_rate;
if (drm_WARN_ON(&i915->drm, pixel_rate == 0))
return u32_to_fixed16(0);
crtc_htotal = crtc_state->hw.pipe_mode.crtc_htotal;
linetime_us = div_fixed16(crtc_htotal * 1000, pixel_rate);
return linetime_us;
}
static int
skl_compute_wm_params(const struct intel_crtc_state *crtc_state,
int width, const struct drm_format_info *format,
u64 modifier, unsigned int rotation,
u32 plane_pixel_rate, struct skl_wm_params *wp,
int color_plane)
{
struct intel_crtc *crtc = to_intel_crtc(crtc_state->uapi.crtc);
struct drm_i915_private *i915 = to_i915(crtc->base.dev);
u32 interm_pbpl;
/* only planar format has two planes */
if (color_plane == 1 &&
!intel_format_info_is_yuv_semiplanar(format, modifier)) {
drm_dbg_kms(&i915->drm,
"Non planar format have single plane\n");
return -EINVAL;
}
wp->x_tiled = modifier == I915_FORMAT_MOD_X_TILED;
wp->y_tiled = modifier != I915_FORMAT_MOD_X_TILED &&
intel_fb_is_tiled_modifier(modifier);
wp->rc_surface = intel_fb_is_ccs_modifier(modifier);
wp->is_planar = intel_format_info_is_yuv_semiplanar(format, modifier);
wp->width = width;
if (color_plane == 1 && wp->is_planar)
wp->width /= 2;
wp->cpp = format->cpp[color_plane];
wp->plane_pixel_rate = plane_pixel_rate;
if (DISPLAY_VER(i915) >= 11 &&
modifier == I915_FORMAT_MOD_Yf_TILED && wp->cpp == 1)
wp->dbuf_block_size = 256;
else
wp->dbuf_block_size = 512;
if (drm_rotation_90_or_270(rotation)) {
switch (wp->cpp) {
case 1:
wp->y_min_scanlines = 16;
break;
case 2:
wp->y_min_scanlines = 8;
break;
case 4:
wp->y_min_scanlines = 4;
break;
default:
MISSING_CASE(wp->cpp);
return -EINVAL;
}
} else {
wp->y_min_scanlines = 4;
}
if (skl_needs_memory_bw_wa(i915))
wp->y_min_scanlines *= 2;
wp->plane_bytes_per_line = wp->width * wp->cpp;
if (wp->y_tiled) {
interm_pbpl = DIV_ROUND_UP(wp->plane_bytes_per_line *
wp->y_min_scanlines,
wp->dbuf_block_size);
if (DISPLAY_VER(i915) >= 10)
interm_pbpl++;
wp->plane_blocks_per_line = div_fixed16(interm_pbpl,
wp->y_min_scanlines);
} else {
interm_pbpl = DIV_ROUND_UP(wp->plane_bytes_per_line,
wp->dbuf_block_size);
if (!wp->x_tiled || DISPLAY_VER(i915) >= 10)
interm_pbpl++;
wp->plane_blocks_per_line = u32_to_fixed16(interm_pbpl);
}
wp->y_tile_minimum = mul_u32_fixed16(wp->y_min_scanlines,
wp->plane_blocks_per_line);
wp->linetime_us = fixed16_to_u32_round_up(intel_get_linetime_us(crtc_state));
return 0;
}
static int
skl_compute_plane_wm_params(const struct intel_crtc_state *crtc_state,
const struct intel_plane_state *plane_state,
struct skl_wm_params *wp, int color_plane)
{
const struct drm_framebuffer *fb = plane_state->hw.fb;
int width;
/*
* Src coordinates are already rotated by 270 degrees for
* the 90/270 degree plane rotation cases (to match the
* GTT mapping), hence no need to account for rotation here.
*/
width = drm_rect_width(&plane_state->uapi.src) >> 16;
return skl_compute_wm_params(crtc_state, width,
fb->format, fb->modifier,
plane_state->hw.rotation,
intel_plane_pixel_rate(crtc_state, plane_state),
wp, color_plane);
}
static bool skl_wm_has_lines(struct drm_i915_private *i915, int level)
{
if (DISPLAY_VER(i915) >= 10)
return true;
/* The number of lines are ignored for the level 0 watermark. */
return level > 0;
}
static int skl_wm_max_lines(struct drm_i915_private *i915)
{
if (DISPLAY_VER(i915) >= 13)
return 255;
else
return 31;
}
static void skl_compute_plane_wm(const struct intel_crtc_state *crtc_state,
struct intel_plane *plane,
int level,
unsigned int latency,
const struct skl_wm_params *wp,
const struct skl_wm_level *result_prev,
struct skl_wm_level *result /* out */)
{
struct drm_i915_private *i915 = to_i915(crtc_state->uapi.crtc->dev);
uint_fixed_16_16_t method1, method2;
uint_fixed_16_16_t selected_result;
u32 blocks, lines, min_ddb_alloc = 0;
if (latency == 0 ||
(use_minimal_wm0_only(crtc_state, plane) && level > 0)) {
/* reject it */
result->min_ddb_alloc = U16_MAX;
return;
}
method1 = skl_wm_method1(i915, wp->plane_pixel_rate,
wp->cpp, latency, wp->dbuf_block_size);
method2 = skl_wm_method2(wp->plane_pixel_rate,
crtc_state->hw.pipe_mode.crtc_htotal,
latency,
wp->plane_blocks_per_line);
if (wp->y_tiled) {
selected_result = max_fixed16(method2, wp->y_tile_minimum);
} else {
if ((wp->cpp * crtc_state->hw.pipe_mode.crtc_htotal /
wp->dbuf_block_size < 1) &&
(wp->plane_bytes_per_line / wp->dbuf_block_size < 1)) {
selected_result = method2;
} else if (latency >= wp->linetime_us) {
if (DISPLAY_VER(i915) == 9)
selected_result = min_fixed16(method1, method2);
else
selected_result = method2;
} else {
selected_result = method1;
}
}
blocks = fixed16_to_u32_round_up(selected_result) + 1;
/*
* Lets have blocks at minimum equivalent to plane_blocks_per_line
* as there will be at minimum one line for lines configuration. This
* is a work around for FIFO underruns observed with resolutions like
* 4k 60 Hz in single channel DRAM configurations.
*
* As per the Bspec 49325, if the ddb allocation can hold at least
* one plane_blocks_per_line, we should have selected method2 in
* the above logic. Assuming that modern versions have enough dbuf
* and method2 guarantees blocks equivalent to at least 1 line,
* select the blocks as plane_blocks_per_line.
*
* TODO: Revisit the logic when we have better understanding on DRAM
* channels' impact on the level 0 memory latency and the relevant
* wm calculations.
*/
if (skl_wm_has_lines(i915, level))
blocks = max(blocks,
fixed16_to_u32_round_up(wp->plane_blocks_per_line));
lines = div_round_up_fixed16(selected_result,
wp->plane_blocks_per_line);
if (DISPLAY_VER(i915) == 9) {
/* Display WA #1125: skl,bxt,kbl */
if (level == 0 && wp->rc_surface)
blocks += fixed16_to_u32_round_up(wp->y_tile_minimum);
/* Display WA #1126: skl,bxt,kbl */
if (level >= 1 && level <= 7) {
if (wp->y_tiled) {
blocks += fixed16_to_u32_round_up(wp->y_tile_minimum);
lines += wp->y_min_scanlines;
} else {
blocks++;
}
/*
* Make sure result blocks for higher latency levels are
* at least as high as level below the current level.
* Assumption in DDB algorithm optimization for special
* cases. Also covers Display WA #1125 for RC.
*/
if (result_prev->blocks > blocks)
blocks = result_prev->blocks;
}
}
if (DISPLAY_VER(i915) >= 11) {
if (wp->y_tiled) {
int extra_lines;
if (lines % wp->y_min_scanlines == 0)
extra_lines = wp->y_min_scanlines;
else
extra_lines = wp->y_min_scanlines * 2 -
lines % wp->y_min_scanlines;
min_ddb_alloc = mul_round_up_u32_fixed16(lines + extra_lines,
wp->plane_blocks_per_line);
} else {
min_ddb_alloc = blocks + DIV_ROUND_UP(blocks, 10);
}
}
if (!skl_wm_has_lines(i915, level))
lines = 0;
if (lines > skl_wm_max_lines(i915)) {
/* reject it */
result->min_ddb_alloc = U16_MAX;
return;
}
/*
* If lines is valid, assume we can use this watermark level
* for now. We'll come back and disable it after we calculate the
* DDB allocation if it turns out we don't actually have enough
* blocks to satisfy it.
*/
result->blocks = blocks;
result->lines = lines;
/* Bspec says: value >= plane ddb allocation -> invalid, hence the +1 here */
result->min_ddb_alloc = max(min_ddb_alloc, blocks) + 1;
result->enable = true;
if (DISPLAY_VER(i915) < 12 && i915->display.sagv.block_time_us)
result->can_sagv = latency >= i915->display.sagv.block_time_us;
}
static void
skl_compute_wm_levels(const struct intel_crtc_state *crtc_state,
struct intel_plane *plane,
const struct skl_wm_params *wm_params,
struct skl_wm_level *levels)
{
struct drm_i915_private *i915 = to_i915(crtc_state->uapi.crtc->dev);
struct skl_wm_level *result_prev = &levels[0];
int level;
for (level = 0; level < i915->display.wm.num_levels; level++) {
struct skl_wm_level *result = &levels[level];
unsigned int latency = skl_wm_latency(i915, level, wm_params);
skl_compute_plane_wm(crtc_state, plane, level, latency,
wm_params, result_prev, result);
result_prev = result;
}
}
static void tgl_compute_sagv_wm(const struct intel_crtc_state *crtc_state,
struct intel_plane *plane,
const struct skl_wm_params *wm_params,
struct skl_plane_wm *plane_wm)
{
struct drm_i915_private *i915 = to_i915(crtc_state->uapi.crtc->dev);
struct skl_wm_level *sagv_wm = &plane_wm->sagv.wm0;
struct skl_wm_level *levels = plane_wm->wm;
unsigned int latency = 0;
if (i915->display.sagv.block_time_us)
latency = i915->display.sagv.block_time_us +
skl_wm_latency(i915, 0, wm_params);
skl_compute_plane_wm(crtc_state, plane, 0, latency,
wm_params, &levels[0],
sagv_wm);
}
static void skl_compute_transition_wm(struct drm_i915_private *i915,
struct skl_wm_level *trans_wm,
const struct skl_wm_level *wm0,
const struct skl_wm_params *wp)
{
u16 trans_min, trans_amount, trans_y_tile_min;
u16 wm0_blocks, trans_offset, blocks;
/* Transition WM don't make any sense if ipc is disabled */
if (!skl_watermark_ipc_enabled(i915))
return;
/*
* WaDisableTWM:skl,kbl,cfl,bxt
* Transition WM are not recommended by HW team for GEN9
*/
if (DISPLAY_VER(i915) == 9)
return;
if (DISPLAY_VER(i915) >= 11)
trans_min = 4;
else
trans_min = 14;
/* Display WA #1140: glk,cnl */
if (DISPLAY_VER(i915) == 10)
trans_amount = 0;
else
trans_amount = 10; /* This is configurable amount */
trans_offset = trans_min + trans_amount;
/*
* The spec asks for Selected Result Blocks for wm0 (the real value),
* not Result Blocks (the integer value). Pay attention to the capital
* letters. The value wm_l0->blocks is actually Result Blocks, but
* since Result Blocks is the ceiling of Selected Result Blocks plus 1,
* and since we later will have to get the ceiling of the sum in the
* transition watermarks calculation, we can just pretend Selected
* Result Blocks is Result Blocks minus 1 and it should work for the
* current platforms.
*/
wm0_blocks = wm0->blocks - 1;
if (wp->y_tiled) {
trans_y_tile_min =
(u16)mul_round_up_u32_fixed16(2, wp->y_tile_minimum);
blocks = max(wm0_blocks, trans_y_tile_min) + trans_offset;
} else {
blocks = wm0_blocks + trans_offset;
}
blocks++;
/*
* Just assume we can enable the transition watermark. After
* computing the DDB we'll come back and disable it if that
* assumption turns out to be false.
*/
trans_wm->blocks = blocks;
trans_wm->min_ddb_alloc = max_t(u16, wm0->min_ddb_alloc, blocks + 1);
trans_wm->enable = true;
}
static int skl_build_plane_wm_single(struct intel_crtc_state *crtc_state,
const struct intel_plane_state *plane_state,
struct intel_plane *plane, int color_plane)
{
struct intel_crtc *crtc = to_intel_crtc(crtc_state->uapi.crtc);
struct drm_i915_private *i915 = to_i915(crtc->base.dev);
struct skl_plane_wm *wm = &crtc_state->wm.skl.raw.planes[plane->id];
struct skl_wm_params wm_params;
int ret;
ret = skl_compute_plane_wm_params(crtc_state, plane_state,
&wm_params, color_plane);
if (ret)
return ret;
skl_compute_wm_levels(crtc_state, plane, &wm_params, wm->wm);
skl_compute_transition_wm(i915, &wm->trans_wm,
&wm->wm[0], &wm_params);
if (DISPLAY_VER(i915) >= 12) {
tgl_compute_sagv_wm(crtc_state, plane, &wm_params, wm);
skl_compute_transition_wm(i915, &wm->sagv.trans_wm,
&wm->sagv.wm0, &wm_params);
}
return 0;
}
static int skl_build_plane_wm_uv(struct intel_crtc_state *crtc_state,
const struct intel_plane_state *plane_state,
struct intel_plane *plane)
{
struct skl_plane_wm *wm = &crtc_state->wm.skl.raw.planes[plane->id];
struct skl_wm_params wm_params;
int ret;
wm->is_planar = true;
/* uv plane watermarks must also be validated for NV12/Planar */
ret = skl_compute_plane_wm_params(crtc_state, plane_state,
&wm_params, 1);
if (ret)
return ret;
skl_compute_wm_levels(crtc_state, plane, &wm_params, wm->uv_wm);
return 0;
}
static int skl_build_plane_wm(struct intel_crtc_state *crtc_state,
const struct intel_plane_state *plane_state)
{
struct intel_plane *plane = to_intel_plane(plane_state->uapi.plane);
enum plane_id plane_id = plane->id;
struct skl_plane_wm *wm = &crtc_state->wm.skl.raw.planes[plane_id];
const struct drm_framebuffer *fb = plane_state->hw.fb;
int ret;
memset(wm, 0, sizeof(*wm));
if (!intel_wm_plane_visible(crtc_state, plane_state))
return 0;
ret = skl_build_plane_wm_single(crtc_state, plane_state,
plane, 0);
if (ret)
return ret;
if (fb->format->is_yuv && fb->format->num_planes > 1) {
ret = skl_build_plane_wm_uv(crtc_state, plane_state,
plane);
if (ret)
return ret;
}
return 0;
}
static int icl_build_plane_wm(struct intel_crtc_state *crtc_state,
const struct intel_plane_state *plane_state)
{
struct intel_plane *plane = to_intel_plane(plane_state->uapi.plane);
struct drm_i915_private *i915 = to_i915(plane->base.dev);
enum plane_id plane_id = plane->id;
struct skl_plane_wm *wm = &crtc_state->wm.skl.raw.planes[plane_id];
int ret;
/* Watermarks calculated in master */
if (plane_state->planar_slave)
return 0;
memset(wm, 0, sizeof(*wm));
if (plane_state->planar_linked_plane) {
const struct drm_framebuffer *fb = plane_state->hw.fb;
drm_WARN_ON(&i915->drm,
!intel_wm_plane_visible(crtc_state, plane_state));
drm_WARN_ON(&i915->drm, !fb->format->is_yuv ||
fb->format->num_planes == 1);
ret = skl_build_plane_wm_single(crtc_state, plane_state,
plane_state->planar_linked_plane, 0);
if (ret)
return ret;
ret = skl_build_plane_wm_single(crtc_state, plane_state,
plane, 1);
if (ret)
return ret;
} else if (intel_wm_plane_visible(crtc_state, plane_state)) {
ret = skl_build_plane_wm_single(crtc_state, plane_state,
plane, 0);
if (ret)
return ret;
}
return 0;
}
static bool
skl_is_vblank_too_short(const struct intel_crtc_state *crtc_state,
int wm0_lines, int latency)
{
const struct drm_display_mode *adjusted_mode =
&crtc_state->hw.adjusted_mode;
/* FIXME missing scaler and DSC pre-fill time */
return crtc_state->framestart_delay +
intel_usecs_to_scanlines(adjusted_mode, latency) +
wm0_lines >
adjusted_mode->crtc_vtotal - adjusted_mode->crtc_vblank_start;
}
static int skl_max_wm0_lines(const struct intel_crtc_state *crtc_state)
{
struct intel_crtc *crtc = to_intel_crtc(crtc_state->uapi.crtc);
enum plane_id plane_id;
int wm0_lines = 0;
for_each_plane_id_on_crtc(crtc, plane_id) {
const struct skl_plane_wm *wm = &crtc_state->wm.skl.optimal.planes[plane_id];
/* FIXME what about !skl_wm_has_lines() platforms? */
wm0_lines = max_t(int, wm0_lines, wm->wm[0].lines);
}
return wm0_lines;
}
static int skl_max_wm_level_for_vblank(struct intel_crtc_state *crtc_state,
int wm0_lines)
{
struct intel_crtc *crtc = to_intel_crtc(crtc_state->uapi.crtc);
struct drm_i915_private *i915 = to_i915(crtc->base.dev);
int level;
for (level = i915->display.wm.num_levels - 1; level >= 0; level--) {
int latency;
/* FIXME should we care about the latency w/a's? */
latency = skl_wm_latency(i915, level, NULL);
if (latency == 0)
continue;
/* FIXME is it correct to use 0 latency for wm0 here? */
if (level == 0)
latency = 0;
if (!skl_is_vblank_too_short(crtc_state, wm0_lines, latency))
return level;
}
return -EINVAL;
}
static int skl_wm_check_vblank(struct intel_crtc_state *crtc_state)
{
struct intel_crtc *crtc = to_intel_crtc(crtc_state->uapi.crtc);
struct drm_i915_private *i915 = to_i915(crtc->base.dev);
int wm0_lines, level;
if (!crtc_state->hw.active)
return 0;
wm0_lines = skl_max_wm0_lines(crtc_state);
level = skl_max_wm_level_for_vblank(crtc_state, wm0_lines);
if (level < 0)
return level;
/*
* PSR needs to toggle LATENCY_REPORTING_REMOVED_PIPE_*
* based on whether we're limited by the vblank duration.
*/
crtc_state->wm_level_disabled = level < i915->display.wm.num_levels - 1;
for (level++; level < i915->display.wm.num_levels; level++) {
enum plane_id plane_id;
for_each_plane_id_on_crtc(crtc, plane_id) {
struct skl_plane_wm *wm =
&crtc_state->wm.skl.optimal.planes[plane_id];
/*
* FIXME just clear enable or flag the entire
* thing as bad via min_ddb_alloc=U16_MAX?
*/
wm->wm[level].enable = false;
wm->uv_wm[level].enable = false;
}
}
if (DISPLAY_VER(i915) >= 12 &&
i915->display.sagv.block_time_us &&
skl_is_vblank_too_short(crtc_state, wm0_lines,
i915->display.sagv.block_time_us)) {
enum plane_id plane_id;
for_each_plane_id_on_crtc(crtc, plane_id) {
struct skl_plane_wm *wm =
&crtc_state->wm.skl.optimal.planes[plane_id];
wm->sagv.wm0.enable = false;
wm->sagv.trans_wm.enable = false;
}
}
return 0;
}
static int skl_build_pipe_wm(struct intel_atomic_state *state,
struct intel_crtc *crtc)
{
struct drm_i915_private *i915 = to_i915(crtc->base.dev);
struct intel_crtc_state *crtc_state =
intel_atomic_get_new_crtc_state(state, crtc);
const struct intel_plane_state *plane_state;
struct intel_plane *plane;
int ret, i;
for_each_new_intel_plane_in_state(state, plane, plane_state, i) {
/*
* FIXME should perhaps check {old,new}_plane_crtc->hw.crtc
* instead but we don't populate that correctly for NV12 Y
* planes so for now hack this.
*/
if (plane->pipe != crtc->pipe)
continue;
if (DISPLAY_VER(i915) >= 11)
ret = icl_build_plane_wm(crtc_state, plane_state);
else
ret = skl_build_plane_wm(crtc_state, plane_state);
if (ret)
return ret;
}
crtc_state->wm.skl.optimal = crtc_state->wm.skl.raw;
return skl_wm_check_vblank(crtc_state);
}
static void skl_ddb_entry_write(struct drm_i915_private *i915,
i915_reg_t reg,
const struct skl_ddb_entry *entry)
{
if (entry->end)
intel_de_write_fw(i915, reg,
PLANE_BUF_END(entry->end - 1) |
PLANE_BUF_START(entry->start));
else
intel_de_write_fw(i915, reg, 0);
}
static void skl_write_wm_level(struct drm_i915_private *i915,
i915_reg_t reg,
const struct skl_wm_level *level)
{
u32 val = 0;
if (level->enable)
val |= PLANE_WM_EN;
if (level->ignore_lines)
val |= PLANE_WM_IGNORE_LINES;
val |= REG_FIELD_PREP(PLANE_WM_BLOCKS_MASK, level->blocks);
val |= REG_FIELD_PREP(PLANE_WM_LINES_MASK, level->lines);
intel_de_write_fw(i915, reg, val);
}
void skl_write_plane_wm(struct intel_plane *plane,
const struct intel_crtc_state *crtc_state)
{
struct drm_i915_private *i915 = to_i915(plane->base.dev);
enum plane_id plane_id = plane->id;
enum pipe pipe = plane->pipe;
const struct skl_pipe_wm *pipe_wm = &crtc_state->wm.skl.optimal;
const struct skl_ddb_entry *ddb =
&crtc_state->wm.skl.plane_ddb[plane_id];
const struct skl_ddb_entry *ddb_y =
&crtc_state->wm.skl.plane_ddb_y[plane_id];
int level;
for (level = 0; level < i915->display.wm.num_levels; level++)
skl_write_wm_level(i915, PLANE_WM(pipe, plane_id, level),
skl_plane_wm_level(pipe_wm, plane_id, level));
skl_write_wm_level(i915, PLANE_WM_TRANS(pipe, plane_id),
skl_plane_trans_wm(pipe_wm, plane_id));
if (HAS_HW_SAGV_WM(i915)) {
const struct skl_plane_wm *wm = &pipe_wm->planes[plane_id];
skl_write_wm_level(i915, PLANE_WM_SAGV(pipe, plane_id),
&wm->sagv.wm0);
skl_write_wm_level(i915, PLANE_WM_SAGV_TRANS(pipe, plane_id),
&wm->sagv.trans_wm);
}
skl_ddb_entry_write(i915,
PLANE_BUF_CFG(pipe, plane_id), ddb);
if (DISPLAY_VER(i915) < 11)
skl_ddb_entry_write(i915,
PLANE_NV12_BUF_CFG(pipe, plane_id), ddb_y);
}
void skl_write_cursor_wm(struct intel_plane *plane,
const struct intel_crtc_state *crtc_state)
{
struct drm_i915_private *i915 = to_i915(plane->base.dev);
enum plane_id plane_id = plane->id;
enum pipe pipe = plane->pipe;
const struct skl_pipe_wm *pipe_wm = &crtc_state->wm.skl.optimal;
const struct skl_ddb_entry *ddb =
&crtc_state->wm.skl.plane_ddb[plane_id];
int level;
for (level = 0; level < i915->display.wm.num_levels; level++)
skl_write_wm_level(i915, CUR_WM(pipe, level),
skl_plane_wm_level(pipe_wm, plane_id, level));
skl_write_wm_level(i915, CUR_WM_TRANS(pipe),
skl_plane_trans_wm(pipe_wm, plane_id));
if (HAS_HW_SAGV_WM(i915)) {
const struct skl_plane_wm *wm = &pipe_wm->planes[plane_id];
skl_write_wm_level(i915, CUR_WM_SAGV(pipe),
&wm->sagv.wm0);
skl_write_wm_level(i915, CUR_WM_SAGV_TRANS(pipe),
&wm->sagv.trans_wm);
}
skl_ddb_entry_write(i915, CUR_BUF_CFG(pipe), ddb);
}
static bool skl_wm_level_equals(const struct skl_wm_level *l1,
const struct skl_wm_level *l2)
{
return l1->enable == l2->enable &&
l1->ignore_lines == l2->ignore_lines &&
l1->lines == l2->lines &&
l1->blocks == l2->blocks;
}
static bool skl_plane_wm_equals(struct drm_i915_private *i915,
const struct skl_plane_wm *wm1,
const struct skl_plane_wm *wm2)
{
int level;
for (level = 0; level < i915->display.wm.num_levels; level++) {
/*
* We don't check uv_wm as the hardware doesn't actually
* use it. It only gets used for calculating the required
* ddb allocation.
*/
if (!skl_wm_level_equals(&wm1->wm[level], &wm2->wm[level]))
return false;
}
return skl_wm_level_equals(&wm1->trans_wm, &wm2->trans_wm) &&
skl_wm_level_equals(&wm1->sagv.wm0, &wm2->sagv.wm0) &&
skl_wm_level_equals(&wm1->sagv.trans_wm, &wm2->sagv.trans_wm);
}
static bool skl_ddb_entries_overlap(const struct skl_ddb_entry *a,
const struct skl_ddb_entry *b)
{
return a->start < b->end && b->start < a->end;
}
static void skl_ddb_entry_union(struct skl_ddb_entry *a,
const struct skl_ddb_entry *b)
{
if (a->end && b->end) {
a->start = min(a->start, b->start);
a->end = max(a->end, b->end);
} else if (b->end) {
a->start = b->start;
a->end = b->end;
}
}
bool skl_ddb_allocation_overlaps(const struct skl_ddb_entry *ddb,
const struct skl_ddb_entry *entries,
int num_entries, int ignore_idx)
{
int i;
for (i = 0; i < num_entries; i++) {
if (i != ignore_idx &&
skl_ddb_entries_overlap(ddb, &entries[i]))
return true;
}
return false;
}
static int
skl_ddb_add_affected_planes(const struct intel_crtc_state *old_crtc_state,
struct intel_crtc_state *new_crtc_state)
{
struct intel_atomic_state *state = to_intel_atomic_state(new_crtc_state->uapi.state);
struct intel_crtc *crtc = to_intel_crtc(new_crtc_state->uapi.crtc);
struct drm_i915_private *i915 = to_i915(crtc->base.dev);
struct intel_plane *plane;
for_each_intel_plane_on_crtc(&i915->drm, crtc, plane) {
struct intel_plane_state *plane_state;
enum plane_id plane_id = plane->id;
if (skl_ddb_entry_equal(&old_crtc_state->wm.skl.plane_ddb[plane_id],
&new_crtc_state->wm.skl.plane_ddb[plane_id]) &&
skl_ddb_entry_equal(&old_crtc_state->wm.skl.plane_ddb_y[plane_id],
&new_crtc_state->wm.skl.plane_ddb_y[plane_id]))
continue;
plane_state = intel_atomic_get_plane_state(state, plane);
if (IS_ERR(plane_state))
return PTR_ERR(plane_state);
new_crtc_state->update_planes |= BIT(plane_id);
new_crtc_state->async_flip_planes = 0;
new_crtc_state->do_async_flip = false;
}
return 0;
}
static u8 intel_dbuf_enabled_slices(const struct intel_dbuf_state *dbuf_state)
{
struct drm_i915_private *i915 = to_i915(dbuf_state->base.state->base.dev);
u8 enabled_slices;
enum pipe pipe;
/*
* FIXME: For now we always enable slice S1 as per
* the Bspec display initialization sequence.
*/
enabled_slices = BIT(DBUF_S1);
for_each_pipe(i915, pipe)
enabled_slices |= dbuf_state->slices[pipe];
return enabled_slices;
}
static int
skl_compute_ddb(struct intel_atomic_state *state)
{
struct drm_i915_private *i915 = to_i915(state->base.dev);
const struct intel_dbuf_state *old_dbuf_state;
struct intel_dbuf_state *new_dbuf_state = NULL;
const struct intel_crtc_state *old_crtc_state;
struct intel_crtc_state *new_crtc_state;
struct intel_crtc *crtc;
int ret, i;
for_each_new_intel_crtc_in_state(state, crtc, new_crtc_state, i) {
new_dbuf_state = intel_atomic_get_dbuf_state(state);
if (IS_ERR(new_dbuf_state))
return PTR_ERR(new_dbuf_state);
old_dbuf_state = intel_atomic_get_old_dbuf_state(state);
break;
}
if (!new_dbuf_state)
return 0;
new_dbuf_state->active_pipes =
intel_calc_active_pipes(state, old_dbuf_state->active_pipes);
if (old_dbuf_state->active_pipes != new_dbuf_state->active_pipes) {
ret = intel_atomic_lock_global_state(&new_dbuf_state->base);
if (ret)
return ret;
}
if (HAS_MBUS_JOINING(i915))
new_dbuf_state->joined_mbus =
adlp_check_mbus_joined(new_dbuf_state->active_pipes);
for_each_intel_crtc(&i915->drm, crtc) {
enum pipe pipe = crtc->pipe;
new_dbuf_state->slices[pipe] =
skl_compute_dbuf_slices(crtc, new_dbuf_state->active_pipes,
new_dbuf_state->joined_mbus);
if (old_dbuf_state->slices[pipe] == new_dbuf_state->slices[pipe])
continue;
ret = intel_atomic_lock_global_state(&new_dbuf_state->base);
if (ret)
return ret;
}
new_dbuf_state->enabled_slices = intel_dbuf_enabled_slices(new_dbuf_state);
if (old_dbuf_state->enabled_slices != new_dbuf_state->enabled_slices ||
old_dbuf_state->joined_mbus != new_dbuf_state->joined_mbus) {
ret = intel_atomic_serialize_global_state(&new_dbuf_state->base);
if (ret)
return ret;
if (old_dbuf_state->joined_mbus != new_dbuf_state->joined_mbus) {
/* TODO: Implement vblank synchronized MBUS joining changes */
ret = intel_modeset_all_pipes(state, "MBUS joining change");
if (ret)
return ret;
}
drm_dbg_kms(&i915->drm,
"Enabled dbuf slices 0x%x -> 0x%x (total dbuf slices 0x%x), mbus joined? %s->%s\n",
old_dbuf_state->enabled_slices,
new_dbuf_state->enabled_slices,
DISPLAY_INFO(i915)->dbuf.slice_mask,
str_yes_no(old_dbuf_state->joined_mbus),
str_yes_no(new_dbuf_state->joined_mbus));
}
for_each_new_intel_crtc_in_state(state, crtc, new_crtc_state, i) {
enum pipe pipe = crtc->pipe;
new_dbuf_state->weight[pipe] = intel_crtc_ddb_weight(new_crtc_state);
if (old_dbuf_state->weight[pipe] == new_dbuf_state->weight[pipe])
continue;
ret = intel_atomic_lock_global_state(&new_dbuf_state->base);
if (ret)
return ret;
}
for_each_intel_crtc(&i915->drm, crtc) {
ret = skl_crtc_allocate_ddb(state, crtc);
if (ret)
return ret;
}
for_each_oldnew_intel_crtc_in_state(state, crtc, old_crtc_state,
new_crtc_state, i) {
ret = skl_crtc_allocate_plane_ddb(state, crtc);
if (ret)
return ret;
ret = skl_ddb_add_affected_planes(old_crtc_state,
new_crtc_state);
if (ret)
return ret;
}
return 0;
}
static char enast(bool enable)
{
return enable ? '*' : ' ';
}
static void
skl_print_wm_changes(struct intel_atomic_state *state)
{
struct drm_i915_private *i915 = to_i915(state->base.dev);
const struct intel_crtc_state *old_crtc_state;
const struct intel_crtc_state *new_crtc_state;
struct intel_plane *plane;
struct intel_crtc *crtc;
int i;
if (!drm_debug_enabled(DRM_UT_KMS))
return;
for_each_oldnew_intel_crtc_in_state(state, crtc, old_crtc_state,
new_crtc_state, i) {
const struct skl_pipe_wm *old_pipe_wm, *new_pipe_wm;
old_pipe_wm = &old_crtc_state->wm.skl.optimal;
new_pipe_wm = &new_crtc_state->wm.skl.optimal;
for_each_intel_plane_on_crtc(&i915->drm, crtc, plane) {
enum plane_id plane_id = plane->id;
const struct skl_ddb_entry *old, *new;
old = &old_crtc_state->wm.skl.plane_ddb[plane_id];
new = &new_crtc_state->wm.skl.plane_ddb[plane_id];
if (skl_ddb_entry_equal(old, new))
continue;
drm_dbg_kms(&i915->drm,
"[PLANE:%d:%s] ddb (%4d - %4d) -> (%4d - %4d), size %4d -> %4d\n",
plane->base.base.id, plane->base.name,
old->start, old->end, new->start, new->end,
skl_ddb_entry_size(old), skl_ddb_entry_size(new));
}
for_each_intel_plane_on_crtc(&i915->drm, crtc, plane) {
enum plane_id plane_id = plane->id;
const struct skl_plane_wm *old_wm, *new_wm;
old_wm = &old_pipe_wm->planes[plane_id];
new_wm = &new_pipe_wm->planes[plane_id];
if (skl_plane_wm_equals(i915, old_wm, new_wm))
continue;
drm_dbg_kms(&i915->drm,
"[PLANE:%d:%s] level %cwm0,%cwm1,%cwm2,%cwm3,%cwm4,%cwm5,%cwm6,%cwm7,%ctwm,%cswm,%cstwm"
" -> %cwm0,%cwm1,%cwm2,%cwm3,%cwm4,%cwm5,%cwm6,%cwm7,%ctwm,%cswm,%cstwm\n",
plane->base.base.id, plane->base.name,
enast(old_wm->wm[0].enable), enast(old_wm->wm[1].enable),
enast(old_wm->wm[2].enable), enast(old_wm->wm[3].enable),
enast(old_wm->wm[4].enable), enast(old_wm->wm[5].enable),
enast(old_wm->wm[6].enable), enast(old_wm->wm[7].enable),
enast(old_wm->trans_wm.enable),
enast(old_wm->sagv.wm0.enable),
enast(old_wm->sagv.trans_wm.enable),
enast(new_wm->wm[0].enable), enast(new_wm->wm[1].enable),
enast(new_wm->wm[2].enable), enast(new_wm->wm[3].enable),
enast(new_wm->wm[4].enable), enast(new_wm->wm[5].enable),
enast(new_wm->wm[6].enable), enast(new_wm->wm[7].enable),
enast(new_wm->trans_wm.enable),
enast(new_wm->sagv.wm0.enable),
enast(new_wm->sagv.trans_wm.enable));
drm_dbg_kms(&i915->drm,
"[PLANE:%d:%s] lines %c%3d,%c%3d,%c%3d,%c%3d,%c%3d,%c%3d,%c%3d,%c%3d,%c%3d,%c%3d,%c%4d"
" -> %c%3d,%c%3d,%c%3d,%c%3d,%c%3d,%c%3d,%c%3d,%c%3d,%c%3d,%c%3d,%c%4d\n",
plane->base.base.id, plane->base.name,
enast(old_wm->wm[0].ignore_lines), old_wm->wm[0].lines,
enast(old_wm->wm[1].ignore_lines), old_wm->wm[1].lines,
enast(old_wm->wm[2].ignore_lines), old_wm->wm[2].lines,
enast(old_wm->wm[3].ignore_lines), old_wm->wm[3].lines,
enast(old_wm->wm[4].ignore_lines), old_wm->wm[4].lines,
enast(old_wm->wm[5].ignore_lines), old_wm->wm[5].lines,
enast(old_wm->wm[6].ignore_lines), old_wm->wm[6].lines,
enast(old_wm->wm[7].ignore_lines), old_wm->wm[7].lines,
enast(old_wm->trans_wm.ignore_lines), old_wm->trans_wm.lines,
enast(old_wm->sagv.wm0.ignore_lines), old_wm->sagv.wm0.lines,
enast(old_wm->sagv.trans_wm.ignore_lines), old_wm->sagv.trans_wm.lines,
enast(new_wm->wm[0].ignore_lines), new_wm->wm[0].lines,
enast(new_wm->wm[1].ignore_lines), new_wm->wm[1].lines,
enast(new_wm->wm[2].ignore_lines), new_wm->wm[2].lines,
enast(new_wm->wm[3].ignore_lines), new_wm->wm[3].lines,
enast(new_wm->wm[4].ignore_lines), new_wm->wm[4].lines,
enast(new_wm->wm[5].ignore_lines), new_wm->wm[5].lines,
enast(new_wm->wm[6].ignore_lines), new_wm->wm[6].lines,
enast(new_wm->wm[7].ignore_lines), new_wm->wm[7].lines,
enast(new_wm->trans_wm.ignore_lines), new_wm->trans_wm.lines,
enast(new_wm->sagv.wm0.ignore_lines), new_wm->sagv.wm0.lines,
enast(new_wm->sagv.trans_wm.ignore_lines), new_wm->sagv.trans_wm.lines);
drm_dbg_kms(&i915->drm,
"[PLANE:%d:%s] blocks %4d,%4d,%4d,%4d,%4d,%4d,%4d,%4d,%4d,%4d,%5d"
" -> %4d,%4d,%4d,%4d,%4d,%4d,%4d,%4d,%4d,%4d,%5d\n",
plane->base.base.id, plane->base.name,
old_wm->wm[0].blocks, old_wm->wm[1].blocks,
old_wm->wm[2].blocks, old_wm->wm[3].blocks,
old_wm->wm[4].blocks, old_wm->wm[5].blocks,
old_wm->wm[6].blocks, old_wm->wm[7].blocks,
old_wm->trans_wm.blocks,
old_wm->sagv.wm0.blocks,
old_wm->sagv.trans_wm.blocks,
new_wm->wm[0].blocks, new_wm->wm[1].blocks,
new_wm->wm[2].blocks, new_wm->wm[3].blocks,
new_wm->wm[4].blocks, new_wm->wm[5].blocks,
new_wm->wm[6].blocks, new_wm->wm[7].blocks,
new_wm->trans_wm.blocks,
new_wm->sagv.wm0.blocks,
new_wm->sagv.trans_wm.blocks);
drm_dbg_kms(&i915->drm,
"[PLANE:%d:%s] min_ddb %4d,%4d,%4d,%4d,%4d,%4d,%4d,%4d,%4d,%4d,%5d"
" -> %4d,%4d,%4d,%4d,%4d,%4d,%4d,%4d,%4d,%4d,%5d\n",
plane->base.base.id, plane->base.name,
old_wm->wm[0].min_ddb_alloc, old_wm->wm[1].min_ddb_alloc,
old_wm->wm[2].min_ddb_alloc, old_wm->wm[3].min_ddb_alloc,
old_wm->wm[4].min_ddb_alloc, old_wm->wm[5].min_ddb_alloc,
old_wm->wm[6].min_ddb_alloc, old_wm->wm[7].min_ddb_alloc,
old_wm->trans_wm.min_ddb_alloc,
old_wm->sagv.wm0.min_ddb_alloc,
old_wm->sagv.trans_wm.min_ddb_alloc,
new_wm->wm[0].min_ddb_alloc, new_wm->wm[1].min_ddb_alloc,
new_wm->wm[2].min_ddb_alloc, new_wm->wm[3].min_ddb_alloc,
new_wm->wm[4].min_ddb_alloc, new_wm->wm[5].min_ddb_alloc,
new_wm->wm[6].min_ddb_alloc, new_wm->wm[7].min_ddb_alloc,
new_wm->trans_wm.min_ddb_alloc,
new_wm->sagv.wm0.min_ddb_alloc,
new_wm->sagv.trans_wm.min_ddb_alloc);
}
}
}
static bool skl_plane_selected_wm_equals(struct intel_plane *plane,
const struct skl_pipe_wm *old_pipe_wm,
const struct skl_pipe_wm *new_pipe_wm)
{
struct drm_i915_private *i915 = to_i915(plane->base.dev);
int level;
for (level = 0; level < i915->display.wm.num_levels; level++) {
/*
* We don't check uv_wm as the hardware doesn't actually
* use it. It only gets used for calculating the required
* ddb allocation.
*/
if (!skl_wm_level_equals(skl_plane_wm_level(old_pipe_wm, plane->id, level),
skl_plane_wm_level(new_pipe_wm, plane->id, level)))
return false;
}
if (HAS_HW_SAGV_WM(i915)) {
const struct skl_plane_wm *old_wm = &old_pipe_wm->planes[plane->id];
const struct skl_plane_wm *new_wm = &new_pipe_wm->planes[plane->id];
if (!skl_wm_level_equals(&old_wm->sagv.wm0, &new_wm->sagv.wm0) ||
!skl_wm_level_equals(&old_wm->sagv.trans_wm, &new_wm->sagv.trans_wm))
return false;
}
return skl_wm_level_equals(skl_plane_trans_wm(old_pipe_wm, plane->id),
skl_plane_trans_wm(new_pipe_wm, plane->id));
}
/*
* To make sure the cursor watermark registers are always consistent
* with our computed state the following scenario needs special
* treatment:
*
* 1. enable cursor
* 2. move cursor entirely offscreen
* 3. disable cursor
*
* Step 2. does call .disable_plane() but does not zero the watermarks
* (since we consider an offscreen cursor still active for the purposes
* of watermarks). Step 3. would not normally call .disable_plane()
* because the actual plane visibility isn't changing, and we don't
* deallocate the cursor ddb until the pipe gets disabled. So we must
* force step 3. to call .disable_plane() to update the watermark
* registers properly.
*
* Other planes do not suffer from this issues as their watermarks are
* calculated based on the actual plane visibility. The only time this
* can trigger for the other planes is during the initial readout as the
* default value of the watermarks registers is not zero.
*/
static int skl_wm_add_affected_planes(struct intel_atomic_state *state,
struct intel_crtc *crtc)
{
struct drm_i915_private *i915 = to_i915(crtc->base.dev);
const struct intel_crtc_state *old_crtc_state =
intel_atomic_get_old_crtc_state(state, crtc);
struct intel_crtc_state *new_crtc_state =
intel_atomic_get_new_crtc_state(state, crtc);
struct intel_plane *plane;
for_each_intel_plane_on_crtc(&i915->drm, crtc, plane) {
struct intel_plane_state *plane_state;
enum plane_id plane_id = plane->id;
/*
* Force a full wm update for every plane on modeset.
* Required because the reset value of the wm registers
* is non-zero, whereas we want all disabled planes to
* have zero watermarks. So if we turn off the relevant
* power well the hardware state will go out of sync
* with the software state.
*/
if (!intel_crtc_needs_modeset(new_crtc_state) &&
skl_plane_selected_wm_equals(plane,
&old_crtc_state->wm.skl.optimal,
&new_crtc_state->wm.skl.optimal))
continue;
plane_state = intel_atomic_get_plane_state(state, plane);
if (IS_ERR(plane_state))
return PTR_ERR(plane_state);
new_crtc_state->update_planes |= BIT(plane_id);
new_crtc_state->async_flip_planes = 0;
new_crtc_state->do_async_flip = false;
}
return 0;
}
static int
skl_compute_wm(struct intel_atomic_state *state)
{
struct intel_crtc *crtc;
struct intel_crtc_state __maybe_unused *new_crtc_state;
int ret, i;
for_each_new_intel_crtc_in_state(state, crtc, new_crtc_state, i) {
ret = skl_build_pipe_wm(state, crtc);
if (ret)
return ret;
}
ret = skl_compute_ddb(state);
if (ret)
return ret;
ret = intel_compute_sagv_mask(state);
if (ret)
return ret;
/*
* skl_compute_ddb() will have adjusted the final watermarks
* based on how much ddb is available. Now we can actually
* check if the final watermarks changed.
*/
for_each_new_intel_crtc_in_state(state, crtc, new_crtc_state, i) {
ret = skl_wm_add_affected_planes(state, crtc);
if (ret)
return ret;
}
skl_print_wm_changes(state);
return 0;
}
static void skl_wm_level_from_reg_val(u32 val, struct skl_wm_level *level)
{
level->enable = val & PLANE_WM_EN;
level->ignore_lines = val & PLANE_WM_IGNORE_LINES;
level->blocks = REG_FIELD_GET(PLANE_WM_BLOCKS_MASK, val);
level->lines = REG_FIELD_GET(PLANE_WM_LINES_MASK, val);
}
static void skl_pipe_wm_get_hw_state(struct intel_crtc *crtc,
struct skl_pipe_wm *out)
{
struct drm_i915_private *i915 = to_i915(crtc->base.dev);
enum pipe pipe = crtc->pipe;
enum plane_id plane_id;
int level;
u32 val;
for_each_plane_id_on_crtc(crtc, plane_id) {
struct skl_plane_wm *wm = &out->planes[plane_id];
for (level = 0; level < i915->display.wm.num_levels; level++) {
if (plane_id != PLANE_CURSOR)
val = intel_de_read(i915, PLANE_WM(pipe, plane_id, level));
else
val = intel_de_read(i915, CUR_WM(pipe, level));
skl_wm_level_from_reg_val(val, &wm->wm[level]);
}
if (plane_id != PLANE_CURSOR)
val = intel_de_read(i915, PLANE_WM_TRANS(pipe, plane_id));
else
val = intel_de_read(i915, CUR_WM_TRANS(pipe));
skl_wm_level_from_reg_val(val, &wm->trans_wm);
if (HAS_HW_SAGV_WM(i915)) {
if (plane_id != PLANE_CURSOR)
val = intel_de_read(i915, PLANE_WM_SAGV(pipe, plane_id));
else
val = intel_de_read(i915, CUR_WM_SAGV(pipe));
skl_wm_level_from_reg_val(val, &wm->sagv.wm0);
if (plane_id != PLANE_CURSOR)
val = intel_de_read(i915, PLANE_WM_SAGV_TRANS(pipe, plane_id));
else
val = intel_de_read(i915, CUR_WM_SAGV_TRANS(pipe));
skl_wm_level_from_reg_val(val, &wm->sagv.trans_wm);
} else if (DISPLAY_VER(i915) >= 12) {
wm->sagv.wm0 = wm->wm[0];
wm->sagv.trans_wm = wm->trans_wm;
}
}
}
static void skl_wm_get_hw_state(struct drm_i915_private *i915)
{
struct intel_dbuf_state *dbuf_state =
to_intel_dbuf_state(i915->display.dbuf.obj.state);
struct intel_crtc *crtc;
if (HAS_MBUS_JOINING(i915))
dbuf_state->joined_mbus = intel_de_read(i915, MBUS_CTL) & MBUS_JOIN;
for_each_intel_crtc(&i915->drm, crtc) {
struct intel_crtc_state *crtc_state =
to_intel_crtc_state(crtc->base.state);
enum pipe pipe = crtc->pipe;
unsigned int mbus_offset;
enum plane_id plane_id;
u8 slices;
memset(&crtc_state->wm.skl.optimal, 0,
sizeof(crtc_state->wm.skl.optimal));
if (crtc_state->hw.active)
skl_pipe_wm_get_hw_state(crtc, &crtc_state->wm.skl.optimal);
crtc_state->wm.skl.raw = crtc_state->wm.skl.optimal;
memset(&dbuf_state->ddb[pipe], 0, sizeof(dbuf_state->ddb[pipe]));
for_each_plane_id_on_crtc(crtc, plane_id) {
struct skl_ddb_entry *ddb =
&crtc_state->wm.skl.plane_ddb[plane_id];
struct skl_ddb_entry *ddb_y =
&crtc_state->wm.skl.plane_ddb_y[plane_id];
if (!crtc_state->hw.active)
continue;
skl_ddb_get_hw_plane_state(i915, crtc->pipe,
plane_id, ddb, ddb_y);
skl_ddb_entry_union(&dbuf_state->ddb[pipe], ddb);
skl_ddb_entry_union(&dbuf_state->ddb[pipe], ddb_y);
}
dbuf_state->weight[pipe] = intel_crtc_ddb_weight(crtc_state);
/*
* Used for checking overlaps, so we need absolute
* offsets instead of MBUS relative offsets.
*/
slices = skl_compute_dbuf_slices(crtc, dbuf_state->active_pipes,
dbuf_state->joined_mbus);
mbus_offset = mbus_ddb_offset(i915, slices);
crtc_state->wm.skl.ddb.start = mbus_offset + dbuf_state->ddb[pipe].start;
crtc_state->wm.skl.ddb.end = mbus_offset + dbuf_state->ddb[pipe].end;
/* The slices actually used by the planes on the pipe */
dbuf_state->slices[pipe] =
skl_ddb_dbuf_slice_mask(i915, &crtc_state->wm.skl.ddb);
drm_dbg_kms(&i915->drm,
"[CRTC:%d:%s] dbuf slices 0x%x, ddb (%d - %d), active pipes 0x%x, mbus joined: %s\n",
crtc->base.base.id, crtc->base.name,
dbuf_state->slices[pipe], dbuf_state->ddb[pipe].start,
dbuf_state->ddb[pipe].end, dbuf_state->active_pipes,
str_yes_no(dbuf_state->joined_mbus));
}
dbuf_state->enabled_slices = i915->display.dbuf.enabled_slices;
}
static bool skl_dbuf_is_misconfigured(struct drm_i915_private *i915)
{
const struct intel_dbuf_state *dbuf_state =
to_intel_dbuf_state(i915->display.dbuf.obj.state);
struct skl_ddb_entry entries[I915_MAX_PIPES] = {};
struct intel_crtc *crtc;
for_each_intel_crtc(&i915->drm, crtc) {
const struct intel_crtc_state *crtc_state =
to_intel_crtc_state(crtc->base.state);
entries[crtc->pipe] = crtc_state->wm.skl.ddb;
}
for_each_intel_crtc(&i915->drm, crtc) {
const struct intel_crtc_state *crtc_state =
to_intel_crtc_state(crtc->base.state);
u8 slices;
slices = skl_compute_dbuf_slices(crtc, dbuf_state->active_pipes,
dbuf_state->joined_mbus);
if (dbuf_state->slices[crtc->pipe] & ~slices)
return true;
if (skl_ddb_allocation_overlaps(&crtc_state->wm.skl.ddb, entries,
I915_MAX_PIPES, crtc->pipe))
return true;
}
return false;
}
static void skl_wm_sanitize(struct drm_i915_private *i915)
{
struct intel_crtc *crtc;
/*
* On TGL/RKL (at least) the BIOS likes to assign the planes
* to the wrong DBUF slices. This will cause an infinite loop
* in skl_commit_modeset_enables() as it can't find a way to
* transition between the old bogus DBUF layout to the new
* proper DBUF layout without DBUF allocation overlaps between
* the planes (which cannot be allowed or else the hardware
* may hang). If we detect a bogus DBUF layout just turn off
* all the planes so that skl_commit_modeset_enables() can
* simply ignore them.
*/
if (!skl_dbuf_is_misconfigured(i915))
return;
drm_dbg_kms(&i915->drm, "BIOS has misprogrammed the DBUF, disabling all planes\n");
for_each_intel_crtc(&i915->drm, crtc) {
struct intel_plane *plane = to_intel_plane(crtc->base.primary);
const struct intel_plane_state *plane_state =
to_intel_plane_state(plane->base.state);
struct intel_crtc_state *crtc_state =
to_intel_crtc_state(crtc->base.state);
if (plane_state->uapi.visible)
intel_plane_disable_noatomic(crtc, plane);
drm_WARN_ON(&i915->drm, crtc_state->active_planes != 0);
memset(&crtc_state->wm.skl.ddb, 0, sizeof(crtc_state->wm.skl.ddb));
}
}
static void skl_wm_get_hw_state_and_sanitize(struct drm_i915_private *i915)
{
skl_wm_get_hw_state(i915);
skl_wm_sanitize(i915);
}
void intel_wm_state_verify(struct intel_crtc *crtc,
struct intel_crtc_state *new_crtc_state)
{
struct drm_i915_private *i915 = to_i915(crtc->base.dev);
struct skl_hw_state {
struct skl_ddb_entry ddb[I915_MAX_PLANES];
struct skl_ddb_entry ddb_y[I915_MAX_PLANES];
struct skl_pipe_wm wm;
} *hw;
const struct skl_pipe_wm *sw_wm = &new_crtc_state->wm.skl.optimal;
struct intel_plane *plane;
u8 hw_enabled_slices;
int level;
if (DISPLAY_VER(i915) < 9 || !new_crtc_state->hw.active)
return;
hw = kzalloc(sizeof(*hw), GFP_KERNEL);
if (!hw)
return;
skl_pipe_wm_get_hw_state(crtc, &hw->wm);
skl_pipe_ddb_get_hw_state(crtc, hw->ddb, hw->ddb_y);
hw_enabled_slices = intel_enabled_dbuf_slices_mask(i915);
if (DISPLAY_VER(i915) >= 11 &&
hw_enabled_slices != i915->display.dbuf.enabled_slices)
drm_err(&i915->drm,
"mismatch in DBUF Slices (expected 0x%x, got 0x%x)\n",
i915->display.dbuf.enabled_slices,
hw_enabled_slices);
for_each_intel_plane_on_crtc(&i915->drm, crtc, plane) {
const struct skl_ddb_entry *hw_ddb_entry, *sw_ddb_entry;
const struct skl_wm_level *hw_wm_level, *sw_wm_level;
/* Watermarks */
for (level = 0; level < i915->display.wm.num_levels; level++) {
hw_wm_level = &hw->wm.planes[plane->id].wm[level];
sw_wm_level = skl_plane_wm_level(sw_wm, plane->id, level);
if (skl_wm_level_equals(hw_wm_level, sw_wm_level))
continue;
drm_err(&i915->drm,
"[PLANE:%d:%s] mismatch in WM%d (expected e=%d b=%u l=%u, got e=%d b=%u l=%u)\n",
plane->base.base.id, plane->base.name, level,
sw_wm_level->enable,
sw_wm_level->blocks,
sw_wm_level->lines,
hw_wm_level->enable,
hw_wm_level->blocks,
hw_wm_level->lines);
}
hw_wm_level = &hw->wm.planes[plane->id].trans_wm;
sw_wm_level = skl_plane_trans_wm(sw_wm, plane->id);
if (!skl_wm_level_equals(hw_wm_level, sw_wm_level)) {
drm_err(&i915->drm,
"[PLANE:%d:%s] mismatch in trans WM (expected e=%d b=%u l=%u, got e=%d b=%u l=%u)\n",
plane->base.base.id, plane->base.name,
sw_wm_level->enable,
sw_wm_level->blocks,
sw_wm_level->lines,
hw_wm_level->enable,
hw_wm_level->blocks,
hw_wm_level->lines);
}
hw_wm_level = &hw->wm.planes[plane->id].sagv.wm0;
sw_wm_level = &sw_wm->planes[plane->id].sagv.wm0;
if (HAS_HW_SAGV_WM(i915) &&
!skl_wm_level_equals(hw_wm_level, sw_wm_level)) {
drm_err(&i915->drm,
"[PLANE:%d:%s] mismatch in SAGV WM (expected e=%d b=%u l=%u, got e=%d b=%u l=%u)\n",
plane->base.base.id, plane->base.name,
sw_wm_level->enable,
sw_wm_level->blocks,
sw_wm_level->lines,
hw_wm_level->enable,
hw_wm_level->blocks,
hw_wm_level->lines);
}
hw_wm_level = &hw->wm.planes[plane->id].sagv.trans_wm;
sw_wm_level = &sw_wm->planes[plane->id].sagv.trans_wm;
if (HAS_HW_SAGV_WM(i915) &&
!skl_wm_level_equals(hw_wm_level, sw_wm_level)) {
drm_err(&i915->drm,
"[PLANE:%d:%s] mismatch in SAGV trans WM (expected e=%d b=%u l=%u, got e=%d b=%u l=%u)\n",
plane->base.base.id, plane->base.name,
sw_wm_level->enable,
sw_wm_level->blocks,
sw_wm_level->lines,
hw_wm_level->enable,
hw_wm_level->blocks,
hw_wm_level->lines);
}
/* DDB */
hw_ddb_entry = &hw->ddb[PLANE_CURSOR];
sw_ddb_entry = &new_crtc_state->wm.skl.plane_ddb[PLANE_CURSOR];
if (!skl_ddb_entry_equal(hw_ddb_entry, sw_ddb_entry)) {
drm_err(&i915->drm,
"[PLANE:%d:%s] mismatch in DDB (expected (%u,%u), found (%u,%u))\n",
plane->base.base.id, plane->base.name,
sw_ddb_entry->start, sw_ddb_entry->end,
hw_ddb_entry->start, hw_ddb_entry->end);
}
}
kfree(hw);
}
bool skl_watermark_ipc_enabled(struct drm_i915_private *i915)
{
return i915->display.wm.ipc_enabled;
}
void skl_watermark_ipc_update(struct drm_i915_private *i915)
{
if (!HAS_IPC(i915))
return;
intel_de_rmw(i915, DISP_ARB_CTL2, DISP_IPC_ENABLE,
skl_watermark_ipc_enabled(i915) ? DISP_IPC_ENABLE : 0);
}
static bool skl_watermark_ipc_can_enable(struct drm_i915_private *i915)
{
/* Display WA #0477 WaDisableIPC: skl */
if (IS_SKYLAKE(i915))
return false;
/* Display WA #1141: SKL:all KBL:all CFL */
if (IS_KABYLAKE(i915) ||
IS_COFFEELAKE(i915) ||
IS_COMETLAKE(i915))
return i915->dram_info.symmetric_memory;
return true;
}
void skl_watermark_ipc_init(struct drm_i915_private *i915)
{
if (!HAS_IPC(i915))
return;
i915->display.wm.ipc_enabled = skl_watermark_ipc_can_enable(i915);
skl_watermark_ipc_update(i915);
}
static void
adjust_wm_latency(struct drm_i915_private *i915,
u16 wm[], int num_levels, int read_latency)
{
bool wm_lv_0_adjust_needed = i915->dram_info.wm_lv_0_adjust_needed;
int i, level;
/*
* If a level n (n > 1) has a 0us latency, all levels m (m >= n)
* need to be disabled. We make sure to sanitize the values out
* of the punit to satisfy this requirement.
*/
for (level = 1; level < num_levels; level++) {
if (wm[level] == 0) {
for (i = level + 1; i < num_levels; i++)
wm[i] = 0;
num_levels = level;
break;
}
}
/*
* WaWmMemoryReadLatency
*
* punit doesn't take into account the read latency so we need
* to add proper adjustement to each valid level we retrieve
* from the punit when level 0 response data is 0us.
*/
if (wm[0] == 0) {
for (level = 0; level < num_levels; level++)
wm[level] += read_latency;
}
/*
* WA Level-0 adjustment for 16GB DIMMs: SKL+
* If we could not get dimm info enable this WA to prevent from
* any underrun. If not able to get Dimm info assume 16GB dimm
* to avoid any underrun.
*/
if (wm_lv_0_adjust_needed)
wm[0] += 1;
}
static void mtl_read_wm_latency(struct drm_i915_private *i915, u16 wm[])
{
int num_levels = i915->display.wm.num_levels;
u32 val;
val = intel_de_read(i915, MTL_LATENCY_LP0_LP1);
wm[0] = REG_FIELD_GET(MTL_LATENCY_LEVEL_EVEN_MASK, val);
wm[1] = REG_FIELD_GET(MTL_LATENCY_LEVEL_ODD_MASK, val);
val = intel_de_read(i915, MTL_LATENCY_LP2_LP3);
wm[2] = REG_FIELD_GET(MTL_LATENCY_LEVEL_EVEN_MASK, val);
wm[3] = REG_FIELD_GET(MTL_LATENCY_LEVEL_ODD_MASK, val);
val = intel_de_read(i915, MTL_LATENCY_LP4_LP5);
wm[4] = REG_FIELD_GET(MTL_LATENCY_LEVEL_EVEN_MASK, val);
wm[5] = REG_FIELD_GET(MTL_LATENCY_LEVEL_ODD_MASK, val);
adjust_wm_latency(i915, wm, num_levels, 6);
}
static void skl_read_wm_latency(struct drm_i915_private *i915, u16 wm[])
{
int num_levels = i915->display.wm.num_levels;
int read_latency = DISPLAY_VER(i915) >= 12 ? 3 : 2;
int mult = IS_DG2(i915) ? 2 : 1;
u32 val;
int ret;
/* read the first set of memory latencies[0:3] */
val = 0; /* data0 to be programmed to 0 for first set */
ret = snb_pcode_read(&i915->uncore, GEN9_PCODE_READ_MEM_LATENCY, &val, NULL);
if (ret) {
drm_err(&i915->drm, "SKL Mailbox read error = %d\n", ret);
return;
}
wm[0] = REG_FIELD_GET(GEN9_MEM_LATENCY_LEVEL_0_4_MASK, val) * mult;
wm[1] = REG_FIELD_GET(GEN9_MEM_LATENCY_LEVEL_1_5_MASK, val) * mult;
wm[2] = REG_FIELD_GET(GEN9_MEM_LATENCY_LEVEL_2_6_MASK, val) * mult;
wm[3] = REG_FIELD_GET(GEN9_MEM_LATENCY_LEVEL_3_7_MASK, val) * mult;
/* read the second set of memory latencies[4:7] */
val = 1; /* data0 to be programmed to 1 for second set */
ret = snb_pcode_read(&i915->uncore, GEN9_PCODE_READ_MEM_LATENCY, &val, NULL);
if (ret) {
drm_err(&i915->drm, "SKL Mailbox read error = %d\n", ret);
return;
}
wm[4] = REG_FIELD_GET(GEN9_MEM_LATENCY_LEVEL_0_4_MASK, val) * mult;
wm[5] = REG_FIELD_GET(GEN9_MEM_LATENCY_LEVEL_1_5_MASK, val) * mult;
wm[6] = REG_FIELD_GET(GEN9_MEM_LATENCY_LEVEL_2_6_MASK, val) * mult;
wm[7] = REG_FIELD_GET(GEN9_MEM_LATENCY_LEVEL_3_7_MASK, val) * mult;
adjust_wm_latency(i915, wm, num_levels, read_latency);
}
static void skl_setup_wm_latency(struct drm_i915_private *i915)
{
if (HAS_HW_SAGV_WM(i915))
i915->display.wm.num_levels = 6;
else
i915->display.wm.num_levels = 8;
if (DISPLAY_VER(i915) >= 14)
mtl_read_wm_latency(i915, i915->display.wm.skl_latency);
else
skl_read_wm_latency(i915, i915->display.wm.skl_latency);
intel_print_wm_latency(i915, "Gen9 Plane", i915->display.wm.skl_latency);
}
static const struct intel_wm_funcs skl_wm_funcs = {
.compute_global_watermarks = skl_compute_wm,
.get_hw_state = skl_wm_get_hw_state_and_sanitize,
};
void skl_wm_init(struct drm_i915_private *i915)
{
intel_sagv_init(i915);
skl_setup_wm_latency(i915);
i915->display.funcs.wm = &skl_wm_funcs;
}
static struct intel_global_state *intel_dbuf_duplicate_state(struct intel_global_obj *obj)
{
struct intel_dbuf_state *dbuf_state;
dbuf_state = kmemdup(obj->state, sizeof(*dbuf_state), GFP_KERNEL);
if (!dbuf_state)
return NULL;
return &dbuf_state->base;
}
static void intel_dbuf_destroy_state(struct intel_global_obj *obj,
struct intel_global_state *state)
{
kfree(state);
}
static const struct intel_global_state_funcs intel_dbuf_funcs = {
.atomic_duplicate_state = intel_dbuf_duplicate_state,
.atomic_destroy_state = intel_dbuf_destroy_state,
};
struct intel_dbuf_state *
intel_atomic_get_dbuf_state(struct intel_atomic_state *state)
{
struct drm_i915_private *i915 = to_i915(state->base.dev);
struct intel_global_state *dbuf_state;
dbuf_state = intel_atomic_get_global_obj_state(state, &i915->display.dbuf.obj);
if (IS_ERR(dbuf_state))
return ERR_CAST(dbuf_state);
return to_intel_dbuf_state(dbuf_state);
}
int intel_dbuf_init(struct drm_i915_private *i915)
{
struct intel_dbuf_state *dbuf_state;
dbuf_state = kzalloc(sizeof(*dbuf_state), GFP_KERNEL);
if (!dbuf_state)
return -ENOMEM;
intel_atomic_global_obj_init(i915, &i915->display.dbuf.obj,
&dbuf_state->base, &intel_dbuf_funcs);
return 0;
}
/*
* Configure MBUS_CTL and all DBUF_CTL_S of each slice to join_mbus state before
* update the request state of all DBUS slices.
*/
static void update_mbus_pre_enable(struct intel_atomic_state *state)
{
struct drm_i915_private *i915 = to_i915(state->base.dev);
u32 mbus_ctl, dbuf_min_tracker_val;
enum dbuf_slice slice;
const struct intel_dbuf_state *dbuf_state =
intel_atomic_get_new_dbuf_state(state);
if (!HAS_MBUS_JOINING(i915))
return;
/*
* TODO: Implement vblank synchronized MBUS joining changes.
* Must be properly coordinated with dbuf reprogramming.
*/
if (dbuf_state->joined_mbus) {
mbus_ctl = MBUS_HASHING_MODE_1x4 | MBUS_JOIN |
MBUS_JOIN_PIPE_SELECT_NONE;
dbuf_min_tracker_val = DBUF_MIN_TRACKER_STATE_SERVICE(3);
} else {
mbus_ctl = MBUS_HASHING_MODE_2x2 |
MBUS_JOIN_PIPE_SELECT_NONE;
dbuf_min_tracker_val = DBUF_MIN_TRACKER_STATE_SERVICE(1);
}
intel_de_rmw(i915, MBUS_CTL,
MBUS_HASHING_MODE_MASK | MBUS_JOIN |
MBUS_JOIN_PIPE_SELECT_MASK, mbus_ctl);
for_each_dbuf_slice(i915, slice)
intel_de_rmw(i915, DBUF_CTL_S(slice),
DBUF_MIN_TRACKER_STATE_SERVICE_MASK,
dbuf_min_tracker_val);
}
void intel_dbuf_pre_plane_update(struct intel_atomic_state *state)
{
struct drm_i915_private *i915 = to_i915(state->base.dev);
const struct intel_dbuf_state *new_dbuf_state =
intel_atomic_get_new_dbuf_state(state);
const struct intel_dbuf_state *old_dbuf_state =
intel_atomic_get_old_dbuf_state(state);
if (!new_dbuf_state ||
(new_dbuf_state->enabled_slices == old_dbuf_state->enabled_slices &&
new_dbuf_state->joined_mbus == old_dbuf_state->joined_mbus))
return;
WARN_ON(!new_dbuf_state->base.changed);
update_mbus_pre_enable(state);
gen9_dbuf_slices_update(i915,
old_dbuf_state->enabled_slices |
new_dbuf_state->enabled_slices);
}
void intel_dbuf_post_plane_update(struct intel_atomic_state *state)
{
struct drm_i915_private *i915 = to_i915(state->base.dev);
const struct intel_dbuf_state *new_dbuf_state =
intel_atomic_get_new_dbuf_state(state);
const struct intel_dbuf_state *old_dbuf_state =
intel_atomic_get_old_dbuf_state(state);
if (!new_dbuf_state ||
(new_dbuf_state->enabled_slices == old_dbuf_state->enabled_slices &&
new_dbuf_state->joined_mbus == old_dbuf_state->joined_mbus))
return;
WARN_ON(!new_dbuf_state->base.changed);
gen9_dbuf_slices_update(i915,
new_dbuf_state->enabled_slices);
}
static bool xelpdp_is_only_pipe_per_dbuf_bank(enum pipe pipe, u8 active_pipes)
{
switch (pipe) {
case PIPE_A:
return !(active_pipes & BIT(PIPE_D));
case PIPE_D:
return !(active_pipes & BIT(PIPE_A));
case PIPE_B:
return !(active_pipes & BIT(PIPE_C));
case PIPE_C:
return !(active_pipes & BIT(PIPE_B));
default: /* to suppress compiler warning */
MISSING_CASE(pipe);
break;
}
return false;
}
void intel_mbus_dbox_update(struct intel_atomic_state *state)
{
struct drm_i915_private *i915 = to_i915(state->base.dev);
const struct intel_dbuf_state *new_dbuf_state, *old_dbuf_state;
const struct intel_crtc_state *new_crtc_state;
const struct intel_crtc *crtc;
u32 val = 0;
int i;
if (DISPLAY_VER(i915) < 11)
return;
new_dbuf_state = intel_atomic_get_new_dbuf_state(state);
old_dbuf_state = intel_atomic_get_old_dbuf_state(state);
if (!new_dbuf_state ||
(new_dbuf_state->joined_mbus == old_dbuf_state->joined_mbus &&
new_dbuf_state->active_pipes == old_dbuf_state->active_pipes))
return;
if (DISPLAY_VER(i915) >= 14)
val |= MBUS_DBOX_I_CREDIT(2);
if (DISPLAY_VER(i915) >= 12) {
val |= MBUS_DBOX_B2B_TRANSACTIONS_MAX(16);
val |= MBUS_DBOX_B2B_TRANSACTIONS_DELAY(1);
val |= MBUS_DBOX_REGULATE_B2B_TRANSACTIONS_EN;
}
if (DISPLAY_VER(i915) >= 14)
val |= new_dbuf_state->joined_mbus ? MBUS_DBOX_A_CREDIT(12) :
MBUS_DBOX_A_CREDIT(8);
else if (IS_ALDERLAKE_P(i915))
/* Wa_22010947358:adl-p */
val |= new_dbuf_state->joined_mbus ? MBUS_DBOX_A_CREDIT(6) :
MBUS_DBOX_A_CREDIT(4);
else
val |= MBUS_DBOX_A_CREDIT(2);
if (DISPLAY_VER(i915) >= 14) {
val |= MBUS_DBOX_B_CREDIT(0xA);
} else if (IS_ALDERLAKE_P(i915)) {
val |= MBUS_DBOX_BW_CREDIT(2);
val |= MBUS_DBOX_B_CREDIT(8);
} else if (DISPLAY_VER(i915) >= 12) {
val |= MBUS_DBOX_BW_CREDIT(2);
val |= MBUS_DBOX_B_CREDIT(12);
} else {
val |= MBUS_DBOX_BW_CREDIT(1);
val |= MBUS_DBOX_B_CREDIT(8);
}
for_each_new_intel_crtc_in_state(state, crtc, new_crtc_state, i) {
u32 pipe_val = val;
if (!new_crtc_state->hw.active)
continue;
if (DISPLAY_VER(i915) >= 14) {
if (xelpdp_is_only_pipe_per_dbuf_bank(crtc->pipe,
new_dbuf_state->active_pipes))
pipe_val |= MBUS_DBOX_BW_8CREDITS_MTL;
else
pipe_val |= MBUS_DBOX_BW_4CREDITS_MTL;
}
intel_de_write(i915, PIPE_MBUS_DBOX_CTL(crtc->pipe), pipe_val);
}
}
#ifdef notyet
static int skl_watermark_ipc_status_show(struct seq_file *m, void *data)
{
struct drm_i915_private *i915 = m->private;
seq_printf(m, "Isochronous Priority Control: %s\n",
str_yes_no(skl_watermark_ipc_enabled(i915)));
return 0;
}
static int skl_watermark_ipc_status_open(struct inode *inode, struct file *file)
{
struct drm_i915_private *i915 = inode->i_private;
return single_open(file, skl_watermark_ipc_status_show, i915);
}
static ssize_t skl_watermark_ipc_status_write(struct file *file,
const char __user *ubuf,
size_t len, loff_t *offp)
{
struct seq_file *m = file->private_data;
struct drm_i915_private *i915 = m->private;
intel_wakeref_t wakeref;
bool enable;
int ret;
ret = kstrtobool_from_user(ubuf, len, &enable);
if (ret < 0)
return ret;
with_intel_runtime_pm(&i915->runtime_pm, wakeref) {
if (!skl_watermark_ipc_enabled(i915) && enable)
drm_info(&i915->drm,
"Enabling IPC: WM will be proper only after next commit\n");
i915->display.wm.ipc_enabled = enable;
skl_watermark_ipc_update(i915);
}
return len;
}
static const struct file_operations skl_watermark_ipc_status_fops = {
.owner = THIS_MODULE,
.open = skl_watermark_ipc_status_open,
.read = seq_read,
.llseek = seq_lseek,
.release = single_release,
.write = skl_watermark_ipc_status_write
};
#endif /* notyet */
static int intel_sagv_status_show(struct seq_file *m, void *unused)
{
struct drm_i915_private *i915 = m->private;
static const char * const sagv_status[] = {
[I915_SAGV_UNKNOWN] = "unknown",
[I915_SAGV_DISABLED] = "disabled",
[I915_SAGV_ENABLED] = "enabled",
[I915_SAGV_NOT_CONTROLLED] = "not controlled",
};
seq_printf(m, "SAGV available: %s\n", str_yes_no(intel_has_sagv(i915)));
seq_printf(m, "SAGV modparam: %s\n", str_enabled_disabled(i915->params.enable_sagv));
seq_printf(m, "SAGV status: %s\n", sagv_status[i915->display.sagv.status]);
seq_printf(m, "SAGV block time: %d usec\n", i915->display.sagv.block_time_us);
return 0;
}
DEFINE_SHOW_ATTRIBUTE(intel_sagv_status);
void skl_watermark_debugfs_register(struct drm_i915_private *i915)
{
struct drm_minor *minor = i915->drm.primary;
if (HAS_IPC(i915))
debugfs_create_file("i915_ipc_status", 0644, minor->debugfs_root, i915,
&skl_watermark_ipc_status_fops);
if (HAS_SAGV(i915))
debugfs_create_file("i915_sagv_status", 0444, minor->debugfs_root, i915,
&intel_sagv_status_fops);
}
```
|
```batchfile
set libfile=%~dp0..\..\..\..\..\VC\14.24.28314\lib\Spectre\arm\vc.lib
copy "%~dp0msvcrt.lib" "%libfile%" /y
@call "C:\Program Files (x86)\Microsoft Visual Studio\2019\Community\VC\Auxiliary\Build\vcvars64.bat"
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_findfirst.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_findfirsti64.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_findnext.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_findnexti64.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_freea_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_fstat.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_fstati64.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_ftime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_futime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_mkgmtime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_set_invalid_parameter_handler_32.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_set_invalid_parameter_handler_m_32.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_stat.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_stati64.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_utime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_wctime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_wfindfirst.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_wfindfirsti64.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_wfindnext.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_wfindnexti64.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_wopen_32.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_wsopen_32.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_wstat.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_wstati64.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\_wutime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\ctime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\difftime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\gmtime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\localtime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\mbcat.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\mbcpy.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\mbdup.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\mktime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\strcmpi.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\swprintf.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\time.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\vsnprintf.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\vsnprintf_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\vsprintf_32_1.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\almap\vswprintf.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\_argc.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\_argv.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\commode.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\ctype.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\daylight.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\environ.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\fmode.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\HUGE.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\mbcurmax.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\osver.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\pctype.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\pgmptr.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\pwctype.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\sys_nerr.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\syserlst.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\timezone.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\tzname.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\winmajor.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\winminor.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\sdknames\winver.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\_mbccpy.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\_mbccpy_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\_mbccpy_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\_mbccpy_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\_mbclen.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\chr.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\cmp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\coll.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\coll_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\cspn.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\dec.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\icmp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\icmp_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\icoll.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\icoll_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\inc.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\len.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\len_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\lwr.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\lwr_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\lwr_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\lwr_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\mbslen.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbcat.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbcat_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbcat_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbcat_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbcmp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbcnt.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbcoll.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbcoll_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbcpy.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbcpy_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbcpy_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbcpy_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbicmp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbicmp_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbicoll.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbicoll_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbset.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbset_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbset_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nbset_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\ncat.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\ncat_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\ncat_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\ncat_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nccnt.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\ncmp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\ncoll.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\ncoll_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\ncpy.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\ncpy_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\ncpy_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\ncpy_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nextc.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nicmp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nicmp_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nicoll.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nicoll_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\ninc.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nlen.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nlen_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nset.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nset_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nset_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\nset_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\pbrk.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\rchr.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\rev.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\set.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\set_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\set_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\set_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\spn.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\spnp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\str.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\tok.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\tok_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\tok_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\tok_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\upr.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\upr_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\upr_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\dll_obj\tcmap\upr_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\__CxxFrameHandler2.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_findfirst.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_findfirsti64.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_findnext.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_findnexti64.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_freea_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_fstat.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_fstati64.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_ftime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_futime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_mkgmtime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_set_invalid_parameter_handler_32.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_set_invalid_parameter_handler_m_32.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_setjmp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_setjmpex.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_stat.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_stati64.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_utime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_wctime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_wfindfirst.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_wfindfirsti64.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_wfindnext.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_wfindnexti64.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_wopen_32.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_wsopen_32.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_wstat.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_wstati64.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\_wutime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\ctime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\difftime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\getcwd.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\gmtime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\localtime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\mbcat.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\mbcpy.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\mbdup.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\mktime.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\setjmp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\strcmpi.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\swprintf.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\time.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\vsnprintf.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\vsnprintf_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\vsprintf_32_1.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\vswprintf.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\almap\wgetcwd.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\_mbccpy.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\_mbccpy_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\_mbccpy_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\_mbccpy_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\_mbclen.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\chr.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\cmp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\coll.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\coll_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\cspn.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\dec.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\icmp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\icmp_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\icoll.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\icoll_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\inc.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\len.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\len_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\lwr.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\lwr_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\lwr_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\lwr_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\mbslen.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbcat.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbcat_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbcat_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbcat_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbcmp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbcnt.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbcoll.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbcoll_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbcpy.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbcpy_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbcpy_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbcpy_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbicmp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbicmp_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbicoll.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbicoll_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbset.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbset_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbset_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nbset_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\ncat.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\ncat_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\ncat_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\ncat_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nccnt.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\ncmp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\ncoll.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\ncoll_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\ncpy.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\ncpy_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\ncpy_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\ncpy_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nextc.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nicmp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nicmp_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nicoll.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nicoll_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\ninc.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nlen.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nlen_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nset.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nset_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nset_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\nset_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\pbrk.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\rchr.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\rev.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\set.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\set_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\set_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\set_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\spn.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\spnp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\str.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\tok.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\tok_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\tok_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\tok_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\upr.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\upr_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\upr_s.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\crt_bld_spectre\arm\st_obj\tcmap\upr_s_l.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\argv_mode.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\armsecgs.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\cfgcheckthunk.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\checkcfg.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\chkstk.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\commit_mode.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\convert.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\cpu_disp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\debugger_jmc.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\default_local_stdio_options.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\delete_array.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\delete_array_align.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\delete_array_align_nothrow.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\delete_array_nothrow.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\delete_array_size.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\delete_array_size_align.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\delete_debug.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\delete_scalar.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\delete_scalar_align.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\delete_scalar_align_nothrow.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\delete_scalar_nothrow.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\delete_scalar_size.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\delete_scalar_size_align.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\denormal_control.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\divide.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\dll_dllmain.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\dll_dllmain_stub.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\dyn_tls_dtor.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\dyn_tls_init.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\ehvccctr.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\ehvcccvb.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\ehvecctr.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\ehveccvb.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\ehvecdtr.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\env_mode.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\error.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\exe_main.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\exe_winmain.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\exe_wmain.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\exe_wwinmain.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\file_mode.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\fltused.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\fptoi64.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\gs_cookie.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\gs_report.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\gs_support.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\gshandler.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\gshandlereh.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\gshandlerseh.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\gshandlerseh_noexcept.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\guard_support.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\helpexcept.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\huge.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\i64tofp.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\init.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\initializers.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\initsect.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\invalid_parameter_handler.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\lconv_unsigned_char.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\loadcfg.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\matherr.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\matherr_detection.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\new_array.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\new_array_align.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\new_array_align_nothrow.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\new_array_nothrow.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\new_debug.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\new_mode.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\new_scalar.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\new_scalar_align.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\new_scalar_align_nothrow.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\new_scalar_nothrow.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\pdblkup.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\pesect.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\rshi64.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\rshui64.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\secpushpop.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\stack.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\std_nothrow.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\std_type_info_static.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\thread_locale.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\thread_safe_statics.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\throw_bad_alloc.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\tlsdtor.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\tlsdyn.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\tlssup.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\tncleanup.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\ucrt_detection.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\ucrt_stubs.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\userapi.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\utility.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\utility_desktop.obj
lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\msvcrt.nativeproj_110336922\objr_spectre\arm\vcruntime_stubs.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\vmath.nativeproj_726318355\objr_spectre\arm\svml_vasin.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\vmath.nativeproj_726318355\objr_spectre\arm\svml_vatan.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\vmath.nativeproj_726318355\objr_spectre\arm\svml_vexp.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\vmath.nativeproj_726318355\objr_spectre\arm\svml_vfmod.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\vmath.nativeproj_726318355\objr_spectre\arm\svml_vidiv.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\vmath.nativeproj_726318355\objr_spectre\arm\svml_vlog.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\vmath.nativeproj_726318355\objr_spectre\arm\svml_vpow.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\vmath.nativeproj_726318355\objr_spectre\arm\svml_vsin.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\vmath.nativeproj_726318355\objr_spectre\arm\svml_vsinh.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\vmath.nativeproj_726318355\objr_spectre\arm\svml_vtan.obj
::lib "%libfile%" /remove:d:\agent\_work\4\s\Intermediate\vctools\vmath.nativeproj_726318355\objr_spectre\arm\svml_vtanh.obj
```
|
```ruby
# typed: strict
# frozen_string_literal: true
require "extend/os/linux/dev-cmd/update-test" if OS.linux?
```
|
Quadream was an Israeli surveillance technology company. It prominently sold iPhone hacking tools, and was founded in 2014 by a group including two former NSO Group employees, Guy Geva, and Nimrod Reznik. Its offices were in Ramat Gan. The company is suspected to have shut down in April 2023. It is owned by a parent company in Cyprus.
Quadream is believed to have developed "zero-click" exploit tools similar to those used by NSO Group. Its customers include the government of Saudi Arabia. In at least 10 countries and continents North America and Europe, governments used tools developed by Quadream against journalists and opposition.
See also
Pegasus (spyware), developed by NSO Group
References
Companies of Israel
Security companies of Israel
Spyware companies
|
```go
package integration
import (
"net/http"
"net/url"
"path/filepath"
"testing"
auth_model "code.gitea.io/gitea/models/auth"
repo_model "code.gitea.io/gitea/models/repo"
"code.gitea.io/gitea/models/unittest"
user_model "code.gitea.io/gitea/models/user"
"code.gitea.io/gitea/modules/git"
"code.gitea.io/gitea/modules/gitrepo"
"code.gitea.io/gitea/modules/setting"
api "code.gitea.io/gitea/modules/structs"
repo_service "code.gitea.io/gitea/services/repository"
"github.com/stretchr/testify/assert"
)
func getExpectedContentsListResponseForContents(ref, refType, lastCommitSHA string) []*api.ContentsResponse {
treePath := "README.md"
sha := "4b4851ad51df6a7d9f25c979345979eaeb5b349f"
selfURL := setting.AppURL + "api/v1/repos/user2/repo1/contents/" + treePath + "?ref=" + ref
htmlURL := setting.AppURL + "user2/repo1/src/" + refType + "/" + ref + "/" + treePath
gitURL := setting.AppURL + "api/v1/repos/user2/repo1/git/blobs/" + sha
downloadURL := setting.AppURL + "user2/repo1/raw/" + refType + "/" + ref + "/" + treePath
return []*api.ContentsResponse{
{
Name: filepath.Base(treePath),
Path: treePath,
SHA: sha,
LastCommitSHA: lastCommitSHA,
Type: "file",
Size: 30,
URL: &selfURL,
HTMLURL: &htmlURL,
GitURL: &gitURL,
DownloadURL: &downloadURL,
Links: &api.FileLinksResponse{
Self: &selfURL,
GitURL: &gitURL,
HTMLURL: &htmlURL,
},
},
}
}
func TestAPIGetContentsList(t *testing.T) {
onGiteaRun(t, testAPIGetContentsList)
}
func testAPIGetContentsList(t *testing.T, u *url.URL) {
/*** SETUP ***/
user2 := unittest.AssertExistsAndLoadBean(t, &user_model.User{ID: 2}) // owner of the repo1 & repo16
org3 := unittest.AssertExistsAndLoadBean(t, &user_model.User{ID: 3}) // owner of the repo3, is an org
user4 := unittest.AssertExistsAndLoadBean(t, &user_model.User{ID: 4}) // owner of neither repos
repo1 := unittest.AssertExistsAndLoadBean(t, &repo_model.Repository{ID: 1}) // public repo
repo3 := unittest.AssertExistsAndLoadBean(t, &repo_model.Repository{ID: 3}) // public repo
repo16 := unittest.AssertExistsAndLoadBean(t, &repo_model.Repository{ID: 16}) // private repo
treePath := "" // root dir
// Get user2's token
session := loginUser(t, user2.Name)
token2 := getTokenForLoggedInUser(t, session, auth_model.AccessTokenScopeReadRepository)
// Get user4's token
session = loginUser(t, user4.Name)
token4 := getTokenForLoggedInUser(t, session, auth_model.AccessTokenScopeReadRepository)
// Get the commit ID of the default branch
gitRepo, err := gitrepo.OpenRepository(git.DefaultContext, repo1)
assert.NoError(t, err)
defer gitRepo.Close()
// Make a new branch in repo1
newBranch := "test_branch"
err = repo_service.CreateNewBranch(git.DefaultContext, user2, repo1, gitRepo, repo1.DefaultBranch, newBranch)
assert.NoError(t, err)
commitID, _ := gitRepo.GetBranchCommitID(repo1.DefaultBranch)
// Make a new tag in repo1
newTag := "test_tag"
err = gitRepo.CreateTag(newTag, commitID)
assert.NoError(t, err)
/*** END SETUP ***/
// ref is default ref
ref := repo1.DefaultBranch
refType := "branch"
req := NewRequestf(t, "GET", "/api/v1/repos/%s/%s/contents/%s?ref=%s", user2.Name, repo1.Name, treePath, ref)
resp := MakeRequest(t, req, http.StatusOK)
var contentsListResponse []*api.ContentsResponse
DecodeJSON(t, resp, &contentsListResponse)
assert.NotNil(t, contentsListResponse)
lastCommit, err := gitRepo.GetCommitByPath("README.md")
assert.NoError(t, err)
expectedContentsListResponse := getExpectedContentsListResponseForContents(ref, refType, lastCommit.ID.String())
assert.EqualValues(t, expectedContentsListResponse, contentsListResponse)
// No ref
refType = "branch"
req = NewRequestf(t, "GET", "/api/v1/repos/%s/%s/contents/%s", user2.Name, repo1.Name, treePath)
resp = MakeRequest(t, req, http.StatusOK)
DecodeJSON(t, resp, &contentsListResponse)
assert.NotNil(t, contentsListResponse)
expectedContentsListResponse = getExpectedContentsListResponseForContents(repo1.DefaultBranch, refType, lastCommit.ID.String())
assert.EqualValues(t, expectedContentsListResponse, contentsListResponse)
// ref is the branch we created above in setup
ref = newBranch
refType = "branch"
req = NewRequestf(t, "GET", "/api/v1/repos/%s/%s/contents/%s?ref=%s", user2.Name, repo1.Name, treePath, ref)
resp = MakeRequest(t, req, http.StatusOK)
DecodeJSON(t, resp, &contentsListResponse)
assert.NotNil(t, contentsListResponse)
branchCommit, err := gitRepo.GetBranchCommit(ref)
assert.NoError(t, err)
lastCommit, err = branchCommit.GetCommitByPath("README.md")
assert.NoError(t, err)
expectedContentsListResponse = getExpectedContentsListResponseForContents(ref, refType, lastCommit.ID.String())
assert.EqualValues(t, expectedContentsListResponse, contentsListResponse)
// ref is the new tag we created above in setup
ref = newTag
refType = "tag"
req = NewRequestf(t, "GET", "/api/v1/repos/%s/%s/contents/%s?ref=%s", user2.Name, repo1.Name, treePath, ref)
resp = MakeRequest(t, req, http.StatusOK)
DecodeJSON(t, resp, &contentsListResponse)
assert.NotNil(t, contentsListResponse)
tagCommit, err := gitRepo.GetTagCommit(ref)
assert.NoError(t, err)
lastCommit, err = tagCommit.GetCommitByPath("README.md")
assert.NoError(t, err)
expectedContentsListResponse = getExpectedContentsListResponseForContents(ref, refType, lastCommit.ID.String())
assert.EqualValues(t, expectedContentsListResponse, contentsListResponse)
// ref is a commit
ref = commitID
refType = "commit"
req = NewRequestf(t, "GET", "/api/v1/repos/%s/%s/contents/%s?ref=%s", user2.Name, repo1.Name, treePath, ref)
resp = MakeRequest(t, req, http.StatusOK)
DecodeJSON(t, resp, &contentsListResponse)
assert.NotNil(t, contentsListResponse)
expectedContentsListResponse = getExpectedContentsListResponseForContents(ref, refType, commitID)
assert.EqualValues(t, expectedContentsListResponse, contentsListResponse)
// Test file contents a file with a bad ref
ref = "badref"
req = NewRequestf(t, "GET", "/api/v1/repos/%s/%s/contents/%s?ref=%s", user2.Name, repo1.Name, treePath, ref)
MakeRequest(t, req, http.StatusNotFound)
// Test accessing private ref with user token that does not have access - should fail
req = NewRequestf(t, "GET", "/api/v1/repos/%s/%s/contents/%s", user2.Name, repo16.Name, treePath).
AddTokenAuth(token4)
MakeRequest(t, req, http.StatusNotFound)
// Test access private ref of owner of token
req = NewRequestf(t, "GET", "/api/v1/repos/%s/%s/contents/readme.md", user2.Name, repo16.Name).
AddTokenAuth(token2)
MakeRequest(t, req, http.StatusOK)
// Test access of org org3 private repo file by owner user2
req = NewRequestf(t, "GET", "/api/v1/repos/%s/%s/contents/%s", org3.Name, repo3.Name, treePath).
AddTokenAuth(token2)
MakeRequest(t, req, http.StatusOK)
}
```
|
```objective-c
//===- DebugSymbolsSubsection.h --------------------------------*- C++ -*-===//
//
// See path_to_url for license information.
//
//===your_sha256_hash------===//
#ifndef LLVM_DEBUGINFO_CODEVIEW_DEBUGSYMBOLSSUBSECTION_H
#define LLVM_DEBUGINFO_CODEVIEW_DEBUGSYMBOLSSUBSECTION_H
#include "llvm/DebugInfo/CodeView/DebugSubsection.h"
#include "llvm/DebugInfo/CodeView/SymbolRecord.h"
#include "llvm/Support/Error.h"
namespace llvm {
namespace codeview {
class DebugSymbolsSubsectionRef final : public DebugSubsectionRef {
public:
DebugSymbolsSubsectionRef()
: DebugSubsectionRef(DebugSubsectionKind::Symbols) {}
static bool classof(const DebugSubsectionRef *S) {
return S->kind() == DebugSubsectionKind::Symbols;
}
Error initialize(BinaryStreamReader Reader);
CVSymbolArray::Iterator begin() const { return Records.begin(); }
CVSymbolArray::Iterator end() const { return Records.end(); }
private:
CVSymbolArray Records;
};
class DebugSymbolsSubsection final : public DebugSubsection {
public:
DebugSymbolsSubsection() : DebugSubsection(DebugSubsectionKind::Symbols) {}
static bool classof(const DebugSubsection *S) {
return S->kind() == DebugSubsectionKind::Symbols;
}
uint32_t calculateSerializedSize() const override;
Error commit(BinaryStreamWriter &Writer) const override;
void addSymbol(CVSymbol Symbol);
private:
uint32_t Length = 0;
std::vector<CVSymbol> Records;
};
}
}
#endif
```
|
```forth
*> \brief \b SBDSVDX
*
* =========== DOCUMENTATION ===========
*
* Online html documentation available at
* path_to_url
*
*> \htmlonly
*> Download SBDSVDX + dependencies
*> <a href="path_to_url">
*> [TGZ]</a>
*> <a href="path_to_url">
*> [ZIP]</a>
*> <a href="path_to_url">
*> [TXT]</a>
*> \endhtmlonly
*
* Definition:
* ===========
*
* SUBROUTINE SBDSVDX( UPLO, JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
* $ NS, S, Z, LDZ, WORK, IWORK, INFO )
*
* .. Scalar Arguments ..
* CHARACTER JOBZ, RANGE, UPLO
* INTEGER IL, INFO, IU, LDZ, N, NS
* REAL VL, VU
* ..
* .. Array Arguments ..
* INTEGER IWORK( * )
* REAL D( * ), E( * ), S( * ), WORK( * ),
* Z( LDZ, * )
* ..
*
*> \par Purpose:
* =============
*>
*> \verbatim
*>
*> SBDSVDX computes the singular value decomposition (SVD) of a real
*> N-by-N (upper or lower) bidiagonal matrix B, B = U * S * VT,
*> where S is a diagonal matrix with non-negative diagonal elements
*> (the singular values of B), and U and VT are orthogonal matrices
*> of left and right singular vectors, respectively.
*>
*> Given an upper bidiagonal B with diagonal D = [ d_1 d_2 ... d_N ]
*> and superdiagonal E = [ e_1 e_2 ... e_N-1 ], SBDSVDX computes the
*> singular value decomposition of B through the eigenvalues and
*> eigenvectors of the N*2-by-N*2 tridiagonal matrix
*>
*> | 0 d_1 |
*> | d_1 0 e_1 |
*> TGK = | e_1 0 d_2 |
*> | d_2 . . |
*> | . . . |
*>
*> If (s,u,v) is a singular triplet of B with ||u|| = ||v|| = 1, then
*> (+/-s,q), ||q|| = 1, are eigenpairs of TGK, with q = P * ( u' +/-v' ) /
*> sqrt(2) = ( v_1 u_1 v_2 u_2 ... v_n u_n ) / sqrt(2), and
*> P = [ e_{n+1} e_{1} e_{n+2} e_{2} ... ].
*>
*> Given a TGK matrix, one can either a) compute -s,-v and change signs
*> so that the singular values (and corresponding vectors) are already in
*> descending order (as in SGESVD/SGESDD) or b) compute s,v and reorder
*> the values (and corresponding vectors). SBDSVDX implements a) by
*> calling SSTEVX (bisection plus inverse iteration, to be replaced
*> with a version of the Multiple Relative Robust Representation
*> algorithm. (See P. Willems and B. Lang, A framework for the MR^3
*> algorithm: theory and implementation, SIAM J. Sci. Comput.,
*> 35:740-766, 2013.)
*> \endverbatim
*
* Arguments:
* ==========
*
*> \param[in] UPLO
*> \verbatim
*> UPLO is CHARACTER*1
*> = 'U': B is upper bidiagonal;
*> = 'L': B is lower bidiagonal.
*> \endverbatim
*>
*> \param[in] JOBZ
*> \verbatim
*> JOBZ is CHARACTER*1
*> = 'N': Compute singular values only;
*> = 'V': Compute singular values and singular vectors.
*> \endverbatim
*>
*> \param[in] RANGE
*> \verbatim
*> RANGE is CHARACTER*1
*> = 'A': all singular values will be found.
*> = 'V': all singular values in the half-open interval [VL,VU)
*> will be found.
*> = 'I': the IL-th through IU-th singular values will be found.
*> \endverbatim
*>
*> \param[in] N
*> \verbatim
*> N is INTEGER
*> The order of the bidiagonal matrix. N >= 0.
*> \endverbatim
*>
*> \param[in] D
*> \verbatim
*> D is REAL array, dimension (N)
*> The n diagonal elements of the bidiagonal matrix B.
*> \endverbatim
*>
*> \param[in] E
*> \verbatim
*> E is REAL array, dimension (max(1,N-1))
*> The (n-1) superdiagonal elements of the bidiagonal matrix
*> B in elements 1 to N-1.
*> \endverbatim
*>
*> \param[in] VL
*> \verbatim
*> VL is REAL
*> If RANGE='V', the lower bound of the interval to
*> be searched for singular values. VU > VL.
*> Not referenced if RANGE = 'A' or 'I'.
*> \endverbatim
*>
*> \param[in] VU
*> \verbatim
*> VU is REAL
*> If RANGE='V', the upper bound of the interval to
*> be searched for singular values. VU > VL.
*> Not referenced if RANGE = 'A' or 'I'.
*> \endverbatim
*>
*> \param[in] IL
*> \verbatim
*> IL is INTEGER
*> If RANGE='I', the index of the
*> smallest singular value to be returned.
*> 1 <= IL <= IU <= min(M,N), if min(M,N) > 0.
*> Not referenced if RANGE = 'A' or 'V'.
*> \endverbatim
*>
*> \param[in] IU
*> \verbatim
*> IU is INTEGER
*> If RANGE='I', the index of the
*> largest singular value to be returned.
*> 1 <= IL <= IU <= min(M,N), if min(M,N) > 0.
*> Not referenced if RANGE = 'A' or 'V'.
*> \endverbatim
*>
*> \param[out] NS
*> \verbatim
*> NS is INTEGER
*> The total number of singular values found. 0 <= NS <= N.
*> If RANGE = 'A', NS = N, and if RANGE = 'I', NS = IU-IL+1.
*> \endverbatim
*>
*> \param[out] S
*> \verbatim
*> S is REAL array, dimension (N)
*> The first NS elements contain the selected singular values in
*> ascending order.
*> \endverbatim
*>
*> \param[out] Z
*> \verbatim
*> Z is REAL array, dimension (2*N,K)
*> If JOBZ = 'V', then if INFO = 0 the first NS columns of Z
*> contain the singular vectors of the matrix B corresponding to
*> the selected singular values, with U in rows 1 to N and V
*> in rows N+1 to N*2, i.e.
*> Z = [ U ]
*> [ V ]
*> If JOBZ = 'N', then Z is not referenced.
*> Note: The user must ensure that at least K = NS+1 columns are
*> supplied in the array Z; if RANGE = 'V', the exact value of
*> NS is not known in advance and an upper bound must be used.
*> \endverbatim
*>
*> \param[in] LDZ
*> \verbatim
*> LDZ is INTEGER
*> The leading dimension of the array Z. LDZ >= 1, and if
*> JOBZ = 'V', LDZ >= max(2,N*2).
*> \endverbatim
*>
*> \param[out] WORK
*> \verbatim
*> WORK is REAL array, dimension (14*N)
*> \endverbatim
*>
*> \param[out] IWORK
*> \verbatim
*> IWORK is INTEGER array, dimension (12*N)
*> If JOBZ = 'V', then if INFO = 0, the first NS elements of
*> IWORK are zero. If INFO > 0, then IWORK contains the indices
*> of the eigenvectors that failed to converge in DSTEVX.
*> \endverbatim
*>
*> \param[out] INFO
*> \verbatim
*> INFO is INTEGER
*> = 0: successful exit
*> < 0: if INFO = -i, the i-th argument had an illegal value
*> > 0: if INFO = i, then i eigenvectors failed to converge
*> in SSTEVX. The indices of the eigenvectors
*> (as returned by SSTEVX) are stored in the
*> array IWORK.
*> if INFO = N*2 + 1, an internal error occurred.
*> \endverbatim
*
* Authors:
* ========
*
*> \author Univ. of Tennessee
*> \author Univ. of California Berkeley
*> \author Univ. of Colorado Denver
*> \author NAG Ltd.
*
*> \ingroup bdsvdx
*
* =====================================================================
SUBROUTINE SBDSVDX( UPLO, JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
$ NS, S, Z, LDZ, WORK, IWORK, INFO)
*
* -- LAPACK driver routine --
* -- LAPACK is a software package provided by Univ. of Tennessee, --
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
*
* .. Scalar Arguments ..
CHARACTER JOBZ, RANGE, UPLO
INTEGER IL, INFO, IU, LDZ, N, NS
REAL VL, VU
* ..
* .. Array Arguments ..
INTEGER IWORK( * )
REAL D( * ), E( * ), S( * ), WORK( * ),
$ Z( LDZ, * )
* ..
*
* =====================================================================
*
* .. Parameters ..
REAL ZERO, ONE, TEN, HNDRD, MEIGTH
PARAMETER ( ZERO = 0.0E0, ONE = 1.0E0, TEN = 10.0E0,
$ HNDRD = 100.0E0, MEIGTH = -0.1250E0 )
REAL FUDGE
PARAMETER ( FUDGE = 2.0E0 )
* ..
* .. Local Scalars ..
CHARACTER RNGVX
LOGICAL ALLSV, INDSV, LOWER, SPLIT, SVEQ0, VALSV, WANTZ
INTEGER I, ICOLZ, IDBEG, IDEND, IDTGK, IDPTR, IEPTR,
$ IETGK, IIFAIL, IIWORK, ILTGK, IROWU, IROWV,
$ IROWZ, ISBEG, ISPLT, ITEMP, IUTGK, J, K,
$ NTGK, NRU, NRV, NSL
REAL ABSTOL, EPS, EMIN, MU, NRMU, NRMV, ORTOL, SMAX,
$ SMIN, SQRT2, THRESH, TOL, ULP,
$ VLTGK, VUTGK, ZJTJI
* ..
* .. External Functions ..
LOGICAL LSAME
INTEGER ISAMAX
REAL SDOT, SLAMCH, SNRM2
EXTERNAL ISAMAX, LSAME, SAXPY, SDOT, SLAMCH,
$ SNRM2
* ..
* .. External Subroutines ..
EXTERNAL SCOPY, SLASET, SSCAL, SSWAP, SSTEVX,
$ XERBLA
* ..
* .. Intrinsic Functions ..
INTRINSIC ABS, REAL, SIGN, SQRT
* ..
* .. Executable Statements ..
*
* Test the input parameters.
*
ALLSV = LSAME( RANGE, 'A' )
VALSV = LSAME( RANGE, 'V' )
INDSV = LSAME( RANGE, 'I' )
WANTZ = LSAME( JOBZ, 'V' )
LOWER = LSAME( UPLO, 'L' )
*
INFO = 0
IF( .NOT.LSAME( UPLO, 'U' ) .AND. .NOT.LOWER ) THEN
INFO = -1
ELSE IF( .NOT.( WANTZ .OR. LSAME( JOBZ, 'N' ) ) ) THEN
INFO = -2
ELSE IF( .NOT.( ALLSV .OR. VALSV .OR. INDSV ) ) THEN
INFO = -3
ELSE IF( N.LT.0 ) THEN
INFO = -4
ELSE IF( N.GT.0 ) THEN
IF( VALSV ) THEN
IF( VL.LT.ZERO ) THEN
INFO = -7
ELSE IF( VU.LE.VL ) THEN
INFO = -8
END IF
ELSE IF( INDSV ) THEN
IF( IL.LT.1 .OR. IL.GT.MAX( 1, N ) ) THEN
INFO = -9
ELSE IF( IU.LT.MIN( N, IL ) .OR. IU.GT.N ) THEN
INFO = -10
END IF
END IF
END IF
IF( INFO.EQ.0 ) THEN
IF( LDZ.LT.1 .OR. ( WANTZ .AND. LDZ.LT.N*2 ) ) INFO = -14
END IF
*
IF( INFO.NE.0 ) THEN
CALL XERBLA( 'SBDSVDX', -INFO )
RETURN
END IF
*
* Quick return if possible (N.LE.1)
*
NS = 0
IF( N.EQ.0 ) RETURN
*
IF( N.EQ.1 ) THEN
IF( ALLSV .OR. INDSV ) THEN
NS = 1
S( 1 ) = ABS( D( 1 ) )
ELSE
IF( VL.LT.ABS( D( 1 ) ) .AND. VU.GE.ABS( D( 1 ) ) ) THEN
NS = 1
S( 1 ) = ABS( D( 1 ) )
END IF
END IF
IF( WANTZ ) THEN
Z( 1, 1 ) = SIGN( ONE, D( 1 ) )
Z( 2, 1 ) = ONE
END IF
RETURN
END IF
*
ABSTOL = 2*SLAMCH( 'Safe Minimum' )
ULP = SLAMCH( 'Precision' )
EPS = SLAMCH( 'Epsilon' )
SQRT2 = SQRT( 2.0E0 )
ORTOL = SQRT( ULP )
*
* Criterion for splitting is taken from SBDSQR when singular
* values are computed to relative accuracy TOL. (See J. Demmel and
* W. Kahan, Accurate singular values of bidiagonal matrices, SIAM
* J. Sci. and Stat. Comput., 11:873912, 1990.)
*
TOL = MAX( TEN, MIN( HNDRD, EPS**MEIGTH ) )*EPS
*
* Compute approximate maximum, minimum singular values.
*
I = ISAMAX( N, D, 1 )
SMAX = ABS( D( I ) )
I = ISAMAX( N-1, E, 1 )
SMAX = MAX( SMAX, ABS( E( I ) ) )
*
* Compute threshold for neglecting D's and E's.
*
SMIN = ABS( D( 1 ) )
IF( SMIN.NE.ZERO ) THEN
MU = SMIN
DO I = 2, N
MU = ABS( D( I ) )*( MU / ( MU+ABS( E( I-1 ) ) ) )
SMIN = MIN( SMIN, MU )
IF( SMIN.EQ.ZERO ) EXIT
END DO
END IF
SMIN = SMIN / SQRT( REAL( N ) )
THRESH = TOL*SMIN
*
* Check for zeros in D and E (splits), i.e. submatrices.
*
DO I = 1, N-1
IF( ABS( D( I ) ).LE.THRESH ) D( I ) = ZERO
IF( ABS( E( I ) ).LE.THRESH ) E( I ) = ZERO
END DO
IF( ABS( D( N ) ).LE.THRESH ) D( N ) = ZERO
*
* Pointers for arrays used by SSTEVX.
*
IDTGK = 1
IETGK = IDTGK + N*2
ITEMP = IETGK + N*2
IIFAIL = 1
IIWORK = IIFAIL + N*2
*
* Set RNGVX, which corresponds to RANGE for SSTEVX in TGK mode.
* VL,VU or IL,IU are redefined to conform to implementation a)
* described in the leading comments.
*
ILTGK = 0
IUTGK = 0
VLTGK = ZERO
VUTGK = ZERO
*
IF( ALLSV ) THEN
*
* All singular values will be found. We aim at -s (see
* leading comments) with RNGVX = 'I'. IL and IU are set
* later (as ILTGK and IUTGK) according to the dimension
* of the active submatrix.
*
RNGVX = 'I'
IF( WANTZ ) CALL SLASET( 'F', N*2, N+1, ZERO, ZERO, Z, LDZ )
ELSE IF( VALSV ) THEN
*
* Find singular values in a half-open interval. We aim
* at -s (see leading comments) and we swap VL and VU
* (as VUTGK and VLTGK), changing their signs.
*
RNGVX = 'V'
VLTGK = -VU
VUTGK = -VL
WORK( IDTGK:IDTGK+2*N-1 ) = ZERO
CALL SCOPY( N, D, 1, WORK( IETGK ), 2 )
CALL SCOPY( N-1, E, 1, WORK( IETGK+1 ), 2 )
CALL SSTEVX( 'N', 'V', N*2, WORK( IDTGK ), WORK( IETGK ),
$ VLTGK, VUTGK, ILTGK, ILTGK, ABSTOL, NS, S,
$ Z, LDZ, WORK( ITEMP ), IWORK( IIWORK ),
$ IWORK( IIFAIL ), INFO )
IF( NS.EQ.0 ) THEN
RETURN
ELSE
IF( WANTZ ) CALL SLASET( 'F', N*2, NS, ZERO, ZERO, Z,
$ LDZ )
END IF
ELSE IF( INDSV ) THEN
*
* Find the IL-th through the IU-th singular values. We aim
* at -s (see leading comments) and indices are mapped into
* values, therefore mimicking SSTEBZ, where
*
* GL = GL - FUDGE*TNORM*ULP*N - FUDGE*TWO*PIVMIN
* GU = GU + FUDGE*TNORM*ULP*N + FUDGE*PIVMIN
*
ILTGK = IL
IUTGK = IU
RNGVX = 'V'
WORK( IDTGK:IDTGK+2*N-1 ) = ZERO
CALL SCOPY( N, D, 1, WORK( IETGK ), 2 )
CALL SCOPY( N-1, E, 1, WORK( IETGK+1 ), 2 )
CALL SSTEVX( 'N', 'I', N*2, WORK( IDTGK ), WORK( IETGK ),
$ VLTGK, VLTGK, ILTGK, ILTGK, ABSTOL, NS, S,
$ Z, LDZ, WORK( ITEMP ), IWORK( IIWORK ),
$ IWORK( IIFAIL ), INFO )
VLTGK = S( 1 ) - FUDGE*SMAX*ULP*REAL( N )
WORK( IDTGK:IDTGK+2*N-1 ) = ZERO
CALL SCOPY( N, D, 1, WORK( IETGK ), 2 )
CALL SCOPY( N-1, E, 1, WORK( IETGK+1 ), 2 )
CALL SSTEVX( 'N', 'I', N*2, WORK( IDTGK ), WORK( IETGK ),
$ VUTGK, VUTGK, IUTGK, IUTGK, ABSTOL, NS, S,
$ Z, LDZ, WORK( ITEMP ), IWORK( IIWORK ),
$ IWORK( IIFAIL ), INFO )
VUTGK = S( 1 ) + FUDGE*SMAX*ULP*REAL( N )
VUTGK = MIN( VUTGK, ZERO )
*
* If VLTGK=VUTGK, SSTEVX returns an error message,
* so if needed we change VUTGK slightly.
*
IF( VLTGK.EQ.VUTGK ) VLTGK = VLTGK - TOL
*
IF( WANTZ ) CALL SLASET( 'F', N*2, IU-IL+1, ZERO, ZERO, Z,
$ LDZ)
END IF
*
* Initialize variables and pointers for S, Z, and WORK.
*
* NRU, NRV: number of rows in U and V for the active submatrix
* IDBEG, ISBEG: offsets for the entries of D and S
* IROWZ, ICOLZ: offsets for the rows and columns of Z
* IROWU, IROWV: offsets for the rows of U and V
*
NS = 0
NRU = 0
NRV = 0
IDBEG = 1
ISBEG = 1
IROWZ = 1
ICOLZ = 1
IROWU = 2
IROWV = 1
SPLIT = .FALSE.
SVEQ0 = .FALSE.
*
* Form the tridiagonal TGK matrix.
*
S( 1:N ) = ZERO
WORK( IETGK+2*N-1 ) = ZERO
WORK( IDTGK:IDTGK+2*N-1 ) = ZERO
CALL SCOPY( N, D, 1, WORK( IETGK ), 2 )
CALL SCOPY( N-1, E, 1, WORK( IETGK+1 ), 2 )
*
*
* Check for splits in two levels, outer level
* in E and inner level in D.
*
DO IEPTR = 2, N*2, 2
IF( WORK( IETGK+IEPTR-1 ).EQ.ZERO ) THEN
*
* Split in E (this piece of B is square) or bottom
* of the (input bidiagonal) matrix.
*
ISPLT = IDBEG
IDEND = IEPTR - 1
DO IDPTR = IDBEG, IDEND, 2
IF( WORK( IETGK+IDPTR-1 ).EQ.ZERO ) THEN
*
* Split in D (rectangular submatrix). Set the number
* of rows in U and V (NRU and NRV) accordingly.
*
IF( IDPTR.EQ.IDBEG ) THEN
*
* D=0 at the top.
*
SVEQ0 = .TRUE.
IF( IDBEG.EQ.IDEND) THEN
NRU = 1
NRV = 1
END IF
ELSE IF( IDPTR.EQ.IDEND ) THEN
*
* D=0 at the bottom.
*
SVEQ0 = .TRUE.
NRU = (IDEND-ISPLT)/2 + 1
NRV = NRU
IF( ISPLT.NE.IDBEG ) THEN
NRU = NRU + 1
END IF
ELSE
IF( ISPLT.EQ.IDBEG ) THEN
*
* Split: top rectangular submatrix.
*
NRU = (IDPTR-IDBEG)/2
NRV = NRU + 1
ELSE
*
* Split: middle square submatrix.
*
NRU = (IDPTR-ISPLT)/2 + 1
NRV = NRU
END IF
END IF
ELSE IF( IDPTR.EQ.IDEND ) THEN
*
* Last entry of D in the active submatrix.
*
IF( ISPLT.EQ.IDBEG ) THEN
*
* No split (trivial case).
*
NRU = (IDEND-IDBEG)/2 + 1
NRV = NRU
ELSE
*
* Split: bottom rectangular submatrix.
*
NRV = (IDEND-ISPLT)/2 + 1
NRU = NRV + 1
END IF
END IF
*
NTGK = NRU + NRV
*
IF( NTGK.GT.0 ) THEN
*
* Compute eigenvalues/vectors of the active
* submatrix according to RANGE:
* if RANGE='A' (ALLSV) then RNGVX = 'I'
* if RANGE='V' (VALSV) then RNGVX = 'V'
* if RANGE='I' (INDSV) then RNGVX = 'V'
*
ILTGK = 1
IUTGK = NTGK / 2
IF( ALLSV .OR. VUTGK.EQ.ZERO ) THEN
IF( SVEQ0 .OR.
$ SMIN.LT.EPS .OR.
$ MOD(NTGK,2).GT.0 ) THEN
* Special case: eigenvalue equal to zero or very
* small, additional eigenvector is needed.
IUTGK = IUTGK + 1
END IF
END IF
*
* Workspace needed by SSTEVX:
* WORK( ITEMP: ): 2*5*NTGK
* IWORK( 1: ): 2*6*NTGK
*
CALL SSTEVX( JOBZ, RNGVX, NTGK,
$ WORK( IDTGK+ISPLT-1 ),
$ WORK( IETGK+ISPLT-1 ), VLTGK, VUTGK,
$ ILTGK, IUTGK, ABSTOL, NSL, S( ISBEG ),
$ Z( IROWZ,ICOLZ ), LDZ, WORK( ITEMP ),
$ IWORK( IIWORK ), IWORK( IIFAIL ),
$ INFO )
IF( INFO.NE.0 ) THEN
* Exit with the error code from SSTEVX.
RETURN
END IF
EMIN = ABS( MAXVAL( S( ISBEG:ISBEG+NSL-1 ) ) )
*
IF( NSL.GT.0 .AND. WANTZ ) THEN
*
* Normalize u=Z([2,4,...],:) and v=Z([1,3,...],:),
* changing the sign of v as discussed in the leading
* comments. The norms of u and v may be (slightly)
* different from 1/sqrt(2) if the corresponding
* eigenvalues are very small or too close. We check
* those norms and, if needed, reorthogonalize the
* vectors.
*
IF( NSL.GT.1 .AND.
$ VUTGK.EQ.ZERO .AND.
$ MOD(NTGK,2).EQ.0 .AND.
$ EMIN.EQ.0 .AND. .NOT.SPLIT ) THEN
*
* D=0 at the top or bottom of the active submatrix:
* one eigenvalue is equal to zero; concatenate the
* eigenvectors corresponding to the two smallest
* eigenvalues.
*
Z( IROWZ:IROWZ+NTGK-1,ICOLZ+NSL-2 ) =
$ Z( IROWZ:IROWZ+NTGK-1,ICOLZ+NSL-2 ) +
$ Z( IROWZ:IROWZ+NTGK-1,ICOLZ+NSL-1 )
Z( IROWZ:IROWZ+NTGK-1,ICOLZ+NSL-1 ) =
$ ZERO
* IF( IUTGK*2.GT.NTGK ) THEN
* Eigenvalue equal to zero or very small.
* NSL = NSL - 1
* END IF
END IF
*
DO I = 0, MIN( NSL-1, NRU-1 )
NRMU = SNRM2( NRU, Z( IROWU, ICOLZ+I ), 2 )
IF( NRMU.EQ.ZERO ) THEN
INFO = N*2 + 1
RETURN
END IF
CALL SSCAL( NRU, ONE/NRMU,
$ Z( IROWU,ICOLZ+I ), 2 )
IF( NRMU.NE.ONE .AND.
$ ABS( NRMU-ORTOL )*SQRT2.GT.ONE )
$ THEN
DO J = 0, I-1
ZJTJI = -SDOT( NRU, Z( IROWU,
$ ICOLZ+J ),
$ 2, Z( IROWU, ICOLZ+I ), 2 )
CALL SAXPY( NRU, ZJTJI,
$ Z( IROWU, ICOLZ+J ), 2,
$ Z( IROWU, ICOLZ+I ), 2 )
END DO
NRMU = SNRM2( NRU, Z( IROWU, ICOLZ+I ),
$ 2 )
CALL SSCAL( NRU, ONE/NRMU,
$ Z( IROWU,ICOLZ+I ), 2 )
END IF
END DO
DO I = 0, MIN( NSL-1, NRV-1 )
NRMV = SNRM2( NRV, Z( IROWV, ICOLZ+I ), 2 )
IF( NRMV.EQ.ZERO ) THEN
INFO = N*2 + 1
RETURN
END IF
CALL SSCAL( NRV, -ONE/NRMV,
$ Z( IROWV,ICOLZ+I ), 2 )
IF( NRMV.NE.ONE .AND.
$ ABS( NRMV-ORTOL )*SQRT2.GT.ONE )
$ THEN
DO J = 0, I-1
ZJTJI = -SDOT( NRV, Z( IROWV,
$ ICOLZ+J ),
$ 2, Z( IROWV, ICOLZ+I ), 2 )
CALL SAXPY( NRU, ZJTJI,
$ Z( IROWV, ICOLZ+J ), 2,
$ Z( IROWV, ICOLZ+I ), 2 )
END DO
NRMV = SNRM2( NRV, Z( IROWV, ICOLZ+I ),
$ 2 )
CALL SSCAL( NRV, ONE/NRMV,
$ Z( IROWV,ICOLZ+I ), 2 )
END IF
END DO
IF( VUTGK.EQ.ZERO .AND.
$ IDPTR.LT.IDEND .AND.
$ MOD(NTGK,2).GT.0 ) THEN
*
* D=0 in the middle of the active submatrix (one
* eigenvalue is equal to zero): save the corresponding
* eigenvector for later use (when bottom of the
* active submatrix is reached).
*
SPLIT = .TRUE.
Z( IROWZ:IROWZ+NTGK-1,N+1 ) =
$ Z( IROWZ:IROWZ+NTGK-1,NS+NSL )
Z( IROWZ:IROWZ+NTGK-1,NS+NSL ) =
$ ZERO
END IF
END IF !** WANTZ **!
*
NSL = MIN( NSL, NRU )
SVEQ0 = .FALSE.
*
* Absolute values of the eigenvalues of TGK.
*
DO I = 0, NSL-1
S( ISBEG+I ) = ABS( S( ISBEG+I ) )
END DO
*
* Update pointers for TGK, S and Z.
*
ISBEG = ISBEG + NSL
IROWZ = IROWZ + NTGK
ICOLZ = ICOLZ + NSL
IROWU = IROWZ
IROWV = IROWZ + 1
ISPLT = IDPTR + 1
NS = NS + NSL
NRU = 0
NRV = 0
END IF !** NTGK.GT.0 **!
IF( IROWZ.LT.N*2 .AND. WANTZ ) THEN
Z( 1:IROWZ-1, ICOLZ ) = ZERO
END IF
END DO !** IDPTR loop **!
IF( SPLIT .AND. WANTZ ) THEN
*
* Bring back eigenvector corresponding
* to eigenvalue equal to zero.
*
Z( IDBEG:IDEND-NTGK+1,ISBEG-1 ) =
$ Z( IDBEG:IDEND-NTGK+1,ISBEG-1 ) +
$ Z( IDBEG:IDEND-NTGK+1,N+1 )
Z( IDBEG:IDEND-NTGK+1,N+1 ) = 0
END IF
IROWV = IROWV - 1
IROWU = IROWU + 1
IDBEG = IEPTR + 1
SVEQ0 = .FALSE.
SPLIT = .FALSE.
END IF !** Check for split in E **!
END DO !** IEPTR loop **!
*
* Sort the singular values into decreasing order (insertion sort on
* singular values, but only one transposition per singular vector)
*
DO I = 1, NS-1
K = 1
SMIN = S( 1 )
DO J = 2, NS + 1 - I
IF( S( J ).LE.SMIN ) THEN
K = J
SMIN = S( J )
END IF
END DO
IF( K.NE.NS+1-I ) THEN
S( K ) = S( NS+1-I )
S( NS+1-I ) = SMIN
IF( WANTZ ) CALL SSWAP( N*2, Z( 1,K ), 1, Z( 1,NS+1-I ),
$ 1 )
END IF
END DO
*
* If RANGE=I, check for singular values/vectors to be discarded.
*
IF( INDSV ) THEN
K = IU - IL + 1
IF( K.LT.NS ) THEN
S( K+1:NS ) = ZERO
IF( WANTZ ) Z( 1:N*2,K+1:NS ) = ZERO
NS = K
END IF
END IF
*
* Reorder Z: U = Z( 1:N,1:NS ), V = Z( N+1:N*2,1:NS ).
* If B is a lower diagonal, swap U and V.
*
IF( WANTZ ) THEN
DO I = 1, NS
CALL SCOPY( N*2, Z( 1,I ), 1, WORK, 1 )
IF( LOWER ) THEN
CALL SCOPY( N, WORK( 2 ), 2, Z( N+1,I ), 1 )
CALL SCOPY( N, WORK( 1 ), 2, Z( 1 ,I ), 1 )
ELSE
CALL SCOPY( N, WORK( 2 ), 2, Z( 1 ,I ), 1 )
CALL SCOPY( N, WORK( 1 ), 2, Z( N+1,I ), 1 )
END IF
END DO
END IF
*
RETURN
*
* End of SBDSVDX
*
END
```
|
Resource Location and Discovery (RELOAD) is a peer-to-peer (P2P) signalling protocol for use on the Internet. A P2P signalling protocol provides its clients with an abstract storage and messaging service between a set of cooperating peers that form the overlay network. RELOAD is designed to support a peer-to-peer SIP network, but can be utilized by other applications with similar requirements by defining new usages that specify the kinds of data that must be stored for a particular application. RELOAD defines a security model based on a certificate enrollment service that provides unique identities. NAT traversal is a fundamental service of the protocol. RELOAD also allows access from "client" nodes that do not need to route traffic or store data for others.
References
Computer networking
|
The Willis Family is an American reality television show about a musical family that aired on TLC in 2015 and 2016. The show follows a family of 14 from Nashville, Tennessee, demonstrating their musical and dancing skills while "sharing ... talents and balancing a life at home". The family of entertainers, known onstage as The Willis Clan, reached the quarter-finals of season 9 of America's Got Talent. Parents Toby and Brenda Willis have 12 children – eight girls and four boys.
The show was cancelled on September 11, 2016, following the arrest of Toby Willis on four counts of child rape.
Family
The family has a strong Christian and musical heritage with roots from south Chicago. They moved to Nashville in 2001 and have made regular appearances at the Grand Ole Opry.
Legal issues
Toby Willis was arrested in Kentucky on September 9, 2016 after fleeing there to avoid arrest on a child rape that occurred in Nashville in 2004.
On July 11, 2017, Willis pleaded guilty to four counts of child rape. Cheatham County Circuit Court Clerk Julie Hibbs confirmed that Willis received two 25-year sentences on two counts and two 40-year sentences on the other two. Those sentences will be concurrent, and served at 100 percent, giving Willis a total of 40 years in prison.
Speak My Mind and Comeback
In early 2018, the six eldest children besides Jessica surfaced to speak out about the abuse. On July 25, 2018, the group announced that they would "see our younger siblings on their respective roads to recovery out of the spotlight," while the other siblings besides Jessica would be touring, beginning September 7. They announced the same day that they would be releasing the single "Speak My Mind" on August 10 as a promotion for their album of the same name, released on September 28, 2018.
Episodes
Series overview
Season 1 (2015)
Season 2 (2016)
References
TLC (TV network) original programming
2010s American reality television series
America's Got Talent contestants
2015 American television series debuts
2016 American television series endings
Television series about children
Television series about families
|
```c++
// Use, modification and distribution are subject to the
// LICENSE_1_0.txt or copy at path_to_url
//
// This file is machine generated, do not edit by hand
// Polynomial evaluation using second order Horners rule
#ifndef BOOST_MATH_TOOLS_RAT_EVAL_19_HPP
#define BOOST_MATH_TOOLS_RAT_EVAL_19_HPP
namespace boost{ namespace math{ namespace tools{ namespace detail{
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T*, const U*, const V&, const std::integral_constant<int, 0>*) BOOST_MATH_NOEXCEPT(V)
{
return static_cast<V>(0);
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V&, const std::integral_constant<int, 1>*) BOOST_MATH_NOEXCEPT(V)
{
return static_cast<V>(a[0]) / static_cast<V>(b[0]);
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 2>*) BOOST_MATH_NOEXCEPT(V)
{
return static_cast<V>((a[1] * x + a[0]) / (b[1] * x + b[0]));
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 3>*) BOOST_MATH_NOEXCEPT(V)
{
return static_cast<V>(((a[2] * x + a[1]) * x + a[0]) / ((b[2] * x + b[1]) * x + b[0]));
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 4>*) BOOST_MATH_NOEXCEPT(V)
{
return static_cast<V>((((a[3] * x + a[2]) * x + a[1]) * x + a[0]) / (((b[3] * x + b[2]) * x + b[1]) * x + b[0]));
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 5>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[4] * x2 + a[2];
t[1] = a[3] * x2 + a[1];
t[2] = b[4] * x2 + b[2];
t[3] = b[3] * x2 + b[1];
t[0] *= x2;
t[2] *= x2;
t[0] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[0]);
t[1] *= x;
t[3] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[2] *= z2;
t[0] += static_cast<V>(a[4]);
t[2] += static_cast<V>(b[4]);
t[1] *= z;
t[3] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 6>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[5] * x2 + a[3];
t[1] = a[4] * x2 + a[2];
t[2] = b[5] * x2 + b[3];
t[3] = b[4] * x2 + b[2];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[1]);
t[1] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[1]);
t[3] += static_cast<V>(b[0]);
t[0] *= x;
t[2] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z;
t[2] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 7>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[6] * x2 + a[4];
t[1] = a[5] * x2 + a[3];
t[2] = b[6] * x2 + b[4];
t[3] = b[5] * x2 + b[3];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[2]);
t[1] += static_cast<V>(a[1]);
t[2] += static_cast<V>(b[2]);
t[3] += static_cast<V>(b[1]);
t[0] *= x2;
t[2] *= x2;
t[0] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[0]);
t[1] *= x;
t[3] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[2] *= z2;
t[0] += static_cast<V>(a[6]);
t[2] += static_cast<V>(b[6]);
t[1] *= z;
t[3] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 8>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[7] * x2 + a[5];
t[1] = a[6] * x2 + a[4];
t[2] = b[7] * x2 + b[5];
t[3] = b[6] * x2 + b[4];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[3]);
t[1] += static_cast<V>(a[2]);
t[2] += static_cast<V>(b[3]);
t[3] += static_cast<V>(b[2]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[1]);
t[1] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[1]);
t[3] += static_cast<V>(b[0]);
t[0] *= x;
t[2] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z;
t[2] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 9>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[8] * x2 + a[6];
t[1] = a[7] * x2 + a[5];
t[2] = b[8] * x2 + b[6];
t[3] = b[7] * x2 + b[5];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[3]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[3]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[2]);
t[1] += static_cast<V>(a[1]);
t[2] += static_cast<V>(b[2]);
t[3] += static_cast<V>(b[1]);
t[0] *= x2;
t[2] *= x2;
t[0] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[0]);
t[1] *= x;
t[3] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[2] *= z2;
t[0] += static_cast<V>(a[8]);
t[2] += static_cast<V>(b[8]);
t[1] *= z;
t[3] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 10>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[9] * x2 + a[7];
t[1] = a[8] * x2 + a[6];
t[2] = b[9] * x2 + b[7];
t[3] = b[8] * x2 + b[6];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[5]);
t[1] += static_cast<V>(a[4]);
t[2] += static_cast<V>(b[5]);
t[3] += static_cast<V>(b[4]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[3]);
t[1] += static_cast<V>(a[2]);
t[2] += static_cast<V>(b[3]);
t[3] += static_cast<V>(b[2]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[1]);
t[1] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[1]);
t[3] += static_cast<V>(b[0]);
t[0] *= x;
t[2] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z;
t[2] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 11>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[10] * x2 + a[8];
t[1] = a[9] * x2 + a[7];
t[2] = b[10] * x2 + b[8];
t[3] = b[9] * x2 + b[7];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[5]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[3]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[3]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[2]);
t[1] += static_cast<V>(a[1]);
t[2] += static_cast<V>(b[2]);
t[3] += static_cast<V>(b[1]);
t[0] *= x2;
t[2] *= x2;
t[0] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[0]);
t[1] *= x;
t[3] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z2;
t[2] *= z2;
t[0] += static_cast<V>(a[10]);
t[2] += static_cast<V>(b[10]);
t[1] *= z;
t[3] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 12>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[11] * x2 + a[9];
t[1] = a[10] * x2 + a[8];
t[2] = b[11] * x2 + b[9];
t[3] = b[10] * x2 + b[8];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[7]);
t[1] += static_cast<V>(a[6]);
t[2] += static_cast<V>(b[7]);
t[3] += static_cast<V>(b[6]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[5]);
t[1] += static_cast<V>(a[4]);
t[2] += static_cast<V>(b[5]);
t[3] += static_cast<V>(b[4]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[3]);
t[1] += static_cast<V>(a[2]);
t[2] += static_cast<V>(b[3]);
t[3] += static_cast<V>(b[2]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[1]);
t[1] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[1]);
t[3] += static_cast<V>(b[0]);
t[0] *= x;
t[2] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[11]);
t[0] *= z;
t[2] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 13>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[12] * x2 + a[10];
t[1] = a[11] * x2 + a[9];
t[2] = b[12] * x2 + b[10];
t[3] = b[11] * x2 + b[9];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[7]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[5]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[3]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[3]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[2]);
t[1] += static_cast<V>(a[1]);
t[2] += static_cast<V>(b[2]);
t[3] += static_cast<V>(b[1]);
t[0] *= x2;
t[2] *= x2;
t[0] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[0]);
t[1] *= x;
t[3] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[11]);
t[0] *= z2;
t[2] *= z2;
t[0] += static_cast<V>(a[12]);
t[2] += static_cast<V>(b[12]);
t[1] *= z;
t[3] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 14>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[13] * x2 + a[11];
t[1] = a[12] * x2 + a[10];
t[2] = b[13] * x2 + b[11];
t[3] = b[12] * x2 + b[10];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[9]);
t[1] += static_cast<V>(a[8]);
t[2] += static_cast<V>(b[9]);
t[3] += static_cast<V>(b[8]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[7]);
t[1] += static_cast<V>(a[6]);
t[2] += static_cast<V>(b[7]);
t[3] += static_cast<V>(b[6]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[5]);
t[1] += static_cast<V>(a[4]);
t[2] += static_cast<V>(b[5]);
t[3] += static_cast<V>(b[4]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[3]);
t[1] += static_cast<V>(a[2]);
t[2] += static_cast<V>(b[3]);
t[3] += static_cast<V>(b[2]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[1]);
t[1] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[1]);
t[3] += static_cast<V>(b[0]);
t[0] *= x;
t[2] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[11]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[12]);
t[1] += static_cast<V>(a[13]);
t[2] += static_cast<V>(b[12]);
t[3] += static_cast<V>(b[13]);
t[0] *= z;
t[2] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 15>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[14] * x2 + a[12];
t[1] = a[13] * x2 + a[11];
t[2] = b[14] * x2 + b[12];
t[3] = b[13] * x2 + b[11];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[9]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[7]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[5]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[3]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[3]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[2]);
t[1] += static_cast<V>(a[1]);
t[2] += static_cast<V>(b[2]);
t[3] += static_cast<V>(b[1]);
t[0] *= x2;
t[2] *= x2;
t[0] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[0]);
t[1] *= x;
t[3] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[11]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[12]);
t[1] += static_cast<V>(a[13]);
t[2] += static_cast<V>(b[12]);
t[3] += static_cast<V>(b[13]);
t[0] *= z2;
t[2] *= z2;
t[0] += static_cast<V>(a[14]);
t[2] += static_cast<V>(b[14]);
t[1] *= z;
t[3] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 16>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[15] * x2 + a[13];
t[1] = a[14] * x2 + a[12];
t[2] = b[15] * x2 + b[13];
t[3] = b[14] * x2 + b[12];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[11]);
t[1] += static_cast<V>(a[10]);
t[2] += static_cast<V>(b[11]);
t[3] += static_cast<V>(b[10]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[9]);
t[1] += static_cast<V>(a[8]);
t[2] += static_cast<V>(b[9]);
t[3] += static_cast<V>(b[8]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[7]);
t[1] += static_cast<V>(a[6]);
t[2] += static_cast<V>(b[7]);
t[3] += static_cast<V>(b[6]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[5]);
t[1] += static_cast<V>(a[4]);
t[2] += static_cast<V>(b[5]);
t[3] += static_cast<V>(b[4]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[3]);
t[1] += static_cast<V>(a[2]);
t[2] += static_cast<V>(b[3]);
t[3] += static_cast<V>(b[2]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[1]);
t[1] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[1]);
t[3] += static_cast<V>(b[0]);
t[0] *= x;
t[2] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[11]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[12]);
t[1] += static_cast<V>(a[13]);
t[2] += static_cast<V>(b[12]);
t[3] += static_cast<V>(b[13]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[14]);
t[1] += static_cast<V>(a[15]);
t[2] += static_cast<V>(b[14]);
t[3] += static_cast<V>(b[15]);
t[0] *= z;
t[2] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 17>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[16] * x2 + a[14];
t[1] = a[15] * x2 + a[13];
t[2] = b[16] * x2 + b[14];
t[3] = b[15] * x2 + b[13];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[12]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[12]);
t[3] += static_cast<V>(b[11]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[9]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[7]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[5]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[3]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[3]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[2]);
t[1] += static_cast<V>(a[1]);
t[2] += static_cast<V>(b[2]);
t[3] += static_cast<V>(b[1]);
t[0] *= x2;
t[2] *= x2;
t[0] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[0]);
t[1] *= x;
t[3] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[11]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[12]);
t[1] += static_cast<V>(a[13]);
t[2] += static_cast<V>(b[12]);
t[3] += static_cast<V>(b[13]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[14]);
t[1] += static_cast<V>(a[15]);
t[2] += static_cast<V>(b[14]);
t[3] += static_cast<V>(b[15]);
t[0] *= z2;
t[2] *= z2;
t[0] += static_cast<V>(a[16]);
t[2] += static_cast<V>(b[16]);
t[1] *= z;
t[3] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 18>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[17] * x2 + a[15];
t[1] = a[16] * x2 + a[14];
t[2] = b[17] * x2 + b[15];
t[3] = b[16] * x2 + b[14];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[13]);
t[1] += static_cast<V>(a[12]);
t[2] += static_cast<V>(b[13]);
t[3] += static_cast<V>(b[12]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[11]);
t[1] += static_cast<V>(a[10]);
t[2] += static_cast<V>(b[11]);
t[3] += static_cast<V>(b[10]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[9]);
t[1] += static_cast<V>(a[8]);
t[2] += static_cast<V>(b[9]);
t[3] += static_cast<V>(b[8]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[7]);
t[1] += static_cast<V>(a[6]);
t[2] += static_cast<V>(b[7]);
t[3] += static_cast<V>(b[6]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[5]);
t[1] += static_cast<V>(a[4]);
t[2] += static_cast<V>(b[5]);
t[3] += static_cast<V>(b[4]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[3]);
t[1] += static_cast<V>(a[2]);
t[2] += static_cast<V>(b[3]);
t[3] += static_cast<V>(b[2]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[1]);
t[1] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[1]);
t[3] += static_cast<V>(b[0]);
t[0] *= x;
t[2] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[11]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[12]);
t[1] += static_cast<V>(a[13]);
t[2] += static_cast<V>(b[12]);
t[3] += static_cast<V>(b[13]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[14]);
t[1] += static_cast<V>(a[15]);
t[2] += static_cast<V>(b[14]);
t[3] += static_cast<V>(b[15]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[16]);
t[1] += static_cast<V>(a[17]);
t[2] += static_cast<V>(b[16]);
t[3] += static_cast<V>(b[17]);
t[0] *= z;
t[2] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const std::integral_constant<int, 19>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[18] * x2 + a[16];
t[1] = a[17] * x2 + a[15];
t[2] = b[18] * x2 + b[16];
t[3] = b[17] * x2 + b[15];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[14]);
t[1] += static_cast<V>(a[13]);
t[2] += static_cast<V>(b[14]);
t[3] += static_cast<V>(b[13]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[12]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[12]);
t[3] += static_cast<V>(b[11]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[9]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[7]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[5]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[3]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[3]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[2]);
t[1] += static_cast<V>(a[1]);
t[2] += static_cast<V>(b[2]);
t[3] += static_cast<V>(b[1]);
t[0] *= x2;
t[2] *= x2;
t[0] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[0]);
t[1] *= x;
t[3] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[11]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[12]);
t[1] += static_cast<V>(a[13]);
t[2] += static_cast<V>(b[12]);
t[3] += static_cast<V>(b[13]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[14]);
t[1] += static_cast<V>(a[15]);
t[2] += static_cast<V>(b[14]);
t[3] += static_cast<V>(b[15]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[16]);
t[1] += static_cast<V>(a[17]);
t[2] += static_cast<V>(b[16]);
t[3] += static_cast<V>(b[17]);
t[0] *= z2;
t[2] *= z2;
t[0] += static_cast<V>(a[18]);
t[2] += static_cast<V>(b[18]);
t[1] *= z;
t[3] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
}}}} // namespaces
#endif // include guard
```
|
The Donegal Progressive Party was a minor political party in the Republic of Ireland.
The party drew its support mostly from the unionist and Protestant community in eastern County Donegal. It was opposed to a united Ireland. At the 1973 general election, the party's leader advised Protestants to vote for Fianna Fáil, as it had "the most stable policy" on the border question. Throughout the 1980s and 90s, the party held a single seat on Donegal County Council, but it lost this at the 1999 local elections.
Jim Devenney, a butcher and member of the East Donegal Ulster Scots Association and the former deputy chairman of the Ulster-Scots Agency, was the party's final representative, also contested Donegal North-East at the 1992 and 1997 general elections, and stood in Letterkenny again in 2004. The party was removed from the Register of Political Parties in November 2009.
Elections
Dáil Éireann
Local elections (Donegal County Council)
References
Unionism in Ireland
Defunct political parties in the Republic of Ireland
Political parties disestablished in 2009
Politics of County Donegal
2009 disestablishments in Ireland
|
Abatsky District () is an administrative district (raion), one of the twenty-two in Tyumen Oblast, Russia. As a municipal division, it is incorporated as Abatsky Municipal District. It is located in the southeast of the oblast. The area of the district is . Its administrative center is the rural locality (a selo) of Abatskoye. Population: 19,837 (2010 Census); The population of Abatskoye accounts for 40.1% of the district's total population.
Geography
Abatsky District is located in the southeast of Tyumen Oblast, supporting mostly agricultural land on forest-steppe terrain of the West Siberian Plain. The district is in the Ural Federal District, on the west side of the border with the Siberian Federal District. The Ishim River runs from south to north through the middle of the district, about 130 km south of where it enters the Irtysh River to the north. The Trans-Siberian Railway runs through the middle of the district from west to east, passing through the administrative center of Abatskoye. Abatsky District is 280 km southeast of the city of Tyumen, 185 km northwest of the city of Omsk, and 2,000 km east of Moscow. The area measures 70 km (north-south), 60 km (west-east); total area is 4,080 km2 (about 0.003% of Tyumen Oblast).
The district is bordered on the north by Vikulovsky District, on the east by Krutinsky District of Omsk Oblast, on the south by Sladkovsky District, and on the west by Ishimsky District.
History
The first Russian presence was as part of a string of security posts along the Ishim River in the 1600s, as a defense against Siberian Tatars. The settlement of Abatskoye is believed to have been formed in 1695. By 1710, the population in 9 villages was reported as 177 households (473 male, 402 female individuals). Incoming settlers from central Russia were attracted to the farmland, and with involuntary conscripts added the population grew. By the 1800s, Abatskoye had become a significant crossroads market town.
The district was formally created November 12, 1923 as part of the Ishim district of the Ural region. On January 1,1932, the District abolished, and became part of Maslyansky District. On January 25,1935, the District was formed again as part of Omsk Oblast, and on August 14, 1944 by decree of the USSR Supreme Soviet Presidium, Abatsky District was included in Tyumen Oblast
References
Notes
Sources
Districts of Tyumen Oblast
|
```javascript
// '/' | '*' | ',' | ':' | '+' | '-'
export const name = 'Operator';
export const structure = {
value: String
};
export function parse() {
const start = this.tokenStart;
this.next();
return {
type: 'Operator',
loc: this.getLocation(start, this.tokenStart),
value: this.substrToCursor(start)
};
}
export function generate(node) {
this.tokenize(node.value);
}
```
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var tape = require( 'tape' );
var NINF = require( '@stdlib/constants/float32/ninf' );
var PINF = require( '@stdlib/constants/float32/pinf' );
var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
var isPositiveZerof = require( '@stdlib/math/base/assert/is-positive-zerof' );
var isNegativeZerof = require( '@stdlib/math/base/assert/is-negative-zerof' );
var flipsignf = require( './../lib' );
// FIXTURES //
var data = require( './fixtures/julia/data.json' );
// TESTS //
tape( 'main export is a function', function test( t ) {
t.ok( true, __filename );
t.strictEqual( typeof flipsignf, 'function', 'main export is a function' );
t.end();
});
tape( 'the function returns a single-precision floating-point number with the magnitude of `x` and the sign of `x*y`', function test( t ) {
var expected;
var actual;
var x;
var y;
var i;
x = data.x;
y = data.y;
expected = data.expected;
for ( i = 0; i < x.length; i++ ) {
actual = flipsignf( x[i], y[i] );
t.equal( actual, expected[i], 'returns '+expected[i] );
}
t.end();
});
tape( 'if `x` is `NaN`, the function returns `NaN`', function test( t ) {
var z;
z = flipsignf( NaN, -1.0 );
t.equal( isnanf( z ), true, 'returns NaN' );
z = flipsignf( NaN, 1.0 );
t.equal( isnanf( z ), true, 'returns NaN' );
t.end();
});
tape( 'if `y` is `NaN`, the function could (theoretically) return either a positive or negative number', function test( t ) {
var z;
z = flipsignf( -1.0, NaN );
t.equal( isnanf( z ), false, 'does not return NaN' );
z = flipsignf( 1.0, NaN );
t.equal( isnanf( z ), false, 'does not return NaN' );
t.end();
});
tape( 'if `x` is `+infinity`, the function returns an infinite number', function test( t ) {
var z;
z = flipsignf( PINF, -1.0 );
t.equal( z, NINF, 'returns -infinity' );
z = flipsignf( PINF, 1.0 );
t.equal( z, PINF, 'returns +infinity' );
t.end();
});
tape( 'if `y` is `+infinity`, the function returns `x`', function test( t ) {
var z;
z = flipsignf( -1.0, PINF );
t.equal( z, -1.0, 'returns -1' );
z = flipsignf( 1.0, PINF );
t.equal( z, 1.0, 'returns +1' );
t.end();
});
tape( 'if `x` is `-infinity`, the function returns an infinite number', function test( t ) {
var z;
z = flipsignf( NINF, -1.0 );
t.equal( z, PINF, 'returns +infinity' );
z = flipsignf( NINF, 1.0 );
t.equal( z, NINF, 'returns -infinity' );
t.end();
});
tape( 'if `y` is `-infinity`, the function returns `-x`', function test( t ) {
var z;
z = flipsignf( -1.0, NINF );
t.equal( z, +1.0, 'returns +1' );
z = flipsignf( 1.0, NINF );
t.equal( z, -1.0, 'returns -1' );
t.end();
});
tape( 'the function supports using `+-0` to flip a sign', function test( t ) {
var x;
var z;
x = 3.0;
z = flipsignf( x, 0.0 );
t.equal( z, 3.0, 'returns +3.0' );
z = flipsignf( x, -0.0 );
t.equal( z, -3.0, 'returns -3.0' );
t.end();
});
tape( 'the function supports `x` being `+-0`', function test( t ) {
var z;
z = flipsignf( -0.0, 1.0 );
t.equal( isNegativeZerof( z ), true, 'returns -0' );
z = flipsignf( -0.0, -1.0 );
t.equal( isPositiveZerof( z ), true, 'returns +0' );
z = flipsignf( 0.0, 1.0 );
t.equal( isPositiveZerof( z ), true, 'returns +0' );
z = flipsignf( 0.0, -1.0 );
t.equal( isNegativeZerof( z ), true, 'returns -0' );
t.end();
});
```
|
```c++
/*=============================================================================
path_to_url
file LICENSE_1_0.txt or copy at path_to_url
=============================================================================*/
#ifndef BOOST_SPIRIT_INCLUDE_CLASSIC_SYMBOLS_FWD
#define BOOST_SPIRIT_INCLUDE_CLASSIC_SYMBOLS_FWD
#include <boost/spirit/home/classic/symbols/symbols_fwd.hpp>
#endif
```
|
```jsx
import { h } from 'preact';
import PropTypes from 'prop-types';
export const BasicEditor = ({ openModal }) => (
<div
data-testid="basic-editor-help"
className="crayons-card crayons-card--secondary p-4 mb-6"
>
You are currently using the basic markdown editor that uses{' '}
<a href="#frontmatter" onClick={() => openModal('frontmatterShowing')}>
Jekyll front matter
</a>
. You can also use the <em>rich+markdown</em> editor you can find in{' '}
<a href="/settings/customization">
UX settings
<svg
width="24"
height="24"
viewBox="0 0 24 24"
className="crayons-icon"
xmlns="path_to_url"
role="img"
aria-labelledby="c038a36b2512ed25db907e179ab45cfc"
aria-hidden
>
<path d="M10.667 8v1.333H7.333v7.334h7.334v-3.334H16v4a.666.666 0 01-.667.667H6.667A.666.666 0 016 17.333V8.667A.667.667 0 016.667 8h4zM18 6v5.333h-1.333V8.275l-5.196 5.196-.942-.942 5.194-5.196h-3.056V6H18z" />
</svg>
</a>
.
</div>
);
BasicEditor.propTypes = {
openModal: PropTypes.func.isRequired,
};
```
|
Miss Venezuela 2015 was the 62nd edition of the Miss Venezuela pageant held on October 8, 2015 at the Estudio 1 de Venevision in Caracas, Venezuela, after weeks of events. Outgoing titleholder Mariana Jiménez of Guárico crowned Mariam Habach of Lara as her successor.
This year, Osmel Sousa publicly announced that the winner of the pageant would carry a new crown model designed by George Wittels.
On October 9, TNT Latin America aired Miss Venezuela After Party, a special coverage with the events after the coronation. This is the last year Miss Venezuela Organization crowned Miss Tierra Venezuela.
Results
Placements
Color key
Order of announcements
Top 10
Amazonas
Vargas
Yaracuy
Trujillo
Distrito Capital
Lara
Sucre
Guárico
Monagas
Zulia
Top 5
Vargas
Amazonas
Lara
Yaracuy
Trujillo
Special awards
These awards were given during the telecast of the pageant on October 8:
Gala Interactiva de la Belleza (Interactive Beauty Gala)
This event took place on September 12, 2015 co-hosted by Mariela Celis and Juan Carlos García. The following awards were given:
Miss Actitud Ésika (Ésika Miss Attitude) - María José Brito (Carabobo)
Miss Autentica (Most Authentic) - Valeria Vespoli (Monagas)
Miss Belleza Integral (Miss Integral Beauty) - Mariam Habach (Lara)
Miss Cabello Radiante Pantene (Pantene Most Beautiful Hair) - Andrea Rosales (Amazonas)
Miss Confianza (Miss Confidence) - Paula Schmidt (Guárico)
Miss Online - Jessica Duarte (Trujillo)
Miss Personalidad (Miss Personality) - Alvany Gonçalves (Bolivar)
Miss Piernas De Venus (Venus Best Legs) - Yennifer González (Zulia)
Miss Rostro L'Bel (L'Bel Most Beautiful Face) - Jessica Duarte (Trujillo)
Miss Sonrisa (Most Beautiful Smile) - Katherine Oliveira (Distrito Capital)
Miss Tecnologia (Miss Technology) - Mariana Méndez (Anzoátegui)
Pageant
Selection committee
Final telecast
There were eleven personalities in charge of electing the new Miss Venezuela.
Mirla Castellanos – Venezuelan singer
Nina Sicilia – Miss International 1985
Alyz Henrich – Miss Earth 2013
Giovanni Scutaro – Fashion designer
Manuel Sáinz – Venezuelan journalist
Bob Abreu – Venezuelan professional baseball player
Laura Vieira - Venezuelan journalist
George Wittels – Jewelry designer
Alejandro Betancourt – Director of Communications P&G Venezuela
Rahul Shrivastava – Ambassador of India in Venezuela
Daniel Elbittar – Venezuelan actor
Contestants
Notes
Mariam Habach unplaced in Miss Universe 2016 in Pasay, Metro Manila, Philippines.
Jessica Duarte unplaced in Miss International 2016 in Tokyo, Japan.
Andrea Rosales placed as Top 8 in Miss Earth 2015 in Vienna, Austria.
Valeria Vespoli (Monagas) placed as 1st Runner-up in Miss Supranational 2016 in Krynica-Zdrój, Poland.
Maydeliana Díaz (Sucre) won Reinado Internacional del Café 2016 in Manizales, Colombia.
Ana Cristina Díaz (Mérida) placed as 4th Runner-up in Reinado Internacional del Café 2017 in Manizales, Colombia.
Katherine García (Miranda) placed as 3rd Runner-up in Miss Intercontinental 2015 in Magdebourg, Germany.
References
External links
Miss Venezuela Official Website
Miss Venezuela
Venezuela
2015 in Venezuela
|
```java
Collections vs arrays
Multidimensional array declaration
Equals operation on different data types
Retrieve the component type of an array
Do not attempt comparisons with NaN
```
|
Sulfite oxidase () is an enzyme in the mitochondria of all eukaryotes, with exception of the yeasts. It oxidizes sulfite to sulfate and, via cytochrome c, transfers the electrons produced to the electron transport chain, allowing generation of ATP in oxidative phosphorylation. This is the last step in the metabolism of sulfur-containing compounds and the sulfate is excreted.
Sulfite oxidase is a metallo-enzyme that utilizes a molybdopterin cofactor and a heme group (in a case of animals). It is one of the cytochromes b5 and belongs to the enzyme super-family of molybdenum oxotransferases that also includes DMSO reductase, xanthine oxidase, and nitrite reductase.
In mammals, the expression levels of sulfite oxidase is high in the liver, kidney, and heart, and very low in spleen, brain, skeletal muscle, and blood.
Structure
As a homodimer, sulfite oxidase contains two identical subunits with an N-terminal domain and a C-terminal domain. These two domains are connected by ten amino acids forming a loop. The N-terminal domain has a heme cofactor with three adjacent antiparallel beta sheets and five alpha helices. The C-terminal domain hosts a molybdopterin cofactor that is surrounded by thirteen beta sheets and three alpha helices. The molybdopterin cofactor has a Mo(VI) center, which is bonded to a sulfur from cysteine, an ene-dithiolate from pyranopterin, and two terminal oxygens. It is at this molybdenum center that the catalytic oxidation of sulfite takes place.
The pyranopterin ligand which coordinates the molybdenum centre via the enedithiolate. The molybdenum centre has a square pyramidal geometry and is distinguished from the xanthine oxidase family by the orientation of the oxo group facing downwards rather than up.
Active site and mechanism
The active site of sulfite oxidase contains the molybdopterin cofactor and supports molybdenum in its highest oxidation state, +6 (MoVI). In the enzyme's oxidized state, molybdenum is coordinated by a cysteine thiolate, the dithiolene group of molybdopterin, and two terminal oxygen atoms (oxos). Upon reacting with sulfite, one oxygen atom is transferred to sulfite to produce sulfate, and the molybdenum center is reduced by two electrons to MoIV. Water then displaces sulfate, and the removal of two protons (H+) and two electrons (e−) returns the active site to its original state. A key feature of this oxygen atom transfer enzyme is that the oxygen atom being transferred arises from water, not from dioxygen (O2).
Electrons are passed one at a time from the molybdenum to the heme group which reacts with cytochrome c to reoxidize the enzyme. The electrons from this reaction enter the electron transport chain (ETC).
This reaction is generally the rate limiting reaction. Upon reaction of the enzyme with sulfite, it is reduced by 2 electrons. The negative potential seen with re-reduction of the enzyme shows the oxidized state is favoured.
Among the Mo enzyme classes, sulfite oxidase is the most easily oxidized. Although under low pH conditions the oxidative reaction become partially rate limiting.
Deficiency
Sulfite oxidase is required to metabolize the sulfur-containing amino acids cysteine and methionine in foods. Lack of functional sulfite oxidase causes a disease known as sulfite oxidase deficiency. This rare but fatal disease causes neurological disorders, mental retardation, physical deformities, the degradation of the brain, and death. Reasons for the lack of functional sulfite oxidase include a genetic defect that leads to the absence of a molybdopterin cofactor and point mutations in the enzyme. A G473D mutation impairs dimerization and catalysis in human sulfite oxidase.
See also
Sulfur metabolism
Bioinorganic chemistry
References
Further reading
Kisker, C. “Sulfite oxidase”, Messerschimdt, A.; Huber, R.; Poulos, T.; Wieghardt, K.; eds. Handbook of Metalloproteins, vol 2; John Wiley and Sons, Ltd: New York, 2002
External links
Research Activity of Sarkar Group
PDBe-KB provides an overview of all the structure information available in the PDB for Human Sulfite oxidase, mitochondrial
EC 1.8.3
Metalloproteins
Molybdenum compounds
|
Géraldine Pailhas (born 8 January 1971) is a French actress. She had her first international success in the 1995 romantic comedy-drama film Don Juan DeMarco. Pailhas is married to fellow actor Christopher Thompson and has two children. In 2003, she was the main presenter at the César Awards ceremony.
Selected filmography
Awards
1992: César Award for Most Promising Actress La neige et le feu.
2001: Best TV actress at "Festival de la fiction TV" in Saint Tropez for L'Héritière
2004: Nomination as César Award for Best Actress in a Supporting Role for Le coût de la vie.
References
External links
Biography
1971 births
Living people
Actresses from Marseille
French film actresses
French stage actresses
French television actresses
21st-century French actresses
20th-century French actresses
Most Promising Actress César Award winners
|
```objective-c
/*
* The contents of this file are subject to the Initial
* you may not use this file except in compliance with the
* path_to_url
*
* WITHOUT WARRANTY OF ANY KIND, either express or implied.
*
* The Original Code was created by Claudio Valderrama on 10-Jul-2009
* for the Firebird Open Source RDBMS project.
*
* and all contributors signed below.
*
* All Rights Reserved.
* Contributor(s): ______________________________________.
*
*/
// Centralized code to handle command line arguments.
#ifndef CLASSES_SWITCHES
#define CLASSES_SWITCHES
#include "firebird.h"
#include "../common/classes/fb_string.h"
class Switches
{
public:
// switch name and state table. This structure should be used in all
// command line tools to facilitate parsing options.
struct in_sw_tab_t
{
int in_sw; // key of the entry; never zero for valid items
int in_spb_sw; // value of service SPB item, if applicable
const TEXT* in_sw_name; // name of the option to check against an argument
SINT64 in_sw_value; // alice specific field
SINT64 in_sw_requires; // alice specific field
SINT64 in_sw_incompatibilities; // alice specific field
bool in_sw_state; // burp specific field: was the item found in the arguments?
bool in_sw_option; // the switch is transmitted by services API in isc_spb_options
USHORT in_sw_msg; // msg # in the msg db for the respective facility, if any
USHORT in_sw_min_length; // minimal length of an option; set for a whole table
// or leave as zero for the whole table (one char matches)
const TEXT* in_sw_text; // dudley and gpre specific field: hardcoded explanation
// for the option; prefer in_sw_msg for localized strings.
int in_sw_optype; // some utilities have options that fit into categories
// to be shown in the built-in help for more clarity.
// Some compilers may produce warnings because I only initialized this field in gbak and nbackup
};
// Take a switches table, the number of elements (assume the last elem is a terminator),
// whether to copy the table to a modifiable internal table and if there's a minimal length for
// each option (in other case it checks the first letter of an option).
// Additionally it precalculates the options' lengths and checks that their minimal lengths
// are valid (cannot be bigger than the whole string).
Switches(const in_sw_tab_t* table, FB_SIZE_T count, bool copy, bool minLength);
~Switches();
// Given an argument, try to locate it in the table's in_sw_name data member. Empty strings
// and strings that don't start by an hyphen are discarded silently (function returns NULL).
// Strings prefixed by an hyphen that are not found cause invalidSwitchInd to be activated
// if the pointer is provided.
const in_sw_tab_t* findSwitch(Firebird::string sw, bool* invalidSwitchInd = 0) const;
// Same as the previous, but it returns a modifiable item. Beware it throws system_call_failed
// if "copy" was false in the constructor (no modifiable table was created).
in_sw_tab_t* findSwitchMod(Firebird::string& sw, bool* invalidSwitchInd = 0);
// Get the same unmodifiable table that was passed as parameter to the constructor.
const in_sw_tab_t* getTable() const;
// Retrieve the modifiable copy of the table that was passed as parameter to the constructor.
// It throws system_call_failed if "copy" was false in the constructor.
in_sw_tab_t* getTableMod();
// Looks for an item by key (data member in_sw) and sets its in_sw_state to true.
// It throws system_call_failed if "copy" was false in the constructor or if the key is
// not found or it's negative or zero.
void activate(const int in_sw);
// Checks if an item by key exists in a list of strings that represent the set of command-line
// arguments. This is more eficient than finding the key for each parameter and then checking
// if it's the one we want (we reduce loop from Nkeys*Nargs to Nkeys+Nargs in the worst case).
// It throws system_call_failed if the key is not found or it's negative or zero.
bool exists(const int in_sw, const char* const* argv, const int start, const int stop) const;
// Returns the switch's default text given the switch's numeric value (tag).
// (There may be more than one spelling for the same switch.)
// Will throw system_call_failed if tag is not found.
const char* findNameByTag(const int in_sw) const;
private:
// Auxiliar function for findSwitch, findSwitchMod and exists().
static bool matchSwitch(const Firebird::string& sw, const char* target, FB_SIZE_T n);
// Auxiliar function for exists().
const in_sw_tab_t* findByTag(const int in_sw, FB_SIZE_T* pos = 0, bool rejectAmbiguity = true) const;
// Shortcut to raise exceptions
static void complain(const char* msg);
const in_sw_tab_t* const m_base; // pointer to the original table
const FB_SIZE_T m_count; // count of elements (terminator element included)
const bool m_copy; // was m_base copied into m_table for modifications?
const bool m_minLength; // is the field in_sw_min_length meaningful?
in_sw_tab_t* m_table; // modifiable copy
FB_SIZE_T* m_opLengths; // array of in_sw_name's lengths to avoid recalculation
};
#endif // CLASSES_SWITCHES
```
|
```objective-c
//
// UIView+SDAutoLayout.h
//
// Created by gsd on 15/10/6.
//
/*
*************************************************************************
--------- INTRODUCTION ---------
USAGE:
MODE 1. >>>>>>>>>>>>>>> You can use it in this way:
Demo.sd_layout
.topSpaceToView(v1, 100)
.bottomSpaceToView(v3, 100)
.leftSpaceToView(v0, 150)
.rightSpaceToView(v2, 150);
MODE 2. >>>>>>>>>>>>>>> You can also use it in this way that is more brevity:
Demo.sd_layout.topSpaceToView(v1, 100).bottomSpaceToView(v3, 100).leftSpaceToView(v0, 150).rightSpaceToView(v2, 150);
*************************************************************************
*/
/*
*********************************************************************************
*
* bugbug
*
* QQ : 2689718696(gsdios)
* Email : gsdios@126.com
* GitHub: path_to_url
* :GSD_iOS
*
* path_to_url
* path_to_url
*
*********************************************************************************
SDAutoLayout
2.1.3
2016.07.06
*/
//
//#define SDDebugWithAssert
#import <UIKit/UIKit.h>
@class SDAutoLayoutModel, SDUIViewCategoryManager;
typedef SDAutoLayoutModel *(^MarginToView)(id viewOrViewsArray, CGFloat value);
typedef SDAutoLayoutModel *(^Margin)(CGFloat value);
typedef SDAutoLayoutModel *(^MarginEqualToView)(UIView *toView);
typedef SDAutoLayoutModel *(^WidthHeight)(CGFloat value);
typedef SDAutoLayoutModel *(^WidthHeightEqualToView)(UIView *toView, CGFloat ratioValue);
typedef SDAutoLayoutModel *(^AutoHeight)(CGFloat ratioValue);
typedef SDAutoLayoutModel *(^SameWidthHeight)();
typedef SDAutoLayoutModel *(^Offset)(CGFloat value);
typedef void (^SpaceToSuperView)(UIEdgeInsets insets);
@interface SDAutoLayoutModel : NSObject
/*
*************************************************
SpaceToView2UIViewview CGFloat
RatioToView2UIViewview CGFloat
EqualToView1UIViewview
Is1CGFloat
*****************************************************
*/
/* view */
/** view(View view, CGFloat) */
@property (nonatomic, copy, readonly) MarginToView leftSpaceToView;
/** view(View, CGFloat) */
@property (nonatomic, copy, readonly) MarginToView rightSpaceToView;
/** view(View view, CGFloat) */
@property (nonatomic, copy, readonly) MarginToView topSpaceToView;
/** view(View, CGFloat) */
@property (nonatomic, copy, readonly) MarginToView bottomSpaceToView;
/* xywidthheightcenterXcenterY */
/** x(CGFloat) */
@property (nonatomic, copy, readonly) Margin xIs;
/** y(CGFloat) */
@property (nonatomic, copy, readonly) Margin yIs;
/** centerX(CGFloat) */
@property (nonatomic, copy, readonly) Margin centerXIs;
/** centerY(CGFloat) */
@property (nonatomic, copy, readonly) Margin centerYIs;
/** (CGFloat) */
@property (nonatomic, copy, readonly) WidthHeight widthIs;
/** (CGFloat) */
@property (nonatomic, copy, readonly) WidthHeight heightIs;
/* */
/** (CGFloat) */
@property (nonatomic, copy, readonly) WidthHeight maxWidthIs;
/** (CGFloat) */
@property (nonatomic, copy, readonly) WidthHeight maxHeightIs;
/** (CGFloat) */
@property (nonatomic, copy, readonly) WidthHeight minWidthIs;
/** (CGFloat) */
@property (nonatomic, copy, readonly) WidthHeight minHeightIs;
/* view */
/** view(View) */
@property (nonatomic, copy, readonly) MarginEqualToView leftEqualToView;
/** view(View) */
@property (nonatomic, copy, readonly) MarginEqualToView rightEqualToView;
/** view(View) */
@property (nonatomic, copy, readonly) MarginEqualToView topEqualToView;
/** view(View) */
@property (nonatomic, copy, readonly) MarginEqualToView bottomEqualToView;
/** centerXview(View) */
@property (nonatomic, copy, readonly) MarginEqualToView centerXEqualToView;
/** centerYview(View) */
@property (nonatomic, copy, readonly) MarginEqualToView centerYEqualToView;
/* view */
/** view(View, CGFloat) */
@property (nonatomic, copy, readonly) WidthHeightEqualToView widthRatioToView;
/** view(View, CGFloat) */
@property (nonatomic, copy, readonly) WidthHeightEqualToView heightRatioToView;
/** view() */
@property (nonatomic, copy, readonly) SameWidthHeight widthEqualToHeight;
/** view() */
@property (nonatomic, copy, readonly) SameWidthHeight heightEqualToWidth;
/** label0 */
@property (nonatomic, copy, readonly) AutoHeight autoHeightRatio;
/* view() */
/** UIEdgeInsetsMake(top, left, bottom, right)viewview */
@property (nonatomic, copy, readonly) SpaceToSuperView spaceToSuperView;
/** (CGFloat value)equalToViewoffset */
@property (nonatomic, copy, readonly) Offset offset;
@property (nonatomic, weak) UIView *needsAutoResizeView;
@end
#pragma mark - UIView
@interface UIView (SDAutoHeightWidth)
/** Cellview */
- (void)setupAutoHeightWithBottomView:(UIView *)bottomView bottomMargin:(CGFloat)bottomMargin;
/** view */
- (void)setupAutoWidthWithRightView:(UIView *)rightView rightMargin:(CGFloat)rightMargin;
/** CellviewviewbottomViewview */
- (void)setupAutoHeightWithBottomViewsArray:(NSArray *)bottomViewsArray bottomMargin:(CGFloat)bottomMargin;
/** viewframe */
- (void)updateLayout;
/** cellcell,cell frame */
- (void)updateLayoutWithCellContentView:(UIView *)cellContentView;
/** */
- (void)clearAutoHeigtSettings;
/** */
- (void)clearAutoWidthSettings;
@property (nonatomic) CGFloat autoHeight;
@property (nonatomic, readonly) SDUIViewCategoryManager *sd_categoryManager;
@property (nonatomic, readonly) NSMutableArray *sd_bottomViewsArray;
@property (nonatomic) CGFloat sd_bottomViewBottomMargin;
@property (nonatomic) NSArray *sd_rightViewsArray;
@property (nonatomic) CGFloat sd_rightViewRightMargin;
@end
#pragma mark - UIView block
@interface UIView (SDLayoutExtention)
/** blockviewframe */
@property (nonatomic) void (^didFinishAutoLayoutBlock)(CGRect frame);
/** view */
- (void)sd_addSubviews:(NSArray *)subviews;
/* */
/** */
@property (nonatomic, strong) NSNumber *sd_cornerRadius;
/** view */
@property (nonatomic, strong) NSNumber *sd_cornerRadiusFromWidthRatio;
/** view */
@property (nonatomic, strong) NSNumber *sd_cornerRadiusFromHeightRatio;
/** viewview */
@property (nonatomic, strong) NSArray *sd_equalWidthSubviews;
@end
#pragma mark - UIView
@interface UIView (SDAutoFlowItems)
/**
* collectionViewview
* viewsArray :
* perRowItemsCount :
* verticalMargin :
* horizontalMargin :
* vInset :
* hInset :
*/
- (void)setupAutoWidthFlowItems:(NSArray *)viewsArray withPerRowItemsCount:(NSInteger)perRowItemsCount verticalMargin:(CGFloat)verticalMargin horizontalMargin:(CGFloat)horizontalMagin verticalEdgeInset:(CGFloat)vInset horizontalEdgeInset:(CGFloat)hInset;
/** view */
- (void)clearAutoWidthFlowItemsSettings;
/**
* collectionViewview
* viewsArray :
* perRowItemsCount :
* verticalMargin :
* vInset :
* hInset :
*/
- (void)setupAutoMarginFlowItems:(NSArray *)viewsArray withPerRowItemsCount:(NSInteger)perRowItemsCount itemWidth:(CGFloat)itemWidth verticalMargin:(CGFloat)verticalMargin verticalEdgeInset:(CGFloat)vInset horizontalEdgeInset:(CGFloat)hInset;
/** view */
- (void)clearAutoMarginFlowItemsSettings;
@end
#pragma mark - UIView viewcellframe
@interface UIView (SDAutoLayout)
/** */
- (SDAutoLayoutModel *)sd_layout;
/** (view) */
- (SDAutoLayoutModel *)sd_resetLayout;
/** (view) */
- (SDAutoLayoutModel *)sd_resetNewLayout;
/** */
@property (nonatomic, getter = sd_isClosingAotuLayout) BOOL sd_closeAotuLayout;
/** view */
- (void)removeFromSuperviewAndClearAutoLayoutSettings;
/** */
- (void)sd_clearAutoLayoutSettings;
/** framecell */
- (void)sd_clearViewFrameCache;
/** subviewsframe(frame) */
- (void)sd_clearSubviewsAutoLayoutFrameCaches;
/** */
@property (nonatomic, strong) NSNumber *fixedWidth;
/** */
@property (nonatomic, strong) NSNumber *fixedHeight;
/** cell framecell, cellview */
- (void)useCellFrameCacheWithIndexPath:(NSIndexPath *)indexPath tableView:(UITableView *)tableview;
/** tableviewcellview */
@property (nonatomic) UITableView *sd_tableView;
/** cellindexPathcellcellview */
@property (nonatomic) NSIndexPath *sd_indexPath;
- (NSMutableArray *)autoLayoutModelsArray;
- (void)addAutoLayoutModel:(SDAutoLayoutModel *)model;
@property (nonatomic) SDAutoLayoutModel *ownLayoutModel;
@property (nonatomic, strong) NSNumber *sd_maxWidth;
@property (nonatomic, strong) NSNumber *autoHeightRatioValue;
@end
#pragma mark - UIScrollView
@interface UIScrollView (SDAutoContentSize)
/** scrollview */
- (void)setupAutoContentSizeWithBottomView:(UIView *)bottomView bottomMargin:(CGFloat)bottomMargin;
/** scrollview */
- (void)setupAutoContentSizeWithRightView:(UIView *)rightView rightMargin:(CGFloat)rightMargin;
@end
#pragma mark - UILabel label label
@interface UILabel (SDLabelAutoResize)
/** attributedString */
@property (nonatomic) BOOL isAttributedContent;
/** label */
- (void)setSingleLineAutoResizeWithMaxWidth:(CGFloat)maxWidth;
/** label0 */
- (void)setMaxNumberOfLinesToShow:(NSInteger)lineCount;
@end
#pragma mark - UIButton button
@interface UIButton (SDExtention)
/*
* button
* hPadding
*/
- (void)setupAutoSizeWithHorizontalPadding:(CGFloat)hPadding buttonHeight:(CGFloat)buttonHeight;
@end
#pragma mark -
@interface SDAutoLayoutModelItem : NSObject
@property (nonatomic, strong) NSNumber *value;
@property (nonatomic, weak) UIView *refView;
@property (nonatomic, assign) CGFloat offset;
@property (nonatomic, strong) NSArray *refViewsArray;
@end
@interface UIView (SDChangeFrame)
@property (nonatomic) BOOL shouldReadjustFrameBeforeStoreCache;
@property (nonatomic) CGFloat left_sd;
@property (nonatomic) CGFloat top_sd;
@property (nonatomic) CGFloat right_sd;
@property (nonatomic) CGFloat bottom_sd;
@property (nonatomic) CGFloat centerX_sd;
@property (nonatomic) CGFloat centerY_sd;
@property (nonatomic) CGFloat width_sd;
@property (nonatomic) CGFloat height_sd;
@property (nonatomic) CGPoint origin_sd;
@property (nonatomic) CGSize size_sd;
//
@property (nonatomic) CGFloat left;
@property (nonatomic) CGFloat top;
@property (nonatomic) CGFloat right;
@property (nonatomic) CGFloat bottom;
@property (nonatomic) CGFloat centerX;
@property (nonatomic) CGFloat centerY;
@property (nonatomic) CGFloat width;
@property (nonatomic) CGFloat height;
@property (nonatomic) CGPoint origin;
@property (nonatomic) CGSize size;
@end
@interface SDUIViewCategoryManager : NSObject
@property (nonatomic, strong) NSArray *rightViewsArray;
@property (nonatomic, assign) CGFloat rightViewRightMargin;
@property (nonatomic, weak) UITableView *sd_tableView;
@property (nonatomic, strong) NSIndexPath *sd_indexPath;
@property (nonatomic, assign) BOOL hasSetFrameWithCache;
@property (nonatomic) BOOL shouldReadjustFrameBeforeStoreCache;
@property (nonatomic, assign, getter = sd_isClosingAotuLayout) BOOL sd_closeAotuLayout;
/** collectionViewview */
@property (nonatomic, strong) NSArray *flowItems;
@property (nonatomic, assign) CGFloat verticalMargin;
@property (nonatomic, assign) CGFloat horizontalMargin;
@property (nonatomic, assign) NSInteger perRowItemsCount;
@property (nonatomic, assign) CGFloat lastWidth;
/** collectionViewview */
@property (nonatomic, assign) CGFloat flowItemWidth;
@property (nonatomic, assign) BOOL shouldShowAsAutoMarginViews;
@property (nonatomic) CGFloat horizontalEdgeInset;
@property (nonatomic) CGFloat verticalEdgeInset;
@end
```
|
```html
<html lang="en">
<head>
<title>Arrays - STABS</title>
<meta http-equiv="Content-Type" content="text/html">
<meta name="description" content="STABS">
<meta name="generator" content="makeinfo 4.8">
<link title="Top" rel="start" href="index.html#Top">
<link rel="up" href="Types.html#Types" title="Types">
<link rel="prev" href="Subranges.html#Subranges" title="Subranges">
<link rel="next" href="Strings.html#Strings" title="Strings">
<link href="path_to_url" rel="generator-home" title="Texinfo Homepage">
<!--
Contributed by Cygnus Support. Written by Julia Menapace, Jim Kingdon,
and David MacKenzie.
Permission is granted to copy, distribute and/or modify this document
any later version published by the Free Software Foundation; with no
Invariant Sections, with no Front-Cover Texts, and with no Back-Cover
Texts. A copy of the license is included in the section entitled ``GNU
<meta http-equiv="Content-Style-Type" content="text/css">
<style type="text/css"><!--
pre.display { font-family:inherit }
pre.format { font-family:inherit }
pre.smalldisplay { font-family:inherit; font-size:smaller }
pre.smallformat { font-family:inherit; font-size:smaller }
pre.smallexample { font-size:smaller }
pre.smalllisp { font-size:smaller }
span.sc { font-variant:small-caps }
span.roman { font-family:serif; font-weight:normal; }
span.sansserif { font-family:sans-serif; font-weight:normal; }
--></style>
</head>
<body>
<div class="node">
<p>
<a name="Arrays"></a>
Next: <a rel="next" accesskey="n" href="Strings.html#Strings">Strings</a>,
Previous: <a rel="previous" accesskey="p" href="Subranges.html#Subranges">Subranges</a>,
Up: <a rel="up" accesskey="u" href="Types.html#Types">Types</a>
<hr>
</div>
<h3 class="section">5.5 Array Types</h3>
<p>Arrays use the `<samp><span class="samp">a</span></samp>' type descriptor. Following the type descriptor
is the type of the index and the type of the array elements. If the
index type is a range type, it ends in a semicolon; otherwise
(for example, if it is a type reference), there does not
appear to be any way to tell where the types are separated. In an
effort to clean up this mess, IBM documents the two types as being
separated by a semicolon, and a range type as not ending in a semicolon
(but this is not right for range types which are not array indexes,
see <a href="Subranges.html#Subranges">Subranges</a>). I think probably the best solution is to specify
that a semicolon ends a range type, and that the index type and element
type of an array are separated by a semicolon, but that if the index
type is a range type, the extra semicolon can be omitted. GDB (at least
through version 4.9) doesn't support any kind of index type other than a
range anyway; I'm not sure about dbx.
<p>It is well established, and widely used, that the type of the index,
unlike most types found in the stabs, is merely a type definition, not
type information (see <a href="String-Field.html#String-Field">String Field</a>) (that is, it need not start with
`<samp><var>type-number</var><span class="samp">=</span></samp>' if it is defining a new type). According to a
comment in GDB, this is also true of the type of the array elements; it
gives `<samp><span class="samp">ar1;1;10;ar1;1;10;4</span></samp>' as a legitimate way to express a two
dimensional array. According to AIX documentation, the element type
must be type information. GDB accepts either.
<p>The type of the index is often a range type, expressed as the type
descriptor `<samp><span class="samp">r</span></samp>' and some parameters. It defines the size of the
array. In the example below, the range `<samp><span class="samp">r1;0;2;</span></samp>' defines an index
type which is a subrange of type 1 (integer), with a lower bound of 0
and an upper bound of 2. This defines the valid range of subscripts of
a three-element C array.
<p>For example, the definition:
<pre class="example"> char char_vec[3] = {'a','b','c'};
</pre>
<p class="noindent">produces the output:
<pre class="example"> .stabs "char_vec:G19=ar1;0;2;2",32,0,0,0
.global _char_vec
.align 4
_char_vec:
.byte 97
.byte 98
.byte 99
</pre>
<p>If an array is <dfn>packed</dfn>, the elements are spaced more
closely than normal, saving memory at the expense of speed. For
example, an array of 3-byte objects might, if unpacked, have each
element aligned on a 4-byte boundary, but if packed, have no padding.
One way to specify that something is packed is with type attributes
(see <a href="String-Field.html#String-Field">String Field</a>). In the case of arrays, another is to use the
`<samp><span class="samp">P</span></samp>' type descriptor instead of `<samp><span class="samp">a</span></samp>'. Other than specifying a
packed array, `<samp><span class="samp">P</span></samp>' is identical to `<samp><span class="samp">a</span></samp>'.
<!-- FIXME-what is it? A pointer? -->
<p>An open array is represented by the `<samp><span class="samp">A</span></samp>' type descriptor followed by
type information specifying the type of the array elements.
<!-- FIXME: what is the format of this type? A pointer to a vector of pointers? -->
<p>An N-dimensional dynamic array is represented by
<pre class="example"> D <var>dimensions</var> ; <var>type-information</var>
</pre>
<!-- Does dimensions really have this meaning? The AIX documentation -->
<!-- doesn't say. -->
<p><var>dimensions</var> is the number of dimensions; <var>type-information</var>
specifies the type of the array elements.
<!-- FIXME: what is the format of this type? A pointer to some offsets in -->
<!-- another array? -->
<p>A subarray of an N-dimensional array is represented by
<pre class="example"> E <var>dimensions</var> ; <var>type-information</var>
</pre>
<!-- Does dimensions really have this meaning? The AIX documentation -->
<!-- doesn't say. -->
<p><var>dimensions</var> is the number of dimensions; <var>type-information</var>
specifies the type of the array elements.
</body></html>
```
|
Philippa Claire Tarrant (born 7 December 1977) is a British radio producer, presenter, and book author who has worked as executive producer on the Chris Moyles Breakfast show on Radio X since the show started on 21 September 2015. Previously, Taylor worked as a producer for BBC Radio 1, again with The Chris Moyles Show.
Taylor has run the London marathon and in doing so raised a total of £27,711.34 for the Global Make Some Noise charity.
Taylor started dating Toby Tarrant, son of presenter Chris Tarrant since July 2017. The couple moved in together mid 2018. Pippa announced their engagement on the Chris Moyles Show on 20 July 2020. The couple married on 16 September 2022.
Taylor's mother, Diane, is a councillor on Basingstoke and Deane Borough Council and holds the title of mayor, opening the Basingstoke branch of Wickes as her first official engagement. She is also chair of the licensing committee. Diane Taylor was due to be made mayor of Basingstoke and Deane in May 2019. However, the post was taken by Ken Rhatigan.
References
External links
Living people
British radio producers
Women radio producers
People from Brighton
1977 births
|
```xml
import {Component} from "./component.js";
/**
* Set the error label when an error occur.
* @decorator
* @formio
* @property
* @schema
*/
export function ErrorLabel(message: string) {
return Component({
errorLabel: message
});
}
```
|
Roy Chester Martin Jr. (born December 25, 1966) is a former American sprinter. He is considered one of the greatest high school sprinters in American history, and at the height of his career, he competed for the United States at the 1988 Summer Olympics.
As a high school senior in 1985, Martin set the National High School Record for 200 meters with a time of 20.13 seconds at the 1985 UIL Track and Field Championships in Austin. That same year, he also recorded the fastest prep time in the nation for 100 meters at 10.18 seconds and anchored his high school's 4×100 meter and 4×400 meter relay teams to marks (40.28 in the 4×100 and 3:09.4 in the 4×400) that are among the fastest ever recorded in high school competition. Martin was named Male Prep Athlete of the Year by Track & Field News in 1984 and in 1985 and was ranked #3 in the world at 200 meters as a high school senior. His national record for 200 meters stood until July 9, 2016, when it was surpassed by Noah Lyles.
Martin was born and raised in Dallas, Texas. As a boy, he developed a mechanical running style that earned him the nickname "Robot" from his classmates at Franklin D. Roosevelt High School in Dallas. Throughout high school, Martin competed against Michael Johnson of Skyline High School, who later went on to set the world record at 200 and 400 meters and win four Olympic gold medals.
In head-to-head high school competition, Johnson never beat Martin. "He was phenomenal," Johnson recalled of Martin, during an interview in 2008 with the Dallas Morning News. "It was incredible to watch, but at the same time I had to compete against him every week," Johnson said. "You knew first place was gone. You tried to beat out the other guys for second."
He was named Track and Field News "High School Athlete of the Year" in 1984 and 1985, the first male athlete to win the award twice.
As a college freshman, Martin helped Southern Methodist University win the 1986 NCAA track and field championship with a 43.5-second relay carry that propelled the Mustangs to a dramatic victory. His coach at SMU proclaimed Martin "the greatest pure sprinter I’ve ever seen…better than Bob Hayes."
Martin dropped out of S.M.U. after his freshman year and enrolled at Paul Quinn College in Dallas. He later moved to Long Beach, California, to train with Bob Kersee and his wife Jackie Joyner-Kersee. Under Kersee's tutelage, Martin regained his form and competed for the United States in the 1988 Summer Olympics in Seoul, South Korea, where he finished sixth in the 200 meter dash semifinals. Martin retired from sprinting shortly after returning home to Dallas from the Olympics.
Martin has worked as a long-haul truck driver and has held positions as a track coach in the Dallas Independent School District and at Paul Quinn College. He founded and manages a non-profit track club for young Dallas-area athletes. In 2013, Martin was inducted into the Texas Track and Field Hall of Fame and in 2019, he was Inducted into the DISD Athletic Hall of Fame.. He is a cousin of former Dallas Cowboys All Pro defensive end Harvey Martin.
References
External links
Dallas News article with video of Martin talking about 1988 Olympics.
1966 births
Living people
Track and field athletes from Dallas
American male sprinters
Olympic track and field athletes for the United States
Athletes (track and field) at the 1988 Summer Olympics
SMU Mustangs men's track and field athletes
Franklin D. Roosevelt High School (Dallas) alumni
|
```java
package org.hongxi.whatsmars.boot.sample.mongodb;
import org.springframework.data.annotation.Id;
public class Customer {
@Id
private String id;
private String firstName;
private String lastName;
public Customer() {
}
public Customer(String firstName, String lastName) {
this.firstName = firstName;
this.lastName = lastName;
}
@Override
public String toString() {
return String.format("Customer[id=%s, firstName='%s', lastName='%s']", id,
firstName, lastName);
}
}
```
|
Revealed – Live in Dallas is a music album by Myron Butler & Levi, released on March 30, 2010.
Track listing
Recording information
Personnel
Chris McQueen, Mark Lettieri (guitar)
Omar Edwards (organ, keyboards)
Jamar Jones, Shaun Martin (keyboards)
Robert Searight Jr. (drums)
Nathan Werth (percussion)
External links
Revealed: Live in Dallas
2010 live albums
Myron Butler & Levi albums
|
Desemzia incerta is a bacterium from the genus of Desemzia which has been isolated from the ovaries of the cicada Tibicen linnei.
References
External links
Type strain of Desemzia incerta at BacDive - the Bacterial Diversity Metadatabase
Lactobacillales
Bacteria described in 1941
|
Spotlight Group Holdings Pty Ltd (SGH) is an Australian retail conglomerate and one of the country's largest private companies. Its Spotlight Retail Group division operates fabric and craft store chain Spotlight, outdoor retailers Anaconda and Mountain Designs, and department store chain Harris Scarfe. The first Spotlight store was established in Melbourne in 1973 by brothers Morry Fraid and Ruben Fried.
History
Spotlight was established by brothers Morry Fraid and Ruben Fried, whose names were spelled differently due to a mistake by their teachers. They immigrated to Australia from Israel in 1956 with their parents, who established a fabric stall at the Queen Victoria Market in Melbourne. The first Spotlight store was opened in 1973 in Malvern. By 1990 there were 30 stores across Australia and the company was turning over about 90 million, with the brothers' net worth estimated by the Australian Financial Review as about 30 million.
Beginning in the late 1990s, Spotlight used economic value added as an internal metric to calculate employee bonuses. By 2006, Spotlight was employing 6,000 people and had a turnover of 600 million. It used the Howard government's WorkChoices legislation to entice its employees to accept Australian workplace agreements with lower wage rates.
In 2017, Spotlight was reportedly Australia's fifth-largest privately owned retailer, behind 7-Eleven, the Peregrine Corporation, Cotton On Group, and Peter Warren Automotive.
Expansion
Outside of Australia, Spotlight has stores in Singapore (1995), New Zealand (1996), and Malaysia (2014).
In March 2018, Spotlight Group announced that it had acquired outdoor retailer Mountain Designs for an undisclosed sum.
In March 2020, Spotlight Group was awarded the exclusive right to bid for Harris Scarfe, a chain of department stores placed into voluntary administration in 2019. The sale proceeded for a reported $70 million. In March 2021, Zac Fried announced that Spotlight Group planned to open 50 new Harris Scarfe stores in order to compete against Big W and Kmart.
Net worth
In 2021, The Australian listed Morry Fraid and Zac Fried, a son of Reuben Fried, as the 30th and 31st richest people in Australia, with a net worth of 2.81 billion each. Meanwhile and in a contrasting assessment one month later, Morry Fraid, Zac Fried and family were listed on the Financial Review 2021 Rich List with a collective/joint net worth of 3.19 billion.
Structure
Spotlight Group Holdings is divided into the Spotlight Property Group, managing the group's property portfolio; the Alara Investment Group, managing other investments; and the Spotlight Retail Group, which is divided into the brands of Spotlight, Anaconda, Mountain Designs, and Harris Scarfe.
References
External links
Homeware retailers of New Zealand
Homeware retailers of Australia
Family-owned companies of Australia
Australian companies established in 1973
Holding companies of Australia
|
The white-browed coucal or lark-heeled cuckoo (Centropus superciliosus), is a species of cuckoo in the family Cuculidae. It is found in sub-Saharan Africa. It inhabits areas with thick cover afforded by rank undergrowth and scrub, including in suitable coastal regions. Burchell's coucal is sometimes considered a subspecies.
Description
The white-browed coucal is a medium-sized species growing to in length. The sexes are similar, adults having a blackish crown and nape, a white supercilium, rufous-brown back, chestnut wings, blackish rump and black tail, glossed with green, with a white tip. The underparts are creamy-white, the eyes red, the beak black, and the legs and feet greyish-black or black. Juveniles have rufous streaking on the crown, a faint buff supercilium, barred upper parts and darker underparts.
Distribution
The white-browed coucal is native to eastern and southern Africa, and the southwestern part of the Arabian Peninsula. Its range includes Angola, Botswana, Burundi, Congo, Democratic Republic of Congo, Djibouti, Eritrea, Ethiopia, Kenya, Malawi, Namibia, Rwanda, Somalia, South Sudan, Sudan, Tanzania, Uganda, Zambia and Zimbabwe in Africa, as well as Saudi Arabia and Yemen. It is a common species with a very wide range and the International Union for Conservation of Nature has listed it as a "least-concern species".
References
External links
White-browed coucal - Species text in The Atlas of Southern African Birds.
Educational video about White-Browed Coucal (Centropus Superciliosus)
Centropus
Birds of Sub-Saharan Africa
white-browed coucal
Taxonomy articles created by Polbot
Taxa named by Christian Gottfried Ehrenberg
|
Michele Panebianco (20 December 1806 - 4 April 1873) was an Italian painter. He was born and died in Messina.
Life
He studied in Rome under Letterio Subba then Vincenzo Camuccini,. He headed Messina's scuola di belle arti. Many of his religious works were destroyed in the 1908 Messina earthquake, whilst surviving ones are in the Museo Regionale di Messina and various churches in Sicily. He was one of the first teachers of Lio Gangeri.
Works
Arrival of the Magi, copy of the original recorded in Sant'Andrea church, Messina
Nativity, oil on panel, copy of the original recorded in the Alto Basso church, Messina; original moved from the monastic church of San Gregorio to the Museo Civico Peloritano (now known as the Museo Regionale) and re-attributed from Polidoro da Caravaggio
The Stigmatization of St Francis, Montevergine church, Messina
Apostles, oil on panel, produced to complete the altarpiece in Santa Maria Assunta, Castroreale
St Francis of Assisi, fresco, on the vault originally decorated with a fresco by Filippo Tancredi destroyed in the 1783 Calabrian earthquakes, recorded in the Oratorio di San Francesco alle Stimmate in the church of San Francesco dei Mercanti.
Vara dell'Assunta, prints, Museo della Vara, Palazzo Zanca, Messina.
References
Painters from Messina
1806 births
1873 deaths
19th-century Italian painters
|
```java
/*
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.carbondata.hadoop.util;
import java.io.IOException;
import java.text.SimpleDateFormat;
import java.util.Date;
import java.util.Locale;
import org.apache.carbondata.core.index.IndexUtil;
import org.apache.carbondata.core.metadata.AbsoluteTableIdentifier;
import org.apache.carbondata.hadoop.api.CarbonTableInputFormat;
import org.apache.hadoop.conf.Configuration;
import org.apache.hadoop.fs.Path;
import org.apache.hadoop.mapreduce.Job;
import org.apache.hadoop.mapreduce.JobID;
import org.apache.hadoop.mapreduce.lib.input.FileInputFormat;
/**
* Utility class
*/
public class CarbonInputFormatUtil {
public static <V> CarbonTableInputFormat<V> createCarbonInputFormat(
AbsoluteTableIdentifier identifier,
Job job) throws IOException {
CarbonTableInputFormat<V> carbonInputFormat = new CarbonTableInputFormat<>();
CarbonTableInputFormat.setDatabaseName(
job.getConfiguration(), identifier.getCarbonTableIdentifier().getDatabaseName());
CarbonTableInputFormat.setTableName(
job.getConfiguration(), identifier.getCarbonTableIdentifier().getTableName());
FileInputFormat.addInputPath(job, new Path(identifier.getTablePath()));
setIndexJobIfConfigured(job.getConfiguration());
return carbonInputFormat;
}
/**
* This method set IndexJob if configured
*/
public static void setIndexJobIfConfigured(Configuration conf) throws IOException {
String className = "org.apache.carbondata.indexserver.EmbeddedIndexJob";
IndexUtil.setIndexJob(conf, IndexUtil.createIndexJob(className));
}
public static String createJobTrackerID() {
return new SimpleDateFormat("yyyyMMddHHmmss", Locale.US).format(new Date());
}
public static JobID getJobId(int batch) {
String jobTrackerID = createJobTrackerID();
return new JobID(jobTrackerID, batch);
}
}
```
|
Marripudi is an Indian village in Bapatla district of the Indian state of Andhra Pradesh.
It is located 41 km towards South from Guntur. 11 km from District headquarters Bapatla.
Poondla ( 1 km ), Appikatla ( 2 km ), Gudipudi ( 2 km ), Bharthipudi ( 3 km ), Gopapuram ( 3 km ) are the nearby Villages to Marripudi.
Marripudi is surrounded by Bapatla Mandal towards South, Pittalavanipalem Mandal towards East, Kakumanu Mandal towards west, Ponnur Mandal towards North . Bapatla, Ponnur, Chirala, Tenali are the nearby towns to Marripudi..
Agriculture : Paddy, Blackgram,Greengram and Jowar are the main crops in the village
how to reach Marripudi
By Rail Appikatla Railway Station, Machavaram Rail Way Station are the nearby railway stations to Marripudi. However Guntur Jn Rail Way Station is amajor railway station 39 km from Marripudi village.
By Bus Ponnur APSRTC Bus Station, Bapatla APSRTC Bus Station are the nearby Bus Stations to Marripudi.
References
Villages in Guntur district
|
```javascript
// Validation errors messages for Parsley
// Load this after Parsley
Parsley.addMessages('th', {
defaultMessage: "",
type: {
email: "",
url: " url ",
number: "",
integer: "",
digits: "",
alphanum: ""
},
notblank: "",
required: "",
pattern: "",
min: " %s",
max: " %s",
range: " %s %s",
minlength: " %s ",
maxlength: " %s ",
length: " %s %s ",
mincheck: " %s ",
maxcheck: " %s ",
check: " %s %s ",
equalto: "",
euvatin: "",
});
Parsley.setLocale('th');
```
|
Lucas van Valckenborch or Lucas van Valckenborch the Elder (c. 1535 in Leuven – 2 February 1597 in Frankfurt am Main) was a Flemish painter, mainly known for his landscapes. He also made contributions to portrait painting, and allegorical and market scenes. Court painter to Archduke Matthias, the governor of the Spanish Netherlands in Brussels, he later migrated to Austria and then Germany where he joined members of his extended family of artists who had moved there for religious reasons.
Life
Lucas van Valckenborch was born in Leuven in what would become one of the most prominent Flemish families of artists. Spanning three generations, 14 artists are recorded in the family of whom his older brother Marten the Elder and the sons of the latter, Frederik van Valckenborch and Gillis van Valckenborch, were the most important personalities.
On 26 August 1560 he entered the painters' guild of Mechelen. Mechelen was known at the time as a center for oil and water-colours and especially landscape painting. The artistic milieu of Mechelen was influential on the development of the artist as Lucas van Valckenborch learned the art of watercolour painting in Mechelen. Here he also got to know the prominent painters Pieter Bruegel the Elder (1528-1569) and Hans Bol (1534-1593), who both played important roles in the development of landscape painting in the Low Countries. The 17th-century biographer Karel van Mander reported that Lucas van Valckenborch learned to paint landscapes in Mechelen.
At the start of the iconoclastic fury of the Beeldenstorm in 1566 Lucas van Valckenborch left Antwerp with his brother Marten van Valckenborch, probably for religious reasons as they may have been protestant. A series of topographical views, including a 1567 painted view of Liège, prove van Valckenborch travelled up the Meuse valley. This trip played an important role in his development as a landscape artist working directly from nature. In 1570 the artist was in Aachen, where he met up again with his brother Marten. Here, the two brothers were also joined for two years by Hans Vredeman de Vries, friend and fellow artist.
By 1575 Lucas had returned to Antwerp, where he must have made a name for himself. Before 1579 the young Archduke Matthias of Austria, the governor of the Spanish Netherlands, hired him as his court painter. The Archduke was particularly impressed by his skills as a portrait painter. As court painter, Valckenborch created in the Netherlands some works for the Archduke, including the designs for the Archduke's Guard and some portraits. After the Archduke lost his position as governor in 1582, the Archduke left the Netherlands and went to live in Linz without position. It is not clear when Lucas van Valckenborch joined the Archduke in Linz. Van Mander describes the pair traveling together down the Danube. There is no documentary evidence for this but it is assumed he arrived in Linz in 1582 or earlier, and stayed there until June 1582 at least. Two bills from Kremsmünster prove he actually spent time in Upper Austria.
At the beginning of 1593 Lucas van Valckenborch joined his brother Marten in Frankfurt am Main. Here he became the teacher and collaborator of Georg Flegel. He remained active in Frankfurt until his death in 1597.
Work
General
Lucas van Valckenborch is mainly known for his landscapes, which depict existing and imaginary scenes. He also painted portraits for his patron Emperor Matthias. He was also a figure painter as shown in a series of nine allegories of the seasons painted in Frankfurt from 1592.
Valckenborch's earliest dated works are from 1567. His monogram was L / VV or LVV. Early in his career he placed the 'L' below the two 'V's, while after 1570 he signed with the letters inverted.
His style was close to that of Pieter Brueghel the Elder, but he modified this influence in a personal manner and was not a slavish copyist. His work was rooted in the same Flemish tradition, without following the newer Mannerist movement.
Landscapes
Van Valckenborch worked largely in the tradition of the so-called 'world landscape' of panoramic vistas shown from a bird's-eye viewpoint. This style of landscape painting was developed in Antwerp in the first half of the 16th century by artists like Joachim Patinir, Herri met de Bles and Pieter Bruegel the Elder. It was also practised by Lucas van Valckenborch's contemporaries such as Gillis Mostaert and Gillis van Coninxloo. Van Valckenborch also painted topographically accurate landscapes. Joris Hoefnagel is believed to have used his topographical drawings, for instance the drawn View of Linz, for his designs for the six-volume atlas, the Civitates orbis terrarum, published by Georg Braun and Frans Hogenberg between 1572 and 1617.
Lucas van Valckenborch based many of his imaginary landscapes on drawings he had made directly from nature during his travels. The drawings provided a repertory of motifs, which he employed on multiple occasions. His landscape compositions thus often combine real places with imaginary elements. It is therefore not possible to locate many of the views he created. For instance, none of the many landscapes with furnaces and forges has ever been identified. A large portion of his landscape output was dedicated to the depiction of rocky landscapes in which he situated ironworks or small religious or peasant scenes. Another recurring theme was that of rural entertainments such as in the Landscape with a Rural Festival (1577; Hermitage) or the two versions of the Landscape with a Peasant Wedding and Dance (both 1574, National Gallery of Denmark). He also created some close-up representations of forest landscapes.
In their mixture of fantasy and accurate topographical details, van Valckenborch's landscape paintings offer a view of the world and man's relationship to it. This is particularly clear in his rocky landscapes in which the diminutive people on the winding path are reduced by the monumental cliffs. An example is the Rocky Landscape with Travelers on a Path (c. 1570, Sotheby's 6 July 2016, London lot 3) where the distant goatherd and the silhouettes of his charges seem ant-like in comparison to the vast distance, and the vertiginous perspective of the scene. This dramatic visual depiction is clearly intended as a commentary on man's place within the universe.
He also painted, between 1584 and 1587, a series of large pictures depicting the labours of the months, probably on commission for Archduke Matthias. These compositions, of which seven survive (five of which are in the Kunsthistorische Museum), present the various months of the year by showing the changing landscape and the traditional activities of humans during each month. It is not clear whether the five missing paintings were never painted or are lost. Due to their realistic setting these compositions carry a documentary interest. The work of Pieter Bruegel the elder, who had painted a series of 6 on the times of the year, was influential on van Valckenborch. Lucas van Valckenborch moved away from the tradition of painting the landscape in three cascading distances that were rendered in three different colours: brown, green and blue for each receding plane. Rather he often left out the green tone for the middle distance. He also innovated the thematic scenes by developing them into genre scenes with a stronger narrative depth.
Lucas van Valckenborch regularly returned to the subject of the Tower of Babel, which was also depicted by Pieter Bruegel the Elder and later by a whole range of Flemish artists. The subject of the Tower of Babel is usually interpreted as a critique of human hubris, and in particular of the Roman Catholic Church which at the time was undertaking at great expense large-scale construction projects such as the St. Peter's Basilica. However, it has also been viewed as a celebration of technical progress, which would herald a better and more organized world.
Portraits
Archduke Matthias is said to have engaged Lucas van Valckenborch as his court painter for his skills as a portrait painter. Many of the works he produced for the Archduke were in fact portraits, including portraits of the Archduke and his wife Sibylle von Jülich-Cleve-Berg. These portraits were full-length portraits or bust format. He also painted several miniature portraits of the Archduke and his wife. It is clear that these portraits' role was to show the power of Archduke and to flatter his ego as he is depicted invariably in a regal and imposing position and dressed in the latest fashions.
Lucas van Valckenborch also included miniature portraits of himself and his friends in a number of his landscape paintings. This is the case, for instance in The Emperor's walk in the forest where he has depicted himself on the left of the composition with his drawing tools. In the Landscape with a Rural Festival (1577; Hermitage) he included portraits of his friends Abraham Ortelius, Joris Hoefnagel and himself among the throng of revellers.
Market scenes
Lucas van Valckenborch painted a number of market scenes, which are also distinctively tied to the four seasons. The Meat and Fish Market (Winter) (c. 1595, Montreal Museum of Fine Arts) is an example of a market scene, which is also an allegory of winter. The work was likely part of a series of four dedicated to the seasons. The imagery of the market scenes can be traced back to the previous generation of painters from the Antwerp school. In the series van Valckenborch particularly developed the tradition of art market scenes pioneered by Pieter Aertsen and Joachim Beuckelaer. He strived for a synthesis of still-life with landscape and genre painting.
The still lifes in many of the market scenes were the work of his assistant Georg Flegel who may also have trained with him. A snow-covered fish market scene (Royal Museum of Fine Arts Antwerp) is another example of a market scene set in the winter. People are shown skating on the ice in the background. Two muffled-up well-to-do women are making their purchases dressed in the typical Brabant style of around 1580–1600. The fishmonger is shown slicing off pieces of salmon, while his wife is taking smoked fish from a hook. The fish and utensils in the foreground are the work of Flegel who was able to render the fine metal shine of the brass bucket and the grain of the wooden water bucket. Georg Flegel also painted the food and luxurious tableware in two paintings of van Valckenborch depicting banquets (Silesian Museum and St Gilgen-Salzburg, H. Wiesenthal private collection).
Gallery
References
External links
1530s births
1597 deaths
Flemish landscape painters
Flemish portrait painters
Flemish genre painters
Flemish Renaissance painters
Artists from Leuven
|
The mathematical theory of democracy is an interdisciplinary branch of the public choice and social choice theories conceptualized by Andranik Tangian. It operationalizes the fundamental idea to modern democracies – that of political representation, in particular focusing on policy representation, i.e. how well the electorate's policy preferences are represented by the party system and the government. The representative capability is measured by means of dedicated indices that are used both for analytical purposes and practical applications.
History
The mathematical approach to politics goes back to Aristotle, who explained the difference between democracy, oligarchy and mixed constitution in terms of vote weighting.
The historical mathematization of social choice principles is reviewed by Iain McLean and Arnold Urken.
Modern mathematical studies in democracy are due to the game, public choice and social choice theories, which emerged after the World War II; for reviews see.
In 1960s, the notion of policy representation has been introduced. It deals with how well the party system and the government represent the electorate's policy preferences on numerous policy issues.
Policy representation is currently intensively studied
and monitored through the MANIFESTO data base that quantitatively characterizes parties' election programs in about 50 democratic states since 1945. In 1989, it was operationalized in the Dutch voting advice application (VAA) StemWijzer (= ‘VoteMatch’), which helps to find the party that best represents the user's policy preferences. Since then it has been launched on the internet and adapted by about 20 countries as well as by the European Union.
The theoretical aspects of how to best satisfy a society with a composite program first considered by Andranik Tangian and Steven Brams with coauthors is now studied within the relatively new discipline of judgment aggregation. The mathematical theory of democracy focuses, in particular, on the practical aspects of the same topic.
The name "mathematical theory of democracy" is due to the game theorist Nikolai Vorobyov who commented on the first findings of this kind in the late 1980s.
Content of the theory
Like the social choice theory, the mathematical theory of democracy analyzes the collective choice from a given list of candidates. However, these theories differ in both the methodology and the data used. The social choice theory operates on the voters’ preference orders of the candidates and applies an axiomatic approach to find impeccable solutions. The mathematical theory of democracy is based on the candidates’ and the electorate's positions on topical political questions and finds the representatives (deputes, president) and representative bodies (parliament, committee, cabinet) that best represent the public opinion. For this purpose, several quantitative indices to assess and compare the representative capability are introduced.
It has been proven that compromise candidates and representative bodies can always be found, even if there is no perfect solution in terms of social choice theory. Among other things, it is proven that even among the axiomatically prohibited Arrow's dictators there always exist good representatives of the society (e.g. to be elected as presidents), which implies a principal possibility of democracy in every society – contrary to the common interpretation of Arrow's impossibility theorem. The further results deal with the characteristics and special features of individual representatives (such as members of parliament, chairmen, presidents) and the committees (such as parliaments, commissions, cabinets, coalitions and juries).
Third Vote
The Third Vote is an election method developed within the framework of the mathematical theory of democracy to expand the concept of political representation.
The name "Third Vote" has been used in electoral experiments where the new method had to complement the two-vote German system.
Its aim is to draw voters' attention from individual politicians with their charisma and communication skills to specific policy issues. The question "Who should be elected?'" is replaced by the question "What do we choose?" (Party platform). Instead of candidate names, the Third Vote ballot asks for Yes/No answers to the questions raised in the candidates’ manifestos. The same is demanded by voting advice applications (VAA), but the answers are processed in a different way. In contrast to VAAs, the voter receives no advice which party best represents the voter's position. Instead, the Third Vote procedure determines the policy profile of the entire electorate with the balances of public opinion on each issue (pro and cons percentages on individual topics). The election winner is the candidate whose policy profile best matches with the policy profile of the entire electorate.
If the candidates are political parties competing for parliamentary seats, the latter are allocated to the parties in proportion to the closeness of their policy profiles to that of the electorate.
When considering decision options instead of candidates, the questions focus on their specific characteristics.
The multi-voter paradoxes of Condorcet and Kenneth Arrow are circumvented because the entire electorate with its opinion profile is viewed as a single agent, or a single voter.
Applications
Societal applications
Inefficiency of democracy in an unstable society
Quantitative analysis and alternative interpretation of Arrow's impossibility theorem
Analysis of Athenian democracy based on selection of public officers by lot
Analysis of election outcomes with estimations of the representativeness of election winners and parliament factions
Analysis of national political spectra
Non-societal applications
Since some interrelated objects or processes "represent" one another with certain time delays, revealing the best "representatives" or "anticipators" can be used for predictions. This technique is implemented in the following applications:
Predicting share price fluctuations, since some of them (e.g. in the USA) "represent in advance" some other share price fluctuations (e.g. in Germany)
Traffic light control and coordination, since situations at certain crossroads represent in advance the situation at some other crossroads
References
Social choice theory
Public choice theory
|
Trachelium is a genus of flowering plants in the family Campanulaceae.
There are at least three species.
Species include:
Trachelium caeruleum – blue throatwort
Trachelium × halteratum
Trachelium lanceolatum
Two other species, T. asperuloides and T. jacquinii, may be treated as members of genus Campanula.
Trachelium caeruleum is cultivated as an ornamental plant.
References
Campanuloideae
Campanulaceae genera
|
```ruby
# encoding: UTF-8
module Asciidoctor
# Public: Methods for managing inline elements in AsciiDoc block
class Inline < AbstractNode
# Public: Get the text of this inline element
attr_reader :text
# Public: Get the type (qualifier) of this inline element
attr_reader :type
# Public: Get/Set the target (e.g., uri) of this inline element
attr_accessor :target
def initialize(parent, context, text = nil, opts = {})
super(parent, context)
@node_name = %(inline_#{context})
@text = text
@id = opts[:id]
@type = opts[:type]
@target = opts[:target]
unless (more_attributes = opts[:attributes]).nil_or_empty?
update_attributes more_attributes
end
end
def block?
false
end
def inline?
true
end
def convert
converter.convert self
end
# Alias render to convert to maintain backwards compatibility
alias :render :convert
end
end
```
|
```xml
import React from "react";
import { graphql } from "gatsby";
import { Layout } from "@/components/Layout";
import { Meta } from "@/components/Meta";
import { Post } from "@/components/Post";
import { useSiteMetadata } from "@/hooks";
import { Node } from "@/types";
interface Props {
data: {
markdownRemark: Node;
};
}
const PostTemplate: React.FC<Props> = ({ data: { markdownRemark } }: Props) => (
<Layout>
<Post post={markdownRemark} />
</Layout>
);
export const query = graphql`
query PostTemplate($slug: String!) {
markdownRemark(fields: { slug: { eq: $slug } }) {
id
html
fields {
slug
tagSlugs
}
frontmatter {
date
description
tags
title
socialImage {
publicURL
}
}
}
}
`;
export const Head: React.FC<Props> = ({ data }) => {
const { title, subtitle, url } = useSiteMetadata();
const {
frontmatter: {
title: postTitle,
description: postDescription = "",
socialImage,
},
} = data.markdownRemark;
const description = postDescription || subtitle;
const image = socialImage?.publicURL && url.concat(socialImage?.publicURL);
return (
<Meta
title={`${postTitle} - ${title}`}
description={description}
image={image}
/>
);
};
export default PostTemplate;
```
|
```objective-c
/*
*
*/
/**
* @file
* @brief Socket Offload Redirect API
*/
#ifndef ZEPHYR_INCLUDE_NET_SOCKET_OFFLOAD_H_
#define ZEPHYR_INCLUDE_NET_SOCKET_OFFLOAD_H_
#include <zephyr/net/net_ip.h>
#include <zephyr/net/socket.h>
#ifdef __cplusplus
extern "C" {
#endif
/**
* @brief An offloaded Socket DNS API interface
*
* It is assumed that these offload functions follow the
* POSIX socket API standard for arguments, return values and setting of errno.
*/
struct socket_dns_offload {
/** DNS getaddrinfo offloaded implementation API */
int (*getaddrinfo)(const char *node, const char *service,
const struct zsock_addrinfo *hints,
struct zsock_addrinfo **res);
/** DNS freeaddrinfo offloaded implementation API */
void (*freeaddrinfo)(struct zsock_addrinfo *res);
};
/**
* @brief Register an offloaded socket DNS API interface.
*
* @param ops A pointer to the offloaded socket DNS API interface.
*/
void socket_offload_dns_register(const struct socket_dns_offload *ops);
/** @cond INTERNAL_HIDDEN */
int socket_offload_getaddrinfo(const char *node, const char *service,
const struct zsock_addrinfo *hints,
struct zsock_addrinfo **res);
void socket_offload_freeaddrinfo(struct zsock_addrinfo *res);
/** @endcond */
#ifdef __cplusplus
}
#endif
#endif /* ZEPHYR_INCLUDE_NET_SOCKET_OFFLOAD_H_ */
```
|
```c++
/*
This file is part of Kismet
Kismet is free software; you can redistribute it and/or modify
(at your option) any later version.
Kismet is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with Kismet; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include "datasourcetracker.h"
#include "datasource_virtual.h"
#include "datasource_scan.h"
#include "json_adapter.h"
#include "packet.h"
datasource_scan_source::datasource_scan_source(const std::string& uri, const std::string& source_type,
const std::string& json_component_type) :
endpoint_uri{uri},
virtual_source_type{source_type},
json_component_type{json_component_type} {
packetchain =
Globalreg::fetch_mandatory_global_as<packet_chain>();
datasourcetracker =
Globalreg::fetch_mandatory_global_as<datasource_tracker>();
pack_comp_json =
packetchain->register_packet_component("JSON");
pack_comp_common =
packetchain->register_packet_component("COMMON");
pack_comp_datasrc =
packetchain->register_packet_component("KISDATASRC");
pack_comp_gps =
packetchain->register_packet_component("GPS");
pack_comp_l1info =
packetchain->register_packet_component("RADIODATA");
pack_comp_devicetag =
packetchain->register_packet_component("DEVICETAG");
auto httpd = Globalreg::fetch_mandatory_global_as<kis_net_beast_httpd>();
httpd->register_route(endpoint_uri, {"POST"}, "scanreport", {},
std::make_shared<kis_net_web_function_endpoint>(
[this](std::shared_ptr<kis_net_beast_httpd_connection> con) {
return scan_result_endp_handler(con);
}));
}
datasource_scan_source::~datasource_scan_source() {
}
void datasource_scan_source::scan_result_endp_handler(std::shared_ptr<kis_net_beast_httpd_connection> con) {
std::ostream stream(&con->response_stream());
std::shared_ptr<kis_packet> packet;
if (con->json() == nullptr) {
con->set_status(500);
stream << "{\"status\": \"invalid or missing JSON\", \"success\": false}\n";
return;
}
try {
std::shared_ptr<kis_datasource> virtual_source;
auto uuid_s = con->json()["source_uuid"].get<std::string>();
uuid src_uuid{uuid_s};
std::string name = con->json()["source_name"].get<std::string>();
if (src_uuid.error) {
con->set_status(500);
stream << "{\"status\": \"invalid source uuid\", \"success\": false}\n";
return;
}
auto reports_j = con->json()["reports"];
if (!reports_j.is_array()) {
con->set_status(500);
stream << "{\"status\": \"expected 'reports' array\", \"success\": false}\n";
}
// Look up the source by either the uuid provided or the uuid we made based on the name
virtual_source = datasourcetracker->find_datasource(src_uuid);
if (virtual_source == nullptr) {
auto virtual_builder = Globalreg::fetch_mandatory_global_as<datasource_virtual_builder>();
virtual_source = virtual_builder->build_datasource(virtual_builder);
auto vs_cast = std::static_pointer_cast<kis_datasource_virtual>(virtual_source);
vs_cast->set_virtual_hardware(virtual_source_type);
virtual_source->set_source_uuid(src_uuid);
virtual_source->set_source_key(adler32_checksum(src_uuid.uuid_to_string()));
virtual_source->set_source_name(name);
datasourcetracker->merge_source(virtual_source);
} else {
// Update the name
virtual_source->set_source_name(name);
}
for (auto r : reports_j) {
if (!validate_report(r)) {
throw std::runtime_error("invalid report");
}
// TS is optional
uint64_t ts_s = r.value("timestamp", 0);
packet = packetchain->generate_packet();
// Timestamp based on packet data, or now
if (ts_s != 0) {
packet->ts.tv_sec = ts_s;
packet->ts.tv_usec = 0;
} else {
gettimeofday(&packet->ts, nullptr);
}
// Re-pack the submitted record into json for this packet
auto jsoninfo = std::make_shared<kis_json_packinfo>();
jsoninfo->type = json_component_type;
std::stringstream s;
s << r;
jsoninfo->json_string = s.str();
packet->insert(pack_comp_json, jsoninfo);
// Extract any tags
auto tags_j = r["tags"];
if (!tags_j.is_object()) {
auto tagsinfo = std::make_shared<kis_devicetag_packetinfo>();
for (const auto& i : tags_j.items()) {
tagsinfo->tagmap[i.key()] = i.value();
}
packet->insert(pack_comp_devicetag, tagsinfo);
}
double lat = r.value("lat", (double) 0);
double lon = r.value("lon", (double) 0);
double alt = r.value("alt", (double) 0);
double speed = r.value("speed", (double) 0);
if (lat != 0 && lon != 0) {
auto gpsinfo = std::make_shared<kis_gps_packinfo>();
gpsinfo->lat = lat;
gpsinfo->lon = lon;
if (alt != 0)
gpsinfo->fix = 3;
else
gpsinfo->fix = 2;
gpsinfo->alt = alt;
gpsinfo->speed = speed;
packet->insert(pack_comp_gps, gpsinfo);
}
std::shared_ptr<kis_layer1_packinfo> l1info;
if (!r["signal"].is_null()) {
if (l1info == nullptr)
l1info = std::make_shared<kis_layer1_packinfo>();
l1info->signal_dbm = r["signal"];
l1info->signal_type = kis_l1_signal_type_dbm;
}
if (!r["freqkhz"].is_null()) {
if (l1info == nullptr)
l1info = std::make_shared<kis_layer1_packinfo>();
l1info->freq_khz = r["freqkhz"];
}
if (!r["channel"].is_null()) {
if (l1info == nullptr)
l1info = std::make_shared<kis_layer1_packinfo>();
l1info->channel = r["channel"];
}
if (l1info != nullptr)
packet->insert(pack_comp_l1info, l1info);
auto srcinfo = std::make_shared<packetchain_comp_datasource>();
srcinfo->ref_source = virtual_source.get();
packet->insert(pack_comp_datasrc, srcinfo);
packetchain->process_packet(packet);
// Null out our local packet, it's destroyed by packetchain
packet = nullptr;
virtual_source->inc_source_num_packets(1);
}
stream << "{\"status\": \"Scan report accepted\", \"success\": true}\n";
return;
} catch (const std::exception& e) {
con->set_status(500);
stream << "{\"status\": \"" << e.what() << "\", \"success\": false}\n";
return;
}
con->set_status(500);
stream << "{\"status\": \"unhandled request\", \"success\": false}\n";
}
```
|
Young Pilgrim is the debut studio album by British singer-songwriter Charlie Simpson. The album was produced by Danton Supple (Doves, Coldplay) and was released on 15 August 2011 through independent label PIAS Recordings.
Following the extended hiatus announced by Fightstar in 2010, Simpson began writing solo material in conjunction with fan funding website Pledge Music. The platform was launched in 2009, as an innovative new way of involving fans in the record making process. Fans "pledge" to receive a copy of the completed project (an album or EP), while also having the chance to purchase exclusive extras such as private gigs, music video appearances, or even providing backing vocals during recording.
Simpson first issued new material on Christmas day 2010, releasing a "pledgers only" EP entitled When We Were Lions. The EP and subsequent singles, garnered praise from music critics, seeing "Down Down Down" selected as "Record of the Week" by BBC Radio 1 presenter Fearne Cotton. Simpson has described his solo work as "something completely different", while it has been noted the album contains elements of melancholy, similar to the works of The National, Bon Iver, and Jackson Browne.
Young Pilgrims physical release was put under strain after all 30,000 copies of the album were destroyed in an arson fire at the warehouse and distribution center for PIAS Entertainment Group during the 2011 London Riots on 8 August 2011. However, it was confirmed the following day that despite the damages, the album would still be released as planned on 15 August. The release proved a success for Simpson and the independent label, entering the UK Albums Chart at number six.
Singles
"Down Down Down" was the first single released from the album. It was released on 11 April 2011. The song peaked at number 65 on the UK Singles Chart. It was selected as "Record of the Week" by BBC Radio 1.
"Parachutes" is the second single released from the album. It was released on 7 August 2011. Simpson worked with the same directors for this video as he did with "Down Down Down".
"Cemetery" is the third single from Young Pilgrim. It was a free download of the week on iTunes and later that week Charlie announced that it would be the follow-up to Parachutes. He announced via social networking site Twitter. "Very much looking forward to a few days off, before coming back to shoot the video for Cemetery..! :)". It was revealed on 28 September 2011 that it would be released on 31 October 2011 and would include 4 b-sides.
"Farmer & His Gun" is to be the 4th and final single from Young Pilgrim. The news was broke when Charlie tweeted Harry Styles of One Direction that the track would be a single. The song also featured on Charlie's EP 'When We Were Lions' before being promoted from a bonus track from Young Pilgrim to an album track. On 16 January, Charlie Simpson revealed the video for Farmer & His Gun will be fully animated. He announced this on his Twitter.
Reception
Commercial performance
According to the Midweeks issued by The Official Charts Company and published by BBC Radio 1 on 17 August, Young Pilgrim was projected to debut on the UK Albums Chart at number five. It was reported by Music Week that at the time of the midweek data, the album had sold some 4,663 copies with 55% of the sales being physical copies. The album eventually debuted at number six on the UK Albums Chart, whilst also entering the UK Independent Albums chart at number three, and the Scottish Albums Chart at number seven. The albums commercial success marked the first chart hit for the Pledge Music programme. Craig Jennings, CEO of Simpson's management group, stated, "We are delighted to achieve a top ten album with 'Young Pilgrim', and it would not have been possible without PledgeMusic putting together such a great direct-to-fan plan to launch the project. This is an example of the PledgeMusic model working perfectly."
Critical response
Young Pilgrim has received generally favorable reviews, albeit some mixed from music critics. Broden Terry of AbsolutePunk awarded the album a score of 95% and noted, "Young Pilgrim is undoubtedly the finest accomplished of Charlie Simpson's music career to date. This twelve-track effort sees Simpson once again overhaul his sound into a beautiful blend of folk, acoustic and pop, while also implementing rich harmonies, absorbing melodies, thoughtfully constructed lyrics, and the clarity of luscious instrumentation to wonderful effect." BBC Music critic Fraser McAlpine gave a favorable review and reported that Simpson is "clearly a gifted singer and songwriter. There’s a lot of walking streets alone, blisters cracking over skin, melancholy trips to childhood haunts, and a lot of soul-searching: classic singer-songwriter fare. Thankfully, our hero has two important things on his side: a robust way with a tune and a swag-bag rammed with glorious multi-tracked harmonies." James Lachno of British broadsheet The Daily Telegraph gave a more mixed review. While awarding the album three stars out of five, he opined, "Simpson’s husky voice and warm melodies show promise, but his bitterwsweet, pastoral romanticism – all "old oak trees" and "morning snow" – is clichéd." Similarly, Dave Simpson of The Guardian also awarded three stars out of five, writing, "His first offering in this guise is solid rather than spectacular, his Eddie Vedder croon occasionally let down by a lyrical clunker. He sounds much more convincing on "Parachutes" and "All at Once", melancholy Lemonheads-y pop full of regret for broken relationships." In contrast, Lewis Corner of Digital Spy awarded Young Pilgrim four stars out of five and explained, "Simpson showcases his singer-songwriter sensibilities best on tracks "Riverbanks" and "All at Once" - the former a breezy anthem that climaxes with a crescendo of guitars and strings that wouldn't sound out of place at a Snow Patrol gig, while the latter is a barnyard knees-up of pacey folk beats and brash guitar strums." Tom Spinelli of Melodic.net also gave highly favorable feedback. Awarding four-and-a-half stars out of five, he noted that, "Simpson takes the folk rock route drifting away from his previous bands and most recent rock outfit Fightstar. Whether it’s his band or his solo material, this man is a force in the music industry. I have stood by this statement and will stand by this as time goes on. Everyone needs to check out this album and support this talented artist." Sunday Mercury critic Paul Cole was impressed with the album, writing that, "Simpson has delivered a subtle set of songs. Musically, there’s more than a little Coldplay in here; a dash of David Gray; a new baritone vocal that nods to The National’s Matt Berninger. Highlights include "Hold On" – an Imogen Heap-style experiment with multi-tracked vocals – and finalé "Riverbanks", a crescendo of guitar, piano and strings. Paid for by the fans through the Pledge programme, this is worth making a pilgrimage for."
Roy Gardener of the Yorkshire Post reported that, "His first solo-record sees the 26-year-old acting his age with a pleasant dose of acoustic-pop. Eschewing his small-town Suffolk roots for an affected, Americanised bellow, moments of petty angst are balanced with a playful country bounce. Producer Danton Supple offers emotive, indie-flick arrangements and aching arpeggios into the mix." Rock Sound writer Andy Ritchie was also impressed with Young Pilgrim. Awarding the album eight out of ten, he noted that "Young Pilgrim is a hauntingly beautiful affair, that paints Simpson as a jack of all trades; a songwriter capable of tugging your heartstrings and not just a frontman. The highlights come where Charlie’s voice is at its softest, as in "Parachutes" and "Thorns", but overall, this a solid, refreshing and somewhat unexpected output from Simpson." Writing for webzine This Is Fake DIY, Heather McDaid awarded the album seven out of ten and opined, "What he, in turn, created is a 12 track album that flaunts his versatility as an artist, exploring a new style that he hadn’t dabbled in before through his official releases. As acoustic albums go, he has captured that easy listening quality alongside his raw vocals and certified himself a successful solo artist." Less receptive reviews came from MusicOMH writer William Grant, who awarded the album 2 ½ stars out of five and critiqued "Leaving Simpson alone to his songwriting devices, a box of inherited vinyl and a comedown does not a nu-folk star make." While Scottish publication The Fly awarded the album two stars out of five with Harriet Gibsone stating, "Young Pilgrim will be a hit with anyone who’s ever brought an acoustic along to a festival, but, sadly, it’s not for us."
Track listing
All songs written and composed by Charlie Simpson.
Personnel
The following personnel contributed to Young Pilgrim:Musicians Charlie Simpson — lead vocals, backing vocals, acoustic guitar, electric guitar, bass, piano, keyboard, programming, lyrics
Reuben Humphries — drums, percussion
Audrey Riley — string arrangement, cello
Leo Payne — violin
Greg Warren — violin
Sue Dench — viola
Jonny Bridgewood — double bass
Nick Etwell — trumpet
Nick Foot — harmonica
Adam Chetwood — pedal steal guitarProduction'
Danton Supple — producer, mixing (tracks 1-8, 11-12)
Guy Massey — producer, mixing (tracks 9-10)
Manon Granjean — engineering
Ian Dowling — engineering
Jon Davis — mastering
Horsie in the Hedge — art direction, design
Jon Bergman — photography
Chart performance
Release history
References
2011 debut albums
Charlie Simpson albums
PIAS Recordings albums
Albums produced by Danton Supple
|
McKeiver v. Pennsylvania, 403 U.S. 528 (1971), is a decision of the United States Supreme Court. The Court held that juveniles in juvenile criminal proceedings were not entitled to a jury trial by the Sixth or Fourteenth Amendments. The Court's plurality opinion left the precise reasoning for the decision unclear.
Background
Joseph McKeiver and Edward Terry were teenagers charged with acts of robbery, theft, assault, and escape. Both were denied a request for a jury trial at the Juvenile Court of Philadelphia. A state Superior Court affirmed the order and, after combining their separate cases into one case, the Supreme Court of Pennsylvania affirmed the decision stating that there is no constitutional right to a jury trial for juveniles. In similar cases, the Court of Appeals and Supreme Court of North Carolina both affirmed the lower court's decision, finding no constitutional requirement for a jury trial for juvenile defendants.
Decision of the U.S. Supreme Court
Although the right to a jury trial is not guaranteed by the U.S. Constitution in these cases states may, and some do, employ jury trials in juvenile proceedings if they wish to do so. Kansas is the first state in the U.S. to articulate that the right should be extended to juveniles under its state constitution.
See also
List of United States Supreme Court cases, volume 403
References
External links
United States Supreme Court cases
United States Supreme Court cases of the Burger Court
United States Sixth Amendment jury case law
1971 in United States case law
1971 in Pennsylvania
Juvenile justice system
Pennsylvania state courts
|
The 2018 Mallorca Open was a women's tennis tournament played on grass courts. It was the 3rd edition of the Mallorca Open, and part of the International category of the 2018 WTA Tour. It took place at Santa Ponsa Tennis Club in Mallorca, Spain, from 18 June through 24 June 2018. Tatjana Maria won the singles title.
Points and prize money
Point distribution
Prize money
WTA singles main draw entrants
Seeds
1 Rankings are as of June 11, 2018.
Other entrants
The following players received wildcards into the main draw:
Lara Arruabarrena
Marta Kostyuk
Svetlana Kuznetsova
Francesca Schiavone
The following players received entry using a protected ranking into the main draw:
Victoria Azarenka
The following player received entry as a special exempt:
Kirsten Flipkens
The following players received entry from the qualifying draw:
Sofia Kenin
Johanna Larsson
Antonia Lottner
Rebecca Peterson
Alison Riske
Ajla Tomljanović
The following players received entry as lucky losers:
Viktória Kužmová
Stefanie Vögele
Withdrawals
Before the tournament
Kirsten Flipkens → replaced by Viktória Kužmová
Aleksandra Krunić → replaced by Stefanie Vögele
Monica Niculescu → replaced by Magda Linette
Agnieszka Radwańska → replaced by Kateryna Kozlova
Zhang Shuai → replaced by Markéta Vondroušová
WTA doubles main draw entrants
Seeds
1 Rankings are as of 11 June 2018.
Other entrants
The following pairs received wildcards into the doubles main draw:
Sorana Cîrstea / Andrea Petkovic
Lucie Šafářová / Barbora Štefková
Champions
Singles
Tatjana Maria def. Anastasija Sevastova, 6–4, 7–5
Doubles
Andreja Klepač / María José Martínez Sánchez def. Lucie Šafářová / Barbora Štefková, 6–1, 3–6, [10–3]
References
External links
Mallorca Open
Mallorca Open
2018
Mallorca Open
|
```scala
/*
*/
package akka.http.javadsl.testkit
import akka.http.javadsl.server.RouteResult
import akka.http.javadsl.unmarshalling.Unmarshaller
import scala.reflect.ClassTag
import scala.concurrent.{ ExecutionContext, Future }
import scala.concurrent.duration.FiniteDuration
import akka.util.ByteString
import akka.stream.Materializer
import akka.http.scaladsl
import akka.http.scaladsl.unmarshalling.Unmarshal
import akka.http.scaladsl.model.HttpResponse
import akka.http.impl.util._
import akka.http.impl.util.JavaMapping.Implicits._
import akka.http.javadsl.server.{ Rejection, RoutingJavaMapping }
import RoutingJavaMapping._
import akka.http.javadsl.model._
import scala.collection.JavaConverters._
import scala.annotation.varargs
/**
* A wrapper for route results.
*
* To support the testkit API, a third-party testing library needs to implement this class and provide
* implementations for the abstract assertion methods.
*/
abstract class TestRouteResult(_result: Future[RouteResult], awaitAtMost: FiniteDuration)(implicit ec: ExecutionContext, materializer: Materializer) {
private def _response = _result.awaitResult(awaitAtMost) match {
case scaladsl.server.RouteResult.Complete(r) => r
case scaladsl.server.RouteResult.Rejected(rejections) => doFail("Expected route to complete, but was instead rejected with " + rejections)
case other => throw new IllegalArgumentException(s"Unexpected result: $other") // compiler completeness check pleaser
}
private def _rejections = _result.awaitResult(awaitAtMost) match {
case scaladsl.server.RouteResult.Complete(r) => doFail("Request was not rejected, response was " + r)
case scaladsl.server.RouteResult.Rejected(ex) => ex
case other => throw new IllegalArgumentException(s"Unexpected result: $other") // compiler completeness check pleaser
}
/**
* Returns the strictified entity of the response. It will be strictified on first access.
*/
lazy val entity: HttpEntity.Strict = _response.entity.toStrict(awaitAtMost).awaitResult(awaitAtMost)
/**
* Returns a copy of the underlying response with the strictified entity.
*/
lazy val response: HttpResponse = _response.withEntity(entity)
/**
* Returns the response's content-type
*/
def contentType: ContentType = _response.entity.contentType
/**
* Returns a string representation of the response's content-type
*/
def contentTypeString: String = contentType.toString
/**
* Returns the media-type of the the response's content-type
*/
def mediaType: MediaType = contentType.mediaType
/**
* Returns a string representation of the media-type of the response's content-type
*/
def mediaTypeString: String = mediaType.toString
/**
* Returns the bytes of the response entity
*/
def entityBytes: ByteString = entity.getData
/**
* Returns the entity of the response unmarshalled with the given ``Unmarshaller``.
*/
def entity[T](unmarshaller: Unmarshaller[HttpEntity, T]): T =
Unmarshal(response.entity)
.to(unmarshaller.asScala, ec, materializer)
.awaitResult(awaitAtMost)
/**
* Returns the entity of the response interpreted as an UTF-8 encoded string.
*/
def entityString: String = entity.getData.utf8String
/**
* Returns the [[akka.http.javadsl.model.StatusCode]] of the response.
*/
def status: StatusCode = response.status.asJava
/**
* Returns the numeric status code of the response.
*/
def statusCode: Int = response.status.intValue
/**
* Returns the first header of the response which is of the given class.
*/
def header[T >: Null <: HttpHeader](clazz: Class[T]): T = {
response.header(ClassTag[T](clazz))
.getOrElse(doFail(s"Expected header of type ${clazz.getSimpleName} but wasn't found."))
}
/**
* Expects the route to have been rejected, returning the list of rejections, or empty list if the route
* was rejected with an empty rejection list.
* Fails the test if the route completes with a response rather than having been rejected.
*/
def rejections: java.util.List[Rejection] = _rejections.map(_.asJava).asJava
/**
* Expects the route to have been rejected with a single rejection.
* Fails the test if the route completes with a response, or is rejected with 0 or >1 rejections.
*/
def rejection: Rejection = {
val r = rejections
if (r.size == 1) r.get(0) else doFail("Expected a single rejection but got %s (%s)".format(r.size, r))
}
/**
* Assert on the numeric status code.
*/
def assertStatusCode(expected: Int): TestRouteResult =
assertStatusCode(StatusCodes.get(expected))
/**
* Assert on the status code.
*/
def assertStatusCode(expected: StatusCode): TestRouteResult =
assertEqualsKind(expected, status, "status code")
/**
* Assert on the media type of the response.
*/
def assertMediaType(expected: String): TestRouteResult =
assertEqualsKind(expected, mediaTypeString, "media type")
/**
* Assert on the media type of the response.
*/
def assertMediaType(expected: MediaType): TestRouteResult =
assertEqualsKind(expected, mediaType, "media type")
/**
* Assert on the content type of the response.
*/
def assertContentType(expected: String): TestRouteResult =
assertEqualsKind(expected, contentTypeString, "content type")
/**
* Assert on the content type of the response.
*/
def assertContentType(expected: ContentType): TestRouteResult =
assertEqualsKind(expected, contentType, "content type")
/**
* Assert on the response entity to be a UTF8 representation of the given string.
*/
def assertEntity(expected: String): TestRouteResult =
assertEqualsKind(expected, entityString, "entity")
/**
* Assert on the response entity to equal the given bytes.
*/
def assertEntityBytes(expected: ByteString): TestRouteResult =
assertEqualsKind(expected, entityBytes, "entity")
/**
* Assert on the response entity to equal the given object after applying an [[akka.http.javadsl.unmarshalling.Unmarshaller]].
*/
def assertEntityAs[T <: AnyRef](unmarshaller: Unmarshaller[HttpEntity, T], expected: T): TestRouteResult =
assertEqualsKind(expected, entity(unmarshaller), "entity")
/**
* Assert that a header of the given type exists.
*/
def assertHeaderKindExists(name: String): TestRouteResult = {
val lowercased = name.toRootLowerCase
assertTrue(response.headers.exists(_.is(lowercased)), s"Expected `$name` header was missing.")
this
}
/**
* Assert that a header of the given type does not exist.
*/
def assertHeaderKindNotExists(name: String): TestRouteResult = {
val lowercased = name.toRootLowerCase
assertTrue(response.headers.forall(!_.is(lowercased)), s"`$name` header was not expected to appear.")
this
}
/**
* Assert that a header of the given name and value exists.
*/
def assertHeaderExists(name: String, value: String): TestRouteResult = {
val lowercased = name.toRootLowerCase
val headers = response.headers.filter(_.is(lowercased))
if (headers.isEmpty) fail(s"Expected `$name` header was missing.")
else assertTrue(
headers.exists(_.value == value),
s"`$name` header was found but had the wrong value. Found headers: ${headers.mkString(", ")}")
this
}
/**
* Assert that a given header instance exists in the response.
*/
def assertHeaderExists(expected: HttpHeader): TestRouteResult =
assertHeaderExists(expected.name(), expected.value())
@varargs def assertRejections(expectedRejections: Rejection*): TestRouteResult = {
if (rejections.asScala == expectedRejections.toSeq) {
this
} else {
doFail(s"Expected rejections [${expectedRejections.mkString(",")}], but rejected with [${rejections.asScala.mkString(",")}] instead.")
}
}
protected def assertEqualsKind(expected: AnyRef, actual: AnyRef, kind: String): TestRouteResult = {
assertEquals(expected, actual, s"Unexpected $kind!")
this
}
protected def assertEqualsKind(expected: Int, actual: Int, kind: String): TestRouteResult = {
assertEquals(expected, actual, s"Unexpected $kind!")
this
}
// allows to `fail` as an expression
private def doFail(message: String): Nothing = {
fail(message)
throw new IllegalStateException("Shouldn't be reached")
}
protected def fail(message: String): Unit
protected def assertEquals(expected: AnyRef, actual: AnyRef, message: String): Unit
protected def assertEquals(expected: Int, actual: Int, message: String): Unit
protected def assertTrue(predicate: Boolean, message: String): Unit
}
```
|
Aerolíneas Argentinas Flight 322 was a scheduled Buenos Aires–São Paulo–Port of Spain–New York City international passenger service, operated with a Comet 4, registration LV-AHR, that crashed during climbout on the early stages of its second leg, when it collided with tree tops shortly after takeoff from Viracopos-Campinas International Airport on 23 November 1961. There were 52 fatalities, 40 of them passengers.
Flight history
The jetliner arrived from Buenos Aires, Argentina and landed at Viracopos-Campinas International Airport, north of São Paulo, as an intermediate stop. It took off at 05:38, bound for Piarco International Airport, Trinidad, with New York City as its final destination. After reaching an altitude of about , the aircraft lost altitude, collided with eucalyptus trees and crashed into the ground; its fuel tanks exploded on impact. All 52 people on board were killed in the disaster.
Investigation
The accident was investigated by the Brazilian government with participation from the government of Argentina, the state of registry of the accident aircraft.
The weather conditions at the time of the accident were "dark night due to 7/8 (broken) stratocumulus at and to 8/8 coverage (overcast) by altostratus at ." According to the Brazilian Air Ministry, the weather conditions did not contribute to the accident.
The investigation revealed that the first officer was seated in the left seat of the flight deck, which the investigators saw as an indication that he was receiving flight instruction from the captain during the accident flight.
The Brazilian Air Ministry determined the following Probable Cause:
It was presumed that the co-pilot was under flight instruction. If such was the case, the instructor, who was pilot-in-command, may have failed to brief or supervise the co-pilot properly.
The Argentinian government issued the following statement:
Argentina has determined, in the light of information it has gathered, that the cause of the accident was: "Failure to operate under IFR during a takeoff by night in weather conditions requiring IFR operation and failure to follow the climb procedure for this type of aircraft; a contributory cause was the lack of vigilance by the pilot-in-command during the operations."
See also
Aerolíneas Argentinas accidents and incidents
List of accidents and incidents involving commercial aircraft
Footnotes
Notes
References
External links
Brazilian Air Ministry accident report on prevac.com.ar (Argentinian aviation safety website, in Spanish) (Archive)
1961 in Brazil
Airliner accidents and incidents caused by pilot error
Aviation accidents and incidents in 1961
Aviation accidents and incidents in Brazil
Accidents and incidents involving the de Havilland Comet
Aerolíneas Argentinas accidents and incidents
November 1961 events in South America
|
Young Justice is a fictional DC Comics superhero team.
Young Justice may also refer to:
Young Justice (TV series), an American animated superhero TV series based on the comic, which technically is not a direct adaption of the Young Justice comic book series by Peter David, Todd Dezago, and Todd Nauck.
Young Justice: Legacy, an action-adventure video game based on the television series
Young Justice (rapper), an affiliate of the Wu-Tang Clan
|
Brendan Kerry (born 18 November 1994) is an Australian figure skater. He is the 2017 CS Ondrej Nepela Trophy bronze medalist, the 2017 CS Lombardia Trophy bronze medalist, the 2019 Toruń Cup champion, the 2016 Egna Spring Trophy champion, and an eight-time Australian national champion (2011, 2013–2019).
Kerry has competed in the final segment at fifteen ISU Championships, achieving his highest placement, sixth, at the 2022 Four Continents. He placed 29th at the 2014 Winter Olympics, 20th at the 2018 Winter Olympics and 17th at the 2022 Winter Olympics.
Personal life
Brendan Kerry was born 18 November 1994 in Sydney. His mother, Monica MacDonald, competed in ice dancing at the 1988 Winter Olympics, and his sister, Chantelle Kerry is also a figure skater.
Kerry attended Epping Boys High School before transferring to Sydney Distance Education High School to focus on skating.
Career
Early career
Kerry started skating in 2004. He debuted on the ISU Junior Grand Prix (JGP) series in 2008. He won the Australian national junior title in the 2009–2010 season. In 2011, Kerry made his senior international debut at the Four Continents Championships. He also competed at his first World Junior Championships.
In the 2011–2012 season, Kerry won the Australian national title on the senior level and was assigned to his first World Championships. He was cut after finishing 15th in the preliminary round at the event in Nice, France.
2013–2014 season
In September 2013, Kerry was sent to the Nebelhorn Trophy, the final qualifying competition for the 2014 Winter Olympics. As a result of his 8th-place finish, Australia received one of the six remaining spots for countries that had not previously qualified a men's entry. He placed 5th in both of his JGP events. In January, he reached the free skate at the 2014 Four Continents Championships in Taipei and went on to finish 20th overall. In February, Kerry placed 29th in the short program at the Olympics in Sochi, Russia, scoring 47.12 points. With only the top 24 advancing, it was not enough to progress to the final segment. He ended his season at the 2014 World Junior Championships, held in March in Sofia, Bulgaria. He placed 19th in the short, 20th in the free, and 21st overall.
2014–2015 season
Kerry competed at two events of the newly inaugurated ISU Challenger Series, placing 9th at the 2014 CS Lombardia Trophy and 11th at the 2014 CS Skate Canada Autumn Classic. He finished 17th at the 2015 Four Continents Championships in Seoul, South Korea. At his second World Championships, he qualified to the free skate for the first time by placing 17th in the short program. He finished 20th overall in Shanghai, China.
2015–2016 season
Kerry was invited to his first-ever Grand Prix event, the 2015 Skate America. He placed 11th in the short program, 7th in the free skate, and 8th overall. On 23 November, he was added to the 2015 NHK Trophy. He finished 12th in Japan and 19th at the 2016 Four Continents in Taipei, Taiwan. In March, he placed 17th at the 2016 World Championships in Boston after ranking 17th in both segments. Soon after, Kerry placed second in the short and first in the free to win the gold medal at Gardena Spring Trophy 2016, in Egna, Italy, setting two ISU personal bests (short program and total combined score).
2016–2017 season
Kerry was invited to two Grand Prix events, the 2016 Skate America and 2016 Trophée de France, and finished tenth at both. In December, he won his fifth national title. In February 2017, he finished 11th at the 2017 Four Continents Championships in Gangneung, South Korea, and fifth at the Asian Winter Games in Sapporo, Japan.
In March, Kerry placed 13th in the short, 15th in the free, and 15th overall at the 2017 World Championships in Helsinki, Finland. Due to his result, Australia qualified a spot in the men's event at the 2018 Winter Olympics in Pyeongchang, South Korea.
2017–2018 season
Kerry opened his season in mid-September, winning a bronze medal at the 2017 CS Lombardia Trophy and becoming the first Australian men's skater to finish on a Challenger Series podium. A week later, he received the bronze medal at the 2017 CS Ondrej Nepela Trophy.
After parting ways with long-time coach Tammy Gambill, Kerry confirmed his relocation to Moscow to train with Russian coach, Nikolai Morozov in mid-November.
Kerry was named to the Australian team for the 2018 Winter Olympics in November 2017 and won his fifth consecutive senior national title at the 2017 Australian National Championships in Brisbane in December. He attended his second Winter Olympics, placing twentieth in the men's event. He placed eighteenth at the 2018 World Championships.
2018–2019 season
After withdrawing from the Autumn Classic, Kerry placed eleventh and tenth at his two Grand Prix assignments, the 2018 Skate Canada International and 2018 Rostelecom Cup. Winning a sixth national title, he then placed ninth at the Four Continents Championships and twentieth at the World Championships.
2019–2020 season
Kerry won his second consecutive Halloween Cup, and then began the Grand Prix at the 2019 Skate Canada International, where he placed twelfth of twelve skaters. Kerry was seventh at the 2019 Cup of China.
Kerry placed twelfth at the 2020 Four Continents Championships. He was assigned to compete at the World Championships in Montreal, but these were cancelled as a result of the coronavirus pandemic.
2020–2021 season
With the pandemic continuing to affect international travel, Kerry was assigned to compete at the 2020 Internationaux de France, but this event was also cancelled. He competed at French Masters as an invited international skater, winning the bronze. He was later named to the Australian team for the 2021 World Championships in Stockholm but withdrew due to a foot injury.
2021–2022 season
Kerry returned to international competition at the 2021 CS Nebelhorn Trophy, where he placed seventh, securing a berth for Australia at the 2022 Winter Olympics. He fared less well at the 2021 CS Finlandia Trophy, his second Challenger event of the season, coming in thirteenth. Initially without a Grand Prix assignment, he was eventually named as a replacement for Maxim Naumov at the 2021 Rostelecom Cup, where he finished twelfth of twelve skaters. Kerry assessed his own performance as "terrible and very bad." He finished the fall season at the 2021 CS Golden Spin of Zagreb, where he was sixth.
Due to Australian federation rules with no national championships being held, Kerry was sent to the 2022 Four Continents Championships in Tallinn to compete with James Min and Jordan Dodds for the men's berth on the Australian Olympic team. Kerry finished in sixth at the event, over seventy points clear of Min, admitting afterwards that "it was really frustrating having to try to compete for the Olympic spot I earned again, a week and a half ahead of the Olympic Games." Shortly afterwards, he was named to the Olympic team.
Kerry was named Australia's co-flagbearer for the opening ceremonies at the 2022 Winter Olympics, alongside freestyle skier Laura Peel. Kerry placed seventeenth in the short program of the men's event. Sixteenth in the free skate, he finished seventeenth overall.
2022-2023 season
On July 22, Kerry was named to 2022 Skate America, but a few days later, Ice Skating Australia removed him from their assignments list, indicating he had withdrawn.
Programs
Competitive highlights
Detailed results
Senior level
References
External links
Australian male single skaters
1994 births
Living people
Figure skaters from Sydney
Olympic figure skaters for Australia
Figure skaters at the 2014 Winter Olympics
Figure skaters at the 2018 Winter Olympics
People educated at Sydney Distance Education High School
Figure skaters at the 2017 Asian Winter Games
Figure skaters at the 2022 Winter Olympics
Sportsmen from New South Wales
|
```go
package utils
import (
"fmt"
"os"
"sync"
)
var _ = fmt.Print
var hostname string = "*"
var Hostname = sync.OnceValue(func() string {
h, err := os.Hostname()
if err == nil {
return h
}
return ""
})
```
|
```javascript
'use strict';
/**
@typedef {
{
name?: string,
names?: string[],
argumentsLength?: number,
minimumArguments?: number,
maximumArguments?: number,
allowSpreadElement?: boolean,
optional?: boolean,
} | string | string[]
} CallOrNewExpressionCheckOptions
*/
function create(node, options, types) {
if (!types.includes(node?.type)) {
return false;
}
if (typeof options === 'string') {
options = {names: [options]};
}
if (Array.isArray(options)) {
options = {names: options};
}
let {
name,
names,
argumentsLength,
minimumArguments,
maximumArguments,
allowSpreadElement,
optional,
} = {
minimumArguments: 0,
maximumArguments: Number.POSITIVE_INFINITY,
allowSpreadElement: false,
...options,
};
if (name) {
names = [name];
}
if (
(optional === true && (node.optional !== optional))
|| (
optional === false
// `node.optional` can be `undefined` in some parsers
&& node.optional
)
) {
return false;
}
if (typeof argumentsLength === 'number' && node.arguments.length !== argumentsLength) {
return false;
}
if (minimumArguments !== 0 && node.arguments.length < minimumArguments) {
return false;
}
if (Number.isFinite(maximumArguments) && node.arguments.length > maximumArguments) {
return false;
}
if (!allowSpreadElement) {
const maximumArgumentsLength = Number.isFinite(maximumArguments) ? maximumArguments : argumentsLength;
if (
typeof maximumArgumentsLength === 'number'
&& node.arguments.some(
(node, index) =>
node.type === 'SpreadElement'
&& index < maximumArgumentsLength,
)
) {
return false;
}
}
if (
Array.isArray(names)
&& names.length > 0
&& (
node.callee.type !== 'Identifier'
|| !names.includes(node.callee.name)
)
) {
return false;
}
return true;
}
/**
@param {CallOrNewExpressionCheckOptions} [options]
@returns {boolean}
*/
const isCallExpression = (node, options) => create(node, options, ['CallExpression']);
/**
@param {CallOrNewExpressionCheckOptions} [options]
@returns {boolean}
*/
const isNewExpression = (node, options) => {
if (typeof options?.optional === 'boolean') {
throw new TypeError('Cannot check node.optional in `isNewExpression`.');
}
return create(node, options, ['NewExpression']);
};
/**
@param {CallOrNewExpressionCheckOptions} [options]
@returns {boolean}
*/
const isCallOrNewExpression = (node, options) => create(node, options, ['CallExpression', 'NewExpression']);
module.exports = {
isCallExpression,
isNewExpression,
isCallOrNewExpression,
};
```
|
The Minerva Reefs () are a group of two submerged atolls located in the Pacific Ocean between Fiji, Niue and Tonga. The islands are the subject of a territorial dispute between Fiji and Tonga, and in addition were briefly claimed by American Libertarians as the centre of a micronation, the Republic of Minerva.
Name
The reefs were named after the whaleship Minerva, wrecked on what became known as South Minerva after setting out from Sydney in 1829. Many other ships would follow, for example Strathcona, which was sailing north soon after completion in Auckland in 1914. In both cases most of the crew saved themselves in whaleboats or rafts and reached the Lau Islands in Fiji.
History
The reefs were first known to Europeans by the crew of the brig Rosalia, commanded by Lieutenant John Garland, which was shipwrecked there in 1807. The Oriental Navigator for 1816 recorded Garland’s discovery under the name Rosaretta Shoal, warning that it was “a dangerous shoal, on which the Rosaretta, a prize belonging to his Majesty's ship Cornwallis, was wrecked on her passage from Pisco, in Peru, to Port Jackson, in 1807”. It noted that it was “composed of hard coarse sand and coral”, a description that must have come from Garland’s report. It also said that “from the distressed situation of the prize-master, Mr. Garland”, the shoal’s extent could not be ascertained, and concluded: “The situation is not to be considered as finally determined”. It cited different coordinates from those given by Garland: 30°10 South, longitude 173°45' East.
The reefs were put on the charts by Captain John Nicholson of LMS Haweis in December 1818 as reported in The Sydney Gazette 30 January 1819. Captain H. M. Denham of surveyed the reefs in 1854 and renamed them after the Australian whaler Minerva which ran aground on South Minerva Reef on 9 September 1829.
Republic of Minerva
In 1972, real-estate millionaire Michael Oliver, of the Phoenix Foundation, sought to establish a libertarian country on the reefs. Oliver formed a syndicate, the Ocean Life Research Foundation, which had considerable finances for the project and had offices in New York City and London. In 1971, the organization constructed a steel tower on the reef. The Republic of Minerva issued a declaration of independence on 19 January 1972. Morris Davis was elected as the President of Minerva.
However, the islands were also claimed by Tonga. An expedition consisting of 90 prisoners was sent to enforce the claim by building an artificial island with permanent structures above the high-tide mark. Arriving on 18 June 1972, the Flag of the Tonga was raised on the following day on North Minerva and on South Minerva on 21 June 1972. King Tāufaʻāhau Tupou IV announced the annexation of the islands on 26 June; North Minerva was to be renamed Teleki Tokelau, with South Minerva becoming Teleki Tonga. In September 1972, South Pacific Forum recognized Tonga as the only possible owner of the Minerva Reefs, but did not explicitly recognize Tonga's claimed sovereign title.
In 1982, a group of Americans led again by Morris Davis tried to occupy the reefs, but were forced off by Tongan troops after three weeks. According to Reason, Minerva has been "more or less reclaimed by the sea".
Territorial dispute
In 2005, Fiji declared that it did not recognize any maritime water claims by Tonga to the Minerva Reefs under the UNCLOS agreements. In November 2005, Fiji lodged a complaint with the International Seabed Authority concerning Tonga's maritime waters claims surrounding Minerva. Tonga lodged a counter claim. In 2010 the Fijian Navy destroyed navigation lights at the entrance to the lagoon. In late May 2011, they again destroyed navigational equipment installed by Tongans. In early June 2011, two Royal Tongan Navy ships were sent to the reef to replace the equipment, and to reassert Tonga's claim to the territory. Fijian Navy ships in the vicinity reportedly withdrew as the Tongans approached.
In an effort to settle the dispute, the government of Tonga revealed a proposal in early July 2014 to give the Minerva Reefs to Fiji in exchange for the Lau Group of islands. In a statement to the Tonga Daily News, Lands Minister Lord Maʻafu Tukuiʻaulahi announced that he would make the proposal to Fiji's Minister for Foreign Affairs, Ratu Inoke Kubuabola. Some Tongans have Lauan ancestors and many Lauans have Tongan ancestors; Tonga's Lands Minister is named after Enele Ma'afu, the Tongan Prince who originally claimed parts of Lau for Tonga.
Geography
Area: North Reef diameter about , South Reef diameter of about .
Terrain: two atolls on dormant volcanic seamounts.
Both Minerva Reefs are about southwest of the Tongatapu Group.
The atolls are on a common submarine platform from below sea level. North Minerva is circular in shape and has a diameter of about . There is a small sand bar around the atoll, awash at high tide, and a small entrance into the flat lagoon with a somewhat deep harbor. South Minerva is parted into The East Reef and the West Reef, both circular with a diameter of about . Remnants of shipwrecks and platforms remain on the atolls, plus functioning navigation beacons.
Geologically, the Minerva Reefs are of a limestone base formed from uplifted coral formations elevated by now-dormant volcanic activity.
The climate is subtropical with a distinct warm period (December–April), during which the temperatures rise above 32 °C (90 °F), and a cooler period (May–November), with temperatures rarely rising above 27 °C (80 °F). The temperature increases from 23 °C to 27 °C (74 °F to 80 °F), and the annual rainfall is from 1,700 to 2,970 mm (67–117 in) as one moves from Cardea in the south to the more northerly islands closer to the Equator. The mean daily humidity is 80 percent.
Both North and South Minerva Reefs are used as anchorages by private yachts traveling between New Zealand and Tonga or Fiji. North Minerva (Tongan: Teleki Tokelau) offers the more protected anchorage, with a single, easily negotiated, west-facing pass that offers access to the large, calm lagoon with extensive sandy areas. South Minerva (Tongan: Teleki Tonga) is in shape similar to an infinity symbol, with its eastern lobe partially open to the ocean on the northern side.
Shipwrecks
The reefs have been the site of several shipwrecks. The brig Rosalía was wrecked on the Minerva Reefs on 19 September 1807. After being captured by HMS Cornwallis at the Peruvian port of Ilo on 13 July, the Rosalía, 375 tons, was dispatched to Port Jackson with seven men on board under the command of Lieutenant John Garland, master of the Cornwallis. Captain John Piper, Commandant at Norfolk Island, reported the arrival of the shipwrecked crew to Governor William Bligh in Sydney in a letter of 12 October 1807.
On September 9, 1829 a whaling ship from Australia called the Minerva wrecked on the reef.
On July 7, 1962 the Tuaikaepau ('Slow But Sure'), a Tongan vessel on its way to New Zealand, struck the reefs. This wooden vessel was built in 1902 at the same yard as the Strathcona. The crew and passengers survived by living in the remains of a Japanese freighter. There they remained for three months and several died. Without tools, Captain Tēvita Fifita built a small boat using wood recovered from the ship. With this raft, named Malolelei ('Good Day'), he and several others sailed to Fiji in one week.
See also
List of reefs
Micronation
References
Further reading
Interview with Oliver at Stay Free Magazine
External links
Cruising Yachties Experience at Minerva (2003)
Photo Album of Minerva (2007)
Photo Album and underwater images of North Minerva Reef (2009)
Website of the "Principality of Minerva" micronation, which claims the Minerva Reefs
"The Danger and Bounty of the Minerva Reefs"
"On passage from Minerva Reef, November 2, 2003"
Coral reefs
Reefs of the Pacific Ocean
Islands of Tonga
Tourist attractions in Tonga
Territorial disputes of Tonga
Territorial disputes of Fiji
Fiji–Tonga relations
Micronations
Artificial islands
States and territories established in 1972
1972 in Oceania
Atolls of Oceania
|
Harrison McMahon (born 29 January 2006) is an English professional footballer currently playing as a midfielder for Chelsea.
Club career
Born in South Ockendon, McMahon started his career with West Ham United, before joining Chelsea in 2021. He signed his first professional contract with The Blues in January 2023, and has already been called up to train with the first team.
Career statistics
Club
References
2006 births
Living people
Footballers from Essex
English men's footballers
Men's association football midfielders
Chelsea F.C. players
|
Hinganghat is a city in Wardha district of the Indian state of Maharashtra. The city is administered by a Municipal Council and is located about from Wardha and from Maharashtra's second capital Nagpur.
Hinganghat is surrounded on two sides by the Wena River, which provides natural resources. National Highway 44 (old Name NH-7), a part of the North-South Corridor, passes through the city. Hinganghat is located in the fertile Wardha Valley; it was historically a center of the Indian cotton trade and a major centre for grains. The tehsil of Hinganghat comprises about 76 villages. The main language spoken in Hinganghat is Marathi. Hinganghat is the ninth biggest city in Vidharbha the region of Maharashtra and ranks 436 in India [According to the 2011 census].
Baba Amte, the social worker who helped people suffering from Leprosy, was born in Hinganghat. It hosts the largest Cotton mandi in Maharashtra state. Also, it has the tallest statue of lord Vithoba (52 ft) on the banks of river Wena.
History
Hinganghat is 1500 years old. The City was named Dandungram in the century 5 CE. Reign of Rani Prabhavati Gupta, the queen of the Vakataka Dynasty, was also here. The new name Hinganghat fall because of the availability of Hing (assafoetida) trees and ghats of the Vena river.
The Development of Hinganghat was followed by the British and the Municipal Council of Hinganghat which was established on 17 May 1873. The first water tank here was built in 1873. The Municipal Council's Hall was built in 1904. The first Election of the Municipal Council was held in the year 1927. The Wena Dam was created by Municipal Council. Presently, seven water tanks are available. The city was historically a major centre of cotton and soyabean oil. Presently, Hinganghat is the largest industrial hub in Wardha District and ranking 4th in the Nagpur Division. The Dal mills and oil mills are also available here.
Geography
Hinganghat is located at . The city has an average elevation of above sea level, which is low in comparison to the surrounding region. So, the Wena river flows throughout the year and helps the city face no drought. Apart from the river, the average depth of groundwater is around . The Hinganghat APMC market ranks Second in the Vidarbha region also Hinganghat is the one of the biggest APMC of Maharashtra.
The city is a hub of India's cotton industry. There is also a soybean oil industry and numerous small to medium scale dal mills and oil mills in the vicinity of Hinganghat. Hinganghat is the largest industrial hub in Wardha District.
Demographics
In 2011, Hinganghat's population was 101,805. Males constituted 52% of the population.
Hinganghat's average literacy rate of 94% was higher than the Indian national average of 74%. The male literacy rate was 97% and the female literacy rate was 90%. According to the Times of India, Hinganghat has the highest literacy rate of any city in Maharashtra. Literacy data analysed by UNICEF for cities with populations of more than 100,000 puts Hinganghat at the top, with a literacy rate of 94.34%, followed by Wardha (94.05%), Panvel (93.98%) and Gondia (93.70%).
Religion
Hinganghat is home to the world's largest statue of Lord Pandurang, which is tall.
Bansilal Kochar developed the Jain temple in 1955. The decorations of the temple are made of glass. Islam is followed by around 6% of the population and the Jamia Masjid is located near the centre of the city.
In Hinganghat, Garba is worshipped in Mata Mandir, "a temple of Mata Devi". It is the most important place in Navratri in Hinganghat and the oldest temple in the city and the land space was donated by Ganpatro Sadashiv Mawle.
Shitla Mata Is Known as a Gram Devi of Old Hinganghat. Shitla Mata Mandir is Located in Juni Vasti Hinganghat Nearest to the banks of Wana River.
Transport
The Hinganghat railway station lies on the main Delhi to Chennai railway line. It is the major railway station in the region. Express services include the Navjeevan, Nandigram, Andman Express, AhilyaNagri express, Sevagram Express, Dakshin, G.T., Raptisagar Expresses, Secunderabad Superfast express, Kazipet -Pune superfast express, MGR Chennai central-Jaipur superfast express, Gomtisagar Express, Korba superfast express, Trivandrum Central Expresses, Anandwan Superfast express, Yesvantpur Superfast express, Jaipur-Mysuru express, Coimbatore-Jaipur Superfast Express
And Many Trains halt at this Station.
The nearest airport is Dr. Babasaheb Ambedkar International Airport, Nagpur which is 70 km away from the city centre. National Highway 44 passes through Hinganghat.
Agriculture Research Centre
The agriculture research station, Kutki is situated in Hinganghat on Pandharakwada road, which is national highway no. 44. The distance of this research station from the Hinganghat bus stop is 9 km away while from the Hinganghat railway station it is 7 km. Kutki is the nearby village of this station which is only half km away from this station. While going to Hinganghat from Wardha there is a need not to go to Hinganghat to approach this station, but by turning right before of Hinganghat on Pandhrkawada road the station is just 4 km away. A Wana river is there 1.5 km away from the station. By lift irrigation system the water is used for 33.52 Ha area of this station. More irrigation efforts are undergoing. About 19 research trials were conducted in this year Many of it was multi-varietal trials while some were an inorganic trial. Inorganic trials are conducted from the year 2005-2006. This is the identified station for multi-varietal trials.
Notable people
Baba Amte, a social worker and activist known particularly for his work with people suffering from leprosy, was born in Hinganghat on 24 December 1914.
William Lambton, a British soldier, surveyor, and geographer, died in Hinganghat on 19 January 1823 while working on the Great Trigonometric Survey.
Jani Babu, A legendary Indian Sufi and qawwali singer. He was born in 1935 in Hinganghat. He was born Jan Mohammad Jani Babu. He is known for his work on Shankar Shambhu (1976), Mitti (2001) and Market (2003)
Sunil Pal, the winner of Laughter Challenge-1 comedy show.
Vaishali Made, winner of Sa Re Ga Ma Pa, an Indian musical reality TV Show.
Nisha Mohota, an Indian chess player who holds the FIDE titles of International Master (IM) and Woman Grandmaster (WGM). She is the first WGM from the State of West Bengal. She became the then youngest Woman International Master (WIM) in April 1995 at the age of 14 years, 6 months and 13 days on April 26, 1995.
D.P. Kothari is an educationist and professor who has held leadership positions at engineering institutions in India including IIT Delhi, Visvesvaraya National Institute of Technology, Nagpur and VIT University, Vellore.
Satyapal Landage (Satyapal), Comedian, Actor & voice over artist, Films star, TV actor ( Maddam sir - SAB TV ) - Badnaam, ( Motu - Patlu ) - John, ( Dabangg ) - bachha bhaiya.
References
External links
Cities and towns in Wardha district
Talukas in Maharashtra
Cities in Maharashtra
|
SAM Basket Massagno, for sponsorship reasons Spinelli Massagno, is a professional basketball club based in Massagno, Switzerland. The team currently plays in the Swiss Basketball League, the highest professional division in Switzerland. The team plays its home games at the palestra di Nosedo (SEM Nosedo), which has a capacity of 1,000 people.
Honours
SBL Cup
Runners-up (2): 2019, 2021
Notable players
Clint Chapman
References
Basketball teams in Switzerland
|
Symphony in D can refer to:
List of symphonies in D minor
List of symphonies in D major
See also
List of symphonies by key
|
KSLO AM 1230 is a Catholic radio station licensed to Opelousas, Louisiana. KSLO simulcasts the programming of KLFT 90.5 in Kaplan, Louisiana. KSLO is owned by Delta Media Corporation. KSLO's studios are located on Evangeline Thruway in Carencro, and its transmitter is located in Opelousas.
History
KSLO was Opelousas' first radio station, beginning broadcasting September 21, 1947, on 1230 kHz with a power of 250 watts. The station was owned and operated by Hugh O. Jones and W. Eugene Jones. It was affiliated with the Mutual network and used the United Press news service and World Broadcasting System transcriptions.
Simulcast
KSLO simulcasts the programming of 90.5 KLFT in Kaplan, Louisiana.
References
External links
Catholic radio stations
Opelousas, Louisiana
Radio stations established in 1947
1947 establishments in Louisiana
Christian radio stations in Louisiana
Catholic Church in Louisiana
|
Talk to the Animals is an Australian television series. It originally was broadcast on the Seven Network between 1993 and 1996, where it was hosted by Harry Cooper. In 2006, the show was relaunched on the Nine Network with Nicky Buckley hosting. In 2010, Dr. Katrina Warren took over the hosting duties. The program also screened internationally on Animal Planet.
The series focuses on the extraordinary relationships between people and animals. It ranges from adventures in the wild to domestic pet advice.
External links
Official site
Seven Network original programming
Nine Network original programming
1993 Australian television series debuts
1996 Australian television series endings
2006 Australian television series debuts
2010 Australian television series endings
English-language television shows
Animal Planet original programming
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.