text stringlengths 1 22.8M |
|---|
Lake View School District #25 was a school district headquartered in Lake View, Arkansas. Its schools were Lake View Elementary School (K-6) and C. V. White High School (7-12).
In 1992 the school district sued the state government, accusing it of unevenly funding school districts. As a result of that lawsuit and others, in November 2002 the Arkansas Supreme Court decided that the state needed to increase the funding of public schools through new laws. Among the new laws written was one forcing school districts with under 350 students to consolidate into other school districts. In 2004, its final year of operation, the Lake View district had 136 students; the small size made the district eligible for forced consolidation. Until April 1, 2004, the district could have entered into a mutual agreement with another district, but it was unable to find a merger partner. The Arkansas Board of Education now had the power to force a consolidation. Clausey Myton, Henrietta Wilson Irma Morehouse, and Everlene R. Tucker, respectively the superintendent, school board president, and two board members of the Lake View district, wrote a letter criticizing the forced consolidation, accusing the state of attacking "institutions of color and persons of color", and stating "The district has not waged a 14-year fight for equal treatment under the law for the purpose of kowtowing to the newest manifestation of state discrimination." On July 1, 2004, the district was consolidated into the Barton-Lexa School District.
References
Further reading
Maps of the district
2004-2005 School District Map
Map of Arkansas School Districts pre-July 1, 2004
(Download)
External links
Lake View School District No. 25 Phillips County, Arkansas General Purpose Financial Statements and Other Reports June 30, 2001
Lake View School District No. 25 Phillips County, Arkansas Basic Financial Statements and Other Reports June 30, 2004
LAKE VIEW SCHOOL DISTRICT NO. 25 OF Phillips County, et al. V. NO. 01-836 MIKE HUCKABEE, Governor of the State of Arkansas, et al.
Defunct school districts in Arkansas
2004 disestablishments in Arkansas
School districts disestablished in 2004
Education in Phillips County, Arkansas |
```c++
// The following code fragment is taken from CMyApp::InitInstance.
// CMyApp is derived from CWinApp.
// The main window has been initialized, so show and update it
// using the nCmdShow parameter passed to the application when it
// was first launched.
// pMainFrame is the main MDI frame window of our app and is derived
// from CMDIFrameWnd.
pMainFrame->ShowWindow(m_nCmdShow);
pMainFrame->UpdateWindow();
``` |
Épico is the debut studio album by Puerto Rican singer Lunay. Released on October 25, 2019, under the label Star Island, the album features 14 tracks, and features collaborations with urban artists such as Daddy Yankee, Bad Bunny, Ozuna, Anuel AA, Myke Towers, Wisin & Yandel, Brytiago, Lyanno, Alex Rose, Darell, Chris Jeday and Gaby Music. It was released 14 months after Lunay started his musical career.
Critical reception
Remezcla called Épico a "14-track wonder of Reggaeton, Latin trap and dancehall influences that mark a young artist who is already well on his way to mainstay status in música urbana. (Épico is certainly a manifestation, if not ambitious, in its "epic" name.)"
Track listing
Charts
Weekly charts
Year-end charts
References
2019 debut albums
Reggaeton albums
Spanish-language albums |
```php
<?php
declare(strict_types=1);
return [
[2, '2.5, 1'],
[-2, '-2.5, -2'],
[-4, '-2.5, 2'],
[0.0, '0.0, 1'],
['#NUM!', '2.5, -2'],
['#DIV/0!', '123.456, 0'],
[1.5, '1.5, 0.1'],
[0.23, '0.234, 0.01'],
['exception', '123.456'],
['#VALUE!', '"ABC", 1'],
[15, '"17", "3"'],
[16, '19, 4'],
[0, ',1'],
[0, 'false,1'],
[1, 'true,1'],
['#VALUE!', '"", 1'],
[1, 'A2, 1'],
[2, 'A3, 1'],
[-4, 'A4, 1'],
[-6, 'A5, 1'],
];
``` |
```xml
/*
*
* See the LICENSE file at the top-level directory of this distribution
* for licensing information.
*
* Unless otherwise agreed in a custom licensing agreement with the Lisk Foundation,
* no part of this software, including this file, may be copied, modified,
* propagated, or distributed except according to the terms contained in the
* LICENSE file.
*
* Removal or modification of this copyright notice is prohibited.
*/
import { BlockAsset, BlockAssets } from '@liskhq/lisk-chain';
import { codec } from '@liskhq/lisk-codec';
import * as cryptography from '@liskhq/lisk-cryptography';
import { objects } from '@liskhq/lisk-utils';
import { RandomMethod } from '../../../../src/modules/random/method';
import { SEED_LENGTH } from '../../../../src/modules/random/constants';
import { blockHeaderAssetRandomModule } from '../../../../src/modules/random/schemas';
import { bitwiseXOR } from '../../../../src/modules/random/utils';
import { MethodContext } from '../../../../src/state_machine';
import { createTransientMethodContext } from '../../../../src/testing';
import * as genesisValidators from '../../../fixtures/genesis_validators.json';
import { testCases } from '../../../fixtures/pos_random_seed_generation/pos_random_seed_generation_other_rounds.json';
import { RandomModule } from '../../../../src/modules/random';
import {
ValidatorRevealsStore,
ValidatorSeedReveal,
} from '../../../../src/modules/random/stores/validator_reveals';
const strippedHashOfIntegerBuffer = (num: number) =>
cryptography.utils.hash(cryptography.utils.intToBuffer(num, 4)).subarray(0, SEED_LENGTH);
describe('RandomModuleMethod', () => {
let randomMethod: RandomMethod;
let context: MethodContext;
let randomStore: ValidatorRevealsStore;
const randomModule = new RandomModule();
const EMPTY_BYTES = Buffer.alloc(0);
describe('isSeedRevealValid', () => {
const twoRoundsValidators: ValidatorSeedReveal[] = [];
const twoRoundsValidatorsHashes: { [key: string]: Buffer[] } = {};
for (const generator of testCases[0].input.blocks) {
const generatorAddress = cryptography.address.getAddressFromPublicKey(
Buffer.from(generator.generatorPublicKey, 'hex'),
);
const seedReveal = Buffer.from(generator.asset.seedReveal, 'hex');
twoRoundsValidators.push({
generatorAddress,
seedReveal,
height: generator.height,
valid: true,
});
if (!twoRoundsValidatorsHashes[generatorAddress.toString('hex')]) {
twoRoundsValidatorsHashes[generatorAddress.toString('hex')] = [];
}
twoRoundsValidatorsHashes[generatorAddress.toString('hex')].push(seedReveal);
}
beforeEach(async () => {
randomMethod = new RandomMethod(randomModule.stores, randomModule.events, randomModule.name);
context = createTransientMethodContext({});
randomStore = randomModule.stores.get(ValidatorRevealsStore);
await randomStore.set(context, EMPTY_BYTES, {
validatorReveals: twoRoundsValidators.slice(0, 103),
});
});
it('should throw error when asset is undefined', async () => {
// Arrange
const validatorAddress = cryptography.address.getAddressFromPublicKey(
Buffer.from(testCases[0].input.blocks[0].generatorPublicKey, 'hex'),
);
const blockAsset: BlockAsset = {
module: randomModule.name,
data: undefined as any,
};
// Act & Assert
await expect(
randomMethod.isSeedRevealValid(context, validatorAddress, new BlockAssets([blockAsset])),
).rejects.toThrow('Block asset is missing.');
});
it('should return true if the last revealed seed by generatorAddress in validatorReveals array is equal to the hash of seedReveal', async () => {
for (const [address, hashes] of Object.entries(twoRoundsValidatorsHashes)) {
// Arrange
const blockAsset: BlockAsset = {
module: randomModule.name,
data: codec.encode(blockHeaderAssetRandomModule, { seedReveal: hashes[1] }),
};
// Act
const isValid = await randomMethod.isSeedRevealValid(
context,
Buffer.from(address, 'hex'),
new BlockAssets([blockAsset]),
);
// Assert
expect(isValid).toBe(true);
}
});
it('should return true if no last seed reveal found', async () => {
// Arrange
await randomStore.set(context, EMPTY_BYTES, { validatorReveals: [] });
for (const [address, hashes] of Object.entries(twoRoundsValidatorsHashes)) {
const blockAsset: BlockAsset = {
module: randomModule.name,
data: codec.encode(blockHeaderAssetRandomModule, { seedReveal: hashes[1] }),
};
// Act
const isValid = await randomMethod.isSeedRevealValid(
context,
Buffer.from(address, 'hex'),
new BlockAssets([blockAsset]),
);
// Assert
expect(isValid).toBe(true);
}
});
it('should return false if there is a last revealed seed by generatorAddress in validatorReveals array but it is not equal to the hash of seedReveal', async () => {
await randomStore.set(context, EMPTY_BYTES, { validatorReveals: twoRoundsValidators });
for (const [address, hashes] of Object.entries(twoRoundsValidatorsHashes)) {
// Arrange
const blockAsset: BlockAsset = {
module: randomModule.name,
data: codec.encode(blockHeaderAssetRandomModule, { seedReveal: hashes[1] }),
};
// Act
const isValid = await randomMethod.isSeedRevealValid(
context,
Buffer.from(address, 'hex'),
new BlockAssets([blockAsset]),
);
// Assert
expect(isValid).toBe(false);
}
});
it('should return true if generatorAddress is not present in any element of validatorReveals array', async () => {
// Arrange
const { generatorAddress } = twoRoundsValidators[5];
const twoRoundsValidatorsClone1 = objects.cloneDeep(twoRoundsValidators);
twoRoundsValidatorsClone1[5].generatorAddress = Buffer.alloc(0);
await randomStore.set(context, EMPTY_BYTES, {
validatorReveals: twoRoundsValidatorsClone1.slice(0, 103),
});
const hashes = twoRoundsValidatorsHashes[generatorAddress.toString('hex')];
const blockAsset: BlockAsset = {
module: randomModule.name,
data: codec.encode(blockHeaderAssetRandomModule, { seedReveal: hashes[1] }),
};
// Act
const isValid = await randomMethod.isSeedRevealValid(
context,
generatorAddress,
new BlockAssets([blockAsset]),
);
// Assert
expect(isValid).toBe(true);
});
it('should return false if seedreveal is not a 16-bytes value', async () => {
// Arrange
const { generatorAddress } = twoRoundsValidators[5];
const twoRoundsValidatorsClone2 = twoRoundsValidators;
twoRoundsValidatorsClone2[5].seedReveal = cryptography.utils.getRandomBytes(17);
await randomStore.set(context, EMPTY_BYTES, {
validatorReveals: twoRoundsValidatorsClone2.slice(0, 103),
});
const hashes = twoRoundsValidatorsHashes[generatorAddress.toString('hex')];
const blockAsset: BlockAsset = {
module: randomModule.name,
data: codec.encode(blockHeaderAssetRandomModule, { seedReveal: hashes[1] }),
};
// Act
const isValid = await randomMethod.isSeedRevealValid(
context,
generatorAddress,
new BlockAssets([blockAsset]),
);
// Assert
expect(isValid).toBe(false);
});
it('should return false if generatorAddress is not a 20-byte input', async () => {
// Arrange
const generatorAddress = cryptography.utils.getRandomBytes(21);
const twoRoundsValidatorsClone3 = objects.cloneDeep(twoRoundsValidators);
twoRoundsValidatorsClone3[5].generatorAddress = generatorAddress;
await randomStore.set(context, EMPTY_BYTES, {
validatorReveals: twoRoundsValidatorsClone3.slice(0, 103),
});
const hashes =
twoRoundsValidatorsHashes[twoRoundsValidators[5].generatorAddress.toString('hex')];
const blockAsset: BlockAsset = {
module: randomModule.name,
data: codec.encode(blockHeaderAssetRandomModule, { seedReveal: hashes[1] }),
};
// Act
const isValid = await randomMethod.isSeedRevealValid(
context,
generatorAddress,
new BlockAssets([blockAsset]),
);
// Assert
expect(isValid).toBe(false);
});
});
describe('getRandomBytes', () => {
const validatorsData = [
{
generatorAddress: Buffer.from(genesisValidators.validators[0].address, 'hex'),
seedReveal: Buffer.from(genesisValidators.validators[0].hashOnion.hashes[1], 'hex'),
height: 11,
valid: true,
},
{
generatorAddress: Buffer.from(genesisValidators.validators[0].address, 'hex'),
seedReveal: Buffer.from(genesisValidators.validators[0].hashOnion.hashes[2], 'hex'),
height: 13,
valid: true,
},
{
generatorAddress: Buffer.from(genesisValidators.validators[0].address, 'hex'),
seedReveal: Buffer.from(genesisValidators.validators[0].hashOnion.hashes[3], 'hex'),
height: 17,
valid: true,
},
{
generatorAddress: Buffer.from(genesisValidators.validators[0].address, 'hex'),
seedReveal: Buffer.from(genesisValidators.validators[0].hashOnion.hashes[4], 'hex'),
height: 19,
valid: true,
},
{
generatorAddress: Buffer.from(genesisValidators.validators[1].address, 'hex'),
seedReveal: Buffer.from(genesisValidators.validators[1].hashOnion.hashes[1], 'hex'),
height: 14,
valid: true,
},
{
generatorAddress: Buffer.from(genesisValidators.validators[2].address, 'hex'),
seedReveal: Buffer.from(genesisValidators.validators[2].hashOnion.hashes[1], 'hex'),
height: 15,
valid: false,
},
];
beforeEach(async () => {
randomMethod = new RandomMethod(randomModule.stores, randomModule.events, randomModule.name);
context = createTransientMethodContext({});
randomStore = randomModule.stores.get(ValidatorRevealsStore);
await randomStore.set(context, EMPTY_BYTES, { validatorReveals: validatorsData });
});
it('should throw error when height is negative', async () => {
const height = -11;
const numberOfSeeds = 2;
await expect(randomMethod.getRandomBytes(context, height, numberOfSeeds)).rejects.toThrow(
'Height or number of seeds cannot be negative.',
);
});
it('should throw error when numberOfSeeds is negative', async () => {
const height = 11;
const numberOfSeeds = -2;
await expect(randomMethod.getRandomBytes(context, height, numberOfSeeds)).rejects.toThrow(
'Height or number of seeds cannot be negative.',
);
});
it('should throw error if for every seedObject element in validatorReveals height > seedObject.height', async () => {
const height = 35;
const numberOfSeeds = 5;
await expect(randomMethod.getRandomBytes(context, height, numberOfSeeds)).rejects.toThrow(
'Height is in the future.',
);
});
it('should throw error when height is non integer input', async () => {
const height = 5.1;
const numberOfSeeds = 2;
await expect(randomMethod.getRandomBytes(context, height, numberOfSeeds)).rejects.toThrow(
'Height or number of seeds cannot be non integer.',
);
});
it('should throw error when number of seeds is non integer input', async () => {
const height = 5;
const numberOfSeeds = 0.3;
await expect(randomMethod.getRandomBytes(context, height, numberOfSeeds)).rejects.toThrow(
'Height or number of seeds cannot be non integer.',
);
});
it('should return XOR random bytes as 16 bytes value for height=11, numberOfSeeds=3', async () => {
const height = 11;
const numberOfSeeds = 3;
// Create a buffer from height + numberOfSeeds
const randomSeed = strippedHashOfIntegerBuffer(height + numberOfSeeds);
const hashesExpected = [
Buffer.from(genesisValidators.validators[0].hashOnion.hashes[1], 'hex'),
Buffer.from(genesisValidators.validators[0].hashOnion.hashes[2], 'hex'),
];
// Do XOR of randomSeed with hashes of seed reveal with height >= randomStoreValidator.height >= height + numberOfSeeds
const xorExpected = bitwiseXOR([randomSeed, ...hashesExpected]);
expect(xorExpected).toHaveLength(16);
await expect(randomMethod.getRandomBytes(context, height, numberOfSeeds)).resolves.toEqual(
xorExpected,
);
});
it('should return XOR random bytes for height=11, numberOfSeeds=4', async () => {
const height = 11;
const numberOfSeeds = 4;
// Create a buffer from height + numberOfSeeds
const randomSeed = strippedHashOfIntegerBuffer(height + numberOfSeeds);
const hashesExpected = [
Buffer.from(genesisValidators.validators[0].hashOnion.hashes[1], 'hex'),
Buffer.from(genesisValidators.validators[0].hashOnion.hashes[2], 'hex'),
Buffer.from(genesisValidators.validators[1].hashOnion.hashes[1], 'hex'),
];
// Do XOR of randomSeed with hashes of seed reveal with height >= randomStoreValidator.height >= height + numberOfSeeds
const xorExpected = bitwiseXOR([randomSeed, ...hashesExpected]);
await expect(randomMethod.getRandomBytes(context, height, numberOfSeeds)).resolves.toEqual(
xorExpected,
);
});
it('should return XOR random bytes for height=11, numberOfSeeds=5 excluding invalid seed reveal', async () => {
const height = 11;
const numberOfSeeds = 5;
// Create a buffer from height + numberOfSeeds
const randomSeed = strippedHashOfIntegerBuffer(height + numberOfSeeds);
const hashesExpected = [
Buffer.from(genesisValidators.validators[0].hashOnion.hashes[1], 'hex'),
Buffer.from(genesisValidators.validators[0].hashOnion.hashes[2], 'hex'),
Buffer.from(genesisValidators.validators[1].hashOnion.hashes[1], 'hex'),
];
// Do XOR of randomSeed with hashes of seed reveal with height >= randomStoreValidator.height >= height + numberOfSeeds
const xorExpected = bitwiseXOR([
bitwiseXOR([bitwiseXOR([randomSeed, hashesExpected[0]]), hashesExpected[1]]),
hashesExpected[2],
]);
await expect(randomMethod.getRandomBytes(context, height, numberOfSeeds)).resolves.toEqual(
xorExpected,
);
});
it('should return XOR random bytes for height=8, numberOfSeeds=4', async () => {
const height = 8;
const numberOfSeeds = 4;
// Create a buffer from height + numberOfSeeds
const randomSeed = strippedHashOfIntegerBuffer(height + numberOfSeeds);
const hashesExpected = [
Buffer.from(genesisValidators.validators[0].hashOnion.hashes[1], 'hex'),
];
// Do XOR of randomSeed with hashes of seed reveal with height >= randomStoreValidator.height >= height + numberOfSeeds
const xorExpected = bitwiseXOR([randomSeed, ...hashesExpected]);
await expect(randomMethod.getRandomBytes(context, height, numberOfSeeds)).resolves.toEqual(
xorExpected,
);
});
it('should return initial random bytes for height=7, numberOfSeeds=3', async () => {
const height = 7;
const numberOfSeeds = 3;
// Create a buffer from height + numberOfSeeds
const randomSeed = strippedHashOfIntegerBuffer(height + numberOfSeeds);
await expect(randomMethod.getRandomBytes(context, height, numberOfSeeds)).resolves.toEqual(
randomSeed,
);
});
it('should throw error for height=20, numberOfSeeds=1', async () => {
const height = 20;
const numberOfSeeds = 1;
await expect(randomMethod.getRandomBytes(context, height, numberOfSeeds)).rejects.toThrow(
'Height is in the future.',
);
});
});
describe('getRandomBytes from protocol specs', () => {
describe.each([...testCases].map(testCase => [testCase.description, testCase]))(
'%s',
(_description, testCase) => {
// Arrange
const { config, input, output } = testCase as any;
const validators: ValidatorSeedReveal[] = [];
for (const generator of input.blocks) {
const generatorAddress = cryptography.address.getAddressFromPublicKey(
Buffer.from(generator.generatorPublicKey, 'hex'),
);
const seedReveal = Buffer.from(generator.asset.seedReveal, 'hex');
validators.push({
generatorAddress,
seedReveal,
height: generator.height,
valid: true,
});
}
beforeEach(async () => {
randomMethod = new RandomMethod(
randomModule.stores,
randomModule.events,
randomModule.name,
);
context = createTransientMethodContext({});
randomStore = randomModule.stores.get(ValidatorRevealsStore);
await randomStore.set(context, EMPTY_BYTES, { validatorReveals: validators });
});
it('should generate correct random seeds', async () => {
// Arrange
// For randomSeed 1
const round = Math.floor(
input.blocks[input.blocks.length - 1].height / config.blocksPerRound,
);
const middleThreshold = Math.floor(config.blocksPerRound / 2);
const startOfRound = config.blocksPerRound * (round - 1) + 1;
// To validate seed reveal of any block in the last round we have to check till second last round that doesn't exist for last round
const heightForSeed1 = startOfRound - (round === 2 ? 0 : middleThreshold);
// For randomSeed 2
const endOfLastRound = startOfRound - 1;
const startOfLastRound = endOfLastRound - config.blocksPerRound + 1;
// Act
const randomSeed1 = await randomMethod.getRandomBytes(
context,
heightForSeed1,
round === 2 ? middleThreshold : middleThreshold * 2,
);
// There is previous round for last round when round is 2
const randomSeed2 =
round === 2
? strippedHashOfIntegerBuffer(endOfLastRound)
: await randomMethod.getRandomBytes(context, startOfLastRound, middleThreshold * 2);
// Assert
expect(randomSeed1.toString('hex')).toEqual(output.randomSeed1);
expect(randomSeed2.toString('hex')).toEqual(output.randomSeed2);
});
},
);
});
});
``` |
```java
package com.linchaolong.apktoolplus.module.settings;
import javafx.fxml.FXML;
import javafx.fxml.Initializable;
import javafx.scene.control.Button;
import javafx.scene.control.TextField;
import com.linchaolong.apktoolplus.base.Activity;
import com.linchaolong.apktoolplus.Config;
import com.linchaolong.apktoolplus.ui.DirectorySelecter;
import com.linchaolong.apktoolplus.ui.FileSelecter;
import com.linchaolong.apktoolplus.utils.ViewUtils;
import com.linchaolong.apktoolplus.utils.FileHelper;
import java.io.File;
import java.net.URL;
import java.util.ResourceBundle;
/**
* Created by linchaolong on 2016/3/29.
*/
public class CommonSettingsActivity extends Activity implements Initializable{
public static final String TAG = CommonSettingsActivity.class.getSimpleName();
@FXML
TextField textFieldSublimePath;
@FXML
Button btnSublimeSelect;
@FXML
TextField textFieldAppOutPath;
@FXML
TextField textFieldCmdParams;
@Override
public void initialize(URL location, ResourceBundle resources) {
//
review();
//
ViewUtils.listenerInputAndSave(textFieldCmdParams,Config.kSublimeCmdParams);
}
public void selectSublime(){
File lastDir = Config.getDir(Config.kSublimePath);
File sublimeFile = FileSelecter.create(btnSublimeSelect.getParent().getScene().getWindow())
.addFilter("exe")
.addFilter("*")
.setInitDir(lastDir)
.setTitle("sublime")
.showDialog();
if(sublimeFile != null){
textFieldSublimePath.setText(sublimeFile.getPath());
Config.set(Config.kSublimePath,sublimeFile.getPath());
}
}
/**
* EasySDK
*/
public void selectAppOut(){
File lastDir = Config.getDir(Config.kAppOutputDir);
File dir = DirectorySelecter.create(btnSublimeSelect.getParent().getScene().getWindow())
.setInitDir(lastDir)
.setTitle("")
.showDialog();
if(FileHelper.exists(dir)){
textFieldAppOutPath.setText(dir.getPath());
Config.set(Config.kAppOutputDir,dir.getPath());
}
}
/**
*
*/
private void review() {
// sublime
ViewUtils.review(textFieldSublimePath,Config.kSublimePath);
//
ViewUtils.review(textFieldCmdParams,Config.kSublimeCmdParams);
// ApkToolPlus
ViewUtils.review(textFieldAppOutPath,Config.kAppOutputDir);
}
}
``` |
```python
"""Provide a compatibility layer for requests.auth.HTTPDigestAuth."""
import requests
class _ThreadingDescriptor(object):
def __init__(self, prop, default):
self.prop = prop
self.default = default
def __get__(self, obj, objtype=None):
return getattr(obj._thread_local, self.prop, self.default)
def __set__(self, obj, value):
setattr(obj._thread_local, self.prop, value)
class _HTTPDigestAuth(requests.auth.HTTPDigestAuth):
init = _ThreadingDescriptor('init', True)
last_nonce = _ThreadingDescriptor('last_nonce', '')
nonce_count = _ThreadingDescriptor('nonce_count', 0)
chal = _ThreadingDescriptor('chal', {})
pos = _ThreadingDescriptor('pos', None)
num_401_calls = _ThreadingDescriptor('num_401_calls', 1)
if requests.__build__ < 0x020800:
HTTPDigestAuth = requests.auth.HTTPDigestAuth
else:
HTTPDigestAuth = _HTTPDigestAuth
``` |
Canthon depressipennis is a species in the beetle family Scarabaeidae.
References
Further reading
Deltochilini
Articles created by Qbugbot
Beetles described in 1859 |
The Free Church of England (FCE) is an episcopal church based in England. The church was founded when a number of congregations separated from the established Church of England in the middle of the 19th century.
The doctrinal basis of the FCE, together with its episcopal structures, organisation, worship, ministry and ethos are recognisably "Anglican" although it is not a member of the Anglican Communion. Its worship style follows that of the Book of Common Prayer or conservative modern-language forms that belong to the Anglican tradition.
The Church of England acknowledges the FCE as a church with valid Orders and its canons permit a range of shared liturgical and ministerial activities.
History
The Free Church of England was founded principally by Evangelical or Low Church clergy and congregations in response to what were perceived as attempts (inspired by the Oxford Movement) to re-introduce medieval Roman Catholic dogmas and practices into the Church of England, England's established church. The first congregation was formed by the Revd. James Shore at St John's Church Bridgetown, Totnes, Devon, in 1844.
In the early years, clergy were often provided by the Countess of Huntingdon's Connexion which had its origins in the 18th century Evangelical Revival. By the middle of the 19th century the Connexion still retained many Anglican features such as the use of the surplice and the Book of Common Prayer.
The first bishop was Benjamin Price, who initially had oversight of all the new congregations.
In 1874 the FCE made contact with the newly organised Reformed Episcopal Church in North America.
In 1956, the FCE published a revision of the Book of Common Prayer to form the primary text of the denomination's liturgy. The stated intention of the revision was to remove or explain "particular phrases and expressions" from the Church of England's 1662 edition of the prayer book that "afford at least plausible ground for the teaching and practice of the Sacerdotal and Romanising Party".
In 2003, due to the adoption of High Church practices by the FCE, two bishops and ten congregations split from the main Church and formed the Evangelical Connexion of the Free Church of England. Three of these congregations returned to the FCE - those in Exeter (which subsequently left the FCE again in April 2023), Middlesbrough and Oswaldtwistle. Two churches in Farnham and Teddington having become independent altogether, the ECFCE currently has five churches in Fleetwood, Leeds, Leigh-on-Sea, Tuebrook (Liverpool) and Workington.
Organisation
The provision of contemporary language liturgies has been approved by convocation and a process of drafting and authorisation has begun. The church has continued to ordain bishops in the apostolic succession, with Moravian, Church of England and Malankara Orthodox Syrian Church bishops taking part on occasion.
Dioceses
The united church enjoyed modest growth in the first part of the 20th century, having at one point 90 congregations, but after the Second World War, like most other denominations in the UK, suffered a decline in numbers, though there has been a modest increase in the number of congregations in recent years. The 18 UK churches are located as follows.
Northern Diocese
Bishops:
–1917: William Troughton
1927–1958: Frank Vaughan
1958–1967: Thomas Cameron
1967–1973: James Burrell
1973–1998: Cyril Milner
1999–2003: Arthur Bentley-Taylor
2003–2006: John McLean
2006–present: John Fenwick
St Stephen's, Middlesbrough closed its building in 2017. The church continued to meet in a community centre but closed in 2021.
Southern Diocese
Bishops:
1889–1896: Benjamin Price
1896–1901: Samuel Dicksee
1904–1927: Richard Brook Lander
1927–1934: Joseph Fenn
1934–1955: John Magee
1955–1968: George Forbes-Smith
1968–1971: Ambrose Bodfish
1972–1976: William Watkins
1977–1990: Arthur Ward
1990–2006: Kenneth Powell
2007–present: Paul Hunt
Churches:
Christ Church in Crowborough, East Sussex was founded in 1879 and remained in use by the Free Church of England until the early 21st century. It is now an independent Evangelical church.
Emmanuel Anglican Church, Tunbridge Wells, was founded in 2016 and joined the FCE in 2019. Its minister, Peter Sanlon, had previously been a Church of England minister. In May 2021 the church announced it was withdrawing from the FCE following concerns about governance in the FCE and the conduct of Bishop John Fenwick. The same decision was taken by Christ Church, Exmouth (founded 1896; minister Josep Rosello), and Christ Church Balham (founded in 2002 as an independent Anglican church; joined FCE 2019).
St Peter's, Croydon, was a new FCE church in 2018.
South American Diocese
The work in South America, comprising 25 congregations, was recognised as an Overseas Diocese by the Convocation held in June 2018. The 16 Brazilian congregations are registered as the Anglican Reformed Church of Brazil (; IARB).
On 5 May 2021, the South American Diocese withdrew from the FCE, citing a 'total loss of confidence in the leadership of the FCE' and 'abuses of power committed by Bishop John Fenwick.'
Recognition of orders
In January 2013 it was announced that the Church of England had recognised the holy orders of the Free Church of England. This move followed approximately three years of contact between the bishops of the Free Church of England, the Council for Christian Unity and the Faith and Order Commission. The recognition was not voted on by the General Synod but was endorsed by the standing committee of the House of Bishops. John McLean, the then Bishop Primus of the Free Church of England, said: "We are grateful to the archbishops for this recognition of our common episcopal heritage. I pray that it will not be an end in itself, but will lead to new opportunities for proclaiming the Gospel." Christopher Hill, Bishop of Guildford and chair of the Church of England's Council for Christian Unity, said: "I hope there will be good relations between us and especially in those places where there is a Free Church of England congregation."
Recognition of the orders of the Free Church of England under the Overseas and Other Clergy (Ministry and Ordination) Measure 1967 means that FCE clergy are eligible to be given permission under that measure to officiate in the Church of England, subject to such procedures and authorisations as may be required. A number have been so authorised while remaining clergy of the FCE in good standing. The measure also permits FCE bishops to ordain and perform other episcopal functions at the request of the bishop of a diocese in the provinces of Canterbury and York, subject to the consent of the relevant archbishop.
Relationships
The FCE is in communion with the Reformed Episcopal Church, which itself is now a member of the Anglican Church in North America. Within the UK the FCE is a member of the Free Churches Group and Churches Together in England. From 1992 to 1997 the FCE was in official dialogue with the Church of England, which the 1998 Lambeth Conference saw as a sign of hope. It is a Designated Church under the Church of England's Ecumenical Relations Measure 1988.
FCE bishops have attended the enthronements of George Carey, Rowan Williams and Justin Welby as Archbishops of Canterbury. Since 2013, the Free Church of England has been in dialogue with the conservative Old Catholic Churches of the Union of Scranton for a time.
Anglican realignment
The FCE has been involved in the realignments within the Anglican Communion. In 2009 the Church was represented at the launch of the Fellowship of Confessing Anglicans (UK & Ireland), the local expression of the GAFCON movement inaugurated the previous year in Jerusalem. In October 2013, the Bishop Primus John Fenwick attended the second Global Anglican Future Conference (GAFCON 2) in Nairobi. He has been consulted in the restructuring of GAFCON UK (the successor body to the Fellowship of Confessing Anglicans (UK & Ireland)) under the leadership of Bishop Andy Lines, the ACNA Missionary Bishop endorsed by the GAFCON Primates.
In February 2016, Foley Beach, Archbishop of the Anglican Church in North America, signed an instrument declaring the Anglican Church in North America to be in full communion with the Free Church of England, and recognising "their congregations, clergy, and sacraments, while pledging to work together for the proclamation of the Good News of Jesus Christ and the making of his disciples throughout the world". Archbishop Beach's declaration was ratified by the Provincial Council of the ACNA in June 2016.
Notable people
Calvin Robinson, political commentator and broadcaster. Currently serving as a deacon at Christ Church, Harlesden. Formerly a minister in training for the Church of England, Robinson was denied ordination in 2022 and joined the FCE, where he was ordained as a deacon.
References
Further reading
External links
Free Church of England Book of Common Prayer (1956) digitized by Richard Mammana
Religious organisations based in England
Christian denominations in England
Evangelical Anglicanism
History of the Church of England
Anglicanism in the United Kingdom
Anglican realignment denominations
Religious organizations established in 1844
1844 establishments in England
Reformed denominations in the United Kingdom
Anglican organizations established in the 19th century |
Lorenzo Cellerino (born 30 December 1944) is an Italian former sprinter
Biography
He competed in the 1972 Summer Olympics.
Olympic results
National titles
He has won 2 times the team national championship.
1 win in the 4x100 m relay (1969)
1 win in the 4x400 m relay (1973)
References
External links
1944 births
Living people
Sportspeople from Alessandria
Italian male sprinters
Olympic athletes for Italy
Athletes (track and field) at the 1972 Summer Olympics
European Athletics Championships medalists
Mediterranean Games gold medalists for Italy
Athletes (track and field) at the 1971 Mediterranean Games
Mediterranean Games medalists in athletics
20th-century Italian people
21st-century Italian people |
```javascript
Check if an argument is a number
Deleting properties
Precision
Closures
Scope and strict mode
``` |
Sally Oliver (born 26 December 1983) is an English actress who appeared in British soap opera Emmerdale from July 2007 to August 2009, playing the character of Lexi, the daughter of Carrie Nicholls (played by Linda Lusardi) and the sister of Scarlett Nicholls (played by Kelsey-Beth Crossley). Emmerdale was Sally's first television role.
As a theatre actress, Sally made her professional London debut playing the role of Catherine in Proof at the Arts Theatre in February/March 2007. The role was originally played in London by Gwyneth Paltrow.
Sally grew up in Dagenham, East London, and attended William Bellamy Junior and Infants Schools, St Edwards Secondary School, before later moving to Havering Sixth Form College in September 2000 to study for her A' Levels.
Sally had a cameo role as Caitlin in Holby City in August 2010.
External links
Living people
English soap opera actresses
1983 births
People educated at Havering Sixth Form College
People from Dagenham
Actresses from London |
```kotlin
/*
*/
package splitties.internal.test
actual typealias RunWith = org.junit.runner.RunWith
actual typealias Runner = org.junit.runner.Runner
``` |
Lokot () is an urban locality (a work settlement) and the administrative center of the Brasovsky District of Bryansk Oblast, Russia. Population:
See also
Lokot Autonomy
References
Notes
Sources
Urban-type settlements in Bryansk Oblast |
```javascript
Function constructor vs. function declaration vs. function expression
`.bind()`
IIFE pattern
Method chaining
Check if a document is done loading
``` |
Prince Gyasi Nyantakyi (born 30 April 1995) also known by the artist name Prince Gyasi is a Ghanaian international visual artist. He is the co-founder of Boxedkids, a non-profit organization helping kids from Accra get an education.
Early life
Gyasi had his secondary education at the Accra Academy senior high school in Accra.
Career
Gyasi started taking pictures in 2011 and bought his first iPhone in 2014 which is the primary tool he uses in creating his art pieces. He began with snapshots of friends, family and models from his hometown of Ghana and then realized he could seriously use his phone as an arts creation tool, as a means of expression.
He using an iPhone to shoot is a way to distinguish his art from other visual artists and photographers to break the codes of this singular and elitist art. His work is all about conveying feelings through colors and giving the floor to the people that are left aside from the society. He indeed considers his use of colors as a source of therapy to his audience. Motherhood, Fatherhood, childhood can be considered as his most characteristic themes.
Exhibition
Prince Gyasi was signed to Nil Gallery Paris in 2018 which gave him the chance to exhibit his art pieces at multiple art fairs in the USA.
He has exhibited in the Seattle Contemporary Art fair, Texas Contemporary Art Fair, Artsy & Context Art Miami and pulse Contemporary Art Fair (Art Basel Miami). Prince has also exhibited some of his works at the Investec Cape Town Art Fair in South Africa. He exhibited at the Paris Photo at the Grand Palais Ephémère for the first time in November 11 to 14 of 2021.
KYOTOGRAPHIE International Photography Festival
Prince was the leading artist for the 10th anniversary of the KYOTOGRAPHIE International Photography Festival. His solo show took place in a three-storey building in Kyoto, entirely devoted to his work.
Group Show at the Museo de Arte do Rio
Prince's works also got featured in the Group exhibition "Um defeito de cor" at the Museo de Arte do Rio from September 10th, 2022 until May 21st, 2023.
Collaborations
A Great Day In Accra
In December 2018, he got commissioned by Apple Inc. to work on a project in Ghana titled A Great Day In Accra to push the Hiplife music genre in Ghana to the world. In this project he shot Ghanaian hiplife musicians like Gyedu-Blay Ambolley, Reggie Rockstone, Okyeame Kwame, Rab Bakari, Abrewa Nana, Hammer of The Last Two, Beat Menace, Gurunkz, Joey B, EL (rapper), DJ Breezy, Stargo, Kirani Ayat, Akan (Musician), Kiddblack, Ansah Live, Imani N.A.D, Toyboi, Kwesi Arthur and Shadow.
GQ Summer/Spring Issue 2020
In December 2019, Prince got commissioned by GQ Style to shoot Burna Boy for their Summer/Spring Issue 2020 in Ikoyi, Lagos. The shoot was titled "Global Giant" because of the release of Burna's album "African Giant".
Off-White Collaboration
Prince was featured in Virgil Abloh’s Spring/Summer 2021 collection Off-White brand which premiered in February on Imaginary TV. He performed alongside Virgil Abloh’s new creative cast; Milanese choreographer, Michele Rizzo and Japanese DJ, Kiri Okuyama, all rocking apparel from the brands new line.
Prince also modeled the new Off-White SS21 collection which was featured on Farfetch in March 2021.
Naomi Campbell for Madame Figaro
In 26 March 2021, Prince got commissioned by Madame Figaro France to shoot Naomi Campbell for the cover image of that issue. The shoot was styled by Jenke Ahmed Tailly and was shot in Lagos during Arise Fashion Week.
GQ Magazine October Issue
In September 2021, Prince was commissioned by GQ Magazine to shoot Wizkid for its October issue in Accra, Ghana. Wizkid was crowned “King of Afropop” by GQ Magazine after this shoot which was styled by Karen Binns.
Pirelli 60th Anniversary Calendar
In 2024, to celebrate the 60th anniversary of The Cal, he became the first Black photographer to produce an edition of the calendar. In this issue Prince shot the following people for The Cal, they are Otumfuo Nana Osei Tutu II, Naomi Campbell, Margot Lee Shetterly, Angela Bassett, Amanda Gorman, Tiwa Savage, Idris Elba, Jeymes Samuel, Amoako Boafo, Teyana Taylor and Marcel Desailly.
Collections
Gyasi in March 2022 art works entered the Jean Pigozzi's art collections, the collections of François Pinault Art Foundation. La Fab (the Agnes b. Art Foundation) acquired and integrated his works into a group exhibition curated and presented by Agnès b.. The exhibition entitled "L'enfance dans la collection Agnès b." was dedicated to childhood and was held from February 24th to June 30th, 2022 at La Fab, in Paris. In July 12th to August 21st, his works was integrated into the group show Bande-Annonce an exhibition held at the Pole of Contemporary Art of Cannes featuring part of Jean Pigozzi's collection of contemporary African art.
Art Market
Gyasi is currently represented by Maāt Gallery and was previously with Nil Gallery in Paris, France. In 2022, his Power of Choice (2021) sold for EUR 20,160 at Christie's in Londres, Somerset House. His Symbols of Womanhood (2018) sold for GBP 11,340 at Christie's and his work The Arrival sold for EUR 44,100 at Phillips auction.
Recognitions
He was mentioned by Vanity Fair as one of the top 9 visual artist to follow in 2018.
Prince Gyasi was part of five black photographers interviewed by Good Morning America to speak about their work and about Vogue's historic cover with Beyoncé.
Prince Gyasi has been featured on the BBC Africa for his exceptional way of making images with his iPhone.
Prince has also been featured by CNN style as one of the seven leading African photographers from across the continent.
Prince was featured again by CNN on how his work turns to color therapy for a lot of his followers. The article also mentioned how Prince was one of the most sort after artist on the art marketplace Artsy moving from 54th to 2nd place in 2020.
Prince's art pieces offered at fairs on Artsy in 2021 has had the greatest number of collectors inquiring about them than any artist on the platform.
Prince was also recognized in 2023 as a Time's Next Generation Leader for his work around visual arts.
Speaking engagements
2019 Skoll World Forum
Prince Gyasi was invited on 9 April 2019 to give a speech about his creative works during the 2019 Skoll World Forum at the Oxford University in London. During his speech he spoke about the stories behind his work of arts and his influences. He also spoke about his non-profit organization Boxed kids which he co-founded.
References
External links
Nil Gallery
Official Website
Prince giving a speech at the Skoll Forum
Living people
Alumni of the Accra Academy
1995 births
Ghanaian artists |
was an intermittent and short-lived feudal domain in Edo period Japan, located in Mutsu Province, in Yanagawa, now the city of Date, Fukushima Prefecture.
History
The domain was created in Tenna 3 (1683), with Matsudaira Yoshimasa, third son of Tokugawa Mitsutomo, its first daimyō. After third lord Matsudaira Yoshizane died in 1727 without heir, the domain briefly lapsed, but four months later was renewed under Matsudaira Michiharu, seventh son of Tokugawa Tsunanari, before being abolished the following year, the territory reverting to the bakufu. Eighty years later, in 1807, Matsumae Akihiro was transferred from Ezo-chi to the recreated domain, where the clan was based until his return to Matsumae in 1821, at which point the domain was once again abolished, this time for good, the territory reverting once more to the bakufu.
List of daimyō
Matsudaira clan 1683–1728
Matsumae clan 1807–1821
References
Domains of Japan
Mutsu Province
History of Fukushima Prefecture
Date, Fukushima
Matsumae clan |
The 2010 European Champion Cup Final Four was an international baseball competition held in Barcelona, Spain on September 25–26, 2010. It featured the 4 best teams of the 2010 European Cup, and it was won by Fortitudo Baseball Bologna.
Teams
The following four teams qualified for the 2010 Final Four.
External links
Schedule
References
Final Four (Baseball), 2010
2010
European Champion Cup Final Four |
The 18th Division (18. Division) was a unit of the Prussian/German Army. It was formed on October 11, 1866, and was headquartered in Flensburg. The division was subordinated in peacetime to the IX Army Corps (IX. Armeekorps). The division was disbanded in 1919 during the demobilization of the German Army after World War I. The division was recruited primarily in Schleswig-Holstein.
Combat chronicle
In the Franco-Prussian War of 1870–71, the 18th Infantry Division saw action in the battles of Colombey and Gravelotte and in the Siege of Metz. After the Battle of Noiseville, the division entered the Loire campaign, fighting in the battles of 2nd Orléans, Beaugency-Cravant, and Le Mans.
During the opening phases of World War I, the 18th Infantry Division participated in the Battle of Liège, the Allied Great Retreat, the First Battle of the Marne, and the First Battle of the Aisne. In 1916, it saw action in the Somme, and in 1917 it was involved in the Battles of Arras and Passchendaele. In 1918, it participated in the German spring offensive and the subsequent Allied counteroffensives, including the Hundred Days Offensive. Allied intelligence rated it a first class division.
Order of battle in the Franco-Prussian War
During wartime, the 18th Division, like other regular German divisions, was redesignated an infantry division. The organization of the 18th Infantry Division in 1870 at the beginning of the Franco-Prussian War was as follows:
35. Infanterie-Brigade
Infanterie-Regiment Nr. 25
Infanterie-Regiment Nr. 84
36. Infanterie-Brigade
Grenadier-Regiment Nr. 11
Infanterie-Regiment Nr. 85
Jäger-Bataillon Nr. 9
Dragoner-Regiment Nr. 6
Pre-World War I organization
German divisions underwent various organizational changes after the Franco-Prussian War. The organization of the 18th Division in 1914, shortly before the outbreak of World War I, was as follows:
35. Infanterie-Brigade
Infanterie-Regiment von Manstein (Schleswigsches) Nr. 84
Füsilier-Regiment Königin (Schleswig-Holsteinisches) Nr. 86
36. Infanterie-Brigade
Infanterie-Regiment Graf Bose (1. Thüringisches) Nr. 31
Infanterie-Regiment Herzog von Holstein (Holsteinisches) Nr. 85
18. Kavallerie-Brigade:
Husaren-Regiment Königin Wilhelmina der Niederlande (Hannoversches) Nr. 15
Husaren-Regiment Kaiser Franz Joseph von Österreich, König von Ungarn (Schleswig-Holsteinisches) Nr. 16
18. Feldartillerie-Brigade:
Feldartillerie-Regiment General-Feldmarschall Graf Waldersee (Schleswigsches) Nr. 9
Lauenburgisches Feldartillerie-Regiment Nr. 45
Landwehr-Inspektion Altona
Order of battle on mobilization
On mobilization in August 1914 at the beginning of World War I, most divisional cavalry, including brigade headquarters, was withdrawn to form cavalry divisions or split up among divisions as reconnaissance units. Divisions received engineer companies and other support units from their higher headquarters. The 18th Division was again renamed the 18th Infantry Division. The 18th Infantry Division's initial wartime organization was as follows:
35. Infanterie-Brigade
Infanterie-Regiment von Manstein (Schleswigsches) Nr. 84
Füsilier-Regiment Königin (Schleswig-Holsteinisches) Nr. 86
36. Infanterie-Brigade
Infanterie-Regiment Graf Bose (1. Thüringisches) Nr. 31
Infanterie-Regiment Herzog von Holstein (Holsteinisches) Nr. 85
3. Eskadron/2. Hannoversches Dragoner-Regiment Nr. 16
18. Feldartillerie-Brigade:
Feldartillerie-Regiment General-Feldmarschall Graf Waldersee (Schleswigsches) Nr. 9
Lauenburgisches Feldartillerie-Regiment Nr. 45
2. Kompanie/Schleswig-Holsteinisches Pionier-Bataillon Nr. 9
3. Kompanie/Schleswig-Holsteinisches Pionier-Bataillon Nr. 9
Late World War I organization
Divisions underwent many changes during the war, with regiments moving from division to division, and some being destroyed and rebuilt. During the war, most divisions became triangular - one infantry brigade with three infantry regiments rather than two infantry brigades of two regiments (a "square division"). An artillery commander replaced the artillery brigade headquarters, the cavalry was further reduced, the engineer contingent was increased, and a divisional signals command was created. The 18th Infantry Division's order of battle on March 8, 1918, was as follows:
36. Infanterie-Brigade
Infanterie-Regiment Graf Bose (1. Thüringisches) Nr. 31
Infanterie-Regiment Herzog von Holstein (Holsteinisches) Nr. 85
Füsilier-Regiment Königin (Schleswig-Holsteinisches) Nr. 86
Maschinengewehr-Scharfschützen-Abteilung Nr. 48
2.Eskadron/2. Hannoversches Dragoner-Regiment Nr. 16
Artillerie-Kommandeur 18
Lauenburgisches Feldartillerie-Regiment Nr. 45
II.Bataillon/Fußartillerie-Regiment Nr. 28
Stab Schleswig-Holsteinisches Pionier-Bataillon Nr. 9
2. Kompanie/Schleswig-Holsteinisches Pionier-Bataillon Nr. 9
3. Kompanie/Schleswig-Holsteinisches Pionier-Bataillon Nr. 9
Minenwerfer-Kompanie Nr. 18
Divisions-Nachrichten-Kommandeur 18
References
18. Infanterie-Division (Chronik 1914/1918) - Der erste Weltkrieg
Claus von Bredow, bearb., Historische Rang- und Stammliste des deutschen Heeres (1905)
Hermann Cron et al., Ruhmeshalle unserer alten Armee (Berlin, 1935)
Hermann Cron, Geschichte des deutschen Heeres im Weltkriege 1914–1918 (Berlin, 1937)
Günter Wegner, Stellenbesetzung der deutschen Heere 1815–1939. (Biblio Verlag, Osnabrück, 1993), Bd. 1
Histories of Two Hundred and Fifty-One Divisions of the German Army which Participated in the War (1914–1918), compiled from records of Intelligence section of the General Staff, American Expeditionary Forces, at General Headquarters, Chaumont, France 1919 (1920)
Notes
Infantry divisions of Germany in World War I
Military units and formations established in 1866
Military units and formations disestablished in 1919
1866 establishments in Prussia |
Anthony Longdon is a Grenadian boxer. He competed in the men's light heavyweight event at the 1984 Summer Olympics.
References
External links
Year of birth missing (living people)
Living people
Light-heavyweight boxers
Grenadian male boxers
Olympic boxers for Grenada
Boxers at the 1984 Summer Olympics
Place of birth missing (living people) |
```batchfile
REM the TODIR (destination folder) should NOT contain a trailing '\', this script will append it
SETLOCAL
SET NXDIR=%1
SET TODIR=%2\
SET FNDDIR=%3
SET NVTXDIR=%4
SET GLDIR=%5
SET WINSDKDIR=%6
echo Copy64
echo "NXDIR = " %NXDIR%
echo "TARGET = " %TODIR%
echo "NVTXDIR = " %NVTXDIR%
echo FNDDIR = %FNDDIR%
echo GLDIR = %GLDIR%
echo WINSDKDIR = %WINSDKDIR%
IF "%2"=="" GOTO ARGUMENT_ERROR
CALL :UPDATE_TARGET %NXDIR% PhysXDevice64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3CHECKED_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3DEBUG_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3PROFILE_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3Common_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3CommonCHECKED_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3CommonDEBUG_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3CommonPROFILE_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3CharacterKinematic_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3CharacterKinematicCHECKED_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3CharacterKinematicDEBUG_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3CharacterKinematicPROFILE_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3Cooking_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3CookingCHECKED_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3CookingDEBUG_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3CookingPROFILE_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3Gpu_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3GpuCHECKED_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3GpuDEBUG_x64.dll
CALL :UPDATE_TARGET %NXDIR% PhysX3GpuPROFILE_x64.dll
CALL :UPDATE_TARGET %NVTXDIR% nvToolsExt*.dll
CALL :UPDATE_TARGET %FNDDIR% PxFoundation_x64.dll
CALL :UPDATE_TARGET %FNDDIR% PxFoundationCHECKED_x64.dll
CALL :UPDATE_TARGET %FNDDIR% PxFoundationPROFILE_x64.dll
CALL :UPDATE_TARGET %FNDDIR% PxFoundationDEBUG_x64.dll
CALL :UPDATE_TARGET %FNDDIR% PxPvdSDK_x64.dll
CALL :UPDATE_TARGET %FNDDIR% PxPvdSDKCHECKED_x64.dll
CALL :UPDATE_TARGET %FNDDIR% PxPvdSDKDEBUG_x64.dll
CALL :UPDATE_TARGET %FNDDIR% PxPvdSDKPROFILE_x64.dll
ENDLOCAL
GOTO END
REM ********************************************
REM NO CALLS TO :UPDATE_TARGET below this line!!
REM ********************************************
:UPDATE_TARGET
IF NOT EXIST %1\%2 (
echo File doesn't exist %1\%2
) ELSE (
XCOPY "%1\%2" "%TODIR%" /D /Y
)
GOTO END
:ARGUMENT_ERROR
ECHO ERROR: too few arguments to dll64copy.bat (need PhysXBinDir ApexBinDir)
:END
``` |
The NBA All-Defensive Team is an annual National Basketball Association (NBA) honor given since the 1968–69 NBA season to the best defensive players during the regular season. The All-Defensive Team is generally composed of ten players in two five-man lineups, a first and a second team. Voting is conducted by a panel of 123 writers and broadcasters. Prior to the 2013–14 NBA season, voting was performed by the NBA head coaches, who were restricted from voting for players on their own team. The players each receive two points for each first team vote and one point for each second team vote. The top five players with the highest point total make the first team, with the next five making the second team. In the case of a tie at the fifth position of either team, the roster is expanded. If the first team consists of six players due to a tie, the second team will still consist of five players with the potential for more expansion in the event of additional ties. Ties have occurred several times, most recently in 2013 when Tyson Chandler and Joakim Noah tied in votes received.
Starting with the 2023–24 season, players must appear in at least 65 games (out of the normal 82-game schedule) to be eligible for most major regular-season playing awards and honors, including the All-Defensive Team. To receive credit for a game for purposes of award eligibility, a player must have been credited with at least 20 minutes played. However, two "near misses", in which the player appeared for 15 to 19 minutes, can be included in the 65-game count. Protections also exist for players who suffer season-ending injuries, who are eligible with 62 credited games, and those affected by what the CBA calls "bad faith circumstances".
Tim Duncan holds the record for the most total selections to the All-Defensive Team with 15. Kevin Garnett and Kobe Bryant follow with 12 total honors each, and Kareem Abdul-Jabbar has 11 total selections. Michael Jordan, Gary Payton, Garnett and Bryant share the record for most NBA All-Defensive first team selections with nine. Scottie Pippen, Bobby Jones, and Duncan made the first team eight times each. Walt Frazier, Dennis Rodman and Chris Paul made the All-Defensive first team seven times.
When the coaches were responsible for voting, there were occasionally inconsistencies between the All-Defensive Team and the NBA Defensive Player of the Year Award, which has been voted on by the media. On four occasions, the Defensive Player of the Year winner was not voted to the All-Defensive first team in the same year. Player of the Year winners Alvin Robertson (1986), Dikembe Mutombo (1995), Tyson Chandler (2012) and Marc Gasol (2013) were instead named to the second team.
Selections
Most selections
The following table lists the top ten players with the most overall selections.
See also
All-NBA Team
List of NBA regular season records
Notes
The Defensive Player of the Year award was first established in 1983.
Sanders has been inducted to the Naismith Hall as a contributor.
Sloan has been inducted to the Naismith Hall as a coach.
Before the 1971–72 season, Lew Alcindor changed his name to Kareem Abdul-Jabbar.
When Olajuwon arrived to the United States, the University of Houston incorrectly spelled his first name "Akeem". He used that spelling until March 9, 1991, when he announced that he would add an H.
Ron Artest changed his name into Metta World Peace on September 16, 2011, and after his playing career changed it again to Metta Sandiford-Artest.
References
General
Specific
All-Defensive Team
National Basketball Association lists |
Bridgette Kate Armstrong (born 9 November 1992), is a member of the Football Ferns, the New Zealand women's national football team.
She was a member of the New Zealand squad in the inaugural FIFA U-17 Women's World Cup, playing all three group games; a 0–1 loss to Canada, a 1–2 loss to Denmark, and a 3–1 win over Colombia.
Armstrong also represented New Zealand at the 2008 FIFA U-20 Women's World Cup in Chile, again playing all three group games; a 2–3 loss to Nigeria, a 4–3 win over hosts Chile, and scored New Zealand's goal against England before England equalised late in injury time to eliminate New Zealand from the tournament. In 2010, she represented New Zealand at the 2010 FIFA U-20 Women's World Cup in Germany, appearing in all three group games.
Armstrong made her senior international debut as a substitute in a friendly against Japan on 14 November 2009, and scored her first international goal in a 7–0 win over Tahiti on 3 October 2010.
Armstrong's family is well represented in international football. Her grandfather father Ken Armstrong was a dual international representing both England and New Zealand. Father Ron Armstrong and uncle Brian Armstrong also represented New Zealand.
Armstrong attended Long Bay College.
References
External links
1992 births
Living people
New Zealand women's association footballers
New Zealand women's international footballers
Association footballers from Auckland
Women's association football defenders
Bridgette
New Zealand people of English descent |
The Ambassador of Ireland to Spain is the head of the Embassy of Ireland, Madrid, and the official representative of the Government of Ireland to the Government of Spain. The official title is Ambassador of Ireland to the Kingdom of Spain.
The incumbent Ambassador is Frank Smyth, who was appointed in 2021.
History
Leopold H. Kerney was the first Envoy Extraordinary and Minister Plenipotentiary and was appointed in September 1935. Kerney presented his credentials to the President of the Spanish Republic, Niceto Alcalá Zamora. The legation of the Irish Free State in Madrid was closed temporarily because of the Spanish Civil War. Kerney sought refuge in St Jean de Luz, on the French border with Spain.
In October 1950, the first Ambassador of Ireland was appointed following Ireland's departure from the Commonwealth.
List of representatives
See also
Ireland–Spain relations
References
Spain
Ireland |
```javascript
/**
* @fileoverview Enforces props default values to be valid.
* @author Armano
*/
'use strict'
const utils = require('../utils')
const { capitalize } = require('../utils/casing')
/**
* @typedef {import('../utils').ComponentProp} ComponentProp
* @typedef {import('../utils').ComponentObjectProp} ComponentObjectProp
* @typedef {import('../utils').ComponentArrayProp} ComponentArrayProp
* @typedef {import('../utils').ComponentTypeProp} ComponentTypeProp
* @typedef {import('../utils').ComponentInferTypeProp} ComponentInferTypeProp
* @typedef {import('../utils').ComponentUnknownProp} ComponentUnknownProp
* @typedef {import('../utils').VueObjectData} VueObjectData
*/
const NATIVE_TYPES = new Set([
'String',
'Number',
'Boolean',
'Function',
'Object',
'Array',
'Symbol',
'BigInt'
])
const FUNCTION_VALUE_TYPES = new Set(['Function', 'Object', 'Array'])
/**
* @param {ObjectExpression} obj
* @param {string} name
* @returns {Property | null}
*/
function getPropertyNode(obj, name) {
for (const p of obj.properties) {
if (
p.type === 'Property' &&
!p.computed &&
p.key.type === 'Identifier' &&
p.key.name === name
) {
return p
}
}
return null
}
/**
* @param {Expression} targetNode
* @returns {string[]}
*/
function getTypes(targetNode) {
const node = utils.skipTSAsExpression(targetNode)
if (node.type === 'Identifier') {
return [node.name]
} else if (node.type === 'ArrayExpression') {
return node.elements
.filter(
/**
* @param {Expression | SpreadElement | null} item
* @returns {item is Identifier}
*/
(item) => item != null && item.type === 'Identifier'
)
.map((item) => item.name)
}
return []
}
module.exports = {
meta: {
type: 'suggestion',
docs: {
description: 'enforce props default values to be valid',
categories: ['vue3-essential', 'vue2-essential'],
url: 'path_to_url
},
fixable: null,
schema: [],
messages: {
invalidType:
"Type of the default value for '{{name}}' prop must be a {{types}}."
}
},
/** @param {RuleContext} context */
create(context) {
/**
* @typedef {object} StandardValueType
* @property {string} type
* @property {false} function
*/
/**
* @typedef {object} FunctionExprValueType
* @property {'Function'} type
* @property {true} function
* @property {true} expression
* @property {Expression} functionBody
* @property {string | null} returnType
*/
/**
* @typedef {object} FunctionValueType
* @property {'Function'} type
* @property {true} function
* @property {false} expression
* @property {BlockStatement} functionBody
* @property {ReturnType[]} returnTypes
*/
/**
* @typedef { ComponentObjectProp & { value: ObjectExpression } } ComponentObjectDefineProp
* @typedef { { type: string, node: Expression } } ReturnType
*/
/**
* @typedef {object} PropDefaultFunctionContext
* @property {ComponentObjectProp | ComponentTypeProp | ComponentInferTypeProp} prop
* @property {Set<string>} types
* @property {FunctionValueType} default
*/
/**
* @type {Map<ObjectExpression, PropDefaultFunctionContext[]>}
*/
const vueObjectPropsContexts = new Map()
/**
* @type { {node: CallExpression, props:PropDefaultFunctionContext[]}[] }
*/
const scriptSetupPropsContexts = []
/**
* @typedef {object} ScopeStack
* @property {ScopeStack | null} upper
* @property {BlockStatement | Expression} body
* @property {null | ReturnType[]} [returnTypes]
*/
/**
* @type {ScopeStack | null}
*/
let scopeStack = null
function onFunctionExit() {
scopeStack = scopeStack && scopeStack.upper
}
/**
* @param {Expression} targetNode
* @returns { StandardValueType | FunctionExprValueType | FunctionValueType | null }
*/
function getValueType(targetNode) {
const node = utils.skipChainExpression(targetNode)
switch (node.type) {
case 'CallExpression': {
// Symbol(), Number() ...
if (
node.callee.type === 'Identifier' &&
NATIVE_TYPES.has(node.callee.name)
) {
return {
function: false,
type: node.callee.name
}
}
break
}
case 'TemplateLiteral': {
// String
return {
function: false,
type: 'String'
}
}
case 'Literal': {
// String, Boolean, Number
if (node.value === null && !node.bigint) return null
const type = node.bigint ? 'BigInt' : capitalize(typeof node.value)
if (NATIVE_TYPES.has(type)) {
return {
function: false,
type
}
}
break
}
case 'ArrayExpression': {
// Array
return {
function: false,
type: 'Array'
}
}
case 'ObjectExpression': {
// Object
return {
function: false,
type: 'Object'
}
}
case 'FunctionExpression': {
return {
function: true,
expression: false,
type: 'Function',
functionBody: node.body,
returnTypes: []
}
}
case 'ArrowFunctionExpression': {
if (node.expression) {
const valueType = getValueType(node.body)
return {
function: true,
expression: true,
type: 'Function',
functionBody: node.body,
returnType: valueType ? valueType.type : null
}
}
return {
function: true,
expression: false,
type: 'Function',
functionBody: node.body,
returnTypes: []
}
}
}
return null
}
/**
* @param {*} node
* @param {ComponentObjectProp | ComponentTypeProp | ComponentInferTypeProp} prop
* @param {Iterable<string>} expectedTypeNames
*/
function report(node, prop, expectedTypeNames) {
const propName =
prop.propName == null
? `[${context.getSourceCode().getText(prop.node.key)}]`
: prop.propName
context.report({
node,
messageId: 'invalidType',
data: {
name: propName,
types: [...expectedTypeNames].join(' or ').toLowerCase()
}
})
}
/**
* @param {(ComponentObjectDefineProp | ComponentTypeProp | ComponentInferTypeProp)[]} props
* @param { { [key: string]: Expression | undefined } } withDefaults
*/
function processPropDefs(props, withDefaults) {
/** @type {PropDefaultFunctionContext[]} */
const propContexts = []
for (const prop of props) {
let typeList
let defExpr
if (prop.type === 'object') {
const type = getPropertyNode(prop.value, 'type')
if (!type) continue
typeList = getTypes(type.value)
const def = getPropertyNode(prop.value, 'default')
if (!def) continue
defExpr = def.value
} else {
typeList = prop.types
defExpr = withDefaults[prop.propName]
}
if (!defExpr) continue
const typeNames = new Set(
typeList.filter((item) => NATIVE_TYPES.has(item))
)
// There is no native types detected
if (typeNames.size === 0) continue
const defType = getValueType(defExpr)
if (!defType) continue
if (defType.function) {
if (typeNames.has('Function')) {
continue
}
if (defType.expression) {
if (!defType.returnType || typeNames.has(defType.returnType)) {
continue
}
report(defType.functionBody, prop, typeNames)
} else {
propContexts.push({
prop,
types: typeNames,
default: defType
})
}
} else {
if (
typeNames.has(defType.type) &&
!FUNCTION_VALUE_TYPES.has(defType.type)
) {
continue
}
report(
defExpr,
prop,
[...typeNames].map((type) =>
FUNCTION_VALUE_TYPES.has(type) ? 'Function' : type
)
)
}
}
return propContexts
}
return utils.compositingVisitors(
{
/**
* @param {FunctionExpression | FunctionDeclaration | ArrowFunctionExpression} node
*/
':function'(node) {
scopeStack = {
upper: scopeStack,
body: node.body,
returnTypes: null
}
},
/**
* @param {ReturnStatement} node
*/
ReturnStatement(node) {
if (!scopeStack) {
return
}
if (scopeStack.returnTypes && node.argument) {
const type = getValueType(node.argument)
if (type) {
scopeStack.returnTypes.push({
type: type.type,
node: node.argument
})
}
}
},
':function:exit': onFunctionExit
},
utils.defineVueVisitor(context, {
onVueObjectEnter(obj) {
/** @type {ComponentObjectDefineProp[]} */
const props = utils.getComponentPropsFromOptions(obj).filter(
/**
* @param {ComponentObjectProp | ComponentArrayProp | ComponentUnknownProp} prop
* @returns {prop is ComponentObjectDefineProp}
*/
(prop) =>
Boolean(
prop.type === 'object' && prop.value.type === 'ObjectExpression'
)
)
const propContexts = processPropDefs(props, {})
vueObjectPropsContexts.set(obj, propContexts)
},
/**
* @param {FunctionExpression | FunctionDeclaration | ArrowFunctionExpression} node
* @param {VueObjectData} data
*/
':function'(node, { node: vueNode }) {
const data = vueObjectPropsContexts.get(vueNode)
if (!data || !scopeStack) {
return
}
for (const { default: defType } of data) {
if (node.body === defType.functionBody) {
scopeStack.returnTypes = defType.returnTypes
}
}
},
onVueObjectExit(obj) {
const data = vueObjectPropsContexts.get(obj)
if (!data) {
return
}
for (const { prop, types: typeNames, default: defType } of data) {
for (const returnType of defType.returnTypes) {
if (typeNames.has(returnType.type)) continue
report(returnType.node, prop, typeNames)
}
}
}
}),
utils.defineScriptSetupVisitor(context, {
onDefinePropsEnter(node, baseProps) {
const props = baseProps.filter(
/**
* @param {ComponentProp} prop
* @returns {prop is ComponentObjectDefineProp | ComponentInferTypeProp | ComponentTypeProp}
*/
(prop) =>
Boolean(
prop.type === 'type' ||
prop.type === 'infer-type' ||
(prop.type === 'object' &&
prop.value.type === 'ObjectExpression')
)
)
const defaults = utils.getWithDefaultsPropExpressions(node)
const propContexts = processPropDefs(props, defaults)
scriptSetupPropsContexts.push({ node, props: propContexts })
},
/**
* @param {FunctionExpression | FunctionDeclaration | ArrowFunctionExpression} node
*/
':function'(node) {
const data =
scriptSetupPropsContexts[scriptSetupPropsContexts.length - 1]
if (!data || !scopeStack) {
return
}
for (const { default: defType } of data.props) {
if (node.body === defType.functionBody) {
scopeStack.returnTypes = defType.returnTypes
}
}
},
onDefinePropsExit() {
scriptSetupPropsContexts.pop()
}
})
)
}
}
``` |
Unione Sportiva Forcoli Calcio 1921 Associazione Sportiva Dilettantistica is an Italian association football club located in Forcoli, a frazione of Palaia, Tuscany. It currently plays in Serie D.
History
The club was founded in 1921.
The team in the season 1999–2000 was promoted from Promozione Tuscany to Eccellenza and in the season 2003–04 from Eccellenza Tuscany to Serie D.
Colors and badge
Its colors are white and dark red.
References
External links
Official homepage
Association football clubs established in 1921
Football clubs in Tuscany
1921 establishments in Italy |
Corey Wittenberg Sr. (September 24, 1961 – April 25, 2022) was an American-born Australian professional tennis player.
Wittenberg played college tennis for Texas Christian University and earned All-American honors for doubles in 1983.
At the 1984 Australian Open, Wittenberg won his way through qualifying and faced John Sadri in the first round, losing the match in four sets. He later settled in Australia.
Wittenberg resided in Pymble. He died on April 25, 2022.
References
External links
1961 births
2022 deaths
American male tennis players
TCU Horned Frogs men's tennis players
American emigrants to Australia |
Dichomeris serrativittella, the toothed dichomeris, is a moth of the family Gelechiidae. It was described by Zeller in 1873. It is found in eastern the United States, where it has been recorded from Florida, Mississippi, Illinois, Iowa, from South Dakota to Louisiana, southern Texas, New Mexico and Utah. It is also found in Mexico.
The wingspan is about . The costal half of the forewings is creamy white and the dorsal half is dark brown. Adults are on wing from April to October.
The larvae possibly feed on Brassica species.
References
serrativittella
Moths described in 1873 |
The Gaddang language (also Cagayan) is spoken by up to 30,000 speakers (the Gaddang people) in the Philippines, particularly along the Magat and upper Cagayan rivers in the Region II provinces of Nueva Vizcaya and Isabela and by overseas migrants to countries in Asia, Australia, Canada, Europe, in the Middle East, United Kingdom and the United States. Most Gaddang speakers also speak Ilocano, the lingua franca of Northern Luzon, as well as Tagalog and English. Gaddang is associated with the "Christianized Gaddang" people, and is closely related to the highland (non-Christian in local literature) tongues of Ga'dang with 6,000 speakers, Yogad, Cagayan Agta with less than 1,000 and Atta with 2,000 (although the Negrito Aeta and Atta are genetically unrelated to the Austronesian Gaddang), and more distantly to Ibanag, Itawis, Isneg and Malaweg.
The Gaddang tongue has been vanishing from daily and public life over the past half-century. Public and church-sponsored education was historically conducted in Spanish (or later in English), and now in Filipino/Tagalog. The Dominicans tried to replace the multitude of Cagayan-valley languages with Ibanag, and later the plantations imported Ilocanos workers in such numbers that they outnumbered the valley natives. Once significantly-Gaddang communities grew exponentially after WWII due to in-migration of Tagalog, Igorot, and other ethnicities; Gaddang is now a minority language. In the 2000 Census, Gaddang was not even an identity option for residents of Nueva Vizcaya. Vocabulary and structural features of Gaddang among native Gaddang speakers have suffered as well, as usages from Ilokano and other languages affect their parole. Finally, many ethnic Gaddang have migrated to other countries, and their children are not learning the ancestral tongue.
Geographic Distribution
The Gaddang people were identified as I-gaddang (likely meaning 'brown-colored people') by the Spanish in the early 1600s, and differentiated from the Igorots of the highlands by physique, skin color, homelands, and lifestyle. Mary Christine Abriza wrote "The Gaddang are found in northern Nueva Vizcaya, especially Bayombong, Solano, and Bagabag on the western bank of the Magat River, and Santiago, Angadanan, Cauayan, and Reina Mercedes on the Cagayan River for Christianed groups; and western Isabela, along the edges of Kalinga and Bontoc, in the towns of Antatet, Dalig, and the barrios of Gamu and Tumauini for the non-Christian communities. The 1960 census reports that there were 25,000 Gaddang, and that 10% or about 2,500 of these were non-Christian."
Distinct versions of Gaddang may be heard down the valleys of the Magat and Cagayan on the Asian Highway 26 (the Pan-Philippine Highway) through Nueva Vizcaya into Isabela after leaving Santa Fe, where its use is infrequent, and successively through Aritao, Bambang, Bayombong, Solano,(including Quezon & Bintawan), and Bagabag. By the time you arrive in Santiago City, in-migration due to the economic development of the lower Cagayan Valley over the last century means you now must search diligently to hear Gaddang spoken at all.
Santa Fe, near Dalton Pass, and San Roque (now Mabasa barangay of Dupax del Norte) are reputed originally to have been settled by immigrants from Ilocos and Pangasinan in the latter part of the 19th century. Neither has a large community of Gaddang-speakers.
Aritao was originally Isinai (with Ibaloi and Aeta minorities), Kayapa is inhabited by Ibaloi farmers and Kankanaey-speaking merchants, while Bambang and Dupax were Ilongot (also locally called Bugkalot); the Gaddang as spoken in these areas incorporates vocabulary and grammar borrowed from these unrelated languages.
The provincial capital and university town of Bayombong also has an Ilokano-speaking majority (as well as a significant Ifugao minority), however Bayombong has a long history of recognizing the municipality's Gaddang-speaking roots. Despite growing disuse of Gaddang as a language of public and general daily life, Gaddang is often heard at social gatherings in traditional , such as "Ope Manke Wayi". Many participants are not, in fact, native speakers; they are often ethnic Ilokanos, Tagalogs, and even non-Filipinos.
In urban Solano, Gaddang is now rarely used outside the households of native speakers, and the many regional variants are unreconciled. Nueva Vizcaya's largest commercial center in 2013, Solano is effectively an Ilokano-speaking municipality.
The Bagabag variant of Gaddang is frequently described by residents of the province as the "deepest" version. Some related families in Diadi and the adjoining Ifugao Province municipality of Lamut also continue to speak Gaddang.
Gaddang-speakers and the linguistically-related Ibanag-speaking peoples were historically the original occupants of what is now the Cagayan Valley province of Isabela, most of which was carved-out from Nueva Vizcaya in 1856. Rapid agricultural development of the new province spurred a wave of Ilokano immigration, and after 1945 the cities of Santiago City, Cauayan and Ilagan City (originally the Gaddang town of Bolo) became major commercial and population centers. Presently, nearly 70% of the 1.5 million residents of Isabela identify themselves as Ilokano, and another 10% as Tagalog. 15% call themselves Ibanag, while the remaining 5% are Gaddang- or Yogad-speakers.
Sounds
The Gaddang language is related to Ibanag, Itawis, Malaueg and others. It is distinct in that it features phonemes not present in many neighboring Philippine languages. As an example, the "f", "v", "z" and "j" sounds appear in Gaddang. There are notable differences from other languages in the distinction between "r" and "l" (and between "r" and "d"), and the "f" sound is a voiceless bilabial fricative somewhat distinct from the fortified "p" sound common in many Philippine languages (but not much closer to the English voiceless labiodental fricative). Finally, the (Spanish) minimally-voiced "J" sound has evolved to a plosive (so the name Joseph sounds to the American ear as Kosip).
Vowels
Most Gaddang speakers use six vowel sounds: , , , , ,
Consonants
Gaddang features doubled consonants, so the language may sound guttural to Tagalog, Ilokano, and even Pangasinan speakers. The uniqueness of this circumstance is often expressed by saying Gaddang speakers have "a hard tongue".
For example: (tood-duh). which means rice.
Phonology
Gaddang is also one of the Philippine languages which is excluded from - allophony.
Grammar
Nouns
Personal pronouns
I –
You –
He, she, it –
We (exclusive) –
We (inclusive) –
You (plural/polite) –
They –
Sibling –
Demonstrative pronouns
– this
– that
– here
– there
– over there
Enclitic particles
Existential
Interrogative words
What, who – ( 'who are you?', 'what is that?')
Why –
Where –
Where is –
How –
How much –
Numbers
0 -
1 -
2 -
3 -
4 -
5 -
6 -
7 -
8 -
9 -
10 -
11 -
12 -
13 -
14 -
15 -
20 -
21 -
22 -
100 -
200 -
500 -
1000 -
2000 –
Structure
Like most languages of the Philippines, Gaddang is declensionally, conjugationally and morphologically agglutinative.
Also like them, it is characterized by a dearth of positional/directional adpositional adjunct words. Temporal references are usually accomplished using agglutinated nouns or verbs.
The following describes similar adpositional structure in Tagalog: "The (locative) marker , which leads indirect objects in Filipino, corresponds to English prepositions...we can make other prepositional phrases with + other particular conjugations." Gaddang uses in the same manner as the Tagalog , as an all-purpose indication that a spatial or temporal relationship exists.
Examples
Simple greetings/questions/phrases
Good morning. –
Good afternoon. –
Good evening/night. –
How are you? –
I'm good and you? –
I'm just fine, thank God. –
Thank you. –
Where are you going? –
I'm going to... –
What are you doing? –
Oh, nothing in particular. –
Please come in. –
Happy birthday. –
We visit our grandfather. – or
Are we good, grandfather? – or
Who are you? –
Dodge that ball! –
Why are you crying? –
Are there many people here? –
Are you sleepy? –
I don't want to sleep yet. –
Sentences
Below are examples of Gaddang proverbs and riddles. Note the Ilokano and even Spanish loan-words.
(Translated: 'eaten by alligator' ha, ha!)
('If I open it, it gossips – a fan.')
('Before a meal, I'm full; afterward I'm hungry – a pot.')
References
External links
Global Recordings Network
Philippine Peoples
Genealogy page of C. Balunsat
Gaddang–English Dictionary
Gaddang Word List
Internet Archive
Languages of Nueva Vizcaya
Languages of Isabela (province)
Cagayan Valley languages |
Neocollyris ampullicollis is a species in the tiger beetle family Cicindelidae. It was described by Horn in 1913.
References
Ampullicollis, Neocollyris
Beetles described in 1913
Taxa named by Walther Horn |
Stefan Gunnarsson, born October 24, 1968, in Boden, Sweden, is a Swedish musician, known as team captain in the Swedish TV program Så ska det låta.
Gunnarsson is a multi-instrumentalist. He started as a drummer but also sought out guitar, bass, piano, trumpet and harmonica, and sings also. He has appeared on albums by, among others, Janne Schaffer, Raj Montana Band, Sandra Cross and David Carlson.
Gunnarsson is a member of bands Enorma Groove and BLISS (a KISS-tribute band).
References
External links
Website
Swedish male musicians
1968 births
Living people |
Frank Caldwell may refer to:
Frank Caldwell (British Army officer)
Frank W. Caldwell, American propeller engineer and designer
Frank Merrill Caldwell, United States Army general
James F. Caldwell Jr., known as Frank, United States Navy admiral
See also
Francis Caldwell, British police officer
Francis Xavier Caldwell, businessman and political figure in Upper Canada |
Henry Landers Bostick (born Henry Lipschitz) (January 12, 1895 – September 16, 1968) was an American Major League Baseball infielder. He played for the Philadelphia Athletics during the season. He attended the University of Denver. He was Jewish.
References
External links
Major League Baseball infielders
Philadelphia Athletics players
Baseball players from Massachusetts
1895 births
1968 deaths
Denver Pioneers baseball players
Topeka Jayhawks players
University of Denver alumni
Jewish American baseball players
Jewish Major League Baseball players
20th-century American Jews |
```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 org.flowable.common.engine.impl;
/**
* @author Valentin Zickner
*/
public interface DefaultTenantProvider {
String getDefaultTenant(String tenantId, String scope, String scopeKey);
}
``` |
Ronald William "Ron" Amess (9 August 1927 – 20 October 2011) was an Australian ice hockey player. Amess was a member of the Australian national team during the 1960 Winter Olympics and also competed in the 1962 World Ice Hockey Championships.
Playing career
During the 1950s Amess played for the Wildcats out of the Melbourne Glaciarium. In 1953 he was selected for the Victorian state team to compete at the 1953 Goodall Cup. Victoria went on to win the tournament. In 1960 Amess was selected to play as a forward for the Australian national team to compete at the 1960 Winter Olympics, which is the only ice hockey team Australia has ever sent to the Olympics. Australia finished last in the competition losing all six of their games. Amess who played in five of the six games failed to record any points and finished with only two penalties in minutes. The following year he was recalled to the Victorian state team to compete in the Goodall Cup championship which Victoria again went on to win. In 1962 Amess was selected to the Australian national team to compete at the 1962 World Ice Hockey Championships. Australia who were competing in Group B finished thirteenth overall and won their first ever international game after defeating Denmark 6–2. Amess joined the Victorian state team for the 1962 Goodall Cup which Victoria went on to win for the second year in a row.
Amess was also involved in the formation of the Hakoah-Arkana Ice Hockey Club which is considered the forerunner of the current Melbourne Jets Ice Hockey Club.
Personal life
Amess was born on 9 August 1927. He was the son of Alexander Amess. His sister Betty competed as a speed skater. In 2000 Amess was named a Life Member of the Australian Ice Hockey Federation. He died on 20 October 2011 aged 84.
References
1927 births
2011 deaths
Australian ice hockey centres
Ice hockey players at the 1960 Winter Olympics
Olympic ice hockey players for Australia
Sportspeople from Melbourne
Sportsmen from Victoria (state) |
Cypro-Minoan is a Unicode block containing undeciphered characters used on the island of Cyprus during the late Bronze Age (c. 1550–1050 BC).
History
The following Unicode-related documents record the purpose and process of defining specific characters in the Cypro-Minoan block:
References
Unicode blocks |
Singles and Selected was released on 7 November 2012, and is a Miss Li compilation album.
Track listing
Dancing the Whole Way Home
Bourgeois Shangri-La
Boy in the Fancy Suit
I Heard of a Girl
I Can't Get You off My Mind
I'm Sorry He's Mine
Ba ba ba
My Man
Stupid Girl
Oh Boy
Backstabber lady
Forever Drunk
You Could Have it (so Much Better without Me)
Gotta leave my troubles behind
Why Don't You Love Me
Charts
References
2012 compilation albums
Compilation albums by Swedish artists
Miss Li albums |
Vikas Kumar "Vicky" Uppal (1 January 1986 – 30 June 2007) was a native and resident of India, said to be India's tallest man until his death on 30 June 2007 when he died during a failed brain tumor operation in Delhi. In 2004, The Tribune reported him to be tall and still growing, being in his late teens.
Vicky Uppal was from the Rohtak district in the Indian state of Haryana. He was photographed for The Hindu in September 2006 at a rally held by the Indian National Lok Dal. He was purported by some to be tall, but other sources claimed he was tall. He could have been considered the world's tallest living man, but the Guinness Book of Records has strict verification criteria; hence, Guinness did not measure Uppal. He also had been said to have hands long and feet long, and appears in photographs to be proportionate, not obviously a pathological (acromegalic, for example) giant. He also acted in a Bollywood movie, Rang De Basanti.
References
See also
List of tallest people
Dharmendra Pratap Singh - tallest living Indian
1986 births
People with gigantism
2007 deaths
People from Rohtak district |
Evendine College was a chain of TEFL schools, operating five campuses London, England, and satellite schools in Brazil and Poland. It was exposed by the Evening Standard for providing false information to immigration authorities, and allowing registered students to work illegally.
Closure
While under investigation by the Home Office, Evendine closed its doors without warning on 13 June 2003. Allegations indicate that the school allowed students to obtain work visas, despite enrollees admitting that they would not be attending classes. The staff was left without pay, and an estimated 3000 students lost their tuition for the term, as well as money paid for lodging with British families. The closure has spawned concerns about regulation in the private sector.
See also
Language education
References
Language schools in the United Kingdom
Defunct educational institutions in the United Kingdom
Schools of English as a second or foreign language |
Pondlick is an unincorporated community in Mason County, West Virginia, United States. Pondlick is located at the junction of County Routes 54 and 56, south of Point Pleasant. The community once had a post office, which is now closed.
References
Unincorporated communities in Mason County, West Virginia
Unincorporated communities in West Virginia |
Kliczków Castle () is located in Kliczków in Poland. It was owned by the Solms-Baruth dynasty until 1942.
History
Kliczków was founded as a border fortress at the river Kwisa by Duke Bolko I of Jawor in 1297. In 1391, it fell into the hands of the Rechenberg family from Saxony, who held it for almost 300 years.
The main building was built in 1585 in the Renaissance style. In 1611, King Matthias of Bohemia visited the castle.
After several more changes of ownership, it came to John Christian, Count of Solms-Baruth in 1767. In 1810, the grand ballroom in Empire style was created. In 1881, the architects Heinrich Joseph Kayser and Karl von Großheim from Berlin began an expansion of the castle. They mixed styles: English Gothic architecture with Italian Renaissance and French mannerism. An 80-acre English country garden was designed at the same time by Eduard Petzold. In 1906, Emperor Wilhelm II stayed at the castle while he was hunting in the area.
In 1920, it was inherited by Frederick of Solms-Baruth. During the Nazi period, he was engaged in resistance against National Socialism in the Kreisau Circle. He was arrested after the failed attempt on Hitler's life and his property was confiscated.
The castle survived the Second World War virtually unscathed, but the interior was looted by Soviet troops. In 1949, a fire destroyed the depot and the servants' quarters. In the 1950s, the castle was in the care of the local forest authority, which neglected the interior and ruined the stucco and the stoves. The former owner's horse cemetery was retained.
In 1971, the Wrocław University of Technology acquired the castle and tried in vain to save it. After the fall of Communism, a commercial company from Wrocław purchased the castle and developed it into a luxurious conference and recreation center that was opened in 1999.
See also
Castles in Poland
External links
Kliczków Castle
Material about Kliczków Castle in the collection of Duncker Central and Regional Library Berlin (PDF, 220 kB)
Footnotes
History of Silesia
Castles in Lower Silesian Voivodeship
Bolesławiec County
Tourist attractions in Lower Silesian Voivodeship |
The Hong Kong plastic shopping bag environmental levy scheme is an environmental levy scheme designed to reduce the manufacture and distribution of plastic shopping bags (PSBs) in Hong Kong. PSBs are made of materials that are not easily degradable. The extensive disposal of PSBs is putting stringent pressure on the very limited landfill capacity, thereby causing severe waste problems in Hong Kong.
On 7 July 2009, the Government of Hong Kong initiated the first Mandatory Producer Responsibility Scheme (MPRS) under the Producer Product Eco-Responsibility Ordinance. Registered retailers are bound to charge consumers 50 cents as an environmental levy for each plastic bag taken. The levy scheme aims to generate direct economic disincentives and encourage consumers to refrain from using PSBs indiscriminately. The ultimate goal is to cultivate a habit of "Bring your Own Bag" (BYOB) within society.
The full implementation of PSB charging came into effect on 1 April 2015. All retailers are required to collect not less than 0.50 for each plastic bag distributed. To streamline the compliance mechanism and enhance the deterrent effect, a fixed-penalty notice of 2,000 was imposed on retailers who fail to comply with the legislation.
History
First phase implementation
In 2005, it was estimated that in the territory over 8 billion PSBs were disposed of annually at landfills, which suggested an average disposal of over three PSBs per person each day, accounting for 11 per cent of the municipal solid waste disposed in the territory. Consequently, the Council for Sustainable Development proposed that the government should introduce a legislation for MPRS. MPRS emphasises the sharing of "eco-responsibility", and aims to provide economic incentives for citizens to change their wasteful habits. Since PSBs are made of non-degradable material and will permanently occupy landfills' capacity, promoting BYOB is seen to be the most effective solution to alleviate the environmental problem.
A comprehensive working schedule was subsequently formed. In 2006, the Product Eco-Responsibility Bill was introduced to the Legislative Council, providing a legal framework for MPRS. With the Bill in place, the Environmental Protection Department (EPD) further put forward the legislation on PSB Charging in 2007.
The registered retailers covered by the first phase implementation were predominately chain operators, including convenience stores, supermarkets, cosmetics and medicare (the retail category).
Full implementation
First phase of the levy scheme has achieved preliminary success, yet the overall result was incomprehensive. Firstly, the scheme only covered 3,000 registered retail outlets, and the PSB disposal originated from other non-registered retailers had increased by 6.7% since the first phase implementation. Secondly, EPD estimated that Hong Kong people's daily usage of PSB was still substantially higher than other overseas developed economies.
From the figure gathered in 2010, Hong Kong has around 60,000 retail outlets, in which over 98% are operated by small and medium enterprises (SMEs). In order to achieve a more profound outcome, EPD extended the scope of the levy scheme to cover all retail sales of goods regardless of their business scale and business nature.
The levy scheme
Scope
The levy scheme has expanded to cover more than 100,000 retail outlets, including both retail and service businesses. Retail outlets are broadly categorised into four business groups: (i) retailers selling foodstuff; (ii) retailers selling non-foodstuff; (iii) retailers selling foodstuff and non-foodstuff such as department stores; and (iv) service businesses with sales of goods.
The PSB charge
The PSB charge makes it so sellers of goods by retail charge customers no less than 50 cents for each PSB, or for product with prepackaged pack of 10 or more PSBs. This is irrespective of whether the PSBs are distributed directly or indirectly for the promotion of goods, or in connection with the sales. The seller must not offer any rebate or discount to the customer with the effect of directly offsetting the PSB charge or any part of that amount.
The 50 cents charge was generally considered to be a moderate levy which could provide incentives for consumeres to reduce the use of PSBs, but not exceeding the level of public acceptance.
Bags subject to the charge
In order to promote the green habit of BYOB, extensive forms of PSBs are covered under the second phase of the levy scheme, including all bags that are made wholly or partly of plastic regardless of whether there is a carrying device. The types of shopping bags listed below are subject to the Charge:
Plastic bags with flat-tops, handle, handle hole, perforated line for tearing out handle hole, carrying string or strap, and any other devices attached to the bag.
Paper bags with plastic lamination, plastic components, plastic handles and plastic accessories.
Non-woven bags, also known as environmental bags, which are made of plastic.
Exemption arrangements
Types of PSBs are exempted from PSB charging.
Bag used for food hygiene reasons: Due to food hygiene concerns, PSBs that carry only foodstuff (i.e. food, drink or medicine) without packaging or not in airtight packaging will not be charged. In order to separate the condensation of water vapour from other goods, PSBs which carry frozen or chilled foodstuff are also exempted.
Bags used for packaging: This includes sealed bag for prepackaging. The exemption covers PSBs that are used for prepackaging and have been sealed before they are delivered to retailers. However, additional plastic bags for the prepackaged production will be charged. In the case of plastic bags that form part of the goods, the charge does not apply if the PSBs are (i) designed specifically for containing the goods; (ii) holding perishable goods; (iii) containing goods in liquid form or goods that are in liquid; and (iv) printed with information on how to consume or use the goods.
Bags provided with the services: PSBs that are distributed by retailers as part of the service tendered, and without involving the retail sales of goods are not subject to charge.
Penalty
If a retailer is found to have committed an offence by failing to comply with the levy scheme, the EPD officers may issue a fixed penalty notice requiring the offender to pay a fixed amount of $2,000.
For breaches of serious nature, the EPD may initiate prosecution against the offender, who is liable on conviction to a maximum fine of $100,000 on the first occasion, and $200,000 on each subsequent occasion.
Consultation
Prior to the first phase implementation
Plastic bags manufacturers: The Hong Kong Plastic Bags Manufacturers' Association opposed to the proposed environmental levy, alleging that PSBs were more environmentally friendly than other single-use carriers such as paper bags. Besides, the levy scheme was unnecessary since PSBs were habitually reused by the public.
Retailers: The Hong Kong Retail Management Association raised objections to the levy scheme, contending that chain stores were being unfairly targeted under the proposal. In fact, these retailers had done the most to encourage citizens to reduce the use of PSB. The effectiveness of the proposal was also questionable due to its limited coverage, and consumers could easily resort to other free sources of PSBs.
Legislative Council: In the meetings held by the Legco Panel on Environmental Affairs, the vast majority of political parties and deputations backed the principle of "polluter pays". However, some Legco members argued that the Charge should be lowered to 10 to 20 cents in order to reduce its impact on the impoverished. Besides, the government should reinforce the voluntary efforts on PSB reduction before introducing the levy. There were also concerns as to whether the levy constituted another form of Goods and Services Tax, causing adverse effects on the trade sector.
General public: With reference to the public opinion survey conducted in 2007 by the Center of Communication Research of the Chinese University of Hong Kong, among the 1,102 telephone interviews conducted, only 66% of the respondents supported the introduction of an environmental tax on PSBs.
Before the first phase implementation, the Public Opinion Programme of the University of Hong Kong conducted another three-stage survey to gauge public opinion. The feedbacks were largely positive. Around 80% of all the respondents considered that the tax was effective in reducing the use of PSBs, and the majority of them opined that a 50 cent charge would not add to their financial burden. In the third stage survey, two-thirds of the respondents even urged for an extension of PSB tax to all retail shops.
Prior to the full implementation
Plastic bags manufacturers: In 2011, the Hong Kong Plastic Bags Manufacturers' Association demanded the government to withdraw the levy scheme, as the association alleged that non-woven bags and rubbish bags were treated as alternatives of PSBs, causing an overall increase of plastic materials used in producing plastic carriers. As an alternative, the association lobbied the government to support the development of eco-friendly biodegradable PSBs.
Retailers: In contrast with the first phase implementation, the Hong Kong Retail Management Association welcomed the expansion of the levy scheme. In particular, the association supported the second phase amendment as it allowed the retailers to retain the PSB Charge without remitting them to the government. This would prevent SMEs from incurring extra administrative costs.
General public: On 17 May 2011, the EPD released the consultation document "Extension of the Environmental Levy Scheme on Plastic Shopping Bags". The consultation focused on five main aspects: (i) the expansion of the Scheme; (ii) the coverage of retailers; (iii) the exemption for food hygiene purpose; (iv) the regulation of flat-top bags; and (v) handling of the collected charges.
The then Secretary for the Environment Edward Yau announced that amongst the 1,000 public feedbacks received by the EPD, the majority acknowledged the success of the first phase implementation, and their opinion on issues (i) to (v) were largely in line with the proposed particulars of the full implementation.
Progress, effectiveness and limitations
First phase implementation
PSB disposal at landfills: Two landfill surveys were conducted by the EPD in mid-2009 and mid-2010. According to the survey results, there was a significant 75% of decrease of PSB disposal in mid-2010 than in mid-2009. The EPD estimated that these registered retail categories were accountable for 65% of the pre-levy PSB distribution, and the overall reduction in PSB usage could be as high as 90%.
Hong Kong people still disposed of 1.7 PSBs per person per day. Taking Ireland as a comparator, each person disposed of only 0.9 PSB daily even before the introduction of an environmental tax.
Opinion survey: With reference to the telephone survey conducted by the Central Policy Unit, more than 75% of the interviewers did not take PSBs when shopping at a registered outlet. Besides, around 80% of respondents reckoned that they have developed the habit of BYOB.
A major concern was raised by the Hong Kong Plastic Bags Manufacturers' Association. It was found that the use of non-woven bags and rubbish bags had surged by 96% and 63% respectively. As a result, the overall plastic materials used by the industry has escalated by 27% when compared to the post-2009 figure. Unlike non-woven bags, rubbish bags could not be reused and would end up being piled up at landfills.
Full implementation
PSB disposal at landfills: Annual disposal surveys were conducted at landfills and Refuse Transfer Stations (RTS). In order to study the full year disposal figures of PSBs after the second phase implementation, the EPD randomly elected 282 waste samples from landfills and RTS between October and December 2015. Broadly speaking, PSB landfill disposal has reduced by 25% after the extension of PSB Charging (i.e. from approximately 5.24 billion in 2014 to about 3.93 billion in 2015).
(1) Retail categories
As most of the retail outlets are covered by the first phase legislation, the total PSB disposal was estimated to have reduced by only 35%, and such reduction was mainly driven by retail outlets falling outside the scope of the original legislation.
(2) Non-food-related retail categories
The non-food-related retail categories achieved the most compelling results. The reduction of PSB disposal ranged from 34% for fashion and footwear shops to approximately 83% for newspaper and magazine outlets.
(3) Food-related retail categories
Most of the products within the food-related retail categories fell within the food hygiene exemption. Hence, the outcome was insignificant. In particular, for cooked food outlets, the disposal rate remained more or less the same before and after the second phase implementation. Nevertheless, it is observed that there was a 20% decrease of PSB disposal from bakeries and cake shops, mainly because more sellers are aware of not using multiple-layer wrapping bags for bakery items.
Opinion survey: Telephone surveys were carried out between February and Mary 2016. Around 1,000 interviewers gave feedbacks on their behavioural change subsequent to the full implementation of the levy scheme. The outcome was generally positive. Amongst the respondents, 85% of them opined that non-compliance of the Scheme was uncommon, where 79% of them comprehend that the full implementation of PSB could further enhance their habit of BYOB.
Enforcement actions: Since 1 May 2015, officers have started to take law enforcement actions against non-complying retailers and no longer given them verbal warnings. By the end of April 2017, 406 fixed penalty notices were issued. However, only 15 prosecutions were made against retailers. In July 2017, Greeners Action, a Hong Kong-based Non-Profit Organisation conducted an undercover operation to inspect 100 retail outlets, and it was found that more than half of them distributed PSBs to customers for free. Lenient law enforcement could be regarded as a hindrance to streamline compliance.
Promotion
Events
District briefings: The EPD held district briefings in civic centres and community halls to raise the public's awareness of the levy scheme. District briefings are effective platforms to address the public's concerns and collect their opinion directly on the PSB charges, the scope of implementation and the exemption arrangements.
Educational visits: After the full implementation, the EPD officers paid educational visits to SMEs and wet markets. Since these retailers had relatively less administrative capability to fulfill the statutory requirements, and a fixed penalty notice was newly imposed on law offenders, officers recognised the importance of reminding sellers of their obligations.
Publicity materials
Information leaflets and materials: As distinguished from usual publicity materials, leaflets introducing the levy scheme were designed to carry multi-languages including Tagalog, Indonesian and Thai, so that foreign domestic helpers, one of the targeted participants of PSB Charging, could understand the messages.
Advertisements: Bus-Body and Tram-Body advertising, television and radio announcements were means used by the government to alert citizens about the commencement of the levy scheme.
Overseas experience: alternatives to the levy scheme
Overseas jurisdictions have adopted different types of PSB reduction measures. These collective experiences may serve as valuable inputs for modifying Hong Kong's model.
Environmental levy at the manufacturing and import level
Denmark
In 1994, Denmark imposed a green tax on plastic bags. Manufacturers and importers of PSBs are required to pay a tax based on PSBs' weight, where retailers would buy PSBs at tax-loaded prices. This creates direct economic incentives for retailers to distribute PSBs tentatively. As retailers are not bound to pass on the tax to customers and charge them for PSBs, the levy would normally not raise the financial cost to consumers. After the introduction of levy, the distribution of PSBs has decreased by 60%. Nonetheless, the figure rebounded substantially as the tax rate has remained unchanged since 1998.
Ban on PSBs
United States
After failed attempts to introduce an environmental levy and meet PSB reduction targets by signing voluntary agreements with major supermarkets, San Francisco City Government passed a legislation to ban the use of PSBs in 2005, mandating the use of recyclable paper bags or compostable PSBs at retails. After this successful initiative, there was a trend in the United States to ban the use of PSBs. It was reported that over 132 cities and counties in 18 states introduced similar arrangements. In 2015, California City Government announced its statewide ban on PSBs in grocery stores, pharmacies and supermarkets. Liquor stores and small food retailers also joined the scheme in the following year. It was estimated that there was an 89% decrease of plastic bags litter in the storm drain system, and 60% in the creeks and rivers.
Australia
The Australian government also moved from adopting a voluntary approach to a total ban of PSBs. In 2003, a Code of Practice for the Management of Plastic Bags was signed between the Environment Protection and Heritage Council (EPHC) and the Australian Retailers Association. However, the targets on reduction of PSB disposal and recycling rate were barely met. EPHC therefore issued a public consultation document and received positive feedbacks that supported a complete ban on PSBs. By 2017, every state in Australia has banned or promised to ban lightweight plastic bags.
Future development
It is repeatedly reported that Hong Kong consumers are gradually used to paying the 50 cents levy. In light of such situation, introducing a total ban on PSBs may be an alternative to propagate the idea of BYOB in the community and reduce PSB disposal.
The government is also advised to encourage retailers to donate the proceeds of the PSB Charge to environmental purposes. Alternatively, the government may consider collecting the Charge from sellers and depositing such amount in an "environmental fund" for waste reduction campaigns.
See also
Biodegradable waste
Waste management in Hong Kong
References
Hong Kong
Hong Kong
Waste management in Hong Kong
Environmentalism in Hong Kong
2015 in Hong Kong |
Psilocybe cyanofibrillosa, also known as rhododendron psilocybe and blue-haired psilocybe, is a psilocybin mushroom of the family Hymenogastraceae having psilocybin and psilocin as main active compounds. First documented in 1980 in the Pacific Northwest, it is relatively uncommon and can be distinguished from other closely related species by its smaller spores and forking cheilocystidia.
Psilocybe cyanescens also has forking cheilocystidia, but less often than Psilocybe cyanofibrillosa. Psilocybe cyanofibrillosa is also distinguished from Psilocybe cyanescens by an absence of pleurocystidia.
The name of this species refers to the fibrils on the Stipe (mycology) that turn bluish in age, or when handled.
This species is closely related to Psilocybe subfimetaria.
Description
Psilocybe cyanofibrillosa has a farinaceous smell and taste.
Pileus
The Pileus is 1.4–3.5 cm in diameter and conic to convex to broadly convex then becoming flat in age. It is not usually umbonate. The pileus is deep chestnut brown and hygrophanous, fading to yellowish brown or grayish white when dry. The surface is viscid when moist from the separable gelatinous pellicle.
Gills
The gills are adnate to adnexed to slightly subdecurrent in age. It is light grayish, becoming purplish brown with age while the edges remain whitish.
Spores
Psilocybe cyanofibrillosa spores are purplish brown in deposit, subellipsoid in shape, and (9)9.5–11(12) x (5.5)6–6.6(7) μm.
Stipe
The stipe is 3–8 cm long and 0.5 cm thick. It has an equal structure only enlarging near the base. The stipe is striate, pallid to yellow brown with fine fibrils that stain blue when handled. The stipe has a cortina that sometimes leaves a fragile annular zone. White rhizomorphs are at the base. The flesh is brownish and bruises bluish to indigo-black.
Microscopic features
Psilocybe cyanofibrillosa basidia each produce four spores, and rarely only two spores. The cheilocystidia are fusiform to lanceolate and 22–33 x 5.5–7 μm, with an elongated, forking neck and are 1–1.5 μm thick at its apex. Pleurocystidia are absent in Psilocybe cyanofibrillosa.
Habitat and formation
Psilocybe cyanofibrillosa is found growing scattered to gregarious, from September to December from Northern California to British Columbia, Canada. It is found in soils enriched with deciduous wood debris, among bush lupines, in Alder and Willow wood chips and bark mulch, Fir sawdust, in coastal regions, in rhododendron gardens and nurseries, and in flood plains in river estuaries.
Chemistry
Both psilocybin and psilocin (0.05 mg per gram dry weight and 1.4 mg per gram psilocin) were detected by Beug and Bigwood.
References
Stamets PE, Beug MW, Bigwood JE, Guzmán G. (1980). A new species and new variety of Psilocybe from North America. Mycotaxon 11(2): 476-484.
Entheogens
Psychoactive fungi
cyanofibrillosa
Psychedelic tryptamine carriers
Fungi of North America
Taxa named by Gastón Guzmán |
```go
/*
* path_to_url
* All Rights Reserved.
*
*
* 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 functions
import (
"testing"
"github.com/stretchr/testify/assert"
)
func TestLtrim(t *testing.T) {
call := Ltrim{}
res, _ := call.Call([]interface{}{"hello world", "hello "})
assert.Equal(t, "world", res)
}
``` |
The Alaska Conservation Society was the first grassroots environmental conservation group in the U.S. state of Alaska. It was founded in 1960 to coordinate opposition to Project Chariot, a plan to blast a harbor at Point Hope, Alaska, using nuclear explosions. The group subscribed to environmental preservation and the principles of conservation. After the defeat of Project Chariot, the group decided to fight the proposed Rampart Dam project on the Yukon River. After succeeding, the society took a stance on the development of the Trans-Alaska Pipeline System, encouraging environmental mitigation during and after its construction. This led to the society becoming a major factor in environmental policy within the state. The group operated between 1960 and 1993 and was superseded by the Alaska Conservation Foundation, which was founded in 1980 and still operates today.
Founding and History
In 1960, the Alaska Conservation Society was founded by Alaskan environmentalist Ginny Wood and her then husband, Morton "Woody" Wood, at the University of Alaska Fairbanks in College, Alaska to bring together like-minded people in order to better organize opposition to two major projects in Alaska: Project Chariot and the Rampart Dam. The group hoped that its status as an organization "by Alaskans and for Alaskans" would allow its arguments to gain traction in places where speakers from the Continental United States had not. According to Ginny Wood, one of their main reasons for establishing their own organization was that they didn't want "outside people" controlling the newly minted state. Celia M. Hunter, one of the group's founding members, became its first president. Early on, the society operated out of living rooms and utilized a small printing press to distribute their bulletin. Many of the early members were scientists, although this was not true for either the Woods or Hunter.
The Conservation Society was organized into two groups: Alaskan members, who had voting authority, and "associate," or non-Alaskan members, who did not. It was very important to the Woods that Alaskans maintain control over the organization. By 1961, one year after its founding, the Alaska Conservation Society had about 300 members, 50 percent of whom were associate members. Thanks to widening coverage granted it during its opposition to Chariot and Rampart development projects, the group expanded to more than 600 members by 1965. While early on the group focused on things like the negative effects hunting wolves had on ecosystems or the importance of large carnivore conservation, they eventually scrutinized government projects. The group's influence grew after Project Chariot and the Rampart Dam were successfully canceled, a fact illustrated by the selection of Alaska Conservation Society president Ernst W. Muller as commissioner of the Alaska State Department of Environmental Conservation in 1975.
Main Accomplishments
Project Chariot
During the conflict with Russia called the Cold War, the US proposed Project Chariot: a plan to detonate atomic bombs at Cape Thompson, near Point Hope, Alaska, to make an artificial bay. It was a part of Operation Plowshare. There was significant local resistance to the project by the Iñupiaq groups who live nearby, but the government conducted some tests in secrecy, although, according to Gerald Johnson, none of the people involved in the project had ever visited the site. Although these documents were declassified in 2014, the full extent of the damage to the local area is not known. The Alaska Conservation Society, in conjunction with local groups, opposed the project.
Despite the ostensible win for ACS and the local Iñupiaq groups, people living in Point Hope continue to suffer elevated levels of certain cancers, indicating radiation, chemical contaminants, and other pollutants. This historical episode contributes to high levels of mistrust among the locals towards government, especially the federal government. Since the experiments were done secretly and the documents involved are difficult to understand, local people have accepted that they may never know exactly what happened. This has been difficult for many Indigenous people of the area to come to terms with.
The Rampart Dam
The Rampart Dam was a project suggested to build a large hydroelectric dam on the Yukon River, stopping its flow and creating a large floodplain. Such a dam would have caused significant loss to both Indigenous villages as well as to animal habitat, as the Yukon Flats, when flooded, take up a space greater than that of the current Lake Erie. The Alaska Conservation Society opposed the project. After a long fight, including surveys done by scientists to examine the environmental impact of flooding the Yukon Flats, the project was halted. Ginny Wood cites the Rampart Dam fight as a significant one for the ACS. They brought in outside economists and other people to specifically counter claims made by the government about the benefits the dam would have for the state, including the idea of cheap electricity.
Designation of the Arctic National Wildlife Refuge
The Arctic National Wildlife Refuge, also known as ANWR, lies in Northeastern Alaska and covers 19.3 million acres. It was established in 1980 by President Carter, and cannot be opened up to oil exploration without congressional action. This designation occurred after a number of smaller tracts of land in the same area, with the same name, were protected; the ACS was first involved in 1959, then in 1960 helped protect 8.9 million acres of the refuge. People who contributed significantly to this effort included Olaus and Margaret Murie, as well as George Collins.
Although the ACS contributed to the establishment of the refuge in its early days, debate over ANWR, oil drilling, and conservation continues to this day.
Legacy
Ginny Wood, the founder of ACS, and Celia Hunter, its first president, are considered the matriarchs of Alaskan conservation. In 1993, the Society disbanded. It was replaced by the Alaska Conservation Foundation, which credits Wood and Denny Wilcher, who helped found the Sierra Club, on its website. It also has influenced the state by being an early proponent of wildlife refuges and other large wildernesses that are not considered parks, which continue to this day. Debates over pipelines also continue, such as the Dakota Access Pipeline and others; the ACS was an early example of counter-pipeline debates and voices.
Notes
References
Coates, Peter A. The Trans-Alaska Pipeline Controversy. University of Alaska Press, 1991.
Haycox, Stephen. Alaska: An American Colony. University of Washington Press, 2006.
Layne, Elizabeth N. "Nominees for the American Heritage Society Awards", American Heritage Magazine. February 1970. Volume 21, Issue 2. p. 3.
The Associated Press. "Two pioneering conservationists honored", The Peninsula Clarion. August 16, 2001. Accessed February 18, 2009.
Woodford, Riley. "Tales of pioneer conservationists", The Juneau Empire. Accessed February 18, 2009.
Environmental organizations based in Alaska
Organizations established in 1960
1960 establishments in Alaska |
Fontages Airport is located east of Fontanges, Quebec, Canada.
References
James Bay Project
Registered aerodromes in Nord-du-Québec |
Bogoliubov causality condition is a causality condition for scattering matrix (S-matrix) in axiomatic quantum field theory. The condition was introduced in axiomatic quantum field theory by Nikolay Bogolyubov in 1955.
Formulation
In axiomatic quantum theory, S-matrix is considered as a functional of a function defined on the Minkowski space . This function characterizes the intensity of the interaction in different space-time regions: the value at a point corresponds to the absence of interaction in , corresponds to the most intense interaction, and values between 0 and 1 correspond to incomplete interaction at . For two points , the notation means that causally precedes .
Let be scattering matrix as a functional of . The Bogoliubov causality condition in terms of variational derivatives has the form:
References
N. N. Bogoliubov, A. A. Logunov, I. T. Todorov (1975): Introduction to Axiomatic Quantum Field Theory. Reading, Mass.: W. A. Benjamin, Advanced Book Program.
N. N. Bogoliubov, A. A. Logunov, A. I. Oksak, I. T. Todorov (1990): General Principles of Quantum Field Theory. Kluwer Academic Publishers, Dordrecht [Holland]; Boston. . .
Axiomatic quantum field theory |
Mark Fletcher may refer to:
Mark Fletcher (businessman), American internet entrepreneur
Mark Fletcher (footballer), English former footballer
Mark Fletcher (politician), British Member of Parliament for Bolsover |
Beckjord is a surname of Scandinavian origins (mostly found in Norway). Notable people with the surname include:
Jon-Erik Beckjord (1939–2008), American proponent of paranormal beliefs
Suprabha Beckjord (born 1956), American ultramarathon runner
Surnames of Scandinavian origin |
```swift
@testable import SwifterSwift
import XCTest
#if canImport(UIKit) && !os(watchOS)
import UIKit
final class UINavigationBarExtensionsTests: XCTestCase {
func testSetTitleFont() {
let navigationBar = UINavigationBar()
let helveticaFont = UIFont(name: "HelveticaNeue", size: 14)!
navigationBar.setTitleFont(helveticaFont, color: .green)
if #available(iOS 13.0, tvOS 13.0, *) {
let color = navigationBar.standardAppearance
.titleTextAttributes[NSAttributedString.Key.foregroundColor] as? UIColor
XCTAssertEqual(color, .green)
let font = navigationBar.standardAppearance.titleTextAttributes[NSAttributedString.Key.font] as? UIFont
XCTAssertEqual(font, helveticaFont)
navigationBar.setTitleFont(helveticaFont)
let defaultColor = navigationBar.standardAppearance
.titleTextAttributes[NSAttributedString.Key.foregroundColor] as? UIColor
XCTAssertEqual(defaultColor, .black)
} else {
let color = navigationBar.titleTextAttributes?[NSAttributedString.Key.foregroundColor] as? UIColor
XCTAssertEqual(color, .green)
let font = navigationBar.titleTextAttributes?[NSAttributedString.Key.font] as? UIFont
XCTAssertEqual(font, helveticaFont)
navigationBar.setTitleFont(helveticaFont)
let defaultColor = navigationBar.titleTextAttributes?[NSAttributedString.Key.foregroundColor] as? UIColor
XCTAssertEqual(defaultColor, .black)
}
}
func testMakeTransparent() {
let navigationBar = UINavigationBar()
navigationBar.makeTransparent(withTint: .red)
let legacyTests = {
XCTAssertNotNil(navigationBar.backgroundImage(for: .default))
XCTAssertNotNil(navigationBar.shadowImage)
XCTAssert(navigationBar.isTranslucent)
XCTAssertEqual(navigationBar.tintColor, .red)
let color = navigationBar.titleTextAttributes?[NSAttributedString.Key.foregroundColor] as? UIColor
XCTAssertEqual(color, .red)
navigationBar.makeTransparent()
let defaultColor = navigationBar.titleTextAttributes?[NSAttributedString.Key.foregroundColor] as? UIColor
XCTAssertEqual(defaultColor, .white)
}
#if os(tvOS)
legacyTests()
#else
if #available(iOS 13.0, *) {
XCTAssertEqual(navigationBar.tintColor, .red)
let standardAppearanceColor = navigationBar.standardAppearance
.titleTextAttributes[NSAttributedString.Key.foregroundColor] as? UIColor
let scrollEdgeAppearanceColor = navigationBar.scrollEdgeAppearance?
.titleTextAttributes[NSAttributedString.Key.foregroundColor] as? UIColor
let compactAppearanceColor = navigationBar.compactAppearance?
.titleTextAttributes[NSAttributedString.Key.foregroundColor] as? UIColor
XCTAssertEqual(standardAppearanceColor, .red)
XCTAssertEqual(scrollEdgeAppearanceColor, .red)
XCTAssertEqual(compactAppearanceColor, .red)
navigationBar.makeTransparent()
let standardAppearanceDefaultColor = navigationBar.standardAppearance
.titleTextAttributes[NSAttributedString.Key.foregroundColor] as? UIColor
let scrollEdgeAppearanceDefaultColor = navigationBar.scrollEdgeAppearance?
.titleTextAttributes[NSAttributedString.Key.foregroundColor] as? UIColor
let compactAppearanceDefaultColor = navigationBar.compactAppearance?
.titleTextAttributes[NSAttributedString.Key.foregroundColor] as? UIColor
XCTAssertEqual(standardAppearanceDefaultColor, .white)
XCTAssertEqual(scrollEdgeAppearanceDefaultColor, .white)
XCTAssertEqual(compactAppearanceDefaultColor, .white)
} else {
legacyTests()
}
#endif
}
func testSetColors() {
let navigationBar = UINavigationBar()
navigationBar.setColors(background: .blue, text: .green)
let legacyTests = {
XCTAssertFalse(navigationBar.isTranslucent)
XCTAssertEqual(navigationBar.backgroundColor, .blue)
XCTAssertEqual(navigationBar.barTintColor, .blue)
XCTAssertNotNil(navigationBar.backgroundImage(for: .default))
XCTAssertEqual(navigationBar.tintColor, .green)
let color = navigationBar.titleTextAttributes?[NSAttributedString.Key.foregroundColor] as? UIColor
XCTAssertEqual(color, .green)
}
#if os(tvOS)
legacyTests()
#else
if #available(iOS 13.0, *) {
XCTAssertEqual(navigationBar.tintColor, .green)
let standardAppearanceBackgroundColor = navigationBar.standardAppearance.backgroundColor
let scrollEdgeAppearanceBackgroundColor = navigationBar.scrollEdgeAppearance?.backgroundColor
let compactAppearanceBackgroundColor = navigationBar.compactAppearance?.backgroundColor
XCTAssertEqual(standardAppearanceBackgroundColor, .blue)
XCTAssertEqual(scrollEdgeAppearanceBackgroundColor, .blue)
XCTAssertEqual(compactAppearanceBackgroundColor, .blue)
let standardAppearanceTextColor = navigationBar.standardAppearance
.titleTextAttributes[NSAttributedString.Key.foregroundColor] as? UIColor
let scrollEdgeAppearanceTextColor = navigationBar.scrollEdgeAppearance?
.titleTextAttributes[NSAttributedString.Key.foregroundColor] as? UIColor
let compactAppearanceTextColor = navigationBar.compactAppearance?
.titleTextAttributes[NSAttributedString.Key.foregroundColor] as? UIColor
XCTAssertEqual(standardAppearanceTextColor, .green)
XCTAssertEqual(scrollEdgeAppearanceTextColor, .green)
XCTAssertEqual(compactAppearanceTextColor, .green)
} else {
legacyTests()
}
#endif
}
}
#endif
``` |
Ligne Aérienne du Roi Albert (LARA; "King Albert Airline") was a short-lived civilian airline in the Belgian Congo colony.
History
Belgium had set up the SNETA in 1919 to study the possibilities and options of civilian air transport. In Europe, Sabena was created as a result, in their African colony the Belgians created CENAC (Comité d' Etude pour la Navigation Aérienne du Congo), which would evolve into the Ligne Aerienne du Roi Albert, so named after Albert I of Belgium who was a driving force behind the project in 1920.
The possibility of exploiting an aerial route along the Congo River was studied under the leadership of Emile Allard, civil engineer, and Mr Michaux, a military officer.
Routes and Destinations
The airline had only a short life, first opening a leg from Kinshasa (formerly Leopoldville) to Ngombe on July 1, 1920. The second leg, from Gombe to Lisala was opened on March 3, 1921. On July 1, 1921, exactly one year after the initial flight, the entire route from Kinshasa to Kisangani () was finally opened, but operations were discontinued on June 7, 1922.
Leopoldville
Ngombe
Lisala
Stanleyville
Fleet
Levy Lepen hydroplane
LARA operated six French-built Levy Lepen HB2 hydroplanes upstream along the Congo River. This choice was dictated by the absence of any landing sites along the route. The aircraft were also used to photograph and map the area. The airline was the very first one set-up by a European colonial power overseas. In total were covered during the airline's short life, amounting to 80 round trips, carrying 95 passengers and 2 tons of mail.
Demise
After its demise in 1922, a Congo local network was set up in 1925 by Sabena, operating Handley-Page W8 trimotors, followed by a regular Belgium-Congo link in 1935 using Fokker VIIs.
References
External links
Encyclopedia of African airlines by Ben R. Guttery pp. 42
Defunct airlines of the Democratic Republic of the Congo
Belgian Congo
Kisangani
Transport in Kinshasa
Airlines established in 1920
1920 establishments in the Belgian Congo
Airlines disestablished in 1922
1922 disestablishments in Africa |
The Cocos flycatcher (Nesotriccus ridgwayi) is a species of bird in the family Tyrannidae. It is a small (13 cm) grey bird with a long bill.
Distribution and habitat
It is endemic to Cocos Island off Costa Rica. Its natural habitats are subtropical or tropical moist lowland forest, subtropical or tropical swamps, subtropical or tropical moist montane forest, and subtropical or tropical moist shrubland.
Conservation
It is thought to be threatened by introduced species, particularly rats and feral cats, which prey on the species, and pigs which destroy habitat through foraging. There is no evidence yet of a decline, but is listed as Vulnerable due to its tiny range.
References
External links
BirdLife Species Factsheet.
Nesotriccus
Endemic birds of Costa Rica
Cocos flycatcher
Taxonomy articles created by Polbot |
```c++
/*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the copyright holder nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
/**
* @file
* This file includes definitions for Thread Link Metrics.
*/
#include "link_metrics.hpp"
#if OPENTHREAD_CONFIG_MLE_LINK_METRICS_INITIATOR_ENABLE || OPENTHREAD_CONFIG_MLE_LINK_METRICS_SUBJECT_ENABLE
#include "common/code_utils.hpp"
#include "common/encoding.hpp"
#include "common/locator_getters.hpp"
#include "common/log.hpp"
#include "common/num_utils.hpp"
#include "common/numeric_limits.hpp"
#include "instance/instance.hpp"
#include "mac/mac.hpp"
#include "thread/link_metrics_tlvs.hpp"
#include "thread/neighbor_table.hpp"
namespace ot {
namespace LinkMetrics {
RegisterLogModule("LinkMetrics");
static constexpr uint8_t kQueryIdSingleProbe = 0; // This query ID represents Single Probe.
static constexpr uint8_t kSeriesIdAllSeries = 255; // This series ID represents all series.
// Constants for scaling Link Margin and RSSI to raw value
static constexpr uint8_t kMaxLinkMargin = 130;
static constexpr int32_t kMinRssi = -130;
static constexpr int32_t kMaxRssi = 0;
#if OPENTHREAD_CONFIG_MLE_LINK_METRICS_INITIATOR_ENABLE
Initiator::Initiator(Instance &aInstance)
: InstanceLocator(aInstance)
{
}
Error Initiator::Query(const Ip6::Address &aDestination, uint8_t aSeriesId, const Metrics *aMetrics)
{
Error error;
Neighbor *neighbor;
QueryInfo info;
SuccessOrExit(error = FindNeighbor(aDestination, neighbor));
info.Clear();
info.mSeriesId = aSeriesId;
if (aMetrics != nullptr)
{
info.mTypeIdCount = aMetrics->ConvertToTypeIds(info.mTypeIds);
}
if (aSeriesId != 0)
{
VerifyOrExit(info.mTypeIdCount == 0, error = kErrorInvalidArgs);
}
error = Get<Mle::Mle>().SendDataRequestForLinkMetricsReport(aDestination, info);
exit:
return error;
}
Error Initiator::AppendLinkMetricsQueryTlv(Message &aMessage, const QueryInfo &aInfo)
{
Error error = kErrorNone;
Tlv tlv;
// The MLE Link Metrics Query TLV has two sub-TLVs:
// - Query ID sub-TLV with series ID as value.
// - Query Options sub-TLV with Type IDs as value.
tlv.SetType(Mle::Tlv::kLinkMetricsQuery);
tlv.SetLength(sizeof(Tlv) + sizeof(uint8_t) + ((aInfo.mTypeIdCount == 0) ? 0 : (sizeof(Tlv) + aInfo.mTypeIdCount)));
SuccessOrExit(error = aMessage.Append(tlv));
SuccessOrExit(error = Tlv::Append<QueryIdSubTlv>(aMessage, aInfo.mSeriesId));
if (aInfo.mTypeIdCount != 0)
{
QueryOptionsSubTlv queryOptionsTlv;
queryOptionsTlv.Init();
queryOptionsTlv.SetLength(aInfo.mTypeIdCount);
SuccessOrExit(error = aMessage.Append(queryOptionsTlv));
SuccessOrExit(error = aMessage.AppendBytes(aInfo.mTypeIds, aInfo.mTypeIdCount));
}
exit:
return error;
}
void Initiator::HandleReport(const Message &aMessage, OffsetRange &aOffsetRange, const Ip6::Address &aAddress)
{
Error error = kErrorNone;
bool hasStatus = false;
bool hasReport = false;
Tlv::ParsedInfo tlvInfo;
ReportSubTlv reportTlv;
MetricsValues values;
uint8_t status;
uint8_t typeId;
OT_UNUSED_VARIABLE(error);
VerifyOrExit(mReportCallback.IsSet());
values.Clear();
for (; !aOffsetRange.IsEmpty(); aOffsetRange.AdvanceOffset(tlvInfo.GetSize()))
{
SuccessOrExit(error = tlvInfo.ParseFrom(aMessage, aOffsetRange));
if (tlvInfo.mIsExtended)
{
continue;
}
// The report must contain either:
// - One or more Report Sub-TLVs (in case of success), or
// - A single Status Sub-TLV (in case of failure).
switch (tlvInfo.mType)
{
case StatusSubTlv::kType:
VerifyOrExit(!hasStatus && !hasReport, error = kErrorDrop);
SuccessOrExit(error = Tlv::Read<StatusSubTlv>(aMessage, aOffsetRange.GetOffset(), status));
hasStatus = true;
break;
case ReportSubTlv::kType:
VerifyOrExit(!hasStatus, error = kErrorDrop);
// Read the report sub-TLV assuming minimum length
SuccessOrExit(error = aMessage.Read(aOffsetRange, &reportTlv, sizeof(Tlv) + ReportSubTlv::kMinLength));
VerifyOrExit(reportTlv.IsValid(), error = kErrorParse);
hasReport = true;
typeId = reportTlv.GetMetricsTypeId();
if (TypeId::IsExtended(typeId))
{
// Skip the sub-TLV if `E` flag is set.
break;
}
if (TypeId::GetValueLength(typeId) > sizeof(uint8_t))
{
// If Type ID indicates metric value has 4 bytes length, we
// read the full `reportTlv`.
SuccessOrExit(error = aMessage.Read(aOffsetRange.GetOffset(), reportTlv));
}
switch (typeId)
{
case TypeId::kPdu:
values.mMetrics.mPduCount = true;
values.mPduCountValue = reportTlv.GetMetricsValue32();
LogDebg(" - PDU Counter: %lu (Count/Summation)", ToUlong(values.mPduCountValue));
break;
case TypeId::kLqi:
values.mMetrics.mLqi = true;
values.mLqiValue = reportTlv.GetMetricsValue8();
LogDebg(" - LQI: %u (Exponential Moving Average)", values.mLqiValue);
break;
case TypeId::kLinkMargin:
values.mMetrics.mLinkMargin = true;
values.mLinkMarginValue = ScaleRawValueToLinkMargin(reportTlv.GetMetricsValue8());
LogDebg(" - Margin: %u (dB) (Exponential Moving Average)", values.mLinkMarginValue);
break;
case TypeId::kRssi:
values.mMetrics.mRssi = true;
values.mRssiValue = ScaleRawValueToRssi(reportTlv.GetMetricsValue8());
LogDebg(" - RSSI: %u (dBm) (Exponential Moving Average)", values.mRssiValue);
break;
}
break;
}
}
VerifyOrExit(hasStatus || hasReport);
mReportCallback.Invoke(&aAddress, hasStatus ? nullptr : &values,
hasStatus ? MapEnum(static_cast<Status>(status)) : MapEnum(kStatusSuccess));
exit:
LogDebg("HandleReport, error:%s", ErrorToString(error));
}
Error Initiator::SendMgmtRequestForwardTrackingSeries(const Ip6::Address &aDestination,
uint8_t aSeriesId,
const SeriesFlags &aSeriesFlags,
const Metrics *aMetrics)
{
Error error;
Neighbor *neighbor;
uint8_t typeIdCount = 0;
FwdProbingRegSubTlv fwdProbingSubTlv;
SuccessOrExit(error = FindNeighbor(aDestination, neighbor));
VerifyOrExit(aSeriesId > kQueryIdSingleProbe, error = kErrorInvalidArgs);
fwdProbingSubTlv.Init();
fwdProbingSubTlv.SetSeriesId(aSeriesId);
fwdProbingSubTlv.SetSeriesFlagsMask(aSeriesFlags.ConvertToMask());
if (aMetrics != nullptr)
{
typeIdCount = aMetrics->ConvertToTypeIds(fwdProbingSubTlv.GetTypeIds());
}
fwdProbingSubTlv.SetLength(sizeof(aSeriesId) + sizeof(uint8_t) + typeIdCount);
error = Get<Mle::Mle>().SendLinkMetricsManagementRequest(aDestination, fwdProbingSubTlv);
exit:
LogDebg("SendMgmtRequestForwardTrackingSeries, error:%s, Series ID:%u", ErrorToString(error), aSeriesId);
return error;
}
Error Initiator::SendMgmtRequestEnhAckProbing(const Ip6::Address &aDestination,
EnhAckFlags aEnhAckFlags,
const Metrics *aMetrics)
{
Error error;
Neighbor *neighbor;
uint8_t typeIdCount = 0;
EnhAckConfigSubTlv enhAckConfigSubTlv;
SuccessOrExit(error = FindNeighbor(aDestination, neighbor));
if (aEnhAckFlags == kEnhAckClear)
{
VerifyOrExit(aMetrics == nullptr, error = kErrorInvalidArgs);
}
enhAckConfigSubTlv.Init();
enhAckConfigSubTlv.SetEnhAckFlags(aEnhAckFlags);
if (aMetrics != nullptr)
{
typeIdCount = aMetrics->ConvertToTypeIds(enhAckConfigSubTlv.GetTypeIds());
}
enhAckConfigSubTlv.SetLength(EnhAckConfigSubTlv::kMinLength + typeIdCount);
error = Get<Mle::Mle>().SendLinkMetricsManagementRequest(aDestination, enhAckConfigSubTlv);
if (aMetrics != nullptr)
{
neighbor->SetEnhAckProbingMetrics(*aMetrics);
}
else
{
Metrics metrics;
metrics.Clear();
neighbor->SetEnhAckProbingMetrics(metrics);
}
exit:
return error;
}
Error Initiator::HandleManagementResponse(const Message &aMessage, const Ip6::Address &aAddress)
{
Error error = kErrorNone;
OffsetRange offsetRange;
Tlv::ParsedInfo tlvInfo;
uint8_t status;
bool hasStatus = false;
VerifyOrExit(mMgmtResponseCallback.IsSet());
SuccessOrExit(error = Tlv::FindTlvValueOffsetRange(aMessage, Mle::Tlv::Type::kLinkMetricsManagement, offsetRange));
for (; !offsetRange.IsEmpty(); offsetRange.AdvanceOffset(tlvInfo.GetSize()))
{
SuccessOrExit(error = tlvInfo.ParseFrom(aMessage, offsetRange));
if (tlvInfo.mIsExtended)
{
continue;
}
switch (tlvInfo.mType)
{
case StatusSubTlv::kType:
VerifyOrExit(!hasStatus, error = kErrorParse);
SuccessOrExit(error = Tlv::Read<StatusSubTlv>(aMessage, offsetRange.GetOffset(), status));
hasStatus = true;
break;
default:
break;
}
}
VerifyOrExit(hasStatus, error = kErrorParse);
mMgmtResponseCallback.Invoke(&aAddress, MapEnum(static_cast<Status>(status)));
exit:
return error;
}
Error Initiator::SendLinkProbe(const Ip6::Address &aDestination, uint8_t aSeriesId, uint8_t aLength)
{
Error error;
uint8_t buf[kLinkProbeMaxLen];
Neighbor *neighbor;
SuccessOrExit(error = FindNeighbor(aDestination, neighbor));
VerifyOrExit(aLength <= kLinkProbeMaxLen && aSeriesId != kQueryIdSingleProbe && aSeriesId != kSeriesIdAllSeries,
error = kErrorInvalidArgs);
error = Get<Mle::Mle>().SendLinkProbe(aDestination, aSeriesId, buf, aLength);
exit:
LogDebg("SendLinkProbe, error:%s, Series ID:%u", ErrorToString(error), aSeriesId);
return error;
}
void Initiator::ProcessEnhAckIeData(const uint8_t *aData, uint8_t aLength, const Neighbor &aNeighbor)
{
MetricsValues values;
uint8_t idx = 0;
VerifyOrExit(mEnhAckProbingIeReportCallback.IsSet());
values.SetMetrics(aNeighbor.GetEnhAckProbingMetrics());
if (values.GetMetrics().mLqi && idx < aLength)
{
values.mLqiValue = aData[idx++];
}
if (values.GetMetrics().mLinkMargin && idx < aLength)
{
values.mLinkMarginValue = ScaleRawValueToLinkMargin(aData[idx++]);
}
if (values.GetMetrics().mRssi && idx < aLength)
{
values.mRssiValue = ScaleRawValueToRssi(aData[idx++]);
}
mEnhAckProbingIeReportCallback.Invoke(aNeighbor.GetRloc16(), &aNeighbor.GetExtAddress(), &values);
exit:
return;
}
Error Initiator::FindNeighbor(const Ip6::Address &aDestination, Neighbor *&aNeighbor)
{
Error error = kErrorUnknownNeighbor;
Mac::Address macAddress;
aNeighbor = nullptr;
VerifyOrExit(aDestination.IsLinkLocalUnicast());
aDestination.GetIid().ConvertToMacAddress(macAddress);
aNeighbor = Get<NeighborTable>().FindNeighbor(macAddress);
VerifyOrExit(aNeighbor != nullptr);
VerifyOrExit(aNeighbor->GetVersion() >= kThreadVersion1p2, error = kErrorNotCapable);
error = kErrorNone;
exit:
return error;
}
#endif // OPENTHREAD_CONFIG_MLE_LINK_METRICS_INITIATOR_ENABLE
#if OPENTHREAD_CONFIG_MLE_LINK_METRICS_SUBJECT_ENABLE
Subject::Subject(Instance &aInstance)
: InstanceLocator(aInstance)
{
}
Error Subject::AppendReport(Message &aMessage, const Message &aRequestMessage, Neighbor &aNeighbor)
{
Error error = kErrorNone;
Tlv tlv;
Tlv::ParsedInfo tlvInfo;
uint8_t queryId;
bool hasQueryId = false;
uint16_t length;
uint16_t offset;
OffsetRange offsetRange;
MetricsValues values;
values.Clear();
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// Parse MLE Link Metrics Query TLV and its sub-TLVs from
// `aRequestMessage`.
SuccessOrExit(error =
Tlv::FindTlvValueOffsetRange(aRequestMessage, Mle::Tlv::Type::kLinkMetricsQuery, offsetRange));
for (; !offsetRange.IsEmpty(); offsetRange.AdvanceOffset(tlvInfo.GetSize()))
{
SuccessOrExit(error = tlvInfo.ParseFrom(aRequestMessage, offsetRange));
if (tlvInfo.mIsExtended)
{
continue;
}
switch (tlvInfo.mType)
{
case SubTlv::kQueryId:
SuccessOrExit(error =
Tlv::Read<QueryIdSubTlv>(aRequestMessage, tlvInfo.mTlvOffsetRange.GetOffset(), queryId));
hasQueryId = true;
break;
case SubTlv::kQueryOptions:
SuccessOrExit(error =
ReadTypeIdsFromMessage(aRequestMessage, tlvInfo.mValueOffsetRange, values.GetMetrics()));
break;
default:
break;
}
}
VerifyOrExit(hasQueryId, error = kErrorParse);
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// Append MLE Link Metrics Report TLV and its sub-TLVs to
// `aMessage`.
offset = aMessage.GetLength();
tlv.SetType(Mle::Tlv::kLinkMetricsReport);
SuccessOrExit(error = aMessage.Append(tlv));
if (queryId == kQueryIdSingleProbe)
{
values.mPduCountValue = aRequestMessage.GetPsduCount();
values.mLqiValue = aRequestMessage.GetAverageLqi();
values.mLinkMarginValue = Get<Mac::Mac>().ComputeLinkMargin(aRequestMessage.GetAverageRss());
values.mRssiValue = aRequestMessage.GetAverageRss();
SuccessOrExit(error = AppendReportSubTlvToMessage(aMessage, values));
}
else
{
SeriesInfo *seriesInfo = aNeighbor.GetForwardTrackingSeriesInfo(queryId);
if (seriesInfo == nullptr)
{
SuccessOrExit(error = Tlv::Append<StatusSubTlv>(aMessage, kStatusSeriesIdNotRecognized));
}
else if (seriesInfo->GetPduCount() == 0)
{
SuccessOrExit(error = Tlv::Append<StatusSubTlv>(aMessage, kStatusNoMatchingFramesReceived));
}
else
{
values.SetMetrics(seriesInfo->GetLinkMetrics());
values.mPduCountValue = seriesInfo->GetPduCount();
values.mLqiValue = seriesInfo->GetAverageLqi();
values.mLinkMarginValue = Get<Mac::Mac>().ComputeLinkMargin(seriesInfo->GetAverageRss());
values.mRssiValue = seriesInfo->GetAverageRss();
SuccessOrExit(error = AppendReportSubTlvToMessage(aMessage, values));
}
}
// Update the TLV length in message.
length = aMessage.GetLength() - offset - sizeof(Tlv);
tlv.SetLength(static_cast<uint8_t>(length));
aMessage.Write(offset, tlv);
exit:
LogDebg("AppendReport, error:%s", ErrorToString(error));
return error;
}
Error Subject::HandleManagementRequest(const Message &aMessage, Neighbor &aNeighbor, Status &aStatus)
{
Error error = kErrorNone;
OffsetRange offsetRange;
Tlv::ParsedInfo tlvInfo;
FwdProbingRegSubTlv fwdProbingSubTlv;
EnhAckConfigSubTlv enhAckConfigSubTlv;
Metrics metrics;
SuccessOrExit(error = Tlv::FindTlvValueOffsetRange(aMessage, Mle::Tlv::Type::kLinkMetricsManagement, offsetRange));
// Set sub-TLV lengths to zero to indicate that we have
// not yet seen them in the message.
fwdProbingSubTlv.SetLength(0);
enhAckConfigSubTlv.SetLength(0);
for (; !offsetRange.IsEmpty(); offsetRange.AdvanceOffset(tlvInfo.GetSize()))
{
uint16_t minTlvSize;
Tlv *subTlv;
OffsetRange tlvOffsetRange;
SuccessOrExit(error = tlvInfo.ParseFrom(aMessage, offsetRange));
if (tlvInfo.mIsExtended)
{
continue;
}
tlvOffsetRange = tlvInfo.mTlvOffsetRange;
switch (tlvInfo.mType)
{
case SubTlv::kFwdProbingReg:
subTlv = &fwdProbingSubTlv;
minTlvSize = sizeof(Tlv) + FwdProbingRegSubTlv::kMinLength;
break;
case SubTlv::kEnhAckConfig:
subTlv = &enhAckConfigSubTlv;
minTlvSize = sizeof(Tlv) + EnhAckConfigSubTlv::kMinLength;
break;
default:
continue;
}
// Ensure message contains only one sub-TLV.
VerifyOrExit(fwdProbingSubTlv.GetLength() == 0, error = kErrorParse);
VerifyOrExit(enhAckConfigSubTlv.GetLength() == 0, error = kErrorParse);
VerifyOrExit(tlvInfo.GetSize() >= minTlvSize, error = kErrorParse);
// Read `subTlv` with its `minTlvSize`, followed by the Type IDs.
SuccessOrExit(error = aMessage.Read(tlvOffsetRange, subTlv, minTlvSize));
tlvOffsetRange.AdvanceOffset(minTlvSize);
SuccessOrExit(error = ReadTypeIdsFromMessage(aMessage, tlvOffsetRange, metrics));
}
if (fwdProbingSubTlv.GetLength() != 0)
{
aStatus = ConfigureForwardTrackingSeries(fwdProbingSubTlv.GetSeriesId(), fwdProbingSubTlv.GetSeriesFlagsMask(),
metrics, aNeighbor);
}
if (enhAckConfigSubTlv.GetLength() != 0)
{
aStatus = ConfigureEnhAckProbing(enhAckConfigSubTlv.GetEnhAckFlags(), metrics, aNeighbor);
}
exit:
return error;
}
Error Subject::HandleLinkProbe(const Message &aMessage, uint8_t &aSeriesId)
{
Error error = kErrorNone;
OffsetRange offsetRange;
SuccessOrExit(error = Tlv::FindTlvValueOffsetRange(aMessage, Mle::Tlv::Type::kLinkProbe, offsetRange));
error = aMessage.Read(offsetRange, aSeriesId);
exit:
return error;
}
Error Subject::AppendReportSubTlvToMessage(Message &aMessage, const MetricsValues &aValues)
{
Error error = kErrorNone;
ReportSubTlv reportTlv;
reportTlv.Init();
if (aValues.mMetrics.mPduCount)
{
reportTlv.SetMetricsTypeId(TypeId::kPdu);
reportTlv.SetMetricsValue32(aValues.mPduCountValue);
SuccessOrExit(error = reportTlv.AppendTo(aMessage));
}
if (aValues.mMetrics.mLqi)
{
reportTlv.SetMetricsTypeId(TypeId::kLqi);
reportTlv.SetMetricsValue8(aValues.mLqiValue);
SuccessOrExit(error = reportTlv.AppendTo(aMessage));
}
if (aValues.mMetrics.mLinkMargin)
{
reportTlv.SetMetricsTypeId(TypeId::kLinkMargin);
reportTlv.SetMetricsValue8(ScaleLinkMarginToRawValue(aValues.mLinkMarginValue));
SuccessOrExit(error = reportTlv.AppendTo(aMessage));
}
if (aValues.mMetrics.mRssi)
{
reportTlv.SetMetricsTypeId(TypeId::kRssi);
reportTlv.SetMetricsValue8(ScaleRssiToRawValue(aValues.mRssiValue));
SuccessOrExit(error = reportTlv.AppendTo(aMessage));
}
exit:
return error;
}
void Subject::Free(SeriesInfo &aSeriesInfo) { mSeriesInfoPool.Free(aSeriesInfo); }
Error Subject::ReadTypeIdsFromMessage(const Message &aMessage, const OffsetRange &aOffsetRange, Metrics &aMetrics)
{
Error error = kErrorNone;
OffsetRange offsetRange = aOffsetRange;
aMetrics.Clear();
while (!offsetRange.IsEmpty())
{
uint8_t typeId;
SuccessOrExit(aMessage.Read(offsetRange, typeId));
switch (typeId)
{
case TypeId::kPdu:
VerifyOrExit(!aMetrics.mPduCount, error = kErrorParse);
aMetrics.mPduCount = true;
break;
case TypeId::kLqi:
VerifyOrExit(!aMetrics.mLqi, error = kErrorParse);
aMetrics.mLqi = true;
break;
case TypeId::kLinkMargin:
VerifyOrExit(!aMetrics.mLinkMargin, error = kErrorParse);
aMetrics.mLinkMargin = true;
break;
case TypeId::kRssi:
VerifyOrExit(!aMetrics.mRssi, error = kErrorParse);
aMetrics.mRssi = true;
break;
default:
if (TypeId::IsExtended(typeId))
{
offsetRange.AdvanceOffset(sizeof(uint8_t)); // Skip the additional second byte.
}
else
{
aMetrics.mReserved = true;
}
break;
}
offsetRange.AdvanceOffset(sizeof(uint8_t));
}
exit:
return error;
}
Status Subject::ConfigureForwardTrackingSeries(uint8_t aSeriesId,
uint8_t aSeriesFlagsMask,
const Metrics &aMetrics,
Neighbor &aNeighbor)
{
Status status = kStatusSuccess;
VerifyOrExit(0 < aSeriesId, status = kStatusOtherError);
if (aSeriesFlagsMask == 0) // Remove the series
{
if (aSeriesId == kSeriesIdAllSeries) // Remove all
{
aNeighbor.RemoveAllForwardTrackingSeriesInfo();
}
else
{
SeriesInfo *seriesInfo = aNeighbor.RemoveForwardTrackingSeriesInfo(aSeriesId);
VerifyOrExit(seriesInfo != nullptr, status = kStatusSeriesIdNotRecognized);
mSeriesInfoPool.Free(*seriesInfo);
}
}
else // Add a new series
{
SeriesInfo *seriesInfo = aNeighbor.GetForwardTrackingSeriesInfo(aSeriesId);
VerifyOrExit(seriesInfo == nullptr, status = kStatusSeriesIdAlreadyRegistered);
seriesInfo = mSeriesInfoPool.Allocate();
VerifyOrExit(seriesInfo != nullptr, status = kStatusCannotSupportNewSeries);
seriesInfo->Init(aSeriesId, aSeriesFlagsMask, aMetrics);
aNeighbor.AddForwardTrackingSeriesInfo(*seriesInfo);
}
exit:
return status;
}
Status Subject::ConfigureEnhAckProbing(uint8_t aEnhAckFlags, const Metrics &aMetrics, Neighbor &aNeighbor)
{
Status status = kStatusSuccess;
Error error = kErrorNone;
VerifyOrExit(!aMetrics.mReserved, status = kStatusOtherError);
if (aEnhAckFlags == kEnhAckRegister)
{
VerifyOrExit(!aMetrics.mPduCount, status = kStatusOtherError);
VerifyOrExit(aMetrics.mLqi || aMetrics.mLinkMargin || aMetrics.mRssi, status = kStatusOtherError);
VerifyOrExit(!(aMetrics.mLqi && aMetrics.mLinkMargin && aMetrics.mRssi), status = kStatusOtherError);
error = Get<Radio>().ConfigureEnhAckProbing(aMetrics, aNeighbor.GetRloc16(), aNeighbor.GetExtAddress());
}
else if (aEnhAckFlags == kEnhAckClear)
{
VerifyOrExit(!aMetrics.mLqi && !aMetrics.mLinkMargin && !aMetrics.mRssi, status = kStatusOtherError);
error = Get<Radio>().ConfigureEnhAckProbing(aMetrics, aNeighbor.GetRloc16(), aNeighbor.GetExtAddress());
}
else
{
status = kStatusOtherError;
}
VerifyOrExit(error == kErrorNone, status = kStatusOtherError);
exit:
return status;
}
#endif // OPENTHREAD_CONFIG_MLE_LINK_METRICS_SUBJECT_ENABLE
uint8_t ScaleLinkMarginToRawValue(uint8_t aLinkMargin)
{
// Linearly scale Link Margin from [0, 130] to [0, 255].
// `kMaxLinkMargin = 130`.
uint16_t value;
value = Min(aLinkMargin, kMaxLinkMargin);
value = value * NumericLimits<uint8_t>::kMax;
value = DivideAndRoundToClosest<uint16_t>(value, kMaxLinkMargin);
return static_cast<uint8_t>(value);
}
uint8_t ScaleRawValueToLinkMargin(uint8_t aRawValue)
{
// Scale back raw value of [0, 255] to Link Margin from [0, 130].
uint16_t value = aRawValue;
value = value * kMaxLinkMargin;
value = DivideAndRoundToClosest<uint16_t>(value, NumericLimits<uint8_t>::kMax);
return static_cast<uint8_t>(value);
}
uint8_t ScaleRssiToRawValue(int8_t aRssi)
{
// Linearly scale RSSI from [-130, 0] to [0, 255].
// `kMinRssi = -130`, `kMaxRssi = 0`.
int32_t value = aRssi;
value = Clamp(value, kMinRssi, kMaxRssi) - kMinRssi;
value = value * NumericLimits<uint8_t>::kMax;
value = DivideAndRoundToClosest<int32_t>(value, kMaxRssi - kMinRssi);
return static_cast<uint8_t>(value);
}
int8_t ScaleRawValueToRssi(uint8_t aRawValue)
{
int32_t value = aRawValue;
value = value * (kMaxRssi - kMinRssi);
value = DivideAndRoundToClosest<int32_t>(value, NumericLimits<uint8_t>::kMax);
value += kMinRssi;
return ClampToInt8(value);
}
} // namespace LinkMetrics
} // namespace ot
#endif // OPENTHREAD_CONFIG_MLE_LINK_METRICS_INITIATOR_ENABLE || OPENTHREAD_CONFIG_MLE_LINK_METRICS_SUBJECT_ENABLE
``` |
Eddie Cotton, Jr. (June 15, 1926 — June 24, 1990) was an American professional boxer. He was a resident of Seattle, Washington, until his death on following a second liver transplant.
Career
Born in Muskogee, Oklahoma, Cotton was a light heavyweight contender from the late 1950s until his retirement in the late 1960s. He was known as a good defensive fighter, although not very exciting. He was also prone to getting cut in fights. His style was undoubtedly influenced by his original trainer who had boxed in an almost identical manner.
He won the vacant Michigan version of the world light heavyweight championship in 1963, outpointing Henry Hank over 15 rounds, and twice unsuccessfully challenged for the world title, losing to Harold Johnson for the National Boxing Association title in 1961, and in 1966 losing what many felt was a controversial decision to José Torres for the world title. Ring Magazine named the Torres bout the "Fight of the Year". After the controversial Torres fight, Cotton was billed as the "Uncrowned Light Heavyweight Champion of the World."
Cotton fought 81 times in his career, winning 56, losing 23 and drawing 2 fights. He retired from boxing in 1967.
After his boxing career ended, Cotton worked for the Boeing Aircraft Company as a tool and die maker. He was also a member of the Washington State Boxing Commission. Cotton also owned a restaurant in Seattle which bore his name.
References
External links
1926 births
1990 deaths
Boxers from Oklahoma
Sportspeople from Muskogee, Oklahoma
American male boxers
Light-heavyweight boxers |
```php
<?php
/*
* This file is part of the Symfony package.
*
* (c) Fabien Potencier <fabien@symfony.com>
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
namespace Symfony\Component\Console\Input;
/**
* StreamableInputInterface is the interface implemented by all input classes
* that have an input stream.
*
* @author Robin Chalas <robin.chalas@gmail.com>
*/
interface StreamableInputInterface extends InputInterface
{
/**
* Sets the input stream to read from when interacting with the user.
*
* This is mainly useful for testing purpose.
*
* @param resource $stream The input stream
*/
public function setStream($stream);
/**
* Returns the input stream.
*
* @return resource|null
*/
public function getStream();
}
``` |
```php
<?php
/**
* Unit tests covering post mime types.
*
* @ticket 59195
*
* @group post
*
* @covers ::get_available_post_mime_types
*/
class Tests_Post_GetAvailablePostMimeTypes extends WP_UnitTestCase {
public function tear_down() {
// Remove all uploads.
$this->remove_added_uploads();
remove_filter( 'pre_get_available_post_mime_types', array( $this, 'filter_add_null_to_post_mime_types' ) );
parent::tear_down();
}
public function test_should_return_expected_post_mime_types() {
// Upload a JPEG image.
$filename = DIR_TESTDATA . '/images/test-image.jpg';
$contents = file_get_contents( $filename );
$upload = wp_upload_bits( wp_basename( $filename ), null, $contents );
$this->assertEmpty( $upload['error'], 'Uploading a JPEG file should not result in an error.' );
$this->_make_attachment( $upload );
// Upload a PDF file.
$filename = DIR_TESTDATA . '/images/test-alpha.pdf';
$contents = file_get_contents( $filename );
$upload = wp_upload_bits( wp_basename( $filename ), null, $contents );
$this->assertEmpty( $upload['error'], 'Uploading a PDF file should not result in an error.' );
$this->_make_attachment( $upload );
$mime_types = get_available_post_mime_types();
$this->assertSame( array( 'image/jpeg', 'application/pdf' ), $mime_types, 'The MIME types returned should match the uploaded file MIME types.' );
}
public function test_should_remove_null() {
// Add filter to inject null into the mime types array.
add_filter( 'pre_get_available_post_mime_types', array( $this, 'filter_add_null_to_post_mime_types' ) );
$mime_types = get_available_post_mime_types();
$this->assertEqualsCanonicalizing( array( 'image/jpeg', 'image/png' ), $mime_types );
}
/**
* Filter to inject null into the mime types array.
*
* @param string $type Post type.
* @return array
*/
public function filter_add_null_to_post_mime_types( $type ) {
return array( 'image/jpeg', null, 'image/png' );
}
}
``` |
Rankine's method or tangential angle method is an angular technique for laying out circular curves by a combination of chaining and angles at circumference, fully exploiting the theodolite and making a substantial improvement in accuracy and productivity over existing methods. This method requires access to only one road/path of communication to lay out a curve. Points on curve are calculated by their angular offset from the path of communication.
Rankine's method is named for its discoverer William John Macquorn Rankine at an early stage of his career. He had been working on railways in Ireland, on the construction of the Dublin and Drogheda line.
Background
This method makes sure that any line drawn from the known tangent to curve is a chord of the curve by constraining the deflection angle of line. Since end points of chords lie on the curve this can be used to approximate the shape of actual curve.
Procedure
Let AB be a tangent line/path of communication or start of a curve, then successive points on the curve can be obtained by drawing an arbitrary line of length from point A with an angle
where is deflection from nth chord in degrees.
R is the radius of circular curve
is arbitrary length of chord
See also
Dublin and Drogheda Railway
References
Surveying
Scottish inventions |
Wan'an () is a town under the administration of Luojiang District, Deyang, Sichuan, China. , it has 14 residential communities and 4 villages under its administration.
References
Township-level divisions of Sichuan
Deyang |
Dioungani is a village and commune of the Cercle of Koro in the Mopti Region of Mali. Jamsay Dogon is spoken in the commune.
References
External links
.
Communes of Mopti Region |
Clemmonsville Township is one of fifteen townships in Forsyth County, North Carolina, United States. The township had a population of 14,927 according to the 2010 census.
Geographically, Clemmonsville Township occupies in southwestern Forsyth County. The only incorporated municipality in Clemmonsville Township is the village of Clemmons. The township fronts the Yadkin River on its western boundary.
References
Townships in Forsyth County, North Carolina
Townships in North Carolina |
Albert Peak is a mountain summit located in British Columbia, Canada.
Description
Albert Peak is situated east of Revelstoke, southeast of Mount Revelstoke National Park and southwest of Glacier National Park. It is the highest point of the North Duncan Ranges which is a subrange of the Selkirk Mountains. The nearest neighbor is North Albert Peak, to the immediate northwest. Most precipitation runoff from the mountain drains into tributaries of the nearby Illecillewaet River, whereas the south slope drains to the Akolkolex River. Albert Peak is more notable for its steep rise above local terrain than for its absolute elevation. Topographic relief is significant as the summit rises 2,465 meters (8,087 ft) above the Illecillewaet Valley in . The peak is visible from Highway 1 (the Trans-Canada Highway) between Revelstoke and Rogers Pass. Despite being an iconic landform near the highway, it is rarely climbed because of rotten rock. The first ascent of the summit was made in 1909 by W. A. Alldritt and G. L. Haggen.
Etymology
The landform was named in 1883 by Principal Grant to honor Albert Luther Rogers (1859–1929), the nephew of Major A. B. Rogers, and his assistant while exploring this area 1881–82 for a Canadian Pacific Railway route through the Selkirk and Rocky Mountains. Albert Rogers was born June 19, 1859, in Waterville, Minnesota, and died May 16, 1929, in Waterville, Washington. He was a civil engineer, civic leader and merchant in Waterville, as well as regent for the University of Washington (1909–1913). The mountain's toponym was officially adopted September 8, 1932, by the Geographical Names Board of Canada.
Climate
Based on the Köppen climate classification, Albert Peak is located in a subarctic climate zone with cold, snowy winters, and mild summers. Winter temperatures can drop below −20 °C with wind chill factors below −30 °C. This climate supports the Albert Glacier on the northeast slope.
See also
Geography of British Columbia
References
External links
Albert Peak: Weather forecast
Three-thousanders of British Columbia
Selkirk Mountains
Columbia Country
Kootenay Land District |
Irish people in Jamaica or Irish Jamaicans, are Jamaican citizens whose ancestors originated from Ireland. If counted separately, Irish people would be the second-largest reported ethnic group in Jamaica, after Jamaicans of African ancestry. Jamaicans with Irish ancestry also have African ancestry.
Historical background
The first wave of Irish immigrants occurred in the early 17th century, Irish emigrant principally sailors, servants, and merchants. Many of the poorer emigrants were displaced Gaelic-Irish and Anglo-Irish Catholics, as well as convicts who were indentured servants. Many of the indentured servants were transported unwillingly. Of those surviving the long journey many more succumbed to disease, the harsh conditions and unfamiliar tropical conditions.
One of the first English colonies in the Caribbean was established on Barbados in 1626.
Anglo-Irish merchant families from towns like Galway, Kinsale, and Waterford established their trading networks in the Caribbean.
First contact with Jamaica
Irish-born prisoners and indentured servants were first brought to Jamaica in large numbers under the English republic of Oliver Cromwell following the capture of Jamaica from the Spanish in 1655 by William Penn and Robert Venables as part of Cromwell's strategic plan to dominate the Caribbean: the "Western Design".
In 1655 Henry Cromwell, Major-General of the Parliamentary Army in Ireland arranged for the kidnapping and enslavement of 1,000 Irish girls and 1,000 Irish young men be sent to assist in the conquest and planting of Jamaica.
In 1687 Christopher Monck, the 2nd Duke of Albemarle was appointed Lieutenant Governor of Jamaica by the Catholic King James II. His office was supported mainly by the Irish Catholic farmers and servants, an indication that the Irish were numerous, at least among the lower classes.
Later history
Migration to Jamaica continued through the 17th century, especially during the sugar boom on the sugar plantations of the West Indies, which forced many freed servants to look for land on the bigger islands like Jamaica. A Barbadian historian has estimated that of 10,000 Irish servants who left Barbados in the last quarter of the 17th century, at least half were destined for Jamaica, where land was available for small farmers. Also, it suited the British to have Irish settle near the internal frontier with the Maroons. From 1670 to 1700, Jamaica became the preferred destination for Irish and English servants departing the Atlantic ports at Kinsale, Cork, Galway and Bristol. By the late 17th century, some 10 percent of Jamaica's landowners were of Irish extraction and several, such as Teague Mackmarroe (Tadhg MacMorrough), who owned Irish indentured servants, attained the rank of "middling planter."
Later, in the mid-eighteenth century, Presbyterian colonial settlers who were fleeing Ireland arrived in the Caribbean. Scottish Gaelic speaking highlanders exiled after the Jacobite rebellions also came to the island in the 18th century.
In 1731, governor of Jamaica Robert Hunter said that the "servants and people of lower rank on the island chiefly consist of Irish Papists" who he said had "been pouring in upon us in such sholes as of late years". In the mid-18th century, Irish native names such as O'Hara and O'Connor were prominent, as well as Old English families like Talbot and Martin. Names present in 1837, recorded during the compensation hearings, include Walsh, O'Meally, O'Sullivan, Burke, Hennessy, Boyle, Tierney, Geoghagan, and Dillon.
Cultural influences
The Irish Gaelic language poet Eoghan Rua Ó Súilleabháin wrote his only English-language work in Port Royal, Jamaica while serving on a British naval vessel.
Notable Jamaicans of Irish descent
Sir Alexander Bustamante - national hero and first prime minister of Jamaica
John Edgar Colwell Hearne - novelist, journalist and teacher
Claude McKay - poet laureate
Clinton Morrison - footballer for the Republic of Ireland national team
William O'Brien, 2nd Earl of Inchiquin - military officer and colonial administrator
SPOT - rapper
Dillian Whyte - heavyweight boxer
Bromley Armstrong - black Canadian civil rights leader
Kalvin Phillips - footballer for the English national team
See also
Irish immigration to Saint Kitts and Nevis
Irish immigration to Barbados
Redlegs
List of expatriate Irish populations
Further reading
Thomas Povey's Diary, British Library, MS 12410, Folio 10
The Tide Between Us, by Olive Collins
To Hell or Barbados: The Ethnic Cleansing of Ireland, by Sean O’Callaghan, Brandon Press, IS N #9780863222870
References
Ethnic groups in Jamaica
European Jamaican
Irish Caribbean
Jamaica
+
Slavery in Jamaica
History of Jamaica |
```text
Alternative Names
0
PARAM.SFO
/*
Dynasty Warriors Gundam Reborn
*/
#
Infinite Team Points
0
games24.blog.fc2.com/blog-entry-226.html
0 002E2B44 60000000
#
Infinite Materials
0
games24.blog.fc2.com/blog-entry-226.html
0 001090CC 7D044378
#
Infinite Money
0
games24.blog.fc2.com/blog-entry-226.html
0 0032A344 90A307B8
#
Transformation Back To 0 (Synthesis)
0
games24.blog.fc2.com/blog-entry-226.html
0 00100C84 3BA00000
#
Transformation Back To 0 (Special Equipment)
0
games24.blog.fc2.com/blog-entry-226.html
0 00100580 38800000
#
30,000 Plays, Clears, + Kills
0
games24.blog.fc2.com/blog-entry-226.html
0 00108F0C 39007530
0 00108F1C 38C07530
#
AoB Infinite Team Points
0
games24.blog.fc2.com/blog-entry-226.html
B 00010000 04000000
B 7C9B2010909D003C4BFFE8857C7D0734 60000000909D003C4BFFE8857C7D0734
#
AoB Infinite Materials
0
games24.blog.fc2.com/blog-entry-226.html
B 00010000 04000000
B 7C8540105483043EB08700004E800020 7D0443785483043EB08700004E800020
#
AoB Infinite Money
0
games24.blog.fc2.com/blog-entry-226.html
B 00010000 04000000
B 908307B84E800020F821FF917C0802A6 90A307B84E800020F821FF917C0802A6
#
AoB Transformation Back To 0 (Synthesis)
0
games24.blog.fc2.com/blog-entry-226.html
B 00010000 04000000
B 4081000863A40000989F0004E80100B0 3BA0000063A40000989F0004E80100B0
#
AoB Transformation Back To 0 (Special Equipment)
0
games24.blog.fc2.com/blog-entry-226.html
B 00010000 04000000
B 408100086085000098A300044E800020 388000006085000098A300044E800020
#
AoB 30,000 Plays, Clears, & Kills
0
games24.blog.fc2.com/blog-entry-226.html
B 00010000 04000000
B 7D04182E78C6002078E7002031230008 390003E778C6002078E7002031230008
B 00010000 04000000
B 80C600047D05192E7D2307B490C70004 38C003E77D05192E7D2307B490C70004
#
``` |
İsmail Türüt (born 8 June 1965) is a Turkish male folk music artist from the Black Sea Region.
"Plan Yapmayın Plan" controversy
His 2007 album, Dünya Tatlısı, contains a song named Plans, don't make any plans (), which created a major controversy in Turkey. The lyrics take aim at Americans, Russians, Kurds, Christians, Armenians and the Turks who support them, telling them not to make plans against the Black Sea region of Turkey. The lyrics praise Alperen Hearths and Arif Şirin, the alleged killers of the Armenian-Turkish journalist Hrant Dink and end with "If a person betrays the country, he is finished off". His 2007 album, Dünya Tatlısı, contains a song named Plans, don't make any plans (), which created a major controversy in Turkey.), which created a major controversy in Turkey. The lyrics take aim at Americans, Russians, Kurds, Christians, Armenians and the Turks who support them, telling them not to make plans against the Black Sea region of Turkey. The lyrics praise AlperenOgün HearthsSamast and ArifYasin ŞirinHayal, the alleged killers of the Armenian-Turkish journalist Hrant Dink and end with "If a person betrays the country, he is finished off".
Whereas the song does not name Ogün, Yasin and Hrant Dink explicitly, a video clip posted on YouTube shows images of Ogün, Yasin, and Hrant Dink throughout the song.
YasinHakan HayalÖztekin of TrabzonÇarşamba claimed responsibility for making the video clip. He claims that he didn't have a political motive when creating the clip, but created the clip as a hobbyist.<ref name="hakan_oztekin">
Television programmes
1997-2001, 2003-2005 Türüt Show (Kanal 7)
2001-2003 Türüt Show (TGRT)
2005-2011 Türüt Show (Flash TV)
2011-2013 Türütten Türküler (Meltem TV)
2013-2015 Türüt Show (Mavi Karadeniz TV)
2005-2009 Fıkralarla Türkiye (Kanal 7)
Television series
2001-2003 Tirvana TGRT
2009-2011 N'aber Bacanak Kanal 7
Notes
External links
Official website
1965 births
Living people
Turkish folk musicians
People from Rize Province
20th-century Turkish male musicians
21st-century Turkish male musicians |
The Armstrong Whitworth A.W.38 Whitley was a British medium bomber aircraft of the 1930s. It was one of three twin-engined, front line medium bomber types that were in service with the Royal Air Force (RAF) at the outbreak of the Second World War. Alongside the Vickers Wellington and the Handley Page Hampden, the Whitley was developed during the mid-1930s according to Air Ministry Specification B.3/34, which it was subsequently selected to meet. In 1937, the Whitley formally entered into RAF squadron service; it was the first of the three medium bombers to be introduced.
Following the outbreak of war in September 1939, the Whitley participated in the first RAF bombing raid upon German territory and remained an integral part of the early British bomber offensive. In 1942 it was superseded as a bomber by the larger four-engined "heavies" such as the Avro Lancaster. Its front-line service included maritime reconnaissance with Coastal Command and the second line roles of glider-tug, trainer and transport aircraft. The type was also procured by British Overseas Airways Corporation as a civilian freighter aircraft. The aircraft was named after Whitley, a suburb of Coventry, home of Whitley plant, belonging to Armstrong Whitworth.
Development
Origins
In July 1934, the Air Ministry issued Specification B.3/34, seeking a heavy night bomber/troop transport to replace the Handley Page Heyford biplane bomber. This combination bomber/transport was part of the RAF's concept of fighting wars in distant British Empire locations, where the aircraft would fly into the theatre of action carrying troops and then provide air support.
John Lloyd, the Chief Designer of Armstrong Whitworth Aircraft, chose to respond to the specification with the AW.38 design, which later was given the name Whitley after the location of Armstrong Whitworth's main factory. The design of the AW.38 was a development of the Armstrong Whitworth AW.23 bomber-transport design that had lost to the Bristol Bombay for the earlier Specification C.26/31.
Lloyd selected the Armstrong Siddeley Tiger IX radial engine to power the Whitley, which was capable of generating . One of the novel features of the Whitley's design was the adoption of a three-bladed two-position variable-pitch propeller built by de Havilland; the Whitley was the first aircraft to fly with such an arrangement.
As Lloyd was unfamiliar with the use of flaps on a large heavy monoplane, they were initially omitted from the design. To compensate, the mid-set wings were set at a high angle of incidence (8.5°) to confer good take-off and landing performance. Flaps were included late in the design stage, the wing remained unaltered; as a result, the Whitley flew with a pronounced nose-down attitude when at cruising speed, resulting in considerable drag.
The Whitley holds the distinction of having been the first RAF aircraft with a semi-monocoque fuselage, which was built using a slab-sided structure to ease production. This replaced the tubular construction method traditionally employed by Armstrong Whitworth, who instead constructed the airframe from light-alloy rolled sections, pressings and corrugated sheets. According to aviation author Philip Moyes, the decision to adopt the semi-monocoque fuselage was a significant advance in design; many Whitleys surviving severe damage on operations.
In June 1935, owing to the urgent need to replace biplane heavy bombers then in service with the RAF, it was agreed to produce an initial 80 aircraft, 40 being of an early Whitley Mk I standard and the other 40 being more advanced Whitley Mk IIs. Production was initially at three factories in Coventry; fuselages and detailed components were fabricated at Whitley Abbey, panel-beating and much of the detailed work at the former Coventry Ordnance Works factory, while wing fabrication and final assembly took placed at Baginton Aerodrome. During 1935 and 1936, various contracts were placed for the type; the Whitley was ordered "off the drawing board" - prior to the first flights of any of the prototypes.
On 17 March 1936, the first prototype Whitley Mk I, K4586, conducted its maiden flight from Baginton Aerodrome, piloted by Armstrong Whitworth Chief Test Pilot Alan Campbell-Orde. K4586 was powered by a pair of Armstrong Siddeley Tiger IX 14-cylinder air-cooled aircraft radial engines. The second prototype, K4587, was furnished with a pair of more powerful medium-supercharged Tiger XI engines. The prototypes differed little from the initial production standard aircraft; a total of 34 production Whitley Mk I were completed.
Further development
After the first 34 aircraft had been completed, the engines were replaced with the more reliable two-speed-supercharged Tiger VIIIs. K7243, the 27th production Whitley, is believed to have served as a prototype following modifications. The resulting aircraft was designated as the Whitley Mk II. A total of 46 production aircraft were completed to the Whitley Mk II standard. One Whitley Mk II, K7243, was used as a test bed for the 21-cylinder radial Armstrong Siddeley Deerhound engine; on 6 January 1939, K7243 made its first flight with the Deerhound. Another Whitley Mk I, K7208, was modified to operate with a higher () gross weight.
K7211, the 29th production Whitley, served as the prototype for a further advanced variant of the aircraft, the Whitley Mk III. The Whitley Mk III featured numerous improvements, such as the replacement of the manually operated nose turret with a single powered Nash & Thompson turret and a powered retractable twin-gun ventral "dustbin" turret. The ventral turret was hydraulically-powered but proved to be hard to operate and added considerable drag, thus the Whitley Mk III was the only variant with it. Other changes included increased dihedral of the outer wing panels, superior navigational provision and the installation of new bomb racks. A total of 80 Whitley Mk III aircraft were manufactured.
While the Tiger VIII engine used in the Whitley Mks II and III was more reliable than those used in early aircraft, the Whitley was re-engined with Rolls-Royce Merlin engines in 1938, giving rise to the Whitley Mk IV. Three Whitley Mk I aircraft, K7208, K7209 and K7211, were initially re-engined to serve as prototypes. The new engines are credited with producing greatly improved performance. Other changes made included the replacement of the manually operated tail and retractable ventral turrets with a Nash & Thompson powered tail turret equipped with four .303 in (7.7 mm) Browning machine guns, the increasing of fuel tankage capacity, including two additional fuel tanks in the wing. A total of 40 Whitley Mk IV and Whitley Mk IVA, a sub-variant featuring more powerful models of the Merlin engine, were completed.
The decision was made to introduce a series of other minor improvements to produce the Whitley Mk V. These included the modification of the tail fins and rudders, the fitting of leading edge de-icers, further fuel capacity increases, a smaller D/F loop in a streamlined fairing being adopted, and the extension of the rear fuselage by 15 in (381 mm) to improve the rear-gunner's field of fire. The Whitley Mk V was by far the most numerous version of the aircraft, with 1,466 built until production ended in June 1943.
The Whitley Mk VII was the final variant to be built. Unlike the other variants, it was developed for service with RAF Coastal Command and was thus furnished for maritime reconnaissance rather than as a general purpose bomber. A Whitley Mk V, P3949 acted as a prototype for this variant. A total of 146 Whitley Mk VIIs were produced, additional Whitley Mk V aircraft being converted to the standard. It had a sixth crew member to operate the new ASV Mk II radar system along with an increased fuel capacity for long endurance anti-shipping missions. Some Whitley Mk VII were later converted as trainer aircraft, featuring additional seating and instrumentation for flight engineers.
Early marks of the Whitley featured bomb bay doors, fitted on the fuselage and wing bays, that were held shut by bungee cords; during bombing operations, these were opened by the weight of the bombs as they fell on them and closed again by the bungee cord. The short and unpredictable delay for the doors to open led to highly inaccurate bombing. The Mk.III introduced hydraulic doors which greatly improved bombing accuracy. To aim bombs, the bomb aimer opened a hatch in the nose of the aircraft, which extended the bomb sight out of the fuselage but the Mk IV replaced this hatch with a slightly extended transparent plexiglas panel, improving crew comfort.
Design
The Armstrong Whitworth Whitley was a twin-engined heavy bomber, initially being powered by a pair of . Armstrong Siddeley Tiger IX radial engines. More advanced models of the Tiger engine equipped some of the later variants of the Whitley; starting with the Whitley Mk IV variant, the Tigers were replaced by a pair of Rolls-Royce Merlin IV V12 engines. According to Moyes, the adoption of the Merlin engine gave the Whitley a considerable boost in performance.
The Whitley had a crew of five: a pilot, co-pilot/navigator, a bomb aimer, a wireless operator and a rear gunner. The pilot and second pilot/navigator sat side by side in the cockpit, with the wireless operator further back. The navigator, his seat mounted on rails and able to pivot, slid backwards and rotated to the left to use the chart table behind him after take-off. The bomb aimer position was in the nose with a gun turret located directly above. The fuselage aft of the wireless operator was divided horizontally by the bomb bay; behind the bomb bay was the main entrance and aft of that the rear turret. The bombs were stowed in two bomb bays housed within the fuselage, along with a further 14 smaller cells in the wing. Other sources state there were 16 "cells", two groups of two in the fuselage and four groups of three in the wings, plus two smaller cells for parachute flares in the rear fuselage. Bomb racks capable of holding larger bombs were installed on the Whitley Mk III variant.
The early examples had a nose turret and rear turret, both being manually operated with one Vickers 0.303 machine gun apiece. On the Whitley Mk III this arrangement was substantially revised: a new retractable ventral 'dustbin' position was installed mounting twin .303 in (7.7 mm) Browning machine-guns and the nose turret was also upgraded to a Nash & Thompson power-operated turret. On the Whitley Mk IV, the tail and ventral turrets were replaced with a Nash & Thompson power-operated tail turret mounting four Browning .303 machine guns; upon the adoption of this turret arrangement, the Whitley became the most powerfully armed bomber in the world against attacks from the rear.
The fuselage comprised three sections, with the main frames being riveted with the skin and the intermediate sections being riveted to the inside flanges of the longitudinal stringers. Extensive use of Alclad sheeting was made. Fuel was carried in three tanks, a pair of tanks in the leading edge of each outer wing and one tank in the roof of the fuselage, over the spar center section; two auxiliary fuel tanks could be installed in the front fuselage bomb bay compartment. The inner leading edges contained the oil tanks, which doubled as radiant oil coolers. To ease production, a deliberate effort was made to reduce component count and standardise parts. The fuselage proved to be robust enough to withstand severe damage.
The Whitley featured a large rectangular-shaped wing; its appearance led to the aircraft receiving the nickname "the flying barn door". Like the fuselage, the wings were formed from three sections, being built up around a large box spar with the leading and trailing edges being fixed onto the spar at each rib point. The forward surfaces of the wings were composed of flush-riveted, smooth and unstressed metal sheeting; the rear 2/3rds aft of the box spar to the trailing edge, as well as the ailerons and split flaps was fabric covered. The inner structure of the split flaps was composed of duralumin and ran between the ailerons and the fuselage, being set at a 15–20 degree position for taking off and at a 60 degree position during landing. The tailplanes employed a similar construction to that of the wings, the fins being braced to the fuselage using metal struts; the elevators and rudders incorporated servo-balancing trim tabs.
Operational history
Military service
On 9 March 1937, the Whitley Mk I began entering squadron service with No. 10 Squadron of the RAF, replacing their Handley Page Heyford biplanes. In January 1938, the Whitley Mk II first entered squadron service with No. 58 Squadron and in August 1938, the Whitley Mk III first entered service with No. 51 Squadron. In May 1939, the Whitley Mk IV first entered service with No. 10 Squadron and in August 1939, the Whitley Mk IVA first entered service with No. 78 Squadron. By the outbreak of the Second World War, seven squadrons were operational, the majority of these flying Whitley III or IV aircraft, while the Whitley V had only just been introduced to service; 196 Whitleys were on charge with the RAF.
At the start of the war, 4 Group, equipped with the Whitley, was the only trained night bomber force in the world. Alongside the Handley Page Hampden and the Vickers Wellington, the Whitley bore the brunt of the early fighting and saw action during the first night of the war, when they dropped propaganda leaflets over Germany. The propaganda flight made the Whitley the first aircraft of RAF Bomber Command to penetrate into Germany. Further propaganda flights would travel as far as Berlin, Prague, and Warsaw. On the night of 19/20 March 1940, in conjunction with Hampdens, the Whitley conducted the first bombing raid on German soil, attacking the Hörnum seaplane base on the Island of Sylt. Following the Hörnum raid, Whitleys routinely patrolled the Frisian Islands, targeting shipping and seaplane activity.
Unlike the Hampden and Wellington, which had met Specification B.9/32 for a day bomber, the Whitley was always intended for night operations and escaped the early heavy losses received during daylight raids carried out upon German shipping. As the oldest of the three bombers, the Whitley was obsolete by the start of the war, yet over 1,000 more aircraft were produced before a suitable replacement was found. A particular problem with the radar-equipped Mk VII, with the addition of the drag-producing aerials, was that it could not maintain altitude on one engine. Whitleys flew a total of 8,996 operations with Bomber Command, dropped 9,845 tons (8,931 tonnes) of bombs and 269 aircraft were lost in action.
On the night of 11/12 June 1940, the Whitley carried out Operation Haddock, the first RAF bombing raid on Italy, only a few hours after Italy's declaration of war; the Whitleys bombed Turin and Genoa, reaching northern Italy via a refuelling stop in the Channel Islands. Many leading World War II bomber pilots of the RAF flew Whitleys at some point in their career, including Don Bennett, James Tait, and Leonard Cheshire.
On the night of 10/11 February 1941, six Whitley Vs of 51 Squadron led by Tait took part in Operation Colossus, the first airborne operation undertaken by the British military, delivering paratroops to attack the Tragino Aqueduct in southern Italy. The Whitley was not always popular with paratroopers as they exited via a bin like chute in the floor. If this was not timed correctly the airflow would drag the paratrooper out resulting in nasty injuries to the face against the lip of the chute known as a Whitley kiss.
On the night of 29/30 April 1942 No. 58 Squadron, flying Whitleys, bombed the Port of Ostend in Belgium. This was the last operational mission by a Whitley-equipped bomber squadron. In late 1942, the Whitley was retired from service as a frontline aircraft for bomber squadrons and was shifted to other roles. The type continued to operate delivering supplies and agents in the Special Duties squadrons (138 and 161) until December 1942, as well as serving as a transport for troops and freight, a carrier for paratroopers and a tow aircraft for gliders. In 1940, the Whitley had been selected as the standard paratroop transport; in this role, the ventral turret aperture was commonly modified to be used for the egress of paratroopers. No. 100 Group RAF used Whitleys to carry radar and electronic counter-measures. In February 1942, Whitleys were used to carry the paratroopers who participated in the Bruneval raid, code named Operation Biting, in which German radar components were captured from a German base on the coast of France.
Long-range Coastal Command Mk VII variants were among the last Whitleys remaining in front-line service, remaining in service until early 1943. The first U-boat kill attributed to the Whitley Mk VII was the sinking of the on 17 July 1942, which was achieved in combination with a Lancaster heavy bomber. Having evaluated the Whitley in 1942, the Fleet Air Arm operated a number of modified ex-RAF Mk VIIs from 1944 to 1946, to train aircrew in Merlin engine management and fuel transfer procedures.
Civilian service
In April/May 1942, the British Overseas Airways Corporation (BOAC) operated 15 Whitley Mk V aircraft which had been converted into freighters. The conversion process involved the removal of all armaments, the turret recesses were faired over, additional fuel tanks were installed in the bomb bay, the interior of the fuselage was adapted for freight stowage, and at least one aircraft was fitted with an enlarged cargo door. The type was typically used for night supply flights from Gibraltar to Malta; the route took seven hours, and would often require landing during Axis air attacks on their arrival at Malta. Whitley freighters also flew the dangerous route between RAF Leuchars, Scotland and Stockholm, Sweden. The Whitley consumed a disproportionally large quantity of fuel to carry a relatively small payload and there were other reasons making the type less than ideal, so, in August 1942, the type was replaced by the Lockheed Hudson and the 14 survivors were returned to the RAF.
Variants
Following the two prototypes (K4586 and K4587), at the outbreak of the war the RAF had 207 Whitleys in service ranging from Mk I to Mk IV types, with improved versions following:
Mk I
A.W. Type 188. Powered by Armstrong Siddeley Tiger IX air-cooled radial engines, 4 degrees of dihedral incorporated into each outer wing panel, with earlier aircraft being retrospectively modified: 34 built.
Mk II
A.W. Type 197 (some Type 220). Powered by two-speed supercharged Tiger VIII engines: 46 built.
Mk III
A.W. Type 205. Powered by Tiger VIII engines, retractable "dustbin" ventral turret fitted aft of the wing root armed with two .303 in (7.7 mm) machine guns, hydraulically operated bomb bay doors and ability to carry larger bombs: 80 built.
Mk IV
A.W. Type 209. Powered by Rolls-Royce Merlin IV inline liquid-cooled engines, increased fuel capacity, extended bomb-aimer's transparency, manually operated tail and retractable ventral turrets replaced with a single Nash & Thompson powered tail turret equipped with four .303 in (7.7 mm) Browning machine guns, produced from 1938: 33 built.
Mk IVA
A.W. Type 210. Mk IV variant powered by Merlin X engines made by fitting Merlin X engines on last Mk IV's on production line: seven built.
Mk V
A.W. Type 207. The main wartime production version based on the Mk IV, modified straight-edged fins, leading edge de-icing, tail fuselage aft or empennage extended by 15 in (381 mm) to improve the tail gunner's field of fire. First flew in December 1938, production ceased in June 1943: 1,466 built.
Mk VI
Proposed Pratt & Whitney G.R.1830 Twin Wasp-powered version of Mk V in case of Merlin production shortfall: none built.
Mk VII
A.W. Type 217. Designed for service with Coastal Command and carried a sixth crew member, capable of longer-range flights (2,300 mi/3,700 km compared to the early version's 1,250 mi/2,011 km) having additional fuel tanks fitted in the bomb bay and fuselage, equipped with Air to Surface Vessel (ASV) radar for anti-shipping patrols with an additional four 'stickleback' dorsal radar masts and other antennae: 146 built. Being heavier and less efficient with its aerials, this Mk could not maintain altitude on only one engine.
Operators
Military operators
Royal Air Force
No. 7 Squadron RAF between March 1938 and May 1939.
No. 10 Squadron RAF between March 1937 and December 1941.
No. 51 Squadron RAF between February 1938 and October 1942.
No. 53 Squadron RAF between February 1943 and May 1943.
No. 58 Squadron RAF between October 1937 and January 1943.
No. 76 Squadron RAF between September 1939 and April 1940.
No. 77 Squadron RAF between November 1938 and October 1942.
No. 78 Squadron RAF between July 1937 and March 1942.
No. 97 Squadron RAF between February 1939 and May 1940.
No. 102 Squadron RAF between October 1938 and February 1942.
No. 103 Squadron RAF between October 1940 and June 1942.
No. 109 Squadron RAF operated only one aircraft (P5047).
No. 115 Squadron RAF during 1938
No. 138 Squadron RAF between August 1941 and October 1942.
No. 161 Squadron RAF between February 1942 and December 1942.
No. 166 Squadron RAF between July 1938 and April 1940.
No. 295 Squadron RAF between August 1942 and November 1943.
No. 296 Squadron RAF between June 1943 and March 1943.
No. 297 Squadron RAF between February 1942 and February 1944.
No. 298 Squadron RAF between August 1942 and October 1942.
No. 299 Squadron RAF between November 1943 and January 1944.
No. 502 Squadron RAF between October 1940 and February 1943.
No. 612 Squadron RAF between November 1940 and June 1943.
No. 619 Squadron RAF between April 1943 and January 1944.
No. 1419 Flight RAF
No. 1473 Flight RAF
No. 1478 Flight RAF
No. 1481 Flight RAF
No. 1484 Flight RAF
No. 1485 Flight RAF
No. 1486 Flight RAF
No. 1 (Coastal) Operational Training Unit RAF
No. 10 Operational Training Unit RAF
No. 81 Operational Training Unit RAF
No. 19 Operational Training Unit RAF
No. 24 Operational Training Unit RAF
No. 29 Operational Training Unit RAF
No. 58 Operational Training Unit RAF
No. 81 Operational Training Unit RAF
No. 83 Operational Training Unit RAF
Parachute Training School
Parachute Section, 13 Maintenance Unit
Fleet Air Arm
734 Naval Air Squadron operated Whitleys between February 1944 and February 1946.
Civil operators
British Overseas Airways Corporation
Surviving aircraft
No complete aircraft of the 1,814 Whitleys produced remains. The Whitley Project is rebuilding an example from salvaged remains, and a fuselage section is displayed at the Midland Air Museum (MAM), whose site is adjacent to the airfield from where the Whitley's maiden flight took place.
Specifications (Whitley Mk V)
See also
References
Notes
Bibliography
"A Modern Heavy Bomber." Flight, 21 October 1937, pp. 396–402.
Cheshire, Leonard. Leonard Cheshire V.C. Bomber Pilot. St. Albans, Herts, UK: Mayflower, 1975 (reprint of 1943 edition). .
Donald, David and Jon Lake. Encyclopedia of World Military Aircraft. London: AIRtime Publishing, 1996. .
Green, William. Famous Bombers of the Second World War. London: Macdonald and Jane's, 1959, (third revised edition 1975). .
Green, William and Gordon Swanborough. "Armstrong Whitworth's Willing Whitley" Air Enthusiast. No. 9, February–May 1979. Bromley, Kent, UK., pp. 10–25.
Green, William and Gordon Swanborough. WW2 Aircraft Fact Files: RAF Bombers, Part 1. London: Macdonald and Jane's, 1979. .
Jackson, A. J. British Civil Aircraft since 1919 (Volume 1). London: Putnam & Company Ltd., 1973. .
Mason, Francis K. The British Bomber since 1914. London: Putnam Aeronautical Books, 1994. .
Moyes, Philip J. R. The Armstrong Whitworth Whitley. Leatherhead, Surrey, UK: Profile Publications, 1967.
Thetford, Owen. Aircraft of the Royal Aircraft, 1918–57. London: Putnam & Company Ltd., 1957.
Turner-Hughes, Charles. "Armstrong Whitworth's Willing Whitley". Air Enthusiast, No. 9, February–May 1979, pp. 10–25. .
Wixey, Ken. Armstrong Whitworth Whitley (Warpaint Series No. 21). Denbigh East, Bletchley, UK: Hall Park Books, 1999.
External links
The Whitley Project
Flight cutaway of Whitley
Machine Gun Skeet August 1940 Popular Mechanics
Whitley
1930s British bomber aircraft
World War II British bombers
Glider tugs
Twin piston-engined tractor aircraft
Mid-wing aircraft
Aircraft first flown in 1936 |
Diehr is a surname. Notable people with this name include:
James R. Diehr, inventor, plaintiff in legal case Diamond v. Diehr
(born 1947), German badminton player
Paula Diehr, American biostatistician
Wolfgang Diehr, science fiction novelist, author of Fuzzy Ergo Sum |
Thomas David Allan (born 23 September 1999) is an English professional footballer who plays as a forward for Gateshead on loan at Spennymoor Town
Newcastle loaned Allan to Accrington Stanley during the first part of the 2020–21 season, and then to Greenock Morton in August 2021, but was recalled in January 2022. He Joined Gateshead in June </ref> |url=https://gateshead-fc.com/tom-allan-signs/ |publisher=Gateshead F.C |access-date=16th June 2022}}</ref> scoring on his 2nd game against Notts County with the game finishing 1-1. Then in September 2022 he joined Spennymoor Town on loan in a deal due to run to the New Year. Allan scored his first goal for the moors against Brackley Town resulting in a 2-1 Defeat.
Career statistics
Club
References
1999 births
Living people
Footballers from Newcastle upon Tyne
English men's footballers
Newcastle United F.C. players
Accrington Stanley F.C. players
Greenock Morton F.C. players
Gateshead F.C. players
Men's association football forwards
English Football League players |
Rudolph E. Abel (May 30, 1902 – December 31, 1974) was an American film and television producer.
Selected filmography
The Girl Who Dared (1944)
Girls of the Big House (1945)
A Sporting Chance (1945)
The Fatal Witness (1945)
References
Bibliography
Len D. Martin. The Republic Pictures Checklist: Features, Serials, Cartoons, Short Subjects and Training Films of Republic Pictures Corporation, 1935-1959. McFarland, 1998.
External links
1902 births
1974 deaths
Film producers from California
People from Colusa County, California
20th-century American businesspeople |
is a former Japanese football player.
Playing career
Kawamura was born in Yaizu on December 1, 1980. After graduating from high school, he joined the J2 League club Consadole Sapporo in 1999. Although he played for two seasons, he was not in many matches. In 2001, he moved to Mito HollyHock on loan. He became a regular player and played often as offensive midfielder. In 2002, he moved to Avispa Fukuoka on loan. However he did not play much. In 2003, he returned to Consadole Sapporo, but he rarely played in a match. In 2004, he played for the Regional Leagues club Okinawa Kariyushi FC (2004) and Shizuoka FC (2005-07). He retired at the end of the 2007 season.
Club statistics
References
External links
1980 births
Living people
Association football people from Shizuoka Prefecture
Japanese men's footballers
J2 League players
Hokkaido Consadole Sapporo players
Mito HollyHock players
Avispa Fukuoka players
Men's association football midfielders |
Mabamba Bay is a wetland on the edge of Lake Victoria, northwest of the Entebbe peninsula.
Conservation
Mabamba is one of Uganda's 33 Important Bird Areas and since 2006 a Ramsar-listed wetland of international importance. Key protected bird species in Mabamba are the shoebill, the blue swallow and the papyrus gonolek.
References
Ramsar sites in Uganda
Important Bird Areas of Uganda |
Oorgu is a village in Viljandi Parish, Viljandi County in Estonia.
References
Villages in Viljandi County |
```objective-c
/**
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree. An additional grant
* of patent rights can be found in the PATENTS file in the same directory.
*/
#import "AppDelegate.h"
#import "RCTBundleURLProvider.h"
#import "RCTRootView.h"
@implementation AppDelegate
- (BOOL)application:(UIApplication *)application didFinishLaunchingWithOptions:(NSDictionary *)launchOptions
{
NSURL *jsCodeLocation;
jsCodeLocation = [[RCTBundleURLProvider sharedSettings] jsBundleURLForBundleRoot:@"index.ios" fallbackResource:nil];
RCTRootView *rootView = [[RCTRootView alloc] initWithBundleURL:jsCodeLocation
moduleName:@"ShopReactNative"
initialProperties:nil
launchOptions:launchOptions];
rootView.backgroundColor = [[UIColor alloc] initWithRed:1.0f green:1.0f blue:1.0f alpha:1];
self.window = [[UIWindow alloc] initWithFrame:[UIScreen mainScreen].bounds];
UIViewController *rootViewController = [UIViewController new];
rootViewController.view = rootView;
self.window.rootViewController = rootViewController;
[self.window makeKeyAndVisible];
return YES;
}
@end
``` |
Gizab (Pashto/) is the capital of the Gizab District of Daykundi Province, Afghanistan. It is located along the Helmand River.
History
Gizab was transferred in 2004 from Uruzgan Province to Daykundi Province, and then re-annexed to Uruzgan Province in 2006. Later, it was transferred to Daykundi Province now with New Government it transferred back to Uruzgan.
Climate
With an influence from the local steppe climate, Gizab features a continental semi-arid (BSk) under the Köppen climate classification. The average temperature in Gizab is 13.3 °C, while the annual precipitation averages 453 mm.
July is the hottest month of the year with an average temperature of 27.8 °C. The coldest month January has an average temperature of -3.6 °C.
See also
Daykundi Province
Loy Kandahar
References
Populated places in Daykundi Province |
The Palazzo delle Esposizioni is a neoclassical exhibition hall, cultural center and museum on Via Nazionale in Rome, Italy.
History
Designed by Pio Piacentini, it opened in 1883. It has housed several exhibitions (e.g. Mostra della Rivoluzione Fascista, Mostra Augustea della Romanità), but was temporarily modified during the Fascist era due to its style being thought to be out of step with the times.
The building is owned by the City of Rome and the gallery is administered by Azienda Speciale Palaexpo, an agency run by the City's Office for Education and Culture.
Für
Cinema
It incorporates a 139-seat cinema, a 90-seat auditorium, a café, a large, 240-place restaurant, a library and a multi-functional room known as the Forum.
Main exhibitions
Esposizione delle Belle Arti del 1883.
Exhibition on Garibaldi (1932)
Mostra della Rivoluzione Fascista (1932–1934)
(1937)
Il socialismo è una malattia , Exhibition of the Competition of the Italian Federation of Artists and Professionals, FISAP - celebrating the Hungarian uprising against Communist Soviet Union (May, 1957)
Quadriennale di Roma (1st - 4th, 6th - 10th, 12th, 13th and 15th)
Notes and references
External links
Official Palazzo delle Esposizioni website
Buildings and structures in Rome
Art museums and galleries in Rome
Museums in Rome
Convention centers in Italy
Esposizioni
Cultural infrastructure completed in 1883
Rome R. I Monti
Contemporary art galleries in Italy |
```scss
@media (max-width: 768px) {
.navbar-toggle {
position:absolute;
z-index: 9999;
left:0px;
top:0px;
}
.navbar a.navbar-brand {
display: block;
margin: 0 auto 0 auto;
width: 148px;
height: 50px;
float: none;
background: url("../images/spring-logo-dataflow-mobile.png") 0 center no-repeat;
}
.homepage-billboard .homepage-subtitle {
font-size: 21px;
line-height: 21px;
}
.navbar a.navbar-brand span {
display: none;
}
.navbar {
border-top-width: 0;
}
.xd-container {
margin-top: 20px;
margin-bottom: 30px;
}
.index-page--subtitle {
margin-top: 10px;
margin-bottom: 30px;
}
}
``` |
```xml
/*
* MTCore.mm
*
*/
#include "MTCore.h"
#include <string>
#include <stdexcept>
namespace LLGL
{
void MTThrowIfFailed(NSError* error, const char* info)
{
if (error != nullptr)
{
std::string s = info;
s += ": ";
NSString* errorMsg = [error localizedDescription];
s += [errorMsg cStringUsingEncoding:NSUTF8StringEncoding];
throw std::runtime_error(s);
}
}
void MTThrowIfCreateFailed(NSError* error, const char* interfaceName, const char* contextInfo)
{
if (error != nullptr)
{
std::string s;
{
s = "failed to create instance of <";
s += interfaceName;
s += '>';
if (contextInfo != nullptr)
{
s += ' ';
s += contextInfo;
}
}
MTThrowIfFailed(error, s.c_str());
}
}
BOOL MTBoolean(bool value)
{
return (value ? YES : NO);
}
} // /namespace LLGL
// ================================================================================
``` |
Samuktala Sidhu Kanhu College, established in 2010, is the government aided degree college in Samuktala, Alipurduar district. It offers undergraduate courses in arts. It is affiliated to University of North Bengal.
See also
References
External links
Samuktala Sidhu Kanhu College
University of North Bengal
University Grants Commission
National Assessment and Accreditation Council
Universities and colleges in Alipurduar district
Colleges affiliated to University of North Bengal
Educational institutions established in 2010
2010 establishments in West Bengal |
Lalit Suri was an Indian politician. He was a Member of Parliament, representing Uttar Pradesh in the Rajya Sabha the upper house of India's Parliament as an Independent politician.
Being the Chairman of the Bharat Hotels chain now known as LaLiT, he was the single-largest hotel owner owning around 1600 rooms. His hotel chain encompasses seven hotels including the flagship InterContinental The Grand in Delhi along with other six Grand hotels in Mumbai, Goa, Bangalore, Srinagar, Udaipur and Khajuraho.
He died at the age of 59 on October 10, 2006, in London.
References
Rajya Sabha members from Uttar Pradesh
Independent politicians in India
1947 births
2006 deaths |
N.Peal is a British cashmere knitwear and accessories brand founded in London by Nat Peal in 1936. After the brand's decline and "substantial losses" through the 1990s and early 2000s, the original company ceased operations in 2006, and then-owner Chuck Feeney sold its component parts. The N. Peal name was purchased by Adam Holdsworth, who operates it with a Head Office in Beamsley, North Yorkshire, a design team in London, and vertically integrated production “from goat to garment” in Mongolia and China.
History
1936–1945 – The Beginning
The first N.Peal store was opened as a men's haberdashery in London's Burlington Arcade in Mayfair by businessman Nat Peal in March 1936. Peal's real name was Leapman; the first part of his name was transposed to sound more traditionally ‘British’.
When World War II broke out in 1939, Peal was stationed in the Shetland Islands. During this time he supplied his store with sweaters woven directly from the wool of Shetland sheep. As wool was being rationed during wartime, Peal was able to harness the demand for knitwear in Britain.
1945–1950s – After the War
When peacetime was restored, Peal returned to London and reinstated cashmere wool as the principal material in his knitwear. Peal began to make annual trips to New York and Boston to grow his business in the United States of America.
1980s-2006
By the mid-1980s, the N. Peal company had been acquired by wealthy businessman and philanthropist Chuck Feeney. In 1990, it opened a factory in a historic Hawick building, but the brand's declining fortunes lead to its closure in 2006. The building has remained abandoned since; it was C-listed by Historic Environment Scotland in 2007 and has been considered "at risk" since 2011.
2007 – Change of Ownership
Ilkley businessman Adam Holdsworth purchased the N.Peal brand from Feeney in 2007. At the time, Managing Director Holdsworth had little experience in luxury retail, but more than 25 years of experience in cashmere manufacture. Rather than restart the Hawick factory, Holdsworth began production in Mongolia and China, citing improved transparency and control over the supply chain, and increased value to customers. By the next year, he was able to renovate, reopen, and expand the Burlington Arcade store, retaining some original staff.
2010s - Revitalization, Expansion, and Association With James Bond
The N.Peal flagship store in Burlington Arcade received a full refurbishment in 2013, with a concept taken from the clean refinement of those original Deco years where the greens were minty and the typography was curved. The result was a store that echoed the early days but also felt appropriately modern. N.Peal opened its first US store in 2018, on Madison Avenue in New York City.
Movie stylists selected a "lapis blue" N. Peal sweater for Daniel Craig to wear as James Bond in the 2012 film Skyfall. The association continued with custom-designed pieces for Spectre and No Time to Die. Posters (and for a time, billboards) for Spectre featured Bond wearing Peal sweaters.
Stores
N.Peal has five stores in London: the flagship store in the Burlington Arcade since 1936, and others that are located in Knightsbridge, Covent Garden, Brook Street, and St. James Piccadilly. It also maintains a store on Madison Avenue, in New York City. The N.Peal Head Office is in Beamsley, North Yorkshire.
References
1936 establishments in England
Knitwear manufacturers
Clothing brands of the United Kingdom
Clothing companies based in London |
The Cian Formation is a geologic formation in France. It preserves fossils dating back to the Permian period.
See also
List of fossiliferous stratigraphic units in France
References
Permian France |
Are You Smarter than a 10 Year Old? may refer to:
Are You Smarter than a 10 Year Old? (British game show)
Are You Smarter than a 10 Year Old? (New Zealand game show)
See also
Are You Smarter than a 5th Grader?, game show franchise |
Crawfish Key is an island in the Florida Keys in Monroe County, Florida, United States. It is within the boundaries of the Key West National Wildlife Refuge.
Located in the Outlying Islands of the Florida Keys, it is in the eastern Mule Keys that are 9 miles (15 km) west of Key West.
References
Islands of the Florida Keys
Islands of Monroe County, Florida
Islands of Florida |
Mayday, known as Air Crash Investigation(s) outside of the United States and Canada and also known as Mayday: Air Disaster (The Weather Channel) or Air Disasters (Smithsonian Channel) in the United States, is a Canadian documentary television series produced by Cineflix that recounts air crashes, near-crashes, fires, hijackings, bombings, and other mainly flight-related disasters and crises. It reveals the events that led to each crisis or disaster, their causes as determined by the official investigating body or bodies, and the measures they recommended to prevent a similar incident from happening again. The programs use re-enactments, interviews, eyewitness testimony, computer-generated imagery, cockpit voice recordings, and official reports to reconstruct the sequences of events.
This includes five Science of Disaster specials, each examining multiple crashes with similar causes. For broadcasters that do not use the series name Mayday, three Season 3 episodes were labelled as Crash Scene Investigation spin-offs, examining marine or rail disasters.
A sub-series labelled The Accident Files begain airing in 2018 and, as of 2023, has aired five seasons consisting of ten episodes per series. This sub-series consists entirely of summarised versions of air disasters previously investigated in the primary Mayday series, but combined based on similarities between the incidents, such as fires or pilot error. Each episode covers three accidents and 15 minutes is dedicated to each of the disasters that are covered.
Series overview
Episodes
Note: Episodes are ordered by their production number, not by their original air date.
Season 1 (2003)
Season 2 (2005)
Season 3 (2005)
Note: This is the first season produced in high definition.
Season 4 (2007)
Season 5 (2008)
Season 6 (2007–08) Special
Season 6 of Mayday is the first Science of Disaster season, consisting of three episodes. With the exception of BOAC Flight 781, all the incidents described in these episodes are summarised versions taken from their respective full episodes from the previous five seasons.
Season 7 (2009)
Season 8 (2009) Special
Season 8 of Mayday is the second Science of Disaster season, consisting of two episodes.
Season 9 (2010)
Season 10 (2011)
Season 11 (2011–12)
Season 12 (2012–13)
Season 13 (2013–14)
Season 14 (2015)
Season 15 (2016)
Season 16 (2016–17)
Season 17 (2017)
Season 18 (2018)
Season 19 (2019)
Season 20 (2020)
Season 21 (2021)
Season 22 (2022)
Season 23 (2023)
Season 24 (2024)
The Accident Files
Season 1 (2018)
Season 2 (2019)
Season 3 (2020)
Season 4 (2021)
Season 5 (2022)
Alternate titles
The following table lists the alternative titles used by broadcasters for Mayday, the original Canadian series; Air Crash Investigation, the British and Asia-Pacific (National Geographic Channel) versions; and Air Emergency and Air Disasters (Smithsonian Channel), the American versions of the series. The American column also shows the Smithsonian Channel's season and episode numbers. Episodes are ordered by their production number, and special episodes and spin-offs are italicised.
See also
Blueprint for Disaster
Seconds From Disaster
Seismic Seconds
Survival in the Sky, known as Black Box in the UK
Why Planes Crash
Zero Hour
Notes
References
External links
Cineflix: Mayday
Cineflix: Mayday – Science of Disaster (Archive)
Mayday on Discovery Channel Canada
Air Crash Investigation on National Geographic Channel UK
Air Crash Investigation on National Geographic Channel Australia
Air Disasters on Smithsonian Channel
Lists of Canadian television series episodes
Lists of non-fiction television series episodes |
Sétimo Sentido is a Brazilian telenovela produced and broadcast by TV Globo. It premiered on 29 March 1982 and ended on 8 October 1982, with a total of 167 episodes. It's the twenty eighth "novela das oito" to be aired on the timeslot. It is created and written by Janete Clair and directed by Roberto Talma.
Cast
Regina Duarte - Luana Camará/Priscilla Capricce
Francisco Cuoco - Sebastião Bento (Tião Bento)
Eva Todor - Maria Santa Bergman Rivoredo (Santinha Rivoredo)
Carlos Alberto Riccelli - Rodolfo Bergman Rivoredo (Rudy)
Cláudio Cavalcanti - Danilo Mendes
Natália do Vale - Sandra Bergman Rivoredo
Tamara Taxman - Gisela Rezende (Gisa)
Fernando Torres - Harold Bergman
Armando Bógus - Valério
Beth Goulart - Helenice
Paulo Guarnieri - Antônio Bergman Rivoredo (Tony)
Nicette Bruno - Sara Mendes
Sebastião Vasconcellos - Elísio Mendes
Ênio Santos - Tomás Rezende
Heloísa Helena - Augusta
Ruth de Souza - Jerusa
Adriano Reys - Renard
Lisa Vieira - Érika Rezende
Otávio Augusto - Jorge
Myriam Pérsia - Mapy Hilder
Edwin Luisi - Rubens
Jonas Bloch - Jaime
Jacqueline Laurence - Célia
Miriam Pires - Carolina
Edney Giovenazzi - Sampaio
Maria Della Costa - Juliana
Jacyra Silva - Pérola
Lajar Muzuris - Domingos
Irma Alvarez - Vanda
Reinaldo Gonzaga - Gilson Pratini
Sônia Clara - Diana Bergman
Terezinha Sodré - Rita
Fernando Eiras - Henrique Bergman
Neuza Caribé - Uiara
Tânia Boscoli - Alba Rezende
David Pinheiro - Padre Gustavo
Monique Alves - Rosinha
Patrícia Phebo - Cristina
Cássia Foureaux - Ângela
Nilson Acioly - Kico
Izabella Bicalho - Cila
References
External links
TV Globo telenovelas
1982 telenovelas
1982 Brazilian television series debuts
1982 Brazilian television series endings
Portuguese-language telenovelas
Telenovelas about spiritism |
Aleksander Kakowski (; 5 February 1862 – 30 December 1938) was a Polish politician, diplomat, a member of the Regency Council and, as Cardinal and Archbishop of Warsaw, the last titular Primate of the Kingdom of Poland before Poland fully regained its independence in 1918.
Early life
He was born on 5 February 1862 in Dębiny near Przasnysz, the son of Franciszek Kakowski and Paulina Ossowska. He was ordained a priest on 30 May 1886 in Warsaw, by Cardinal Wincenty Chościak-Popiel. The following year he became one of the professors at the Warsaw Theological Seminary. In 1910 he became Rector of the Saint Petersburg Roman Catholic Theological Academy, and on 22 July 1913 he was ordained a bishop by Stanisław Zdzitowiecki. On 14 September 1913 he became the archbishop of Warsaw in St. John's Cathedral, thus becoming the titular primate of the Kingdom of Poland.
World War I and the Regency Council
After the outbreak of World War I, he remained in Warsaw and in 1917, he was appointed to be a member of the Regency Council, a semi-independent and temporary highest authority of the Kingdom of Poland, recreated by the Central Powers as part of their Mitteleuropa plan. Kakowski was one of three members of that body, which served as a provisional head of state (hence the word "regency" in its name).
Relations with Rome
On 28 November 1919, he was the main consecrator of Achille Ratti, the papal nuncio to Poland who later became Pope Pius XI. On 15 December, Kakowski himself was made a cardinal. During his service as the Archbishop of Warsaw, Kakowski promoted the creation of a strong Catholic press. He was one of the authors of the success of Rycerz Niepokalanej, one of the most popular newspapers in prewar Poland. He was also the main creator of the theological faculty at the Warsaw University and of the Catholic Action movement. For his role in liberating Poland from foreign occupation, he was awarded the Order of the White Eagle, the highest Polish decoration, in 1925; in July 1938, he even briefly appeared as the head of that order's chapter. In 1930, he also became a "bailiff of honour and devotion" of the Order of St John of Jerusalem. His successor, August Hlond, was to reintroduce the title of Primate of Poland after the Second World War, but Kakowski continued to style himself Primate of the Kingdom of Poland until his death, on 30 December 1938.
References
1862 births
1938 deaths
People from Przasnysz County
People from Płock Governorate
20th-century Polish cardinals
Archbishops of Warsaw
Members of the Regency Council (Poland)
Bailiffs Grand Cross of Honour and Devotion of the Sovereign Military Order of Malta
Polish anti-communists
Polish independence activists
Recipients of the Order of the White Eagle (Poland) |
Gerhard Gleich (born 23 October 1941 in Prague) is an artist and professor emeritus of the Academy of Fine Arts Vienna in Vienna, Austria.
He grew up as Gerhard Feest and later adopted the name of his second wife, the Polish-Austrian painter Joanna Gleich. A student of Albert Paris Gütersloh, he was from 1972 to 1997 an assistant of the Viennese painter and art professor Wolfgang Hollegha. Today he works in the academy's Institute for Conceptual Art with Professor Marina Grzinic.
He is the brother of Christian Feest and Johannes Feest.
Literature
Rüdiger Engerth, Über Paul Rotterdam und Gerhard Feest, in: Forum (Vienna) Nr. 160, pp. 365 seq.
References
Austrian artists
Artists from Prague
1941 births
Living people
Academic staff of the Academy of Fine Arts Vienna |
Shred-it is an information security solution provided by Stericycle Inc. Its services include document destruction, hard drive destruction, and specialty item shredding. The company is also known for its Annual Data Protection Report commissioned with Ipsos, a yearly survey of small business owners, C-level executives and consumers focusing on data protection and information security.
History
Greg Brophy founded Shred-it in 1988 and incorporated the company in 1989. In 1993, Brophy expanded the business by launching a manufacturing division called Securit Manufacturing Solutions "SMS". Today, SMS manufactures security consoles and specialty shredding trucks for all Shred-it's branches. It also sells industrial shredding equipment to other secure information destruction businesses.
In 2014, Shred-it merged with Cintas Document Shredding, which now operates under the Shred-it name.
In 2015, Stericycle acquired Shred-it and began positioning the company as one of its many waste management and compliance services.
Secure Information Destruction Services
Document Destruction
Shred-it offers document destruction services where paper documents are shredded using industrial paper shredders. This service is offered on a one-time or on a recurring basis.
Shred-it maintains a fleet of trucks that can provide this service on-site or deliver materials to Shred-it's facilities for destruction. The trucks are prominently featured at Community Shred-it events, where Shred-it partners with organizations like Crime Stoppers, to raise awareness about identity theft and fraud, while providing a safe way to dispose of documents with confidential information. Shred-it provides a custom quote for every document destruction job and ensures all paper waste is recycled.
Hard Drive, Digital Media, and Specialty Item Destruction
Shred-it provides secure information destruction for hard drives and digital media. Deliberately damaging these devices is the only way to ensure confidential information can no longer be retrieved. Shred-it has two methods for securely destroying digital information. Shearing slices hard drives into minuscule pieces using 40,000 lbs of combined force while crushing uses 7,500 lbs of force pressure to drill irreparable holes in the hard drive, so information can never be recovered.
The company also offers specialty item shredding, which involves destruction of any item that poses a threat to a business’ reputation or security. Shred-it's specialty item services dispose of items, like uniforms to casino chips, ID badges, prototypes, pill bottles, or material with outdated branding.
References
Privately held companies of Canada
American companies established in 1988
Business services companies of the United States |
```html
<html lang="en">
<head>
<title>Optimize Options - Using the GNU Compiler Collection (GCC)</title>
<meta http-equiv="Content-Type" content="text/html">
<meta name="description" content="Using the GNU Compiler Collection (GCC)">
<meta name="generator" content="makeinfo 4.11">
<link title="Top" rel="start" href="index.html#Top">
<link rel="up" href="Invoking-GCC.html#Invoking-GCC" title="Invoking GCC">
<link rel="prev" href="Debugging-Options.html#Debugging-Options" title="Debugging Options">
<link rel="next" href="Preprocessor-Options.html#Preprocessor-Options" title="Preprocessor Options">
<link href="path_to_url" rel="generator-home" title="Texinfo Homepage">
<!--
Permission is granted to copy, distribute and/or modify this document
any later version published by the Free Software Foundation; with the
Invariant Sections being ``Funding Free Software'', the Front-Cover
Texts being (a) (see below), and with the Back-Cover Texts being (b)
(see below). A copy of the license is included in the section entitled
(a) The FSF's Front-Cover Text is:
A GNU Manual
(b) The FSF's Back-Cover Text is:
You have freedom to copy and modify this GNU Manual, like GNU
software. Copies published by the Free Software Foundation raise
funds for GNU development.-->
<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="Optimize-Options"></a>
Next: <a rel="next" accesskey="n" href="Preprocessor-Options.html#Preprocessor-Options">Preprocessor Options</a>,
Previous: <a rel="previous" accesskey="p" href="Debugging-Options.html#Debugging-Options">Debugging Options</a>,
Up: <a rel="up" accesskey="u" href="Invoking-GCC.html#Invoking-GCC">Invoking GCC</a>
<hr>
</div>
<h3 class="section">3.10 Options That Control Optimization</h3>
<p><a name="index-optimize-options-881"></a><a name="index-options_002c-optimization-882"></a>
These options control various sorts of optimizations.
<p>Without any optimization option, the compiler's goal is to reduce the
cost of compilation and to make debugging produce the expected
results. Statements are independent: if you stop the program with a
breakpoint between statements, you can then assign a new value to any
variable or change the program counter to any other statement in the
function and get exactly the results you expect from the source
code.
<p>Turning on optimization flags makes the compiler attempt to improve
the performance and/or code size at the expense of compilation time
and possibly the ability to debug the program.
<p>The compiler performs optimization based on the knowledge it has of the
program. Compiling multiple files at once to a single output file mode allows
the compiler to use information gained from all of the files when compiling
each of them.
<p>Not all optimizations are controlled directly by a flag. Only
optimizations that have a flag are listed in this section.
<p>Most optimizations are only enabled if an <samp><span class="option">-O</span></samp> level is set on
the command line. Otherwise they are disabled, even if individual
optimization flags are specified.
<p>Depending on the target and how GCC was configured, a slightly different
set of optimizations may be enabled at each <samp><span class="option">-O</span></samp> level than
those listed here. You can invoke GCC with <samp><span class="option">-Q --help=optimizers</span></samp>
to find out the exact set of optimizations that are enabled at each level.
See <a href="Overall-Options.html#Overall-Options">Overall Options</a>, for examples.
<dl>
<dt><code>-O</code><dt><code>-O1</code><dd><a name="index-O-883"></a><a name="index-O1-884"></a>Optimize. Optimizing compilation takes somewhat more time, and a lot
more memory for a large function.
<p>With <samp><span class="option">-O</span></samp>, the compiler tries to reduce code size and execution
time, without performing any optimizations that take a great deal of
compilation time.
<p><samp><span class="option">-O</span></samp> turns on the following optimization flags:
<pre class="smallexample"> -fauto-inc-dec
-fbranch-count-reg
-fcombine-stack-adjustments
-fcompare-elim
-fcprop-registers
-fdce
-fdefer-pop
-fdelayed-branch
-fdse
-fforward-propagate
-fguess-branch-probability
-fif-conversion2
-fif-conversion
-finline-functions-called-once
-fipa-pure-const
-fipa-profile
-fipa-reference
-fmerge-constants
-fmove-loop-invariants
-fshrink-wrap
-fsplit-wide-types
-ftree-bit-ccp
-ftree-ccp
-fssa-phiopt
-ftree-ch
-ftree-copy-prop
-ftree-copyrename
-ftree-dce
-ftree-dominator-opts
-ftree-dse
-ftree-forwprop
-ftree-fre
-ftree-phiprop
-ftree-sink
-ftree-slsr
-ftree-sra
-ftree-pta
-ftree-ter
-funit-at-a-time
</pre>
<p><samp><span class="option">-O</span></samp> also turns on <samp><span class="option">-fomit-frame-pointer</span></samp> on machines
where doing so does not interfere with debugging.
<br><dt><code>-O2</code><dd><a name="index-O2-885"></a>Optimize even more. GCC performs nearly all supported optimizations
that do not involve a space-speed tradeoff.
As compared to <samp><span class="option">-O</span></samp>, this option increases both compilation time
and the performance of the generated code.
<p><samp><span class="option">-O2</span></samp> turns on all optimization flags specified by <samp><span class="option">-O</span></samp>. It
also turns on the following optimization flags:
<pre class="smallexample"> -fthread-jumps
-falign-functions -falign-jumps
-falign-loops -falign-labels
-fcaller-saves
-fcrossjumping
-fcse-follow-jumps -fcse-skip-blocks
-fdelete-null-pointer-checks
-fdevirtualize -fdevirtualize-speculatively
-fexpensive-optimizations
-fgcse -fgcse-lm
-fhoist-adjacent-loads
-finline-small-functions
-findirect-inlining
-fipa-cp
-fipa-cp-alignment
-fipa-sra
-fipa-icf
-fisolate-erroneous-paths-dereference
-flra-remat
-foptimize-sibling-calls
-foptimize-strlen
-fpartial-inlining
-fpeephole2
-freorder-blocks -freorder-blocks-and-partition -freorder-functions
-frerun-cse-after-loop
-fsched-interblock -fsched-spec
-fschedule-insns -fschedule-insns2
-fstrict-aliasing -fstrict-overflow
-ftree-builtin-call-dce
-ftree-switch-conversion -ftree-tail-merge
-ftree-pre
-ftree-vrp
-fipa-ra
</pre>
<p>Please note the warning under <samp><span class="option">-fgcse</span></samp> about
invoking <samp><span class="option">-O2</span></samp> on programs that use computed gotos.
<br><dt><code>-O3</code><dd><a name="index-O3-886"></a>Optimize yet more. <samp><span class="option">-O3</span></samp> turns on all optimizations specified
by <samp><span class="option">-O2</span></samp> and also turns on the <samp><span class="option">-finline-functions</span></samp>,
<samp><span class="option">-funswitch-loops</span></samp>, <samp><span class="option">-fpredictive-commoning</span></samp>,
<samp><span class="option">-fgcse-after-reload</span></samp>, <samp><span class="option">-ftree-loop-vectorize</span></samp>,
<samp><span class="option">-ftree-loop-distribute-patterns</span></samp>,
<samp><span class="option">-ftree-slp-vectorize</span></samp>, <samp><span class="option">-fvect-cost-model</span></samp>,
<samp><span class="option">-ftree-partial-pre</span></samp> and <samp><span class="option">-fipa-cp-clone</span></samp> options.
<br><dt><code>-O0</code><dd><a name="index-O0-887"></a>Reduce compilation time and make debugging produce the expected
results. This is the default.
<br><dt><code>-Os</code><dd><a name="index-Os-888"></a>Optimize for size. <samp><span class="option">-Os</span></samp> enables all <samp><span class="option">-O2</span></samp> optimizations that
do not typically increase code size. It also performs further
optimizations designed to reduce code size.
<p><samp><span class="option">-Os</span></samp> disables the following optimization flags:
<pre class="smallexample"> -falign-functions -falign-jumps -falign-loops
-falign-labels -freorder-blocks -freorder-blocks-and-partition
-fprefetch-loop-arrays
</pre>
<br><dt><code>-Ofast</code><dd><a name="index-Ofast-889"></a>Disregard strict standards compliance. <samp><span class="option">-Ofast</span></samp> enables all
<samp><span class="option">-O3</span></samp> optimizations. It also enables optimizations that are not
valid for all standard-compliant programs.
It turns on <samp><span class="option">-ffast-math</span></samp> and the Fortran-specific
<samp><span class="option">-fno-protect-parens</span></samp> and <samp><span class="option">-fstack-arrays</span></samp>.
<br><dt><code>-Og</code><dd><a name="index-Og-890"></a>Optimize debugging experience. <samp><span class="option">-Og</span></samp> enables optimizations
that do not interfere with debugging. It should be the optimization
level of choice for the standard edit-compile-debug cycle, offering
a reasonable level of optimization while maintaining fast compilation
and a good debugging experience.
<p>If you use multiple <samp><span class="option">-O</span></samp> options, with or without level numbers,
the last such option is the one that is effective.
</dl>
<p>Options of the form <samp><span class="option">-f</span><var>flag</var></samp> specify machine-independent
flags. Most flags have both positive and negative forms; the negative
form of <samp><span class="option">-ffoo</span></samp> is <samp><span class="option">-fno-foo</span></samp>. In the table
below, only one of the forms is listed—the one you typically
use. You can figure out the other form by either removing ‘<samp><span class="samp">no-</span></samp>’
or adding it.
<p>The following options control specific optimizations. They are either
activated by <samp><span class="option">-O</span></samp> options or are related to ones that are. You
can use the following flags in the rare cases when “fine-tuning” of
optimizations to be performed is desired.
<dl>
<dt><code>-fno-defer-pop</code><dd><a name="index-fno_002ddefer_002dpop-891"></a>Always pop the arguments to each function call as soon as that function
returns. For machines that must pop arguments after a function call,
the compiler normally lets arguments accumulate on the stack for several
function calls and pops them all at once.
<p>Disabled at levels <samp><span class="option">-O</span></samp>, <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fforward-propagate</code><dd><a name="index-fforward_002dpropagate-892"></a>Perform a forward propagation pass on RTL. The pass tries to combine two
instructions and checks if the result can be simplified. If loop unrolling
is active, two passes are performed and the second is scheduled after
loop unrolling.
<p>This option is enabled by default at optimization levels <samp><span class="option">-O</span></samp>,
<samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-ffp-contract=</code><var>style</var><dd><a name="index-ffp_002dcontract-893"></a><samp><span class="option">-ffp-contract=off</span></samp> disables floating-point expression contraction.
<samp><span class="option">-ffp-contract=fast</span></samp> enables floating-point expression contraction
such as forming of fused multiply-add operations if the target has
native support for them.
<samp><span class="option">-ffp-contract=on</span></samp> enables floating-point expression contraction
if allowed by the language standard. This is currently not implemented
and treated equal to <samp><span class="option">-ffp-contract=off</span></samp>.
<p>The default is <samp><span class="option">-ffp-contract=fast</span></samp>.
<br><dt><code>-fomit-frame-pointer</code><dd><a name="index-fomit_002dframe_002dpointer-894"></a>Don't keep the frame pointer in a register for functions that
don't need one. This avoids the instructions to save, set up and
restore frame pointers; it also makes an extra register available
in many functions. <strong>It also makes debugging impossible on
some machines.</strong>
<p>On some machines, such as the VAX, this flag has no effect, because
the standard calling sequence automatically handles the frame pointer
and nothing is saved by pretending it doesn't exist. The
machine-description macro <code>FRAME_POINTER_REQUIRED</code> controls
whether a target machine supports this flag. See <a href="../gccint/Registers.html#Registers">Register Usage</a>.
<p>The default setting (when not optimizing for
size) for 32-bit GNU/Linux x86 and 32-bit Darwin x86 targets is
<samp><span class="option">-fomit-frame-pointer</span></samp>. You can configure GCC with the
<samp><span class="option">--enable-frame-pointer</span></samp> configure option to change the default.
<p>Enabled at levels <samp><span class="option">-O</span></samp>, <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-foptimize-sibling-calls</code><dd><a name="index-foptimize_002dsibling_002dcalls-895"></a>Optimize sibling and tail recursive calls.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-foptimize-strlen</code><dd><a name="index-foptimize_002dstrlen-896"></a>Optimize various standard C string functions (e.g. <code>strlen</code>,
<code>strchr</code> or <code>strcpy</code>) and
their <code>_FORTIFY_SOURCE</code> counterparts into faster alternatives.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>.
<br><dt><code>-fno-inline</code><dd><a name="index-fno_002dinline-897"></a>Do not expand any functions inline apart from those marked with
the <code>always_inline</code> attribute. This is the default when not
optimizing.
<p>Single functions can be exempted from inlining by marking them
with the <code>noinline</code> attribute.
<br><dt><code>-finline-small-functions</code><dd><a name="index-finline_002dsmall_002dfunctions-898"></a>Integrate functions into their callers when their body is smaller than expected
function call code (so overall size of program gets smaller). The compiler
heuristically decides which functions are simple enough to be worth integrating
in this way. This inlining applies to all functions, even those not declared
inline.
<p>Enabled at level <samp><span class="option">-O2</span></samp>.
<br><dt><code>-findirect-inlining</code><dd><a name="index-findirect_002dinlining-899"></a>Inline also indirect calls that are discovered to be known at compile
time thanks to previous inlining. This option has any effect only
when inlining itself is turned on by the <samp><span class="option">-finline-functions</span></samp>
or <samp><span class="option">-finline-small-functions</span></samp> options.
<p>Enabled at level <samp><span class="option">-O2</span></samp>.
<br><dt><code>-finline-functions</code><dd><a name="index-finline_002dfunctions-900"></a>Consider all functions for inlining, even if they are not declared inline.
The compiler heuristically decides which functions are worth integrating
in this way.
<p>If all calls to a given function are integrated, and the function is
declared <code>static</code>, then the function is normally not output as
assembler code in its own right.
<p>Enabled at level <samp><span class="option">-O3</span></samp>.
<br><dt><code>-finline-functions-called-once</code><dd><a name="index-finline_002dfunctions_002dcalled_002donce-901"></a>Consider all <code>static</code> functions called once for inlining into their
caller even if they are not marked <code>inline</code>. If a call to a given
function is integrated, then the function is not output as assembler code
in its own right.
<p>Enabled at levels <samp><span class="option">-O1</span></samp>, <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp> and <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fearly-inlining</code><dd><a name="index-fearly_002dinlining-902"></a>Inline functions marked by <code>always_inline</code> and functions whose body seems
smaller than the function call overhead early before doing
<samp><span class="option">-fprofile-generate</span></samp> instrumentation and real inlining pass. Doing so
makes profiling significantly cheaper and usually inlining faster on programs
having large chains of nested wrapper functions.
<p>Enabled by default.
<br><dt><code>-fipa-sra</code><dd><a name="index-fipa_002dsra-903"></a>Perform interprocedural scalar replacement of aggregates, removal of
unused parameters and replacement of parameters passed by reference
by parameters passed by value.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp> and <samp><span class="option">-Os</span></samp>.
<br><dt><code>-finline-limit=</code><var>n</var><dd><a name="index-finline_002dlimit-904"></a>By default, GCC limits the size of functions that can be inlined. This flag
allows coarse control of this limit. <var>n</var> is the size of functions that
can be inlined in number of pseudo instructions.
<p>Inlining is actually controlled by a number of parameters, which may be
specified individually by using <samp><span class="option">--param </span><var>name</var><span class="option">=</span><var>value</var></samp>.
The <samp><span class="option">-finline-limit=</span><var>n</var></samp> option sets some of these parameters
as follows:
<dl>
<dt><code>max-inline-insns-single</code><dd>is set to <var>n</var>/2.
<br><dt><code>max-inline-insns-auto</code><dd>is set to <var>n</var>/2.
</dl>
<p>See below for a documentation of the individual
parameters controlling inlining and for the defaults of these parameters.
<p><em>Note:</em> there may be no value to <samp><span class="option">-finline-limit</span></samp> that results
in default behavior.
<p><em>Note:</em> pseudo instruction represents, in this particular context, an
abstract measurement of function's size. In no way does it represent a count
of assembly instructions and as such its exact meaning might change from one
release to an another.
<br><dt><code>-fno-keep-inline-dllexport</code><dd><a name="index-fno_002dkeep_002dinline_002ddllexport-905"></a>This is a more fine-grained version of <samp><span class="option">-fkeep-inline-functions</span></samp>,
which applies only to functions that are declared using the <code>dllexport</code>
attribute or declspec (See <a href="Function-Attributes.html#Function-Attributes">Declaring Attributes of Functions</a>.)
<br><dt><code>-fkeep-inline-functions</code><dd><a name="index-fkeep_002dinline_002dfunctions-906"></a>In C, emit <code>static</code> functions that are declared <code>inline</code>
into the object file, even if the function has been inlined into all
of its callers. This switch does not affect functions using the
<code>extern inline</code> extension in GNU C90. In C++, emit any and all
inline functions into the object file.
<br><dt><code>-fkeep-static-consts</code><dd><a name="index-fkeep_002dstatic_002dconsts-907"></a>Emit variables declared <code>static const</code> when optimization isn't turned
on, even if the variables aren't referenced.
<p>GCC enables this option by default. If you want to force the compiler to
check if a variable is referenced, regardless of whether or not
optimization is turned on, use the <samp><span class="option">-fno-keep-static-consts</span></samp> option.
<br><dt><code>-fmerge-constants</code><dd><a name="index-fmerge_002dconstants-908"></a>Attempt to merge identical constants (string constants and floating-point
constants) across compilation units.
<p>This option is the default for optimized compilation if the assembler and
linker support it. Use <samp><span class="option">-fno-merge-constants</span></samp> to inhibit this
behavior.
<p>Enabled at levels <samp><span class="option">-O</span></samp>, <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fmerge-all-constants</code><dd><a name="index-fmerge_002dall_002dconstants-909"></a>Attempt to merge identical constants and identical variables.
<p>This option implies <samp><span class="option">-fmerge-constants</span></samp>. In addition to
<samp><span class="option">-fmerge-constants</span></samp> this considers e.g. even constant initialized
arrays or initialized constant variables with integral or floating-point
types. Languages like C or C++ require each variable, including multiple
instances of the same variable in recursive calls, to have distinct locations,
so using this option results in non-conforming
behavior.
<br><dt><code>-fmodulo-sched</code><dd><a name="index-fmodulo_002dsched-910"></a>Perform swing modulo scheduling immediately before the first scheduling
pass. This pass looks at innermost loops and reorders their
instructions by overlapping different iterations.
<br><dt><code>-fmodulo-sched-allow-regmoves</code><dd><a name="index-fmodulo_002dsched_002dallow_002dregmoves-911"></a>Perform more aggressive SMS-based modulo scheduling with register moves
allowed. By setting this flag certain anti-dependences edges are
deleted, which triggers the generation of reg-moves based on the
life-range analysis. This option is effective only with
<samp><span class="option">-fmodulo-sched</span></samp> enabled.
<br><dt><code>-fno-branch-count-reg</code><dd><a name="index-fno_002dbranch_002dcount_002dreg-912"></a>Do not use “decrement and branch” instructions on a count register,
but instead generate a sequence of instructions that decrement a
register, compare it against zero, then branch based upon the result.
This option is only meaningful on architectures that support such
instructions, which include x86, PowerPC, IA-64 and S/390.
<p>Enabled by default at <samp><span class="option">-O1</span></samp> and higher.
<p>The default is <samp><span class="option">-fbranch-count-reg</span></samp>.
<br><dt><code>-fno-function-cse</code><dd><a name="index-fno_002dfunction_002dcse-913"></a>Do not put function addresses in registers; make each instruction that
calls a constant function contain the function's address explicitly.
<p>This option results in less efficient code, but some strange hacks
that alter the assembler output may be confused by the optimizations
performed when this option is not used.
<p>The default is <samp><span class="option">-ffunction-cse</span></samp>
<br><dt><code>-fno-zero-initialized-in-bss</code><dd><a name="index-fno_002dzero_002dinitialized_002din_002dbss-914"></a>If the target supports a BSS section, GCC by default puts variables that
are initialized to zero into BSS. This can save space in the resulting
code.
<p>This option turns off this behavior because some programs explicitly
rely on variables going to the data section—e.g., so that the
resulting executable can find the beginning of that section and/or make
assumptions based on that.
<p>The default is <samp><span class="option">-fzero-initialized-in-bss</span></samp>.
<br><dt><code>-fthread-jumps</code><dd><a name="index-fthread_002djumps-915"></a>Perform optimizations that check to see if a jump branches to a
location where another comparison subsumed by the first is found. If
so, the first branch is redirected to either the destination of the
second branch or a point immediately following it, depending on whether
the condition is known to be true or false.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fsplit-wide-types</code><dd><a name="index-fsplit_002dwide_002dtypes-916"></a>When using a type that occupies multiple registers, such as <code>long
long</code> on a 32-bit system, split the registers apart and allocate them
independently. This normally generates better code for those types,
but may make debugging more difficult.
<p>Enabled at levels <samp><span class="option">-O</span></samp>, <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>,
<samp><span class="option">-Os</span></samp>.
<br><dt><code>-fcse-follow-jumps</code><dd><a name="index-fcse_002dfollow_002djumps-917"></a>In common subexpression elimination (CSE), scan through jump instructions
when the target of the jump is not reached by any other path. For
example, when CSE encounters an <code>if</code> statement with an
<code>else</code> clause, CSE follows the jump when the condition
tested is false.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fcse-skip-blocks</code><dd><a name="index-fcse_002dskip_002dblocks-918"></a>This is similar to <samp><span class="option">-fcse-follow-jumps</span></samp>, but causes CSE to
follow jumps that conditionally skip over blocks. When CSE
encounters a simple <code>if</code> statement with no else clause,
<samp><span class="option">-fcse-skip-blocks</span></samp> causes CSE to follow the jump around the
body of the <code>if</code>.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-frerun-cse-after-loop</code><dd><a name="index-frerun_002dcse_002dafter_002dloop-919"></a>Re-run common subexpression elimination after loop optimizations are
performed.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fgcse</code><dd><a name="index-fgcse-920"></a>Perform a global common subexpression elimination pass.
This pass also performs global constant and copy propagation.
<p><em>Note:</em> When compiling a program using computed gotos, a GCC
extension, you may get better run-time performance if you disable
the global common subexpression elimination pass by adding
<samp><span class="option">-fno-gcse</span></samp> to the command line.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fgcse-lm</code><dd><a name="index-fgcse_002dlm-921"></a>When <samp><span class="option">-fgcse-lm</span></samp> is enabled, global common subexpression elimination
attempts to move loads that are only killed by stores into themselves. This
allows a loop containing a load/store sequence to be changed to a load outside
the loop, and a copy/store within the loop.
<p>Enabled by default when <samp><span class="option">-fgcse</span></samp> is enabled.
<br><dt><code>-fgcse-sm</code><dd><a name="index-fgcse_002dsm-922"></a>When <samp><span class="option">-fgcse-sm</span></samp> is enabled, a store motion pass is run after
global common subexpression elimination. This pass attempts to move
stores out of loops. When used in conjunction with <samp><span class="option">-fgcse-lm</span></samp>,
loops containing a load/store sequence can be changed to a load before
the loop and a store after the loop.
<p>Not enabled at any optimization level.
<br><dt><code>-fgcse-las</code><dd><a name="index-fgcse_002dlas-923"></a>When <samp><span class="option">-fgcse-las</span></samp> is enabled, the global common subexpression
elimination pass eliminates redundant loads that come after stores to the
same memory location (both partial and full redundancies).
<p>Not enabled at any optimization level.
<br><dt><code>-fgcse-after-reload</code><dd><a name="index-fgcse_002dafter_002dreload-924"></a>When <samp><span class="option">-fgcse-after-reload</span></samp> is enabled, a redundant load elimination
pass is performed after reload. The purpose of this pass is to clean up
redundant spilling.
<br><dt><code>-faggressive-loop-optimizations</code><dd><a name="index-faggressive_002dloop_002doptimizations-925"></a>This option tells the loop optimizer to use language constraints to
derive bounds for the number of iterations of a loop. This assumes that
loop code does not invoke undefined behavior by for example causing signed
integer overflows or out-of-bound array accesses. The bounds for the
number of iterations of a loop are used to guide loop unrolling and peeling
and loop exit test optimizations.
This option is enabled by default.
<br><dt><code>-funsafe-loop-optimizations</code><dd><a name="index-funsafe_002dloop_002doptimizations-926"></a>This option tells the loop optimizer to assume that loop indices do not
overflow, and that loops with nontrivial exit condition are not
infinite. This enables a wider range of loop optimizations even if
the loop optimizer itself cannot prove that these assumptions are valid.
If you use <samp><span class="option">-Wunsafe-loop-optimizations</span></samp>, the compiler warns you
if it finds this kind of loop.
<br><dt><code>-fcrossjumping</code><dd><a name="index-fcrossjumping-927"></a>Perform cross-jumping transformation.
This transformation unifies equivalent code and saves code size. The
resulting code may or may not perform better than without cross-jumping.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fauto-inc-dec</code><dd><a name="index-fauto_002dinc_002ddec-928"></a>Combine increments or decrements of addresses with memory accesses.
This pass is always skipped on architectures that do not have
instructions to support this. Enabled by default at <samp><span class="option">-O</span></samp> and
higher on architectures that support this.
<br><dt><code>-fdce</code><dd><a name="index-fdce-929"></a>Perform dead code elimination (DCE) on RTL.
Enabled by default at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-fdse</code><dd><a name="index-fdse-930"></a>Perform dead store elimination (DSE) on RTL.
Enabled by default at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-fif-conversion</code><dd><a name="index-fif_002dconversion-931"></a>Attempt to transform conditional jumps into branch-less equivalents. This
includes use of conditional moves, min, max, set flags and abs instructions, and
some tricks doable by standard arithmetics. The use of conditional execution
on chips where it is available is controlled by <samp><span class="option">-fif-conversion2</span></samp>.
<p>Enabled at levels <samp><span class="option">-O</span></samp>, <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fif-conversion2</code><dd><a name="index-fif_002dconversion2-932"></a>Use conditional execution (where available) to transform conditional jumps into
branch-less equivalents.
<p>Enabled at levels <samp><span class="option">-O</span></samp>, <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fdeclone-ctor-dtor</code><dd><a name="index-fdeclone_002dctor_002ddtor-933"></a>The C++ ABI requires multiple entry points for constructors and
destructors: one for a base subobject, one for a complete object, and
one for a virtual destructor that calls operator delete afterwards.
For a hierarchy with virtual bases, the base and complete variants are
clones, which means two copies of the function. With this option, the
base and complete variants are changed to be thunks that call a common
implementation.
<p>Enabled by <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fdelete-null-pointer-checks</code><dd><a name="index-fdelete_002dnull_002dpointer_002dchecks-934"></a>Assume that programs cannot safely dereference null pointers, and that
no code or data element resides there. This enables simple constant
folding optimizations at all optimization levels. In addition, other
optimization passes in GCC use this flag to control global dataflow
analyses that eliminate useless checks for null pointers; these assume
that if a pointer is checked after it has already been dereferenced,
it cannot be null.
<p>Note however that in some environments this assumption is not true.
Use <samp><span class="option">-fno-delete-null-pointer-checks</span></samp> to disable this optimization
for programs that depend on that behavior.
<p>Some targets, especially embedded ones, disable this option at all levels.
Otherwise it is enabled at all levels: <samp><span class="option">-O0</span></samp>, <samp><span class="option">-O1</span></samp>,
<samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>. Passes that use the information
are enabled independently at different optimization levels.
<br><dt><code>-fdevirtualize</code><dd><a name="index-fdevirtualize-935"></a>Attempt to convert calls to virtual functions to direct calls. This
is done both within a procedure and interprocedurally as part of
indirect inlining (<samp><span class="option">-findirect-inlining</span></samp>) and interprocedural constant
propagation (<samp><span class="option">-fipa-cp</span></samp>).
Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fdevirtualize-speculatively</code><dd><a name="index-fdevirtualize_002dspeculatively-936"></a>Attempt to convert calls to virtual functions to speculative direct calls.
Based on the analysis of the type inheritance graph, determine for a given call
the set of likely targets. If the set is small, preferably of size 1, change
the call into a conditional deciding between direct and indirect calls. The
speculative calls enable more optimizations, such as inlining. When they seem
useless after further optimization, they are converted back into original form.
<br><dt><code>-fdevirtualize-at-ltrans</code><dd><a name="index-fdevirtualize_002dat_002dltrans-937"></a>Stream extra information needed for aggressive devirtualization when running
the link-time optimizer in local transformation mode.
This option enables more devirtualization but
significantly increases the size of streamed data. For this reason it is
disabled by default.
<br><dt><code>-fexpensive-optimizations</code><dd><a name="index-fexpensive_002doptimizations-938"></a>Perform a number of minor optimizations that are relatively expensive.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-free</code><dd><a name="index-free-939"></a>Attempt to remove redundant extension instructions. This is especially
helpful for the x86-64 architecture, which implicitly zero-extends in 64-bit
registers after writing to their lower 32-bit half.
<p>Enabled for Alpha, AArch64 and x86 at levels <samp><span class="option">-O2</span></samp>,
<samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fno-lifetime-dse</code><dd><a name="index-fno_002dlifetime_002ddse-940"></a>In C++ the value of an object is only affected by changes within its
lifetime: when the constructor begins, the object has an indeterminate
value, and any changes during the lifetime of the object are dead when
the object is destroyed. Normally dead store elimination will take
advantage of this; if your code relies on the value of the object
storage persisting beyond the lifetime of the object, you can use this
flag to disable this optimization.
<br><dt><code>-flive-range-shrinkage</code><dd><a name="index-flive_002drange_002dshrinkage-941"></a>Attempt to decrease register pressure through register live range
shrinkage. This is helpful for fast processors with small or moderate
size register sets.
<br><dt><code>-fira-algorithm=</code><var>algorithm</var><dd><a name="index-fira_002dalgorithm-942"></a>Use the specified coloring algorithm for the integrated register
allocator. The <var>algorithm</var> argument can be ‘<samp><span class="samp">priority</span></samp>’, which
specifies Chow's priority coloring, or ‘<samp><span class="samp">CB</span></samp>’, which specifies
Chaitin-Briggs coloring. Chaitin-Briggs coloring is not implemented
for all architectures, but for those targets that do support it, it is
the default because it generates better code.
<br><dt><code>-fira-region=</code><var>region</var><dd><a name="index-fira_002dregion-943"></a>Use specified regions for the integrated register allocator. The
<var>region</var> argument should be one of the following:
<dl>
<dt>‘<samp><span class="samp">all</span></samp>’<dd>Use all loops as register allocation regions.
This can give the best results for machines with a small and/or
irregular register set.
<br><dt>‘<samp><span class="samp">mixed</span></samp>’<dd>Use all loops except for loops with small register pressure
as the regions. This value usually gives
the best results in most cases and for most architectures,
and is enabled by default when compiling with optimization for speed
(<samp><span class="option">-O</span></samp>, <samp><span class="option">-O2</span></samp>, <small class="dots">...</small>).
<br><dt>‘<samp><span class="samp">one</span></samp>’<dd>Use all functions as a single region.
This typically results in the smallest code size, and is enabled by default for
<samp><span class="option">-Os</span></samp> or <samp><span class="option">-O0</span></samp>.
</dl>
<br><dt><code>-fira-hoist-pressure</code><dd><a name="index-fira_002dhoist_002dpressure-944"></a>Use IRA to evaluate register pressure in the code hoisting pass for
decisions to hoist expressions. This option usually results in smaller
code, but it can slow the compiler down.
<p>This option is enabled at level <samp><span class="option">-Os</span></samp> for all targets.
<br><dt><code>-fira-loop-pressure</code><dd><a name="index-fira_002dloop_002dpressure-945"></a>Use IRA to evaluate register pressure in loops for decisions to move
loop invariants. This option usually results in generation
of faster and smaller code on machines with large register files (>= 32
registers), but it can slow the compiler down.
<p>This option is enabled at level <samp><span class="option">-O3</span></samp> for some targets.
<br><dt><code>-fno-ira-share-save-slots</code><dd><a name="index-fno_002dira_002dshare_002dsave_002dslots-946"></a>Disable sharing of stack slots used for saving call-used hard
registers living through a call. Each hard register gets a
separate stack slot, and as a result function stack frames are
larger.
<br><dt><code>-fno-ira-share-spill-slots</code><dd><a name="index-fno_002dira_002dshare_002dspill_002dslots-947"></a>Disable sharing of stack slots allocated for pseudo-registers. Each
pseudo-register that does not get a hard register gets a separate
stack slot, and as a result function stack frames are larger.
<br><dt><code>-fira-verbose=</code><var>n</var><dd><a name="index-fira_002dverbose-948"></a>Control the verbosity of the dump file for the integrated register allocator.
The default value is 5. If the value <var>n</var> is greater or equal to 10,
the dump output is sent to stderr using the same format as <var>n</var> minus 10.
<br><dt><code>-flra-remat</code><dd><a name="index-flra_002dremat-949"></a>Enable CFG-sensitive rematerialization in LRA. Instead of loading
values of spilled pseudos, LRA tries to rematerialize (recalculate)
values if it is profitable.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fdelayed-branch</code><dd><a name="index-fdelayed_002dbranch-950"></a>If supported for the target machine, attempt to reorder instructions
to exploit instruction slots available after delayed branch
instructions.
<p>Enabled at levels <samp><span class="option">-O</span></samp>, <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fschedule-insns</code><dd><a name="index-fschedule_002dinsns-951"></a>If supported for the target machine, attempt to reorder instructions to
eliminate execution stalls due to required data being unavailable. This
helps machines that have slow floating point or memory load instructions
by allowing other instructions to be issued until the result of the load
or floating-point instruction is required.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>.
<br><dt><code>-fschedule-insns2</code><dd><a name="index-fschedule_002dinsns2-952"></a>Similar to <samp><span class="option">-fschedule-insns</span></samp>, but requests an additional pass of
instruction scheduling after register allocation has been done. This is
especially useful on machines with a relatively small number of
registers and where memory load instructions take more than one cycle.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fno-sched-interblock</code><dd><a name="index-fno_002dsched_002dinterblock-953"></a>Don't schedule instructions across basic blocks. This is normally
enabled by default when scheduling before register allocation, i.e.
with <samp><span class="option">-fschedule-insns</span></samp> or at <samp><span class="option">-O2</span></samp> or higher.
<br><dt><code>-fno-sched-spec</code><dd><a name="index-fno_002dsched_002dspec-954"></a>Don't allow speculative motion of non-load instructions. This is normally
enabled by default when scheduling before register allocation, i.e.
with <samp><span class="option">-fschedule-insns</span></samp> or at <samp><span class="option">-O2</span></samp> or higher.
<br><dt><code>-fsched-pressure</code><dd><a name="index-fsched_002dpressure-955"></a>Enable register pressure sensitive insn scheduling before register
allocation. This only makes sense when scheduling before register
allocation is enabled, i.e. with <samp><span class="option">-fschedule-insns</span></samp> or at
<samp><span class="option">-O2</span></samp> or higher. Usage of this option can improve the
generated code and decrease its size by preventing register pressure
increase above the number of available hard registers and subsequent
spills in register allocation.
<br><dt><code>-fsched-spec-load</code><dd><a name="index-fsched_002dspec_002dload-956"></a>Allow speculative motion of some load instructions. This only makes
sense when scheduling before register allocation, i.e. with
<samp><span class="option">-fschedule-insns</span></samp> or at <samp><span class="option">-O2</span></samp> or higher.
<br><dt><code>-fsched-spec-load-dangerous</code><dd><a name="index-fsched_002dspec_002dload_002ddangerous-957"></a>Allow speculative motion of more load instructions. This only makes
sense when scheduling before register allocation, i.e. with
<samp><span class="option">-fschedule-insns</span></samp> or at <samp><span class="option">-O2</span></samp> or higher.
<br><dt><code>-fsched-stalled-insns</code><dt><code>-fsched-stalled-insns=</code><var>n</var><dd><a name="index-fsched_002dstalled_002dinsns-958"></a>Define how many insns (if any) can be moved prematurely from the queue
of stalled insns into the ready list during the second scheduling pass.
<samp><span class="option">-fno-sched-stalled-insns</span></samp> means that no insns are moved
prematurely, <samp><span class="option">-fsched-stalled-insns=0</span></samp> means there is no limit
on how many queued insns can be moved prematurely.
<samp><span class="option">-fsched-stalled-insns</span></samp> without a value is equivalent to
<samp><span class="option">-fsched-stalled-insns=1</span></samp>.
<br><dt><code>-fsched-stalled-insns-dep</code><dt><code>-fsched-stalled-insns-dep=</code><var>n</var><dd><a name="index-fsched_002dstalled_002dinsns_002ddep-959"></a>Define how many insn groups (cycles) are examined for a dependency
on a stalled insn that is a candidate for premature removal from the queue
of stalled insns. This has an effect only during the second scheduling pass,
and only if <samp><span class="option">-fsched-stalled-insns</span></samp> is used.
<samp><span class="option">-fno-sched-stalled-insns-dep</span></samp> is equivalent to
<samp><span class="option">-fsched-stalled-insns-dep=0</span></samp>.
<samp><span class="option">-fsched-stalled-insns-dep</span></samp> without a value is equivalent to
<samp><span class="option">-fsched-stalled-insns-dep=1</span></samp>.
<br><dt><code>-fsched2-use-superblocks</code><dd><a name="index-fsched2_002duse_002dsuperblocks-960"></a>When scheduling after register allocation, use superblock scheduling.
This allows motion across basic block boundaries,
resulting in faster schedules. This option is experimental, as not all machine
descriptions used by GCC model the CPU closely enough to avoid unreliable
results from the algorithm.
<p>This only makes sense when scheduling after register allocation, i.e. with
<samp><span class="option">-fschedule-insns2</span></samp> or at <samp><span class="option">-O2</span></samp> or higher.
<br><dt><code>-fsched-group-heuristic</code><dd><a name="index-fsched_002dgroup_002dheuristic-961"></a>Enable the group heuristic in the scheduler. This heuristic favors
the instruction that belongs to a schedule group. This is enabled
by default when scheduling is enabled, i.e. with <samp><span class="option">-fschedule-insns</span></samp>
or <samp><span class="option">-fschedule-insns2</span></samp> or at <samp><span class="option">-O2</span></samp> or higher.
<br><dt><code>-fsched-critical-path-heuristic</code><dd><a name="index-fsched_002dcritical_002dpath_002dheuristic-962"></a>Enable the critical-path heuristic in the scheduler. This heuristic favors
instructions on the critical path. This is enabled by default when
scheduling is enabled, i.e. with <samp><span class="option">-fschedule-insns</span></samp>
or <samp><span class="option">-fschedule-insns2</span></samp> or at <samp><span class="option">-O2</span></samp> or higher.
<br><dt><code>-fsched-spec-insn-heuristic</code><dd><a name="index-fsched_002dspec_002dinsn_002dheuristic-963"></a>Enable the speculative instruction heuristic in the scheduler. This
heuristic favors speculative instructions with greater dependency weakness.
This is enabled by default when scheduling is enabled, i.e.
with <samp><span class="option">-fschedule-insns</span></samp> or <samp><span class="option">-fschedule-insns2</span></samp>
or at <samp><span class="option">-O2</span></samp> or higher.
<br><dt><code>-fsched-rank-heuristic</code><dd><a name="index-fsched_002drank_002dheuristic-964"></a>Enable the rank heuristic in the scheduler. This heuristic favors
the instruction belonging to a basic block with greater size or frequency.
This is enabled by default when scheduling is enabled, i.e.
with <samp><span class="option">-fschedule-insns</span></samp> or <samp><span class="option">-fschedule-insns2</span></samp> or
at <samp><span class="option">-O2</span></samp> or higher.
<br><dt><code>-fsched-last-insn-heuristic</code><dd><a name="index-fsched_002dlast_002dinsn_002dheuristic-965"></a>Enable the last-instruction heuristic in the scheduler. This heuristic
favors the instruction that is less dependent on the last instruction
scheduled. This is enabled by default when scheduling is enabled,
i.e. with <samp><span class="option">-fschedule-insns</span></samp> or <samp><span class="option">-fschedule-insns2</span></samp> or
at <samp><span class="option">-O2</span></samp> or higher.
<br><dt><code>-fsched-dep-count-heuristic</code><dd><a name="index-fsched_002ddep_002dcount_002dheuristic-966"></a>Enable the dependent-count heuristic in the scheduler. This heuristic
favors the instruction that has more instructions depending on it.
This is enabled by default when scheduling is enabled, i.e.
with <samp><span class="option">-fschedule-insns</span></samp> or <samp><span class="option">-fschedule-insns2</span></samp> or
at <samp><span class="option">-O2</span></samp> or higher.
<br><dt><code>-freschedule-modulo-scheduled-loops</code><dd><a name="index-freschedule_002dmodulo_002dscheduled_002dloops-967"></a>Modulo scheduling is performed before traditional scheduling. If a loop
is modulo scheduled, later scheduling passes may change its schedule.
Use this option to control that behavior.
<br><dt><code>-fselective-scheduling</code><dd><a name="index-fselective_002dscheduling-968"></a>Schedule instructions using selective scheduling algorithm. Selective
scheduling runs instead of the first scheduler pass.
<br><dt><code>-fselective-scheduling2</code><dd><a name="index-fselective_002dscheduling2-969"></a>Schedule instructions using selective scheduling algorithm. Selective
scheduling runs instead of the second scheduler pass.
<br><dt><code>-fsel-sched-pipelining</code><dd><a name="index-fsel_002dsched_002dpipelining-970"></a>Enable software pipelining of innermost loops during selective scheduling.
This option has no effect unless one of <samp><span class="option">-fselective-scheduling</span></samp> or
<samp><span class="option">-fselective-scheduling2</span></samp> is turned on.
<br><dt><code>-fsel-sched-pipelining-outer-loops</code><dd><a name="index-fsel_002dsched_002dpipelining_002douter_002dloops-971"></a>When pipelining loops during selective scheduling, also pipeline outer loops.
This option has no effect unless <samp><span class="option">-fsel-sched-pipelining</span></samp> is turned on.
<br><dt><code>-fsemantic-interposition</code><dd><a name="index-fsemantic_002dinterposition-972"></a>Some object formats, like ELF, allow interposing of symbols by the
dynamic linker.
This means that for symbols exported from the DSO, the compiler cannot perform
interprocedural propagation, inlining and other optimizations in anticipation
that the function or variable in question may change. While this feature is
useful, for example, to rewrite memory allocation functions by a debugging
implementation, it is expensive in the terms of code quality.
With <samp><span class="option">-fno-semantic-interposition</span></samp> the compiler assumes that
if interposition happens for functions the overwriting function will have
precisely the same semantics (and side effects).
Similarly if interposition happens
for variables, the constructor of the variable will be the same. The flag
has no effect for functions explicitly declared inline
(where it is never allowed for interposition to change semantics)
and for symbols explicitly declared weak.
<br><dt><code>-fshrink-wrap</code><dd><a name="index-fshrink_002dwrap-973"></a>Emit function prologues only before parts of the function that need it,
rather than at the top of the function. This flag is enabled by default at
<samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-fcaller-saves</code><dd><a name="index-fcaller_002dsaves-974"></a>Enable allocation of values to registers that are clobbered by
function calls, by emitting extra instructions to save and restore the
registers around such calls. Such allocation is done only when it
seems to result in better code.
<p>This option is always enabled by default on certain machines, usually
those which have no call-preserved registers to use instead.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fcombine-stack-adjustments</code><dd><a name="index-fcombine_002dstack_002dadjustments-975"></a>Tracks stack adjustments (pushes and pops) and stack memory references
and then tries to find ways to combine them.
<p>Enabled by default at <samp><span class="option">-O1</span></samp> and higher.
<br><dt><code>-fipa-ra</code><dd><a name="index-fipa_002dra-976"></a>Use caller save registers for allocation if those registers are not used by
any called function. In that case it is not necessary to save and restore
them around calls. This is only possible if called functions are part of
same compilation unit as current function and they are compiled before it.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fconserve-stack</code><dd><a name="index-fconserve_002dstack-977"></a>Attempt to minimize stack usage. The compiler attempts to use less
stack space, even if that makes the program slower. This option
implies setting the <samp><span class="option">large-stack-frame</span></samp> parameter to 100
and the <samp><span class="option">large-stack-frame-growth</span></samp> parameter to 400.
<br><dt><code>-ftree-reassoc</code><dd><a name="index-ftree_002dreassoc-978"></a>Perform reassociation on trees. This flag is enabled by default
at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-ftree-pre</code><dd><a name="index-ftree_002dpre-979"></a>Perform partial redundancy elimination (PRE) on trees. This flag is
enabled by default at <samp><span class="option">-O2</span></samp> and <samp><span class="option">-O3</span></samp>.
<br><dt><code>-ftree-partial-pre</code><dd><a name="index-ftree_002dpartial_002dpre-980"></a>Make partial redundancy elimination (PRE) more aggressive. This flag is
enabled by default at <samp><span class="option">-O3</span></samp>.
<br><dt><code>-ftree-forwprop</code><dd><a name="index-ftree_002dforwprop-981"></a>Perform forward propagation on trees. This flag is enabled by default
at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-ftree-fre</code><dd><a name="index-ftree_002dfre-982"></a>Perform full redundancy elimination (FRE) on trees. The difference
between FRE and PRE is that FRE only considers expressions
that are computed on all paths leading to the redundant computation.
This analysis is faster than PRE, though it exposes fewer redundancies.
This flag is enabled by default at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-ftree-phiprop</code><dd><a name="index-ftree_002dphiprop-983"></a>Perform hoisting of loads from conditional pointers on trees. This
pass is enabled by default at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-fhoist-adjacent-loads</code><dd><a name="index-fhoist_002dadjacent_002dloads-984"></a>Speculatively hoist loads from both branches of an if-then-else if the
loads are from adjacent locations in the same structure and the target
architecture has a conditional move instruction. This flag is enabled
by default at <samp><span class="option">-O2</span></samp> and higher.
<br><dt><code>-ftree-copy-prop</code><dd><a name="index-ftree_002dcopy_002dprop-985"></a>Perform copy propagation on trees. This pass eliminates unnecessary
copy operations. This flag is enabled by default at <samp><span class="option">-O</span></samp> and
higher.
<br><dt><code>-fipa-pure-const</code><dd><a name="index-fipa_002dpure_002dconst-986"></a>Discover which functions are pure or constant.
Enabled by default at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-fipa-reference</code><dd><a name="index-fipa_002dreference-987"></a>Discover which static variables do not escape the
compilation unit.
Enabled by default at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-fipa-pta</code><dd><a name="index-fipa_002dpta-988"></a>Perform interprocedural pointer analysis and interprocedural modification
and reference analysis. This option can cause excessive memory and
compile-time usage on large compilation units. It is not enabled by
default at any optimization level.
<br><dt><code>-fipa-profile</code><dd><a name="index-fipa_002dprofile-989"></a>Perform interprocedural profile propagation. The functions called only from
cold functions are marked as cold. Also functions executed once (such as
<code>cold</code>, <code>noreturn</code>, static constructors or destructors) are identified. Cold
functions and loop less parts of functions executed once are then optimized for
size.
Enabled by default at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-fipa-cp</code><dd><a name="index-fipa_002dcp-990"></a>Perform interprocedural constant propagation.
This optimization analyzes the program to determine when values passed
to functions are constants and then optimizes accordingly.
This optimization can substantially increase performance
if the application has constants passed to functions.
This flag is enabled by default at <samp><span class="option">-O2</span></samp>, <samp><span class="option">-Os</span></samp> and <samp><span class="option">-O3</span></samp>.
<br><dt><code>-fipa-cp-clone</code><dd><a name="index-fipa_002dcp_002dclone-991"></a>Perform function cloning to make interprocedural constant propagation stronger.
When enabled, interprocedural constant propagation performs function cloning
when externally visible function can be called with constant arguments.
Because this optimization can create multiple copies of functions,
it may significantly increase code size
(see <samp><span class="option">--param ipcp-unit-growth=</span><var>value</var></samp>).
This flag is enabled by default at <samp><span class="option">-O3</span></samp>.
<br><dt><code>-fipa-cp-alignment</code><dd><a name="index-g_t_002dfipa_002dcp_002dalignment-992"></a>When enabled, this optimization propagates alignment of function
parameters to support better vectorization and string operations.
<p>This flag is enabled by default at <samp><span class="option">-O2</span></samp> and <samp><span class="option">-Os</span></samp>. It
requires that <samp><span class="option">-fipa-cp</span></samp> is enabled.
<br><dt><code>-fipa-icf</code><dd><a name="index-fipa_002dicf-993"></a>Perform Identical Code Folding for functions and read-only variables.
The optimization reduces code size and may disturb unwind stacks by replacing
a function by equivalent one with a different name. The optimization works
more effectively with link time optimization enabled.
<p>Nevertheless the behavior is similar to Gold Linker ICF optimization, GCC ICF
works on different levels and thus the optimizations are not same - there are
equivalences that are found only by GCC and equivalences found only by Gold.
<p>This flag is enabled by default at <samp><span class="option">-O2</span></samp> and <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fisolate-erroneous-paths-dereference</code><dd><a name="index-fisolate_002derroneous_002dpaths_002ddereference-994"></a>Detect paths that trigger erroneous or undefined behavior due to
dereferencing a null pointer. Isolate those paths from the main control
flow and turn the statement with erroneous or undefined behavior into a trap.
This flag is enabled by default at <samp><span class="option">-O2</span></samp> and higher.
<br><dt><code>-fisolate-erroneous-paths-attribute</code><dd><a name="index-fisolate_002derroneous_002dpaths_002dattribute-995"></a>Detect paths that trigger erroneous or undefined behavior due a null value
being used in a way forbidden by a <code>returns_nonnull</code> or <code>nonnull</code>
attribute. Isolate those paths from the main control flow and turn the
statement with erroneous or undefined behavior into a trap. This is not
currently enabled, but may be enabled by <samp><span class="option">-O2</span></samp> in the future.
<br><dt><code>-ftree-sink</code><dd><a name="index-ftree_002dsink-996"></a>Perform forward store motion on trees. This flag is
enabled by default at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-ftree-bit-ccp</code><dd><a name="index-ftree_002dbit_002dccp-997"></a>Perform sparse conditional bit constant propagation on trees and propagate
pointer alignment information.
This pass only operates on local scalar variables and is enabled by default
at <samp><span class="option">-O</span></samp> and higher. It requires that <samp><span class="option">-ftree-ccp</span></samp> is enabled.
<br><dt><code>-ftree-ccp</code><dd><a name="index-ftree_002dccp-998"></a>Perform sparse conditional constant propagation (CCP) on trees. This
pass only operates on local scalar variables and is enabled by default
at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-fssa-phiopt</code><dd><a name="index-fssa_002dphiopt-999"></a>Perform pattern matching on SSA PHI nodes to optimize conditional
code. This pass is enabled by default at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-ftree-switch-conversion</code><dd><a name="index-ftree_002dswitch_002dconversion-1000"></a>Perform conversion of simple initializations in a switch to
initializations from a scalar array. This flag is enabled by default
at <samp><span class="option">-O2</span></samp> and higher.
<br><dt><code>-ftree-tail-merge</code><dd><a name="index-ftree_002dtail_002dmerge-1001"></a>Look for identical code sequences. When found, replace one with a jump to the
other. This optimization is known as tail merging or cross jumping. This flag
is enabled by default at <samp><span class="option">-O2</span></samp> and higher. The compilation time
in this pass can
be limited using <samp><span class="option">max-tail-merge-comparisons</span></samp> parameter and
<samp><span class="option">max-tail-merge-iterations</span></samp> parameter.
<br><dt><code>-ftree-dce</code><dd><a name="index-ftree_002ddce-1002"></a>Perform dead code elimination (DCE) on trees. This flag is enabled by
default at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-ftree-builtin-call-dce</code><dd><a name="index-ftree_002dbuiltin_002dcall_002ddce-1003"></a>Perform conditional dead code elimination (DCE) for calls to built-in functions
that may set <code>errno</code> but are otherwise side-effect free. This flag is
enabled by default at <samp><span class="option">-O2</span></samp> and higher if <samp><span class="option">-Os</span></samp> is not also
specified.
<br><dt><code>-ftree-dominator-opts</code><dd><a name="index-ftree_002ddominator_002dopts-1004"></a>Perform a variety of simple scalar cleanups (constant/copy
propagation, redundancy elimination, range propagation and expression
simplification) based on a dominator tree traversal. This also
performs jump threading (to reduce jumps to jumps). This flag is
enabled by default at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-ftree-dse</code><dd><a name="index-ftree_002ddse-1005"></a>Perform dead store elimination (DSE) on trees. A dead store is a store into
a memory location that is later overwritten by another store without
any intervening loads. In this case the earlier store can be deleted. This
flag is enabled by default at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-ftree-ch</code><dd><a name="index-ftree_002dch-1006"></a>Perform loop header copying on trees. This is beneficial since it increases
effectiveness of code motion optimizations. It also saves one jump. This flag
is enabled by default at <samp><span class="option">-O</span></samp> and higher. It is not enabled
for <samp><span class="option">-Os</span></samp>, since it usually increases code size.
<br><dt><code>-ftree-loop-optimize</code><dd><a name="index-ftree_002dloop_002doptimize-1007"></a>Perform loop optimizations on trees. This flag is enabled by default
at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-ftree-loop-linear</code><dd><a name="index-ftree_002dloop_002dlinear-1008"></a>Perform loop interchange transformations on tree. Same as
<samp><span class="option">-floop-interchange</span></samp>. To use this code transformation, GCC has
to be configured with <samp><span class="option">--with-isl</span></samp> to enable the Graphite loop
transformation infrastructure.
<br><dt><code>-floop-interchange</code><dd><a name="index-floop_002dinterchange-1009"></a>Perform loop interchange transformations on loops. Interchanging two
nested loops switches the inner and outer loops. For example, given a
loop like:
<pre class="smallexample"> DO J = 1, M
DO I = 1, N
A(J, I) = A(J, I) * C
ENDDO
ENDDO
</pre>
<p class="noindent">loop interchange transforms the loop as if it were written:
<pre class="smallexample"> DO I = 1, N
DO J = 1, M
A(J, I) = A(J, I) * C
ENDDO
ENDDO
</pre>
<p>which can be beneficial when <code>N</code> is larger than the caches,
because in Fortran, the elements of an array are stored in memory
contiguously by column, and the original loop iterates over rows,
potentially creating at each access a cache miss. This optimization
applies to all the languages supported by GCC and is not limited to
Fortran. To use this code transformation, GCC has to be configured
with <samp><span class="option">--with-isl</span></samp> to enable the Graphite loop transformation
infrastructure.
<br><dt><code>-floop-strip-mine</code><dd><a name="index-floop_002dstrip_002dmine-1010"></a>Perform loop strip mining transformations on loops. Strip mining
splits a loop into two nested loops. The outer loop has strides
equal to the strip size and the inner loop has strides of the
original loop within a strip. The strip length can be changed
using the <samp><span class="option">loop-block-tile-size</span></samp> parameter. For example,
given a loop like:
<pre class="smallexample"> DO I = 1, N
A(I) = A(I) + C
ENDDO
</pre>
<p class="noindent">loop strip mining transforms the loop as if it were written:
<pre class="smallexample"> DO II = 1, N, 51
DO I = II, min (II + 50, N)
A(I) = A(I) + C
ENDDO
ENDDO
</pre>
<p>This optimization applies to all the languages supported by GCC and is
not limited to Fortran. To use this code transformation, GCC has to
be configured with <samp><span class="option">--with-isl</span></samp> to enable the Graphite loop
transformation infrastructure.
<br><dt><code>-floop-block</code><dd><a name="index-floop_002dblock-1011"></a>Perform loop blocking transformations on loops. Blocking strip mines
each loop in the loop nest such that the memory accesses of the
element loops fit inside caches. The strip length can be changed
using the <samp><span class="option">loop-block-tile-size</span></samp> parameter. For example, given
a loop like:
<pre class="smallexample"> DO I = 1, N
DO J = 1, M
A(J, I) = B(I) + C(J)
ENDDO
ENDDO
</pre>
<p class="noindent">loop blocking transforms the loop as if it were written:
<pre class="smallexample"> DO II = 1, N, 51
DO JJ = 1, M, 51
DO I = II, min (II + 50, N)
DO J = JJ, min (JJ + 50, M)
A(J, I) = B(I) + C(J)
ENDDO
ENDDO
ENDDO
ENDDO
</pre>
<p>which can be beneficial when <code>M</code> is larger than the caches,
because the innermost loop iterates over a smaller amount of data
which can be kept in the caches. This optimization applies to all the
languages supported by GCC and is not limited to Fortran. To use this
code transformation, GCC has to be configured with <samp><span class="option">--with-isl</span></samp>
to enable the Graphite loop transformation infrastructure.
<br><dt><code>-fgraphite-identity</code><dd><a name="index-fgraphite_002didentity-1012"></a>Enable the identity transformation for graphite. For every SCoP we generate
the polyhedral representation and transform it back to gimple. Using
<samp><span class="option">-fgraphite-identity</span></samp> we can check the costs or benefits of the
GIMPLE -> GRAPHITE -> GIMPLE transformation. Some minimal optimizations
are also performed by the code generator ISL, like index splitting and
dead code elimination in loops.
<br><dt><code>-floop-nest-optimize</code><dd><a name="index-floop_002dnest_002doptimize-1013"></a>Enable the ISL based loop nest optimizer. This is a generic loop nest
optimizer based on the Pluto optimization algorithms. It calculates a loop
structure optimized for data-locality and parallelism. This option
is experimental.
<br><dt><code>-floop-unroll-and-jam</code><dd><a name="index-floop_002dunroll_002dand_002djam-1014"></a>Enable unroll and jam for the ISL based loop nest optimizer. The unroll
factor can be changed using the <samp><span class="option">loop-unroll-jam-size</span></samp> parameter.
The unrolled dimension (counting from the most inner one) can be changed
using the <samp><span class="option">loop-unroll-jam-depth</span></samp> parameter. .
<br><dt><code>-floop-parallelize-all</code><dd><a name="index-floop_002dparallelize_002dall-1015"></a>Use the Graphite data dependence analysis to identify loops that can
be parallelized. Parallelize all the loops that can be analyzed to
not contain loop carried dependences without checking that it is
profitable to parallelize the loops.
<br><dt><code>-fcheck-data-deps</code><dd><a name="index-fcheck_002ddata_002ddeps-1016"></a>Compare the results of several data dependence analyzers. This option
is used for debugging the data dependence analyzers.
<br><dt><code>-ftree-loop-if-convert</code><dd><a name="index-ftree_002dloop_002dif_002dconvert-1017"></a>Attempt to transform conditional jumps in the innermost loops to
branch-less equivalents. The intent is to remove control-flow from
the innermost loops in order to improve the ability of the
vectorization pass to handle these loops. This is enabled by default
if vectorization is enabled.
<br><dt><code>-ftree-loop-if-convert-stores</code><dd><a name="index-ftree_002dloop_002dif_002dconvert_002dstores-1018"></a>Attempt to also if-convert conditional jumps containing memory writes.
This transformation can be unsafe for multi-threaded programs as it
transforms conditional memory writes into unconditional memory writes.
For example,
<pre class="smallexample"> for (i = 0; i < N; i++)
if (cond)
A[i] = expr;
</pre>
<p>is transformed to
<pre class="smallexample"> for (i = 0; i < N; i++)
A[i] = cond ? expr : A[i];
</pre>
<p>potentially producing data races.
<br><dt><code>-ftree-loop-distribution</code><dd><a name="index-ftree_002dloop_002ddistribution-1019"></a>Perform loop distribution. This flag can improve cache performance on
big loop bodies and allow further loop optimizations, like
parallelization or vectorization, to take place. For example, the loop
<pre class="smallexample"> DO I = 1, N
A(I) = B(I) + C
D(I) = E(I) * F
ENDDO
</pre>
<p>is transformed to
<pre class="smallexample"> DO I = 1, N
A(I) = B(I) + C
ENDDO
DO I = 1, N
D(I) = E(I) * F
ENDDO
</pre>
<br><dt><code>-ftree-loop-distribute-patterns</code><dd><a name="index-ftree_002dloop_002ddistribute_002dpatterns-1020"></a>Perform loop distribution of patterns that can be code generated with
calls to a library. This flag is enabled by default at <samp><span class="option">-O3</span></samp>.
<p>This pass distributes the initialization loops and generates a call to
memset zero. For example, the loop
<pre class="smallexample"> DO I = 1, N
A(I) = 0
B(I) = A(I) + I
ENDDO
</pre>
<p>is transformed to
<pre class="smallexample"> DO I = 1, N
A(I) = 0
ENDDO
DO I = 1, N
B(I) = A(I) + I
ENDDO
</pre>
<p>and the initialization loop is transformed into a call to memset zero.
<br><dt><code>-ftree-loop-im</code><dd><a name="index-ftree_002dloop_002dim-1021"></a>Perform loop invariant motion on trees. This pass moves only invariants that
are hard to handle at RTL level (function calls, operations that expand to
nontrivial sequences of insns). With <samp><span class="option">-funswitch-loops</span></samp> it also moves
operands of conditions that are invariant out of the loop, so that we can use
just trivial invariantness analysis in loop unswitching. The pass also includes
store motion.
<br><dt><code>-ftree-loop-ivcanon</code><dd><a name="index-ftree_002dloop_002divcanon-1022"></a>Create a canonical counter for number of iterations in loops for which
determining number of iterations requires complicated analysis. Later
optimizations then may determine the number easily. Useful especially
in connection with unrolling.
<br><dt><code>-fivopts</code><dd><a name="index-fivopts-1023"></a>Perform induction variable optimizations (strength reduction, induction
variable merging and induction variable elimination) on trees.
<br><dt><code>-ftree-parallelize-loops=n</code><dd><a name="index-ftree_002dparallelize_002dloops-1024"></a>Parallelize loops, i.e., split their iteration space to run in n threads.
This is only possible for loops whose iterations are independent
and can be arbitrarily reordered. The optimization is only
profitable on multiprocessor machines, for loops that are CPU-intensive,
rather than constrained e.g. by memory bandwidth. This option
implies <samp><span class="option">-pthread</span></samp>, and thus is only supported on targets
that have support for <samp><span class="option">-pthread</span></samp>.
<br><dt><code>-ftree-pta</code><dd><a name="index-ftree_002dpta-1025"></a>Perform function-local points-to analysis on trees. This flag is
enabled by default at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-ftree-sra</code><dd><a name="index-ftree_002dsra-1026"></a>Perform scalar replacement of aggregates. This pass replaces structure
references with scalars to prevent committing structures to memory too
early. This flag is enabled by default at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-ftree-copyrename</code><dd><a name="index-ftree_002dcopyrename-1027"></a>Perform copy renaming on trees. This pass attempts to rename compiler
temporaries to other variables at copy locations, usually resulting in
variable names which more closely resemble the original variables. This flag
is enabled by default at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-ftree-coalesce-inlined-vars</code><dd><a name="index-ftree_002dcoalesce_002dinlined_002dvars-1028"></a>Tell the copyrename pass (see <samp><span class="option">-ftree-copyrename</span></samp>) to attempt to
combine small user-defined variables too, but only if they are inlined
from other functions. It is a more limited form of
<samp><span class="option">-ftree-coalesce-vars</span></samp>. This may harm debug information of such
inlined variables, but it keeps variables of the inlined-into
function apart from each other, such that they are more likely to
contain the expected values in a debugging session.
<br><dt><code>-ftree-coalesce-vars</code><dd><a name="index-ftree_002dcoalesce_002dvars-1029"></a>Tell the copyrename pass (see <samp><span class="option">-ftree-copyrename</span></samp>) to attempt to
combine small user-defined variables too, instead of just compiler
temporaries. This may severely limit the ability to debug an optimized
program compiled with <samp><span class="option">-fno-var-tracking-assignments</span></samp>. In the
negated form, this flag prevents SSA coalescing of user variables,
including inlined ones. This option is enabled by default.
<br><dt><code>-ftree-ter</code><dd><a name="index-ftree_002dter-1030"></a>Perform temporary expression replacement during the SSA->normal phase. Single
use/single def temporaries are replaced at their use location with their
defining expression. This results in non-GIMPLE code, but gives the expanders
much more complex trees to work on resulting in better RTL generation. This is
enabled by default at <samp><span class="option">-O</span></samp> and higher.
<br><dt><code>-ftree-slsr</code><dd><a name="index-ftree_002dslsr-1031"></a>Perform straight-line strength reduction on trees. This recognizes related
expressions involving multiplications and replaces them by less expensive
calculations when possible. This is enabled by default at <samp><span class="option">-O</span></samp> and
higher.
<br><dt><code>-ftree-vectorize</code><dd><a name="index-ftree_002dvectorize-1032"></a>Perform vectorization on trees. This flag enables <samp><span class="option">-ftree-loop-vectorize</span></samp>
and <samp><span class="option">-ftree-slp-vectorize</span></samp> if not explicitly specified.
<br><dt><code>-ftree-loop-vectorize</code><dd><a name="index-ftree_002dloop_002dvectorize-1033"></a>Perform loop vectorization on trees. This flag is enabled by default at
<samp><span class="option">-O3</span></samp> and when <samp><span class="option">-ftree-vectorize</span></samp> is enabled.
<br><dt><code>-ftree-slp-vectorize</code><dd><a name="index-ftree_002dslp_002dvectorize-1034"></a>Perform basic block vectorization on trees. This flag is enabled by default at
<samp><span class="option">-O3</span></samp> and when <samp><span class="option">-ftree-vectorize</span></samp> is enabled.
<br><dt><code>-fvect-cost-model=</code><var>model</var><dd><a name="index-fvect_002dcost_002dmodel-1035"></a>Alter the cost model used for vectorization. The <var>model</var> argument
should be one of ‘<samp><span class="samp">unlimited</span></samp>’, ‘<samp><span class="samp">dynamic</span></samp>’ or ‘<samp><span class="samp">cheap</span></samp>’.
With the ‘<samp><span class="samp">unlimited</span></samp>’ model the vectorized code-path is assumed
to be profitable while with the ‘<samp><span class="samp">dynamic</span></samp>’ model a runtime check
guards the vectorized code-path to enable it only for iteration
counts that will likely execute faster than when executing the original
scalar loop. The ‘<samp><span class="samp">cheap</span></samp>’ model disables vectorization of
loops where doing so would be cost prohibitive for example due to
required runtime checks for data dependence or alignment but otherwise
is equal to the ‘<samp><span class="samp">dynamic</span></samp>’ model.
The default cost model depends on other optimization flags and is
either ‘<samp><span class="samp">dynamic</span></samp>’ or ‘<samp><span class="samp">cheap</span></samp>’.
<br><dt><code>-fsimd-cost-model=</code><var>model</var><dd><a name="index-fsimd_002dcost_002dmodel-1036"></a>Alter the cost model used for vectorization of loops marked with the OpenMP
or Cilk Plus simd directive. The <var>model</var> argument should be one of
‘<samp><span class="samp">unlimited</span></samp>’, ‘<samp><span class="samp">dynamic</span></samp>’, ‘<samp><span class="samp">cheap</span></samp>’. All values of <var>model</var>
have the same meaning as described in <samp><span class="option">-fvect-cost-model</span></samp> and by
default a cost model defined with <samp><span class="option">-fvect-cost-model</span></samp> is used.
<br><dt><code>-ftree-vrp</code><dd><a name="index-ftree_002dvrp-1037"></a>Perform Value Range Propagation on trees. This is similar to the
constant propagation pass, but instead of values, ranges of values are
propagated. This allows the optimizers to remove unnecessary range
checks like array bound checks and null pointer checks. This is
enabled by default at <samp><span class="option">-O2</span></samp> and higher. Null pointer check
elimination is only done if <samp><span class="option">-fdelete-null-pointer-checks</span></samp> is
enabled.
<br><dt><code>-fsplit-ivs-in-unroller</code><dd><a name="index-fsplit_002divs_002din_002dunroller-1038"></a>Enables expression of values of induction variables in later iterations
of the unrolled loop using the value in the first iteration. This breaks
long dependency chains, thus improving efficiency of the scheduling passes.
<p>A combination of <samp><span class="option">-fweb</span></samp> and CSE is often sufficient to obtain the
same effect. However, that is not reliable in cases where the loop body
is more complicated than a single basic block. It also does not work at all
on some architectures due to restrictions in the CSE pass.
<p>This optimization is enabled by default.
<br><dt><code>-fvariable-expansion-in-unroller</code><dd><a name="index-fvariable_002dexpansion_002din_002dunroller-1039"></a>With this option, the compiler creates multiple copies of some
local variables when unrolling a loop, which can result in superior code.
<br><dt><code>-fpartial-inlining</code><dd><a name="index-fpartial_002dinlining-1040"></a>Inline parts of functions. This option has any effect only
when inlining itself is turned on by the <samp><span class="option">-finline-functions</span></samp>
or <samp><span class="option">-finline-small-functions</span></samp> options.
<p>Enabled at level <samp><span class="option">-O2</span></samp>.
<br><dt><code>-fpredictive-commoning</code><dd><a name="index-fpredictive_002dcommoning-1041"></a>Perform predictive commoning optimization, i.e., reusing computations
(especially memory loads and stores) performed in previous
iterations of loops.
<p>This option is enabled at level <samp><span class="option">-O3</span></samp>.
<br><dt><code>-fprefetch-loop-arrays</code><dd><a name="index-fprefetch_002dloop_002darrays-1042"></a>If supported by the target machine, generate instructions to prefetch
memory to improve the performance of loops that access large arrays.
<p>This option may generate better or worse code; results are highly
dependent on the structure of loops within the source code.
<p>Disabled at level <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fno-peephole</code><dt><code>-fno-peephole2</code><dd><a name="index-fno_002dpeephole-1043"></a><a name="index-fno_002dpeephole2-1044"></a>Disable any machine-specific peephole optimizations. The difference
between <samp><span class="option">-fno-peephole</span></samp> and <samp><span class="option">-fno-peephole2</span></samp> is in how they
are implemented in the compiler; some targets use one, some use the
other, a few use both.
<p><samp><span class="option">-fpeephole</span></samp> is enabled by default.
<samp><span class="option">-fpeephole2</span></samp> enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fno-guess-branch-probability</code><dd><a name="index-fno_002dguess_002dbranch_002dprobability-1045"></a>Do not guess branch probabilities using heuristics.
<p>GCC uses heuristics to guess branch probabilities if they are
not provided by profiling feedback (<samp><span class="option">-fprofile-arcs</span></samp>). These
heuristics are based on the control flow graph. If some branch probabilities
are specified by <code>__builtin_expect</code>, then the heuristics are
used to guess branch probabilities for the rest of the control flow graph,
taking the <code>__builtin_expect</code> info into account. The interactions
between the heuristics and <code>__builtin_expect</code> can be complex, and in
some cases, it may be useful to disable the heuristics so that the effects
of <code>__builtin_expect</code> are easier to understand.
<p>The default is <samp><span class="option">-fguess-branch-probability</span></samp> at levels
<samp><span class="option">-O</span></samp>, <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-freorder-blocks</code><dd><a name="index-freorder_002dblocks-1046"></a>Reorder basic blocks in the compiled function in order to reduce number of
taken branches and improve code locality.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>.
<br><dt><code>-freorder-blocks-and-partition</code><dd><a name="index-freorder_002dblocks_002dand_002dpartition-1047"></a>In addition to reordering basic blocks in the compiled function, in order
to reduce number of taken branches, partitions hot and cold basic blocks
into separate sections of the assembly and .o files, to improve
paging and cache locality performance.
<p>This optimization is automatically turned off in the presence of
exception handling, for linkonce sections, for functions with a user-defined
section attribute and on any architecture that does not support named
sections.
<p>Enabled for x86 at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>.
<br><dt><code>-freorder-functions</code><dd><a name="index-freorder_002dfunctions-1048"></a>Reorder functions in the object file in order to
improve code locality. This is implemented by using special
subsections <code>.text.hot</code> for most frequently executed functions and
<code>.text.unlikely</code> for unlikely executed functions. Reordering is done by
the linker so object file format must support named sections and linker must
place them in a reasonable way.
<p>Also profile feedback must be available to make this option effective. See
<samp><span class="option">-fprofile-arcs</span></samp> for details.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fstrict-aliasing</code><dd><a name="index-fstrict_002daliasing-1049"></a>Allow the compiler to assume the strictest aliasing rules applicable to
the language being compiled. For C (and C++), this activates
optimizations based on the type of expressions. In particular, an
object of one type is assumed never to reside at the same address as an
object of a different type, unless the types are almost the same. For
example, an <code>unsigned int</code> can alias an <code>int</code>, but not a
<code>void*</code> or a <code>double</code>. A character type may alias any other
type.
<p><a name="Type_002dpunning"></a>Pay special attention to code like this:
<pre class="smallexample"> union a_union {
int i;
double d;
};
int f() {
union a_union t;
t.d = 3.0;
return t.i;
}
</pre>
<p>The practice of reading from a different union member than the one most
recently written to (called “type-punning”) is common. Even with
<samp><span class="option">-fstrict-aliasing</span></samp>, type-punning is allowed, provided the memory
is accessed through the union type. So, the code above works as
expected. See <a href=your_sha256_hash.html#your_sha256_hash>Structures unions enumerations and bit-fields implementation</a>. However, this code might not:
<pre class="smallexample"> int f() {
union a_union t;
int* ip;
t.d = 3.0;
ip = &t.i;
return *ip;
}
</pre>
<p>Similarly, access by taking the address, casting the resulting pointer
and dereferencing the result has undefined behavior, even if the cast
uses a union type, e.g.:
<pre class="smallexample"> int f() {
double d = 3.0;
return ((union a_union *) &d)->i;
}
</pre>
<p>The <samp><span class="option">-fstrict-aliasing</span></samp> option is enabled at levels
<samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fstrict-overflow</code><dd><a name="index-fstrict_002doverflow-1050"></a>Allow the compiler to assume strict signed overflow rules, depending
on the language being compiled. For C (and C++) this means that
overflow when doing arithmetic with signed numbers is undefined, which
means that the compiler may assume that it does not happen. This
permits various optimizations. For example, the compiler assumes
that an expression like <code>i + 10 > i</code> is always true for
signed <code>i</code>. This assumption is only valid if signed overflow is
undefined, as the expression is false if <code>i + 10</code> overflows when
using twos complement arithmetic. When this option is in effect any
attempt to determine whether an operation on signed numbers
overflows must be written carefully to not actually involve overflow.
<p>This option also allows the compiler to assume strict pointer
semantics: given a pointer to an object, if adding an offset to that
pointer does not produce a pointer to the same object, the addition is
undefined. This permits the compiler to conclude that <code>p + u >
p</code> is always true for a pointer <code>p</code> and unsigned integer
<code>u</code>. This assumption is only valid because pointer wraparound is
undefined, as the expression is false if <code>p + u</code> overflows using
twos complement arithmetic.
<p>See also the <samp><span class="option">-fwrapv</span></samp> option. Using <samp><span class="option">-fwrapv</span></samp> means
that integer signed overflow is fully defined: it wraps. When
<samp><span class="option">-fwrapv</span></samp> is used, there is no difference between
<samp><span class="option">-fstrict-overflow</span></samp> and <samp><span class="option">-fno-strict-overflow</span></samp> for
integers. With <samp><span class="option">-fwrapv</span></samp> certain types of overflow are
permitted. For example, if the compiler gets an overflow when doing
arithmetic on constants, the overflowed value can still be used with
<samp><span class="option">-fwrapv</span></samp>, but not otherwise.
<p>The <samp><span class="option">-fstrict-overflow</span></samp> option is enabled at levels
<samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-falign-functions</code><dt><code>-falign-functions=</code><var>n</var><dd><a name="index-falign_002dfunctions-1051"></a>Align the start of functions to the next power-of-two greater than
<var>n</var>, skipping up to <var>n</var> bytes. For instance,
<samp><span class="option">-falign-functions=32</span></samp> aligns functions to the next 32-byte
boundary, but <samp><span class="option">-falign-functions=24</span></samp> aligns to the next
32-byte boundary only if this can be done by skipping 23 bytes or less.
<p><samp><span class="option">-fno-align-functions</span></samp> and <samp><span class="option">-falign-functions=1</span></samp> are
equivalent and mean that functions are not aligned.
<p>Some assemblers only support this flag when <var>n</var> is a power of two;
in that case, it is rounded up.
<p>If <var>n</var> is not specified or is zero, use a machine-dependent default.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>.
<br><dt><code>-falign-labels</code><dt><code>-falign-labels=</code><var>n</var><dd><a name="index-falign_002dlabels-1052"></a>Align all branch targets to a power-of-two boundary, skipping up to
<var>n</var> bytes like <samp><span class="option">-falign-functions</span></samp>. This option can easily
make code slower, because it must insert dummy operations for when the
branch target is reached in the usual flow of the code.
<p><samp><span class="option">-fno-align-labels</span></samp> and <samp><span class="option">-falign-labels=1</span></samp> are
equivalent and mean that labels are not aligned.
<p>If <samp><span class="option">-falign-loops</span></samp> or <samp><span class="option">-falign-jumps</span></samp> are applicable and
are greater than this value, then their values are used instead.
<p>If <var>n</var> is not specified or is zero, use a machine-dependent default
which is very likely to be ‘<samp><span class="samp">1</span></samp>’, meaning no alignment.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>.
<br><dt><code>-falign-loops</code><dt><code>-falign-loops=</code><var>n</var><dd><a name="index-falign_002dloops-1053"></a>Align loops to a power-of-two boundary, skipping up to <var>n</var> bytes
like <samp><span class="option">-falign-functions</span></samp>. If the loops are
executed many times, this makes up for any execution of the dummy
operations.
<p><samp><span class="option">-fno-align-loops</span></samp> and <samp><span class="option">-falign-loops=1</span></samp> are
equivalent and mean that loops are not aligned.
<p>If <var>n</var> is not specified or is zero, use a machine-dependent default.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>.
<br><dt><code>-falign-jumps</code><dt><code>-falign-jumps=</code><var>n</var><dd><a name="index-falign_002djumps-1054"></a>Align branch targets to a power-of-two boundary, for branch targets
where the targets can only be reached by jumping, skipping up to <var>n</var>
bytes like <samp><span class="option">-falign-functions</span></samp>. In this case, no dummy operations
need be executed.
<p><samp><span class="option">-fno-align-jumps</span></samp> and <samp><span class="option">-falign-jumps=1</span></samp> are
equivalent and mean that loops are not aligned.
<p>If <var>n</var> is not specified or is zero, use a machine-dependent default.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>.
<br><dt><code>-funit-at-a-time</code><dd><a name="index-funit_002dat_002da_002dtime-1055"></a>This option is left for compatibility reasons. <samp><span class="option">-funit-at-a-time</span></samp>
has no effect, while <samp><span class="option">-fno-unit-at-a-time</span></samp> implies
<samp><span class="option">-fno-toplevel-reorder</span></samp> and <samp><span class="option">-fno-section-anchors</span></samp>.
<p>Enabled by default.
<br><dt><code>-fno-toplevel-reorder</code><dd><a name="index-fno_002dtoplevel_002dreorder-1056"></a>Do not reorder top-level functions, variables, and <code>asm</code>
statements. Output them in the same order that they appear in the
input file. When this option is used, unreferenced static variables
are not removed. This option is intended to support existing code
that relies on a particular ordering. For new code, it is better to
use attributes when possible.
<p>Enabled at level <samp><span class="option">-O0</span></samp>. When disabled explicitly, it also implies
<samp><span class="option">-fno-section-anchors</span></samp>, which is otherwise enabled at <samp><span class="option">-O0</span></samp> on some
targets.
<br><dt><code>-fweb</code><dd><a name="index-fweb-1057"></a>Constructs webs as commonly used for register allocation purposes and assign
each web individual pseudo register. This allows the register allocation pass
to operate on pseudos directly, but also strengthens several other optimization
passes, such as CSE, loop optimizer and trivial dead code remover. It can,
however, make debugging impossible, since variables no longer stay in a
“home register”.
<p>Enabled by default with <samp><span class="option">-funroll-loops</span></samp>.
<br><dt><code>-fwhole-program</code><dd><a name="index-fwhole_002dprogram-1058"></a>Assume that the current compilation unit represents the whole program being
compiled. All public functions and variables with the exception of <code>main</code>
and those merged by attribute <code>externally_visible</code> become static functions
and in effect are optimized more aggressively by interprocedural optimizers.
<p>This option should not be used in combination with <samp><span class="option">-flto</span></samp>.
Instead relying on a linker plugin should provide safer and more precise
information.
<br><dt><code>-flto[=</code><var>n</var><code>]</code><dd><a name="index-flto-1059"></a>This option runs the standard link-time optimizer. When invoked
with source code, it generates GIMPLE (one of GCC's internal
representations) and writes it to special ELF sections in the object
file. When the object files are linked together, all the function
bodies are read from these ELF sections and instantiated as if they
had been part of the same translation unit.
<p>To use the link-time optimizer, <samp><span class="option">-flto</span></samp> and optimization
options should be specified at compile time and during the final link.
For example:
<pre class="smallexample"> gcc -c -O2 -flto foo.c
gcc -c -O2 -flto bar.c
gcc -o myprog -flto -O2 foo.o bar.o
</pre>
<p>The first two invocations to GCC save a bytecode representation
of GIMPLE into special ELF sections inside <samp><span class="file">foo.o</span></samp> and
<samp><span class="file">bar.o</span></samp>. The final invocation reads the GIMPLE bytecode from
<samp><span class="file">foo.o</span></samp> and <samp><span class="file">bar.o</span></samp>, merges the two files into a single
internal image, and compiles the result as usual. Since both
<samp><span class="file">foo.o</span></samp> and <samp><span class="file">bar.o</span></samp> are merged into a single image, this
causes all the interprocedural analyses and optimizations in GCC to
work across the two files as if they were a single one. This means,
for example, that the inliner is able to inline functions in
<samp><span class="file">bar.o</span></samp> into functions in <samp><span class="file">foo.o</span></samp> and vice-versa.
<p>Another (simpler) way to enable link-time optimization is:
<pre class="smallexample"> gcc -o myprog -flto -O2 foo.c bar.c
</pre>
<p>The above generates bytecode for <samp><span class="file">foo.c</span></samp> and <samp><span class="file">bar.c</span></samp>,
merges them together into a single GIMPLE representation and optimizes
them as usual to produce <samp><span class="file">myprog</span></samp>.
<p>The only important thing to keep in mind is that to enable link-time
optimizations you need to use the GCC driver to perform the link-step.
GCC then automatically performs link-time optimization if any of the
objects involved were compiled with the <samp><span class="option">-flto</span></samp> command-line option.
You generally
should specify the optimization options to be used for link-time
optimization though GCC tries to be clever at guessing an
optimization level to use from the options used at compile-time
if you fail to specify one at link-time. You can always override
the automatic decision to do link-time optimization at link-time
by passing <samp><span class="option">-fno-lto</span></samp> to the link command.
<p>To make whole program optimization effective, it is necessary to make
certain whole program assumptions. The compiler needs to know
what functions and variables can be accessed by libraries and runtime
outside of the link-time optimized unit. When supported by the linker,
the linker plugin (see <samp><span class="option">-fuse-linker-plugin</span></samp>) passes information
to the compiler about used and externally visible symbols. When
the linker plugin is not available, <samp><span class="option">-fwhole-program</span></samp> should be
used to allow the compiler to make these assumptions, which leads
to more aggressive optimization decisions.
<p>When <samp><span class="option">-fuse-linker-plugin</span></samp> is not enabled then, when a file is
compiled with <samp><span class="option">-flto</span></samp>, the generated object file is larger than
a regular object file because it contains GIMPLE bytecodes and the usual
final code (see <samp><span class="option">-ffat-lto-objects</span></samp>. This means that
object files with LTO information can be linked as normal object
files; if <samp><span class="option">-fno-lto</span></samp> is passed to the linker, no
interprocedural optimizations are applied. Note that when
<samp><span class="option">-fno-fat-lto-objects</span></samp> is enabled the compile-stage is faster
but you cannot perform a regular, non-LTO link on them.
<p>Additionally, the optimization flags used to compile individual files
are not necessarily related to those used at link time. For instance,
<pre class="smallexample"> gcc -c -O0 -ffat-lto-objects -flto foo.c
gcc -c -O0 -ffat-lto-objects -flto bar.c
gcc -o myprog -O3 foo.o bar.o
</pre>
<p>This produces individual object files with unoptimized assembler
code, but the resulting binary <samp><span class="file">myprog</span></samp> is optimized at
<samp><span class="option">-O3</span></samp>. If, instead, the final binary is generated with
<samp><span class="option">-fno-lto</span></samp>, then <samp><span class="file">myprog</span></samp> is not optimized.
<p>When producing the final binary, GCC only
applies link-time optimizations to those files that contain bytecode.
Therefore, you can mix and match object files and libraries with
GIMPLE bytecodes and final object code. GCC automatically selects
which files to optimize in LTO mode and which files to link without
further processing.
<p>There are some code generation flags preserved by GCC when
generating bytecodes, as they need to be used during the final link
stage. Generally options specified at link-time override those
specified at compile-time.
<p>If you do not specify an optimization level option <samp><span class="option">-O</span></samp> at
link-time then GCC computes one based on the optimization levels
used when compiling the object files. The highest optimization
level wins here.
<p>Currently, the following options and their setting are take from
the first object file that explicitely specified it:
<samp><span class="option">-fPIC</span></samp>, <samp><span class="option">-fpic</span></samp>, <samp><span class="option">-fpie</span></samp>, <samp><span class="option">-fcommon</span></samp>,
<samp><span class="option">-fexceptions</span></samp>, <samp><span class="option">-fnon-call-exceptions</span></samp>, <samp><span class="option">-fgnu-tm</span></samp>
and all the <samp><span class="option">-m</span></samp> target flags.
<p>Certain ABI changing flags are required to match in all compilation-units
and trying to override this at link-time with a conflicting value
is ignored. This includes options such as <samp><span class="option">-freg-struct-return</span></samp>
and <samp><span class="option">-fpcc-struct-return</span></samp>.
<p>Other options such as <samp><span class="option">-ffp-contract</span></samp>, <samp><span class="option">-fno-strict-overflow</span></samp>,
<samp><span class="option">-fwrapv</span></samp>, <samp><span class="option">-fno-trapv</span></samp> or <samp><span class="option">-fno-strict-aliasing</span></samp>
are passed through to the link stage and merged conservatively for
conflicting translation units. Specifically
<samp><span class="option">-fno-strict-overflow</span></samp>, <samp><span class="option">-fwrapv</span></samp> and <samp><span class="option">-fno-trapv</span></samp> take
precedence and for example <samp><span class="option">-ffp-contract=off</span></samp> takes precedence
over <samp><span class="option">-ffp-contract=fast</span></samp>. You can override them at linke-time.
<p>It is recommended that you compile all the files participating in the
same link with the same options and also specify those options at
link time.
<p>If LTO encounters objects with C linkage declared with incompatible
types in separate translation units to be linked together (undefined
behavior according to ISO C99 6.2.7), a non-fatal diagnostic may be
issued. The behavior is still undefined at run time. Similar
diagnostics may be raised for other languages.
<p>Another feature of LTO is that it is possible to apply interprocedural
optimizations on files written in different languages:
<pre class="smallexample"> gcc -c -flto foo.c
g++ -c -flto bar.cc
gfortran -c -flto baz.f90
g++ -o myprog -flto -O3 foo.o bar.o baz.o -lgfortran
</pre>
<p>Notice that the final link is done with <samp><span class="command">g++</span></samp> to get the C++
runtime libraries and <samp><span class="option">-lgfortran</span></samp> is added to get the Fortran
runtime libraries. In general, when mixing languages in LTO mode, you
should use the same link command options as when mixing languages in a
regular (non-LTO) compilation.
<p>If object files containing GIMPLE bytecode are stored in a library archive, say
<samp><span class="file">libfoo.a</span></samp>, it is possible to extract and use them in an LTO link if you
are using a linker with plugin support. To create static libraries suitable
for LTO, use <samp><span class="command">gcc-ar</span></samp> and <samp><span class="command">gcc-ranlib</span></samp> instead of <samp><span class="command">ar</span></samp>
and <samp><span class="command">ranlib</span></samp>;
to show the symbols of object files with GIMPLE bytecode, use
<samp><span class="command">gcc-nm</span></samp>. Those commands require that <samp><span class="command">ar</span></samp>, <samp><span class="command">ranlib</span></samp>
and <samp><span class="command">nm</span></samp> have been compiled with plugin support. At link time, use the the
flag <samp><span class="option">-fuse-linker-plugin</span></samp> to ensure that the library participates in
the LTO optimization process:
<pre class="smallexample"> gcc -o myprog -O2 -flto -fuse-linker-plugin a.o b.o -lfoo
</pre>
<p>With the linker plugin enabled, the linker extracts the needed
GIMPLE files from <samp><span class="file">libfoo.a</span></samp> and passes them on to the running GCC
to make them part of the aggregated GIMPLE image to be optimized.
<p>If you are not using a linker with plugin support and/or do not
enable the linker plugin, then the objects inside <samp><span class="file">libfoo.a</span></samp>
are extracted and linked as usual, but they do not participate
in the LTO optimization process. In order to make a static library suitable
for both LTO optimization and usual linkage, compile its object files with
<samp><span class="option">-flto</span></samp> <samp><span class="option">-ffat-lto-objects</span></samp>.
<p>Link-time optimizations do not require the presence of the whole program to
operate. If the program does not require any symbols to be exported, it is
possible to combine <samp><span class="option">-flto</span></samp> and <samp><span class="option">-fwhole-program</span></samp> to allow
the interprocedural optimizers to use more aggressive assumptions which may
lead to improved optimization opportunities.
Use of <samp><span class="option">-fwhole-program</span></samp> is not needed when linker plugin is
active (see <samp><span class="option">-fuse-linker-plugin</span></samp>).
<p>The current implementation of LTO makes no
attempt to generate bytecode that is portable between different
types of hosts. The bytecode files are versioned and there is a
strict version check, so bytecode files generated in one version of
GCC do not work with an older or newer version of GCC.
<p>Link-time optimization does not work well with generation of debugging
information. Combining <samp><span class="option">-flto</span></samp> with
<samp><span class="option">-g</span></samp> is currently experimental and expected to produce unexpected
results.
<p>If you specify the optional <var>n</var>, the optimization and code
generation done at link time is executed in parallel using <var>n</var>
parallel jobs by utilizing an installed <samp><span class="command">make</span></samp> program. The
environment variable <samp><span class="env">MAKE</span></samp> may be used to override the program
used. The default value for <var>n</var> is 1.
<p>You can also specify <samp><span class="option">-flto=jobserver</span></samp> to use GNU make's
job server mode to determine the number of parallel jobs. This
is useful when the Makefile calling GCC is already executing in parallel.
You must prepend a ‘<samp><span class="samp">+</span></samp>’ to the command recipe in the parent Makefile
for this to work. This option likely only works if <samp><span class="env">MAKE</span></samp> is
GNU make.
<br><dt><code>-flto-partition=</code><var>alg</var><dd><a name="index-flto_002dpartition-1060"></a>Specify the partitioning algorithm used by the link-time optimizer.
The value is either ‘<samp><span class="samp">1to1</span></samp>’ to specify a partitioning mirroring
the original source files or ‘<samp><span class="samp">balanced</span></samp>’ to specify partitioning
into equally sized chunks (whenever possible) or ‘<samp><span class="samp">max</span></samp>’ to create
new partition for every symbol where possible. Specifying ‘<samp><span class="samp">none</span></samp>’
as an algorithm disables partitioning and streaming completely.
The default value is ‘<samp><span class="samp">balanced</span></samp>’. While ‘<samp><span class="samp">1to1</span></samp>’ can be used
as an workaround for various code ordering issues, the ‘<samp><span class="samp">max</span></samp>’
partitioning is intended for internal testing only.
The value ‘<samp><span class="samp">one</span></samp>’ specifies that exactly one partition should be
used while the value ‘<samp><span class="samp">none</span></samp>’ bypasses partitioning and executes
the link-time optimization step directly from the WPA phase.
<br><dt><code>-flto-odr-type-merging</code><dd><a name="index-flto_002dodr_002dtype_002dmerging-1061"></a>Enable streaming of mangled types names of C++ types and their unification
at linktime. This increases size of LTO object files, but enable
diagnostics about One Definition Rule violations.
<br><dt><code>-flto-compression-level=</code><var>n</var><dd><a name="index-flto_002dcompression_002dlevel-1062"></a>This option specifies the level of compression used for intermediate
language written to LTO object files, and is only meaningful in
conjunction with LTO mode (<samp><span class="option">-flto</span></samp>). Valid
values are 0 (no compression) to 9 (maximum compression). Values
outside this range are clamped to either 0 or 9. If the option is not
given, a default balanced compression setting is used.
<br><dt><code>-flto-report</code><dd><a name="index-flto_002dreport-1063"></a>Prints a report with internal details on the workings of the link-time
optimizer. The contents of this report vary from version to version.
It is meant to be useful to GCC developers when processing object
files in LTO mode (via <samp><span class="option">-flto</span></samp>).
<p>Disabled by default.
<br><dt><code>-flto-report-wpa</code><dd><a name="index-flto_002dreport_002dwpa-1064"></a>Like <samp><span class="option">-flto-report</span></samp>, but only print for the WPA phase of Link
Time Optimization.
<br><dt><code>-fuse-linker-plugin</code><dd><a name="index-fuse_002dlinker_002dplugin-1065"></a>Enables the use of a linker plugin during link-time optimization. This
option relies on plugin support in the linker, which is available in gold
or in GNU ld 2.21 or newer.
<p>This option enables the extraction of object files with GIMPLE bytecode out
of library archives. This improves the quality of optimization by exposing
more code to the link-time optimizer. This information specifies what
symbols can be accessed externally (by non-LTO object or during dynamic
linking). Resulting code quality improvements on binaries (and shared
libraries that use hidden visibility) are similar to <samp><span class="option">-fwhole-program</span></samp>.
See <samp><span class="option">-flto</span></samp> for a description of the effect of this flag and how to
use it.
<p>This option is enabled by default when LTO support in GCC is enabled
and GCC was configured for use with
a linker supporting plugins (GNU ld 2.21 or newer or gold).
<br><dt><code>-ffat-lto-objects</code><dd><a name="index-ffat_002dlto_002dobjects-1066"></a>Fat LTO objects are object files that contain both the intermediate language
and the object code. This makes them usable for both LTO linking and normal
linking. This option is effective only when compiling with <samp><span class="option">-flto</span></samp>
and is ignored at link time.
<p><samp><span class="option">-fno-fat-lto-objects</span></samp> improves compilation time over plain LTO, but
requires the complete toolchain to be aware of LTO. It requires a linker with
linker plugin support for basic functionality. Additionally,
<samp><span class="command">nm</span></samp>, <samp><span class="command">ar</span></samp> and <samp><span class="command">ranlib</span></samp>
need to support linker plugins to allow a full-featured build environment
(capable of building static libraries etc). GCC provides the <samp><span class="command">gcc-ar</span></samp>,
<samp><span class="command">gcc-nm</span></samp>, <samp><span class="command">gcc-ranlib</span></samp> wrappers to pass the right options
to these tools. With non fat LTO makefiles need to be modified to use them.
<p>The default is <samp><span class="option">-fno-fat-lto-objects</span></samp> on targets with linker plugin
support.
<br><dt><code>-fcompare-elim</code><dd><a name="index-fcompare_002delim-1067"></a>After register allocation and post-register allocation instruction splitting,
identify arithmetic instructions that compute processor flags similar to a
comparison operation based on that arithmetic. If possible, eliminate the
explicit comparison operation.
<p>This pass only applies to certain targets that cannot explicitly represent
the comparison operation before register allocation is complete.
<p>Enabled at levels <samp><span class="option">-O</span></samp>, <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fcprop-registers</code><dd><a name="index-fcprop_002dregisters-1068"></a>After register allocation and post-register allocation instruction splitting,
perform a copy-propagation pass to try to reduce scheduling dependencies
and occasionally eliminate the copy.
<p>Enabled at levels <samp><span class="option">-O</span></samp>, <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-fprofile-correction</code><dd><a name="index-fprofile_002dcorrection-1069"></a>Profiles collected using an instrumented binary for multi-threaded programs may
be inconsistent due to missed counter updates. When this option is specified,
GCC uses heuristics to correct or smooth out such inconsistencies. By
default, GCC emits an error message when an inconsistent profile is detected.
<br><dt><code>-fprofile-dir=</code><var>path</var><dd><a name="index-fprofile_002ddir-1070"></a>
Set the directory to search for the profile data files in to <var>path</var>.
This option affects only the profile data generated by
<samp><span class="option">-fprofile-generate</span></samp>, <samp><span class="option">-ftest-coverage</span></samp>, <samp><span class="option">-fprofile-arcs</span></samp>
and used by <samp><span class="option">-fprofile-use</span></samp> and <samp><span class="option">-fbranch-probabilities</span></samp>
and its related options. Both absolute and relative paths can be used.
By default, GCC uses the current directory as <var>path</var>, thus the
profile data file appears in the same directory as the object file.
<br><dt><code>-fprofile-generate</code><dt><code>-fprofile-generate=</code><var>path</var><dd><a name="index-fprofile_002dgenerate-1071"></a>
Enable options usually used for instrumenting application to produce
profile useful for later recompilation with profile feedback based
optimization. You must use <samp><span class="option">-fprofile-generate</span></samp> both when
compiling and when linking your program.
<p>The following options are enabled: <samp><span class="option">-fprofile-arcs</span></samp>, <samp><span class="option">-fprofile-values</span></samp>, <samp><span class="option">-fvpt</span></samp>.
<p>If <var>path</var> is specified, GCC looks at the <var>path</var> to find
the profile feedback data files. See <samp><span class="option">-fprofile-dir</span></samp>.
<br><dt><code>-fprofile-use</code><dt><code>-fprofile-use=</code><var>path</var><dd><a name="index-fprofile_002duse-1072"></a>Enable profile feedback-directed optimizations,
and the following optimizations
which are generally profitable only with profile feedback available:
<samp><span class="option">-fbranch-probabilities</span></samp>, <samp><span class="option">-fvpt</span></samp>,
<samp><span class="option">-funroll-loops</span></samp>, <samp><span class="option">-fpeel-loops</span></samp>, <samp><span class="option">-ftracer</span></samp>,
<samp><span class="option">-ftree-vectorize</span></samp>, and <samp><span class="option">ftree-loop-distribute-patterns</span></samp>.
<p>By default, GCC emits an error message if the feedback profiles do not
match the source code. This error can be turned into a warning by using
<samp><span class="option">-Wcoverage-mismatch</span></samp>. Note this may result in poorly optimized
code.
<p>If <var>path</var> is specified, GCC looks at the <var>path</var> to find
the profile feedback data files. See <samp><span class="option">-fprofile-dir</span></samp>.
<br><dt><code>-fauto-profile</code><dt><code>-fauto-profile=</code><var>path</var><dd><a name="index-fauto_002dprofile-1073"></a>Enable sampling-based feedback-directed optimizations,
and the following optimizations
which are generally profitable only with profile feedback available:
<samp><span class="option">-fbranch-probabilities</span></samp>, <samp><span class="option">-fvpt</span></samp>,
<samp><span class="option">-funroll-loops</span></samp>, <samp><span class="option">-fpeel-loops</span></samp>, <samp><span class="option">-ftracer</span></samp>,
<samp><span class="option">-ftree-vectorize</span></samp>,
<samp><span class="option">-finline-functions</span></samp>, <samp><span class="option">-fipa-cp</span></samp>, <samp><span class="option">-fipa-cp-clone</span></samp>,
<samp><span class="option">-fpredictive-commoning</span></samp>, <samp><span class="option">-funswitch-loops</span></samp>,
<samp><span class="option">-fgcse-after-reload</span></samp>, and <samp><span class="option">-ftree-loop-distribute-patterns</span></samp>.
<p><var>path</var> is the name of a file containing AutoFDO profile information.
If omitted, it defaults to <samp><span class="file">fbdata.afdo</span></samp> in the current directory.
<p>Producing an AutoFDO profile data file requires running your program
with the <samp><span class="command">perf</span></samp> utility on a supported GNU/Linux target system.
For more information, see <a href="path_to_url">path_to_url
<p>E.g.
<pre class="smallexample"> perf record -e br_inst_retired:near_taken -b -o perf.data \
-- your_program
</pre>
<p>Then use the <samp><span class="command">create_gcov</span></samp> tool to convert the raw profile data
to a format that can be used by GCC. You must also supply the
unstripped binary for your program to this tool.
See <a href="path_to_url">path_to_url
<p>E.g.
<pre class="smallexample"> create_gcov --binary=your_program.unstripped --profile=perf.data \
--gcov=profile.afdo
</pre>
</dl>
<p>The following options control compiler behavior regarding floating-point
arithmetic. These options trade off between speed and
correctness. All must be specifically enabled.
<dl>
<dt><code>-ffloat-store</code><dd><a name="index-ffloat_002dstore-1074"></a>Do not store floating-point variables in registers, and inhibit other
options that might change whether a floating-point value is taken from a
register or memory.
<p><a name="index-floating_002dpoint-precision-1075"></a>This option prevents undesirable excess precision on machines such as
the 68000 where the floating registers (of the 68881) keep more
precision than a <code>double</code> is supposed to have. Similarly for the
x86 architecture. For most programs, the excess precision does only
good, but a few programs rely on the precise definition of IEEE floating
point. Use <samp><span class="option">-ffloat-store</span></samp> for such programs, after modifying
them to store all pertinent intermediate computations into variables.
<br><dt><code>-fexcess-precision=</code><var>style</var><dd><a name="index-fexcess_002dprecision-1076"></a>This option allows further control over excess precision on machines
where floating-point registers have more precision than the IEEE
<code>float</code> and <code>double</code> types and the processor does not
support operations rounding to those types. By default,
<samp><span class="option">-fexcess-precision=fast</span></samp> is in effect; this means that
operations are carried out in the precision of the registers and that
it is unpredictable when rounding to the types specified in the source
code takes place. When compiling C, if
<samp><span class="option">-fexcess-precision=standard</span></samp> is specified then excess
precision follows the rules specified in ISO C99; in particular,
both casts and assignments cause values to be rounded to their
semantic types (whereas <samp><span class="option">-ffloat-store</span></samp> only affects
assignments). This option is enabled by default for C if a strict
conformance option such as <samp><span class="option">-std=c99</span></samp> is used.
<p><a name="index-mfpmath-1077"></a><samp><span class="option">-fexcess-precision=standard</span></samp> is not implemented for languages
other than C, and has no effect if
<samp><span class="option">-funsafe-math-optimizations</span></samp> or <samp><span class="option">-ffast-math</span></samp> is
specified. On the x86, it also has no effect if <samp><span class="option">-mfpmath=sse</span></samp>
or <samp><span class="option">-mfpmath=sse+387</span></samp> is specified; in the former case, IEEE
semantics apply without excess precision, and in the latter, rounding
is unpredictable.
<br><dt><code>-ffast-math</code><dd><a name="index-ffast_002dmath-1078"></a>Sets the options <samp><span class="option">-fno-math-errno</span></samp>, <samp><span class="option">-funsafe-math-optimizations</span></samp>,
<samp><span class="option">-ffinite-math-only</span></samp>, <samp><span class="option">-fno-rounding-math</span></samp>,
<samp><span class="option">-fno-signaling-nans</span></samp> and <samp><span class="option">-fcx-limited-range</span></samp>.
<p>This option causes the preprocessor macro <code>__FAST_MATH__</code> to be defined.
<p>This option is not turned on by any <samp><span class="option">-O</span></samp> option besides
<samp><span class="option">-Ofast</span></samp> since it can result in incorrect output for programs
that depend on an exact implementation of IEEE or ISO rules/specifications
for math functions. It may, however, yield faster code for programs
that do not require the guarantees of these specifications.
<br><dt><code>-fno-math-errno</code><dd><a name="index-fno_002dmath_002derrno-1079"></a>Do not set <code>errno</code> after calling math functions that are executed
with a single instruction, e.g., <code>sqrt</code>. A program that relies on
IEEE exceptions for math error handling may want to use this flag
for speed while maintaining IEEE arithmetic compatibility.
<p>This option is not turned on by any <samp><span class="option">-O</span></samp> option since
it can result in incorrect output for programs that depend on
an exact implementation of IEEE or ISO rules/specifications for
math functions. It may, however, yield faster code for programs
that do not require the guarantees of these specifications.
<p>The default is <samp><span class="option">-fmath-errno</span></samp>.
<p>On Darwin systems, the math library never sets <code>errno</code>. There is
therefore no reason for the compiler to consider the possibility that
it might, and <samp><span class="option">-fno-math-errno</span></samp> is the default.
<br><dt><code>-funsafe-math-optimizations</code><dd><a name="index-funsafe_002dmath_002doptimizations-1080"></a>
Allow optimizations for floating-point arithmetic that (a) assume
that arguments and results are valid and (b) may violate IEEE or
ANSI standards. When used at link-time, it may include libraries
or startup files that change the default FPU control word or other
similar optimizations.
<p>This option is not turned on by any <samp><span class="option">-O</span></samp> option since
it can result in incorrect output for programs that depend on
an exact implementation of IEEE or ISO rules/specifications for
math functions. It may, however, yield faster code for programs
that do not require the guarantees of these specifications.
Enables <samp><span class="option">-fno-signed-zeros</span></samp>, <samp><span class="option">-fno-trapping-math</span></samp>,
<samp><span class="option">-fassociative-math</span></samp> and <samp><span class="option">-freciprocal-math</span></samp>.
<p>The default is <samp><span class="option">-fno-unsafe-math-optimizations</span></samp>.
<br><dt><code>-fassociative-math</code><dd><a name="index-fassociative_002dmath-1081"></a>
Allow re-association of operands in series of floating-point operations.
This violates the ISO C and C++ language standard by possibly changing
computation result. NOTE: re-ordering may change the sign of zero as
well as ignore NaNs and inhibit or create underflow or overflow (and
thus cannot be used on code that relies on rounding behavior like
<code>(x + 2**52) - 2**52</code>. May also reorder floating-point comparisons
and thus may not be used when ordered comparisons are required.
This option requires that both <samp><span class="option">-fno-signed-zeros</span></samp> and
<samp><span class="option">-fno-trapping-math</span></samp> be in effect. Moreover, it doesn't make
much sense with <samp><span class="option">-frounding-math</span></samp>. For Fortran the option
is automatically enabled when both <samp><span class="option">-fno-signed-zeros</span></samp> and
<samp><span class="option">-fno-trapping-math</span></samp> are in effect.
<p>The default is <samp><span class="option">-fno-associative-math</span></samp>.
<br><dt><code>-freciprocal-math</code><dd><a name="index-freciprocal_002dmath-1082"></a>
Allow the reciprocal of a value to be used instead of dividing by
the value if this enables optimizations. For example <code>x / y</code>
can be replaced with <code>x * (1/y)</code>, which is useful if <code>(1/y)</code>
is subject to common subexpression elimination. Note that this loses
precision and increases the number of flops operating on the value.
<p>The default is <samp><span class="option">-fno-reciprocal-math</span></samp>.
<br><dt><code>-ffinite-math-only</code><dd><a name="index-ffinite_002dmath_002donly-1083"></a>Allow optimizations for floating-point arithmetic that assume
that arguments and results are not NaNs or +-Infs.
<p>This option is not turned on by any <samp><span class="option">-O</span></samp> option since
it can result in incorrect output for programs that depend on
an exact implementation of IEEE or ISO rules/specifications for
math functions. It may, however, yield faster code for programs
that do not require the guarantees of these specifications.
<p>The default is <samp><span class="option">-fno-finite-math-only</span></samp>.
<br><dt><code>-fno-signed-zeros</code><dd><a name="index-fno_002dsigned_002dzeros-1084"></a>Allow optimizations for floating-point arithmetic that ignore the
signedness of zero. IEEE arithmetic specifies the behavior of
distinct +0.0 and −0.0 values, which then prohibits simplification
of expressions such as x+0.0 or 0.0*x (even with <samp><span class="option">-ffinite-math-only</span></samp>).
This option implies that the sign of a zero result isn't significant.
<p>The default is <samp><span class="option">-fsigned-zeros</span></samp>.
<br><dt><code>-fno-trapping-math</code><dd><a name="index-fno_002dtrapping_002dmath-1085"></a>Compile code assuming that floating-point operations cannot generate
user-visible traps. These traps include division by zero, overflow,
underflow, inexact result and invalid operation. This option requires
that <samp><span class="option">-fno-signaling-nans</span></samp> be in effect. Setting this option may
allow faster code if one relies on “non-stop” IEEE arithmetic, for example.
<p>This option should never be turned on by any <samp><span class="option">-O</span></samp> option since
it can result in incorrect output for programs that depend on
an exact implementation of IEEE or ISO rules/specifications for
math functions.
<p>The default is <samp><span class="option">-ftrapping-math</span></samp>.
<br><dt><code>-frounding-math</code><dd><a name="index-frounding_002dmath-1086"></a>Disable transformations and optimizations that assume default floating-point
rounding behavior. This is round-to-zero for all floating point
to integer conversions, and round-to-nearest for all other arithmetic
truncations. This option should be specified for programs that change
the FP rounding mode dynamically, or that may be executed with a
non-default rounding mode. This option disables constant folding of
floating-point expressions at compile time (which may be affected by
rounding mode) and arithmetic transformations that are unsafe in the
presence of sign-dependent rounding modes.
<p>The default is <samp><span class="option">-fno-rounding-math</span></samp>.
<p>This option is experimental and does not currently guarantee to
disable all GCC optimizations that are affected by rounding mode.
Future versions of GCC may provide finer control of this setting
using C99's <code>FENV_ACCESS</code> pragma. This command-line option
will be used to specify the default state for <code>FENV_ACCESS</code>.
<br><dt><code>-fsignaling-nans</code><dd><a name="index-fsignaling_002dnans-1087"></a>Compile code assuming that IEEE signaling NaNs may generate user-visible
traps during floating-point operations. Setting this option disables
optimizations that may change the number of exceptions visible with
signaling NaNs. This option implies <samp><span class="option">-ftrapping-math</span></samp>.
<p>This option causes the preprocessor macro <code>__SUPPORT_SNAN__</code> to
be defined.
<p>The default is <samp><span class="option">-fno-signaling-nans</span></samp>.
<p>This option is experimental and does not currently guarantee to
disable all GCC optimizations that affect signaling NaN behavior.
<br><dt><code>-fsingle-precision-constant</code><dd><a name="index-fsingle_002dprecision_002dconstant-1088"></a>Treat floating-point constants as single precision instead of
implicitly converting them to double-precision constants.
<br><dt><code>-fcx-limited-range</code><dd><a name="index-fcx_002dlimited_002drange-1089"></a>When enabled, this option states that a range reduction step is not
needed when performing complex division. Also, there is no checking
whether the result of a complex multiplication or division is <code>NaN
+ I*NaN</code>, with an attempt to rescue the situation in that case. The
default is <samp><span class="option">-fno-cx-limited-range</span></samp>, but is enabled by
<samp><span class="option">-ffast-math</span></samp>.
<p>This option controls the default setting of the ISO C99
<code>CX_LIMITED_RANGE</code> pragma. Nevertheless, the option applies to
all languages.
<br><dt><code>-fcx-fortran-rules</code><dd><a name="index-fcx_002dfortran_002drules-1090"></a>Complex multiplication and division follow Fortran rules. Range
reduction is done as part of complex division, but there is no checking
whether the result of a complex multiplication or division is <code>NaN
+ I*NaN</code>, with an attempt to rescue the situation in that case.
<p>The default is <samp><span class="option">-fno-cx-fortran-rules</span></samp>.
</dl>
<p>The following options control optimizations that may improve
performance, but are not enabled by any <samp><span class="option">-O</span></samp> options. This
section includes experimental options that may produce broken code.
<dl>
<dt><code>-fbranch-probabilities</code><dd><a name="index-fbranch_002dprobabilities-1091"></a>After running a program compiled with <samp><span class="option">-fprofile-arcs</span></samp>
(see <a href="Debugging-Options.html#Debugging-Options">Options for Debugging Your Program or <samp><span class="command">gcc</span></samp></a>), you can compile it a second time using
<samp><span class="option">-fbranch-probabilities</span></samp>, to improve optimizations based on
the number of times each branch was taken. When a program
compiled with <samp><span class="option">-fprofile-arcs</span></samp> exits, it saves arc execution
counts to a file called <samp><var>sourcename</var><span class="file">.gcda</span></samp> for each source
file. The information in this data file is very dependent on the
structure of the generated code, so you must use the same source code
and the same optimization options for both compilations.
<p>With <samp><span class="option">-fbranch-probabilities</span></samp>, GCC puts a
‘<samp><span class="samp">REG_BR_PROB</span></samp>’ note on each ‘<samp><span class="samp">JUMP_INSN</span></samp>’ and ‘<samp><span class="samp">CALL_INSN</span></samp>’.
These can be used to improve optimization. Currently, they are only
used in one place: in <samp><span class="file">reorg.c</span></samp>, instead of guessing which path a
branch is most likely to take, the ‘<samp><span class="samp">REG_BR_PROB</span></samp>’ values are used to
exactly determine which path is taken more often.
<br><dt><code>-fprofile-values</code><dd><a name="index-fprofile_002dvalues-1092"></a>If combined with <samp><span class="option">-fprofile-arcs</span></samp>, it adds code so that some
data about values of expressions in the program is gathered.
<p>With <samp><span class="option">-fbranch-probabilities</span></samp>, it reads back the data gathered
from profiling values of expressions for usage in optimizations.
<p>Enabled with <samp><span class="option">-fprofile-generate</span></samp> and <samp><span class="option">-fprofile-use</span></samp>.
<br><dt><code>-fprofile-reorder-functions</code><dd><a name="index-fprofile_002dreorder_002dfunctions-1093"></a>Function reordering based on profile instrumentation collects
first time of execution of a function and orders these functions
in ascending order.
<p>Enabled with <samp><span class="option">-fprofile-use</span></samp>.
<br><dt><code>-fvpt</code><dd><a name="index-fvpt-1094"></a>If combined with <samp><span class="option">-fprofile-arcs</span></samp>, this option instructs the compiler
to add code to gather information about values of expressions.
<p>With <samp><span class="option">-fbranch-probabilities</span></samp>, it reads back the data gathered
and actually performs the optimizations based on them.
Currently the optimizations include specialization of division operations
using the knowledge about the value of the denominator.
<br><dt><code>-frename-registers</code><dd><a name="index-frename_002dregisters-1095"></a>Attempt to avoid false dependencies in scheduled code by making use
of registers left over after register allocation. This optimization
most benefits processors with lots of registers. Depending on the
debug information format adopted by the target, however, it can
make debugging impossible, since variables no longer stay in
a “home register”.
<p>Enabled by default with <samp><span class="option">-funroll-loops</span></samp> and <samp><span class="option">-fpeel-loops</span></samp>.
<br><dt><code>-fschedule-fusion</code><dd><a name="index-fschedule_002dfusion-1096"></a>Performs a target dependent pass over the instruction stream to schedule
instructions of same type together because target machine can execute them
more efficiently if they are adjacent to each other in the instruction flow.
<p>Enabled at levels <samp><span class="option">-O2</span></samp>, <samp><span class="option">-O3</span></samp>, <samp><span class="option">-Os</span></samp>.
<br><dt><code>-ftracer</code><dd><a name="index-ftracer-1097"></a>Perform tail duplication to enlarge superblock size. This transformation
simplifies the control flow of the function allowing other optimizations to do
a better job.
<p>Enabled with <samp><span class="option">-fprofile-use</span></samp>.
<br><dt><code>-funroll-loops</code><dd><a name="index-funroll_002dloops-1098"></a>Unroll loops whose number of iterations can be determined at compile time or
upon entry to the loop. <samp><span class="option">-funroll-loops</span></samp> implies
<samp><span class="option">-frerun-cse-after-loop</span></samp>, <samp><span class="option">-fweb</span></samp> and <samp><span class="option">-frename-registers</span></samp>.
It also turns on complete loop peeling (i.e. complete removal of loops with
a small constant number of iterations). This option makes code larger, and may
or may not make it run faster.
<p>Enabled with <samp><span class="option">-fprofile-use</span></samp>.
<br><dt><code>-funroll-all-loops</code><dd><a name="index-funroll_002dall_002dloops-1099"></a>Unroll all loops, even if their number of iterations is uncertain when
the loop is entered. This usually makes programs run more slowly.
<samp><span class="option">-funroll-all-loops</span></samp> implies the same options as
<samp><span class="option">-funroll-loops</span></samp>.
<br><dt><code>-fpeel-loops</code><dd><a name="index-fpeel_002dloops-1100"></a>Peels loops for which there is enough information that they do not
roll much (from profile feedback). It also turns on complete loop peeling
(i.e. complete removal of loops with small constant number of iterations).
<p>Enabled with <samp><span class="option">-fprofile-use</span></samp>.
<br><dt><code>-fmove-loop-invariants</code><dd><a name="index-fmove_002dloop_002dinvariants-1101"></a>Enables the loop invariant motion pass in the RTL loop optimizer. Enabled
at level <samp><span class="option">-O1</span></samp>
<br><dt><code>-funswitch-loops</code><dd><a name="index-funswitch_002dloops-1102"></a>Move branches with loop invariant conditions out of the loop, with duplicates
of the loop on both branches (modified according to result of the condition).
<br><dt><code>-ffunction-sections</code><dt><code>-fdata-sections</code><dd><a name="index-ffunction_002dsections-1103"></a><a name="index-fdata_002dsections-1104"></a>Place each function or data item into its own section in the output
file if the target supports arbitrary sections. The name of the
function or the name of the data item determines the section's name
in the output file.
<p>Use these options on systems where the linker can perform optimizations
to improve locality of reference in the instruction space. Most systems
using the ELF object format and SPARC processors running Solaris 2 have
linkers with such optimizations. AIX may have these optimizations in
the future.
<p>Only use these options when there are significant benefits from doing
so. When you specify these options, the assembler and linker
create larger object and executable files and are also slower.
You cannot use <samp><span class="command">gprof</span></samp> on all systems if you
specify this option, and you may have problems with debugging if
you specify both this option and <samp><span class="option">-g</span></samp>.
<br><dt><code>-fbranch-target-load-optimize</code><dd><a name="index-fbranch_002dtarget_002dload_002doptimize-1105"></a>Perform branch target register load optimization before prologue / epilogue
threading.
The use of target registers can typically be exposed only during reload,
thus hoisting loads out of loops and doing inter-block scheduling needs
a separate optimization pass.
<br><dt><code>-fbranch-target-load-optimize2</code><dd><a name="index-fbranch_002dtarget_002dload_002doptimize2-1106"></a>Perform branch target register load optimization after prologue / epilogue
threading.
<br><dt><code>-fbtr-bb-exclusive</code><dd><a name="index-fbtr_002dbb_002dexclusive-1107"></a>When performing branch target register load optimization, don't reuse
branch target registers within any basic block.
<br><dt><code>-fstack-protector</code><dd><a name="index-fstack_002dprotector-1108"></a>Emit extra code to check for buffer overflows, such as stack smashing
attacks. This is done by adding a guard variable to functions with
vulnerable objects. This includes functions that call <code>alloca</code>, and
functions with buffers larger than 8 bytes. The guards are initialized
when a function is entered and then checked when the function exits.
If a guard check fails, an error message is printed and the program exits.
<br><dt><code>-fstack-protector-all</code><dd><a name="index-fstack_002dprotector_002dall-1109"></a>Like <samp><span class="option">-fstack-protector</span></samp> except that all functions are protected.
<br><dt><code>-fstack-protector-strong</code><dd><a name="index-fstack_002dprotector_002dstrong-1110"></a>Like <samp><span class="option">-fstack-protector</span></samp> but includes additional functions to
be protected — those that have local array definitions, or have
references to local frame addresses.
<br><dt><code>-fstack-protector-explicit</code><dd><a name="index-fstack_002dprotector_002dexplicit-1111"></a>Like <samp><span class="option">-fstack-protector</span></samp> but only protects those functions which
have the <code>stack_protect</code> attribute
<br><dt><code>-fstdarg-opt</code><dd><a name="index-fstdarg_002dopt-1112"></a>Optimize the prologue of variadic argument functions with respect to usage of
those arguments.
<br><dt><code>-fsection-anchors</code><dd><a name="index-fsection_002danchors-1113"></a>Try to reduce the number of symbolic address calculations by using
shared “anchor” symbols to address nearby objects. This transformation
can help to reduce the number of GOT entries and GOT accesses on some
targets.
<p>For example, the implementation of the following function <code>foo</code>:
<pre class="smallexample"> static int a, b, c;
int foo (void) { return a + b + c; }
</pre>
<p class="noindent">usually calculates the addresses of all three variables, but if you
compile it with <samp><span class="option">-fsection-anchors</span></samp>, it accesses the variables
from a common anchor point instead. The effect is similar to the
following pseudocode (which isn't valid C):
<pre class="smallexample"> int foo (void)
{
register int *xr = &x;
return xr[&a - &x] + xr[&b - &x] + xr[&c - &x];
}
</pre>
<p>Not all targets support this option.
<br><dt><code>--param </code><var>name</var><code>=</code><var>value</var><dd><a name="index-param-1114"></a>In some places, GCC uses various constants to control the amount of
optimization that is done. For example, GCC does not inline functions
that contain more than a certain number of instructions. You can
control some of these constants on the command line using the
<samp><span class="option">--param</span></samp> option.
<p>The names of specific parameters, and the meaning of the values, are
tied to the internals of the compiler, and are subject to change
without notice in future releases.
<p>In each case, the <var>value</var> is an integer. The allowable choices for
<var>name</var> are:
<dl>
<dt><code>predictable-branch-outcome</code><dd>When branch is predicted to be taken with probability lower than this threshold
(in percent), then it is considered well predictable. The default is 10.
<br><dt><code>max-crossjump-edges</code><dd>The maximum number of incoming edges to consider for cross-jumping.
The algorithm used by <samp><span class="option">-fcrossjumping</span></samp> is O(N^2) in
the number of edges incoming to each block. Increasing values mean
more aggressive optimization, making the compilation time increase with
probably small improvement in executable size.
<br><dt><code>min-crossjump-insns</code><dd>The minimum number of instructions that must be matched at the end
of two blocks before cross-jumping is performed on them. This
value is ignored in the case where all instructions in the block being
cross-jumped from are matched. The default value is 5.
<br><dt><code>max-grow-copy-bb-insns</code><dd>The maximum code size expansion factor when copying basic blocks
instead of jumping. The expansion is relative to a jump instruction.
The default value is 8.
<br><dt><code>max-goto-duplication-insns</code><dd>The maximum number of instructions to duplicate to a block that jumps
to a computed goto. To avoid O(N^2) behavior in a number of
passes, GCC factors computed gotos early in the compilation process,
and unfactors them as late as possible. Only computed jumps at the
end of a basic blocks with no more than max-goto-duplication-insns are
unfactored. The default value is 8.
<br><dt><code>max-delay-slot-insn-search</code><dd>The maximum number of instructions to consider when looking for an
instruction to fill a delay slot. If more than this arbitrary number of
instructions are searched, the time savings from filling the delay slot
are minimal, so stop searching. Increasing values mean more
aggressive optimization, making the compilation time increase with probably
small improvement in execution time.
<br><dt><code>max-delay-slot-live-search</code><dd>When trying to fill delay slots, the maximum number of instructions to
consider when searching for a block with valid live register
information. Increasing this arbitrarily chosen value means more
aggressive optimization, increasing the compilation time. This parameter
should be removed when the delay slot code is rewritten to maintain the
control-flow graph.
<br><dt><code>max-gcse-memory</code><dd>The approximate maximum amount of memory that can be allocated in
order to perform the global common subexpression elimination
optimization. If more memory than specified is required, the
optimization is not done.
<br><dt><code>max-gcse-insertion-ratio</code><dd>If the ratio of expression insertions to deletions is larger than this value
for any expression, then RTL PRE inserts or removes the expression and thus
leaves partially redundant computations in the instruction stream. The default value is 20.
<br><dt><code>max-pending-list-length</code><dd>The maximum number of pending dependencies scheduling allows
before flushing the current state and starting over. Large functions
with few branches or calls can create excessively large lists which
needlessly consume memory and resources.
<br><dt><code>max-modulo-backtrack-attempts</code><dd>The maximum number of backtrack attempts the scheduler should make
when modulo scheduling a loop. Larger values can exponentially increase
compilation time.
<br><dt><code>max-inline-insns-single</code><dd>Several parameters control the tree inliner used in GCC.
This number sets the maximum number of instructions (counted in GCC's
internal representation) in a single function that the tree inliner
considers for inlining. This only affects functions declared
inline and methods implemented in a class declaration (C++).
The default value is 400.
<br><dt><code>max-inline-insns-auto</code><dd>When you use <samp><span class="option">-finline-functions</span></samp> (included in <samp><span class="option">-O3</span></samp>),
a lot of functions that would otherwise not be considered for inlining
by the compiler are investigated. To those functions, a different
(more restrictive) limit compared to functions declared inline can
be applied.
The default value is 40.
<br><dt><code>inline-min-speedup</code><dd>When estimated performance improvement of caller + callee runtime exceeds this
threshold (in precent), the function can be inlined regardless the limit on
<samp><span class="option">--param max-inline-insns-single</span></samp> and <samp><span class="option">--param
max-inline-insns-auto</span></samp>.
<br><dt><code>large-function-insns</code><dd>The limit specifying really large functions. For functions larger than this
limit after inlining, inlining is constrained by
<samp><span class="option">--param large-function-growth</span></samp>. This parameter is useful primarily
to avoid extreme compilation time caused by non-linear algorithms used by the
back end.
The default value is 2700.
<br><dt><code>large-function-growth</code><dd>Specifies maximal growth of large function caused by inlining in percents.
The default value is 100 which limits large function growth to 2.0 times
the original size.
<br><dt><code>large-unit-insns</code><dd>The limit specifying large translation unit. Growth caused by inlining of
units larger than this limit is limited by <samp><span class="option">--param inline-unit-growth</span></samp>.
For small units this might be too tight.
For example, consider a unit consisting of function A
that is inline and B that just calls A three times. If B is small relative to
A, the growth of unit is 300\% and yet such inlining is very sane. For very
large units consisting of small inlineable functions, however, the overall unit
growth limit is needed to avoid exponential explosion of code size. Thus for
smaller units, the size is increased to <samp><span class="option">--param large-unit-insns</span></samp>
before applying <samp><span class="option">--param inline-unit-growth</span></samp>. The default is 10000.
<br><dt><code>inline-unit-growth</code><dd>Specifies maximal overall growth of the compilation unit caused by inlining.
The default value is 20 which limits unit growth to 1.2 times the original
size. Cold functions (either marked cold via an attribute or by profile
feedback) are not accounted into the unit size.
<br><dt><code>ipcp-unit-growth</code><dd>Specifies maximal overall growth of the compilation unit caused by
interprocedural constant propagation. The default value is 10 which limits
unit growth to 1.1 times the original size.
<br><dt><code>large-stack-frame</code><dd>The limit specifying large stack frames. While inlining the algorithm is trying
to not grow past this limit too much. The default value is 256 bytes.
<br><dt><code>large-stack-frame-growth</code><dd>Specifies maximal growth of large stack frames caused by inlining in percents.
The default value is 1000 which limits large stack frame growth to 11 times
the original size.
<br><dt><code>max-inline-insns-recursive</code><dt><code>max-inline-insns-recursive-auto</code><dd>Specifies the maximum number of instructions an out-of-line copy of a
self-recursive inline
function can grow into by performing recursive inlining.
<p><samp><span class="option">--param max-inline-insns-recursive</span></samp> applies to functions
declared inline.
For functions not declared inline, recursive inlining
happens only when <samp><span class="option">-finline-functions</span></samp> (included in <samp><span class="option">-O3</span></samp>) is
enabled; <samp><span class="option">--param max-inline-insns-recursive-auto</span></samp> applies instead. The
default value is 450.
<br><dt><code>max-inline-recursive-depth</code><dt><code>max-inline-recursive-depth-auto</code><dd>Specifies the maximum recursion depth used for recursive inlining.
<p><samp><span class="option">--param max-inline-recursive-depth</span></samp> applies to functions
declared inline. For functions not declared inline, recursive inlining
happens only when <samp><span class="option">-finline-functions</span></samp> (included in <samp><span class="option">-O3</span></samp>) is
enabled; <samp><span class="option">--param max-inline-recursive-depth-auto</span></samp> applies instead. The
default value is 8.
<br><dt><code>min-inline-recursive-probability</code><dd>Recursive inlining is profitable only for function having deep recursion
in average and can hurt for function having little recursion depth by
increasing the prologue size or complexity of function body to other
optimizers.
<p>When profile feedback is available (see <samp><span class="option">-fprofile-generate</span></samp>) the actual
recursion depth can be guessed from probability that function recurses via a
given call expression. This parameter limits inlining only to call expressions
whose probability exceeds the given threshold (in percents).
The default value is 10.
<br><dt><code>early-inlining-insns</code><dd>Specify growth that the early inliner can make. In effect it increases
the amount of inlining for code having a large abstraction penalty.
The default value is 14.
<br><dt><code>max-early-inliner-iterations</code><dd>Limit of iterations of the early inliner. This basically bounds
the number of nested indirect calls the early inliner can resolve.
Deeper chains are still handled by late inlining.
<br><dt><code>comdat-sharing-probability</code><dd>Probability (in percent) that C++ inline function with comdat visibility
are shared across multiple compilation units. The default value is 20.
<br><dt><code>profile-func-internal-id</code><dd>A parameter to control whether to use function internal id in profile
database lookup. If the value is 0, the compiler uses an id that
is based on function assembler name and filename, which makes old profile
data more tolerant to source changes such as function reordering etc.
The default value is 0.
<br><dt><code>min-vect-loop-bound</code><dd>The minimum number of iterations under which loops are not vectorized
when <samp><span class="option">-ftree-vectorize</span></samp> is used. The number of iterations after
vectorization needs to be greater than the value specified by this option
to allow vectorization. The default value is 0.
<br><dt><code>gcse-cost-distance-ratio</code><dd>Scaling factor in calculation of maximum distance an expression
can be moved by GCSE optimizations. This is currently supported only in the
code hoisting pass. The bigger the ratio, the more aggressive code hoisting
is with simple expressions, i.e., the expressions that have cost
less than <samp><span class="option">gcse-unrestricted-cost</span></samp>. Specifying 0 disables
hoisting of simple expressions. The default value is 10.
<br><dt><code>gcse-unrestricted-cost</code><dd>Cost, roughly measured as the cost of a single typical machine
instruction, at which GCSE optimizations do not constrain
the distance an expression can travel. This is currently
supported only in the code hoisting pass. The lesser the cost,
the more aggressive code hoisting is. Specifying 0
allows all expressions to travel unrestricted distances.
The default value is 3.
<br><dt><code>max-hoist-depth</code><dd>The depth of search in the dominator tree for expressions to hoist.
This is used to avoid quadratic behavior in hoisting algorithm.
The value of 0 does not limit on the search, but may slow down compilation
of huge functions. The default value is 30.
<br><dt><code>max-tail-merge-comparisons</code><dd>The maximum amount of similar bbs to compare a bb with. This is used to
avoid quadratic behavior in tree tail merging. The default value is 10.
<br><dt><code>max-tail-merge-iterations</code><dd>The maximum amount of iterations of the pass over the function. This is used to
limit compilation time in tree tail merging. The default value is 2.
<br><dt><code>max-unrolled-insns</code><dd>The maximum number of instructions that a loop may have to be unrolled.
If a loop is unrolled, this parameter also determines how many times
the loop code is unrolled.
<br><dt><code>max-average-unrolled-insns</code><dd>The maximum number of instructions biased by probabilities of their execution
that a loop may have to be unrolled. If a loop is unrolled,
this parameter also determines how many times the loop code is unrolled.
<br><dt><code>max-unroll-times</code><dd>The maximum number of unrollings of a single loop.
<br><dt><code>max-peeled-insns</code><dd>The maximum number of instructions that a loop may have to be peeled.
If a loop is peeled, this parameter also determines how many times
the loop code is peeled.
<br><dt><code>max-peel-times</code><dd>The maximum number of peelings of a single loop.
<br><dt><code>max-peel-branches</code><dd>The maximum number of branches on the hot path through the peeled sequence.
<br><dt><code>max-completely-peeled-insns</code><dd>The maximum number of insns of a completely peeled loop.
<br><dt><code>max-completely-peel-times</code><dd>The maximum number of iterations of a loop to be suitable for complete peeling.
<br><dt><code>max-completely-peel-loop-nest-depth</code><dd>The maximum depth of a loop nest suitable for complete peeling.
<br><dt><code>max-unswitch-insns</code><dd>The maximum number of insns of an unswitched loop.
<br><dt><code>max-unswitch-level</code><dd>The maximum number of branches unswitched in a single loop.
<br><dt><code>lim-expensive</code><dd>The minimum cost of an expensive expression in the loop invariant motion.
<br><dt><code>iv-consider-all-candidates-bound</code><dd>Bound on number of candidates for induction variables, below which
all candidates are considered for each use in induction variable
optimizations. If there are more candidates than this,
only the most relevant ones are considered to avoid quadratic time complexity.
<br><dt><code>iv-max-considered-uses</code><dd>The induction variable optimizations give up on loops that contain more
induction variable uses.
<br><dt><code>iv-always-prune-cand-set-bound</code><dd>If the number of candidates in the set is smaller than this value,
always try to remove unnecessary ivs from the set
when adding a new one.
<br><dt><code>scev-max-expr-size</code><dd>Bound on size of expressions used in the scalar evolutions analyzer.
Large expressions slow the analyzer.
<br><dt><code>scev-max-expr-complexity</code><dd>Bound on the complexity of the expressions in the scalar evolutions analyzer.
Complex expressions slow the analyzer.
<br><dt><code>omega-max-vars</code><dd>The maximum number of variables in an Omega constraint system.
The default value is 128.
<br><dt><code>omega-max-geqs</code><dd>The maximum number of inequalities in an Omega constraint system.
The default value is 256.
<br><dt><code>omega-max-eqs</code><dd>The maximum number of equalities in an Omega constraint system.
The default value is 128.
<br><dt><code>omega-max-wild-cards</code><dd>The maximum number of wildcard variables that the Omega solver is
able to insert. The default value is 18.
<br><dt><code>omega-hash-table-size</code><dd>The size of the hash table in the Omega solver. The default value is
550.
<br><dt><code>omega-max-keys</code><dd>The maximal number of keys used by the Omega solver. The default
value is 500.
<br><dt><code>omega-eliminate-redundant-constraints</code><dd>When set to 1, use expensive methods to eliminate all redundant
constraints. The default value is 0.
<br><dt><code>vect-max-version-for-alignment-checks</code><dd>The maximum number of run-time checks that can be performed when
doing loop versioning for alignment in the vectorizer.
<br><dt><code>vect-max-version-for-alias-checks</code><dd>The maximum number of run-time checks that can be performed when
doing loop versioning for alias in the vectorizer.
<br><dt><code>vect-max-peeling-for-alignment</code><dd>The maximum number of loop peels to enhance access alignment
for vectorizer. Value -1 means 'no limit'.
<br><dt><code>max-iterations-to-track</code><dd>The maximum number of iterations of a loop the brute-force algorithm
for analysis of the number of iterations of the loop tries to evaluate.
<br><dt><code>hot-bb-count-ws-permille</code><dd>A basic block profile count is considered hot if it contributes to
the given permillage (i.e. 0...1000) of the entire profiled execution.
<br><dt><code>hot-bb-frequency-fraction</code><dd>Select fraction of the entry block frequency of executions of basic block in
function given basic block needs to have to be considered hot.
<br><dt><code>max-predicted-iterations</code><dd>The maximum number of loop iterations we predict statically. This is useful
in cases where a function contains a single loop with known bound and
another loop with unknown bound.
The known number of iterations is predicted correctly, while
the unknown number of iterations average to roughly 10. This means that the
loop without bounds appears artificially cold relative to the other one.
<br><dt><code>builtin-expect-probability</code><dd>Control the probability of the expression having the specified value. This
parameter takes a percentage (i.e. 0 ... 100) as input.
The default probability of 90 is obtained empirically.
<br><dt><code>align-threshold</code><dd>
Select fraction of the maximal frequency of executions of a basic block in
a function to align the basic block.
<br><dt><code>align-loop-iterations</code><dd>
A loop expected to iterate at least the selected number of iterations is
aligned.
<br><dt><code>tracer-dynamic-coverage</code><dt><code>tracer-dynamic-coverage-feedback</code><dd>
This value is used to limit superblock formation once the given percentage of
executed instructions is covered. This limits unnecessary code size
expansion.
<p>The <samp><span class="option">tracer-dynamic-coverage-feedback</span></samp> parameter
is used only when profile
feedback is available. The real profiles (as opposed to statically estimated
ones) are much less balanced allowing the threshold to be larger value.
<br><dt><code>tracer-max-code-growth</code><dd>Stop tail duplication once code growth has reached given percentage. This is
a rather artificial limit, as most of the duplicates are eliminated later in
cross jumping, so it may be set to much higher values than is the desired code
growth.
<br><dt><code>tracer-min-branch-ratio</code><dd>
Stop reverse growth when the reverse probability of best edge is less than this
threshold (in percent).
<br><dt><code>tracer-min-branch-ratio</code><dt><code>tracer-min-branch-ratio-feedback</code><dd>
Stop forward growth if the best edge has probability lower than this
threshold.
<p>Similarly to <samp><span class="option">tracer-dynamic-coverage</span></samp> two values are present, one for
compilation for profile feedback and one for compilation without. The value
for compilation with profile feedback needs to be more conservative (higher) in
order to make tracer effective.
<br><dt><code>max-cse-path-length</code><dd>
The maximum number of basic blocks on path that CSE considers.
The default is 10.
<br><dt><code>max-cse-insns</code><dd>The maximum number of instructions CSE processes before flushing.
The default is 1000.
<br><dt><code>ggc-min-expand</code><dd>
GCC uses a garbage collector to manage its own memory allocation. This
parameter specifies the minimum percentage by which the garbage
collector's heap should be allowed to expand between collections.
Tuning this may improve compilation speed; it has no effect on code
generation.
<p>The default is 30% + 70% * (RAM/1GB) with an upper bound of 100% when
RAM >= 1GB. If <code>getrlimit</code> is available, the notion of “RAM” is
the smallest of actual RAM and <code>RLIMIT_DATA</code> or <code>RLIMIT_AS</code>. If
GCC is not able to calculate RAM on a particular platform, the lower
bound of 30% is used. Setting this parameter and
<samp><span class="option">ggc-min-heapsize</span></samp> to zero causes a full collection to occur at
every opportunity. This is extremely slow, but can be useful for
debugging.
<br><dt><code>ggc-min-heapsize</code><dd>
Minimum size of the garbage collector's heap before it begins bothering
to collect garbage. The first collection occurs after the heap expands
by <samp><span class="option">ggc-min-expand</span></samp>% beyond <samp><span class="option">ggc-min-heapsize</span></samp>. Again,
tuning this may improve compilation speed, and has no effect on code
generation.
<p>The default is the smaller of RAM/8, RLIMIT_RSS, or a limit that
tries to ensure that RLIMIT_DATA or RLIMIT_AS are not exceeded, but
with a lower bound of 4096 (four megabytes) and an upper bound of
131072 (128 megabytes). If GCC is not able to calculate RAM on a
particular platform, the lower bound is used. Setting this parameter
very large effectively disables garbage collection. Setting this
parameter and <samp><span class="option">ggc-min-expand</span></samp> to zero causes a full collection
to occur at every opportunity.
<br><dt><code>max-reload-search-insns</code><dd>The maximum number of instruction reload should look backward for equivalent
register. Increasing values mean more aggressive optimization, making the
compilation time increase with probably slightly better performance.
The default value is 100.
<br><dt><code>max-cselib-memory-locations</code><dd>The maximum number of memory locations cselib should take into account.
Increasing values mean more aggressive optimization, making the compilation time
increase with probably slightly better performance. The default value is 500.
<br><dt><code>reorder-blocks-duplicate</code><dt><code>reorder-blocks-duplicate-feedback</code><dd>
Used by the basic block reordering pass to decide whether to use unconditional
branch or duplicate the code on its destination. Code is duplicated when its
estimated size is smaller than this value multiplied by the estimated size of
unconditional jump in the hot spots of the program.
<p>The <samp><span class="option">reorder-block-duplicate-feedback</span></samp> parameter
is used only when profile
feedback is available. It may be set to higher values than
<samp><span class="option">reorder-block-duplicate</span></samp> since information about the hot spots is more
accurate.
<br><dt><code>max-sched-ready-insns</code><dd>The maximum number of instructions ready to be issued the scheduler should
consider at any given time during the first scheduling pass. Increasing
values mean more thorough searches, making the compilation time increase
with probably little benefit. The default value is 100.
<br><dt><code>max-sched-region-blocks</code><dd>The maximum number of blocks in a region to be considered for
interblock scheduling. The default value is 10.
<br><dt><code>max-pipeline-region-blocks</code><dd>The maximum number of blocks in a region to be considered for
pipelining in the selective scheduler. The default value is 15.
<br><dt><code>max-sched-region-insns</code><dd>The maximum number of insns in a region to be considered for
interblock scheduling. The default value is 100.
<br><dt><code>max-pipeline-region-insns</code><dd>The maximum number of insns in a region to be considered for
pipelining in the selective scheduler. The default value is 200.
<br><dt><code>min-spec-prob</code><dd>The minimum probability (in percents) of reaching a source block
for interblock speculative scheduling. The default value is 40.
<br><dt><code>max-sched-extend-regions-iters</code><dd>The maximum number of iterations through CFG to extend regions.
A value of 0 (the default) disables region extensions.
<br><dt><code>max-sched-insn-conflict-delay</code><dd>The maximum conflict delay for an insn to be considered for speculative motion.
The default value is 3.
<br><dt><code>sched-spec-prob-cutoff</code><dd>The minimal probability of speculation success (in percents), so that
speculative insns are scheduled.
The default value is 40.
<br><dt><code>sched-spec-state-edge-prob-cutoff</code><dd>The minimum probability an edge must have for the scheduler to save its
state across it.
The default value is 10.
<br><dt><code>sched-mem-true-dep-cost</code><dd>Minimal distance (in CPU cycles) between store and load targeting same
memory locations. The default value is 1.
<br><dt><code>selsched-max-lookahead</code><dd>The maximum size of the lookahead window of selective scheduling. It is a
depth of search for available instructions.
The default value is 50.
<br><dt><code>selsched-max-sched-times</code><dd>The maximum number of times that an instruction is scheduled during
selective scheduling. This is the limit on the number of iterations
through which the instruction may be pipelined. The default value is 2.
<br><dt><code>selsched-max-insns-to-rename</code><dd>The maximum number of best instructions in the ready list that are considered
for renaming in the selective scheduler. The default value is 2.
<br><dt><code>sms-min-sc</code><dd>The minimum value of stage count that swing modulo scheduler
generates. The default value is 2.
<br><dt><code>max-last-value-rtl</code><dd>The maximum size measured as number of RTLs that can be recorded in an expression
in combiner for a pseudo register as last known value of that register. The default
is 10000.
<br><dt><code>max-combine-insns</code><dd>The maximum number of instructions the RTL combiner tries to combine.
The default value is 2 at <samp><span class="option">-Og</span></samp> and 4 otherwise.
<br><dt><code>integer-share-limit</code><dd>Small integer constants can use a shared data structure, reducing the
compiler's memory usage and increasing its speed. This sets the maximum
value of a shared integer constant. The default value is 256.
<br><dt><code>ssp-buffer-size</code><dd>The minimum size of buffers (i.e. arrays) that receive stack smashing
protection when <samp><span class="option">-fstack-protection</span></samp> is used.
<br><dt><code>min-size-for-stack-sharing</code><dd>The minimum size of variables taking part in stack slot sharing when not
optimizing. The default value is 32.
<br><dt><code>max-jump-thread-duplication-stmts</code><dd>Maximum number of statements allowed in a block that needs to be
duplicated when threading jumps.
<br><dt><code>max-fields-for-field-sensitive</code><dd>Maximum number of fields in a structure treated in
a field sensitive manner during pointer analysis. The default is zero
for <samp><span class="option">-O0</span></samp> and <samp><span class="option">-O1</span></samp>,
and 100 for <samp><span class="option">-Os</span></samp>, <samp><span class="option">-O2</span></samp>, and <samp><span class="option">-O3</span></samp>.
<br><dt><code>prefetch-latency</code><dd>Estimate on average number of instructions that are executed before
prefetch finishes. The distance prefetched ahead is proportional
to this constant. Increasing this number may also lead to less
streams being prefetched (see <samp><span class="option">simultaneous-prefetches</span></samp>).
<br><dt><code>simultaneous-prefetches</code><dd>Maximum number of prefetches that can run at the same time.
<br><dt><code>l1-cache-line-size</code><dd>The size of cache line in L1 cache, in bytes.
<br><dt><code>l1-cache-size</code><dd>The size of L1 cache, in kilobytes.
<br><dt><code>l2-cache-size</code><dd>The size of L2 cache, in kilobytes.
<br><dt><code>min-insn-to-prefetch-ratio</code><dd>The minimum ratio between the number of instructions and the
number of prefetches to enable prefetching in a loop.
<br><dt><code>prefetch-min-insn-to-mem-ratio</code><dd>The minimum ratio between the number of instructions and the
number of memory references to enable prefetching in a loop.
<br><dt><code>use-canonical-types</code><dd>Whether the compiler should use the “canonical” type system. By
default, this should always be 1, which uses a more efficient internal
mechanism for comparing types in C++ and Objective-C++. However, if
bugs in the canonical type system are causing compilation failures,
set this value to 0 to disable canonical types.
<br><dt><code>switch-conversion-max-branch-ratio</code><dd>Switch initialization conversion refuses to create arrays that are
bigger than <samp><span class="option">switch-conversion-max-branch-ratio</span></samp> times the number of
branches in the switch.
<br><dt><code>max-partial-antic-length</code><dd>Maximum length of the partial antic set computed during the tree
partial redundancy elimination optimization (<samp><span class="option">-ftree-pre</span></samp>) when
optimizing at <samp><span class="option">-O3</span></samp> and above. For some sorts of source code
the enhanced partial redundancy elimination optimization can run away,
consuming all of the memory available on the host machine. This
parameter sets a limit on the length of the sets that are computed,
which prevents the runaway behavior. Setting a value of 0 for
this parameter allows an unlimited set length.
<br><dt><code>sccvn-max-scc-size</code><dd>Maximum size of a strongly connected component (SCC) during SCCVN
processing. If this limit is hit, SCCVN processing for the whole
function is not done and optimizations depending on it are
disabled. The default maximum SCC size is 10000.
<br><dt><code>sccvn-max-alias-queries-per-access</code><dd>Maximum number of alias-oracle queries we perform when looking for
redundancies for loads and stores. If this limit is hit the search
is aborted and the load or store is not considered redundant. The
number of queries is algorithmically limited to the number of
stores on all paths from the load to the function entry.
The default maxmimum number of queries is 1000.
<br><dt><code>ira-max-loops-num</code><dd>IRA uses regional register allocation by default. If a function
contains more loops than the number given by this parameter, only at most
the given number of the most frequently-executed loops form regions
for regional register allocation. The default value of the
parameter is 100.
<br><dt><code>ira-max-conflict-table-size</code><dd>Although IRA uses a sophisticated algorithm to compress the conflict
table, the table can still require excessive amounts of memory for
huge functions. If the conflict table for a function could be more
than the size in MB given by this parameter, the register allocator
instead uses a faster, simpler, and lower-quality
algorithm that does not require building a pseudo-register conflict table.
The default value of the parameter is 2000.
<br><dt><code>ira-loop-reserved-regs</code><dd>IRA can be used to evaluate more accurate register pressure in loops
for decisions to move loop invariants (see <samp><span class="option">-O3</span></samp>). The number
of available registers reserved for some other purposes is given
by this parameter. The default value of the parameter is 2, which is
the minimal number of registers needed by typical instructions.
This value is the best found from numerous experiments.
<br><dt><code>lra-inheritance-ebb-probability-cutoff</code><dd>LRA tries to reuse values reloaded in registers in subsequent insns.
This optimization is called inheritance. EBB is used as a region to
do this optimization. The parameter defines a minimal fall-through
edge probability in percentage used to add BB to inheritance EBB in
LRA. The default value of the parameter is 40. The value was chosen
from numerous runs of SPEC2000 on x86-64.
<br><dt><code>loop-invariant-max-bbs-in-loop</code><dd>Loop invariant motion can be very expensive, both in compilation time and
in amount of needed compile-time memory, with very large loops. Loops
with more basic blocks than this parameter won't have loop invariant
motion optimization performed on them. The default value of the
parameter is 1000 for <samp><span class="option">-O1</span></samp> and 10000 for <samp><span class="option">-O2</span></samp> and above.
<br><dt><code>loop-max-datarefs-for-datadeps</code><dd>Building data dapendencies is expensive for very large loops. This
parameter limits the number of data references in loops that are
considered for data dependence analysis. These large loops are no
handled by the optimizations using loop data dependencies.
The default value is 1000.
<br><dt><code>max-vartrack-size</code><dd>Sets a maximum number of hash table slots to use during variable
tracking dataflow analysis of any function. If this limit is exceeded
with variable tracking at assignments enabled, analysis for that
function is retried without it, after removing all debug insns from
the function. If the limit is exceeded even without debug insns, var
tracking analysis is completely disabled for the function. Setting
the parameter to zero makes it unlimited.
<br><dt><code>max-vartrack-expr-depth</code><dd>Sets a maximum number of recursion levels when attempting to map
variable names or debug temporaries to value expressions. This trades
compilation time for more complete debug information. If this is set too
low, value expressions that are available and could be represented in
debug information may end up not being used; setting this higher may
enable the compiler to find more complex debug expressions, but compile
time and memory use may grow. The default is 12.
<br><dt><code>min-nondebug-insn-uid</code><dd>Use uids starting at this parameter for nondebug insns. The range below
the parameter is reserved exclusively for debug insns created by
<samp><span class="option">-fvar-tracking-assignments</span></samp>, but debug insns may get
(non-overlapping) uids above it if the reserved range is exhausted.
<br><dt><code>ipa-sra-ptr-growth-factor</code><dd>IPA-SRA replaces a pointer to an aggregate with one or more new
parameters only when their cumulative size is less or equal to
<samp><span class="option">ipa-sra-ptr-growth-factor</span></samp> times the size of the original
pointer parameter.
<br><dt><code>sra-max-scalarization-size-Ospeed</code><br><dt><code>sra-max-scalarization-size-Osize</code><dd>The two Scalar Reduction of Aggregates passes (SRA and IPA-SRA) aim to
replace scalar parts of aggregates with uses of independent scalar
variables. These parameters control the maximum size, in storage units,
of aggregate which is considered for replacement when compiling for
speed
(<samp><span class="option">sra-max-scalarization-size-Ospeed</span></samp>) or size
(<samp><span class="option">sra-max-scalarization-size-Osize</span></samp>) respectively.
<br><dt><code>tm-max-aggregate-size</code><dd>When making copies of thread-local variables in a transaction, this
parameter specifies the size in bytes after which variables are
saved with the logging functions as opposed to save/restore code
sequence pairs. This option only applies when using
<samp><span class="option">-fgnu-tm</span></samp>.
<br><dt><code>graphite-max-nb-scop-params</code><dd>To avoid exponential effects in the Graphite loop transforms, the
number of parameters in a Static Control Part (SCoP) is bounded. The
default value is 10 parameters. A variable whose value is unknown at
compilation time and defined outside a SCoP is a parameter of the SCoP.
<br><dt><code>graphite-max-bbs-per-function</code><dd>To avoid exponential effects in the detection of SCoPs, the size of
the functions analyzed by Graphite is bounded. The default value is
100 basic blocks.
<br><dt><code>loop-block-tile-size</code><dd>Loop blocking or strip mining transforms, enabled with
<samp><span class="option">-floop-block</span></samp> or <samp><span class="option">-floop-strip-mine</span></samp>, strip mine each
loop in the loop nest by a given number of iterations. The strip
length can be changed using the <samp><span class="option">loop-block-tile-size</span></samp>
parameter. The default value is 51 iterations.
<br><dt><code>loop-unroll-jam-size</code><dd>Specify the unroll factor for the <samp><span class="option">-floop-unroll-and-jam</span></samp> option. The
default value is 4.
<br><dt><code>loop-unroll-jam-depth</code><dd>Specify the dimension to be unrolled (counting from the most inner loop)
for the <samp><span class="option">-floop-unroll-and-jam</span></samp>. The default value is 2.
<br><dt><code>ipa-cp-value-list-size</code><dd>IPA-CP attempts to track all possible values and types passed to a function's
parameter in order to propagate them and perform devirtualization.
<samp><span class="option">ipa-cp-value-list-size</span></samp> is the maximum number of values and types it
stores per one formal parameter of a function.
<br><dt><code>ipa-cp-eval-threshold</code><dd>IPA-CP calculates its own score of cloning profitability heuristics
and performs those cloning opportunities with scores that exceed
<samp><span class="option">ipa-cp-eval-threshold</span></samp>.
<br><dt><code>ipa-cp-recursion-penalty</code><dd>Percentage penalty the recursive functions will receive when they
are evaluated for cloning.
<br><dt><code>ipa-cp-single-call-penalty</code><dd>Percentage penalty functions containg a single call to another
function will receive when they are evaluated for cloning.
<br><dt><code>ipa-max-agg-items</code><dd>IPA-CP is also capable to propagate a number of scalar values passed
in an aggregate. <samp><span class="option">ipa-max-agg-items</span></samp> controls the maximum
number of such values per one parameter.
<br><dt><code>ipa-cp-loop-hint-bonus</code><dd>When IPA-CP determines that a cloning candidate would make the number
of iterations of a loop known, it adds a bonus of
<samp><span class="option">ipa-cp-loop-hint-bonus</span></samp> to the profitability score of
the candidate.
<br><dt><code>ipa-cp-array-index-hint-bonus</code><dd>When IPA-CP determines that a cloning candidate would make the index of
an array access known, it adds a bonus of
<samp><span class="option">ipa-cp-array-index-hint-bonus</span></samp> to the profitability
score of the candidate.
<br><dt><code>ipa-max-aa-steps</code><dd>During its analysis of function bodies, IPA-CP employs alias analysis
in order to track values pointed to by function parameters. In order
not spend too much time analyzing huge functions, it gives up and
consider all memory clobbered after examining
<samp><span class="option">ipa-max-aa-steps</span></samp> statements modifying memory.
<br><dt><code>lto-partitions</code><dd>Specify desired number of partitions produced during WHOPR compilation.
The number of partitions should exceed the number of CPUs used for compilation.
The default value is 32.
<br><dt><code>lto-minpartition</code><dd>Size of minimal partition for WHOPR (in estimated instructions).
This prevents expenses of splitting very small programs into too many
partitions.
<br><dt><code>cxx-max-namespaces-for-diagnostic-help</code><dd>The maximum number of namespaces to consult for suggestions when C++
name lookup fails for an identifier. The default is 1000.
<br><dt><code>sink-frequency-threshold</code><dd>The maximum relative execution frequency (in percents) of the target block
relative to a statement's original block to allow statement sinking of a
statement. Larger numbers result in more aggressive statement sinking.
The default value is 75. A small positive adjustment is applied for
statements with memory operands as those are even more profitable so sink.
<br><dt><code>max-stores-to-sink</code><dd>The maximum number of conditional stores paires that can be sunk. Set to 0
if either vectorization (<samp><span class="option">-ftree-vectorize</span></samp>) or if-conversion
(<samp><span class="option">-ftree-loop-if-convert</span></samp>) is disabled. The default is 2.
<br><dt><code>allow-store-data-races</code><dd>Allow optimizers to introduce new data races on stores.
Set to 1 to allow, otherwise to 0. This option is enabled by default
at optimization level <samp><span class="option">-Ofast</span></samp>.
<br><dt><code>case-values-threshold</code><dd>The smallest number of different values for which it is best to use a
jump-table instead of a tree of conditional branches. If the value is
0, use the default for the machine. The default is 0.
<br><dt><code>tree-reassoc-width</code><dd>Set the maximum number of instructions executed in parallel in
reassociated tree. This parameter overrides target dependent
heuristics used by default if has non zero value.
<br><dt><code>sched-pressure-algorithm</code><dd>Choose between the two available implementations of
<samp><span class="option">-fsched-pressure</span></samp>. Algorithm 1 is the original implementation
and is the more likely to prevent instructions from being reordered.
Algorithm 2 was designed to be a compromise between the relatively
conservative approach taken by algorithm 1 and the rather aggressive
approach taken by the default scheduler. It relies more heavily on
having a regular register file and accurate register pressure classes.
See <samp><span class="file">haifa-sched.c</span></samp> in the GCC sources for more details.
<p>The default choice depends on the target.
<br><dt><code>max-slsr-cand-scan</code><dd>Set the maximum number of existing candidates that are considered when
seeking a basis for a new straight-line strength reduction candidate.
<br><dt><code>asan-globals</code><dd>Enable buffer overflow detection for global objects. This kind
of protection is enabled by default if you are using
<samp><span class="option">-fsanitize=address</span></samp> option.
To disable global objects protection use <samp><span class="option">--param asan-globals=0</span></samp>.
<br><dt><code>asan-stack</code><dd>Enable buffer overflow detection for stack objects. This kind of
protection is enabled by default when using<samp><span class="option">-fsanitize=address</span></samp>.
To disable stack protection use <samp><span class="option">--param asan-stack=0</span></samp> option.
<br><dt><code>asan-instrument-reads</code><dd>Enable buffer overflow detection for memory reads. This kind of
protection is enabled by default when using <samp><span class="option">-fsanitize=address</span></samp>.
To disable memory reads protection use
<samp><span class="option">--param asan-instrument-reads=0</span></samp>.
<br><dt><code>asan-instrument-writes</code><dd>Enable buffer overflow detection for memory writes. This kind of
protection is enabled by default when using <samp><span class="option">-fsanitize=address</span></samp>.
To disable memory writes protection use
<samp><span class="option">--param asan-instrument-writes=0</span></samp> option.
<br><dt><code>asan-memintrin</code><dd>Enable detection for built-in functions. This kind of protection
is enabled by default when using <samp><span class="option">-fsanitize=address</span></samp>.
To disable built-in functions protection use
<samp><span class="option">--param asan-memintrin=0</span></samp>.
<br><dt><code>asan-use-after-return</code><dd>Enable detection of use-after-return. This kind of protection
is enabled by default when using <samp><span class="option">-fsanitize=address</span></samp> option.
To disable use-after-return detection use
<samp><span class="option">--param asan-use-after-return=0</span></samp>.
<br><dt><code>asan-instrumentation-with-call-threshold</code><dd>If number of memory accesses in function being instrumented
is greater or equal to this number, use callbacks instead of inline checks.
E.g. to disable inline code use
<samp><span class="option">--param asan-instrumentation-with-call-threshold=0</span></samp>.
<br><dt><code>chkp-max-ctor-size</code><dd>Static constructors generated by Pointer Bounds Checker may become very
large and significantly increase compile time at optimization level
<samp><span class="option">-O1</span></samp> and higher. This parameter is a maximum nubmer of statements
in a single generated constructor. Default value is 5000.
<br><dt><code>max-fsm-thread-path-insns</code><dd>Maximum number of instructions to copy when duplicating blocks on a
finite state automaton jump thread path. The default is 100.
<br><dt><code>max-fsm-thread-length</code><dd>Maximum number of basic blocks on a finite state automaton jump thread
path. The default is 10.
<br><dt><code>max-fsm-thread-paths</code><dd>Maximum number of new jump thread paths to create for a finite state
automaton. The default is 50.
</dl>
</dl>
</body></html>
``` |
Victor Golovatenco (born 28 April 1984) is a former Moldovan footballer.
International career
Golovatenco has made 79 appearances for the senior Moldova national football team, scoring three goals. He ranks second in terms of all-time appearances for Moldova. He has played for Moldova in the UEFA Euro 2008 qualifying, UEFA Euro 2012 qualifying and UEFA Euro 2016 qualifying, as well as the 2010 FIFA World Cup qualification, 2014 FIFA World Cup qualification and 2018 FIFA World Cup qualification.
Career statistics
International
As of 26 March 2021
Scores and results list Moldova's goal tally first.
References
External links
1984 births
Living people
Moldovan men's footballers
Moldovan expatriate men's footballers
Moldovan expatriate sportspeople in Russia
Moldova men's international footballers
Expatriate men's footballers in Russia
Men's association football defenders
FC Sheriff Tiraspol players
Moldovan Super Liga players
FC Tiraspol players
Footballers from Chișinău
FC Khimki players
FC Kuban Krasnodar players
Russian Premier League players
FC Sibir Novosibirsk players
Russian First League players
CSF Bălți players
FC Zimbru Chișinău players |
Cecilia Lonning-Skovgaard (born November 21, 1975) is a Danish businesswoman and politician, who since January 1, 2018 has been Mayor of Employment and Integration in the Municipality of Copenhagen, elected for the Liberal Party, Venstre.
She has been a member of the Copenhagen City Council since 2008, and was her party’s lead candidate at the municipal elections in Copenhagen in 2017.
Her latest job in the private sector was as Senior Director within HR at Ørsted A/S.
Cecilia Lonning-Skovgaard is married and the mother of three children, and lives in Østerbro.
Education and private sector career
Cecilia Lonning-Skovgaard grew up in Hellerup, attended Krebs' Skole, and earned her Danish Master’s Degree in 2001 as cand.scient.pol. (MSc in Political Science) from the University of Aarhus.
She was the second female recipient of the Crown Prince Frederik Scholarship, making it possible for her to attend and complete a Master of Public Administration degree at the Kennedy School of Government at Harvard (2000).
She has been employed at McKinsey, Carlsberg, Codan and Ørsted A/S.
Political career
She first ran as a candidate at the municipal elections in 2005, resulting in a position as second alternate member. After Martin Geertsen and Søren Pind both chose to step down, she entered the City Council in April 2008.
From 2008 to 2013 she was a member of the Children’s and Youth Committee. From 2014 she was a member of the Employment and Integration Committee and her party’s political spokesperson in the City Council.
In September 2016 she was elected lead candidate of the Liberal Party for the municipal elections in 2017. The elections in 2017 ended with Cecilia Lonning-Skovgaard assuming the position as Mayor of Employment and Integration in 2018-2021.
References
21st-century Danish women politicians
Politicians from Copenhagen
Aarhus University alumni
Harvard Kennedy School alumni
1975 births
Living people
21st-century Copenhagen City Council members |
The 1973–74 Copa del Generalísimo was the 72nd staging of the Spanish Cup. The competition began on 26 September 1973 and concluded on 28 June 1974 with the final.
First round
|}
Bye: CD Guecho, CF Calella, UD Mahón and CD Ensidesa.
Second round
|}
Third round
|}
Fourth round
|}
Bye: CD Sabadell CF and Sporting de Gijón.
Fifth round
|}
Round of 16
|}
Quarter-finals
|}
Semi-finals
|}
Final
|}
References
External links
rsssf.com
linguasport.com
1974
Copa del Rey
Copa |
```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.baomidou.mybatisplus.core.toolkit.support;
import java.lang.invoke.MethodHandle;
import java.lang.invoke.MethodHandleProxies;
import java.lang.invoke.MethodHandles;
import java.lang.reflect.Executable;
import java.lang.reflect.Proxy;
/**
* IDEA Evaluate Lambda
* <p>
* Create by hcl at 2021/5/17
*/
public class IdeaProxyLambdaMeta implements LambdaMeta {
private final Class<?> clazz;
private final String name;
public IdeaProxyLambdaMeta(Proxy func) {
MethodHandle dmh = MethodHandleProxies.wrapperInstanceTarget(func);
Executable executable = MethodHandles.reflectAs(Executable.class, dmh);
clazz = executable.getDeclaringClass();
name = executable.getName();
}
@Override
public String getImplMethodName() {
return name;
}
@Override
public Class<?> getInstantiatedClass() {
return clazz;
}
@Override
public String toString() {
return clazz.getSimpleName() + "::" + name;
}
}
``` |
Łęgajny is a village in the administrative district of Gmina Barczewo, within Olsztyn County, Warmian-Masurian Voivodeship, in northern Poland. It lies approximately south-west of Barczewo and north-east of the regional capital Olsztyn.
References
Villages in Olsztyn County |
is a Japanese actress and fashion model represented by Stardust Promotion.
Biography
Araki was recruited when she was in elementary school. Her first leading film role was Ikari o Nagero in May 2008. Araki became an exclusive model for the magazine non-no in 2014.
Her first leading television drama role was the Fuji Television drama Love Love Alien in 2016. Araki's skills are playing the euphonium and trumpet.
She voiced Gabby Gabby in the Japanese dub of Toy Story 4.
Filmography
Films
TV dramas
TV series
Stage
Advertisements
Music videos
Advertising
Internet
Magazines
Accolades
She was honoured with Excellence Award at 2020 Asia Contents Awards & Global OTT Awards for her work in the industry.
Notes
References
External links
-
-
1993 births
Living people
Actresses from Tokyo
Japanese female models
Japanese film actresses
Japanese stage actresses
Japanese television actresses
Stardust Promotion artists
21st-century Japanese actresses
Models from Tokyo Metropolis
Asia Contents Awards & Global OTT Awards winners |
The Gsieser Bach ( ) is a stream in South Tyrol, Italy. It flows into the Rienz in Welsberg.
References
Information about the Gsieser Bach in German and Italian.
External links
Rivers of Italy
Rivers of South Tyrol |
, is a multimedia franchise celebrating the 20th anniversary of the Animax channel. An anime television series ran from October 1 to December 17, 2018. The project also includes a free-to-play mobile game that was launched on October 15, 2018 and shut down on January 31, 2019.
Plot
The series follows five girls who discover a way to travel to parallel universes using a radio. As they visit several universes, they discover that a cosmic force known only as the "Twilight" is invading and destroying the universes. One by one, they start to transform into magical girls called "Equalizers", and find themselves drawn into the war against the Twilight.
Characters
Media
Anime
Animax announced the project on March 22, 2018, as a celebration of the channel's 20th anniversary. The anime television series is directed by Jin Tamamura and Yūichi Abe and written by Shogo Yasukawa, based on a concept by Kotaro Uchikoshi. Hiroshi Yamamoto is credited for writing the series' "SF setting". The series is animated by Dandelion Animation Studio and Jūmonji. Character designs are provided by Masakazu Katsura and Hiroyuki Asada, who also serves as the series' concept artist. Hiroki Harada is adapting the character designs for animation. Akitomo Yamamoto, Koji Watanabe, and Yuki Kawashima serve as sub-character designers, with Yamamoto also serving as chief animation director. Susumu Imaishi, Koji Watanabe, and Sayaka Takase provide prop designs for the series, and Ryō Hirata and Yasuhiro Moriki also provide designs. Yusa Itō serves as art director at Kusanagi, while Haruko Nobori is the color key artist, Stanislas Brunet produces the imageboard art, and Akihiro Hirasawa is in charge of art setting. Atsushi Satou serves as the director of photography at Studio Shamrock. Hideaki Takeda produces the series' 3DCG, and Hiroto Morishita serves as sound director. The series is edited by Mai Hasegawa.
Ryu produced the series' music, and Kenji Itō composed the main theme song. The opening theme song, , is performed by Michi, and the ending theme song is a cover of Hideaki Tokunaga's song , performed by Ami Wajima.
The series ran from October 1 to December 17, 2018, for 12 episodes and was broadcast on Animax, Tokyo MX, and YTV. It is also available on multiple streaming services. Sentai Filmworks has licensed the series and is streaming it on Hidive. MVM Entertainment have acquired the series for distribution via Sentai Filmworks in the UK and Ireland.
Episode list
Game
The project also includes a free-to-play mobile game tie-in. The game shares the same writer, character designer, concept artist, composer, and main theme songwriter as the anime. The game was released on iOS and Android. The game's service closed on January 31, 2019, although an offline version retaining some features was then made available.
Reception
Previews
The anime series' first episode garnered mixed reviews from Anime News Network's staff during the Fall 2018 season previews. Nick Creamer was impressed by the script's "grace of dialogue and characterization" during the introduction of Asuka and her friends, and the Land of the Lustrous-esque fight choreography but felt the story was "mostly just functional", saying it "demonstrates promise in a variety of ways." James Beckett praised the Radio Research society concept and its slice-of-life aura in the first half but was put off by the second half when the cast shrugged off their supernatural encounter and downplayed its overall mystery, saying that it's worth checking out a few more episodes to see more potential in the premise and tell a captivating story. Theron Martin gave praise to the "mostly solid" technical merits and was intrigued by the multiple dimensions concept and meeting alternate versions of Asuka but was critical of her ensemble being made up of "standard girl-group personality archetypes", concluding with: "Basically, this isn't a knock-your-socks-off kind of debut, but it's just good and intriguing enough to merit a mild recommendation." Paul Jensen commended the conversation between both Asukas towards the end but was conflicted over the ensemble cast and its supposed camaraderie with each other and the alternate world visuals having a vibrant color palette but a poor CG action scene, concluding that: "As it stands, this episode is just intriguing enough to merit sticking around for a week or two, if only to find out what the heck is going on." Rebecca Silverman criticized the tryhard attempts at being "interesting and quirky" with its ideas feeling unnatural and the female cast having sparse characterizations but gave praise to "the contrasts between the two Asukas" and the missing little brother mystery. She concluded that: "I'm not quite intrigued enough to say that I'll definitely be giving this a second episode, but it does seem like it will be worth catching up with further down the line. If it can get past its too-obvious attempts to stand out, the story itself may make this worthwhile all on its own."
Series reception
Martin reviewed the complete anime series in 2019 and gave it an overall B grade. He felt the story had a "fairly standard plot construction" and was "heavy-handed" with its subject matter throughout the various world designs but gave it praise for allowing the cast to have "decent character growth" as the series progressed, solid artistic efforts in the other worlds and its use of CG and Tomoyo Kurosawa's performance as the different versions of Asuka. He concluded that "the season's late episodes bring together the balance of serious and goofy story elements well enough for the story to be effective as a tale of personal growth." Allen Moody, writing for THEM Anime Reviews, was positive towards the story of each girl confronting their personal issues in an alternate world but felt it was undercut by "ludicrous showdowns" with "CG-animated magical/mecha girl transformations" and action sequences.
Explanatory notes
References
External links
Android (operating system) games
Animax original programming
Anime and manga about parallel universes
Free-to-play video games
IOS games
Magical girl anime and manga
Masakazu Katsura
Sentai Filmworks
Sony Pictures Entertainment Japan franchises
Video games about parallel universes
Video games based on anime and manga
Video games developed in Japan |
Voyage d'Egypte et de Nubie (1755) records Frederic Louis Norden's extensive documentation and drawings of his voyage through Egypt in 1737–38. It contains some of the very first realistic drawings of Egyptian monuments and to this day remains a primary source for the looks of Egyptian monuments before widespread 19th and 20th-century tourism and excavations.
Composition and publication
The Royal Danish Academy of Sciences and Letters, under the order of Frederick V of Denmark, first published the book in 1755. Norden had already done some preliminary work, but got entangled in war-service for England. He died in France in 1742 of tuberculosis, before anything was ready. He left his documents and drawings to his friend.
Copperplates and test drawings
Mark Tuscher from Nuremberg made the drawings into copperplates for the publication.
Norden published some test drawings from his voyage in 1741, under the long name Drawings of Some Ruins and Colossal Statues at Thebes in Egypt, with an account of the same in a letter to the Royal Society.
Depiction of the Great Sphinx of Giza
A very often-used extract from this book is Norden's drawing of the Great Sphinx of Giza. As the first near-realistic drawing of the sphinx, he is the earliest known to draw the Sphinx with the nose missing. Although Richard Pococke in the same year visited and later published a stylish rendering (in A Description of the East and Some other Countries, 1743), he drew the Sphinx with the nose still on. Pococke's drawing is a faithful adoption of Cornelis de Bruijn's drawing of 1698 (Voyage to the Levant, 1702, English trans.), featuring only minor changes.
It is highly unlikely if the nose was still on that Norden out of free fantasy would leave it out. This drawing is often used to disprove the story that Napoleon I of France destroyed the nose of the Sphinx.
Publications of the book (or parts of it)
1741 – Drawings of some ruins and colossal statues...., The Royal Society, London.
1755 – Voyage d'Egypte et de Nubie, tome premier, The Royal Danish Academy of Sciences and Letters, Copenhagen.
1757 – Travels in Egypt & Nubia, 2 Volumes in 1, Lockyer Davis & Charles Reymer, London. (translated by Peter Templeman)
1757 – A compendium of the travels of F.L. Norden through Egypt and Nubia, J. Smith, Dublin.
1775 - Beskrivelse over Ægypten og Nubien, Copenhagen, translated by Jørgen Stauning. The first Danish translation of parts of the work.
1779 – F.L. Norden, Beschreibung seiner Reise durch Egypten und Nubien, Johann Ernst Meyer, Leipzig and Breslau.
1780 – The antiquities, natural history, ruins and other curiosities of Egypt, Nubia and Thebes. Exemplified in near two hundred drawings taken on the spot, Lockyer Davis, London.
1790 – Frederik Ludvig Nordens Reiser igiennem Ægypten og Nubien in Samling af de bedste og nyeste Reisebeskrivelser i et udførligt Udtog, vol. 2, Gyldendal, Copenhagen.
1792 – The antiquities, natural history, ruins, and other curiosities of Egypt, Nubia, and Thebes. Exemplified in near two hundred drawings, taken on the spot, Edward Jeffery, London.
1795–98 – Voyage d'Egypte et de Nubie, Nouvelle édition, Pierre Didot l'ainé, Paris. (notes and additions by L. Langlès) v.1, v.2
1800 – Atlas du voyage d'Egypte et de Nubie, Bibliothèque portative des voyages, tome XI, Lepetit, Paris.
1814 – The travels of Frederick Lewis Norden through Egypt and Nubia, Sydney's Press, New Haven.
See also
Egypt in the European imagination
External links
Danish Royal Library – Voyage d'Egypte et de Nubie
Danish Royal Library – Travels in Egypt & Nubia
Bibliothèque nationale de France (Gallica) – Voyage d'Egypte et de Nubie, tome premier, The Danish Royal Library, Copenhagen
Bibliothèque nationale de France (Gallica) – Travels in Egypt & Nubia, 2 Volumes in 1, Lockyer Davis & Charles Reymer, London
NYPL Digital Gallery – The antiquities, natural history, ruins and other curiosities of Egypt, Nubia and Thebes, Lockyer Davis, London
Oslo University – Voyage d'Egypte et de Nubie
1755 non-fiction books
Danish non-fiction books
Travel books
Egyptology books
Illustrated books
Frederick V of Denmark
Royal Danish Academy of Sciences and Letters
Books published posthumously
Great Sphinx of Giza |
```c++
///////////////////////////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////////////////////////
// Created : 2005-12-21
// Updated : 2005-12-21
// File : glm/gtx/orthonormalize.inl
///////////////////////////////////////////////////////////////////////////////////////////////////
namespace glm
{
template <typename T, precision P>
GLM_FUNC_QUALIFIER detail::tmat3x3<T, P> orthonormalize
(
const detail::tmat3x3<T, P>& m
)
{
detail::tmat3x3<T, P> r = m;
r[0] = normalize(r[0]);
float d0 = dot(r[0], r[1]);
r[1] -= r[0] * d0;
r[1] = normalize(r[1]);
float d1 = dot(r[1], r[2]);
d0 = dot(r[0], r[2]);
r[2] -= r[0] * d0 + r[1] * d1;
r[2] = normalize(r[2]);
return r;
}
template <typename T, precision P>
GLM_FUNC_QUALIFIER detail::tvec3<T, P> orthonormalize
(
const detail::tvec3<T, P>& x,
const detail::tvec3<T, P>& y
)
{
return normalize(x - y * dot(y, x));
}
}//namespace glm
``` |
```ruby
class MarkdownlintCli < Formula
desc "CLI for Node.js style checker and lint tool for Markdown files"
homepage "path_to_url"
url "path_to_url"
sha256 your_sha256_hash
license "MIT"
bottle do
rebuild 1
sha256 cellar: :any_skip_relocation, arm64_sonoma: your_sha256_hash
sha256 cellar: :any_skip_relocation, arm64_ventura: your_sha256_hash
sha256 cellar: :any_skip_relocation, arm64_monterey: your_sha256_hash
sha256 cellar: :any_skip_relocation, sonoma: your_sha256_hash
sha256 cellar: :any_skip_relocation, ventura: your_sha256_hash
sha256 cellar: :any_skip_relocation, monterey: your_sha256_hash
sha256 cellar: :any_skip_relocation, x86_64_linux: your_sha256_hash
end
depends_on "node"
def install
system "npm", "install", *std_npm_args
bin.install_symlink Dir["#{libexec}/bin/*"]
end
test do
(testpath/"test-bad.md").write <<~EOS
# Header 1
body
EOS
(testpath/"test-good.md").write <<~EOS
# Header 1
body
EOS
assert_match "MD022/blanks-around-headings Headings should be surrounded by blank lines",
shell_output("#{bin}/markdownlint #{testpath}/test-bad.md 2>&1", 1)
assert_empty shell_output("#{bin}/markdownlint #{testpath}/test-good.md")
end
end
``` |
Cyclocotyla is a genus of monogenean flatworms first described in 1821. It currently consists of one valid species, Cyclocotyla bellones, with all other former members reassigned to other genera. However, some consider that the genus is currently a taxon inquirendum.
The sole species C. bellones is notorious for being a hyperparasite. It dwells on the isopod parasite Ceratothoa parallela (among others of the same genus), which itself feeds on the fish Boops boops and Pagellus acarne.
However, in a 2022 study, it was found that the species was not truly an hyperparasite, since it did not feed on the crustacean but rather on the fish. The authors concluded "Cyclocotyla bellones is thus both an epibiont on the crustacean and a parasite of the fish. It could be considered a hyperparasite only in terms of location (it dwells on a parasite), but not in terms of nutrition (it does not feed on a parasite but on a host which is not a parasite)."
References
Animals described in 1823
Diclidophoridae |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.